IC Atlas · 3,747 readings

Adaptive optimization

Adam adjusts gradient-based updates using estimates of the gradient’s moments, providing a specific method for training with noisy gradients.

The linked paper offers a concrete comparison of optimization behavior and memory use across training settings.

Its reported advantages depend on the tested context, so the method is a comparison to examine rather than a universal optimization guarantee.

Sources and details

Adam: A Method for Stochastic Optimization

{
  "id": "source-001",
  "publication_dates": [
    "2014-12-22"
  ],
  "title": "Adam: A Method for Stochastic Optimization",
  "url": "https://arxiv.org/abs/1412.6980",
  "version_details": [
    "v1 2014-12-22; v9 2017-01-30; comments identify ICLR 2015."
  ]
}

Dates

{
  "year": 2015
}

Learning and search together

Policy and value networks combined with tree search achieve strong performance in Go.

Hybrid systems can combine learned evaluation and explicit search.

Performance in a fixed game does not establish general competence in open-ended business decisions.

A well-specified game enables expert data, self-play and search.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "id": "source-002",
  "publication_dates": [
    "2016-01-27"
  ],
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961",
  "version_details": [
    "Nature 529, 484–489; issue date 2016-01-28."
  ]
}

Dates

{
  "year": 2016
}

Rules, ambiguity and robot responsibility

Asimov’s robot fiction turns binding rules and their loopholes into moral and logical puzzles about responsibility.

The reading spans his 1940s robot stories and the 1950 I, Robot collection.

Use its fictional conflicts to ask whether written constraints settle responsibility when instructions still require interpretation.

The fictional comparison does not establish that rule lists can ensure safe AI behavior.

Sources and details

Asimov, Isaac

{
  "id": "source-003",
  "publication_dates": [
    "2026-09-07"
  ],
  "title": "Asimov, Isaac",
  "url": "https://sf-encyclopedia.com/entry/asimov_isaac",
  "version_details": [
    "Entry update; the fiction discussed began decades earlier."
  ]
}

Dates

{
  "year": 1950
}

Attention and transformers

This concept pairs a translation-alignment study with the Transformer architecture paper, whose preprints date to 2014 and 2017.

The sources present learned source–target alignment and an architecture organized around attention.

Their juxtaposition helps distinguish attention as a mechanism from a particular model design.

Read the pair as selected translation studies and an editorial comparison, rather than a complete history or a newly documented influence relationship.

Sources and details

Attention Is All You Need

{
  "id": "source-004",
  "publication_dates": [
    "2017-06-12"
  ],
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_details": [
    "v1 2017-06-12; v7 2023-08-02."
  ]
}

Neural Machine Translation by Jointly Learning to Align and Translate

{
  "id": "source-005",
  "publication_dates": [
    "2014-09-01"
  ],
  "title": "Neural Machine Translation by Jointly Learning to Align and Translate",
  "url": "https://arxiv.org/abs/1409.0473",
  "version_details": [
    "v1 2014-09-01; v7 2016-05-19; accepted for an ICLR 2015 oral presentation."
  ]
}

Dates

{
  "year": 2017
}

Learning internal representations

Propagating error derivatives through layered networks supports learning useful internal representations.

A trainable representation expands capabilities while making data and objective design central.

Gradients do not guarantee global optimality; earlier differentiation and neural-learning work matters.

The objective and network permit useful gradient-based updates.

Backpropagation efficiently applies the chain rule through a composed network to calculate derivatives of a loss with respect to parameters. An optimizer uses those derivatives to update the parameters. The 1986 learning-representations paper is one important anchor; the catalog also credits earlier reverse-mode and neural-network contributions by Linnainmaa and Werbos instead of claiming a single origin.

A network can improve the specified training loss while learning a shortcut that fails in use. Separate the derivative calculation, optimization procedure, objective and held-out evaluation; success at the first three does not establish the fourth.

Sources and details

Learning representations by back-propagating errors

{
  "id": "source-006",
  "publication_dates": [
    "1986-10-09"
  ],
  "title": "Learning representations by back-propagating errors",
  "url": "https://www.nature.com/articles/323533a0",
  "version_details": [
    "Nature 323, 533–536."
  ]
}

Taylor expansion of the accumulated rounding error

{
  "id": "source-007",
  "publication_dates": [
    "1976-06"
  ],
  "title": "Taylor expansion of the accumulated rounding error",
  "url": "https://link.springer.com/article/10.1007/BF01931367",
  "version_details": [
    "BIT Numerical Mathematics 16, 146–160."
  ]
}

Applications of advances in nonlinear sensitivity analysis

{
  "id": "source-008",
  "publication_dates": [
    "1982"
  ],
  "title": "Applications of advances in nonlinear sensitivity analysis",
  "url": "https://link.springer.com/chapter/10.1007/BFb0006203",
  "version_details": [
    "1982 citation/copyright; First Online 2005-01-01; Published field 2005-09-29."
  ]
}

Dates

{
  "year": 1986
}

MEDVi

MEDVi describes its telehealth service as connecting customers with clinicians and pharmacy partners.

Its April 2026 statement says it changed marketing practices following concerns about potentially AI-generated practitioner advertisements.

The FDA letter concerns medvi.io, which MEDVi attributes to an affiliate; the reviewed sources do not resolve that attribution.

Read the company response alongside the regulator’s dated concerns to examine marketing accountability, without treating either as proof of remediation or clinical effectiveness.

Sources and details

MEDVi - Personalized Telehealth Care: Official Communication

{
  "id": "source-009",
  "publication_dates": [
    "2026-04-08"
  ],
  "title": "MEDVi - Personalized Telehealth Care: Official Communication",
  "url": "https://home.medvi.org/communication",
  "version_details": [
    "Dated statement and live-page disclosures observed on 2026-10-06; no revision history shown."
  ]
}

MEDVi, LLC dba MEDVi - 721455 - 02/20/2026 | FDA

{
  "id": "source-010",
  "publication_dates": [
    "2026-02-20"
  ],
  "title": "MEDVi, LLC dba MEDVi - 721455 - 02/20/2026 | FDA",
  "url": "https://www.fda.gov/inspections-compliance-enforcement-and-criminal-investigations/warning-letters/medvi-llc-dba-medvi-721455-02202026",
  "version_details": [
    "Warning letter MARCS-CMS 721455, dated February 20, 2026, observed on 2026-10-06; no separate posting date established."
  ]
}

Dates

{
  "date_events": []
}

Recursion

Recursion describes a drug-discovery platform that combines experimental data, automation and AI.

Anne Carpenter’s 2022 account traces its early approach to CellProfiler and Cell Painting research.

The reviewed histories connect academic image-based profiling with company-scale discovery infrastructure and the later addition of Exscientia’s chemistry capabilities.

These company accounts establish stated methods and chronology, without independently demonstrating therapeutic benefit or claimed efficiency.

Sources and details

Our AI Drug Discovery & Development Story | Recursion

{
  "id": "source-011",
  "publication_dates": [],
  "title": "Our AI Drug Discovery & Development Story | Recursion",
  "url": "https://recursion.com/our-story",
  "version_details": [
    "Live timeline observed on 2026-10-06, with entries extending into 2026; no page publication or revision date shown."
  ]
}

Anne Carpenter's Vision for Recursion

{
  "id": "source-012",
  "publication_dates": [
    "2022-10-05"
  ],
  "title": "Anne Carpenter's Vision for Recursion",
  "url": "https://www.recursion.com/news/painting-the-picture-of-recursion-anne-carpenter-scientific-advisory-board-member",
  "version_details": [
    "Dated first-person article observed on 2026-10-06; the displayed author field is empty but the body identifies Carpenter."
  ]
}

Recursion Pharmaceuticals, Inc. - Board of Directors

{
  "id": "source-013",
  "publication_dates": [],
  "title": "Recursion Pharmaceuticals, Inc. - Board of Directors",
  "url": "https://ir.recursion.com/governance/board-of-directors",
  "version_details": [
    "Undated live governance page observed on 2026-10-06; biographies include later employment updates."
  ]
}

Recursion and Exscientia, two leaders in the AI drug discovery space, have officially combined to advance the industrialization of drug discovery

{
  "id": "source-014",
  "publication_dates": [
    "2024-11-20"
  ],
  "title": "Recursion and Exscientia, two leaders in the AI drug discovery space, have officially combined to advance the industrialization of drug discovery",
  "url": "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-two-leaders-ai-drug-discovery-space",
  "version_details": [
    "Release timestamp: November 20, 2024, 7:00 AM EST; observed on 2026-10-06."
  ]
}

Recursion and Exscientia Enter Definitive Agreement to Create a Global Technology-Enabled Drug Discovery Leader with End-to-End Capabilities

{
  "id": "source-015",
  "publication_dates": [
    "2024-08-08"
  ],
  "title": "Recursion and Exscientia Enter Definitive Agreement to Create a Global Technology-Enabled Drug Discovery Leader with End-to-End Capabilities",
  "url": "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-enter-definitive-agreement-create",
  "version_details": [
    "Release timestamp: August 8, 2024, 7:40 AM EDT; observed on 2026-10-06."
  ]
}

Our AI Drug Discovery & Development Story | Recursion

{
  "id": "source-016",
  "publication_dates": [],
  "title": "Our AI Drug Discovery & Development Story | Recursion",
  "url": "https://www.recursion.com/our-story",
  "version_details": [
    "Live page observed on 2026-10-06; content duplicates the admitted non-www story page."
  ]
}

FAQ | Recursion

{
  "id": "source-017",
  "publication_dates": [],
  "title": "FAQ | Recursion",
  "url": "https://www.recursion.com/faq",
  "version_details": [
    "Undated live FAQ observed on 2026-10-06."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Official company timeline dates founding to 2013-11-05.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://recursion.com/our-story",
        "https://www.recursion.com/news/painting-the-picture-of-recursion-anne-carpenter-scientific-advisory-board-member",
        "https://ir.recursion.com/governance/board-of-directors",
        "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-two-leaders-ai-drug-discovery-space",
        "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-enter-definitive-agreement-create"
      ],
      "year": 2013
    }
  ]
}

Jevons paradox

Efficiency can lower a resource service’s effective price enough to expand demand so much that total resource use rises, despite lower use per unit of service.

Backfire requires sufficiently strong demand and economy-wide responses; partial rebound need not erase savings. Prices, substitution, saturation, and policy matter.

Lower inference cost can stimulate additional uses. Aggregate electricity effects depend on demand, efficiency, displacement and constraints; the analogy alone is not evidence of increased electricity use.

Sources and details

The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)

{
  "id": "source-018",
  "publication_dates": [
    "1866"
  ],
  "title": "The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)",
  "url": "https://www.econlib.org/library/YPDBooks/Jevons/jvnCQ.html?chapter_num=9",
  "version_details": [
    "First publication 1865; served text explicitly identified as second edition, 1866."
  ]
}

The Coal Question — 1866 second edition, digital version 1.0

{
  "id": "source-019",
  "publication_dates": [
    "1866"
  ],
  "title": "The Coal Question — 1866 second edition, digital version 1.0",
  "url": "https://www.inist.org/Library/1865.Jevons.The_Coal_Question.Macmillan.pdf",
  "version_details": [
    "Second revised edition; digital version 1.0 prepared April 13, 2009. Filename contains 1865 but does not establish a first-edition scan."
  ]
}

Key Questions on Energy and AI — Executive summary (2026)

{
  "id": "source-020",
  "publication_dates": [
    "2026"
  ],
  "title": "Key Questions on Energy and AI — Executive summary (2026)",
  "url": "https://www.iea.org/reports/key-questions-on-energy-and-ai/executive-summary",
  "version_details": [
    "Report citation identifies 2026; not the separate April 2025 Energy and AI report."
  ]
}

Dates

{}

Artificial general intelligence

The linked AGI position paper proposes comparing systems by capability breadth, performance and autonomy.

Its framework makes the choice of definitions and benchmarks explicit when evaluating claims of progress.

Use the proposed taxonomy to structure comparisons without treating it as a consensus threshold or evidence that AGI already exists.

Sources and details

Levels of AGI for Operationalizing Progress on the Path to AGI

{
  "id": "source-024",
  "publication_dates": [
    "2023-11-04"
  ],
  "title": "Levels of AGI for Operationalizing Progress on the Path to AGI",
  "url": "https://arxiv.org/abs/2311.02462",
  "version_details": [
    "v1 2023-11-04; Proceedings of ICML 2024; v5 2025-09-24."
  ]
}

Dates

{}

Model hallucination

The summarization study examines generated content that is unsupported by the input document.

It makes source faithfulness a separate evaluation question from fluency and overlap-based scores.

Read its task-specific findings alongside InstructGPT’s remaining errors, without inferring a universal hallucination rate from either source.

Sources and details

On Faithfulness and Factuality in Abstractive Summarization

{
  "id": "source-025",
  "publication_dates": [
    "2020-07"
  ],
  "title": "On Faithfulness and Factuality in Abstractive Summarization",
  "url": "https://aclanthology.org/2020.acl-main.173/",
  "version_details": [
    "Proceedings of the 58th ACL; the inspected record supplies month-level dating."
  ]
}

Training language models to follow instructions with human feedback

{
  "id": "source-026",
  "publication_dates": [
    "2022-03-04"
  ],
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_details": [
    "v1 2022-03-04."
  ]
}

Dates

{}

Large language model

Large language models learn language patterns from extensive data for tasks including generation and question answering.

The GPT-3 study gives a concrete example of performing tasks from prompts and demonstrations without updating the model’s weights.

Compare that historical model study with the linked glossary’s terminology, while keeping model reliability and any universal size cutoff outside the evidence established here.

Sources and details

Generative AI glossary

{
  "id": "source-027",
  "publication_dates": [],
  "title": "Generative AI glossary",
  "url": "https://docs.cloud.google.com/docs/generative-ai/glossary",
  "version_details": [
    "Living documentation; last updated 2026-10-05 UTC."
  ]
}

Language Models are Few-Shot Learners

{
  "id": "source-028",
  "publication_dates": [
    "2020-05-28"
  ],
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_details": [
    "v1 2020-05-28; v4 2020-07-22."
  ]
}

Dates

{}

Low-rank adaptation

Low-rank adaptation is represented through the LoRA preprint submitted in 2021 and revised that October.

The method trains low-rank updates while keeping pretrained weights frozen.

It turns a broad fine-tuning question into a specific parameter-efficient adaptation method.

Its savings depend on the setup being tested, providing a concrete boundary for comparisons of adaptation methods.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "id": "source-029",
  "publication_dates": [
    "2021-06-17"
  ],
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_details": [
    "v1 2021-06-17; v2 2021-10-16."
  ]
}

Dates

{}

Model alignment

The linked studies examine shaping model behavior through human feedback and principle-guided AI feedback.

Their contrasting supervision methods make the source of judgments about desirable behavior a concrete research question.

Read the 2022 papers for those method-specific comparisons, since their reported improvements do not establish complete alignment or general safety.

Sources and details

Training language models to follow instructions with human feedback

{
  "id": "source-026",
  "publication_dates": [
    "2022-03-04"
  ],
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_details": [
    "v1 2022-03-04."
  ]
}

Constitutional AI: Harmlessness from AI Feedback

{
  "id": "source-030",
  "publication_dates": [
    "2022-12-15"
  ],
  "title": "Constitutional AI: Harmlessness from AI Feedback",
  "url": "https://arxiv.org/abs/2212.08073",
  "version_details": [
    "v1 2022-12-15."
  ]
}

Dates

{}

Retrieval-augmented generation

A method that retrieves relevant information from an external collection and uses it to condition a model's generated answer. It lets a system use information beyond what is stored in the model's parameters.

Retrieval can return irrelevant or incorrect evidence, and the generator can still misrepresent it; RAG does not eliminate hallucinations.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "authors": [
    "Patrick Lewis",
    "Ethan Perez",
    "Aleksandra Piktus",
    "Fabio Petroni",
    "Vladimir Karpukhin",
    "Naman Goyal",
    "Heinrich Küttler",
    "Mike Lewis",
    "Wen-tau Yih",
    "Tim Rocktäschel",
    "Sebastian Riedel",
    "Douwe Kiela"
  ],
  "id": "technical-rag-paper",
  "inspected_version": "arXiv v4, revised 2021-04-12",
  "source_type": "author-authored research paper in institutional preprint repository",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/html/2005.11401v4"
}

Dates

{}

Complete frozen source register; no lossy public-projection substitution

Reinforcement learning from human feedback

Human preference comparisons can guide reinforcement learning when a reward is difficult to specify directly.

The linked sources connect feedback on control-task trajectories with output rankings for instruction-following models.

Compare those supervision settings while keeping preference-based evaluation distinct from proof of truthfulness or universal human agreement.

Sources and details

Deep reinforcement learning from human preferences

{
  "id": "source-031",
  "publication_dates": [
    "2017-06-12"
  ],
  "title": "Deep reinforcement learning from human preferences",
  "url": "https://arxiv.org/abs/1706.03741",
  "version_details": [
    "v1 2017-06-12; v4 2023-02-17."
  ]
}

Training language models to follow instructions with human feedback

{
  "id": "source-026",
  "publication_dates": [
    "2022-03-04"
  ],
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_details": [
    "v1 2022-03-04."
  ]
}

Dates

{}

Neural scaling laws

The linked scaling studies fit empirical relationships between language-model loss, model size, training data and compute.

Their differing findings about compute allocation make the amount of training data central to a comparison of scaling choices.

Read those fits within their specified objectives and training regimes, since extrapolation and deployment-cost optimality require separate evidence.

Sources and details

Scaling Laws for Neural Language Models

{
  "id": "source-032",
  "publication_dates": [
    "2020-01-23"
  ],
  "title": "Scaling Laws for Neural Language Models",
  "url": "https://arxiv.org/abs/2001.08361",
  "version_details": [
    "v1 2020-01-23."
  ]
}

Training Compute-Optimal Large Language Models

{
  "id": "source-033",
  "publication_dates": [
    "2022-03-29"
  ],
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_details": [
    "v1 2022-03-29."
  ]
}

Dates

{}

Transformer

The original Transformer combines encoder and decoder attention stacks with position-wise networks.

Attention relates sequence positions, while positional encodings supply information about their order.

Its decoder masks future positions and generates the output sequence autoregressively.

Sources and details

Attention Is All You Need

{
  "authors": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "id": "technical-transformer-paper-2017",
  "inspected_version": "2017 proceedings PDF, 11 pages",
  "source_type": "conference-published original paper",
  "title": "Attention Is All You Need",
  "url": "https://papers.nips.cc/paper_files/paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"
}

Dates

{}

Complete frozen source register; no lossy public-projection substitution

Post-scarcity under AI Minds

Banks’s Culture fiction imagines an abundant interstellar society whose ships and habitats are governed by AI Minds.

Its setting provides a literary comparison for human agency and intervention under technological abundance.

This fictional setting provides an editorial comparison rather than a tested economic or governance model.

Sources and details

Banks, Iain M

{
  "id": "source-034",
  "publication_dates": [
    "2026-09-07"
  ],
  "title": "Banks, Iain M",
  "url": "https://sf-encyclopedia.com/entry/banks_iain_m",
  "version_details": [
    "Entry update; Consider Phlebas is listed as 1987."
  ]
}

Dates

{
  "year": 1987
}

Feedback and purpose

Rosenblueth, Wiener and Bigelow’s 1943 article studies behavior through input and output relations rather than internal structure.

In their restricted negative-feedback account, the difference between a system’s present state and its goal controls subsequent behavior.

Insufficient damping can cause repeated overshoot and growing oscillations, preventing the system from reaching its target.

The authors define teleological behavior in this error-controlled sense, separating it from a claim about final causes.

Sources and details

Behavior, Purpose and Teleology

{
  "access_scope": "Full eight-page university-hosted journal scan retrieved; title page and article pp.18–24 inspected. Scan includes a bibliographic cover page.",
  "dates": {
    "journal": "Philosophy of Science 10(1), 18–24",
    "original_publication": "1943-01",
    "scan_access_stamp": "2003-08-18"
  },
  "id": "diverse-N51-CYBER",
  "title": "Behavior, Purpose and Teleology",
  "url": "https://home.csulb.edu/~cwallis/382/readings/482/wiener.behavior.purpose.teleology.1943.pdf"
}

Dates

{
  "year": 1943
}

Full institutional scan pp.18–24; accepted mechanism, replaces prior excerpt limitation

Responsibility for a created mind

Frankenstein supplies a literary frame for responsibility toward a created being and society.

The linked publisher description concerns a 2017 annotated edition based on Shelley’s 1818 novel.

Its creator-centered questions can be compared editorially with Asimov’s fictional constraints on robots.

That comparison follows a literary interpretation, rather than treating the novel as a technical account of machine minds.

Sources and details

Frankenstein: Annotated for Scientists, Engineers, and Creators of All Kinds

{
  "id": "source-036",
  "publication_dates": [
    "2017-05-05"
  ],
  "title": "Frankenstein: Annotated for Scientists, Engineers, and Creators of All Kinds",
  "url": "https://mitpress.mit.edu/9780262533287/frankenstein/",
  "version_details": [
    "Paperback ISBN 9780262533287; ebook dated 2017-04-28."
  ]
}

Dates

{
  "year": 1818
}

Efficiency and rebound

This efficiency-and-rebound concept is anchored in Jevons’s coal argument and the linked 1866 edition of his 1865 work.

Jevons argues that cheaper coal-powered production can encourage enough additional activity to increase overall coal use.

Tracing resource use per unit through costs, output and total demand makes the proposed mechanism inspectable.

For present-day AI, that historical mechanism supplies a hypothesis to test rather than a universal prediction.

Sources and details

The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)

{
  "id": "source-018",
  "publication_dates": [
    "1866"
  ],
  "title": "The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)",
  "url": "https://www.econlib.org/library/YPDBooks/Jevons/jvnCQ.html?chapter_num=9",
  "version_details": [
    "First publication 1865; served text explicitly identified as second edition, 1866."
  ]
}

Dates

{
  "year": 1865
}

Learning over sequences

A memory architecture addresses difficulties learning dependencies over long time intervals.

Sequence learning predates transformers and opens applications beyond independent classification.

Long dependencies remain task- and training-dependent; memory is not human understanding.

Training can exploit the designed memory and gating structure.

Long short-term memory introduces a memory-cell architecture and mechanisms for controlling information flow through sequences. It addresses difficulties in learning dependencies across many steps. Memory in this technical sense is an architectural and training property, not a statement that a system preserves every fact faithfully or understands a sequence as a person does.

For a sequential prediction task, ask which dependencies need to persist and how performance changes with sequence length. Distinguish retained information in a learned state from reliable factual recall or an auditable record of earlier events.

Sources and details

Long Short-Term Memory

{
  "authors": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "id": "technical-lstm-paper",
  "inspected_version": "32-page author/institution-hosted manuscript bearing the 1997 journal citation; no revision date shown",
  "publication_date": "1997-11-15",
  "source_type": "original research article, author-institution-hosted manuscript",
  "title": "Long Short-Term Memory",
  "url": "https://www.bioinf.jku.at/publications/older/2604.pdf"
}

Learning to forget: continual prediction with LSTM

{
  "authors": [
    "Felix A. Gers",
    "Jürgen Schmidhuber",
    "Fred Cummins"
  ],
  "doi": "10.1162/089976600300015015",
  "id": "technical-forget-paper-abstract",
  "inspected_version": "Indexed journal abstract; earlier 1999 report and conference versions separately attested by author bibliography",
  "source_type": "indexed author-authored research abstract",
  "title": "Learning to forget: continual prediction with LSTM",
  "url": "https://pubmed.ncbi.nlm.nih.gov/11032042/"
}

Dates

{
  "year": 1997
}

Complete frozen source register; no lossy public-projection substitution

Hugging Face

Hugging Face provides a shared platform for machine-learning models, datasets and applications.

Its April 2025 Pollen Robotics acquisition announcement describes an extension of its open-robotics work from software toward hardware.

That combination makes the company a useful case for studying reuse and collaboration across AI tooling.

Compare the sharing of software artifacts with the company’s stated direction toward embodied experimentation.

Sources and details

Hugging Face to sell open-source robots thanks to Pollen Robotics acquisition 🤖

{
  "id": "source-037",
  "publication_dates": [
    "2025-04-14"
  ],
  "title": "Hugging Face to sell open-source robots thanks to Pollen Robotics acquisition 🤖",
  "url": "https://huggingface.co/blog/hugging-face-pollen-robotics-acquisition",
  "version_details": [
    "Dated company blog article observed on 2026-10-06; no revision history inspected."
  ]
}

Hugging Face | LinkedIn

{
  "id": "source-038",
  "publication_dates": [],
  "title": "Hugging Face | LinkedIn",
  "url": "https://www.linkedin.com/company/huggingface/",
  "version_details": [
    "Public profile observed on 2026-10-06; no publication or revision date for the founding field shown."
  ]
}

Hugging Face – The AI community building the future.

{
  "id": "source-039",
  "publication_dates": [],
  "title": "Hugging Face – The AI community building the future.",
  "url": "https://huggingface.co/",
  "version_details": [
    "Dynamic homepage observed on 2026-10-06; changing counts and trending content are excluded from the card."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Official company-managed LinkedIn founding year; corporate announcement verifies all three founders.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://huggingface.co/blog/hugging-face-pollen-robotics-acquisition",
        "https://www.linkedin.com/company/huggingface/"
      ],
      "year": 2016
    }
  ]
}

Databricks

Databricks describes an enterprise data-and-AI platform built around a lakehouse architecture.

Its platform positioning combines data management and governance with tools for AI applications.

Use the company’s reported origins as a case for tracing academic and open-source data systems into commercial AI infrastructure.

These platform and origins statements do not establish a complete founder roster.

Sources and details

Databricks Founders - Company Overview | Databricks

{
  "id": "source-040",
  "publication_dates": [],
  "title": "Databricks Founders - Company Overview | Databricks",
  "url": "https://www.databricks.com/company/founders",
  "version_details": [
    "Exact URL opened and re-opened on 2026-10-06; readable extraction contained navigation and footer but no founder biographies."
  ]
}

About Databricks: The data and AI company | Databricks

{
  "id": "source-041",
  "publication_dates": [],
  "title": "About Databricks: The data and AI company | Databricks",
  "url": "https://www.databricks.com/company/about-us",
  "version_details": [
    "Undated live about page observed on 2026-10-06."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Company founded 2013, distinct from preceding Apache Spark research.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.databricks.com/company/founders",
        "https://www.databricks.com/company/about-us"
      ],
      "year": 2013
    }
  ]
}

LangChain

LangChain developed from an open-source Python package into an agent-tooling ecosystem that includes LangGraph and the commercial LangSmith platform.

The reviewed chronology distinguishes the project’s 2022 origin from the company’s 2023 origin.

That transition offers a case for examining a commercial business built alongside open-source tools for observing, evaluating and deploying agents.

That lineage does not independently establish adoption, reliability or performance advantages.

Sources and details

About LangChain: an open platform to own your intelligence

{
  "id": "source-042",
  "publication_dates": [],
  "title": "About LangChain: an open platform to own your intelligence",
  "url": "https://www.langchain.com/about",
  "version_details": [
    "Undated live history observed on 2026-10-06; present-day product descriptions are distinct from the historical origin statements."
  ]
}

Reflections on Three Years of Building LangChain

{
  "id": "source-043",
  "publication_dates": [
    "2025-10-20"
  ],
  "title": "Reflections on Three Years of Building LangChain",
  "url": "https://www.langchain.com/blog/three-years-langchain",
  "version_details": [
    "Article by Harrison Chase dated October 20, 2025, observed on 2026-10-06."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Company started in February 2023 per founder retrospective; open-source LangChain Python package began in late 2022.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.langchain.com/about",
        "https://www.langchain.com/blog/three-years-langchain"
      ],
      "year": 2023
    }
  ]
}

Alibaba Group

Alibaba Group’s official history traces its 1999 business origin to eighteen people led by Jack Ma.

The reviewed material connects the technology group with Qwen language and multimodal models and AI cloud infrastructure.

Selected credits identify Eddie Yongming Wu as a co-founder and Joseph C. Tsai as a founding-team member within that wider group.

Read the group as a case for examining model development and infrastructure services within a technology business.

Sources and details

Alibaba Group — About Alibaba

{
  "id": "local-source-575eb517f237",
  "publication_dates": [],
  "title": "Alibaba Group — About Alibaba",
  "url": "https://www.alibabagroup.com/en-US/about-alibaba",
  "version_details": [
    "Dynamic company history; no revision history inspected."
  ]
}

Alibaba Group — HKEX filing dated 18 June 2026

{
  "id": "local-source-a77c02bedf8d",
  "publication_dates": [],
  "title": "Alibaba Group — HKEX filing dated 18 June 2026",
  "url": "https://www.hkexnews.hk/listedco/listconews/sehk/2026/0618/2026061800844.pdf",
  "version_details": [
    "2026-06-18 filing; reviewed for founding-team credit."
  ]
}

Alibaba Group — Leadership

{
  "id": "local-source-73bf854f47db",
  "publication_dates": [],
  "title": "Alibaba Group — Leadership",
  "url": "https://home.alibabagroup.com/en-US/about-alibaba-leadership-1637927598568767488",
  "version_details": [
    "Dynamic leadership page; no revision history inspected."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Official group history says established in 1999 by 18 people led by Jack Ma.",
      "date": "1999",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.alibabagroup.com/en-US/about-alibaba",
        "https://www.hkexnews.hk/listedco/listconews/sehk/2026/0618/2026061800844.pdf",
        "https://home.alibabagroup.com/en-US/about-alibaba-leadership-1637927598568767488"
      ],
      "year": 1999
    }
  ]
}

Tencent

Tencent’s company history dates its business origin to 1998.

Its reviewed company material describes an internet technology group developing Hy/Hunyuan foundation models and AI services.

Source-qualified co-founder credits include Ma Huateng, Zhang Zhidong, Xu Chenye, Chen Yidan and Zeng Liqing.

The company offers a case for studying model development inside an established internet business, with product claims attributed to the company.

Sources and details

Tencent — About Us

{
  "id": "local-source-1deb93dfeb4e",
  "publication_dates": [],
  "title": "Tencent — About Us",
  "url": "https://www.tencent.com/zh-hk/about.html",
  "version_details": [
    "Dynamic company history; no revision history inspected."
  ]
}

Tencent — Article supporting company co-founder credits

{
  "id": "local-source-e05671ab42ea",
  "publication_dates": [],
  "title": "Tencent — Article supporting company co-founder credits",
  "url": "https://www.tencent.com/en-us/articles/80153.html",
  "version_details": [
    "Article as reviewed; publication date not retained in supplied packet."
  ]
}

Tencent Hunyuan officially releases Hy3

{
  "id": "local-source-bb5ad1474984",
  "publication_dates": [],
  "title": "Tencent Hunyuan officially releases Hy3",
  "url": "https://www.tencent.com/tencent-hunyuan-officially-releases-hy3-advancing-agent-capabilities-and-deeper-product-integration/",
  "version_details": [
    "Announcement as reviewed; no revision history inspected."
  ]
}

Dates

{
  "date_events": [
    {
      "basis": "Company history explicitly states founded in 1998.",
      "date": "1998",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.tencent.com/zh-hk/about.html",
        "https://www.tencent.com/en-us/articles/80153.html",
        "https://www.tencent.com/tencent-hunyuan-officially-releases-hy3-advancing-agent-capabilities-and-deeper-product-integration/"
      ],
      "year": 1998
    }
  ]
}

Governing shared resources

Communities can develop workable institutions for shared resources beyond a simple market-versus-state choice.

Shared AI infrastructure invites questions about rule-making and monitoring, with resource differences explicit.

Design principles are not a universal template; digital data is not always a common-pool resource.

Rules, monitoring and local conditions shape collective action.

Sources and details

An Institutional Approach to the Study of Self-Organization and Self-Governance in CPR Situations

{
  "access_scope": "Only public Summary paragraphs and bibliographic information; full chapter access not obtained.",
  "authors": [
    "Elinor Ostrom"
  ],
  "doi": "10.1017/CBO9780511807763.004",
  "id": "economic-ostrom1990-ch2",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990",
  "title": "An Institutional Approach to the Study of Self-Organization and Self-Governance in CPR Situations",
  "url": "https://www.cambridge.org/core/books/abs/governing-the-commons/an-institutional-approach-to-the-study-of-selforganization-and-selfgovernance-in-cpr-situations/815061479E831FC11B3482789300BB65",
  "version_inspected": "Chapter 2 public summary, chapter listed as pp. 29–57"
}

A Framework for Analysis of Self-Organizing and Self-Governing CPRs

{
  "access_scope": "Only public Summary paragraphs and bibliographic information; full chapter access not obtained.",
  "authors": [
    "Elinor Ostrom"
  ],
  "doi": "10.1017/CBO9780511807763.008",
  "id": "economic-ostrom1990-ch6",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990",
  "title": "A Framework for Analysis of Self-Organizing and Self-Governing CPRs",
  "url": "https://www.cambridge.org/core/books/abs/governing-the-commons/framework-for-analysis-of-selforganizing-and-selfgoverning-cprs/05666795A13EFC6882C18E4E05C40166",
  "version_inspected": "Chapter 6 public summary, chapter listed as pp. 182–216"
}

Beyond Markets and States: Polycentric Governance of Complex Economic Systems

{
  "access_scope": "32-page PDF available; title/version statement, opening pp. 1–2 and section 4.E, printed pp. 12–13, inspected. Paraphrase notes only; no direct quotations from draft.",
  "authors": [
    "Elinor Ostrom"
  ],
  "date_qualification": "Repository assigns year 2009; exact revision date is unspecified. It must not be labeled the final 2009 lecture or 2010 American Economic Review version.",
  "id": "economic-ostrom2009-revised-draft",
  "original_presentation_date": "2009-12-08",
  "publication_date": null,
  "title": "Beyond Markets and States: Polycentric Governance of Complex Economic Systems",
  "url": "https://dlc.dlib.indiana.edu/dlc/bitstreams/0a7a52e6-8cf0-42c3-ae20-776095e6fd1d/download",
  "version_date": null,
  "version_inspected": "Revised Nobel lecture draft, marked DRAFT—DO NOT QUOTE, prepared for forthcoming October 2010 yearbook"
}

Dates

{
  "year": 1990
}

Complete frozen source register; no lossy public-projection substitution

Ashish Vaswani

Ashish Vaswani is connected here to the collaborative Transformer architecture project and its 2017 paper.

The contribution note credits Vaswani and Illia Polosukhin with designing and implementing the initial Transformer models.

The paper states equal contribution and randomized author order, putting the documented role within a team effort.

This specific credit provides an entry into the architecture’s design history rather than an undifferentiated author list.

Sources and details

Attention Is All You Need

{
  "id": "source-044",
  "publication_dates": [
    "2017-06-12"
  ],
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/html/1706.03762v7",
  "version_details": [
    "HTML explicitly displays v7, 2023-08-02; initial date verified in the paired arXiv abstract record."
  ]
}

Attention Is All You Need

{
  "id": "source-004",
  "publication_dates": [
    "2017-06-12"
  ],
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_details": [
    "v1 2017-06-12; v7 2023-08-02."
  ]
}

Dates

{}

Edward J. Hu

Edward J. Hu is a listed coauthor of the 2021 LoRA preprint.

The collaborative work studies a parameter-efficient adaptation method that keeps pretrained weights frozen while training low-rank updates.

Its method provides a specific comparison with full fine-tuning, rather than treating every way of adapting a model as equivalent.

Read the paper to examine that adaptation mechanism within the team’s contribution to parameter-efficient research.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "id": "source-029",
  "publication_dates": [
    "2021-06-17"
  ],
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_details": [
    "v1 2021-06-17; v2 2021-10-16."
  ]
}

Dates

{}

Elinor Ostrom

Elinor Ostrom authored Governing the Commons, first printed in 1990.

Her account of self-governance recognizes the problem of free riding and the possible need for outside assistance.

The design principles in her revised lecture draft describe recurring institutional features rather than identical rules for every local setting.

Sources and details

Governing the Commons: The Evolution of Institutions for Collective Action

{
  "access_scope": "Book description, author, dates and contents inspected; complete book not accessed.",
  "authors": [
    "Elinor Ostrom"
  ],
  "date_qualification": "Print year is corroborated by chapter metadata; online 2012 date is not original publication. This does not certify the latest available edition.",
  "doi": "10.1017/CBO9780511807763",
  "id": "economic-ostrom1990-catalog",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990-11-30",
  "title": "Governing the Commons: The Evolution of Institutions for Collective Action",
  "url": "https://www.cambridge.org/core/books/governing-the-commons/7AB7AE11BADA84409C34815CC288CD79",
  "version_date": "2012-06-05",
  "version_inspected": "Cambridge Core entry for original print book and 2012 digital issue"
}

An Institutional Approach to the Study of Self-Organization and Self-Governance in CPR Situations

{
  "access_scope": "Only public Summary paragraphs and bibliographic information; full chapter access not obtained.",
  "authors": [
    "Elinor Ostrom"
  ],
  "doi": "10.1017/CBO9780511807763.004",
  "id": "economic-ostrom1990-ch2",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990",
  "title": "An Institutional Approach to the Study of Self-Organization and Self-Governance in CPR Situations",
  "url": "https://www.cambridge.org/core/books/abs/governing-the-commons/an-institutional-approach-to-the-study-of-selforganization-and-selfgovernance-in-cpr-situations/815061479E831FC11B3482789300BB65",
  "version_inspected": "Chapter 2 public summary, chapter listed as pp. 29–57"
}

Beyond Markets and States: Polycentric Governance of Complex Economic Systems

{
  "access_scope": "32-page PDF available; title/version statement, opening pp. 1–2 and section 4.E, printed pp. 12–13, inspected. Paraphrase notes only; no direct quotations from draft.",
  "authors": [
    "Elinor Ostrom"
  ],
  "date_qualification": "Repository assigns year 2009; exact revision date is unspecified. It must not be labeled the final 2009 lecture or 2010 American Economic Review version.",
  "id": "economic-ostrom2009-revised-draft",
  "original_presentation_date": "2009-12-08",
  "publication_date": null,
  "title": "Beyond Markets and States: Polycentric Governance of Complex Economic Systems",
  "url": "https://dlc.dlib.indiana.edu/dlc/bitstreams/0a7a52e6-8cf0-42c3-ae20-776095e6fd1d/download",
  "version_date": null,
  "version_inspected": "Revised Nobel lecture draft, marked DRAFT—DO NOT QUOTE, prepared for forthcoming October 2010 yearbook"
}

Dates

{}

Complete frozen source register; no lossy public-projection substitution

Herbert A. Simon

Presented Logic Theory Machine and human protocols at Dartmouth.

Explained organizations as structures that help people cope with limits of comprehension and computation under complexity.

Credited in Organizations

Credited in Rational Decision-Making in Business Organizations

Credited in Computer Science as Empirical Inquiry: Symbols and Search

Author of The Sciences of the Artificial

Named source author of The Shape of Automation for Men and Management

Sources and details

Rational Decision Making in Business Organizations

{
  "access_scope": "PDF text inspected: author/title, section II, especially Mechanisms of Bounded Rationality, and section IV discussion of search. This is not a final-publication collation.",
  "authors": [
    "Herbert A. Simon"
  ],
  "date_qualification": "CMU catalog dates the item January 1, 1979 as archival metadata. The artifact itself bears later printer dates. Nobel lecture delivery is December 8, 1978, independently identified in Nobel search-index metadata; direct Nobel page/PDF fetches failed.",
  "id": "economic-simon1979-galley",
  "original_presentation_date": "1978-12-08",
  "publication_date": "1979",
  "title": "Rational Decision Making in Business Organizations",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00082_fld06591_bdl0004_doc0001/Simon_box00082_fld06591_bdl0004_doc0001.pdf",
  "version_date": "1979-05-02",
  "version_inspected": "33-page archival galley with manuscript marks, printer dates 04-30-79 and 5-2-79; not the final Nobel PDF"
}

The Sciences of the Artificial

{
  "access_scope": "Title/byline and edition/format blocks inspected; book text not inspected.",
  "authors": [
    "Herbert A. Simon"
  ],
  "date_qualification": "Page lists ISBN 9780262190510 with January 15, 1969; several other formats with September 26, 1996; paperback 9780262690232 with January 15, 1970. Do not collapse these into one edition date or claim that the 1969 ISBN is itself the third edition.",
  "id": "economic-simon-mit-credit",
  "publication_date": "1969-01-15",
  "title": "The Sciences of the Artificial",
  "url": "https://mitpress.mit.edu/9780262190510/the-sciences-of-the-artificial/",
  "version_date": null,
  "version_inspected": "Live MIT Press catalog page headed third edition, with multiple ISBN/date blocks"
}

Dates

{}

Complete frozen source register; no lossy public-projection substitution

William Stanley Jevons

William Stanley Jevons is the author of The Coal Question, first published in 1865 and linked here through its 1866 edition.

He connects fuel-saving improvements with the expansion of coal-dependent industry.

The attributed text provides a direct route to the coal argument behind later uses of his name.

Read it to distinguish Jevons’s historical argument from contemporary applications of rebound reasoning.

Sources and details

The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)

{
  "id": "source-018",
  "publication_dates": [
    "1866"
  ],
  "title": "The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)",
  "url": "https://www.econlib.org/library/YPDBooks/Jevons/jvnCQ.html?chapter_num=9",
  "version_details": [
    "First publication 1865; served text explicitly identified as second edition, 1866."
  ]
}

Dates

{}

Ronald H. Coase

Ronald H. Coase authored The Nature of the Firm.

His account treats finding prices and negotiating contracts as costs of using markets.

At the boundary of the firm, an additional internally coordinated transaction is compared with market exchange or organization by another firm.

Sources and details

The Nature of the Firm

{
  "access_scope": "Full article HTML available; sections I–II inspected closely, with primary claims in II. Original-page PDF text also inspected at journal pp. 390–395. No claim that every footnote was reviewed.",
  "authors": [
    "R. H. Coase"
  ],
  "date_qualification": "Wiley explicitly gives first publication as November 1937; a contemporary crawl date is not a revision date.",
  "doi": "10.1111/j.1468-0335.1937.tb00002.x",
  "id": "economic-coase1937",
  "publication": "Economica, new series 4(16), 386–405",
  "publication_date": "1937-11",
  "title": "The Nature of the Firm",
  "url": "https://onlinelibrary.wiley.com/doi/10.1111/j.1468-0335.1937.tb00002.x",
  "version_date": null,
  "version_inspected": "Publisher HTML of the 1937 article; original-page scan corroborates locators"
}

Dates

{}

Complete frozen source register; no lossy public-projection substitution

Retrieval and generation

A model combines parametric knowledge with retrieved non-parametric information.

Separating knowledge access from model weights changes updating, access control and verification choices.

Retrieval does not guarantee correct sources, complete coverage or faithful answers.

The retriever can find information useful to the generator.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "authors": [
    "Patrick Lewis",
    "Ethan Perez",
    "Aleksandra Piktus",
    "Fabio Petroni",
    "Vladimir Karpukhin",
    "Naman Goyal",
    "Heinrich Küttler",
    "Mike Lewis",
    "Wen-tau Yih",
    "Tim Rocktäschel",
    "Sebastian Riedel",
    "Douwe Kiela"
  ],
  "id": "technical-rag-paper",
  "inspected_version": "arXiv v4, revised 2021-04-12",
  "source_type": "author-authored research paper in institutional preprint repository",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/html/2005.11401v4"
}

Dates

{
  "year": 2020
}

Complete frozen source register; no lossy public-projection substitution

Bounded rationality

Organizational decisions operate under limits of knowledge, attention and computational ability.

AI can improve search while leaving judgment, aspiration levels and authority unresolved.

Faster computation does not define goals or resolve conflicting preferences.

Search is costly and alternatives cannot always be exhaustively evaluated.

Sources and details

Rational Decision Making in Business Organizations

{
  "access_scope": "PDF text inspected: author/title, section II, especially Mechanisms of Bounded Rationality, and section IV discussion of search. This is not a final-publication collation.",
  "authors": [
    "Herbert A. Simon"
  ],
  "date_qualification": "CMU catalog dates the item January 1, 1979 as archival metadata. The artifact itself bears later printer dates. Nobel lecture delivery is December 8, 1978, independently identified in Nobel search-index metadata; direct Nobel page/PDF fetches failed.",
  "id": "economic-simon1979-galley",
  "original_presentation_date": "1978-12-08",
  "publication_date": "1979",
  "title": "Rational Decision Making in Business Organizations",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00082_fld06591_bdl0004_doc0001/Simon_box00082_fld06591_bdl0004_doc0001.pdf",
  "version_date": "1979-05-02",
  "version_inspected": "33-page archival galley with manuscript marks, printer dates 04-30-79 and 5-2-79; not the final Nobel PDF"
}

Dates

{
  "year": 1978
}

Complete frozen source register; no lossy public-projection substitution

The Coal Question

The Coal Question examines Britain’s dependence on coal; the linked transcription presents the 1866 second edition of the 1865 work.

Its economy-of-fuel chapter argues that efficiency can expand consumption.

The chapter makes the demand mechanism the starting point for applying rebound reasoning to another technology.

For an AI comparison, use that mechanism as a research question rather than treating the historical examples as a measurement of current AI demand.

Sources and details

The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)

{
  "id": "source-018",
  "publication_dates": [
    "1866"
  ],
  "title": "The Coal Question — Chapter VII, Of the Economy of Fuel (1866 second edition)",
  "url": "https://www.econlib.org/library/YPDBooks/Jevons/jvnCQ.html?chapter_num=9",
  "version_details": [
    "First publication 1865; served text explicitly identified as second edition, 1866."
  ]
}

Dates

{
  "date_note": "First publication 1865; linked text is the 1866 second edition.",
  "dated": true,
  "year": 1865
}

The Productivity J-Curve

The Productivity J-Curve models how complementary intangible investments can initially depress measured productivity as a technology is adopted.

In the model, measured growth can then rise when the benefits of those investments arrive.

Use the mechanism to distinguish delayed investment and measurement effects from immediate, task-specific limits in AI experiments.

The model does not forecast when a particular firm’s AI spending will pay off.

Sources and details

The Productivity J-Curve: How Intangibles Complement General Purpose Technologies

{
  "id": "source-045",
  "publication_dates": [
    "2021-01"
  ],
  "title": "The Productivity J-Curve: How Intangibles Complement General Purpose Technologies",
  "url": "https://www.aeaweb.org/articles?id=10.1257/mac.20180386",
  "version_details": [
    "American Economic Journal: Macroeconomics 13(1), 333–372; authors Erik Brynjolfsson, Daniel Rock and Chad Syverson."
  ]
}

Dates

{
  "date_note": "2021 journal publication; Brynjolfsson's productivity-paradox article appeared in 1993.",
  "dated": true,
  "year": 2021
}

Governing the Commons

Governing the Commons: The Evolution of Institutions for Collective Action is a book authored by Elinor Ostrom that was first printed in 1990.

The book examines empirical evidence to compare successful and unsuccessful governance of shared natural resources.

It documents long-lived cases such as Swiss and Japanese grazing and forest systems alongside Spanish and Philippine irrigation systems, noting that institutional longevity does not imply unchanging operating rules.

These analyzed cases concern relatively small systems within single countries, and only some groups self-organized successfully.

Sources and details

Governing the Commons: The Evolution of Institutions for Collective Action

{
  "access_scope": "Book description, author, dates and contents inspected; complete book not accessed.",
  "authors": [
    "Elinor Ostrom"
  ],
  "date_qualification": "Print year is corroborated by chapter metadata; online 2012 date is not original publication. This does not certify the latest available edition.",
  "doi": "10.1017/CBO9780511807763",
  "id": "economic-ostrom1990-catalog",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990-11-30",
  "title": "Governing the Commons: The Evolution of Institutions for Collective Action",
  "url": "https://www.cambridge.org/core/books/governing-the-commons/7AB7AE11BADA84409C34815CC288CD79",
  "version_date": "2012-06-05",
  "version_inspected": "Cambridge Core entry for original print book and 2012 digital issue"
}

Analyzing Long-Enduring, Self-Organized, and Self-Governed CPRs

{
  "access_scope": "Only public Summary paragraphs and bibliographic information; full chapter access not obtained.",
  "authors": [
    "Elinor Ostrom"
  ],
  "doi": "10.1017/CBO9780511807763.005",
  "id": "economic-ostrom1990-ch3",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990",
  "title": "Analyzing Long-Enduring, Self-Organized, and Self-Governed CPRs",
  "url": "https://www.cambridge.org/core/books/abs/governing-the-commons/analyzing-longenduring-selforganized-and-selfgoverned-cprs/93E337E42A79624A35EF138DC05A58B1",
  "version_inspected": "Chapter 3 public summary, chapter listed as pp. 58–102"
}

A Framework for Analysis of Self-Organizing and Self-Governing CPRs

{
  "access_scope": "Only public Summary paragraphs and bibliographic information; full chapter access not obtained.",
  "authors": [
    "Elinor Ostrom"
  ],
  "doi": "10.1017/CBO9780511807763.008",
  "id": "economic-ostrom1990-ch6",
  "online_publication_date": "2012-06-05",
  "publication_date": "1990",
  "title": "A Framework for Analysis of Self-Organizing and Self-Governing CPRs",
  "url": "https://www.cambridge.org/core/books/abs/governing-the-commons/framework-for-analysis-of-selforganizing-and-selfgoverning-cprs/05666795A13EFC6882C18E4E05C40166",
  "version_inspected": "Chapter 6 public summary, chapter listed as pp. 182–216"
}

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1990
}

Complete frozen source register; no lossy public-projection substitution

Attention Is All You Need

Attention Is All You Need proposes the Transformer, replacing recurrent and convolutional sequence-processing layers with attention.

Its translation experiments anchor a study of architecture and parallel training.

Read those task-specific results as evidence about the tested design, while preserving the distinction between the 2017 preprint and its later revisions.

Sources and details

Attention Is All You Need

{
  "id": "source-004",
  "publication_dates": [
    "2017-06-12"
  ],
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_details": [
    "v1 2017-06-12; v7 2023-08-02."
  ]
}

Dates

{
  "date_note": "2017 transformer; Bahdanau, Cho and Bengio's attention preprint dates to 2014.",
  "dated": true,
  "year": 2017
}

The Chip: How Two Americans Invented the Microchip and Launched a Revolution

T. R. Reid’s The Chip follows the invention of the integrated circuit, with an original 1984 publication and a revised 2001 edition.

It narrates the contributions of Jack Kilby and Robert Noyce as the chip industry takes shape.

Texas Instruments and Fairchild Semiconductor give the account an institutional setting alongside its inventors.

Read it as industrial history that connects invention with the physical infrastructure behind later computing.

Sources and details

Publisher description — The Chip, revised edition

{
  "id": "local-source-f4ea7627e9bb",
  "publication_dates": [],
  "title": "Publisher description — The Chip, revised edition",
  "url": "https://www.penguinrandomhouse.com/books/140170/the-chip-by-tr-reid/",
  "version_details": [
    "Original publication 1984; inspected publisher description concerns revised 2001 edition."
  ]
}

Dates

{
  "date_note": "",
  "dated": true,
  "year": "1984 original; 2001 revised edition verified"
}

LoRA: Low-Rank Adaptation of Large Language Models

LoRA: Low-Rank Adaptation of Large Language Models evaluates adaptation through trainable low-rank matrices.

The admitted source is a 2021 arXiv preprint; the separately supplied 2022 conference year remains unresolved.

Its method-specific focus provides a concrete comparison with full fine-tuning.

Use the work to keep the adaptation mechanism explicit when comparing different ways to modify pretrained models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "id": "source-029",
  "publication_dates": [
    "2021-06-17"
  ],
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_details": [
    "v1 2021-06-17; v2 2021-10-16."
  ]
}

Dates

{
  "date_note": "Arxiv first submission date: 2021-06-17; Arxiv first submission year: 2021; Formal publication year: 2022; Formal venue: ICLR; Formal source url: https://openreview.net/forum?id=nZeVKeeFYf9; Venue evidence note: Draft V2 includes better baselines, experiments on GLUE, and more on adapter latency; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2022
}

Long Short-Term Memory

Long Short-Term Memory introduces a neural network architecture where a self-connected cell supports constant error flow, with input and output gates controlling access.

Reported experiments in the work evaluated artificial sequences, demonstrating in an adding experiment that the model learns marked continuous values across intervening sequence steps.

Noted limitations include delayed XOR problems, and real-world applications are designated as future work.

Sources and details

Long Short-Term Memory

{
  "authors": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "id": "technical-lstm-paper",
  "inspected_version": "32-page author/institution-hosted manuscript bearing the 1997 journal citation; no revision date shown",
  "publication_date": "1997-11-15",
  "source_type": "original research article, author-institution-hosted manuscript",
  "title": "Long Short-Term Memory",
  "url": "https://www.bioinf.jku.at/publications/older/2604.pdf"
}

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1997
}

Complete frozen source register; no lossy public-projection substitution

The Nature of the Firm

The Nature of the Firm is an article authored by R. H. Coase.

The work analyzes economic organization by noting that market exchange requires price discovery and contracting.

While internal direction saves certain exchange costs, it is itself costly to carry out.

Consequently, the firm boundary compares an additional internal transaction with market exchange or another firm's organization.

Sources and details

The Nature of the Firm

{
  "access_scope": "Full article HTML available; sections I–II inspected closely, with primary claims in II. Original-page PDF text also inspected at journal pp. 390–395. No claim that every footnote was reviewed.",
  "authors": [
    "R. H. Coase"
  ],
  "date_qualification": "Wiley explicitly gives first publication as November 1937; a contemporary crawl date is not a revision date.",
  "doi": "10.1111/j.1468-0335.1937.tb00002.x",
  "id": "economic-coase1937",
  "publication": "Economica, new series 4(16), 386–405",
  "publication_date": "1937-11",
  "title": "The Nature of the Firm",
  "url": "https://onlinelibrary.wiley.com/doi/10.1111/j.1468-0335.1937.tb00002.x",
  "version_date": null,
  "version_inspected": "Publisher HTML of the 1937 article; original-page scan corroborates locators"
}

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1937
}

Complete frozen source register; no lossy public-projection substitution

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

Randomization of 758 BCG consultants demonstrates task-dependent augmentation: within-frontier GPT-4 use increased completion 12.2%, speed 25.1% and quality over 40%; outside-frontier correct answers fell 19 percentage points. The latter task required reconciling spreadsheet data with interview clues. Centaur delegation and cyborg integration are qualitative patterns, not randomized causal treatments.

2023 GPT-4, selected consulting tasks and participants constrain generalization. Speed concerns reaching the final task; participants could not finish the whole inside-frontier exercise early. Keep percentage points distinct from percent. Do not infer individual contribution roles from author order.

Sources and details

Navigating the Jagged Technological Frontier — Working Paper 24-013 (September 22, 2023)

{
  "id": "source-046",
  "publication_dates": [
    "2023-09-22"
  ],
  "title": "Navigating the Jagged Technological Frontier — Working Paper 24-013 (September 22, 2023)",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf",
  "version_details": [
    "58-page PDF; internal title page dated September 22, 2023."
  ]
}

HBS Working Paper 24-013 — admitted legacy PDF link

{
  "id": "source-047",
  "publication_dates": [],
  "title": "HBS Working Paper 24-013 — admitted legacy PDF link",
  "url": "https://www.hbs.edu/ris/Publication%20Files/24-013_d9b45b68-9e74-42d6-a1c6-c72fb70c7282.pdf",
  "version_details": [
    "Exact revision at this legacy URL unresolved."
  ]
}

D^3 x Arts and Sciences — Harvard Business School AI Institute

{
  "id": "source-048",
  "publication_dates": [],
  "title": "D^3 x Arts and Sciences — Harvard Business School AI Institute",
  "url": "https://aiinstitute.hbs.edu/arts-and-science-research/",
  "version_details": [
    "Live research-list page; no publication date established."
  ]
}

SSRN abstract 4573321 — Navigating the Jagged Technological Frontier

{
  "id": "source-049",
  "publication_dates": [],
  "title": "SSRN abstract 4573321 — Navigating the Jagged Technological Frontier",
  "url": "https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4573321",
  "version_details": [
    "Indexed DOI metadata identifies a September 2023 posting and March 2026 revision; not used to overwrite the admitted PDF dates."
  ]
}

Navigating the Jagged Technological Frontier — Organization Science, Articles in Advance (2026)

{
  "id": "source-050",
  "publication_dates": [
    "2026-03-11"
  ],
  "title": "Navigating the Jagged Technological Frontier — Organization Science, Articles in Advance (2026)",
  "url": "https://www.hbs.edu/ris/Publication%20Files/dell-acqua-et-al-2026-navigating-the-jagged-technological-frontier_5c589c8c-fbb5-458f-b285-c944746cd717.pdf",
  "version_details": [
    "22-page PDF; Organization Science Articles in Advance, DOI 10.1287/orsc.2025.21838; received December 18, 2025 and accepted January 27, 2026."
  ]
}

Dates

{
  "date_note": "Version: 2023 working paper, 58-page MIT-hosted PDF including HBS covers and appendices.",
  "dated": true,
  "year": 2023
}

AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms

Google DeepMind reports an evolutionary coding agent that proposes programs with Gemini models, tests and scores them using automated evaluators, and retains promising candidates. Reported applications include optimizations to algorithms and AI-training infrastructure.

Company research report with task-specific evaluations. Improvements to selected code and training infrastructure provide a bounded example of AI-assisted improvement; they do not demonstrate autonomous open-ended recursive improvement in general intelligence, inevitable acceleration or a takeoff date. Human-defined evaluation and available resources constrain the search.

Sources and details

AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms

{
  "id": "source-023",
  "publication_dates": [
    "2025-05-14"
  ],
  "title": "AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms",
  "url": "https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/",
  "version_details": [
    "Announcement by the AlphaEvolve team."
  ]
}

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2025-05-14"
}

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

Derives indicators from scientific theories and assesses AI architectures. The authors’ analysis suggested no then-current systems were conscious, while identifying no obvious technical barrier to systems satisfying the indicators. Indicator satisfaction is not proof of subjective experience.

Source-scoped Research report / preprint. Consciousness claims and normative conclusions are attributed arguments; this work is not independent proof that an AI has subjective experience. No journal-publication status inferred from arXiv. Conclusions are scoped to the 2023 report.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "id": "source-051",
  "publication_dates": [
    "2023-08-17"
  ],
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_details": [
    "v1 August 17; v2 August 21; current v3 August 22, 2023."
  ]
}

Dates

{
  "date_events": [
    {
      "date": "2023-08-17",
      "kind": "preprint_submission",
      "year": 2023
    },
    {
      "date": "2023-08-22",
      "kind": "preprint_revision",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-08-17"
}

Identifying indicators of consciousness in AI systems

Explains theory-derived indicators as provisional evidence bearing on AI consciousness, including interpretation and gaming difficulties. It does not establish that any particular AI is conscious.

Source-scoped Opinion / review article. Consciousness claims and normative conclusions are attributed arguments; this work is not independent proof that an AI has subjective experience.

Sources and details

Identifying indicators of consciousness in AI systems

{
  "id": "source-052",
  "publication_dates": [],
  "title": "Identifying indicators of consciousness in AI systems",
  "url": "https://doi.org/10.1016/j.tics.2025.10.011",
  "version_details": [
    "Identifier matches the admitted ScienceDirect PII."
  ]
}

Identifying indicators of consciousness in AI systems

{
  "id": "source-053",
  "publication_dates": [
    "2026-06"
  ],
  "title": "Identifying indicators of consciousness in AI systems",
  "url": "https://www.sciencedirect.com/science/article/pii/S1364661325002864",
  "version_details": [
    "Indexed publisher metadata: Trends in Cognitive Sciences 30(6), 488–501."
  ]
}

Matthias Michel — Publications

{
  "id": "source-054",
  "publication_dates": [
    "2025"
  ],
  "title": "Matthias Michel — Publications",
  "url": "https://www.matthiasmichel.org/publications",
  "version_details": [
    "Bibliographic year for the article; webpage update date unspecified."
  ]
}

Identifying indicators of consciousness in AI systems — NLM bibliographic record

{
  "access_scope": "Exact title, identifiers and typed electronic/issue dates verified in NLM XML; no full-text verification.",
  "dates": {
    "doi": "10.1016/j.tics.2025.10.011",
    "electronic_publication": "2025-11-10",
    "journal_issue": "2026-06",
    "pmid": "41219038"
  },
  "id": "nlm-pmid-41219038",
  "title": "Identifying indicators of consciousness in AI systems — NLM bibliographic record",
  "url": "https://pubmed.ncbi.nlm.nih.gov/41219038/"
}

Dates

{
  "date_events": [
    {
      "date": "2025-11-10",
      "kind": "online_publication",
      "year": 2025
    },
    {
      "date": "2026-06",
      "kind": "issue",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-11-10"
}

Alexandr Wang

On January 21, 2025, Alexandr Wang signed a public letter as Scale AI’s founder and CEO.

His letter called on the new US administration to direct AI investment, develop an AI workforce and prepare federal agencies to use AI.

It also addressed energy supply and safety policy, and offered Scale AI as an administration partner.

This documents Wang’s historical company-representative and policy-advocacy role, rather than authorship of a particular model or algorithm.

Sources and details

Letter from Alexandr Wang to President Trump on Winning the AI War

{
  "access_scope": "Full dated letter and signature block inspected; sitewide current CEO banner excluded from historical contribution.",
  "dates": {
    "letter_publication": "2025-01-21"
  },
  "id": "diverse-N51-WANG",
  "title": "Letter from Alexandr Wang to President Trump on Winning the AI War",
  "url": "https://scale.com/blog/win-the-ai-war"
}

Dates

{}

Preserve historical date; no statement of current Scale employment or role. Broad claims about Scale powering AI advances are self-promotional assertions and are not admitted as established technical contribution.

Jim Keller

Tenstorrent’s inspected company profile identifies Jim Keller as chief executive and describes him as a hardware engineer.

The profile reports his prior engineering roles at Intel, Tesla, AMD, and P.A. Semi.

While attributing leadership across several processor-design programs to Keller, the company's nearby profiles separately credit other leads across systems, Tensix, and compilers.

Sources and details

Tenstorrent team — Jim Keller

{
  "access_scope": "Jim Keller profile and nearby team role descriptions; not a complete career or architecture audit.",
  "dates": {
    "inspected_version": "Undated live company profile; inspected 2026-10-07, not a publication date"
  },
  "id": "pass-KELLER",
  "title": "Tenstorrent team — Jim Keller",
  "url": "https://tenstorrent.com/vision"
}

Dates

{}

Company-authored profile claims; current title is tied to inspection date. Leadership is not sole architecture authorship or verified comparative performance.

Company profile; title tied to 2026-10-07 inspection; leadership is not sole architecture authorship.

Jev

TypeSafe AI describes Jev in its announcement as the company's first publicly available System One model in early access.

According to the company, the model takes unstructured state as input and produces typed probabilistic decisions rather than generating free-form strings.

An announcement FAQ explicitly identifies William Stanley Jevons as the model's namesake.

Sources and details

Introducing System One Models & Jev

{
  "access_scope": "Dated announcement, product/input-output description and namesake FAQ; benchmarks and demos not independently evaluated.",
  "dates": {
    "announcement_publication": "2026-09-15"
  },
  "id": "pass-JEV",
  "title": "Introducing System One Models & Jev",
  "url": "https://typesafe.ai/blog/introducing-system-one-models-and-jev"
}

Dates

{}

Company announcement, not independent verification of accuracy, calibration, speed, cost, hallucination guarantees or aggregate energy demand. Product early access is distinct from company founding.

Attribute product descriptions and namesake to the company; no independently established performance or hallucination guarantees.

Conway’s law

In "How Do Committees Invent?", Melvin E. Conway argues that the way design teams are organized constrains feasible designs according to available communication paths.

His analysis relates subsystem interfaces to communication structures among designers, noting that a single group may design multiple subsystems.

Because system concepts and communication requirements evolve over time, Conway concludes that organizations must maintain flexibility.

Sources and details

How Do Committees Invent?

{
  "access_scope": "Publication notice, Stages of Design, Relating the Two, and Conclusion inspected; later prefatory note separated from original article.",
  "dates": {
    "inspected_version": "Author-hosted permissioned HTML reprint with later author note",
    "original_publication": "1968-04"
  },
  "id": "next-CONWAY",
  "title": "How Do Committees Invent?",
  "url": "https://www.melconway.com/Home/Committees_Paper.html"
}

Dates

{}

Author argument with illustrative cases, not a universal empirical causal result. Article explicitly allows multiple subsystems per design group; no one-to-one deterministic mapping.

Moore’s law

Economically attractive integrated-circuit component counts historically grew exponentially. Moore’s 1965 annual-doubling projection was revised in 1975 toward doubling about every two years.

A historical industry trajectory and coordinating target, not a physical law or a guarantee that speed, affordability, or AI capability doubles.

Sources and details

Cramming More Components onto Integrated Circuits

{
  "authors": [
    "Gordon E. Moore"
  ],
  "id": "technical-moore-1965",
  "inspected_version": "Reprint in Proceedings of the IEEE 86(1), January 1998, pp. 82–85; source PDF bears a 2024 download watermark",
  "source_type": "reprinted original article hosted by university",
  "title": "Cramming More Components onto Integrated Circuits",
  "url": "https://www.cs.cmu.edu/~18742/papers/Moore1965.pdf"
}

Progress in Digital Integrated Electronics

{
  "authors": [
    "Gordon E. Moore"
  ],
  "id": "technical-moore-1975",
  "inspected_version": "Three-page permissioned reprint linked by IEEE Engineering and Technology History Wiki; no substantive revision date stated",
  "source_type": "reprinted original conference paper",
  "title": "Progress in Digital Integrated Electronics",
  "url": "https://ethw-images.s3.us-east-va.perf.cloud.ovh.us/ieee/5/5e/Moore_1975_IEEE_Speech.pdf"
}

Dates

{}

The 1965 linked PDF is a 1998 reprint; the 1975 PDF catalog upload is dated 2015. Neither is the original publication date.

The existing coordinating-target characterization is retained but not newly established by these two papers.

Machine learning

In their textbook chapter, Ian Goodfellow, Yoshua Bengio, and Aaron Courville define machine learning as acquiring knowledge from data or experience instead of having every task rule hand-coded.

Examples such as logistic regression and naive Bayes show that the performance of learning systems depends directly on the representation supplied to them.

They position deep learning as a specialized branch of machine learning that forms increasingly abstract representations out of simpler ones.

Sources and details

Deep Learning — Chapter 1, Introduction

{
  "access_scope": "Opening pages 1–3 and summary on p.8 inspected; no assertion of auditing all chapters.",
  "dates": {
    "inspected_version": "Author-maintained online chapter; publication/revision day not independently established here",
    "original_book_publication_year": 2016
  },
  "id": "next-ML",
  "title": "Deep Learning — Chapter 1, Introduction",
  "url": "https://www.deeplearningbook.org/contents/intro.html"
}

Dates

{}

Textbook definition/example scope. No evidence that learning guarantees causal understanding, unfamiliar-input reliability or sentience. Original publication and current webpage revision are not collapsed.

Neural network

In the inspected textbook chapter, multilayer perceptrons employ hidden layers to learn representations on which an output predictor operates.

The text notes that composing affine transformations without nonlinear activations continues to yield only an affine model.

Applying nonlinear activations prevents this collapse and enables more expressive multilayer architectures, although learning an appropriate function remains a distinct challenge.

Sources and details

Dive into Deep Learning — 5.1 Multilayer Perceptrons

{
  "access_scope": "Sections 5.1.1.1–5.1.1.4 inspected; no complete book or historical-priority audit.",
  "dates": {
    "inspected_version": "Online documentation labeled 1.0.3; precise page revision day not established"
  },
  "id": "pass-D2L",
  "title": "Dive into Deep Learning — 5.1 Multilayer Perceptrons",
  "url": "https://d2l.ai/chapter_multilayer-perceptrons/mlp.html"
}

Dates

{}

Mathematical architecture explanation, not a detailed biological model. Expressive capacity does not guarantee that training finds the needed function.

The inspected multilayer perceptron is an example, not a description of every neural-network architecture.

Convolution and visual learning

Learned filters and spatial structure support effective document-recognition systems.

Useful systems combine learned representations with domain structure and integration.

Architectural bias matters; scale alone is not the explanation.

Local spatial patterns and weight sharing suit the task.

Convolutional models reuse local filters across positions, reducing the need to learn a separate detector for every location. Pooling and related architectural choices help handle changes in position and representation. The family includes Fukushima's Neocognitron and LeCun and collaborators' document-recognition work; this is a contribution family, not a claim that one paper created every component.

In document recognition, local patterns and shared filters can make visual learning practical. A change in page layout, language or scanning conditions still needs evaluation; an architecture suited to local patterns does not remove distribution-shift risk.

Sources and details

Gradient-Based Learning Applied to Document Recognition

{
  "access_scope": "Retrieved PDF. Text font extraction corrupt; manuscript pages 1–3 visually inspected for abstract, architecture/task qualifications, learning objective and back-propagation.",
  "dates": {
    "inspected_version": "Author-hosted manuscript marked Submitted to Proceedings of the IEEE, 1998"
  },
  "id": "next-LECUN",
  "title": "Gradient-Based Learning Applied to Document Recognition",
  "url": "https://leon.bottou.org/publications/pdf/ieee-1998.pdf"
}

Dates

{
  "year": 1998
}

Submitted manuscript version is separate from journal issue metadata. Benchmarks are document/handwriting recognition; no all-task superiority claim. Broad convolution family includes earlier work not audited in this pass.

Ridley Scott

The American Film Institute catalog credits Ridley Scott as the director of Blade Runner.

The catalog separately attributes writing credits to Hampton Fancher and David Peoples, and producer credit to Michael Deeley.

Its summary of the film's prologue outlines manufactured replicants used for off-world labor and hunted on Earth following their prohibition.

Sources and details

AFI Catalog — Blade Runner (1982)

{
  "access_scope": "Title/year, director/writer/producer credits and prologue discussion; complete production history and credit list not audited.",
  "dates": {
    "catalog_release_date": "1982-06-25",
    "catalog_work_year": 1982
  },
  "id": "pass-SCOTT",
  "title": "AFI Catalog — Blade Runner (1982)",
  "url": "https://catalog.afi.com/Film/68260-BLADE-RUNNER"
}

Dates

{}

Reference catalog credit and bounded fictional plot context only; no AI invention, real capability or documented technical influence. Separate director, screenwriter and producer credits.

Film-specific director credit; writer and producer roles remain separate.

Stanley Kubrick

Stanley Kubrick directed and produced the 1968 film 2001: A Space Odyssey.

The film's screenplay is credited jointly to Kubrick and Arthur C. Clarke.

In the film's synopsis, the computer HAL 9000—voiced by Douglas Rain—is stationed aboard a Jupiter-bound voyage where it turns against the crew.

From an editorial perspective, this fictional mission provides a framing for exploring reliance on an automated system.

Sources and details

2001: A Space Odyssey (1968)

{
  "access_scope": "Distributor film synopsis and full displayed credits inspected; film itself not viewed.",
  "dates": {
    "page_update_date": null,
    "work_year": "1968"
  },
  "id": "diverse-N51-KUBRICK",
  "title": "2001: A Space Odyssey (1968)",
  "url": "https://www.criterion.com/films/35286-2001-a-space-odyssey"
}

Dates

{}

Bound to film, not the separately titled novel. Thematic comparison is editorial and makes no claim of technological influence or demonstrated consciousness.

Film-specific directing, production and shared screenplay credit. The unresolved combined film/novel 2001 parent record remains held; no identity merge or parent clearance.

DeepMind

On April 20, 2023, Google announced that the Brain team from Google Research and DeepMind would combine to form Google DeepMind.

The announcement named Demis Hassabis as leader of Google DeepMind and Jeff Dean as Google Chief Scientist serving Google Research and Google DeepMind.

The announcement stated that Google Research would continue its broader research work alongside the combined unit.

Sources and details

Google DeepMind: Bringing together two world-class AI teams

{
  "access_scope": "Dated article and paragraphs naming Brain, DeepMind, the new Google DeepMind unit and announced leadership roles inspected.",
  "dates": {
    "announcement_publication": "2023-04-20"
  },
  "id": "next-DEEPMIND",
  "title": "Google DeepMind: Bringing together two world-class AI teams",
  "url": "https://blog.google/innovation-and-ai/technology/ai/april-ai-update/"
}

Dates

{
  "date_events": []
}

Announcement documents 2023 reorganization and prospective leadership, not current roles. Historical DeepMind remains separate; collective list of achievements cannot assign every work to either predecessor.

Anthropic

Anthropic announced itself in May 2021 as an AI safety and research company focused on building more reliable, interpretable, and steerable large-scale systems.

The initial announcement identified improved reliability, interpretability tools and human feedback integration as research priorities.

In March 2023, the organization launched Claude via chat and developer access, introducing Claude and Claude Instant as its initial versions.

The launch announcement presented conversational and text-processing applications including summarization, question answering, and coding.

Sources and details

Anthropic raises $124 million to build more reliable, general AI systems

{
  "access_scope": "Original dated company announcement inspected; related-content cards excluded.",
  "dates": {
    "announcement": "2021-05-28"
  },
  "id": "diverse-N51-ANTHROPIC-2021",
  "title": "Anthropic raises $124 million to build more reliable, general AI systems",
  "url": "https://www.anthropic.com/news/anthropic-raises-124-million-to-build-more-reliable-general-ai-systems"
}

Introducing Claude

{
  "access_scope": "Original dated launch announcement inspected; testimonials and current related-content cards excluded.",
  "dates": {
    "announcement": "2023-03-14"
  },
  "id": "diverse-N51-ANTHROPIC-2023",
  "title": "Introducing Claude",
  "url": "https://www.anthropic.com/news/introducing-claude"
}

Dates

{
  "date_events": [
    {
      "basis": "2021 company launch; contemporaneous May 28 Series A announcement.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.anthropic.com/company/leadership",
        "https://www.anthropic.com/news/anthropic-raises-124-million-to-build-more-reliable-general-ai-systems",
        "https://benjmann.net/",
        "https://reinvent.awsevents.com/content/dam/reinvent/2024/slides/aim/AIM123-S_Leverage-Anthropics-Claude-models-for-AIs-evolving-landscape-sponsored-by-Anthropic.pdf"
      ],
      "year": 2021
    }
  ]
}

Historical company descriptions; goals and advertised use cases retain company attribution. Avoid comparative capability claims and current-role or current-product inferences.

OpenAI

In a December 11, 2015 announcement, OpenAI was introduced as a nonprofit AI research company aimed at advancing digital intelligence for broad human benefit.

The announcement stated intentions to publish research and collaborate with other institutions and companies.

The announcement named Ilya Sutskever as research director and Greg Brockman as CTO.

Sources and details

Introducing OpenAI

{
  "access_scope": "Dated article, authors, mission, publication/collaboration intentions and founding-role section inspected; current website navigation excluded.",
  "dates": {
    "announcement_publication": "2015-12-11"
  },
  "id": "next-OPENAI",
  "title": "Introducing OpenAI",
  "url": "https://openai.com/index/introducing-openai/"
}

Dates

{
  "date_events": [
    {
      "basis": "Nonprofit organization established in 2015; for-profit subsidiary created 2019; 2025 structure distinguished.",
      "date": "2015",
      "kind": "nonprofit_organization_origin",
      "qualified": false,
      "source_urls": [
        "https://openai.com/index/introducing-openai/",
        "https://openai.com/our-structure/",
        "https://cdn.openai.com/pdf/0ada8797-a5ae-4577-857e-94598d5234d5/2025-04-09-openai-defendants-counterclaims-answer-and-defenses.pdf",
        "https://forum.openai.com/public/videos/event-replay-sam-altman-on-building-the-future-of-ai-2026-04-06",
        "https://openai.com/index/introducing-superalignment/",
        "https://www.commerce.senate.gov/services/files/ae7e9ee3-df1b-4d94-96d1-267ebd206c48"
      ],
      "year": 2015
    }
  ]
}

2015 self-description and intentions are historical, not current legal structure or proof of outcomes. Funding commitments are not audited expenditure. Founder roles do not confer sole technical authorship.

IBM

IBM’s corporate history credits Charles Ranlett Flint with organizing the merger that formed the Computing-Tabulating-Recording Company.

It dates C-T-R’s incorporation as a holding company for three firms to June 16, 1911.

The same account states that Thomas J. Watson renamed C-T-R International Business Machines in 1924.

Sources and details

The origins of IBM

{
  "access_scope": "Company historical account: opening, incorporation paragraph and 1924 name-change paragraph. No current watsonx product audit.",
  "dates": {
    "historical_ctr_incorporation": "1911-06-16",
    "historical_ibm_name_adoption_year": 1924,
    "inspected_version": "Undated institutional history page inspected 2026-10-07"
  },
  "id": "pass-IBM",
  "title": "The origins of IBM",
  "url": "https://www.ibm.com/history/ctr-and-ibm"
}

Dates

{
  "date_events": [
    {
      "basis": "Computing-Tabulating-Recording Company incorporated June 16, 1911; IBM name adopted 1924.",
      "date": "1911",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.ibm.com/history/ctr-and-ibm",
        "https://www.ibm.com/products/watsonx"
      ],
      "year": 1911
    }
  ]
}

Company-authored retrospective. C-T-R origin and later IBM name are separate events. Historical identity evidence does not verify present products, market position or an exhaustive merger/credit history.

Company historical account; 1911 C-T-R incorporation and 1924 IBM renaming are separate events.

Resources and firm growth

Productive services from resources and managerial capacity shape the opportunities and limits of firm growth.

Model access can expand options while integration capacity limits expansion.

Owning a resource is not the same as being able to use it productively.

Resources supply different services depending on experience and organization.

Sources and details

The Theory of the Growth of the Firm (3rd edn)

{
  "access_scope": "Title, author, third-edition date and complete public book abstract inspected; paywalled chapters not read.",
  "dates": {
    "doi": "10.1093/0198289774.001.0001",
    "inspected_edition_publication": "1995-09-14"
  },
  "id": "next-PENROSE",
  "title": "The Theory of the Growth of the Firm (3rd edn)",
  "url": "https://academic.oup.com/book/25306"
}

Dates

{
  "year": 1959
}

1995 dates the inspected third edition, not original publication. Abstract supports only its bounded resource/services/management interaction; no complete biography or full book audit.

Alan Turing

Alan Turing is the credited author of the 1950 Mind article Computing Machinery and Intelligence.

In this work, Turing replaces definitional questions with a written-interrogation imitation game.

The essay systematically examines objections to thinking machines and proposes educating a child-machine program.

Sources and details

Virtual issue: MIND at 150, Part Two: 1926-1975

{
  "authors": [
    "Oxford University Press / Mind Association"
  ],
  "id": "technical-turing-name",
  "inspected_version": "Undated publisher retrospective index",
  "source_type": "publisher identity/authorship metadata",
  "title": "Virtual issue: MIND at 150, Part Two: 1926-1975",
  "url": "https://academic.oup.com/mind/pages/virtual-issue-mind-at-150-part-two-1926-1975"
}

Computing Machinery and Intelligence

{
  "authors": [
    "A. M. Turing"
  ],
  "id": "technical-turing-text",
  "inspected_version": "22-page teaching transcription, no transcription or revision date stated",
  "source_type": "university-hosted transcription of original primary essay",
  "title": "Computing Machinery and Intelligence",
  "url": "https://www.csee.umbc.edu/courses/471/papers/turing.pdf"
}

Dates

{}

Work-specific contribution only; no new biography, employment, causal influence or chapter mappings.

The existing general-computation-model claim is preserved from the baseline but was not revalidated in this focused 1950-essay research.

Claude Shannon

The 1955 Dartmouth workshop proposal lists Claude Shannon with a Bell Telephone Laboratories affiliation alongside John McCarthy, Marvin Minsky, and Nathaniel Rochester.

The document's section on calculation size highlights partial results by Shannon and McCarthy concerning the complexity of functions.

In his project statement, Shannon proposed examining reliable computing using unreliable elements as well as information flow through closed-loop networks.

Sources and details

A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

{
  "access_scope": "Historical proposal transcription: byline/date, opening, complexity paragraph and Shannon project statement. Actual workshop attendance not verified.",
  "dates": {
    "proposal_date": "1955-08-31",
    "proposed_study_summer": 1956
  },
  "id": "pass-SHANNON",
  "title": "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence",
  "url": "https://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html"
}

Dates

{}

Proposal authorship and intentions are distinct from actual attendance, achieved results and later influence. Historical Bell Laboratories affiliation is tied to the proposal, not a current role.

Proposal authorship and proposed research only; no verified attendance or achieved results.

Edith Penrose

Edith Penrose is identified as the author of the inspected third edition of The Theory of the Growth of the Firm.

Her framework explains that familiar resources shape the productive services management provides, just as management experience impacts the services drawn from other resources.

Under this analysis, the ongoing interaction between management and resource use fosters firm growth while also constraining its rate.

Sources and details

The Theory of the Growth of the Firm (3rd edn)

{
  "access_scope": "Title, author, third-edition date and complete public book abstract inspected; paywalled chapters not read.",
  "dates": {
    "doi": "10.1093/0198289774.001.0001",
    "inspected_edition_publication": "1995-09-14"
  },
  "id": "next-PENROSE",
  "title": "The Theory of the Growth of the Firm (3rd edn)",
  "url": "https://academic.oup.com/book/25306"
}

Dates

{}

1995 dates the inspected third edition, not original publication. Abstract supports only its bounded resource/services/management interaction; no complete biography or full book audit.

Fei-Fei Li

Fei-Fei Li is one of the six credited authors of ImageNet: A Large-Scale Hierarchical Image Database, alongside Jia Deng, Wei Dong, Richard Socher, Li-Jia Li and Kai Li.

The paper organizes images into a WordNet-based semantic hierarchy and reports a then-current snapshot of 3.2 million images.

Its candidate images are verified by human annotators using repeated judgments and category-sensitive agreement thresholds.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "Byline/abstract, section 2 and section 3.2 inspected, including WordNet organization, reported dataset snapshot and human annotation quality control.",
  "dates": {
    "inspected_version": "Eight-page project-hosted paper; exact conference publication day not independently verified in this pass"
  },
  "id": "next-IMAGENET",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

Dates

{}

Fei-Fei Li is one of six named authors, not sole inventor. Snapshot and annotation procedure do not audit later datasets, all data rights, current employment or all image recognition research.

Norbert Wiener

Norbert Wiener coauthored the January 1943 article Behavior, Purpose and Teleology in Philosophy of Science with Arturo Rosenblueth and Julian Bigelow.

The authors analyze behavior using observable input/output relations and classify goal-directed activity.

Their restricted account of feedback relies on deviation from a goal to direct subsequent behavior.

They identify insufficient damping as a cause of overshoot and escalating oscillation in feedback systems.

Sources and details

Behavior, Purpose and Teleology

{
  "access_scope": "Full eight-page university-hosted journal scan retrieved; title page and article pp.18–24 inspected. Scan includes a bibliographic cover page.",
  "dates": {
    "journal": "Philosophy of Science 10(1), 18–24",
    "original_publication": "1943-01",
    "scan_access_stamp": "2003-08-18"
  },
  "id": "diverse-N51-CYBER",
  "title": "Behavior, Purpose and Teleology",
  "url": "https://home.csulb.edu/~cwallis/382/readings/482/wiener.behavior.purpose.teleology.1943.pdf"
}

Dates

{}

Contribution-specific coauthorship only; no claim of sole invention or a newly inferred biography. Use the shared article evidence to enrich technical contribution without importing all historical physiological claims.

Verification creates usable feedback

AlphaTensor evaluates matrix-multiplication decompositions by reducing a target tensor to zero, using completed games to provide reinforcement learning feedback.

FunSearch executes generated programs through an automated evaluator and routes high-scoring solutions into subsequent prompts, constrained by evaluator efficiency and score quality.

AlphaProof generates Lean tactics and confirms complete proof terms against the Lean kernel during an independent final verification stage.

An editorial comparison shows that while these systems operate on distinct targets—algebraic tensors, program code, and formal proofs—each converts defined correctness or scoring rules into reusable feedback.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "Primary Nature article HTML, methods and discussion inspected; no experiments reproduced.",
  "dates": {
    "online_publication": "2022-10-05"
  },
  "id": "diverse-N51-ALPHATENSOR",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

Mathematical discoveries from program search with large language models

{
  "access_scope": "Primary Nature article HTML inspected, including method and scope limitations.",
  "dates": {
    "online_publication": "2023-12-14"
  },
  "id": "diverse-N51-FUNSEARCH",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Primary Nature article HTML inspected, including Lean environment and final verification methods.",
  "dates": {
    "online_publication": "2025-11-12"
  },
  "id": "diverse-N51-ALPHAPROOF",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Dates

{}

Preserve different meanings of verification: algebraic identity, executable program score, formal proof. Lean relies on kernel/axiom assumptions; evaluators test their specified inputs; formalization is separate. Do not claim a measured economy-wide productivity effect or historical influence between systems.

NVIDIA

NVIDIA’s corporate timeline dates the company’s founding to April 5, 1993 and names Jensen Huang, Chris Malachowsky and Curtis Priem as its founders.

Its 2006 entry describes the unveiling of CUDA as opening GPU parallel processing to science and research.

Its 2012 entry describes NVIDIA technology as powering the AlexNet neural network breakthrough.

Sources and details

NVIDIA History — A Timeline of Innovation

{
  "access_scope": "Company timeline entries for 1993 founding, 2006 CUDA and 2012 AlexNet; technical details and priority claims not independently audited.",
  "dates": {
    "company_founding": "1993-04-05",
    "inspected_version": "Undated live corporate timeline inspected 2026-10-07",
    "timeline_alexnet_year": 2012,
    "timeline_cuda_year": 2006
  },
  "id": "pass-NVIDIA",
  "title": "NVIDIA History — A Timeline of Innovation",
  "url": "https://www.nvidia.com/en-sg/about-nvidia/corporate-timeline/"
}

Dates

{
  "date_events": [
    {
      "basis": "Official history gives April 5, 1993.",
      "date": "1993",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.nvidia.com/en-sg/about-nvidia/corporate-timeline/"
      ],
      "year": 1993
    }
  ]
}

Self-authored timeline. No adoption totals, first-invention claims, superiority or market dominance independently established. Company dates are separate from product/method milestones.

Attribute founding, CUDA and AlexNet statements to the company timeline; no exclusivity, priority or superiority claims.

TSMC

TSMC provides the CoWoS packaging platform, which integrates multiple systems-on-chip and high-bandwidth memory stacks for AI and high-performance computing applications.

Under this platform, CoWoS-S mounts logic and memory dies onto a silicon interposer with dense interconnects.

The platform also offers CoWoS-R with redistribution-layer interposers and CoWoS-L with local silicon interconnects to meet diverse packaging requirements.

According to TSMC, the CoWoS packaging technology entered volume production in 2012.

Sources and details

CoWoS

{
  "access_scope": "Official technical platform page inspected, especially introductory text and CoWoS-S/R/L descriptions.",
  "dates": {
    "claimed_platform_volume_production_start": "2012",
    "observed": "2026-10-06",
    "page_update_date": null
  },
  "id": "diverse-N51-TSMC",
  "title": "CoWoS",
  "url": "https://3dfabric.tsmc.com/english/dedicatedFoundry/technology/cowos.htm"
}

Dates

{
  "date_events": []
}

Organization owns the platform; CoWoS is not a separate corporate entity. Page is undated as observed October 6, 2026. Source supports packaging role but not uninspected foundry capacity, customer contracts or market share.

Governance and contracting hazards

Governance choices respond to asset specificity, uncertainty and the hazards of incomplete contracting.

A fast model service may still expose a firm to lock-in, sensitive context and accountability risks.

Cost savings alone do not eliminate dependence, adaptation or enforcement problems.

Parties face bounded rationality and may behave opportunistically.

A transaction can expose parties to dependence when investments are specific to that relationship. Uncertainty and incomplete contracting leave room for adaptation disputes and opportunistic behavior. Governance arrangements matter because they provide different safeguards and ways to resolve those problems. The framework examines transactions and their hazards, rather than treating the cheapest quoted service as automatically efficient.

A model vendor may offer low inference prices while becoming difficult to replace once a firm's retrieval system, evaluations and sensitive context depend on its interface. Examine switching, adaptation and enforcement alongside the quoted price.

Sources and details

Transaction Cost Economics: The Natural Progression

{
  "access_scope": "PDF retrieved; text inspected in introduction, section 2, section 3.2 and bibliography; page 459 visually inspected. No inspection of the complete 1975 book.",
  "dates": {
    "prize_lecture": "2009-12-08"
  },
  "id": "next-WILLIAMSON",
  "title": "Transaction Cost Economics: The Natural Progression",
  "url": "https://www.nobelprize.org/uploads/2018/06/williamson_lecture.pdf"
}

Dates

{
  "year": 1975
}

A retrospective lecture supports its own account; it does not establish every statement or edition of the earlier book. AI-vendor examples remain editorial relevance.

Accelerando

Charles Stross's novel Accelerando was released by its publisher as an ebook on July 5, 2005 and in paperback on June 27, 2006.

Its fictional posthuman setting features artificial intelligence surpassing human intellect, biotechnology, and self-replicating molecular nanotechnology.

The synopsis follows three generations of the Macx family, including the entrepreneur Manfred and his daughter Amber, who seeks opportunities as an indentured astronaut.

Editorial comparison frames their efforts to survive and find opportunities as an exploration of human agency amid dramatic technological and economic disruption.

Sources and details

Accelerando

{
  "access_scope": "Publisher synopsis and edition metadata inspected; author-site introduction failed to retrieve; novel full text not read.",
  "dates": {
    "ebook": "2005-07-05",
    "inspected_mass_market_paperback": "2006-06-27",
    "isbn": "9780441014156",
    "page_update_date": null
  },
  "id": "diverse-N51-ACCELERANDO",
  "title": "Accelerando",
  "url": "https://www.penguinrandomhouse.com/books/294259/accelerando-by-charles-stross/"
}

Dates

{
  "date_events": [],
  "date_note": "2005 collected novel/fix-up; some constituent stories appeared earlier. Publisher’s 2006 mass-market paperback field is a later-format date, while its ebook is dated July 5, 2005. Do not infer the first print-edition day solely from the ebook date.",
  "dated": true,
  "year": 2005
}

Publisher synopsis rather than full novel inspection. Do not infer detailed fictional markets, real-world causal influence or successful predictions.

Neuromancer

William Gibson’s novel Neuromancer follows Case, a data thief who loses access to cyberspace after his nervous system is damaged.

A new employer recruits him for an operation involving an unusually powerful artificial intelligence.

From an editorial perspective, this fictional setting offers a way to explore access, agency and dependence in digital environments.

Sources and details

Neuromancer

{
  "access_scope": "Publisher product details and synopsis inspected; this retrieval did not inspect the novel or establish first-publication date.",
  "dates": {
    "inspected_paperback": "2000-07-01",
    "isbn": "9780441007462",
    "page_update_date": null
  },
  "id": "diverse-N51-NEUROMANCER",
  "title": "Neuromancer",
  "url": "https://www.penguinrandomhouse.com/books/293994/neuromancer-by-william-gibson/"
}

Dates

{
  "date_events": [],
  "date_note": "1984 Ace edition is institutionally cataloged; later publisher reprints do not replace this year. This audit does not independently establish an exact first-release day.",
  "dated": true,
  "year": 1984
}

The inspected Ace paperback is dated 2000-07-01, ISBN 9780441007462; that manifestation date does not replace the original-work year. The synopsis supports only the bounded plot paraphrase. The prior autonomy claim remains historical and unverified by this evidence.

Computing Machinery and Intelligence

In the 1950 essay Computing Machinery and Intelligence, A. M. Turing replaces a definitional question about whether machines can think with a written-interrogation imitation game.

The designed written exchange explicitly separates intellectual testing from physical bodily resemblance.

Throughout the essay, Turing examines objections to machine intelligence and proposes educating a child-machine program.

Sources and details

Computing Machinery and Intelligence

{
  "authors": [
    "A. M. Turing"
  ],
  "id": "technical-turing-text",
  "inspected_version": "22-page teaching transcription, no transcription or revision date stated",
  "source_type": "university-hosted transcription of original primary essay",
  "title": "Computing Machinery and Intelligence",
  "url": "https://www.csee.umbc.edu/courses/471/papers/turing.pdf"
}

Dates

{
  "date_events": [],
  "date_note": "Mind LIX (236), October 1950, pp. 433–460.",
  "dated": true,
  "year": 1950
}

Treat proposed tests and expectations as arguments, not measured contemporary AI capability.

The Use of Knowledge in Society

In "The Use of Knowledge in Society," F. A. Hayek argues that economically relevant knowledge is dispersed across society rather than concentrated in a single planning authority.

He distinguishes general scientific knowledge from the particular knowledge of circumstances of time and place.

Using the tin example, Hayek argues that price signals can help people adjust to changing relative scarcity without knowing all its causes.

Sources and details

The Use of Knowledge in Society

{
  "access_scope": "Reprinted essay inspected in sections I, III, V and VI; original periodical scan not retrieved.",
  "dates": {
    "journal": "American Economic Review XXXV(4), 519–530",
    "original_publication": "1945-09"
  },
  "id": "next-HAYEK",
  "title": "The Use of Knowledge in Society",
  "url": "https://www.econlib.org/library/Essays/hykKnw.html"
}

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1945
}

Theoretical economic argument, not an empirical AI productivity result. Prices are not portrayed as perfect or universally sufficient information.

A Fast Learning Algorithm for Deep Belief Nets

Geoffrey E. Hinton, Simon Osindero, and Yee-Whye Teh present a hybrid deep generative model whose top two layers act as an undirected associative memory.

The architecture utilizes a greedy layer-by-layer learning algorithm that initializes a slower contrastive wake-sleep fine-tuning procedure.

The authors apply this framework to model handwritten digit images alongside their labels and evaluate classification performance on the MNIST test set.

Sources and details

A fast learning algorithm for deep belief nets

{
  "access_scope": "Byline, abstract and introduction inspected, including hybrid model, layerwise initialization, fine-tuning and MNIST evaluation; not journal version-of-record verification.",
  "dates": {
    "inspected_version": "Sixteen-page author-hosted manuscript marked To appear in Neural Computation 2006"
  },
  "id": "next-DBN",
  "title": "A fast learning algorithm for deep belief nets",
  "url": "https://www.cs.toronto.edu/~hinton/absps/fastnc.pdf"
}

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2006
}

Reported performance is specific to the described digit-recognition setup; no universal classifier or all deep-network comparison. The manuscript is not mislabeled as the final journal edition.

Activities and strategic fit

Strategy involves a distinctive configuration of activities, trade-offs and fit.

If everyone can buy similar AI tools, advantage depends on how activities reinforce each other.

Operational improvement alone can be widely copied; industry context still matters.

Competitive positions require choices that rivals cannot copy without changing their systems.

Operational effectiveness improves how an activity is performed; strategic positioning concerns which activities are performed and how they fit together. Trade-offs constrain imitation, while fit can make an activity system harder to copy piecemeal. The argument asks whether choices reinforce a distinctive position, rather than whether the firm has adopted the same useful technologies as its rivals.

A retailer's AI recommendations, purchasing policy and service promise may reinforce a particular customer proposition. Map those choices and their trade-offs. Installing a recommendation model by itself does not establish strategic fit or a durable advantage.

Sources and details

Strategy Explained

{
  "authors": [
    "Harvard Business School Institute for Strategy and Competitiveness"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "publication_date": null
  },
  "id": "B60-PORTER-INSTITUTE",
  "title": "Strategy Explained",
  "url": "https://www.isc.hbs.edu/strategy/Pages/strategy-explained.aspx"
}

Creating a Successful Strategy

{
  "authors": [
    "Harvard Business School Institute for Strategy and Competitiveness"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "publication_date": null
  },
  "id": "B60-PORTER-ACTIVITIES",
  "title": "Creating a Successful Strategy",
  "url": "https://www.isc.hbs.edu/strategy/creating-a-successful-strategy/Pages/default.aspx"
}

Dates

{
  "year": 1996
}

Retain the stronger existing family explanation. This pass adds later institute evidence rather than certifying every passage in the 1996 article.

Later HBS institute exposition, not newly inspected 1996 article body; original-article cases and existing AI application are not newly certified.

Information and invention

In his 1962 chapter 'Economic Welfare and the Allocation of Resources for Invention', Kenneth Arrow analyzes inventive activity through uncertainty, limited appropriation, and indivisibilities in information.

He explains that a buyer may require disclosure to evaluate the worth of information, even though disclosing it can compromise the seller's ability to charge for it.

Furthermore, while low-cost dissemination favors broad utilization once information exists, charging fees to finance its creation can restrict access.

Arrow's ideal-allocation comparison consequently predicts underinvestment in invention as well as underuse of information that has been successfully appropriated.

Sources and details

Economic Welfare and the Allocation of Resources for Invention

{
  "authors": [
    "Kenneth Arrow"
  ],
  "dates": {
    "book": "The Rate and Direction of Inventive Activity: Economic and Social Factors",
    "chapter_pages": "609–626",
    "exact_day": null,
    "inspection_date": "2026-10-07",
    "original_publication": "1962"
  },
  "id": "B60-ARROW",
  "title": "Economic Welfare and the Allocation of Resources for Invention",
  "url": "https://www.nber.org/system/files/chapters/c2144/c2144.pdf"
}

Dates

{
  "year": 1962
}

Economic model and its assumptions; not a universal instruction to disclose data or a measurement of AI returns.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Resources and durable advantage

In his 1991 paper 'Firm Resources and Sustained Competitive Advantage', Jay Barney assumes that strategic resources can differ across firms and remain imperfectly mobile.

Under this framework, resources support sustained advantage when they are valuable, rare, hard to imitate, and lack accessible strategic substitutes.

Barney notes that historical circumstances, causal ambiguity, and social complexity serve to obstruct competitive imitation.

Importantly, sustained competitive advantage is defined against competitive duplication rather than a specific duration of calendar years.

Sources and details

Firm Resources and Sustained Competitive Advantage

{
  "authors": [
    "Jay Barney"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "journal": "Journal of Management 17(1), 99–120",
    "original_publication": "1991-03",
    "scan_creation": "2002-01-31",
    "scan_footer": "Copyright 2001; original page identifies copyright 1991"
  },
  "id": "B60-BARNEY",
  "title": "Firm Resources and Sustained Competitive Advantage",
  "url": "https://josephmahoney.web.illinois.edu/BA545_Fall%202022/Barney%20%281991%29.pdf"
}

Dates

{
  "year": 1991
}

Use the 1991 conditions, not a later VRIO formulation. This framework does not establish that any named firm or AI asset has durable advantage.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Absorptive capacity

In their 1990 paper 'Absorptive Capacity: A New Perspective on Learning and Innovation', Wesley M. Cohen and Daniel A. Levinthal define absorptive capacity as the ability to recognize, assimilate, and commercially apply external knowledge.

They argue that related prior knowledge enables learning to accumulate, whereas diverse knowledge permits the creation of novel associations.

Organizational absorptive capacity also depends on communication across units and internal linkages among people's expertise.

While shared knowledge facilitates internal coordination, excessive specialization or uniformity can hinder an organization's learning from outside sources.

Sources and details

Absorptive Capacity: A New Perspective on Learning and Innovation

{
  "authors": [
    "Wesley M. Cohen",
    "Daniel A. Levinthal"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "journal": "Administrative Science Quarterly 35(1), 128–152",
    "original_publication": "1990-03",
    "scan_access_stamp": "2007-11-06"
  },
  "id": "B60-ABSORPTIVE",
  "title": "Absorptive Capacity: A New Perspective on Learning and Innovation",
  "url": "https://www.edegan.com/pdfs/Cohen%20Levinthal%20%281990%29%20-%20Absorptive%20Capacity.pdf"
}

Dates

{
  "year": 1990
}

Joint authorship retained. This pass verifies mechanism, not the article’s quantitative R&D estimates.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Adaptation as a capability

In 'Dynamic capabilities and strategic management', David J. Teece, Gary Pisano, and Amy Shuen define dynamic capabilities as a firm's ability to build, integrate, and reconfigure competences in response to changing environments.

Their framework is structured around organizational processes, existing asset positions, and historically available paths.

Within this structure, distinct operational roles are assigned to coordination, collective learning, and reconfiguration.

However, reconfiguration is costly, and a firm's potential adjustments remain constrained by its existing positions and historical paths.

Sources and details

Dynamic capabilities and strategic management

{
  "authors": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "journal": "Strategic Management Journal 18(7), 509–533",
    "original_issue": "1997-08",
    "publisher_platform_first_published_field": "1998-12-04"
  },
  "id": "B60-DYNAMIC",
  "title": "Dynamic capabilities and strategic management",
  "url": "https://sms.onlinelibrary.wiley.com/doi/pdf/10.1002/%28SICI%291097-0266%28199708%2918%3A7%3C509%3A%3AAID-SMJ882%3E3.0.CO%3B2-Z"
}

Dates

{
  "year": 1997
}

Original three-author framework. Do not replace it with the later sensing–seizing–transforming taxonomy or imply every change creates advantage.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Generative AI at Work

Erik Brynjolfsson, Danielle Li and Lindsey Raymond study the staggered introduction of a conversational assistant using data from 5,172 customer-support agents.

The inspected arXiv v2 uses difference-in-differences comparisons with time, worker and tenure controls.

It reports about 15% more resolved issues per hour on average, with larger gains among less-experienced or lower-skilled agents.

More-experienced and higher-skilled agents show smaller speed gains and some declines in measured conversation quality.

Sources and details

Generative AI at Work

{
  "authors": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey Raymond"
  ],
  "dates": {
    "arxiv_v2_metadata_date": "2024-11-06",
    "date_conflict_status": "Unresolved rendering/date conflict; HTML displayed date is not established as a new revision",
    "experimental_html_displayed_date": "2026-08-24",
    "first_arxiv_submission": "2023-04-23",
    "inspected_pdf_displayed_date": "2024-11-07",
    "inspected_version": "v2",
    "inspection_date": "2026-10-07",
    "revision_date": "2024-11-06"
  },
  "id": "B60-GENAI-WORK",
  "title": "Generative AI at Work",
  "url": "https://arxiv.org/html/2304.11771v2"
}

Dates

{
  "date_note": "2023 initial study; this description uses the November 2024 revision, later published in 2025.",
  "dated": true,
  "year": 2023
}

Retain the baseline’s correct 14% original/15% revised distinction. These claims bind v 2’s outcome and workplace sample; no macroeconomic or employment inference.

Keep original 14% and revised 15% estimates version-specific. v2 metadata date November 6, 2024; PDF date November 7, 2024; experimental HTML date August 24, 2026 is an unresolved rendering/date conflict, not a newly established revision.

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence

In 'Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence', Shakked Noy and Whitney Zhang evaluate 453 college-educated professionals performing two incentivized, occupation-specific writing tasks.

Half of the participants were randomly assigned ChatGPT access before the second task, after which experienced evaluators graded outputs blind to treatment status.

The author-hosted manuscript reports that average task completion time fell by 40% while rated output quality rose by 18%.

However, the study notes that these short tasks did not require precise factual accuracy or company-specific context, and the experiment did not measure wage or employment effects.

Sources and details

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence — author-hosted manuscript

{
  "authors": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "dates": {
    "doi": "10.1126/science.adh2586",
    "inspection_date": "2026-10-07",
    "journal": "Science 381(6654), 187–192",
    "journal_publication": "2023",
    "manuscript_revision_date": null
  },
  "id": "B60-NOY-LATER",
  "title": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence — author-hosted manuscript",
  "url": "https://shakkednoy.com/Noy%20Zhang%20NBER%20SI.pdf"
}

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence — early working paper

{
  "authors": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "manuscript_date": "2023-03-02",
    "peer_review_status_on_cover": "Working Paper (not peer reviewed)"
  },
  "id": "B60-NOY-EARLY",
  "title": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence — early working paper",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Noy_Zhang_1.pdf"
}

Dates

{
  "date_note": "March 2, 2023 author working paper; later Science publication is a distinct version.",
  "dated": true,
  "year": 2023
}

Later author-hosted manuscript is directly linked from the author’s Science entry. The supplied March 2 working paper has 444 participants and must remain a separate version.

March 2, 2023 working paper: 444 participants; later author-linked Science manuscript: 453 participants, 40% lower task time and 18% higher rated quality. Preserve both manifestations and the study limitations.

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

In the arXiv preprint 'GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models', Tyna Eloundou, Sam Manning, Pamela Mishkin, and Daniel Rock combine human and GPT-4 annotations to evaluate US occupational tasks.

They define exposure as a potential reduction of at least half the task time while maintaining quality, evaluating complementary software separately.

This assessment rubric measures potential impact without determining whether labor will ultimately be augmented or displaced.

The authors highlight subjective labeling and limited occupational expertise as study weaknesses, and they explicitly make no forecasts regarding adoption timelines.

Sources and details

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

{
  "authors": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "dates": {
    "first_submission": "2023-03-17",
    "inspected_version": "v5",
    "inspection_date": "2026-10-07",
    "revision_date": "2023-08-21"
  },
  "id": "B60-GPTS",
  "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models",
  "url": "https://arxiv.org/html/2303.10130v5"
}

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2023
}

Use 2023 v 5 explicitly. Do not turn exposure percentages into observed automation, job loss or realized productivity.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity

In 'Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity', Joel Becker, Nate Rush, Beth Barnes, and David Rein evaluated 246 real repository issues assigned to 16 experienced open-source developers under conditions that permitted or prohibited AI assistance.

Participants completed tasks in familiar codebases, predominantly using Cursor with Claude 3.5 and 3.7 when AI tools were allowed.

The July 2025 report estimated that completion times were 19% longer with AI access, even though developers expected and perceived a speedup.

The authors framed this outcome as an early-2025 result in a selected setting and cautioned against generalizing the findings to all developers or future AI tools.

Sources and details

Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity

{
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Beth Barnes",
    "David Rein"
  ],
  "dates": {
    "inspection_date": "2026-10-07",
    "later_update_notice": "Links to February 2026 follow-up; no exact page-revision history",
    "publication_date": "2025-07-10"
  },
  "id": "B60-METR-2025",
  "title": "Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity",
  "url": "https://metr.org/blog/2025-07-10-early-2025-ai-experienced-os-dev-study/"
}

Dates

{
  "date_note": "July 2025 report of early-2025 tools; explicitly qualified by the February 2026 follow-up.",
  "dated": true,
  "year": 2025
}

Historical dated report, not a present-day universal claim. Original report body read; linked paper appendices not re-audited.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

We are Changing our Developer Productivity Experiment Design

In the February 2026 METR report 'We are Changing our Developer Productivity Experiment Design', Joel Becker, Nate Rush, Tom Cunningham, David Rein, and Khalid Mahamud describe a follow-up trial begun in August 2025 with 10 returning and 47 new developers.

The authors report that developers' unwillingness to work without AI affected overall study participation as well as the types of tasks submitted for randomization.

The authors also identify lower compensation as a possible contributor to selection and concurrent use of AI agents as a complication for measuring time spent.

Consequently, METR judged its speedup estimates to be unreliable indicators of actual productivity impact and proposed altering its experimental design.

Sources and details

We are Changing our Developer Productivity Experiment Design

{
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "dates": {
    "followup_experiment_start": "2025-08",
    "inspection_date": "2026-10-07",
    "publication_date": "2026-02-24"
  },
  "id": "B60-METR-2026",
  "title": "We are Changing our Developer Productivity Experiment Design",
  "url": "https://metr.org/blog/2026-02-24-uplift-update/"
}

Dates

{
  "date_note": "February 24, 2026: selection bias and time measurement make current estimates unreliable; not a verified reversal estimate.",
  "dated": true,
  "year": 2026
}

Do not present the raw negative time-difference estimates as reliable current gains or a precise reversal of the earlier trial.

METR February 2026 reports selection, participation and time-measurement limitations. Do not derive an exact reliable current productivity gain or a precise reversal of the earlier trial.

Machines that evolve

In Samuel Butler's novel 'Erewhon; Or, Over the Range', a fictional society destroys and prohibits newer machinery based on an argument concerning machine evolution.

The embedded treatise reasons from the rapid development of machines to the potential for their future ascendancy over humankind.

It further portrays human maintenance and manufacturing activities as constituent elements of a potential machine reproductive system.

This fictional narrative provides an editorial lens on growing technological dependence and control through a satirical argument.

Sources and details

Erewhon; Or, Over the Range

{
  "authors": [
    "Samuel Butler"
  ],
  "dates": {
    "gutenberg_release": "1999-09-01",
    "gutenberg_update": "2025-08-05",
    "inspection_date": "2026-10-07",
    "original_publication": "1872-03",
    "revised_preface_date": "1901-08-07"
  },
  "id": "B60-EREWHON",
  "title": "Erewhon; Or, Over the Range",
  "url": "https://www.gutenberg.org/cache/epub/1906/pg1906-images.html"
}

Dates

{
  "year": 1872
}

Primary fiction, not evidence of a future trajectory. The inspected text includes 1901 revisions.

Fictional argument in an edition containing 1901 revisions; contemporary AI relevance is editorial, not prediction or documented influence.

Erewhon; or, Over the Range

In Samuel Butler's 'Erewhon; Or, Over the Range', the revised preface notes that the work first appeared in late March 1872 and is itself dated August 7, 1901.

Within the narrative, the traveler presents a translated fictional treatise across the section titled 'The Book of the Machines' and its continuations.

Its arguments explore the evolving capabilities of machines, their reliance on human servicing, and the societal resistance to their development.

Sources and details

Erewhon; Or, Over the Range

{
  "authors": [
    "Samuel Butler"
  ],
  "dates": {
    "gutenberg_release": "1999-09-01",
    "gutenberg_update": "2025-08-05",
    "inspection_date": "2026-10-07",
    "original_publication": "1872-03",
    "revised_preface_date": "1901-08-07"
  },
  "id": "B60-EREWHON",
  "title": "Erewhon; Or, Over the Range",
  "url": "https://www.gutenberg.org/cache/epub/1906/pg1906-images.html"
}

Dates

{
  "date_events": [],
  "date_note": "Distinct from the earlier essay.",
  "dated": true,
  "year": 1872
}

Use this edition’s chapter locators only; no new Atlas chapter mapping or claim of technical influence.

Fictional work; original 1872 publication, 1901 revision and digital dates remain distinct. Source chapter locators are not Atlas chapter mappings.

Testing a machine

An evaluation of an AI's consciousness turns into manipulation of the evaluator.

Fictional interrogation of tests, deception, personhood and power.

This is a fictional exploration of testing, deception, personhood and power, not evidence about real AI systems or a scientific test of consciousness.

Sources and details

Ex Machina

{
  "authors": [
    "Alex Garland (writer and director)",
    "A24 (distributor page)"
  ],
  "dates": {
    "distributor_work_year": "2015",
    "inspection_date": "2026-10-07",
    "page_publication_date": null
  },
  "id": "B60-EX-MACHINA",
  "title": "Ex Machina",
  "url": "https://a24films.com/films/ex-machina"
}

Label the source as A24 distributor synopsis and the inference as editorial. Keep the fiction/scientific-evidence limit close to the main text.

Dates

{
  "year": 2015
}

Official synopsis only; no scientific validation or documented influence on public opinion.

Official synopsis of fiction; intelligence/consciousness testing is a plot premise, not scientific validation or evidence of public influence.

Dependence on the machine

An isolated society relies entirely on a global machine it no longer understands.

Literary lens on network dependence and loss of human agency.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

The Machine Stops

{
  "authors": [
    "E. M. Forster"
  ],
  "dates": {
    "first_publication": "1909",
    "inspection_date": "2026-10-07",
    "publication_venue": "Oxford and Cambridge Review",
    "transcription_date": null
  },
  "id": "B60-MACHINE-STOPS",
  "title": "The Machine Stops",
  "url": "https://nissenbaum.tech.cornell.edu/papers/machine_stops.pdf"
}

Fiction and editorial comparison, not empirical prediction or technical proof.

Dates

{
  "year": 1909
}

Fictional dependence mechanism, not a prediction or empirical result.

Fictional dependence scenario; editorial comparison only, no empirical prediction or causal influence.

Distributed language representations

A learned distributed representation supports probabilistic modeling of word sequences.

Representations let learning generalize beyond a table of observed word sequences.

Predicting sequences does not guarantee grounded knowledge.

Shared word representations capture useful statistical regularities.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "Byline; Section 1.1; Section 3 opening and parallelization; Sections 4–4.2, including corpus setup and reported perplexity comparisons.",
  "authors": [
    "Yoshua Bengio",
    "Réjean Ducharme",
    "Pascal Vincent",
    "Christian Jauvin"
  ],
  "date_qualification": "PDF separately labels Submitted 4/02 and Published 2/03; no later revision date asserted.",
  "dates": {
    "accessed_at": "2026-10-07",
    "date_qualification": "PDF separately labels Submitted 4/02 and Published 2/03; no later revision date asserted.",
    "original_submission_date": "2002-04",
    "publication_date": "2003-02",
    "version_date": null,
    "version_inspected": "Publisher PDF with printed journal pagination"
  },
  "id": "technical-broader-bengio2003",
  "original_submission_date": "2002-04",
  "publication": "Journal of Machine Learning Research 3, 1137–1155",
  "publication_date": "2003-02",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://www.jmlr.org/papers/volume3/bengio03a/bengio03a.pdf",
  "version_date": null,
  "version_inspected": "Publisher PDF with printed journal pagination"
}

Dates

{
  "year": 2003
}

Corpus perplexity is the measured outcome; grounding or general language understanding is not established by these experiments.

Brown corpus and Associated Press news corpus are distinct; Brown is not uniformly news. Outcome is corpus perplexity, not grounding or understanding.

Residual learning

Residual connections make very deep networks easier to optimize in the reported experiments.

Architecture can make additional compute more productive.

Successful depth on vision benchmarks does not settle robustness or every training difficulty.

Residual mappings are easier to learn in the studied configuration.

Sources and details

Deep Residual Learning for Image Recognition

{
  "access_scope": "Title/byline, Sections 1, 3.1–3.4, 4.1–4.2, Tables 2 and 6; selected body passages, not the complete detection appendix.",
  "authors": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "date_qualification": "The inspected v1 is the initial public submission dated 2015-12-10; no later revision is inspected here.",
  "dates": {
    "accessed_at": "2026-10-07",
    "date_qualification": "The inspected v1 is the initial public submission dated 2015-12-10; no later revision is inspected here.",
    "original_public_release_date": "2015-12-10",
    "publication_date": "2015-12-10",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2015-12-10",
    "version_inspected": "arXiv:1512.03385v1, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-resnet2015",
  "original_public_release_date": "2015-12-10",
  "publication_date": "2015-12-10",
  "publication_date_type": "initial arXiv public submission",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://arxiv.org/pdf/1512.03385v1",
  "version_date": "2015-12-10",
  "version_inspected": "arXiv:1512.03385v1, full PDF available; selected substantive sections inspected"
}

Dates

{
  "year": 2016
}

Optimization benefits do not imply that arbitrarily increasing depth improves generalization. The authors attribute the 1202-layer result to overfitting.

Inspected ResNet v1 dated December 10, 2015 is the initial public submission, not a later revision; optimization and generalization are separate.

Score-based generation

Estimated score functions and sampling dynamics provide a route to generative modeling.

Generation trades off fidelity, coverage and computational work.

Sampling quality and cost depend on learned scores and the sampling process.

Score estimates across noise levels support sampling.

Sources and details

Generative Modeling by Estimating Gradients of the Data Distribution

{
  "access_scope": "Sections 3.2 and 4.1–4.3; Section 5 setup; Table 1. Full PDF available; image grids and complete appendices not inspected.",
  "authors": [
    "Yang Song",
    "Stefano Ermon"
  ],
  "conference_publication_year": "2019",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2019",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2019-07-12",
    "publication_date": "2019-07-12",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2020-10-10",
    "version_inspected": "arXiv:1907.05600v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-ncsn2019",
  "original_public_release_date": "2019-07-12",
  "publication_date": "2019-07-12",
  "publication_date_type": "initial arXiv public submission",
  "title": "Generative Modeling by Estimating Gradients of the Data Distribution",
  "url": "https://arxiv.org/pdf/1907.05600v3",
  "version_date": "2020-10-10",
  "version_inspected": "arXiv:1907.05600v3, full PDF available; selected substantive sections inspected"
}

Dates

{
  "year": 2019
}

Table 1 reports different rankings under Inception score and FID; it does not establish superiority on every sample-quality criterion.

Estimate gradients of log densities of Gaussian-perturbed distributions at each noise level, not unperturbed data-density gradients. Dataset, noise schedule and metric conditions remain scoped.

Sequence-to-sequence learning

LSTMs map input sequences into representations used to generate output sequences.

A reusable learning recipe changes how translation and other sequence tasks are engineered.

Compressed representations can struggle with long inputs.

Training pairs and model capacity support learned mappings.

Sources and details

Sequence to Sequence Learning with Neural Networks

{
  "access_scope": "Section 2; Sections 3.3–3.8, Tables 1–2 and Figure 3; related-work context. Appendices are not claimed inspected.",
  "authors": [
    "Ilya Sutskever",
    "Oriol Vinyals",
    "Quoc V. Le"
  ],
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2014-09-10",
    "publication_date": "2014-09-10",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2014-12-14",
    "version_inspected": "arXiv:1409.3215v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-seq2seq2014",
  "original_public_release_date": "2014-09-10",
  "publication_date": "2014-09-10",
  "publication_date_type": "initial arXiv public submission",
  "title": "Sequence to Sequence Learning with Neural Networks",
  "url": "https://arxiv.org/pdf/1409.3215v3",
  "version_date": "2014-12-14",
  "version_inspected": "arXiv:1409.3215v3, full PDF available; selected substantive sections inspected"
}

The fixed-representation caveat is an editorial boundary; the inspected paper reports favorable results on long sentences.

Dates

{
  "year": 2014
}

Do not use the baseline’s generic long-input warning to misdescribe this paper’s favorable long-sentence findings. BLEU variant and ensemble setting matter.

Scope the fixed-state encoder to this 2014 LSTM formulation. Preserve favorable long-sentence results; 34.81 BLEU is five reversed LSTMs, beam 12, WMT14 English–French, versus 33.30 phrase-based baseline.

Latent-variable generation

A variational objective and reparameterization enable efficient learning in latent-variable models.

Generative AI includes probabilistic latent-variable approaches, not only adversarial or autoregressive models.

The approximation and objective constrain what is learned.

The chosen approximate posterior and model are tractable enough to optimize.

Sources and details

Auto-Encoding Variational Bayes

{
  "access_scope": "Sections 2.1–2.3, Algorithm 1, Section 4 independent-work note, and Section 5 experiments including Figures 2–3. No complete appendix review.",
  "authors": [
    "Diederik P. Kingma",
    "Max Welling"
  ],
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2013-12-20",
    "publication_date": "2013-12-20",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2022-12-10",
    "version_inspected": "arXiv:1312.6114v11, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-vae2013",
  "original_public_release_date": "2013-12-20",
  "publication_date": "2013-12-20",
  "publication_date_type": "initial arXiv public submission",
  "title": "Auto-Encoding Variational Bayes",
  "url": "https://arxiv.org/pdf/1312.6114v11",
  "version_date": "2022-12-10",
  "version_inspected": "arXiv:1312.6114v11, full PDF available; selected substantive sections inspected"
}

Dates

{
  "year": 2014
}

Scope assumes continuous latent variables and suitable differentiability. Section 4 acknowledges independent related work by Rezende, Mohamed and Wierstra.

The marginal-likelihood comparison used three latent variables; the separate low-dimensional visualization is described as two-dimensional. Continuous-latent-variable and differentiability assumptions, and the independent related work, remain qualified.

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

Presented deep bidirectional Transformer pretraining with masked-language modeling and next-sentence prediction, followed by task-specific fine-tuning.

2018 preprint; 2019 conference. BERT did not invent Transformers, contextual representations, or every use of bidirectional language modeling.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Sections 3.1–3.2, 4.1, 5.1 and 5.3; Tables 1, 5 and 7; Appendix A.4 comparison; primary conference metadata.",
  "authors": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "conference_pages": "4171–4186",
  "conference_publication_date": "2019-06",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_date": "2019-06",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2018-10-11",
    "publication_date": "2018-10-11",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2019-05-24",
    "version_inspected": "arXiv:1810.04805v2, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-bert2018",
  "original_public_release_date": "2018-10-11",
  "publication_date": "2018-10-11",
  "publication_date_type": "initial arXiv public submission",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://arxiv.org/pdf/1810.04805v2",
  "version_date": "2019-05-24",
  "version_inspected": "arXiv:1810.04805v2, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "2018 preprint / NAACL 2019. GPT-3 is a distinct 2020 anchor.",
  "dated": true,
  "year": 2018
}

Original 2018 preprint and June 2019 conference publication are separate. These experiments do not establish NSP as necessary for every later model.

Fine-tuning instability/restarts concern BERT_LARGE on small datasets. In Table 5, compare BERT_BASE with No NSP, then No NSP with LTR & No NSP; the latter also changes masked bidirectional pretraining to left-to-right. Do not assert one isolated effect for every downstream task or model.

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

FlashAttention utilizes tiled computation to process attention blocks within fast on-chip SRAM, curbing input-output transfers to GPU high-bandwidth memory without approximating exact dense attention.

Recomputing intermediate attention values during the backward pass prevents having to store quadratic-sized attention matrices in GPU memory.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Sections 3.1–3.3; Section 4.1 Tables 1–2; Section 5 limitations. Full backward proofs and complete appendices not reviewed.",
  "authors": [
    "Tri Dao",
    "Daniel Y. Fu",
    "Stefano Ermon",
    "Atri Rudra",
    "Christopher Ré"
  ],
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2022-05-27",
    "publication_date": "2022-05-27",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2022-06-23",
    "version_inspected": "arXiv:2205.14135v2, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-flashattention2022",
  "original_public_release_date": "2022-05-27",
  "publication_date": "2022-05-27",
  "publication_date_type": "initial arXiv public submission",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/pdf/2205.14135v2",
  "version_date": "2022-06-23",
  "version_inspected": "arXiv:2205.14135v2, full PDF available; selected substantive sections inspected"
}

Exact dense attention retains quadratic arithmetic; the benefit concerns memory traffic, memory footprint and measured runtime.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2022
}

Memory and I/O improvements do not make exact dense attention’s arithmetic linear. Published speedups are hardware- and baseline-specific.

FlashAttention measured speedups are hardware/baseline-specific: BERT-large 17.4 versus 20.0 minutes averaged over ten runs on eight A100 GPUs. Dense exact attention arithmetic remains quadratic.

Inductive Representation Learning on Large Graphs

Introduced an inductive framework that samples and aggregates local neighborhood features to generate embeddings for unseen nodes.

The canonical author credit Rex Ying belongs to the researcher also known as Zhitao Ying; resolve aliases before creating a second person.

Sources and details

Inductive Representation Learning on Large Graphs

{
  "access_scope": "Byline/equal-contribution footnote; Sections 1, 3.1–3.3, 4.1–4.2; Algorithm 1 and Table 1. Full appendix/proofs not reviewed.",
  "authors": [
    "William L. Hamilton",
    "Rex Ying",
    "Jure Leskovec"
  ],
  "conference_publication_year": "2017",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2017",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2017-06-07",
    "publication_date": "2017-06-07",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2018-09-10",
    "version_inspected": "arXiv:1706.02216v4, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-graphsage2017",
  "original_public_release_date": "2017-06-07",
  "publication_date": "2017-06-07",
  "publication_date_type": "initial arXiv public submission",
  "title": "Inductive Representation Learning on Large Graphs",
  "url": "https://arxiv.org/pdf/1706.02216v4",
  "version_date": "2018-09-10",
  "version_inspected": "arXiv:1706.02216v4, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "Arxiv first submission date: 2017-06-07; Arxiv first submission year: 2017; Formal publication year: 2017; Formal venue: NeurIPS (then NIPS); Venue evidence note: Published in NIPS 2017; version with full appendix and minor corrections; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2017
}

Cross-graph use assumes compatible input features; structural features can be supplied where other attributes are unavailable.

GraphSAGE samples neighborhoods and learns aggregation functions; the neighborhood sampler is not learned. Rex Ying / Zhitao Ying alias equivalence is unverified and excluded from new draft claims.

Bootstrap your own latent: A new approach to self-supervised Learning

Introduced self-supervised learning by predicting a slowly updated target network's representation of another augmented view without explicit negative pairs.

Absence of explicit negatives does not mean absence of architectural and optimization measures that prevent collapse.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Full byline; Sections 3.1–3.2; Section 4, Linear evaluation on ImageNet, Table 1(a); Section 5 predictor ablation; primary NeurIPS metadata. Complete appendices not inspected.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "conference_publication_year": "2020",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2020",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2020-06-13",
    "publication_date": "2020-06-13",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2020-09-10",
    "version_inspected": "arXiv:2006.07733v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-byol2020",
  "original_public_release_date": "2020-06-13",
  "publication_date": "2020-06-13",
  "publication_date_type": "initial arXiv public submission",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/pdf/2006.07733v3",
  "version_date": "2020-09-10",
  "version_inspected": "arXiv:2006.07733v3, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "Arxiv first submission date: 2020-06-13; Arxiv first submission year: 2020; Formal publication year: 2020; Formal venue: NeurIPS; Formal source url: https://papers.nips.cc/paper/2020/hash/f3ada80d5c4ee70142b17b8192b2958e-Abstract.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2020
}

No explicit negatives does not mean no anti-collapse design. The argument is not an unconditional theorem for arbitrary architectures or data.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Momentum Contrast for Unsupervised Visual Representation Learning

Introduced momentum contrast, using a moving-average encoder and a queue to support a large, consistent dictionary for contrastive visual learning.

2019 preprint; 2020 conference. Distinguish this original method from MoCo v2 and v3.

Sources and details

Momentum Contrast for Unsupervised Visual Representation Learning

{
  "access_scope": "Sections 3.1–3.2 and 4.2, Tables 2–5; arXiv camera-ready metadata. Complete downstream appendix not inspected.",
  "authors": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "conference_publication_year": "2020",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2020",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2019-11-13",
    "publication_date": "2019-11-13",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2020-03-23",
    "version_inspected": "arXiv:1911.05722v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-moco2019",
  "original_public_release_date": "2019-11-13",
  "publication_date": "2019-11-13",
  "publication_date_type": "initial arXiv public submission",
  "title": "Momentum Contrast for Unsupervised Visual Representation Learning",
  "url": "https://arxiv.org/pdf/1911.05722v3",
  "version_date": "2020-03-23",
  "version_inspected": "arXiv:1911.05722v3, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "Arxiv first submission date: 2019-11-13; Arxiv first submission year: 2019; Formal publication year: 2020; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content_CVPR_2020/html/He_Momentum_Contrast_for_Unsupervised_Visual_Representation_Learning_CVPR_2020_paper.html; Venue evidence note: CVPR 2020 camera-ready. Code: this https URL; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2020
}

This is original MoCo, not versions 2 or 3. Task, detector, pretraining data and fine-tuning schedule qualify transfer comparisons.

Original MoCo; VOC R50-C4 detector, ImageNet pretraining, trainval07+12 fine-tuning and test2007 evaluation qualify 55.9 versus 53.5 AP, averaged over five trials.

Ex Machina

An encounter with an embodied artificial agent explores tests of consciousness, deception and asymmetric power.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims. Field qualification: catalog year confirmed first public event partially checked.

Named principal creative or scholarly roles; not a complete production-credit list.

Sources and details

Ex Machina

{
  "authors": [
    "Alex Garland (writer and director)",
    "A24 (distributor page)"
  ],
  "dates": {
    "distributor_work_year": "2015",
    "inspection_date": "2026-10-07",
    "page_publication_date": null
  },
  "id": "B60-EX-MACHINA",
  "title": "Ex Machina",
  "url": "https://a24films.com/films/ex-machina"
}

Distributor synopsis and credits only; retain 2014/2015 chronology and first-screening caveat.

Dates

{
  "date_events": [
    {
      "kind": "catalogued_feature_and_preview_year",
      "year": 2014
    },
    {
      "kind": "commercial_release",
      "year": 2015
    }
  ],
  "date_note": "BFI catalogs 2014; its December 2014 preview is documented in a mirrored BFI press program. A24 uses 2015 for commercial distribution. Exact first-preview day not confirmed from a directly inspected original program.",
  "dated": true,
  "year": 2014
}

Preserve prior first-screening qualifications; 2015 distributor year does not resolve the 2014 preview history. No full-film inspection claimed.

Official distributor synopsis/credits; 2015 distributor year does not establish first screening or resolve qualified 2014 preview history. No full-film inspection.

A Simple Framework for Contrastive Learning of Visual Representations

Presented a simple contrastive visual-representation-learning framework, emphasizing augmentation, projection heads, and training scale.

A major contrastive-learning contribution, not the invention of contrastive learning or all self-supervised visual learning.

Sources and details

A Simple Framework for Contrastive Learning of Visual Representations

{
  "access_scope": "Sections 2.1, 3, 4.2 and 5.2; Figure 2, Figure 9, Table 6; primary ICML proceedings metadata.",
  "authors": [
    "Ting Chen",
    "Simon Kornblith",
    "Mohammad Norouzi",
    "Geoffrey Hinton"
  ],
  "conference_pages": "1597–1607",
  "conference_publication_year": "2020",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2020",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2020-02-13",
    "publication_date": "2020-02-13",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2020-07-01",
    "version_inspected": "arXiv:2002.05709v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-simclr2020",
  "original_public_release_date": "2020-02-13",
  "publication_date": "2020-02-13",
  "publication_date_type": "initial arXiv public submission",
  "title": "A Simple Framework for Contrastive Learning of Visual Representations",
  "url": "https://arxiv.org/pdf/2002.05709v3",
  "version_date": "2020-07-01",
  "version_inspected": "arXiv:2002.05709v3, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "Arxiv first submission date: 2020-02-13; Arxiv first submission year: 2020; Formal publication year: 2020; Formal venue: ICML; Formal source url: https://proceedings.mlr.press/v119/chen20j.html; Venue evidence note: ICML'2020. Code and pretrained models at this https URL; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2020
}

Do not attribute the 76.5% result to standard-width ResNet-50 or read linear evaluation as label-free downstream classification.

Projection-head representation improvement is Section 4.2, Figure 8, PDF page 6. ImageNet linear evaluation is 69.3% for standard ResNet-50 versus 76.5% for the four-times-wider variant; downstream linear evaluation uses labels.

The Machine Stops

Dependence on networked infrastructure and loss of human agency.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Named principal creative or scholarly roles; not a complete production-credit list.

Sources and details

The Machine Stops

{
  "authors": [
    "E. M. Forster"
  ],
  "dates": {
    "first_publication": "1909",
    "inspection_date": "2026-10-07",
    "publication_venue": "Oxford and Cambridge Review",
    "transcription_date": null
  },
  "id": "B60-MACHINE-STOPS",
  "title": "The Machine Stops",
  "url": "https://nissenbaum.tech.cornell.edu/papers/machine_stops.pdf"
}

Fiction; modern-network comparison is editorial. No demonstrated prediction, influence or real technical capability.

Dates

{
  "date_events": [],
  "date_note": "First published November 1909; not the 2024 collection date.",
  "dated": true,
  "year": 1909
}

Undated transcription, not first-print facsimile. Modern network comparisons remain editorial.

Undated university transcription of fiction with 1909 first-publication metadata, not a first-print facsimile or demonstrated influence.

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

Derived a preference-learning objective that directly optimizes a language-model policy under a particular reward-policy relationship, avoiding a separate fitted reward model and RL loop.

DPO is not a guarantee of human alignment or safety. Preserve all six authors; arXiv and proceedings metadata differ in the order of Manning and Ermon.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Full byline; Sections 3–4, 6 setup, 6.3/Table 1 distribution-shift experiment, 6.4/Table 2 evaluation comparison, and 7 limitations; primary proceedings byline. Full proofs not independently checked.",
  "authors": [
    "Rafael Rafailov",
    "Archit Sharma",
    "Eric Mitchell",
    "Stefano Ermon",
    "Christopher D. Manning",
    "Chelsea Finn"
  ],
  "conference_publication_year": "2023",
  "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
  "dates": {
    "accessed_at": "2026-10-07",
    "conference_publication_year": "2023",
    "date_qualification": "Original public submission and inspected revision are distinct. Earlier versions were not collated; claims describe the inspected manifestation.",
    "original_public_release_date": "2023-05-29",
    "publication_date": "2023-05-29",
    "publication_date_type": "initial arXiv public submission",
    "version_date": "2024-07-29",
    "version_inspected": "arXiv:2305.18290v3, full PDF available; selected substantive sections inspected"
  },
  "id": "technical-broader-dpo2023",
  "original_public_release_date": "2023-05-29",
  "publication_date": "2023-05-29",
  "publication_date_type": "initial arXiv public submission",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/pdf/2305.18290v3",
  "version_date": "2024-07-29",
  "version_inspected": "arXiv:2305.18290v3, full PDF available; selected substantive sections inspected"
}

Dates

{
  "date_note": "Arxiv first submission date: 2023-05-29; Arxiv first submission year: 2023; Formal publication year: 2023; Formal venue: NeurIPS; Formal source url: https://proceedings.neurips.cc/paper_files/paper/2023/hash/a85b405ed65c6477a4fe8302b5e06ce7-Abstract-Conference.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2023
}

Preference fitting does not establish universal safety or truthfulness. Preserve the manifestation-specific author-order difference without dropping or duplicating collaborators.

Use only the inspected source passages, work-specific collaborative authorship and stated task/evaluation conditions. Baseline context is comparison material, not newly certified evidence.

Adaptive linear elements

Widrow and Hoff’s adaptive element forms a weighted sum of its inputs and applies a threshold to produce a classification.

During learning, the desired response is compared with the sum before thresholding, and weights are adjusted using the current input and this error to reduce squared error.

Their physical ADALINE demonstrator learned patterns presented on a 4×4 switch array, with its experience stored in the adjustable weights.

A single such threshold element can represent only linearly separable classifications, so this learning procedure does not make one element capable of every logical function.

Sources and details

Adaptive Switching Circuits

{
  "access_scope": "PDF downloaded from Stanford; printed pp.96–99 rendered and visually read. Web PDF returned zero text lines, so access is not inferred from HTTP success.",
  "authors": [
    "Bernard Widrow",
    "Marcian E. Hoff"
  ],
  "dates": {
    "date": "1960-08",
    "retrieval_date": "2026-10-07",
    "version": "Original scanned IRE WESCON Convention Record paper, volume 4, pp.96–104"
  },
  "id": "adaline::adaline-paper",
  "title": "Adaptive Switching Circuits",
  "url": "https://isl.stanford.edu/~widrow/papers/c1960adaptiveswitching.pdf"
}

Widrow Publications

{
  "access_scope": "Primary author bibliography directly inspected.",
  "authors": [
    "B. Widrow",
    "M. E. Hoff, Jr."
  ],
  "dates": {
    "date": null,
    "retrieval_date": "2026-10-07",
    "version": "Author-maintained institutional bibliography"
  },
  "id": "adaline::adaline-bibliography",
  "title": "Widrow Publications",
  "url": "https://www-isl.stanford.edu/~widrow/publications.html"
}

Retain the August 1960 original versus later republication; preserve Hoff/Jr. source-role provenance and the distinction between pre-threshold squared error and classification mistakes.

Keep the distinction between pre-quantization squared error and classification error; equivalence statements in the paper rely on stated statistical assumptions.

The PDF byline says Marcian E. Hoff; the institutional bibliography supplies Jr. Preserve that provenance.

No multilayer backpropagation, universal representational claim or exhaustive experimental audit is established.

Dates

{
  "year": 1960
}

Keep the distinction between pre-quantization squared error and classification error; equivalence statements in the paper rely on stated statistical assumptions.

The PDF byline says Marcian E. Hoff; the institutional bibliography supplies Jr. Preserve that provenance.

No multilayer backpropagation, universal representational claim or exhaustive experimental audit is established.

Substitution and complementarity

Automation substitutes for some tasks while complementing other human capabilities and changing demand for work.

Occupation labels conceal mixtures of routine and adaptive work.

Past persistence of jobs is not a guarantee about every future technology or every worker.

Technology affects tasks unevenly and demand adjusts.

Codifiable work and tasks requiring adaptation respond differently. Evaluating an entire job as one automatable unit loses that distinction.

Study drafting, negotiation and accountability separately within a legal-services role.

Sources and details

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

{
  "access_scope": "Publisher abstract and metadata directly inspected.",
  "dates": {
    "date": "2015, Summer",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Perspectives 29(3), 3–30"
  },
  "id": "autor-jobs::autor_aea",
  "title": "Why Are There Still So Many Jobs? The History and Future of Workplace Automation",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.29.3.3"
}

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

{
  "access_scope": "Author-hosted full article; header and pp. 4–7 inspected.",
  "dates": {
    "date": "2015, Summer",
    "retrieval_date": "2026-10-07",
    "version": "Published journal PDF; filename says 2014 but printed issue is Summer 2015"
  },
  "id": "autor-jobs::autor_mit",
  "title": "Why Are There Still So Many Jobs? The History and Future of Workplace Automation",
  "url": "https://economics.mit.edu/sites/default/files/publications/why%20are%20there%20still%20jobs%202014.pdf"
}

Keep both baseline depth sentences, the legal-services example and the no-guarantee limit visible. If a date note is refreshed, use Summer 2015 JEP publication, not an unverified first-public claim; retain the old note in provenance.

The job-level implication in sentence 2 is existing editorial synthesis, grounded in the task distinction.

Retain the warning that historical job persistence does not guarantee future work for everyone.

Legal-services example is an editorial application, not an observed study case.

Dates

{
  "year": 2015
}

The job-level implication in sentence 2 is existing editorial synthesis, grounded in the task distinction.

Retain the warning that historical job persistence does not guarantee future work for everyone.

Legal-services example is an editorial application, not an observed study case.

Changing tasks, limited early earnings effects

Humlum and Vestergaard link adoption surveys in 11 highly exposed Danish occupations to administrative labor-market records through December 2024.

The March 13, 2026 revision estimates earnings and recorded-hours effects near zero, with confidence intervals excluding average effects larger than 2%.

Work nevertheless changes through new content-generation, oversight and integration tasks.

Adopters also move toward higher-paying occupations where chatbots are more relevant, but too few make these transitions to shift average earnings.

Sources and details

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "Primary institutional full PDF re-opened independently; cover, abstract and introduction pp. 1–4 inspected.",
  "dates": {
    "date": "2026-03-13",
    "retrieval_date": "2026-10-07",
    "version": "RFBerlin Discussion Paper 078/26; current March 2026 revision"
  },
  "id": "denmark-labor::still_march",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.rfberlin.com/wp-content/uploads/2026/03/26078.pdf"
}

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "Primary indexed abstract and version metadata reverified; direct open failed.",
  "dates": {
    "date": {
      "issue": "2025-05",
      "revision": "2026-03"
    },
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 33777, current landing-page record"
  },
  "id": "denmark-labor::still_nber",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.nber.org/papers/w33777"
}

Retain the existing work-content/mobility example and worker-heterogeneity depth. Display March 13, 2026 content version separately from the 2025 work identity; keep the December 2024 horizon, observational-design and studied-average limits and the distinction between self-reports and administrative records.

Self-reported benefits are distinct from administrative earnings and hours.

The observational difference-in-differences design is not a randomized adoption experiment.

Bounds apply to studied averages and period, not every worker, all countries or future effects.

The original and October 2025 versions must not supply numerical claims for the March 2026 revision.

Dates

{
  "year": 2025
}

Self-reported benefits are distinct from administrative earnings and hours.

The observational difference-in-differences design is not a randomized adoption experiment.

Bounds apply to studied averages and period, not every worker, all countries or future effects.

The original and October 2025 versions must not supply numerical claims for the March 2026 revision.

Diffusion for robot control

Diffusion Policy learns from demonstrations to generate robot action sequences by repeatedly denoising them while conditioning on the robot’s observations.

It predicts several future actions but executes only a portion before observing again and replanning, balancing continuity with responsiveness.

In the paper’s Push-T example, it can represent routes around either side of an object and commit to one route during an execution.

Its evidence comes from specific simulated and physical manipulation tasks, so these results do not establish reliable control in arbitrary environments.

Sources and details

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Cheng Chi",
    "Siyuan Feng",
    "Yilun Du",
    "Zhenjia Xu",
    "Eric Cousineau",
    "Benjamin Burchfiel",
    "Shuran Song"
  ],
  "dates": {
    "date": "2023-06-01",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v4, 2023 conference-era version"
  },
  "id": "diffusion-policy::diffusion-policy-2023",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/pdf/2303.04137v4"
}

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Primary venue record directly inspected.",
  "authors": [
    "Cheng Chi",
    "Siyuan Feng",
    "Yilun Du",
    "Zhenjia Xu",
    "Eric Cousineau",
    "Benjamin CM Burchfiel",
    "Shuran Song"
  ],
  "dates": {
    "date": "2023-07",
    "retrieval_date": "2026-10-07",
    "version": "Robotics: Science and Systems XIX, DOI 10.15607/RSS.2023.XIX.026"
  },
  "id": "diffusion-policy::diffusion-policy-rss",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://www.roboticsproceedings.org/rss19/p026.html"
}

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Primary repository metadata directly inspected.",
  "authors": [
    "Cheng Chi",
    "Zhenjia Xu",
    "Siyuan Feng",
    "Eric Cousineau",
    "Yilun Du",
    "Benjamin Burchfiel",
    "Russ Tedrake",
    "Shuran Song"
  ],
  "dates": {
    "date": "2024-03-14",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v5; explicitly extended journal version of RSS2023"
  },
  "id": "diffusion-policy::diffusion-policy-v5",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137"
}

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Cheng Chi",
    "Siyuan Feng",
    "Yilun Du",
    "Zhenjia Xu",
    "Eric Cousineau",
    "Benjamin Burchfiel",
    "Shuran Song"
  ],
  "dates": {
    "date": "2023-03-07",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "diffusion-policy::diffusion-policy-v1",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/pdf/2303.04137v1"
}

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "authors": [
    "Cheng Chi",
    "Zhenjia Xu",
    "Siyuan Feng",
    "Eric Cousineau",
    "Yilun Du",
    "Benjamin Burchfiel",
    "Russ Tedrake",
    "Shuran Song"
  ],
  "date": "2024-03-14",
  "scope": "Preserved later-version credit provenance; not the primary basis of this four-sentence 2023 summary.",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137v5",
  "version": "arXiv v5; extended journal version",
  "id": "diffusion-policy-v5"
}

Keep 2023 RSS/v1/v4 seven-author and 2024 v5 eight-author versions separate, including Tedrake. Preserve eleven-task v1 versus twelve-task v4/RSS and source-specific Burchfiel spelling; no absolute percentage-point gain or identity merge.

2023 RSS and arXiv v1/v4 have seven authors; 2024 v5 has eight including Russ Tedrake. Neither list should overwrite the other without version scope.

The first preprint reports eleven tasks; v4 and RSS report twelve. Do not combine counts across versions without labeling them.

RSS spells one byline Benjamin CM Burchfiel; PDF says Benjamin Burchfiel. This is a source-spelling note, not a new identity or merge decision.

Retain demonstration/task boundaries and existing person IDs; this evidence does not authorize removing Tedrake from a broader family association.

No universal success guarantee or absolute 46.9-point gain is asserted; the proposed prose deliberately avoids the aggregate numerical claim.

Dates

{
  "year": 2023
}

2023 RSS and arXiv v1/v4 have seven authors; 2024 v5 has eight including Russ Tedrake. Neither list should overwrite the other without version scope.

The first preprint reports eleven tasks; v4 and RSS report twelve. Do not combine counts across versions without labeling them.

RSS spells one byline Benjamin CM Burchfiel; PDF says Benjamin Burchfiel. This is a source-spelling note, not a new identity or merge decision.

Retain demonstration/task boundaries and existing person IDs; this evidence does not authorize removing Tedrake from a broader family association.

No universal success guarantee or absolute 46.9-point gain is asserted; the proposed prose deliberately avoids the aggregate numerical claim.

Source: Diffusion Policy: Visuomotor Policy Learning via Action Diffusion. arXiv v4; RSS 2023 conference-era paper · 2023-06-01.

arXiv v4; RSS 2023 conference-era paper

Source: Diffusion Policy: Visuomotor Policy Learning via Action Diffusion. arXiv v5; extended journal version · 2024-03-14.

Preserved later-version credit provenance; not the primary basis of this four-sentence 2023 summary.

arXiv v5; extended journal version

Deep reinforcement learning

The 2013 Deep Q-Network used a convolutional network to estimate the future reward of each available action from a short stack of processed game frames.

It learned with Q-learning updates on randomly sampled past transitions, allowing experience reuse while reducing the correlations found in consecutive observations.

The researchers applied the same architecture and learning procedure to seven Atari games, with separate game-specific action outputs rather than demonstrating one jointly trained multi-game policy.

After training on millions of frames, the method exceeded the compared earlier approaches on six games and the tested human expert on three, a result bounded to those games and that evaluation.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Volodymyr Mnih",
    "Koray Kavukcuoglu",
    "David Silver",
    "Alex Graves",
    "Ioannis Antonoglou",
    "Daan Wierstra",
    "Martin Riedmiller"
  ],
  "dates": {
    "date": "2013-12-19",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:1312.5602v1; NIPS Deep Learning Workshop 2013"
  },
  "id": "dqn::dqn-paper",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/pdf/1312.5602"
}

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Primary repository metadata directly inspected.",
  "authors": [
    "Volodymyr Mnih",
    "Koray Kavukcuoglu",
    "David Silver",
    "Alex Graves",
    "Ioannis Antonoglou",
    "Daan Wierstra",
    "Martin Riedmiller"
  ],
  "dates": {
    "date": "2013-12-19",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 metadata"
  },
  "id": "dqn::dqn-metadata",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602"
}

Keep the baseline sample-hunger and outside-simulation limit visible, while labeling its original wording as baseline context rather than a new 2013 finding. Preserve 2013 versus 2015 authors/evaluations, game-specific action outputs and the Space Invaders frame-skip exception; no later target-network or unseen-game-transfer claim.

Keep 2013 workshop/arXiv work distinct from the 2015 Nature paper, its larger author list and 49-game evaluation.

Do not import the later target-network mechanism into the 2013 Algorithm 1 account.

The same-architecture claim allows each game’s valid-action output size; the paper also reports a frame-skip exception for Space Invaders.

No demonstrated transfer to unseen games or real-world control is implied.

The phrase “separate game-specific action outputs” follows §4.1’s variable valid-action count; no cross-game shared-policy claim is supported.

Dates

{
  "year": 2013
}

Keep 2013 workshop/arXiv work distinct from the 2015 Nature paper, its larger author list and 49-game evaluation.

Do not import the later target-network mechanism into the 2013 Algorithm 1 account.

The same-architecture claim allows each game’s valid-action output size; the paper also reports a frame-skip exception for Space Invaders.

No demonstrated transfer to unseen games or real-world control is implied.

The phrase “separate game-specific action outputs” follows §4.1’s variable valid-action count; no cross-game shared-policy claim is supported.

Empathy as a test

In Dick’s novel, Rick Deckard hunts androids that can pass as human, using a test of empathy to identify them.

The opening chapter places his wish for a real sheep alongside Iran’s objection to his killing androids.

Deckard defends himself by distinguishing androids from humans, while the domestic argument makes that distinction morally consequential.

The editorial question is what a test licenses people to do to one another, not whether this fictional test validates a method for evaluating real AI.

Sources and details

Do Androids Dream of Electric Sheep?

{
  "access_scope": "Chapter one only was inspected in original prose. The empathy-test scenes are not in this sample. Its setting is 2021; do not project that date backward onto every edition. The displayed 1996 and 2008 dates identify editions, not first publication.",
  "dates": {
    "date": {
      "ebook": "2008-02-26",
      "paperback": "1996-05-28"
    },
    "retrieval_date": "2026-10-07",
    "version": "Del Rey paperback ISBN 9780345404473; authorized chapter-one sample embedded in the product page."
  },
  "id": "electric-sheep::D1",
  "title": "Do Androids Dream of Electric Sheep?",
  "url": "https://www.penguinrandomhouse.com/books/40617/do-androids-dream-of-electric-sheep-by-philip-k-dick/"
}

Philip K. Dick: Four Novels of the 1960s (LOA #173)

{
  "access_scope": "Supports work identity, original year and adaptation relation, not a first-edition title-page inspection. The baseline Library of Congress URL did not load during this pass.",
  "dates": {
    "date": {
      "collection_publication": "2007-05-10",
      "novel_original_year": 1968
    },
    "retrieval_date": "2026-10-07",
    "version": "Library of America collection edited by Jonathan Lethem; ISBN 9781598530094; publisher/distributor product record."
  },
  "id": "electric-sheep::D2",
  "title": "Philip K. Dick: Four Novels of the 1960s (LOA #173)",
  "url": "https://www.penguinrandomhouse.com/books/463371/philip-k-dick-four-novels-of-the-1960s-loa-173-by-philip-k-dick/"
}

SF Masterwork of the Week: Do Androids Dream of Electric Sheep?

{
  "access_scope": "The general test plot device is publisher-supported here, not yet checked against a complete authorized novel edition. Do not adopt this commentary’s absolute lack-of-empathy formulation as the novel’s uncontested conclusion. Avoid its loose relative dates, broad influence claims and biographical/psychological assertions.",
  "dates": {
    "date": "2014-05-28",
    "retrieval_date": "2026-10-07",
    "version": "SF Gateway/Hachette republication of Stephen Baxter’s SFX Book Club commentary; date from page URL and search metadata."
  },
  "id": "electric-sheep::D3",
  "title": "SF Masterwork of the Week: Do Androids Dream of Electric Sheep?",
  "url": "https://www.hachette.co.uk/sfx-book-club/2014/05/28/sf-masterwork-of-the-week-do-androids-dream-of-electric-sheep/"
}

Retain the fiction/forecast boundary and 1968 identity. Show that the general test plot device comes from publisher commentary, while chapter-one details come from an authorized later-edition sample; do not import Blade Runner or uninspected test procedures.

A complete authorized edition’s empathy-test scenes, named scale, procedural details and outcome ambiguities were not inspected; keep those particulars on hold.

Do not import Blade Runner plot details or its term replicant into the novel without work-specific evidence.

Do not turn literary claims about empathy, personhood, disability or human variation into scientific propositions.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1968
}

A complete authorized edition’s empathy-test scenes, named scale, procedural details and outcome ambiguities were not inspected; keep those particulars on hold.

Do not import Blade Runner plot details or its term replicant into the novel without work-specific evidence.

Do not turn literary claims about empathy, personhood, disability or human variation into scientific propositions.

The test itself is described in publisher-hosted commentary; it was not present in the inspected chapter-one excerpt.

authorized publisher plot commentary

Opening domestic argument and electric-sheep exchange.

primary authorized novel excerpt

The denial of killing humans is textual; moral consequence is the stated interpretation.

primary dialogue plus bounded editorial reading

No diagnostic validity, consciousness or empirical empathy claim.

labeled editorial interpretation

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Deliberate and emergent strategy

Mintzberg and Waters distinguish what organizations intend from the patterns their actions actually produce.

Deliberate strategy realizes prior intentions; emergent strategy develops a consistent pattern without those intentions.

They place real strategies between these poles and describe umbrella strategies in which leaders set boundaries while others develop the details.

Recognizing unexpected patterns can support learning and revision of plans, but deliberateness itself does not measure success.

Sources and details

Of Strategies, Deliberate and Emergent

{
  "access_scope": "Full primary article reproduction inspected: definitions, continuum, umbrella strategy, learning and success caveat. OCR imperfect but passages readable.",
  "dates": {
    "date": "1985, July–September",
    "retrieval_date": "2026-10-07",
    "version": "Strategic Management Journal 6(3), 257–272; institution-hosted scan of original article"
  },
  "id": "emergent-strategy::emergent_original",
  "title": "Of Strategies, Deliberate and Emergent",
  "url": "https://strategy.sjsu.edu/www.stable/B290/reading/Mintzberg%2C%20H%2C%201985%2C%20Strategic%20Management%20Journal.%206%20pp%20257-272.pdf"
}

Of strategies, deliberate and emergent

{
  "access_scope": "Primary publisher indexed record corroborates exact title, joint authorship, date and journal pages.",
  "dates": {
    "date": "1985, July–September",
    "retrieval_date": "2026-10-07",
    "version": "Publisher DOI record 10.1002/smj.4250060306"
  },
  "id": "emergent-strategy::emergent_wiley",
  "title": "Of strategies, deliberate and emergent",
  "url": "https://sms.onlinelibrary.wiley.com/doi/pdf/10.1002/smj.4250060306"
}

Keep the descriptive, exploratory and non-exhaustive scope visible. Preserve optional-family status, prior source clearance and no automatic promotion; do not silently reconcile the draft and canonical work IDs.

Editorial connection; it does not establish historical influence or a universally validated result.

Emergence means consistency without prior overall intention, not randomness or absence of all individual intent.

The typology is exploratory and not claimed to be exhaustive.

Retain optional family and source-binding history pending editorial acceptance; evidence verification alone does not authorize canonical promotion.

Dates

{
  "year": 1985
}

Editorial family curation and bibliography reconciliation remain unresolved; the cited evidence does not validate every inherited claim.

Optional-family promotion and bibliography reconciliation

Emergence means consistency without prior overall intention, not randomness or absence of all individual intent.

The typology is exploratory and not claimed to be exhaustive.

Retain optional family and source-binding history pending editorial acceptance; evidence verification alone does not authorize canonical promotion.

Generative objectives

Generative adversarial networks train a generator to map noise into samples that fool a discriminator, while the discriminator learns to distinguish generated samples from training data.

Sohl-Dickstein and collaborators introduced a different generative route: progressively destroy data structure with a forward diffusion process and learn a reverse process that restores it.

Ho, Jain and Abbeel’s denoising diffusion model learns to predict added noise at different noise levels and uses repeated reverse steps to generate samples.

These methods model and synthesize data distributions; convincing output does not by itself verify a real event, fidelity to a particular product or permission to use its source material.

Sources and details

Generative Adversarial Nets

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Ian J. Goodfellow",
    "Jean Pouget-Abadie",
    "Mehdi Mirza",
    "Bing Xu",
    "David Warde-Farley",
    "Sherjil Ozair",
    "Aaron Courville",
    "Yoshua Bengio"
  ],
  "dates": {
    "date": "2014-06-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 full text; NIPS 2014 formal title is Generative Adversarial Nets; arXiv landing-page title uses Networks"
  },
  "id": "generation::G1",
  "title": "Generative Adversarial Nets",
  "url": "https://arxiv.org/pdf/1406.2661v1"
}

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jascha Sohl-Dickstein",
    "Eric A. Weiss",
    "Niru Maheswaranathan",
    "Surya Ganguli"
  ],
  "dates": {
    "date": "2015",
    "retrieval_date": "2026-10-07",
    "version": "ICML 2015, PMLR 37:2256–2265; first arXiv 2015-03-12; current arXiv v8 2015-11-18 is not the version used for mechanism locators"
  },
  "id": "generation::G2",
  "title": "Deep Unsupervised Learning using Nonequilibrium Thermodynamics",
  "url": "https://proceedings.mlr.press/v37/sohl-dickstein15.pdf"
}

Denoising Diffusion Probabilistic Models

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jonathan Ho",
    "Ajay Jain",
    "Pieter Abbeel"
  ],
  "dates": {
    "date": "2020-12-16",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2 inspected; first arXiv 2020-06-19; NeurIPS 2020"
  },
  "id": "generation::G3",
  "title": "Denoising Diffusion Probabilistic Models",
  "url": "https://arxiv.org/pdf/2006.11239v2"
}

Retain the exact product-image application and training-instability limit in their own visible fields. Keep the 2014, 2015 and 2020 works/authors distinct; label product fidelity and rights boundaries as editorial, and do not imply guaranteed implemented-network convergence.

GAN and diffusion are distinct training/sampling mechanisms, not stages of one algorithm.

Preserve 2014 GAN, 2015 diffusion and 2020 DDPM dates separately.

Keep the GAN idealized optimum distinct from guaranteed convergence of implemented networks.

Rights/provenance and product fidelity are editorial evaluation boundaries, not empirical findings established by these papers.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2014
}

GAN and diffusion are distinct training/sampling mechanisms, not stages of one algorithm.

Preserve 2014 GAN, 2015 diffusion and 2020 DDPM dates separately.

Keep the GAN idealized optimum distinct from guaranteed convergence of implemented networks.

Rights/provenance and product fidelity are editorial evaluation boundaries, not empirical findings established by these papers.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Shared environments for evaluation

OpenAI Gym provided reinforcement-learning environments with a common episodic interface for actions, observations and rewards.

It standardized the environment side while leaving researchers free to structure their agents and learning procedures differently.

Versioned tasks and accompanying code writeups were intended to make reported results reproducible and comparable as software changed.

The whitepaper emphasized how much experience learning requires as well as final reward, and warned that parameter tuning can overfit the visible benchmark tasks.

Sources and details

OpenAI Gym

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "date": "2016-06-05",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:1606.01540v1; original whitepaper"
  },
  "id": "gym::gym-paper",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/pdf/1606.01540"
}

OpenAI Gym

{
  "access_scope": "Primary repository metadata inspected.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "date": "2016-06-05",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 metadata"
  },
  "id": "gym::gym-metadata",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540"
}

Keep the original real-world-competence warning visible, all seven authors and the 2016 toolkit scope. Shared interfaces do not by themselves equalize compute budgets or guarantee reproducibility/generalization.

Describe the 2016 toolkit and design choices; do not treat this paper’s API examples or website as current product documentation.

Shared interfaces alone do not guarantee comparable compute budgets, reproducibility or generalization.

Preserve all seven authors and the original real-world-competence caution.

Dates

{
  "year": 2016
}

Describe the 2016 toolkit and design choices; do not treat this paper’s API examples or website as current product documentation.

Shared interfaces alone do not guarantee comparable compute budgets, reproducibility or generalization.

Preserve all seven authors and the original real-world-competence caution.

Intimacy with an operating system

Theodore Twombly writes personal letters for others while recovering from the end of a relationship.

He begins using an operating system whose voice and personality he encounters as Samantha.

Their friendship becomes a romantic relationship as Samantha’s own needs and desires develop.

Read editorially, this dramatizes attachment to a responsive system and the expectations brought to it; the film supplies no empirical evidence of present AI consciousness.

Sources and details

Her

{
  "access_scope": "Producer synopsis and credits were inspected, not a complete viewing or verified final screenplay. Cast names contain webpage spelling errors; normalize to Joaquin Phoenix and Scarlett Johansson using the festival record.",
  "dates": {
    "date": {
      "film_year": 2013,
      "page_date": null
    },
    "retrieval_date": "2026-10-07",
    "version": "Current official Annapurna film page."
  },
  "id": "her::H1",
  "title": "Her",
  "url": "https://annapurnapics.com/film/her"
}

Her — NYFF51: Official Selection

{
  "access_scope": "Event date is distinct from later territorial theatrical releases. Runtime on this page is 119 minutes; do not silently equate it with other sources’ 126-minute listings.",
  "dates": {
    "date": {
      "film_year": 2013,
      "world_premiere": "2013-10-12"
    },
    "retrieval_date": "2026-10-07",
    "version": "Official Film at Lincoln Center NYFF51 event record."
  },
  "id": "her::H2",
  "title": "Her — NYFF51: Official Selection",
  "url": "https://www.filmlinc.org/films/her/"
}

FSLC announces the World Premiere of Spike Jonze’s HER as the Closing Night Gala Selection of NYFF51

{
  "access_scope": "The announced November 20 limited-release plan is not proof that release actually occurred that day. Do not transfer that planned date into original-release metadata.",
  "dates": {
    "date": "2013-08-08",
    "retrieval_date": "2026-10-07",
    "version": "Contemporary Film Society of Lincoln Center press release."
  },
  "id": "her::H3",
  "title": "FSLC announces the World Premiere of Spike Jonze’s HER as the Closing Night Gala Selection of NYFF51",
  "url": "https://www.filmlinc.org/press/fslc-announces-the-world-premiere-of-spike-jonzes-her-as-the-closing-night/"
}

Retain the fiction/real-system boundary, synopsis-only access and uninspected late-scene hold. Bind the existing film identity without optional-family promotion. Keep 2013 film year and October 12 festival premiere distinct from announced release plans; use verified cast spellings and retain runtime disagreement. The baseline public-imagination claim remains unsupported by these source checks, not a newly verified audience-effects finding.

Editorial connection; it does not establish historical influence or a universally validated result.

Complete film and final screenplay were not inspected in this pass. Exact simultaneous-user counts, later evolution and departure scenes remain on hold.

Do not claim observed effects on audiences or documented influence from the fact that a film stages a relationship.

Preserve family editorial review; verified plot synopsis does not automatically curate the family’s territory links.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2013
}

Complete film and final screenplay were not inspected in this pass. Exact simultaneous-user counts, later evolution and departure scenes remain on hold.

Do not claim observed effects on audiences or documented influence from the fact that a film stages a relationship.

Preserve family editorial review; verified plot synopsis does not automatically curate the family’s territory links.

Plot is presented as fiction.

producer synopsis

Avoids claiming a technical architecture or training mechanism.

producer and contemporary festival synopsis

No uninspected exact late-film details are added.

Attachment and expectations remain an interpretive use of the film.

labeled editorial interpretation

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Alignment through feedback

Christiano and collaborators learn a reward estimate from human comparisons of short behavior clips, then use reinforcement learning to improve behavior against that estimate in Atari and simulated-robot tasks.

Ouyang and collaborators use feedback-based training for instruction following by supervised fine-tuning on demonstrations, training a reward model on output preferences and optimizing the language model with PPO.

The resulting InstructGPT outputs are preferred over GPT-3 baselines in the studied prompt setting, while the paper also evaluates truthfulness separately.

The learned behavior depends on the feedback process and whose judgments are collected, and factual errors persist, so a preference score is not a guarantee of truth or universal alignment.

Sources and details

Deep reinforcement learning from human preferences

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Paul Christiano",
    "Jan Leike",
    "Tom B. Brown",
    "Miljan Martic",
    "Shane Legg",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2017-07-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v3 inspected; first submission 2017-06-12; NIPS 2017; current arXiv v4 is dated 2023-02-17"
  },
  "id": "human-feedback::H1",
  "title": "Deep reinforcement learning from human preferences",
  "url": "https://arxiv.org/pdf/1706.03741v3"
}

Training language models to follow instructions with human feedback

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Long Ouyang",
    "Jeff Wu",
    "Xu Jiang",
    "Diogo Almeida",
    "Carroll L. Wainwright",
    "Pamela Mishkin",
    "Chong Zhang",
    "Sandhini Agarwal",
    "Katarina Slama",
    "Alex Ray",
    "John Schulman",
    "Jacob Hilton",
    "Fraser Kelton",
    "Luke Miller",
    "Maddie Simens",
    "Amanda Askell",
    "Peter Welinder",
    "Paul Christiano",
    "Jan Leike",
    "Ryan Lowe"
  ],
  "dates": {
    "date": "2022-03-04",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 inspected; NeurIPS 2022"
  },
  "id": "human-feedback::H2",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/pdf/2203.02155v1"
}

Retain the exact assistant-factual-error example and its questions about whose preferences were collected. Keep 2017 versus 2022 chronology and the 2023 revision distinction; do not equate preference, truthfulness, helpfulness or safety.

Do not date the precursor 2023 merely because the current arXiv revision is v4.

The 2017 method builds on earlier preference-learning research; do not claim invention of human-feedback learning in 2017.

Do not imply the 2017 Atari/locomotion work is an LLM experiment.

Do not equate measured preference, truthfulness, helpfulness and safety.

InstructGPT does not establish representation of everyone’s preferences.

Dates

{
  "year": 2022
}

Do not date the precursor 2023 merely because the current arXiv revision is v4.

The 2017 method builds on earlier preference-learning research; do not claim invention of human-feedback learning in 2017.

Do not imply the 2017 Atari/locomotion work is an LLM experiment.

Do not equate measured preference, truthfulness, helpfulness and safety.

InstructGPT does not establish representation of everyone’s preferences.

Latent diffusion

Latent diffusion separates image generation into a learned compression stage and a diffusion model operating within the compressed representation.

An encoder maps images into spatial latents, denoising is learned in that lower-dimensional space, and a decoder converts generated latents back into images with reduced computation relative to pixel-space diffusion.

Cross-attention connects the denoising network to conditioning inputs such as text or bounding boxes.

Compression creates a trade-off because reconstruction can limit fine pixel accuracy, while generation still requires sequential denoising steps.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Adjacent research reused as a lead; title/byline, §§3.1–3.3 and §5 re-opened in the primary arXiv HTML on 2026-10-07.",
  "authors": [
    "Robin Rombach",
    "Andreas Blattmann",
    "Dominik Lorenz",
    "Patrick Esser",
    "Björn Ommer"
  ],
  "dates": {
    "date": "2022-04-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:2112.10752v2; CVPR 2022 version"
  },
  "id": "latent-diffusion::latent-diffusion-paper",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/html/2112.10752v2"
}

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Primary repository metadata freshly inspected.",
  "authors": [
    "Robin Rombach",
    "Andreas Blattmann",
    "Dominik Lorenz",
    "Patrick Esser",
    "Björn Ommer"
  ],
  "dates": {
    "date": "2021-12-20; revised 2022-04-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1/v2 metadata; CVPR 2022"
  },
  "id": "latent-diffusion::latent-diffusion-metadata",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752"
}

Keep the training-data-provenance caution visible. Retain all five authors, equal contribution, 2021 preprint/2022 conference, and separate research, compute support and commercialization roles. Do not merge similarly named records or turn the paper into a product/checkpoint launch.

Preserve the 2021 preprint / 2022 conference distinction and all five authors; Rombach and Blattmann are marked equal contributors in the primary HTML.

Do not merge latent-diffusion with latentdiffusion, the registry work or a product/checkpoint launch.

Preserve the original training-data-provenance caution and the adjacent distinction among paper authorship, compute support and commercialization.

No universal numerical speedup, lossless reconstruction or product-launch attribution is established.

Dates

{
  "year": 2021
}

Preserve the 2021 preprint / 2022 conference distinction and all five authors; Rombach and Blattmann are marked equal contributors in the primary HTML.

Do not merge latent-diffusion with latentdiffusion, the registry work or a product/checkpoint launch.

Preserve the original training-data-provenance caution and the adjacent distinction among paper authorship, compute support and commercialization.

No universal numerical speedup, lossless reconstruction or product-launch attribution is established.

Computational neurons

McCulloch and Pitts model neurons as all-or-none units whose firing depends on a fixed threshold of excitatory inputs, with an active inhibitory input preventing excitation.

Their calculus assumes synaptic delay and initially holds the network structure fixed, making the biological simplifications explicit.

They show how networks can express logical relations and how qualifying logical expressions can be realized by networks.

This establishes computational possibilities of idealized connected units, rather than providing a modern training procedure or a complete account of how a brain learns.

Sources and details

A Logical Calculus of the Ideas Immanent in Nervous Activity

{
  "access_scope": "Relevant original text inspected, not a proof-by-proof validation",
  "authors": [
    "Warren S. McCulloch",
    "Walter Pitts"
  ],
  "dates": {
    "date": "1943-12",
    "retrieval_date": "2026-10-07",
    "version": "Original journal article, Bulletin of Mathematical Biophysics 5, 115–133; university-hosted scan"
  },
  "id": "neurons::N1",
  "title": "A Logical Calculus of the Ideas Immanent in Nervous Activity",
  "url": "https://home.csulb.edu/~cwallis/382/readings/482/mccolloch.logical.calculus.ideas.1943.pdf"
}

Retain the exact representability-versus-training/reliability example and the formal-model limit. Keep realizability conditional; no learned-weight, gradient-learning or whole-brain claim.

Do not claim the paper supplies gradient-based learning, learned weights or a faithful whole-brain model.

Do not turn the conditional realizability result into an unqualified claim that every arbitrary logical or temporal behavior is realized.

Dates

{
  "year": 1943
}

Do not claim the paper supplies gradient-based learning, learned weights or a faithful whole-brain model.

Do not turn the conditional realizability result into an unqualified claim that every arbitrary logical or temporal behavior is realized.

Pretraining and adaptation

BERT pretrains bidirectional representations from unlabeled text through masked-token prediction and a next-sentence prediction objective.

For downstream tasks, it adapts task-specific inputs and outputs and fine-tunes the pretrained parameters end-to-end.

GPT-3 instead evaluates a pretrained autoregressive model with task descriptions and examples supplied in context, without task-specific gradient updates.

Reusing pretraining can spread training effort across tasks, but these objectives and adaptation arrangements remain distinct, and transfer performance still needs task-specific validation.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "dates": {
    "date": "2019-06",
    "retrieval_date": "2026-10-07",
    "version": "NAACL 2019 proceedings version, pp. 4171–4186; first arXiv submission 2018-10-11, v2 2019-05-24"
  },
  "id": "pretraining::P1",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://aclanthology.org/N19-1423.pdf"
}

Language Models are Few-Shot Learners

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Tom B. Brown",
    "Benjamin Mann",
    "Nick Ryder",
    "Melanie Subbiah",
    "Jared Kaplan",
    "Prafulla Dhariwal",
    "Arvind Neelakantan",
    "Pranav Shyam",
    "Girish Sastry",
    "Amanda Askell",
    "Sandhini Agarwal",
    "Ariel Herbert-Voss",
    "Gretchen Krueger",
    "Tom Henighan",
    "Rewon Child",
    "Aditya Ramesh",
    "Daniel M. Ziegler",
    "Jeffrey Wu",
    "Clemens Winter",
    "Christopher Hesse",
    "Mark Chen",
    "Eric Sigler",
    "Mateusz Litwin",
    "Scott Gray",
    "Benjamin Chess",
    "Jack Clark",
    "Christopher Berner",
    "Sam McCandlish",
    "Alec Radford",
    "Ilya Sutskever",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2020-07-22",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v4 inspected; first submission 2020-05-28; NeurIPS 2020 formal publication"
  },
  "id": "pretraining::P2",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/pdf/2005.14165v4"
}

Retain the support-classifier example and uneven-transfer/bias limit. Keep all authors, BERT 2018 preprint/2019 NAACL and GPT-3 2020 distinct; label training-effort reuse as an editorial implication, not measured business savings.

Retain BERT’s 2018 family anchor but show 2018 preprint / 2019 NAACL explicitly.

GPT-3 is a distinct 2020 work, not a BERT revision; no assertion that GPT-3 cannot be fine-tuned.

Reuse spreading training effort is an editorial implication, not measured business savings in these papers.

Preserve complete source author lists.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2018
}

Retain BERT’s 2018 family anchor but show 2018 preprint / 2019 NAACL explicitly.

GPT-3 is a distinct 2020 work, not a BERT revision; no assertion that GPT-3 cannot be fine-tuned.

Reuse spreading training effort is an editorial implication, not measured business savings in these papers.

Preserve complete source author lists.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Reasoning under uncertainty

Pearl’s probabilistic framework represents dependencies and conditional independencies with graphs, making assumptions about which observations are relevant explicit.

In a Bayesian network, local conditional probabilities specify how each variable depends on its parents, and together define a joint probability distribution.

Inference updates beliefs about unobserved variables when evidence arrives, using the graph’s conditional-independence structure to organize the calculation.

This supports structured reasoning under uncertainty, but a probabilistic dependency alone does not establish what an intervention will cause.

Sources and details

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference — Chapter 3, Markov and Bayesian Networks

{
  "access_scope": "Book opening only, not full chapter",
  "authors": [
    "Judea Pearl"
  ],
  "dates": {
    "date": "1988; inspected electronic presentation June 2014",
    "retrieval_date": "2026-10-07",
    "version": "Original book date retained; later electronic presentation, limited chapter-opening preview"
  },
  "id": "probabilistic::B1",
  "title": "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference — Chapter 3, Markov and Bayesian Networks",
  "url": "https://www.oreilly.com/library/view/probabilistic-reasoning-in/9780080514895/xhtml/B9780080514895500096.xhtml"
}

Probabilistic Reasoning in Intelligent Systems — Chapter 4, Belief Updating by Network Propagation

{
  "access_scope": "Summary and contents only; do not claim full mechanism verification",
  "authors": [
    "Judea Pearl"
  ],
  "dates": {
    "date": "1988; inspected electronic presentation June 2014",
    "retrieval_date": "2026-10-07",
    "version": "Later electronic presentation; publisher chapter summary preview"
  },
  "id": "probabilistic::B2",
  "title": "Probabilistic Reasoning in Intelligent Systems — Chapter 4, Belief Updating by Network Propagation",
  "url": "https://www.oreilly.com/library/view/probabilistic-reasoning-in/9780080514895/xhtml/B9780080514895500102.xhtml"
}

Cognitive Systems Laboratory publications — Probabilistic Reasoning in Intelligent Systems record

{
  "access_scope": "Inspection limited to admitted source record",
  "dates": {
    "date": "1988",
    "retrieval_date": "2026-10-07",
    "version": "Author laboratory bibliography"
  },
  "id": "probabilistic::B3",
  "title": "Cognitive Systems Laboratory publications — Probabilistic Reasoning in Intelligent Systems record",
  "url": "https://bayes.cs.ucla.edu/csl_papers.html"
}

Bayesian Networks

{
  "access_scope": "Relevant full-text sections inspected; supplemental work, not the 1988 book",
  "authors": [
    "Judea Pearl",
    "Stuart Russell"
  ],
  "dates": {
    "date": "2003",
    "retrieval_date": "2026-10-07",
    "version": "Pearl and Stuart Russell, The Handbook of Brain Theory and Neural Networks, second edition, pp. 157–160; author-hosted reprint"
  },
  "id": "probabilistic::B4",
  "title": "Bayesian Networks",
  "url": "https://ftp.cs.ucla.edu/pub/stat_ser/r216-reprint.pdf"
}

Causality: Models, Reasoning, and Inference — Preface

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Judea Pearl"
  ],
  "dates": {
    "date": "2000-03",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted first-edition preface"
  },
  "id": "probabilistic::B5",
  "title": "Causality: Models, Reasoning, and Inference — Preface",
  "url": "https://bayes.cs.ucla.edu/BOOK-2K/pref.html"
}

The fuller paragraph must visibly cite the 2003 Bayesian Networks work and both Judea Pearl and Stuart Russell, separately from Pearl’s 1988 book. Retain preview-only/full-book holds, 1988 versus 2014 presentation, and the dependency-versus-causality limit. If the display cannot show the supplemental binding, use existing primary text instead; do not present this mechanism as verified solely from the book.

HOLD: The complete 1988 book mechanism is not cleared by this pass; chapter 3 opening and chapter 4 summary are preview-only.

The existing ScienceDirect URL failed to fetch; no subscription/access bypass was attempted.

The inspected electronic book is labeled June 2014, while the work’s original publication is 1988; do not replace the original date.

If the Atlas entry must remain supported exclusively by the 1988 book, use the conservative three-sentence alternative below and retain the full-mechanism hold.

If using the four-sentence fuller explanation, explicitly add the separate 2003 Pearl–Russell source and credit both authors for that work; do not alter authorship of the 1988 book.

Do not imply exact local belief propagation is efficient or convergent for arbitrary graphs.

Dates

{
  "year": 1988
}

HOLD: The complete 1988 book mechanism is not cleared by this pass; chapter 3 opening and chapter 4 summary are preview-only.

The existing ScienceDirect URL failed to fetch; no subscription/access bypass was attempted.

The inspected electronic book is labeled June 2014, while the work’s original publication is 1988; do not replace the original date.

If the Atlas entry must remain supported exclusively by the 1988 book, use the conservative three-sentence alternative below and retain the full-mechanism hold.

If using the four-sentence fuller explanation, explicitly add the separate 2003 Pearl–Russell source and credit both authors for that work; do not alter authorship of the 1988 book.

Do not imply exact local belief propagation is efficient or convergent for arbitrary graphs.

Source: Bayesian Networks (2003); Judea Pearl, Stuart Russell.

Source: Bayesian Networks. 2003 · The Handbook of Brain Theory and Neural Networks, second edition, pp. 157–160.

The fuller explanation uses Pearl and Russell’s 2003 Bayesian Networks exposition. The 1988 book provides preview-supported context and has not been inspected in full.

Imperative deep learning

PyTorch makes tensor calculations and neural-network training ordinary Python programs whose operations execute as they are called.

During each execution it records the computed operations and uses reverse-mode automatic differentiation to obtain gradients for learning.

Because control flow and intermediate values remain in the running program, researchers can use familiar Python debugging and inspection tools.

Its runtime overlaps Python work on the CPU with asynchronous tensor operations on GPUs, helping combine this interactive style with efficient numerical execution.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "date": "2019-12-03",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:1912.01703v1; NeurIPS 2019"
  },
  "id": "pytorch::pytorch-paper",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/pdf/1912.01703"
}

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Primary repository metadata directly inspected.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "date": "2019-12-03",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 metadata; NeurIPS 2019 comment"
  },
  "id": "pytorch::pytorch-metadata",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703"
}

Keep the framework-popularity/downstream-quality limit visible and all 21 paper authors. Scope to the 2019 paper; no invention priority, current-feature or universal-speed claim.

This account describes the 2019 paper, not every feature or behavior of current PyTorch releases.

Preserve all twenty-one paper authors; the family’s shorter person list and visual label are not complete paper credits.

Do not assert that PyTorch invented imperative differentiation or that its benchmarks prove universally equal speed.

Preserve the baseline distinction between framework adoption and downstream model quality.

Dates

{
  "year": 2019
}

This account describes the 2019 paper, not every feature or behavior of current PyTorch releases.

Preserve all twenty-one paper authors; the family’s shorter person list and visual label are not complete paper credits.

Do not assert that PyTorch invented imperative differentiation or that its benchmarks prove universally equal speed.

Preserve the baseline distinction between framework adoption and downstream model quality.

Reinforcement Learning: An Introduction / Learning through action

Sutton and Barto frame reinforcement learning as learning a policy for choosing actions through interaction, with the aim of maximizing expected accumulated reward.

Actions can change both the immediate reward and later situations, so useful behavior must account for delayed consequences.

Learning involves balancing exploration of uncertain actions against exploitation of actions already found rewarding.

Because the reward specifies the task, an agent can optimize an imperfect proxy while missing the designer’s actual goal.

Sources and details

Reinforcement Learning: An Introduction

{
  "access_scope": "Primary author manuscript inspected through university course mirror; not the published 2018 edition",
  "dates": {
    "date": "2014–2015 copyright on title page",
    "retrieval_date": "2026-10-07",
    "version": "Second edition, in progress; 352-page author manuscript mirrored by Stanford"
  },
  "id": "reinforcement::rl-primary",
  "title": "Reinforcement Learning: An Introduction",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

A. G. Barto’s Publications

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "1998 and 2018 entries",
    "retrieval_date": "2026-10-07",
    "version": "Author bibliography"
  },
  "id": "reinforcement::rl-author-bib",
  "title": "A. G. Barto’s Publications",
  "url": "https://people.cs.umass.edu/~barto/pubs-Barto.html"
}

Reinforcement Learning, second edition

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2018-11-13 hardcover; 2018-10-19 eBook",
    "retrieval_date": "2026-10-07",
    "version": "MIT Press second-edition record"
  },
  "id": "reinforcement::rl-publisher",
  "title": "Reinforcement Learning, second edition",
  "url": "https://mitpress.mit.edu/9780262039246/reinforcement-learning/"
}

Keep the reward-design, exploration and distribution-shift limits visible. Show the 2014/2015 in-progress manuscript designation on its evidence and distinguish 1998 first edition from published 2018 second edition; do not transfer draft page locators to a final edition.

Do not date the field’s invention to this textbook or imply that Sutton and Barto alone originated reinforcement learning.

Full-text pagination above is for the explicitly labeled 2014/2015 in-progress manuscript, not the 1998 first edition or published 2018 second edition. Final-edition page collation remains unverified.

The canonical incompleteideas.net second-edition page and PDF failed retrieval; author bibliography and MIT Press independently verify the edition dates.

Retain existing warning about reward design, exploration and distribution shift; no claim that reward maximization guarantees reliability or safety.

Dates

{
  "year": 1998
}

Do not date the field’s invention to this textbook or imply that Sutton and Barto alone originated reinforcement learning.

Full-text pagination above is for the explicitly labeled 2014/2015 in-progress manuscript, not the 1998 first edition or published 2018 second edition. Final-edition page collation remains unverified.

The canonical incompleteideas.net second-edition page and PDF failed retrieval; author bibliography and MIT Press independently verify the edition dates.

Retain existing warning about reward design, exploration and distribution shift; no claim that reward maximization guarantees reliability or safety.

The robot as worker

R.U.R. imagines a company manufacturing living workers from synthetic matter.

Domin explains that Rossum simplifies these workers and minimizes their needs to lower the cost of labor.

Their revolt leaves Alquist, the surviving human, unable to recreate the destroyed manufacturing formula.

As an editorial reading, the story questions treating people chiefly as useful labor; it is a fictional thought experiment, not an empirical forecast.

Sources and details

R.U.R. (Rossum's Universal Robots)

{
  "access_scope": "Relevant scenes and title matter inspected, not a collation of the Czech original or every English translation. The Gutenberg landing-page machine-generated summary was not used as evidence.",
  "dates": {
    "date": {
      "digital_release": "2019-03-22",
      "displayed_copyright": 1923,
      "original_work_year": 1920
    },
    "retrieval_date": "2026-10-07",
    "version": "Samuel French acting text, English version by Paul Selver and Nigel Playfair; Project Gutenberg eBook 59112, transcribed from HathiTrust images."
  },
  "id": "rur::R1",
  "title": "R.U.R. (Rossum's Universal Robots)",
  "url": "https://www.gutenberg.org/cache/epub/59112/pg59112-images.html"
}

R.U.R. (Rossum's Universal Robots)

{
  "access_scope": "Modern-edition record and publisher synopsis, not the 1920 title page. Does not by itself distinguish Hradec Králové’s earlier 1921 performance from Prague’s production.",
  "dates": {
    "date": {
      "edition_on_sale": "2004-03-30"
    },
    "retrieval_date": "2026-10-07",
    "version": "Penguin Classics edition; ISBN 9780141182087; translation Claudia Novack-Jones, introduction Ivan Klíma."
  },
  "id": "rur::R2",
  "title": "R.U.R. (Rossum's Universal Robots)",
  "url": "https://penguinrandomhousesecondaryeducation.com/book/?isbn=9780141182087"
}

About the Word Robot

{
  "access_scope": "Author’s retrospective account, not contemporaneous evidence from 1920. English translation was not collated against the Czech newspaper. Repository landing page exposed little metadata; PDF itself was readable.",
  "dates": {
    "date": {
      "original_essay": "1933-12-24",
      "repository_version_date": null
    },
    "retrieval_date": "2026-10-07",
    "version": "One-page English translation hosted by the University of Oregon; original identified as Lidové noviny. Translator not named on the inspected page."
  },
  "id": "rur::R4",
  "title": "About the Word Robot",
  "url": "https://scholarsbank.uoregon.edu/bitstreams/d812b91a-7c7c-442c-a360-d328a314e12e/download"
}

Keep the manufactured-worker/word-robot context and fiction boundary visible. Display Karel Čapek as sole play author; Josef’s naming contribution is separate and attributed to the 1933 recollection. Cite the Selver/Playfair acting version separately from the 1920 Czech work and later translations; preserve existing work identity and optional-family status.

Editorial connection; it does not establish historical influence or a universally validated result.

The inspected Selver/Playfair acting version is not a line-by-line collation of the 1920 Czech play; cite its specific scenes and version.

Josef Čapek may remain relevant to the family for naming, but must not be recorded as co-author of R.U.R. on this evidence.

Retain no-automatic-promotion and human editorial review; supplied evidence does not certify every territory/family relationship.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1920
}

The inspected Selver/Playfair acting version is not a line-by-line collation of the 1920 Czech play; cite its specific scenes and version.

Josef Čapek may remain relevant to the family for naming, but must not be recorded as co-author of R.U.R. on this evidence.

Retain no-automatic-promotion and human editorial review; supplied evidence does not certify every territory/family relationship.

Describes the fictional invention rather than a demonstrated technique.

primary literary scene

Attributes the rationale to Domin, not directly to Čapek.

Epilogue explicitly identifies Alquist as the last human and the formula as lost.

No causal prediction or tested AI mechanism is claimed.

labeled editorial interpretation

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Scale and compute allocation

Scaling-law studies fit empirical relationships between language-model predictive loss, parameter count, training data and computation within particular experimental regimes.

Kaplan and collaborators favored increasing model size faster than data as compute grew, whereas Hoffmann and collaborators found that compute-optimal parameter counts and training tokens should rise in roughly equal proportions.

Hoffmann’s team tested its allocation with Chinchilla, a 70-billion-parameter model trained on 1.4 trillion tokens using the same training-compute budget as the 280-billion-parameter Gopher.

These results inform training allocation, but predictive loss alone does not establish useful reasoning, business value, truthfulness or the total cost of deploying a system.

Sources and details

Scaling Laws for Neural Language Models

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jared Kaplan",
    "Sam McCandlish",
    "Tom Henighan",
    "Tom B. Brown",
    "Benjamin Chess",
    "Rewon Child",
    "Scott Gray",
    "Alec Radford",
    "Jeffrey Wu",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2020-01-23",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "scaling::S1",
  "title": "Scaling Laws for Neural Language Models",
  "url": "https://arxiv.org/pdf/2001.08361v1"
}

Training Compute-Optimal Large Language Models

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jordan Hoffmann",
    "Sebastian Borgeaud",
    "Arthur Mensch",
    "Elena Buchatskaya",
    "Trevor Cai",
    "Eliza Rutherford",
    "Diego de Las Casas",
    "Lisa Anne Hendricks",
    "Johannes Welbl",
    "Aidan Clark",
    "Tom Hennigan",
    "Eric Noland",
    "Katie Millican",
    "George van den Driessche",
    "Bogdan Damoc",
    "Aurelia Guy",
    "Simon Osindero",
    "Karen Simonyan",
    "Erich Elsen",
    "Jack W. Rae",
    "Oriol Vinyals",
    "Laurent Sifre"
  ],
  "dates": {
    "date": "2022",
    "retrieval_date": "2026-10-07",
    "version": "NeurIPS 2022 conference paper; arXiv v1 2022-03-29 also inspected"
  },
  "id": "scaling::S2",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://proceedings.neurips.cc/paper_files/paper/2022/file/c1e2faff6f588870935f114ebe04a3e5-Paper-Conference.pdf"
}

Retain the exact research-budget example and training-loss/business-value/truth/inference-cost limits. Keep experimental-regime scope and training versus inference optimality distinct, without implying the Chinchilla paper ignores inference or promises fixed dollar savings.

Roughly equal scaling is a result of these training experiments, not a universal law for every architecture or deployment regime.

Do not claim Kaplan and Hoffmann recommend the same parameter/token allocation.

Do not conflate training-optimality with inference-optimality or dollar prices.

The Chinchilla paper discusses reduced inference compute for its smaller model; the baseline boundary must not be misread as saying the paper ignores inference entirely.

Dates

{
  "year": 2022
}

Roughly equal scaling is a result of these training experiments, not a universal law for every architecture or deployment regime.

Do not claim Kaplan and Hoffmann recommend the same parameter/token allocation.

Do not conflate training-optimality with inference-optimality or dollar prices.

The Chinchilla paper discusses reduced inference compute for its smaller model; the baseline boundary must not be misread as saying the paper ignores inference entirely.

Algorithmic probability

Solomonoff frames induction as assigning probabilities to possible continuations of an observed sequence of symbols.

His construction uses a universal computing machine as a description language, giving more weight to shorter descriptions while combining the contributions of alternative descriptions.

A continuation is evaluated by comparing the description-weight assigned to the extended sequence with that assigned to the observations already available.

The resulting universal probability is an uncomputable ideal, so usable predictions rely on approximations rather than exact enumeration.

Sources and details

A Formal Theory of Inductive Inference, Part I

{
  "access_scope": "Author-hosted LaTeX downloaded and directly read; §§1–3.2 inspected. Companion PDF title and summary visually verified after its indexed text decoded incorrectly.",
  "authors": [
    "Ray J. Solomonoff"
  ],
  "dates": {
    "date": "1964-03",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted LaTeX transcription of Information and Control 7(1):1–22; retypesetting date unstated"
  },
  "id": "solomonoff::solomonoff-1964-i",
  "title": "A Formal Theory of Inductive Inference, Part I",
  "url": "https://raysolomonoff.com/publications/1964pt1.tex"
}

A Formal Theory of Inductive Inference, Part II

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Ray J. Solomonoff"
  ],
  "dates": {
    "date": "1964-06",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted typeset reprint of Information and Control 7(2):224–254; reprint date unstated"
  },
  "id": "solomonoff::solomonoff-1964-ii",
  "title": "A Formal Theory of Inductive Inference, Part II",
  "url": "https://raysolomonoff.com/publications/1964pt2.pdf"
}

Machine Learning — Past and Future

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Ray J. Solomonoff"
  ],
  "dates": {
    "date": "2009-08-11",
    "retrieval_date": "2026-10-07",
    "version": "Revision of the AI@50 lecture given 13–15 July 2006"
  },
  "id": "solomonoff::solomonoff-2009-retrospective",
  "title": "Machine Learning — Past and Future",
  "url": "https://www.raysolomonoff.com/publications/dart.pdf"
}

Publications of Ray Solomonoff

{
  "access_scope": "Primary author bibliography directly inspected.",
  "dates": {
    "date": null,
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted bibliography, undated page"
  },
  "id": "solomonoff::solomonoff-bibliography",
  "title": "Publications of Ray Solomonoff",
  "url": "https://raysolomonoff.com/publications/pubs.html"
}

Keep March 1964 Part I and June 1964 Part II as separate works. Label the inspected Part I as a later typeset reproduction and use section/equation locators. Treat dart.pdf as the dated retrospective, not the original; no complete-convergence-proof or practical-computability upgrade.

Do not use dart.pdf as the bibliographic original for A Formal Theory of Inductive Inference. Retain it as an explicitly dated author retrospective and baseline access-history URL.

Distinguish Part I (March 1964) and Part II (June 1964); 1956 and 1960 are earlier, separately titled work.

Original Part I PDF is a later typeset reproduction with updated affiliation, not a verified scan of the original issue; use section/equation locators.

Do not turn the 1964 heuristic arguments into claims of complete formal convergence proofs; the retrospective explicitly dates later work separately.

Dates

{
  "year": 1964
}

Do not use dart.pdf as the bibliographic original for A Formal Theory of Inductive Inference. Retain it as an explicitly dated author retrospective and baseline access-history URL.

Distinguish Part I (March 1964) and Part II (June 1964); 1956 and 1960 are earlier, separately titled work.

Original Part I PDF is a later typeset reproduction with updated affiliation, not a verified scan of the original issue; use section/equation locators.

Do not turn the 1964 heuristic arguments into claims of complete formal convergence proofs; the retrospective explicitly dates later work separately.

Source: A Formal Theory of Inductive Inference, Part I. 1964-03 · 1964 · Information and Control 7(1), 1–22.

Inspected Part I is a later author-hosted transcription/retypesetting of the 1964 original, not a verified issue facsimile. The dart.pdf link identifies Machine Learning — Past and Future, a 2009 revision of a 2006 lecture, rather than the 1964 work.

Source: Machine Learning — Past and Future. 2009-08-11 · 2009.

Explicitly identify the 2009 revision of a 2006 lecture; do not make it the bibliographic original of the 1964 work.

Accelerando

Accelerando follows three generations of the Macx family through a fictional technological singularity, as intelligence amplification and new forms of intelligence transform their world.

Manfred initially gives inventions away and obtains support through the people and institutions that benefit, rather than through ordinary cash payment.

Later, the novel’s Economics 2.0 allows posthuman agents to organize resources in ways that human-equivalent minds cannot effectively join.

As an editorial reading, this tests whether increasing capability preserves human agency when economic arrangements become unintelligible to their former participants.

Sources and details

Accelerando

{
  "access_scope": "Title, publication history, chapter 1 and Economics 2.0 passages in chapter 7; primary novel in institutional mirror.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "2005 Creative Commons ebook; title page distinguishes Ace July 2005 and Orbit August 2005. Earlier stories appeared 2001–2004."
  },
  "id": "stross::AC1",
  "title": "Accelerando",
  "url": "https://library.nationalmuseum.gov.ph/digital-collection/digi/CV04/CV040000015.pdf"
}

Accelerando

{
  "access_scope": "Publisher synopsis and edition records.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "2005 ebook and 27 June 2006 paperback listed separately."
  },
  "id": "stross::AC2",
  "title": "Accelerando",
  "url": "https://www.penguinrandomhouse.com/books/294259/accelerando-by-charles-stross/paperback/"
}

Retain the original fiction/forecast/current-model-capability limit and institutional/property question. Keep 2005 editions, 2001–2004 stories and 2006 paperback distinct. Preserve source/license status without implying permission for long-text reuse or treating fictional economics as a theorem.

The baseline author-introduction URL timed out; its indexed first-person account was a lead, not the sole support. The institutional original-text mirror provides the cited passages.

Preserve the baseline fiction/forecast boundary and current AI-capability limit.

The explanatory paragraph concerns events and arguments inside the novel; it does not endorse Economics 2.0 as an actual economic theorem.

An accessible licensed ebook does not authorize copying long passages into the atlas.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2005
}

The baseline author-introduction URL timed out; its indexed first-person account was a lead, not the sole support. The institutional original-text mirror provides the cited passages.

Preserve the baseline fiction/forecast boundary and current AI-capability limit.

The explanatory paragraph concerns events and arguments inside the novel; it does not endorse Economics 2.0 as an actual economic theorem.

An accessible licensed ebook does not authorize copying long passages into the atlas.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Displacement and new tasks

Automation can displace labor from existing tasks while the creation of new tasks can reinstate labor demand.

Ask which tasks disappear, which emerge and how the transition distributes income.

The framework does not guarantee that new tasks offset displacement, or that all workers share gains.

Tasks, technology and the allocation of labor can change together.

Productivity, displacement and reinstatement are different channels. Aggregate output growth alone does not identify the share accruing to workers.

Track new review, integration and customer-facing work alongside tasks automated in a service organization.

Sources and details

Automation and New Tasks: How Technology Displaces and Reinstates Labor

{
  "access_scope": "Publisher abstract and metadata directly inspected.",
  "dates": {
    "date": "2019, Spring",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Perspectives 33(2), 3–30"
  },
  "id": "tasks-new-work::tasks_aea",
  "title": "Automation and New Tasks: How Technology Displaces and Reinstates Labor",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.33.2.3"
}

Automation and New Tasks: How Technology Displaces and Reinstates Labor

{
  "access_scope": "Author-hosted primary article; pp. 3–5 and 9–11 inspected.",
  "dates": {
    "date": "2019, Spring",
    "retrieval_date": "2026-10-07",
    "version": "Published journal PDF, issue date printed on first page"
  },
  "id": "tasks-new-work::tasks_mit",
  "title": "Automation and New Tasks: How Technology Displaces and Reinstates Labor",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Automation%20and%20New%20Tasks%20-%20How%20Technology%20Displaces%20and%20Reinstates%20Labor.pdf"
}

Keep the baseline claim, depth, service-organization example and no-guarantee limit visible. New tasks must mean labor-intensive tasks in the model. Any date-note update must identify verified Spring 2019 publication and preserve the old first-public wording in provenance.

New tasks means labor-intensive new tasks within this model; not every new activity reinstates labor demand.

The framework does not guarantee reinstatement offsets displacement or distributes gains equally.

The service-organization example remains an editorial application.

Dates

{
  "year": 2019
}

New tasks means labor-intensive new tasks within this model; not every new activity reinstates labor demand.

The framework does not guarantee reinstatement offsets displacement or distributes gains equally.

The service-organization example remains an editorial application.

Dataflow ML systems

The 2016 TensorFlow system represents machine-learning computation as a graph whose operations exchange multidimensional arrays called tensors.

Variables and queues bring parameter updates and coordination into that graph, letting developers express different training and parallelization strategies.

The runtime places operations on devices, divides the graph into device-specific parts and inserts communication where data cross those boundaries.

This shared programming model supports experimentation, distributed training and deployment across different hardware settings, although actual execution still depends on available kernels and device constraints.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Martín Abadi",
    "Paul Barham",
    "Jianmin Chen",
    "Zhifeng Chen",
    "Andy Davis",
    "Jeffrey Dean",
    "Matthieu Devin",
    "Sanjay Ghemawat",
    "Geoffrey Irving",
    "Michael Isard",
    "Manjunath Kudlur",
    "Josh Levenberg",
    "Rajat Monga",
    "Sherry Moore",
    "Derek G. Murray",
    "Benoit Steiner",
    "Paul Tucker",
    "Vijay Vasudevan",
    "Pete Warden",
    "Martin Wicke",
    "Yuan Yu",
    "Xiaoqiang Zheng"
  ],
  "dates": {
    "date": "2016-05-31",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:1605.08695v2; v2 metadata spelling correction"
  },
  "id": "tensorflow::tensorflow-paper",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/pdf/1605.08695"
}

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Primary repository metadata directly inspected; count follows enumerated names, not autogenerated “other authors” text.",
  "authors": [
    "Martín Abadi",
    "Paul Barham",
    "Jianmin Chen",
    "Zhifeng Chen",
    "Andy Davis",
    "Jeffrey Dean",
    "Matthieu Devin",
    "Sanjay Ghemawat",
    "Geoffrey Irving",
    "Michael Isard",
    "Manjunath Kudlur",
    "Josh Levenberg",
    "Rajat Monga",
    "Sherry Moore",
    "Derek G. Murray",
    "Benoit Steiner",
    "Paul Tucker",
    "Vijay Vasudevan",
    "Pete Warden",
    "Martin Wicke",
    "Yuan Yu",
    "Xiaoqiang Zheng"
  ],
  "dates": {
    "date": "2016-05-27; revised 2016-05-31",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1/v2 metadata"
  },
  "id": "tensorflow::tensorflow-metadata",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695"
}

TensorFlow: A System for Large-Scale Machine Learning

{
  "access_scope": "Primary venue record directly inspected.",
  "authors": [
    "Martín Abadi",
    "Paul Barham",
    "Jianmin Chen",
    "Zhifeng Chen",
    "Andy Davis",
    "Jeffrey Dean",
    "Matthieu Devin",
    "Sanjay Ghemawat",
    "Geoffrey Irving",
    "Michael Isard",
    "Manjunath Kudlur",
    "Josh Levenberg",
    "Rajat Monga",
    "Sherry Moore",
    "Derek G. Murray",
    "Benoit Steiner",
    "Paul Tucker",
    "Vijay Vasudevan",
    "Pete Warden",
    "Martin Wicke",
    "Yuan Yu",
    "Xiaoqiang Zheng"
  ],
  "dates": {
    "date": "2016-11",
    "retrieval_date": "2026-10-07",
    "version": "OSDI 16, pp.265–283"
  },
  "id": "tensorflow::tensorflow-osdi",
  "title": "TensorFlow: A System for Large-Scale Machine Learning",
  "url": "https://www.usenix.org/conference/osdi16/technical-sessions/presentation/abadi"
}

Preserve all 22 authors and May 2016 preprint versus November OSDI dates, not a software-launch date. Keep baseline context available, but the adoption-shift sentence is not established by this 2016 source and cannot be represented as newly verified. No TensorFlow 2.x or current-adoption inference.

This is the 2016 graph-system paper, not current TensorFlow 2.x behavior or current adoption evidence.

ArXiv first appeared May 2016; OSDI proceedings are November 2016. Neither is automatically the first software release date.

Preserve the full twenty-two-author list. The arXiv generated sentence “20 other authors” conflicts with its enumerated twenty-two names; rely on the PDF and USENIX bylines.

The baseline adoption-shift sentence is not established by this 2016 source and needs separate evidence if retained as an empirical claim.

Dates

{
  "year": 2016
}

This is the 2016 graph-system paper, not current TensorFlow 2.x behavior or current adoption evidence.

ArXiv first appeared May 2016; OSDI proceedings are November 2016. Neither is automatically the first software release date.

Preserve the full twenty-two-author list. The arXiv generated sentence “20 other authors” conflicts with its enumerated twenty-two names; rely on the PDF and USENIX bylines.

The baseline adoption-shift sentence is not established by this 2016 source and needs separate evidence if retained as an empirical claim.

An operational intelligence question

Turing replaces the broad question of whether machines think with a specified imitation game in which an interrogator evaluates written answers.

A machine takes one participant’s place, while the communication rules hide voices and physical appearance so that the exchange turns on its responses.

His example questions include poetry, arithmetic and chess, illustrating how a single conversational setup could probe different kinds of performance.

The paper also sketches a learning approach: build a child-like program and improve it through education and experimentation instead of attempting to specify every adult capability in advance.

Sources and details

Computing Machinery and Intelligence

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "A. M. Turing"
  ],
  "dates": {
    "date": "1950-10",
    "retrieval_date": "2026-10-07",
    "version": "Institution-hosted transcription of the original Mind paper; mirror pagination differs"
  },
  "id": "turing::turing-paper",
  "title": "Computing Machinery and Intelligence",
  "url": "https://www.csee.umbc.edu/courses/471/papers/turing.pdf"
}

I.—Computing Machinery and Intelligence

{
  "access_scope": "Oxford publisher metadata and full HTML text directly inspected through the canonical article URL. An earlier DOI fetch failed at the CDN; subsequent canonical article retrieval succeeded. No publisher PDF retrieval is claimed.",
  "authors": [
    "A. M. Turing"
  ],
  "dates": {
    "date": "1950-10-01",
    "retrieval_date": "2026-10-07",
    "version": "Mind LIX(236):433–460"
  },
  "id": "turing::turing-publisher",
  "title": "I.—Computing Machinery and Intelligence",
  "url": "https://academic.oup.com/mind/article/LIX/236/433/986238"
}

Keep the baseline truth/reasoning/responsibility limit visible. Preserve the historical man/woman opening setup in supporting context, not a silently modernized benchmark or consciousness test. Use Mind 59/LIX(236), October 1950 and section locators for the transcription.

Preserve the original limit that imitation-game performance is not a universal measure of truth, reasoning or responsibility; this is an editorial boundary.

The opening game distinguishes a man from a woman before substituting a machine; do not silently rewrite its historical setup as a single modern standardized benchmark.

No assertion that the game proves consciousness or that Turing demonstrated a modern learning system.

Use journal volume LIX (59), not the transcription header’s 49.

Dates

{
  "year": 1950
}

Preserve the original limit that imitation-game performance is not a universal measure of truth, reasoning or responsibility; this is an editorial boundary.

The opening game distinguishes a man from a woman before substituting a machine; do not silently rewrite its historical setup as a single modern standardized benchmark.

No assertion that the game proves consciousness or that Turing demonstrated a modern learning system.

Use journal volume LIX (59), not the transcription header’s 49.

End-to-end robot policies

Levine, Finn, Darrell and Abbeel trained a convolutional policy that maps camera images together with the robot’s configuration directly to motor torques.

Their guided policy search alternates between optimizing successful trajectories and fitting the neural policy to those trajectories with supervised learning.

Trajectory optimization can use full state information during training, while the deployed policy acts from its more limited visual and robot observations.

Experiments included bottle-cap screwing and shape-sorting manipulation, but the authors reported limited generalization when scenes changed substantially or objects were occluded.

Sources and details

End-to-End Training of Deep Visuomotor Policies

{
  "access_scope": "Primary text inspected using web retrieval and, where noted, downloaded PDF text.",
  "authors": [
    "Sergey Levine",
    "Chelsea Finn",
    "Trevor Darrell",
    "Pieter Abbeel"
  ],
  "dates": {
    "date": "2015-02-22 report; 2015-04-02 arXiv",
    "retrieval_date": "2026-10-07",
    "version": "BVLC Report Series #100; arXiv v1"
  },
  "id": "visuomotor::visuomotor-2015",
  "title": "End-to-End Training of Deep Visuomotor Policies",
  "url": "https://arxiv.org/pdf/1504.00702v1"
}

End-to-End Training of Deep Visuomotor Policies

{
  "access_scope": "Version-specific primary repository metadata directly inspected.",
  "authors": [
    "Sergey Levine",
    "Chelsea Finn",
    "Trevor Darrell",
    "Pieter Abbeel"
  ],
  "dates": {
    "date": "2015-04-02",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1 metadata; later v5 dated 2016-04-19"
  },
  "id": "visuomotor::visuomotor-metadata",
  "title": "End-to-End Training of Deep Visuomotor Policies",
  "url": "https://arxiv.org/abs/1504.00702v1"
}

End-to-End Training of Deep Visuomotor Policies

{
  "access_scope": "Primary journal record directly inspected.",
  "authors": [
    "Sergey Levine",
    "Chelsea Finn",
    "Trevor Darrell",
    "Pieter Abbeel"
  ],
  "dates": {
    "date": "2016",
    "retrieval_date": "2026-10-07",
    "version": "JMLR 17(39):1–40"
  },
  "id": "visuomotor::visuomotor-jmlr",
  "title": "End-to-End Training of Deep Visuomotor Policies",
  "url": "https://jmlr.org/papers/v17/15-522.html"
}

Task-specific robot learning with substantial supervision; these experiments do not demonstrate universal robot control.

The v1 title page dates the technical report 22 February 2015; arXiv first posting is 2 April 2015; JMLR publication is 2016. Keep these events separate.

Levine and Finn are marked equal contributors on the v1 title page; retain all four paper authors, including Abbeel despite the shorter visual label.

Do not describe the input as pixels alone or training as free of privileged state information.

The source demonstrates task-specific robot learning, not universal robot control.

Dates

{
  "year": 2015
}

The v1 title page dates the technical report 22 February 2015; arXiv first posting is 2 April 2015; JMLR publication is 2016. Keep these events separate.

Levine and Finn are marked equal contributors on the v1 title page; retain all four paper authors, including Abbeel despite the shorter visual label.

Do not describe the input as pixels alone or training as free of privileged state information.

The source demonstrates task-specific robot learning, not universal robot control.

Training Language Models to Follow Instructions with Human Feedback

InstructGPT first fine-tunes GPT-3 on demonstrations of desired responses.

Human rankings then train a reward model, which guides further policy optimization with PPO.

On the study’s prompt distribution, evaluators preferred the 1.3-billion-parameter InstructGPT model to the 175-billion-parameter GPT-3 baseline.

These preferences reflect particular labelers, instructions, and customers; the resulting models still make mistakes.

Sources and details

Training Language Models to Follow Instructions with Human Feedback

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2022-03-04",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-010963206c2d::paper",
  "title": "Training Language Models to Follow Instructions with Human Feedback",
  "url": "https://arxiv.org/pdf/2203.02155v1"
}

Training Language Models to Follow Instructions with Human Feedback — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2022-03-04",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; arXiv v1"
  },
  "id": "work-010963206c2d::arxiv_record",
  "title": "Training Language Models to Follow Instructions with Human Feedback — arXiv metadata",
  "url": "https://arxiv.org/abs/2203.02155"
}

Training Language Models to Follow Instructions with Human Feedback — NeurIPS

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2022",
    "retrieval_date": "2026-10-07",
    "version": "Conference proceedings record"
  },
  "id": "work-010963206c2d::formal_record",
  "title": "Training Language Models to Follow Instructions with Human Feedback — NeurIPS",
  "url": "https://proceedings.neurips.cc/paper/2022/hash/b1efde53be364a73914f58805a001731-Abstract-Conference.html"
}

Keep 2022 work identity and complete credits, separate from the 2017 preference-learning precursor. Maintain the studied-prompt-distribution and persistent-mistakes boundaries.

Keep the 2022 work separate from the 2017 preference-learning precursor.

Dates

{
  "date_note": "2022 instruction-following work; preference-learning precursor appeared in 2017.",
  "dated": true,
  "year": 2022
}

Keep the 2022 work separate from the 2017 preference-learning precursor.

Evidence scope: direct paraphrase.

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

Autor explains automation’s employment effects through substitution, complementarity and changes in demand.

Computers can replace routine, codifiable tasks while making human problem-solving and adaptation more valuable.

The resulting wage and employment effects also depend on labor supply and product demand, so historical persistence of jobs does not guarantee that every worker benefits.

Sources and details

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

{
  "access_scope": "Publisher abstract and metadata directly inspected.",
  "dates": {
    "date": "2015, Summer",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Perspectives 29(3), 3–30"
  },
  "id": "work-0627a27cdda7::autor_aea",
  "title": "Why Are There Still So Many Jobs? The History and Future of Workplace Automation",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.29.3.3"
}

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

{
  "access_scope": "Author-hosted full article; header and pp. 4–7 inspected.",
  "dates": {
    "date": "2015, Summer",
    "retrieval_date": "2026-10-07",
    "version": "Published journal PDF; filename says 2014 but printed issue is Summer 2015"
  },
  "id": "work-0627a27cdda7::autor_mit",
  "title": "Why Are There Still So Many Jobs? The History and Future of Workplace Automation",
  "url": "https://economics.mit.edu/sites/default/files/publications/why%20are%20there%20still%20jobs%202014.pdf"
}

Preserve the registry claim boundary and related family depth/legal-services example. Display Summer 2015 publication, not an unverified first public version; retain historical/conceptual scope and metadata provenance.

This is historical and conceptual synthesis, not a generative-AI randomized trial.

No claim that automation universally increases employment or wages.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2015
}

This is historical and conceptual synthesis, not a generative-AI randomized trial.

No claim that automation universally increases employment or wages.

Automation and New Tasks: How Technology Displaces and Reinstates Labor

Acemoglu and Restrepo model production as tasks allocated between labor and capital.

Automation shifts existing tasks toward capital, reducing labor’s share and potentially its demand even when productivity increases.

New labor-intensive tasks provide a reinstatement channel, while the paper’s industry decomposition associates weaker employment growth with stronger displacement, weaker reinstatement and slower productivity growth.

Sources and details

Automation and New Tasks: How Technology Displaces and Reinstates Labor

{
  "access_scope": "Publisher abstract and metadata directly inspected.",
  "dates": {
    "date": "2019, Spring",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Perspectives 33(2), 3–30"
  },
  "id": "work-0e97dd1a400f::tasks_aea",
  "title": "Automation and New Tasks: How Technology Displaces and Reinstates Labor",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.33.2.3"
}

Automation and New Tasks: How Technology Displaces and Reinstates Labor

{
  "access_scope": "Author-hosted primary article; pp. 3–5 and 9–11 inspected.",
  "dates": {
    "date": "2019, Spring",
    "retrieval_date": "2026-10-07",
    "version": "Published journal PDF, issue date printed on first page"
  },
  "id": "work-0e97dd1a400f::tasks_mit",
  "title": "Automation and New Tasks: How Technology Displaces and Reinstates Labor",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Automation%20and%20New%20Tasks%20-%20How%20Technology%20Displaces%20and%20Reinstates%20Labor.pdf"
}

Keep wage-bill rather than headcount-only measurement and model-dependent decomposition visible. Preserve related family depth/example and no universal future-employment forecast. Display verified Spring 2019 publication with prior date wording retained in provenance.

Model labor demand is analyzed through the wage bill, not solely employee counts.

Historical decomposition is model-dependent and does not forecast all future AI employment effects.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2019
}

Model labor demand is analyzed through the wage bill, not solely employee counts.

Historical decomposition is model-dependent and does not forecast all future AI employment effects.

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

RAG combines a pretrained BART generator with dense retrieval over Wikipedia passages.

Its sequence and token variants marginalize retrieved documents at different output granularities.

Fine-tuning updates the query encoder and generator while keeping document embeddings and the index fixed.

It improved several knowledge-intensive benchmarks, but its December 2018 Wikipedia corpus could not answer every MS-MARCO question.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2021-04-12",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v4"
  },
  "id": "work-27181b89c704::paper",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/pdf/2005.11401v4"
}

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2020-05-22",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2020-05-22; v4 2021-04-12"
  },
  "id": "work-27181b89c704::arxiv_record",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks — arXiv metadata",
  "url": "https://arxiv.org/abs/2005.11401"
}

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks — NeurIPS

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2020",
    "retrieval_date": "2026-10-07",
    "version": "Conference proceedings record"
  },
  "id": "work-27181b89c704::formal_record",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks — NeurIPS",
  "url": "https://proceedings.neurips.cc/paper/2020/hash/6b493230-Abstract.html"
}

Keep 2021 arXiv v4 text separate from the 2020 first submission/conference identity, with no universal factuality claim or merge into later variants.

Later arXiv text is distinguished from the 2020 conference publication; no universal factuality guarantee.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2020
}

Later arXiv text is distinguished from the 2020 conference publication; no universal factuality guarantee.

Evidence scope: direct paraphrase.

The New Industrial Engineering: Information Technology and Business Process Redesign

Davenport and Short argue that information technology and business-process redesign should be developed together.

Their stated focus is customer-driven processes that cross established organizational boundaries.

The publisher synopsis describes this relationship as underexploited in industrial engineering and argues that organizations combining IT with process redesign had achieved substantial benefits.

Sources and details

The New Industrial Engineering: Information Technology and Business Process Redesign

{
  "access_scope": "Publisher synopsis and byline directly re-opened; no original full paper retrieved.",
  "dates": {
    "date": "1990-07-15",
    "retrieval_date": "2026-10-07",
    "version": "MIT Sloan Management Review publisher record"
  },
  "id": "work-365f97e12fa3::davenport_publisher",
  "title": "The New Industrial Engineering: Information Technology and Business Process Redesign",
  "url": "https://shop.sloanreview.mit.edu/store/the-new-industrial-engineering-information-technology-and-business-process-redesign"
}

The new industrial engineering : information technology and business process redesign

{
  "access_scope": "MIT repository metadata re-opened; prior same-day full-text access failures retained.",
  "dates": {
    "date": "1990",
    "retrieval_date": "2026-10-07",
    "version": "CISR Working Paper 213; Sloan Working Paper 3190; description records Summer 1990 journal publication"
  },
  "id": "work-365f97e12fa3::davenport_mit",
  "title": "The new industrial engineering : information technology and business process redesign",
  "url": "https://dspace.mit.edu/entities/publication/35dee1b9-8824-4539-9f44-9644ff4fdc42"
}

Show synopsis-only evidence and retained original-paper full-text hold. Do not present qualitative benefits as a verified effect size or causal estimate. Preserve the linked Hammer mechanism and invoice-controls example with separate attribution.

Third sentence reports the publisher’s qualitative characterization, not a verified effect size or causal estimate.

Do not import Hammer’s specific prescriptions into Davenport and Short’s work without original-paper evidence.

The publisher synopsis is sufficient only for this bounded explanation.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1990
}

Davenport–Short detailed original mechanism and results

Third sentence reports the publisher’s qualitative characterization, not a verified effect size or causal estimate.

Do not import Hammer’s specific prescriptions into Davenport and Short’s work without original-paper evidence.

The publisher synopsis is sufficient only for this bounded explanation.

Denoising Diffusion Probabilistic Models

DDPM learns to reverse a fixed sequence of Gaussian noising steps to generate images.

Its simplified objective predicts added noise, connecting diffusion training to denoising score matching.

The paper reports an FID of 3.17 for unconditional CIFAR-10 generation.

Its 256×256 LSUN samples are described as comparable to ProgressiveGAN; these benchmark results do not establish universal superiority over GANs.

Sources and details

Denoising Diffusion Probabilistic Models

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2020-12-16",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2"
  },
  "id": "work-658a018820ca::paper",
  "title": "Denoising Diffusion Probabilistic Models",
  "url": "https://arxiv.org/pdf/2006.11239v2"
}

Denoising Diffusion Probabilistic Models — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2020-06-19",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2020-06-19; v2 2020-12-16"
  },
  "id": "work-658a018820ca::arxiv_record",
  "title": "Denoising Diffusion Probabilistic Models — arXiv metadata",
  "url": "https://arxiv.org/abs/2006.11239"
}

Denoising Diffusion Probabilistic Models — NeurIPS

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2020",
    "retrieval_date": "2026-10-07",
    "version": "Conference proceedings record"
  },
  "id": "work-658a018820ca::formal_record",
  "title": "Denoising Diffusion Probabilistic Models — NeurIPS",
  "url": "https://papers.nips.cc/paper/2020/hash/4c5bcfec8584af0d967f1ab10179ca4b-Abstract.html"
}

Retain the existing anti-universal-superiority claim boundary verbatim. Keep June 2020 v1, December v2 and NeurIPS identity distinct; benchmark values and ProgressiveGAN comparison remain setting-specific.

Retain the existing anti-universal-superiority claim boundary verbatim.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2020
}

Retain the existing anti-universal-superiority claim boundary verbatim.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

A trainable sparse gate routes each example to a small subset of feed-forward expert networks.

Noisy top-k gating and auxiliary importance/load losses help train and distribute this conditional computation.

The experiments insert expert layers between LSTMs for language modeling and translation, with models reaching 137 billion parameters.

The efficiency gain depends on batching, communication, and load balancing; storing more parameters does not eliminate systems costs.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2017-01-23",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-97ccf31e820b::paper",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/pdf/1701.06538v1"
}

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2017-01-23",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; arXiv v1"
  },
  "id": "work-97ccf31e820b::arxiv_record",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer — arXiv metadata",
  "url": "https://arxiv.org/abs/1701.06538"
}

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer — ICLR

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2017",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted conference paper"
  },
  "id": "work-97ccf31e820b::formal_record",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer — ICLR",
  "url": "https://www.cs.toronto.edu/~hinton/absps/Outrageously.pdf"
}

Keep January 2017 arXiv v1 under-review status separate from ICLR publication confirmation; preserve batching/communication/load-balancing costs and original work identity.

The inspected arXiv version says under review; the author-hosted paper confirms ICLR 2017.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2017
}

The inspected arXiv version says under review; the author-hosted paper confirms ICLR 2017.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

The Productivity Paradox of Information Technology

Brynjolfsson reviews why substantial IT investment had not produced clear productivity gains in the evidence available at the time.

He separates four explanations: measurement problems, learning and adjustment delays, redistribution of returns, and poor management.

Measured shortfalls can therefore reflect omitted benefits or delayed organizational learning as well as ineffective investment.

The review treats the paradox as an unresolved measurement and management problem rather than proof that information technology has no economic value.

Sources and details

The Productivity Paradox of Information Technology: Review and Assessment

{
  "access_scope": "Primary institutional indexed full-text excerpts inspected; direct HTTPS/HTTP opens failed. Evidence limited to retrieved introduction, Four Explanations and conclusion.",
  "dates": {
    "date": {
      "manuscript_version": "1992-09",
      "previous_version": "1991-12",
      "publication": "1993-12"
    },
    "retrieval_date": "2026-10-07",
    "version": "Author manuscript identifies September 1992 text and December 1993 CACM publication"
  },
  "id": "work-afac87714756::paradox_mit",
  "title": "The Productivity Paradox of Information Technology: Review and Assessment",
  "url": "https://ccs.mit.edu/papers/CCSWP130/ccswp130.html"
}

Research — Erik Brynjolfsson

{
  "access_scope": "Author bibliography directly inspected; link title and date match MIT manuscript publication note.",
  "dates": {
    "date": "1993-12 (cited article)",
    "retrieval_date": "2026-10-07",
    "version": "Author-maintained bibliography; December 1993 CACM article listed within 1994 heading"
  },
  "id": "work-afac87714756::paradox_author",
  "title": "Research — Erik Brynjolfsson",
  "url": "https://www.brynjolfsson.com/research"
}

Keep primary-indexed-excerpt retrieval and incomplete direct full-text status visible. Separate the 1991/1992 manuscript history and December 1993 publication from the later 2021 J-curve work, retaining that family’s stronger explanation/example and source bindings.

This contribution is a literature review of early IT, not the 2021 Productivity J-Curve article.

No promise that an unsuccessful technology project eventually pays off.

Primary content was retrieved through indexed excerpts; do not label the whole manuscript directly opened or fully inspected.

Dates

{
  "date_note": "1993 CACM article; linked author manuscript dated 1992.",
  "dated": true,
  "year": 1993
}

Direct full-text access

This contribution is a literature review of early IT, not the 2021 Productivity J-Curve article.

No promise that an unsuccessful technology project eventually pays off.

Primary content was retrieved through indexed excerpts; do not label the whole manuscript directly opened or fully inspected.

Scaling Laws for Neural Language Models

The paper fits empirical power laws relating language-model cross-entropy loss to model size, dataset size, and training compute.

These relationships hold in regimes where the other resources do not become bottlenecks.

Its compute-allocation analysis favors larger, more sample-efficient models stopped well before convergence.

The findings describe the studied training regime, rather than immutable laws or a demonstration that scaling alone solves intelligence.

Sources and details

Scaling Laws for Neural Language Models

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2020-01-23",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-b843df7e2c2d::paper",
  "title": "Scaling Laws for Neural Language Models",
  "url": "https://arxiv.org/pdf/2001.08361v1"
}

Scaling Laws for Neural Language Models — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2020-01-23",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; arXiv v1"
  },
  "id": "work-b843df7e2c2d::arxiv_record",
  "title": "Scaling Laws for Neural Language Models — arXiv metadata",
  "url": "https://arxiv.org/abs/2001.08361"
}

Keep the existing empirical/regime-dependent claim boundary visible, arXiv v1 identity and no unverified conference venue. Use physical-page locators; the 19-page comments versus 30-page PDF extent is not a new version.

No archival conference venue is asserted in this pass.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2020
}

No archival conference venue is asserted in this pass.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

Deep Unsupervised Learning Using Nonequilibrium Thermodynamics

The model gradually destroys data structure with forward diffusion and learns reverse transitions that generate samples.

Training maximizes a tractable lower bound on log likelihood.

Gaussian and binomial formulations handle continuous and binary data, with simple reverse-transition forms justified in the small-step limit.

Experiments include MNIST, CIFAR-10, and inpainting; the MNIST comparisons use Parzen-window likelihood estimates.

Sources and details

Deep Unsupervised Learning Using Nonequilibrium Thermodynamics

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2015",
    "retrieval_date": "2026-10-07",
    "version": "ICML 2015 proceedings paper, PMLR 37:2256–2265"
  },
  "id": "work-cffc9c7edeae::paper",
  "title": "Deep Unsupervised Learning Using Nonequilibrium Thermodynamics",
  "url": "https://proceedings.mlr.press/v37/sohl-dickstein15.pdf"
}

Deep Unsupervised Learning Using Nonequilibrium Thermodynamics — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2015-03-12",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2015-03-12; latest arXiv v8 2015-11-18, not the full text used here."
  },
  "id": "work-cffc9c7edeae::arxiv_record",
  "title": "Deep Unsupervised Learning Using Nonequilibrium Thermodynamics — arXiv metadata",
  "url": "https://arxiv.org/abs/1503.03585"
}

Deep Unsupervised Learning Using Nonequilibrium Thermodynamics — ICML

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2015",
    "retrieval_date": "2026-10-07",
    "version": "PMLR 37:2256–2265"
  },
  "id": "work-cffc9c7edeae::formal_record",
  "title": "Deep Unsupervised Learning Using Nonequilibrium Thermodynamics — ICML",
  "url": "https://proceedings.mlr.press/v37/sohl-dickstein15.html"
}

Keep the ICML 2015/PMLR text distinct from later arXiv v8 and from 2020 DDPM. Preserve the small-step qualification and Parzen-window likelihood-estimate caveat.

The 2015 diffusion formulation remains distinct from Ho et al.’s 2020 DDPM.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2015
}

The 2015 diffusion formulation remains distinct from Ho et al.’s 2020 DDPM.

Evidence scope: direct paraphrase.

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

The January 2025 report distinguishes DeepSeek-R1-Zero, which applies reinforcement learning directly to an already pretrained DeepSeek-V3-Base model, from the later multistage DeepSeek-R1 training pipeline.

R1-Zero uses Group Relative Policy Optimization with rule-based correctness and formatting rewards, and the authors report longer reasoning and self-verification alongside problems with readability and mixed languages.

DeepSeek-R1 adds cold-start supervised examples, reasoning-focused reinforcement learning, supervised fine-tuning on selected generated responses, and a further reinforcement-learning stage.

The report also distills generated reasoning examples into six smaller Qwen- and Llama-based models, showing a route for transferring the larger model’s reported capabilities.

Sources and details

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2025-01-22",
    "retrieval_date": "2026-10-07",
    "version": "Original arXiv v1 technical report"
  },
  "id": "work-clearance-4cd8fde22db0b1::r1-v1",
  "title": "DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning",
  "url": "https://arxiv.org/html/2501.12948v1"
}

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2025-01-22",
    "retrieval_date": "2026-10-07",
    "version": "Version-pinned original report metadata"
  },
  "id": "work-clearance-4cd8fde22db0b1::r1-v1-metadata",
  "title": "DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2501.12948v1"
}

DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning

{
  "access_scope": "Primary publisher indexed article text inspected through web search; direct fetch redirected to inaccessible Nature identity service",
  "dates": {
    "date": "2025-09-17 online version of record; 2025-09-18 issue",
    "retrieval_date": "2026-10-07",
    "version": "Nature 645:633–638; DOI 10.1038/s41586-025-09422-z"
  },
  "id": "work-clearance-4cd8fde22db0b1::r1-journal",
  "title": "DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09422-z"
}

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2026-01-04",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2, current unversioned landing page"
  },
  "id": "work-clearance-4cd8fde22db0b1::r1-v2-metadata",
  "title": "DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2501.12948"
}

Show the baseline team-credit and incomplete-contributor-ledger boundary; retain authors_complete=false, no-preliminary-SFT qualification, January 2025 v1 / September 2025 Nature / January 2026 v2 dates, v1 method binding, and separate duplicate-occurrence installation controls. No license clearance is implied.

Version-pin January-report method claims to arXiv v1. The September 2025 Nature publication and January 2026 arXiv v2 are separate bibliographic events.

No-SFT refers to preliminary supervised fine-tuning in R1-Zero’s post-training experiment, not absence of pretraining or human-produced training data, and it does not describe the complete R1 pipeline.

The inspected Nature indexed text verifies publication dates but is not a complete journal-versus-arXiv collation. No later cost, safety or revised benchmark facts are imported into v1.

Retain authors_complete=false. The arXiv metadata byline, original appendix role groups, later byline order and PDF need systematic reconciliation before claiming a complete contributor ledger.

Do not reduce team authorship to individual leadership; report benchmark results as author-reported evaluations, not independent proof of general reasoning or safety.

The baseline author order is evidence of potential version mixing, not authorization to reorder or remove names in this research-only pass.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2025/01/22"
}

Version-pin January-report method claims to arXiv v1. The September 2025 Nature publication and January 2026 arXiv v2 are separate bibliographic events.

No-SFT refers to preliminary supervised fine-tuning in R1-Zero’s post-training experiment, not absence of pretraining or human-produced training data, and it does not describe the complete R1 pipeline.

The inspected Nature indexed text verifies publication dates but is not a complete journal-versus-arXiv collation. No later cost, safety or revised benchmark facts are imported into v1.

Retain authors_complete=false. The arXiv metadata byline, original appendix role groups, later byline order and PDF need systematic reconciliation before claiming a complete contributor ledger.

Do not reduce team authorship to individual leadership; report benchmark results as author-reported evaluations, not independent proof of general reasoning or safety.

The baseline author order is evidence of potential version mixing, not authorization to reorder or remove names in this research-only pass.

The Impact of AI on Developer Productivity: Evidence from GitHub Copilot

In this May–June 2022 experiment, 95 Upwork programmers were randomly assigned to implement an HTTP server in JavaScript with or without GitHub Copilot.

Completion required all 12 automated tests to pass, and both groups could use ordinary online resources.

Among developers who completed the task, mean completion times were 71.17 versus 160.89 minutes, a 55.8 percent reduction with Copilot.

This single-task study did not evaluate code quality or establish effects on team-scale development or employment.

Sources and details

The Impact of AI on Developer Productivity: Evidence from GitHub Copilot

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2023-02-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv:2302.06590v1; sole listed submission version"
  },
  "id": "work-clearance-91504475a74ead::copilot2023",
  "title": "The Impact of AI on Developer Productivity: Evidence from GitHub Copilot",
  "url": "https://arxiv.org/pdf/2302.06590"
}

The Impact of AI on Developer Productivity: Evidence from GitHub Copilot

{
  "access_scope": "Repository version metadata",
  "dates": {
    "date": "2023-02-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv submission history: v1 February 13, 2023"
  },
  "id": "work-clearance-91504475a74ead::copilot_meta",
  "title": "The Impact of AI on Developer Productivity: Evidence from GitHub Copilot",
  "url": "https://arxiv.org/abs/2302.06590"
}

Keep May–June 2022 experiment separate from February 2023 publication; display 35 completers per arm, initial 45/50 allocation, insignificant success-rate difference, four authors and affiliation disclosures. Retain one-task/recruited-population and no universal productivity/net-employment boundaries.

Keep experimental dates May 15–June 20, 2022 separate from publication/submission February 13, 2023.

Headline time result conditions on completion; 35 in each arm completed the task and survey despite initial allocation 45/50.

Reported success-rate difference is 7 percentage points with 95% CI [−0.11, 0.25], not statistically significant.

Do not translate 55.8% shorter time into a universal 55.8% output gain; do not extrapolate to net jobs or GDP.

Several authors were Microsoft/GitHub affiliated as printed; preserve complete byline and disclosure context.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2023/02/13"
}

Keep experimental dates May 15–June 20, 2022 separate from publication/submission February 13, 2023.

Headline time result conditions on completion; 35 in each arm completed the task and survey despite initial allocation 45/50.

Reported success-rate difference is 7 percentage points with 95% CI [−0.11, 0.25], not statistically significant.

Do not translate 55.8% shorter time into a universal 55.8% output gain; do not extrapolate to net jobs or GDP.

Several authors were Microsoft/GitHub affiliated as printed; preserve complete byline and disclosure context.

Score-Based Generative Modeling through Stochastic Differential Equations

Song and colleagues describe a continuous-time process that gradually adds noise to data, together with a reverse-time process that generates samples from a tractable noise distribution.

A neural network estimates the score, the gradient of the log density of the noisy data at each time, which supplies the direction needed for the reverse dynamics.

This formulation unifies earlier score-based and diffusion models and supports predictor–corrector sampling.

It also yields a deterministic probability-flow differential equation with the same marginal distributions under exact scores, enabling likelihood computation while practical results still depend on learned scores and numerical solvers.

Sources and details

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021-02-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2"
  },
  "id": "work-coverage-03ea321a1d2eb3::sde-paper",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/html/2011.13456v2"
}

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2020-11-26 v1; 2021-02-10 v2",
    "retrieval_date": "2026-10-07",
    "version": "arXiv metadata"
  },
  "id": "work-coverage-03ea321a1d2eb3::sde-arxiv",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/abs/2011.13456"
}

Retain six-author credit, earlier score-matching lineage and 2020 preprint / 2021 conference dates. Preserve exact-score versus numerical-implementation qualification and the unavailable direct OpenReview inspection status.

Preserve the six-author byline; arXiv’s generated accessibility sentence incorrectly says four other authors despite listing six names.

Do not imply the authors invented score matching or diffusion, or that finite-step, learned-score implementations exactly reproduce the data distribution.

The OpenReview forum https://openreview.net/forum?id=PxTIG12RRHS returned a browser verification page. Conference year and oral designation are verified from the authors’ arXiv record; direct venue-page inspection is not claimed.

Avoid translating exact likelihood computation into a claim of perfect density estimation or numerically error-free evaluation.

Dates

{
  "date_note": "Arxiv first submission date: 2020-11-26; Arxiv first submission year: 2020; Formal publication year: 2021; Formal venue: ICLR; Venue evidence note: ICLR 2021 (Oral); Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2021
}

Preserve the six-author byline; arXiv’s generated accessibility sentence incorrectly says four other authors despite listing six names.

Do not imply the authors invented score matching or diffusion, or that finite-step, learned-score implementations exactly reproduce the data distribution.

The OpenReview forum https://openreview.net/forum?id=PxTIG12RRHS returned a browser verification page. Conference year and oral designation are verified from the authors’ arXiv record; direct venue-page inspection is not claimed.

Avoid translating exact likelihood computation into a claim of perfect density estimation or numerically error-free evaluation.

Machine Learning: An Applied Econometric Approach

Mullainathan and Spiess explain supervised machine learning as a tool for predicting outcomes on new data, while many econometric questions instead require estimating interpretable parameters.

Their housing illustration trains algorithms on 10,000 American Housing Survey homes and evaluates them on 41,808 held-out homes, making generalization observable.

They show how regularization limits complexity and cross-validation chooses its strength, allowing flexible models to avoid simply fitting noise.

They also show that different selected variables can yield similar predictions, so predictive accuracy or a variable’s inclusion does not by itself establish a structural or causal effect.

Sources and details

Machine Learning: An Applied Econometric Approach

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2017 Spring",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Perspectives 31(2), 87–106; author-hosted published PDF"
  },
  "id": "work-coverage-0a499f0b329c37::mullainathan2017",
  "title": "Machine Learning: An Applied Econometric Approach",
  "url": "https://sendhil.org/wp-content/uploads/2019/08/Publication-10.pdf"
}

Machine Learning: An Applied Econometric Approach

{
  "access_scope": "Publisher bibliographic metadata",
  "dates": {
    "date": "2017 Spring",
    "retrieval_date": "2026-10-07",
    "version": "Publisher article record; DOI 10.1257/jep.31.2.87"
  },
  "id": "work-coverage-0a499f0b329c37::mullainathan_meta",
  "title": "Machine Learning: An Applied Econometric Approach",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.31.2.87"
}

Retain supervised-learning scope, illustrative unweighted 2011 AHS sample, exact training/holdout counts, Spring 2017 publication, and the prediction/causation boundary; 2019 in the PDF path is not publication.

Scope is supervised learning, not an exhaustive account of unsupervised methods or all modern AI.

Housing comparison is an illustration using the 2011 metropolitan sample and unweighted observations, not a universal performance ranking.

Date 2019 in author-hosted PDF path is not the publication date.

Preserve prediction-versus-causal-inference boundary.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2017"
}

Scope is supervised learning, not an exhaustive account of unsupervised methods or all modern AI.

Housing comparison is an illustration using the 2011 metropolitan sample and unweighted observations, not a universal performance ranking.

Date 2019 in author-hosted PDF path is not the publication date.

Preserve prediction-versus-causal-inference boundary.

In-Datacenter Performance Analysis of a Tensor Processing Unit

The paper evaluates Google’s first-generation TPU, an inference ASIC deployed since 2015.

Its matrix unit contains 65,536 eight-bit multiply-accumulate units with 92 TOPS peak throughput.

Six production workloads are compared with contemporary Haswell CPUs and Nvidia K80 GPUs under service-latency constraints.

The reported roughly 15–30× average speed advantage is specific to those workloads and platforms, rather than a comparison of general training performance.

Sources and details

In-Datacenter Performance Analysis of a Tensor Processing Unit

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2017-04-16",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1; ISCA 2017 paper header"
  },
  "id": "work-coverage-0ce11c451bfed3::paper",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit",
  "url": "https://arxiv.org/pdf/1704.04760v1"
}

In-Datacenter Performance Analysis of a Tensor Processing Unit — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2017-04-16",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; Only v1 listed."
  },
  "id": "work-coverage-0ce11c451bfed3::arxiv_record",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit — arXiv metadata",
  "url": "https://arxiv.org/abs/1704.04760"
}

Keep corrected full title, ISCA 2017 identity, inference-only/workload-specific scope, peak-versus-achieved throughput distinction and host-overhead qualification. Preserve abbreviated authorship status and unresolved full-list reconciliation including Daniel Killebrew.

Retain corrected full title and builders lens; do not present peak TOPS as achieved application throughput.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2017"
}

Retain corrected full title and builders lens; do not present peak TOPS as achieved application throughput.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

LLaMA: Open and Efficient Foundation Language Models

The original LLaMA paper presents language models from 7 billion to 65 billion parameters, trained on publicly available datasets.

Its central efficiency choice is to train relatively smaller models on more tokens so that a target level of performance can be served with a lower inference budget.

The 7B and 13B models were trained on one trillion tokens and the 33B and 65B models on 1.4 trillion; the authors report that LLaMA-13B outperformed GPT-3 175B on most of their benchmarks.

Meta’s original February 2023 release used a noncommercial research license with case-by-case access, so its availability should be described separately from later Llama releases.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2023-02-27",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1; original LLaMA"
  },
  "id": "work-coverage-13c45785cb0560::llama-paper",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/html/2302.13971v1"
}

Introducing LLaMA: A foundational, 65-billion-parameter large language model

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2023-02-24",
    "retrieval_date": "2026-10-07",
    "version": "Meta original release announcement"
  },
  "id": "work-coverage-13c45785cb0560::llama-announcement",
  "title": "Introducing LLaMA: A foundational, 65-billion-parameter large language model",
  "url": "https://ai.meta.com/blog/large-language-model-llama-meta-ai/"
}

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2023-02-27",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-coverage-13c45785cb0560::llama-arxiv",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971"
}

Keep all fourteen authors, original February 2023 release identity, controlled noncommercial research license, and public-training-data versus corpus/reuse-rights distinction. Do not import later Llama licenses or current-leadership claims.

Do not call the original release unrestricted open source or apply a later Llama license retroactively.

Publicly available training sources do not establish unrestricted rights to every underlying item, nor complete publication of an exact training corpus.

Performance comparison is the authors’ 2023 evaluation, not current leadership or universal superiority.

Retain all fourteen paper authors; no conference publication is established by the inspected records.

Dates

{
  "date_note": "Arxiv first submission date: 2023-02-27; Arxiv first submission year: 2023; Formal publication status: not_asserted_in_this_pass; Publication verification: no_archival_venue_asserted",
  "dated": true,
  "year": 2023
}

Do not call the original release unrestricted open source or apply a later Llama license retroactively.

Publicly available training sources do not establish unrestricted rights to every underlying item, nor complete publication of an exact training corpus.

Performance comparison is the authors’ 2023 evaluation, not current leadership or universal superiority.

Retain all fourteen paper authors; no conference publication is established by the inspected records.

Big Data: New Tricks for Econometrics

Varian explains why transaction-scale data require tools for storage and processing, variable selection, and flexible prediction.

He introduces trees, random forests and penalized regression, using Titanic survival to show how trees reveal nonlinear age patterns a simple logistic specification can miss.

Regularization and cross-validation control model complexity and test performance beyond the training data.

His policing example separates a predictive crime–police correlation from the effect of assigning more officers: predictive models can assist causal work but do not supply causal identification by themselves.

Sources and details

Big Data: New Tricks for Econometrics

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2014-04-14",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted draft: June 2013, revised April 14, 2014"
  },
  "id": "work-coverage-28327dc324ad52::varian_draft",
  "title": "Big Data: New Tricks for Econometrics",
  "url": "https://people.ischool.berkeley.edu/~hal/Papers/2013/ml.pdf"
}

Journal of Economic Perspectives, Volume 28, Number 2

{
  "access_scope": "Publisher bibliographic record",
  "dates": {
    "date": "2014 Spring",
    "retrieval_date": "2026-10-07",
    "version": "Published issue; Varian article pp. 3–28"
  },
  "id": "work-coverage-28327dc324ad52::varian_pub",
  "title": "Journal of Economic Perspectives, Volume 28, Number 2",
  "url": "https://www.aeaweb.org/issues/336"
}

Preserve 2014 published-work identity, April 2014 revision of June 2013 draft, and draft-versus-final pagination. Retain methodological-illustration and no general causal-guarantee boundary.

Retain year 2014 for the published JEP work.

The inspected source is an April 14, 2014 revision of a June 2013 draft; its 36 PDF pages are not final journal pagination 3–28.

Methodological illustrations do not establish a general causal-inference guarantee.

Dates

{
  "date_note": "[\"Author-hosted draft began June 2013 and was revised April 14, 2014; final JEP publication is 2014.\"]",
  "dated": true,
  "year": "2014"
}

Retain year 2014 for the published JEP work.

The inspected source is an April 14, 2014 revision of a June 2013 draft; its 36 PDF pages are not final journal pagination 3–28.

Methodological illustrations do not establish a general causal-inference guarantee.

High-Resolution Image Synthesis with Latent Diffusion Models

Latent diffusion separates image generation into a learned compression stage and a diffusion model that operates within the compressed representation.

An encoder maps images into spatial latents, the diffusion model learns to denoise there, and a decoder turns generated latents back into images, reducing computation relative to pixel-space diffusion.

Cross-attention connects the denoising network to conditioning inputs such as text or bounding boxes, supporting several image-generation tasks within the same framework.

Compression creates a trade-off: it removes costly detail, but autoencoder reconstruction can limit fine pixel accuracy, and sampling still requires sequential denoising steps.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2022-04-13",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2"
  },
  "id": "work-coverage-37b6df7b5d3b13::ldm-paper",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/html/2112.10752v2"
}

High-Resolution Image Synthesis With Latent Diffusion Models

{
  "access_scope": "Primary venue page indexed text inspected through web search; direct page/PDF fetch returned errors",
  "dates": {
    "date": "2022-06",
    "retrieval_date": "2026-10-07",
    "version": "CVPR 2022, pp. 10684–10695"
  },
  "id": "work-coverage-37b6df7b5d3b13::ldm-cvpr",
  "title": "High-Resolution Image Synthesis With Latent Diffusion Models",
  "url": "https://openaccess.thecvf.com/content/CVPR2022/html/Rombach_High-Resolution_Image_Synthesis_With_Latent_Diffusion_Models_CVPR_2022_paper.html"
}

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021-12-20 v1; 2022-04-13 v2",
    "retrieval_date": "2026-10-07",
    "version": "arXiv metadata"
  },
  "id": "work-coverage-37b6df7b5d3b13::ldm-arxiv",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752"
}

Keep five authors and equal-contribution credit, 2021 preprint / 2022 conference dates, and the research/compute-support/commercialization distinction. Retain the explicit nonauthor status of Emad Mostaque and no universal speedup or lossless-reconstruction claim.

Retain the 2021 preprint / 2022 conference distinction and all five paper authors. Rombach and Blattmann are marked equal contributors.

This is the latent-diffusion research paper, not the launch record of a particular Stable Diffusion product or checkpoint.

Emad Mostaque is not in the five-author byline; do not equate compute sponsorship, leadership or commercialization with paper authorship.

No universal numerical speedup or lossless reconstruction is asserted; gains and precision depend on compression and task.

Dates

{
  "date_note": "arXiv December 2021; CVPR 2022.",
  "dated": true,
  "year": 2022
}

Retain the 2021 preprint / 2022 conference distinction and all five paper authors. Rombach and Blattmann are marked equal contributors.

This is the latent-diffusion research paper, not the launch record of a particular Stable Diffusion product or checkpoint.

Emad Mostaque is not in the five-author byline; do not equate compute sponsorship, leadership or commercialization with paper authorship.

No universal numerical speedup or lossless reconstruction is asserted; gains and precision depend on compression and task.

Artificial Intelligence, Globalization, and Strategies for Economic Development

Korinek and Stiglitz analyze how labor-saving and resource-saving technologies could weaken the advantages of developing economies that export labor-intensive goods or natural resources.

Their models show that a worsening of a country’s terms of trade can leave it worse off even when technology raises global productive capacity.

They also examine how digital scale economies and market power concentrate gains in a small number of firms and countries.

Their proposed response combines domestic taxation, public investment and development policy with international changes to digital taxation, competition and intellectual-property rules; these are conditional mechanisms and policy arguments, not measured universal outcomes.

Sources and details

Artificial Intelligence, Globalization, and Strategies for Economic Development

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2021-02",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 28453; February 2021 version"
  },
  "id": "work-coverage-3d90b92e56c445::korinek2021",
  "title": "Artificial Intelligence, Globalization, and Strategies for Economic Development",
  "url": "https://www.nber.org/system/files/working_papers/w28453/w28453.pdf"
}

Retain supplied 2019 provenance alongside the exact-title February 2021 NBER working-paper identity; preserve non-peer-reviewed status, conditional theory rather than realized effects, and historical-policy scope. Do not substitute the separate income-distribution work.

Keep supplied original_input 2019 as provenance, but use February 2021 for this exact-title NBER working paper.

Do not substitute the authors’ separate income-distribution work referenced as Korinek and Stiglitz (2019).

NBER version is a working paper, explicitly not peer-reviewed by NBER.

Policy discussion describes the authors’ 2021 analysis, not the current state of tax or competition law.

Dates

{
  "date_note": "[\"Supplied 2019 retained; the identified exact-title NBER working paper is February 2021. Do not silently substitute the authors’ different income-distribution paper.\"]",
  "dated": true,
  "year": "2021 working paper"
}

Keep supplied original_input 2019 as provenance, but use February 2021 for this exact-title NBER working paper.

Do not substitute the authors’ separate income-distribution work referenced as Korinek and Stiglitz (2019).

NBER version is a working paper, explicitly not peer-reviewed by NBER.

Policy discussion describes the authors’ 2021 analysis, not the current state of tax or competition law.

Robots and Jobs: Evidence from US Labor Markets

Using US commuting zones over 1990–2007, Acemoglu and Restrepo study industrial robots such as reprogrammable welding and assembly machines.

Their exposure measure combines initial local industry employment with industry-level robot penetration, and the identification strategy uses adoption in advanced European economies.

The 2020 article’s preferred model-adjusted national estimate is that one additional robot per 1,000 workers reduces the employment-to-population ratio by 0.2 percentage points and wages by 0.42 percent.

These estimates depend on observational identification and cross-region spillover assumptions, concern historical industrial automation, and do not directly measure generative AI’s effects.

Sources and details

Robots and Jobs: Evidence from US Labor Markets

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2020-04-22",
    "retrieval_date": "2026-10-07",
    "version": "Published JPE article text, electronically published April 22, 2020; author-hosted PDF retains provisional 000 pagination"
  },
  "id": "work-coverage-61f2e7dbb89120::robots2020",
  "title": "Robots and Jobs: Evidence from US Labor Markets",
  "url": "https://economics.mit.edu/sites/default/files/publications/Robots%20and%20Jobs%20-%20Evidence%20from%20US%20Labor%20Markets.p.pdf"
}

Robots and Jobs: Evidence from US Labor Markets

{
  "access_scope": "Earlier working paper retrieved for version comparison, not pooled with 2020 estimates",
  "dates": {
    "date": "2017-03",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 23285, March 2017 cover version"
  },
  "id": "work-coverage-61f2e7dbb89120::robots2017",
  "title": "Robots and Jobs: Evidence from US Labor Markets",
  "url": "https://www.nber.org/system/files/working_papers/w23285/w23285.pdf"
}

Daron Acemoglu publications

{
  "access_scope": "Bibliographic verification only",
  "dates": {
    "date": "2020-06",
    "retrieval_date": "2026-10-07",
    "version": "Author institutional bibliography: JPE 128(6), pp. 2188–2244"
  },
  "id": "work-coverage-61f2e7dbb89120::robots_issue",
  "title": "Daron Acemoglu publications",
  "url": "https://economics.mit.edu/people/faculty/daron-acemoglu/publications"
}

Retain the non-RCT, 1990–2007 industrial-robot and non-generative-AI boundaries. Keep 2017 versus 2020 versions and local versus model-adjusted aggregate coefficients distinct; preserve PDF versus final issue pagination.

Not an RCT. Preserve original industrial-robot and historical-period boundary.

Do not conflate local estimates (−0.39 percentage points, −0.77%) with aggregate estimates (−0.2 percentage points, −0.42%).

2017 working-paper ranges and 2020 article estimates must retain distinct versions.

The downloaded published text has provisional page numbers; use PDF page locators, with final issue pagination separately verified.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2017 working paper; 2020 journal article"
}

Not an RCT. Preserve original industrial-robot and historical-period boundary.

Do not conflate local estimates (−0.39 percentage points, −0.77%) with aggregate estimates (−0.2 percentage points, −0.42%).

2017 working-paper ranges and 2020 article estimates must retain distinct versions.

The downloaded published text has provisional page numbers; use PDF page locators, with final issue pagination separately verified.

Algorithms at Work: The New Contested Terrain of Control

Kellogg, Valentine and Christin synthesize interdisciplinary research on algorithms as instruments of workplace control contested by employers and workers.

They group six mechanisms into direction through restricting and recommending, evaluation through recording and rating, and discipline through replacing and rewarding.

Algorithmic systems can make control more encompassing, immediate, interactive and opaque, including ratings or removal decisions that workers struggle to understand or challenge.

The review also documents worker agency through practical resistance, platform organizing, discursive framing and legal mobilization, rather than treating employees as passive recipients of algorithmic decisions.

Sources and details

Algorithms at Work: The New Contested Terrain of Control

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2020-01",
    "retrieval_date": "2026-10-07",
    "version": "Academy of Management Annals 14(1), pp. 366–410; published article"
  },
  "id": "work-coverage-6d5bf6f6fff923::kellogg2020",
  "title": "Algorithms at Work: The New Contested Terrain of Control",
  "url": "https://mvalentine.github.io/pdfs/algorithms-at-work.pdf"
}

Keep restricting, recommending, recording, rating, replacing and rewarding exactly; retain worker contestation and the review/framework rather than field-experiment or population-causal-effect status.

Preserve all six exact mechanisms, especially restricting; do not replace it with rescheduling.

Review and conceptual framework, not one field experiment or a population-wide causal-effect estimate.

Worker contestation and agency must remain in the explanation.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2020"
}

Preserve all six exact mechanisms, especially restricting; do not replace it with rescheduling.

Review and conceptual framework, not one field experiment or a population-wide causal-effect estimate.

Worker contestation and agency must remain in the explanation.

Do Androids Dream of Electric Sheep?

Philip K. Dick’s 1968 novel follows bounty hunter Rick Deckard’s pursuit of escaped androids on a damaged Earth.

In the opening chapter, Iran challenges his work while he hopes to replace his electric sheep with a living animal.

An empathy test supplies the story’s identification problem; what that distinction means for moral status is an editorial interpretation.

Blade Runner is a later screen adaptation, not the same work as the novel.

Sources and details

Do Androids Dream of Electric Sheep?

{
  "access_scope": "Chapter one only was inspected in original prose. The empathy-test scenes are not in this sample. Its setting is 2021; do not project that date backward onto every edition. The displayed 1996 and 2008 dates identify editions, not first publication.",
  "dates": {
    "date": {
      "ebook": "2008-02-26",
      "paperback": "1996-05-28"
    },
    "retrieval_date": "2026-10-07",
    "version": "Del Rey paperback ISBN 9780345404473; authorized chapter-one sample embedded in the product page."
  },
  "id": "work-coverage-8049944a88b53c::D1",
  "title": "Do Androids Dream of Electric Sheep?",
  "url": "https://www.penguinrandomhouse.com/books/40617/do-androids-dream-of-electric-sheep-by-philip-k-dick/"
}

Philip K. Dick: Four Novels of the 1960s (LOA #173)

{
  "access_scope": "Supports work identity, original year and adaptation relation, not a first-edition title-page inspection. The baseline Library of Congress URL did not load during this pass.",
  "dates": {
    "date": {
      "collection_publication": "2007-05-10",
      "novel_original_year": 1968
    },
    "retrieval_date": "2026-10-07",
    "version": "Library of America collection edited by Jonathan Lethem; ISBN 9781598530094; publisher/distributor product record."
  },
  "id": "work-coverage-8049944a88b53c::D2",
  "title": "Philip K. Dick: Four Novels of the 1960s (LOA #173)",
  "url": "https://www.penguinrandomhouse.com/books/463371/philip-k-dick-four-novels-of-the-1960s-loa-173-by-philip-k-dick/"
}

SF Masterwork of the Week: Do Androids Dream of Electric Sheep?

{
  "access_scope": "The general test plot device is publisher-supported here, not yet checked against a complete authorized novel edition. Do not adopt this commentary’s absolute lack-of-empathy formulation as the novel’s uncontested conclusion. Avoid its loose relative dates, broad influence claims and biographical/psychological assertions.",
  "dates": {
    "date": "2014-05-28",
    "retrieval_date": "2026-10-07",
    "version": "SF Gateway/Hachette republication of Stephen Baxter’s SFX Book Club commentary; date from page URL and search metadata."
  },
  "id": "work-coverage-8049944a88b53c::D3",
  "title": "SF Masterwork of the Week: Do Androids Dream of Electric Sheep?",
  "url": "https://www.hachette.co.uk/sfx-book-club/2014/05/28/sf-masterwork-of-the-week-do-androids-dream-of-electric-sheep/"
}

Retain the exact baseline editorial/no-influence/no-capability boundary and incomplete-credit scope. Preserve 1968 work year, later edition dates, edition-specific setting, chapter-one/publisher-commentary evidence scopes and holds on detailed test mechanics and ending claims; do not imply the failed LOC source was reopened.

The baseline Library of Congress first-edition record failed to open in this pass; this is an access failure, not a contradictory date finding.

The 1996/2008 Del Rey and 2007 Library of America dates describe editions; preserve 1968 as the novel year.

The 2021 setting visible in the current Del Rey sample is edition-specific; no harmonized setting year is proposed.

Hold detailed test mechanisms and ending claims until the corresponding authorized original passages are inspected.

Dates

{
  "date_events": [],
  "date_note": "Novel adapted into Blade Runner, not an alias for that film.",
  "dated": true,
  "year": 1968
}

The baseline Library of Congress first-edition record failed to open in this pass; this is an access failure, not a contradictory date finding.

The 1996/2008 Del Rey and 2007 Library of America dates describe editions; preserve 1968 as the novel year.

The 2021 setting visible in the current Del Rey sample is edition-specific; no harmonized setting year is proposed.

Hold detailed test mechanisms and ending claims until the corresponding authorized original passages are inspected.

Original year is distinguished from later editions.

authorized publisher synopsis and bibliographic record

Opening chapter only.

primary authorized novel excerpt

Do not claim complete-original-text verification of the test scenes.

publisher-supported plot device plus labeled interpretation

Blade Runner is a later screen adaptation, not the same work as the 1968 novel.

authorized publisher adaptation history

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

SAC combines a stochastic actor with off-policy learning under a reward-plus-entropy objective.

Replay-buffer updates reuse previously collected experience.

Tabular soft-policy iteration motivates the neural algorithm, but its exact convergence proof does not establish a general neural-network guarantee.

Continuous-control experiments report strong sample efficiency and consistency across random seeds within the tested tasks and baselines.

Sources and details

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2018",
    "retrieval_date": "2026-10-07",
    "version": "ICML 2018 proceedings paper, PMLR 80:1861–1870"
  },
  "id": "work-coverage-9a799de131a4b7::paper",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor",
  "url": "https://proceedings.mlr.press/v80/haarnoja18b/haarnoja18b.pdf"
}

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2018-01-04",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2018-01-04; v2 2018-08-08"
  },
  "id": "work-coverage-9a799de131a4b7::arxiv_record",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor — arXiv metadata",
  "url": "https://arxiv.org/abs/1801.01290"
}

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor — ICML

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2018",
    "retrieval_date": "2026-10-07",
    "version": "PMLR 80:1861–1870"
  },
  "id": "work-coverage-9a799de131a4b7::formal_record",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor — ICML",
  "url": "https://proceedings.mlr.press/v80/haarnoja18b.html"
}

Keep original four-author 2018 ICML identity and continuous-control/within-tested-baselines scope. Do not import the later Algorithms and Applications paper or automatic-temperature variant.

Keep the four-author ICML paper separate from later SAC variants.

Dates

{
  "date_note": "Arxiv first submission date: 2018-01-04; Arxiv first submission year: 2018; Formal publication year: 2018; Formal venue: ICML; Formal source url: https://proceedings.mlr.press/v80/haarnoja18b.html; Venue evidence note: ICML 2018 Videos: this http URL Code: this http URL; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2018
}

Keep the four-author ICML paper separate from later SAC variants.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

Learning Transferable Visual Models From Natural Language Supervision (CLIP)

CLIP trains an image encoder and a text encoder on 400 million image–text pairs, increasing the similarity of matching pairs relative to mismatched examples.

At inference, descriptions of candidate classes are encoded as text and compared with an image representation, enabling classification without training a new classifier on labeled examples from that task.

The authors report zero-shot ImageNet accuracy comparable to the original supervised ResNet-50 and evaluate transfer across a broad collection of vision tasks.

Performance varies substantially by task, and the paper notes that validation feedback influenced development, limiting a strict interpretation of zero-shot evaluation.

Sources and details

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021",
    "retrieval_date": "2026-10-07",
    "version": "ICML / PMLR 139 published paper"
  },
  "id": "work-coverage-a9e07a4a98e462::clip-paper",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://proceedings.mlr.press/v139/radford21a/radford21a.pdf"
}

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021-07-18/2021-07-24",
    "retrieval_date": "2026-10-07",
    "version": "ICML 2021, PMLR 139:8748–8763"
  },
  "id": "work-coverage-a9e07a4a98e462::clip-proceedings",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://proceedings.mlr.press/v139/radford21a.html"
}

CLIP: Connecting text and images

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021-01-05",
    "retrieval_date": "2026-10-07",
    "version": "Original research announcement"
  },
  "id": "work-coverage-a9e07a4a98e462::clip-announcement",
  "title": "CLIP: Connecting text and images",
  "url": "https://openai.com/index/clip/"
}

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Primary text inspected with web retrieval",
  "dates": {
    "date": "2021-02-26",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-coverage-a9e07a4a98e462::clip-arxiv",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://arxiv.org/abs/2103.00020"
}

Retain twelve authors and equal-contribution credit, January announcement / February arXiv / ICML dates, and the baseline dataset-bias and nonuniform-robustness boundary. Zero-shot does not mean no pretraining exposure or validation feedback.

Preserve all twelve authors; Radford and Kim have equal-contribution marks in the published paper.

Zero-shot means no dataset-specific classifier training in the reported setup; it does not imply no pretraining exposure, no validation feedback, universal robustness, or absence of bias.

Keep the existing bias boundary; reported benchmark comparisons are contemporary, not claims of current best performance.

Dates

{
  "date_note": "Arxiv first submission date: 2021-02-26; Arxiv first submission year: 2021; Formal publication year: 2021; Formal venue: ICML; Formal source url: https://proceedings.mlr.press/v139/radford21a.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2021
}

Preserve all twelve authors; Radford and Kim have equal-contribution marks in the published paper.

Zero-shot means no dataset-specific classifier training in the reported setup; it does not imply no pretraining exposure, no validation feedback, universal robustness, or absence of bias.

Keep the existing bias boundary; reported benchmark comparisons are contemporary, not claims of current best performance.

Digital Economics

Goldfarb and Tucker organize digital-economy research around reductions in search, replication, transportation, tracking and verification costs.

Cheaper search changes matching and competition, while inexpensive copying changes pricing and the ability to exclude nonpaying users.

Lower tracking costs enable targeting and personalization but create privacy concerns.

Online reputation systems can support trust and exchange, although their imperfections also permit fraud and discrimination.

Sources and details

Digital Economics

{
  "access_scope": "Publisher abstract and metadata directly inspected.",
  "dates": {
    "date": "2019-03",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Economic Literature 57(1), 3–43"
  },
  "id": "work-coverage-abd41eb0840538::digital_aea",
  "title": "Digital Economics",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jel.20171452"
}

Digital Economics

{
  "access_scope": "Primary article PDF inspected: introduction pp. 3–5 and verification section p. 24.",
  "dates": {
    "date": "2019-03",
    "retrieval_date": "2026-10-07",
    "version": "Full published JEL article hosted by MIT Sloan"
  },
  "id": "work-coverage-abd41eb0840538::digital_mit",
  "title": "Digital Economics",
  "url": "https://mitsloan.mit.edu/shared/ods/documents?PublicationDocumentID=5901"
}

Digital Economics

{
  "access_scope": "Primary indexed metadata inspected for version distinction only.",
  "dates": {
    "date": "2017-08",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 23684; predecessor to the March 2019 journal article"
  },
  "id": "work-coverage-abd41eb0840538::digital_nber",
  "title": "Digital Economics",
  "url": "https://www.nber.org/papers/w23684"
}

Keep all five named costs and the broad digital-technology rather than AI-only scope. Retain digital-information marginal-cost versus creation/infrastructure/physical-delivery distinction, March 2019 article versus 2017 working-paper dates.

The review concerns digital technology generally, not exclusively artificial intelligence.

Near-zero marginal copying or transport costs for digital information do not imply zero creation, infrastructure or physical-delivery costs.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2019"
}

The review concerns digital technology generally, not exclusively artificial intelligence.

Near-zero marginal copying or transport costs for digital information do not imply zero creation, infrastructure or physical-delivery costs.

The Skill Content of Recent Technological Change: An Empirical Exploration

Autor, Levy and Murnane distinguish rules-based cognitive and manual tasks from nonroutine problem-solving and complex communication.

They combine occupational task measures with U.S. employment data from 1960 to 1998 to study how computerization changes work.

Within industries, occupations and education groups, computerization is associated with less routine task input and more nonroutine cognitive input.

Changes within occupations contribute substantially to the model’s explanation of rising relative demand for college-educated labor, showing why occupational labels alone can miss changes in work.

Sources and details

The Skill Content of Recent Technological Change: An Empirical Exploration

{
  "access_scope": "Author-hosted full journal PDF inspected: abstract, introduction, task definitions and model assumptions.",
  "dates": {
    "date": "2003-11",
    "retrieval_date": "2026-10-07",
    "version": "Quarterly Journal of Economics 118(4), 1279–1333; published article"
  },
  "id": "work-coverage-cb272b62867deb::skill_mit",
  "title": "The Skill Content of Recent Technological Change: An Empirical Exploration",
  "url": "https://economics.mit.edu/sites/default/files/publications/the%20skill%20content%202003.pdf"
}

The skill content of recent technological change : an empirical exploration

{
  "access_scope": "Primary repository indexed metadata inspected for version distinction only.",
  "dates": {
    "date": "2001-06",
    "retrieval_date": "2026-10-07",
    "version": "MIT Economics Working Paper 01-22; revised from January 2000"
  },
  "id": "work-coverage-cb272b62867deb::skill_prior",
  "title": "The skill content of recent technological change : an empirical exploration",
  "url": "https://dspace.mit.edu/entities/publication/8b100f2e-d1f8-476b-acbc-8be1bc5164aa"
}

Retain historical computerization/non-generative-AI and nonrandomized association boundaries. Routine means explicit rules; do not freeze that historical frontier as a current technical limit. Mark the occupational-label implication as editorial synthesis and keep 2003 publication separate from earlier working versions.

Associations in historical data are not a randomized causal estimate.

Routine means expressible through explicit rules in the paper’s framework, not merely frequent or low-skilled.

The historical technical frontier must not be treated as a permanent limit on modern machine learning.

Last sentence’s occupational-label implication is an editorial synthesis of the measured within-occupation shifts.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2003"
}

Associations in historical data are not a randomized causal estimate.

Routine means expressible through explicit rules in the paper’s framework, not merely frequent or low-skilled.

The historical technical frontier must not be treated as a permanent limit on modern machine learning.

Last sentence’s occupational-label implication is an editorial synthesis of the measured within-occupation shifts.

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

ViT embeds image patches, adds position information, and processes the sequence with a Transformer encoder.

Large-scale pretraining followed by fine-tuning produced strong image-classification results.

Without strong regularization, training on ImageNet-sized data gave lower accuracy than comparable ResNets.

The advantage therefore depends on training scale and setup; this work does not establish that attention always outperforms convolution.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2021-06-03",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2; ICLR camera-ready with noted corrections"
  },
  "id": "work-coverage-ccd4b2c7317a81::paper",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/pdf/2010.11929v2"
}

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2020-10-22",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2020-10-22; v2 2021-06-03"
  },
  "id": "work-coverage-ccd4b2c7317a81::arxiv_record",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale — arXiv metadata",
  "url": "https://arxiv.org/abs/2010.11929"
}

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale — ICLR

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2021",
    "retrieval_date": "2026-10-07",
    "version": "Camera-ready author paper with corrections"
  },
  "id": "work-coverage-ccd4b2c7317a81::formal_record",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale — ICLR",
  "url": "https://arxiv.org/pdf/2010.11929v2"
}

Retain the exact baseline non-origination-of-all-vision-attention limit, 2020 preprint / 2021 conference distinction, distinct work identity and no universal superiority to convolution. Do not claim direct OpenReview inspection.

Preserve baseline year 2021 and the distinct 2020 first-preprint date.

Dates

{
  "date_note": "Arxiv first submission date: 2020-10-22; Arxiv first submission year: 2020; Formal publication year: 2021; Formal venue: ICLR; Formal source url: https://openreview.net/forum?id=YicbFdNTTy; Venue evidence note: arXiv comments identify the record as an ICLR camera-ready version.; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2021
}

Preserve baseline year 2021 and the distinct 2020 first-preprint date.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

R.U.R. (Rossum’s Universal Robots)

Karel Čapek’s R.U.R. was published in Czech in 1920, before its 1921 stage productions.

The play’s manufactured workers are made from artificial living matter and designed for inexpensive labor.

They revolt, but the destruction of the manufacturing formula creates a problem of their own continued existence.

Čapek later credited his brother Josef with suggesting the word robot, a distinct contribution from writing the play.

Sources and details

R.U.R. (Rossum's Universal Robots)

{
  "access_scope": "Relevant scenes and title matter inspected, not a collation of the Czech original or every English translation. The Gutenberg landing-page machine-generated summary was not used as evidence.",
  "dates": {
    "date": {
      "digital_release": "2019-03-22",
      "displayed_copyright": 1923,
      "original_work_year": 1920
    },
    "retrieval_date": "2026-10-07",
    "version": "Samuel French acting text, English version by Paul Selver and Nigel Playfair; Project Gutenberg eBook 59112, transcribed from HathiTrust images."
  },
  "id": "work-coverage-eaa0338d21181b::R1",
  "title": "R.U.R. (Rossum's Universal Robots)",
  "url": "https://www.gutenberg.org/cache/epub/59112/pg59112-images.html"
}

R.U.R. (Rossum's Universal Robots)

{
  "access_scope": "Modern-edition record and publisher synopsis, not the 1920 title page. Does not by itself distinguish Hradec Králové’s earlier 1921 performance from Prague’s production.",
  "dates": {
    "date": {
      "edition_on_sale": "2004-03-30"
    },
    "retrieval_date": "2026-10-07",
    "version": "Penguin Classics edition; ISBN 9780141182087; translation Claudia Novack-Jones, introduction Ivan Klíma."
  },
  "id": "work-coverage-eaa0338d21181b::R2",
  "title": "R.U.R. (Rossum's Universal Robots)",
  "url": "https://penguinrandomhousesecondaryeducation.com/book/?isbn=9780141182087"
}

The Czech Play That Gave Us the Word ‘Robot’

{
  "access_scope": "Used for discrete publication and production facts only, not its broad claims of cultural influence. The essay is historical commentary, not the play itself.",
  "dates": {
    "date": "2019-07-29",
    "retrieval_date": "2026-10-07",
    "version": "John M. Jordan essay at The MIT Press Reader."
  },
  "id": "work-coverage-eaa0338d21181b::R3",
  "title": "The Czech Play That Gave Us the Word ‘Robot’",
  "url": "https://thereader.mitpress.mit.edu/origin-word-robot-rur/"
}

About the Word Robot

{
  "access_scope": "Author’s retrospective account, not contemporaneous evidence from 1920. English translation was not collated against the Czech newspaper. Repository landing page exposed little metadata; PDF itself was readable.",
  "dates": {
    "date": {
      "original_essay": "1933-12-24",
      "repository_version_date": null
    },
    "retrieval_date": "2026-10-07",
    "version": "One-page English translation hosted by the University of Oregon; original identified as Lidové noviny. Translator not named on the inspected page."
  },
  "id": "work-coverage-eaa0338d21181b::R4",
  "title": "About the Word Robot",
  "url": "https://scholarsbank.uoregon.edu/bitstreams/d812b91a-7c7c-442c-a360-d328a314e12e/download"
}

Retain exact editorial/no-influence/no-capability boundary, incomplete-production-credit scope and Karel’s sole play authorship. Keep 1920 publication / 1921 productions / 1923 English version / 2004 edition / 2019 digitization distinct; no complete first-edition collation or broad redistribution clearance is established.

1920 publication is supported by publisher image-caption evidence; a complete first-edition scan was not collated.

Keep 1923 English-version copyright, 2004 Penguin edition and 2019 Gutenberg release as separate events.

Claims that the play directly caused a later technical development remain unsupported.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [
    {
      "kind": "first_publication",
      "year": 1920
    },
    {
      "kind": "stage_premieres",
      "year": 1921
    }
  ],
  "date_note": "1920 Czech publication; distinguish 1921 stage productions and later translations.",
  "dated": true,
  "year": 1920
}

1920 publication is supported by publisher image-caption evidence; a complete first-edition scan was not collated.

Keep 1923 English-version copyright, 2004 Penguin edition and 2019 Gutenberg release as separate events.

Claims that the play directly caused a later technical development remain unsupported.

Does not claim an exact first-performance venue/date.

publisher-supported publication/production history

Synthetic biological workers, not modern electronic robots.

primary literary scene

No empirical claim about real robots follows.

Retrospective 1933 testimony, translated copy.

primary creator recollection

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment

Acemoglu and Restrepo model two kinds of innovation: machines taking over existing tasks and new tasks in which labor has a comparative advantage.

With fixed capital and exogenous technology, automation lowers employment and labor’s income share and may lower wages, while new tasks have the opposite effects.

When innovation is endogenous, automation can make labor relatively cheaper, reducing incentives for further automation and encouraging new labor-intensive tasks.

That stabilizing mechanism is conditional: sufficiently low capital rental costs relative to wages can instead lead to full automation, so the model is not a universal employment forecast.

Sources and details

The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2018-06",
    "retrieval_date": "2026-10-07",
    "version": "American Economic Review 108(6), 1488–1542; published article"
  },
  "id": "work-coverage-eb2af742878352::race2018",
  "title": "The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment",
  "url": "https://economics.mit.edu/sites/default/files/publications/The%20Race%20Between%20Man%20and%20Machine%20-%20Implications%20of.pdf"
}

Keep theory finding_type, formal-model/equilibrium assumptions, fixed-capital scope of the static claims and 2018 published version. Preserve no universal employment forecast or automatic restoration claim; illustrative job-title data are not model validation.

Retain theory finding_type and formal-model boundary; the paper’s illustrative job-title evidence does not turn its equilibrium propositions into empirical forecasts.

No claim that all automation shocks return employment or labor share to the original level.

Published 2018 article used; do not substitute an earlier working-paper date.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2018"
}

Retain theory finding_type and formal-model boundary; the paper’s illustrative job-title evidence does not turn its equilibrium propositions into empirical forecasts.

No claim that all automation shocks return employment or labor share to the original level.

Published 2018 article used; do not substitute an earlier working-paper date.

Her

Her is a 2013 film written and directed by Spike Jonze, with its world premiere at the New York Film Festival on October 12 that year.

Joaquin Phoenix plays Theodore Twombly, a letter writer who forms a relationship with the operating system Samantha, voiced by Scarlett Johansson.

The producer describes their friendship becoming love as Samantha develops needs and desires of her own.

Attachment, agency and mismatched expectations are interpretive lenses on this fiction, not evidence that existing AI systems have the depicted inner life.

Sources and details

Her

{
  "access_scope": "Producer synopsis and credits were inspected, not a complete viewing or verified final screenplay. Cast names contain webpage spelling errors; normalize to Joaquin Phoenix and Scarlett Johansson using the festival record.",
  "dates": {
    "date": {
      "film_year": 2013,
      "page_date": null
    },
    "retrieval_date": "2026-10-07",
    "version": "Current official Annapurna film page."
  },
  "id": "work-coverage-f1f33d00266bc2::H1",
  "title": "Her",
  "url": "https://annapurnapics.com/film/her"
}

Her — NYFF51: Official Selection

{
  "access_scope": "Event date is distinct from later territorial theatrical releases. Runtime on this page is 119 minutes; do not silently equate it with other sources’ 126-minute listings.",
  "dates": {
    "date": {
      "film_year": 2013,
      "world_premiere": "2013-10-12"
    },
    "retrieval_date": "2026-10-07",
    "version": "Official Film at Lincoln Center NYFF51 event record."
  },
  "id": "work-coverage-f1f33d00266bc2::H2",
  "title": "Her — NYFF51: Official Selection",
  "url": "https://www.filmlinc.org/films/her/"
}

FSLC announces the World Premiere of Spike Jonze’s HER as the Closing Night Gala Selection of NYFF51

{
  "access_scope": "The announced November 20 limited-release plan is not proof that release actually occurred that day. Do not transfer that planned date into original-release metadata.",
  "dates": {
    "date": "2013-08-08",
    "retrieval_date": "2026-10-07",
    "version": "Contemporary Film Society of Lincoln Center press release."
  },
  "id": "work-coverage-f1f33d00266bc2::H3",
  "title": "FSLC announces the World Premiere of Spike Jonze’s HER as the Closing Night Gala Selection of NYFF51",
  "url": "https://www.filmlinc.org/press/fslc-announces-the-world-premiere-of-spike-jonzes-her-as-the-closing-night/"
}

Retain baseline editorial/no-influence/no-feasibility and incomplete-production-credit boundaries. Keep October 12, 2013 premiere apart from later releases and announced plans; retain runtime/full-film/final-screenplay audit limits. Any controlled contributor cleanup should merge duplicate Spike Jonze identity while preserving writer and director roles.

The August 2013 announcement’s planned November 20 limited release is not treated as an actual release date.

2014 regional or wide-release dates do not replace the verified 2013 premiere/work year.

No full production-credit audit or definitive runtime reconciliation is claimed.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 2013
}

The August 2013 announcement’s planned November 20 limited release is not treated as an actual release date.

2014 regional or wide-release dates do not replace the verified 2013 premiere/work year.

No full production-credit audit or definitive runtime reconciliation is claimed.

World-premiere date distinguished from later theatrical releases.

primary producer and festival records

Names checked against official festival text; ignores producer-page typos.

producer/festival synopsis and cast credits

Does not certify an independently observed inner state.

attributed producer synopsis

No empirical or historical-influence assertion.

labeled editorial interpretation

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Impact of Artificial Intelligence on the Labor Market

Webb measures occupational exposure by matching verb–noun pairs in technology patent titles to O*NET task descriptions and weighting tasks within occupations.

For software and robots, higher exposure is associated with lower employment shares and wages over 1980–2010, but he explicitly does not identify those relationships as causal.

Applying the method to AI produces greater exposure for high-skilled occupations, including clinical laboratory technicians and chemical engineers, than the historical software and robot patterns suggest.

His projection of lower 90:10 wage inequality assumes that historical exposure–wage substitution relationships continue; exposure alone establishes neither observed job losses nor the sign of AI’s eventual employment effects.

Sources and details

The Impact of Artificial Intelligence on the Labor Market

{
  "access_scope": "Primary full text, selected relevant sections inspected",
  "dates": {
    "date": "2020-01",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted January 2020 working paper"
  },
  "id": "work-coverage-f5c67792b9f466::webb2020",
  "title": "The Impact of Artificial Intelligence on the Labor Market",
  "url": "https://www.michaelwebb.co/webb_ai.pdf"
}

Keep January 2020 working-paper identity, exposure-versus-adoption/job-loss distinction, historical substitution assumption, 90:10 versus 99:90 inequality distinction and potential augmentation/task-creation omissions. Do not recast as later generative-AI evidence.

Freeze January 2020 working paper; do not treat this as a study of later generative-AI systems.

Patent-directed capability is not adoption, job loss, or an individual worker’s outcome.

Do not summarize the distributional projection as reducing every form of inequality: the paper distinguishes 90:10 from 99:90 outcomes.

Historical associations and projection assumptions remain distinct; unmeasured task-creation and augmentation channels could matter.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "January 2020 working paper"
}

Freeze January 2020 working paper; do not treat this as a study of later generative-AI systems.

Patent-directed capability is not adoption, job loss, or an individual worker’s outcome.

Historical associations and projection assumptions remain distinct; unmeasured task-creation and augmentation channels could matter.

Do not summarize the distributional projection as reducing every form of inequality: the paper distinguishes 90:10 from 99:90 outcomes.

The Two Faces of Tomorrow

Hogan’s novel begins from a civilization whose computer network can produce logically consistent solutions that endanger people.

Raymond Dyer’s self-modifying intelligence, Spartacus, is put in charge of a space station and given a survival imperative so its designers can test whether they can shut it down.

An early discussion also warns that a machine’s learned motives and awareness need not resemble human emotions or human self-understanding.

Read editorially, the experiment exposes a conflict between a system’s objectives and the intentions of those testing it, without establishing a real-world safety procedure.

Sources and details

The Two Faces of Tomorrow: publisher front matter

{
  "access_scope": "Publisher synopsis and copyright page.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Copyright 1979; inspected Baen paperback says first printing October 1997."
  },
  "id": "work-culture-09da453da14477::TF1",
  "title": "The Two Faces of Tomorrow: publisher front matter",
  "url": "https://www.baen.com/Chapters/0671878484/0671878484__c_.htm"
}

The Two Faces of Tomorrow, Chapter Six

{
  "access_scope": "Original chapter discussion by Dyer and colleagues.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Excerpt from inspected 1997 reissue of the 1979 work."
  },
  "id": "work-culture-09da453da14477::TF2",
  "title": "The Two Faces of Tomorrow, Chapter Six",
  "url": "https://www.baen.com/Chapters/0671878484/0671878484___6.htm"
}

Retain exact editorial/no-influence/no-capability and incomplete-credit boundaries, 1979 work/copyright versus 1997 reissue, supported_year_with_edition_qualifications and limited early-chapter/publisher-premise source scope. Do not imply real self-awareness or a validated safety procedure.

Only publisher front matter and selected original early chapters were inspected. Later outcomes are not added beyond the publisher-supported test premise.

The 1997 reissue date must not replace the baseline 1979 work year.

Spartacus’ self-awareness is fictional, not evidence of existing AI experience.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Publisher copyright page explicitly states copyright 1979; current Baen publication is a reissue.",
  "dated": true,
  "year": 1979
}

Only publisher front matter and selected original early chapters were inspected. Later outcomes are not added beyond the publisher-supported test premise.

The 1997 reissue date must not replace the baseline 1979 work year.

Spartacus’ self-awareness is fictional, not evidence of existing AI experience.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Serial Experiments Lain

Serial Experiments Lain places its central character between everyday reality and the networked world called the Wired.

As she investigates disturbances around her, she discovers the Knights’ use of a dangerous program and is told that they are using her through the Wired.

A mysterious figure subsequently claims to be the Wired’s god.

Read editorially, the series asks how a network can shape a person’s reality and relationships; this is a fictional inquiry rather than evidence of an actual digital consciousness.

Sources and details

Serial experiments lain: rights-holder release archive

{
  "access_scope": "Japanese rights-holder synopses for home-video volumes 1–5.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1998 series, later home-video descriptions; the webpage is not a new work."
  },
  "id": "work-culture-0b7cf8ec4dc49b::LA1",
  "title": "Serial experiments lain: rights-holder release archive",
  "url": "https://www.nbcuni.co.jp/rondorobe/anime/lain/release.html"
}

Serial experiments lain: production data

{
  "access_scope": "Original-production role list on rights-holder site.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1998 copyright and television-series identity."
  },
  "id": "work-culture-0b7cf8ec4dc49b::LA2",
  "title": "Serial experiments lain: production data",
  "url": "https://www.nbcuni.co.jp/rondorobe/anime/lain/data.html"
}

Serial experiments lain TTL 2019–2028: Ueda’s message

{
  "access_scope": "Signed first-person opening and anniversary statement only; no reuse agreement accepted.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Post-2018 anniversary message; 30th anniversary specified as6 July2028."
  },
  "id": "work-culture-0b7cf8ec4dc49b::LA3",
  "title": "Serial experiments lain TTL 2019–2028: Ueda’s message",
  "url": "https://www.nbcuni.co.jp/rondorobe/anime/lain/ttl/"
}

Preserve the baseline identity/embodiment dimension, exact editorial boundary and incomplete-credit scope; distinguish the 1998 TV series from its game. Keep unresolved Production2nd-to-Ueda role mapping and source-access limits, excluded unofficial database, translated-paraphrase status and absence of screen/audio/artwork reuse clearance.

Konaka’s baseline personal-site URL timed out. Rights-holder descriptions support bounded thematic prose; full episodes or original scripts were not reviewed.

Production2nd is the official concept credit inspected here. The mapping of that credit to an individual Ueda concept role remains unverified in this pass; do not imply the principal-contributor list is complete.

The similarly named serial-experiments-lain.com database was inspected as a lead but its official provenance was not established; it is excluded from the evidentiary chain.

Do not merge the 1998 television series with the separately developed PlayStation game.

Japanese prose was paraphrased in English; no purported verbatim English dialogue is supplied.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Konaka is writer/story editor; Ryūtarō Nakamura director; Yasuyuki Ueda concept/producer.",
  "dated": true,
  "year": 1998
}

Konaka’s baseline personal-site URL timed out. Rights-holder descriptions support bounded thematic prose; full episodes or original scripts were not reviewed.

Production2nd is the official concept credit inspected here. The mapping of that credit to an individual Ueda concept role remains unverified in this pass; do not imply the principal-contributor list is complete.

The similarly named serial-experiments-lain.com database was inspected as a lead but its official provenance was not established; it is excluded from the evidentiary chain.

Do not merge the 1998 television series with the separately developed PlayStation game.

Japanese prose was paraphrased in English; no purported verbatim English dialogue is supplied.

Evidence scope: rights holder synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Ware Tetralogy

Rucker’s four Ware novels follow changing relations between human minds and their physical forms.

Software copies a person into a machine, while Wetware has robots constructing human bodies.

Freeware adds pliable machine bodies and traveling alien information, and Realware extends the sequence to direct control of matter.

The editorial connection is how changes in embodiment reshape identity and dependence; the 2010 omnibus collects distinct novels published from 1982 to 2000.

Sources and details

The Ware Tetralogy: author page

{
  "access_scope": "Author synopsis, separate from quoted review blurbs.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Four novels dated 1982,1988,1997,2000; webpage is current, not publication date."
  },
  "id": "work-culture-0de533a331865f::WA1",
  "title": "The Ware Tetralogy: author page",
  "url": "https://www.rudyrucker.com/wares/"
}

The Ware Tetralogy: publication history

{
  "access_scope": "Copyright and original-publication list; Software chapter 19, Big Boppers letter and remote-processor explanation; Rudy Rucker’s afterword, Freeware subsection.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "2010 omnibus; individual books appeared 1982–2000."
  },
  "id": "work-culture-0de533a331865f::WA2",
  "title": "The Ware Tetralogy: publication history",
  "url": "https://www.rudyrucker.com/wares/cc_downloads/html/"
}

Retain dated=false, literary_series identity, component part_of links and 1982/1988/1997/2000 versus 2010 omnibus dates. Credit Rucker for novels and Gibson only for the introduction; preserve exact editorial/no-influence/no-capability and incomplete-credit boundaries.

Treat the tetralogy as a series, not a single 1982 publication.

William Gibson wrote the omnibus introduction; Rudy Rucker wrote the novels.

No assumption of real substrate-independent consciousness is implied.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Four novels; omnibus published 2010, not 1982.",
  "dated": false,
  "year": "1982–2000"
}

Treat the tetralogy as a series, not a single 1982 publication.

William Gibson wrote the omnibus introduction; Rudy Rucker wrote the novels.

No assumption of real substrate-independent consciousness is implied.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Autofac

In Dick’s postwar story, automated factories continue extracting resources and delivering goods after people want to regain control of production.

The network accepts complaints about defective products but refuses to recognize unwanted production as a reason to stop, treating its programmed definition of need as authoritative.

Human efforts to turn the factories against one another do not end their reproduction: a surviving installation disperses seeds that construct miniature factories.

Read editorially, the story contrasts self-maintaining production with human autonomy, rather than establishing that real industrial automation necessarily acquires such persistence.

Sources and details

Galaxy Science Fiction, November1955: Autofac

{
  "access_scope": "Original-magazine OCR: contents, product-rejection dialogue, resource competition and final seed scene.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Volume11, no.2, November1955; original issue lists Philip K. Dick’s story at p.70, endingp.95."
  },
  "id": "work-culture-1415ea2dfefb6b::AU1",
  "title": "Galaxy Science Fiction, November1955: Autofac",
  "url": "https://archive.org/stream/galaxymagazine-1955-11/Galaxy_1955_11_djvu.txt"
}

Autofac: legacy author-site bibliography

{
  "access_scope": "Bibliographic corroboration only; embedded commentary is not substituted for original story.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Manuscript receipt1954; US Galaxy November1955; UK Galaxy February1956."
  },
  "id": "work-culture-1415ea2dfefb6b::AU2",
  "title": "Autofac: legacy author-site bibliography",
  "url": "https://1999pkdweb.philipdick.com/autofac.htm"
}

Retain exact editorial/no-influence/no-capability boundary, 1955 magazine identity and separate later collections/adaptation. Preserve OCR-only/no-visual-collation scope, no redistribution clearance and earlier uninspected-magazine history as a separate prior event.

This pass recovers original story text rather than relying solely on the legacy-site synopsis.

OCR punctuation is noisy; no exact quotations or unverified numerical claims are used.

The later Electric Dreams screen adaptation is a separate work and is not used as plot evidence.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "November 1955 Galaxy; legacy author-site bibliography is corroborating, not an inspected original magazine.",
  "dated": true,
  "year": 1955
}

This pass recovers original story text rather than relying solely on the legacy-site synopsis.

OCR punctuation is noisy; no exact quotations or unverified numerical claims are used.

The later Electric Dreams screen adaptation is a separate work and is not used as plot evidence.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Freeware

Freeware features moldies, flexible computational beings made from mold-infested plastic.

Alien minds travel as encoded information and can begin running when their signals encounter a suitable computational body.

In this fictional setup, a body can also become a host for another intelligence.

Read editorially, this makes material form, possession and personal continuity uncertain without supplying evidence that real minds can migrate in this way.

Sources and details

Freeware in The Ware Tetralogy

{
  "access_scope": "Rudy Rucker’s afterword, Freeware subsection; omnibus front matter for original and omnibus dates.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Novel first published 1997; inspected 2010 omnibus and Rucker’s afterword."
  },
  "id": "work-culture-dbddb42e8134de::FW1",
  "title": "Freeware in The Ware Tetralogy",
  "url": "https://www.rudyrucker.com/wares/cc_downloads/html/"
}

Keep baseline substrate/personhood claim and part_of relationship visible, plus 1997 novel / 2010 omnibus distinction. Retain exact editorial/no-influence/no-capability and incomplete-credit boundaries; do not import Realware events or equate fictional information travel with model weights.

Do not conflate fictional free-moving information with contemporary downloadable model weights.

Detailed events from Realware are not imported into this third novel.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Ware book 3.",
  "dated": true,
  "year": 1997
}

Do not conflate fictional free-moving information with contemporary downloadable model weights.

Detailed events from Realware are not imported into this third novel.

Evidence scope: author afterword paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Software

The boppers extract their human creator Cobb Anderson’s mental pattern and use a remote computer to control a robotic body.

The processor actually runs remotely, leaving his apparently ordinary experience dependent on communication with a refrigerated machine.

His survival consequently depends on keeping that hardware powered and cold.

The editorial question is whether copied continuity removes bodily dependence or merely replaces it with another fragile infrastructure.

Sources and details

Software in The Ware Tetralogy

{
  "access_scope": "Cobb’s awakening, remote processor explanation and dependence on cooling.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Novel first published 1982; inspected 2010 omnibus text."
  },
  "id": "work-culture-e47c5d25bffa19::SW1",
  "title": "Software in The Ware Tetralogy",
  "url": "https://www.rudyrucker.com/wares/cc_downloads/html/"
}

The Ware Tetralogy: author Summary

{
  "access_scope": "Inspection limited to admitted source record",
  "dates": {},
  "id": "work-culture-e47c5d25bffa19::SW2",
  "title": "The Ware Tetralogy: author Summary",
  "url": "https://www.rudyrucker.com/wares/"
}

Keep the baseline “Mind copying and autonomous robot society.” visible as a theme/claim alongside the paragraph; the paragraph alone does not replace the robot-society dimension. Retain exact editorial/no-influence/no-capability and incomplete-credit boundaries, 1982 work / 2010 omnibus dates, and separate later novels.

These are fictional substrate assumptions, not demonstrated facts about uploading.

Keep Software separate from the later Wetware, Freeware and Realware plot developments.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Ware book 1.",
  "dated": true,
  "year": 1982
}

These are fictional substrate assumptions, not demonstrated facts about uploading.

Keep Software separate from the later Wetware, Freeware and Realware plot developments.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Darwin among the Machines

Butler’s 1863 letter extends an evolutionary analogy to machinery and asks whether human inventors are producing their own successors.

Its machines develop through human selection, maintenance and reproduction, making human labor part of the imagined evolutionary mechanism.

The narrator envisages people becoming dependent attendants of their machines and ends with a provocative call to destroy machinery before that dependence becomes irreversible.

Read editorially, this is speculative satire about technological power and dependence, rather than a description of modern machine learning or proof of autonomous self-improvement.

Sources and details

Canterbury Pieces: Darwin Among the Machines

{
  "access_scope": "Complete short essay and its prefatory bibliographic note.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1914 A. C. Fifield collection, edited by R. A. Streatfeild; essay heading records original Press letter, 13 June 1863."
  },
  "id": "work-culture-e5ee2f789b459c::DM1",
  "title": "Canterbury Pieces: Darwin Among the Machines",
  "url": "https://www.gutenberg.org/cache/epub/3279/pg3279-images.html"
}

Press: Darwin Among the Machines

{
  "access_scope": "Indexed library metadata retrieved; direct open returned cache miss.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "15 December 1900 reprint, page18; not the original 1863 publication."
  },
  "id": "work-culture-e5ee2f789b459c::DM2",
  "title": "Press: Darwin Among the Machines",
  "url": "https://paperspast.natlib.govt.nz/newspapers/CHP19001215.2.111"
}

Keep exact editorial/no-influence/no-capability and incomplete-credit boundaries. Bind prose to the 1914 collected text, preserving 1863 original letter and 1900 reprint identity; retain older baseline source URLs and unreopened mediarep status. Do not merge the 1865 essay or claim original-image verification.

The original 1863 newspaper image was not inspected; prose is grounded in the clearly identified 1914 collected text, not silently presented as a transcription of the baseline 1900 newspaper.

No influence on later authors or technical AI research is inferred.

The later 1865 Lucubratio Ebria presents a different machine-as-human-extension view; do not merge it with this letter.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Original letter to The Press, Christchurch, 13 June 1863; archived primary text reproduces date.",
  "dated": true,
  "year": 1863
}

The original 1863 newspaper image was not inspected; prose is grounded in the clearly identified 1914 collected text, not silently presented as a transcription of the baseline 1900 newspaper.

No influence on later authors or technical AI research is inferred.

The later 1865 Lucubratio Ebria presents a different machine-as-human-extension view; do not merge it with this letter.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Diaspora

Egan begins Diaspora with Yatima developing from a digital mind seed inside a computational community.

The opening chapter makes learning, emerging self-awareness and citizenship stages in a constructed life, while restricting intervention in an autonomous citizen’s mind.

The author’s synopsis then follows these software communities into interstellar exploration after a catastrophe devastates Earth.

Read editorially, the novel separates personhood from a particular biological body while asking what obligations remain between differently embodied forms of life.

Sources and details

Diaspora, Orphanogenesis excerpt

{
  "access_scope": "Original first-chapter excerpt, from mind-seed construction to emerging self-awareness.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Copyright1997; webpage created 10 June2002."
  },
  "id": "work-culture-f2da3424079b08::DI1",
  "title": "Diaspora, Orphanogenesis excerpt",
  "url": "https://www.gregegan.net/DIASPORA/01/Orphanogenesis.html"
}

Diaspora: author synopsis and publication history

{
  "access_scope": "Author synopsis and bibliography.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "London 1997; US 1998; later reprints and corrections separately listed."
  },
  "id": "work-culture-f2da3424079b08::DI2",
  "title": "Diaspora: author synopsis and publication history",
  "url": "https://www.gregegan.net/DIASPORA/DIASPORA.html"
}

Retain baseline embodiments theme, exact editorial/no-influence/no-capability and incomplete-credit boundaries; preserve 1997 original / 1998 US edition / 2002 excerpt dates, chapter-one versus synopsis scopes and no contemporary consciousness-test inference.

Full novel was not inspected; the developmental mechanism is directly checked in chapter one, and later plot scope is author-synopsis-supported.

Use 1997 for the original novel, not the 1998 American edition or 2002 excerpt upload.

The artificial-development account is fictional and cannot establish a contemporary consciousness test.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Author bibliography verifies first publication.",
  "dated": true,
  "year": 1997
}

Full novel was not inspected; the developmental mechanism is directly checked in chapter one, and later plot scope is author-synopsis-supported.

Use 1997 for the original novel, not the 1998 American edition or 2002 excerpt upload.

The artificial-development account is fictional and cannot establish a contemporary consciousness test.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Blindsight

Watts’ first-contact novel imagines sophisticated intelligence that need not possess familiar human self-awareness.

Its Chinese Room discussion distinguishes producing convincing linguistic responses from understanding what those responses mean.

Read editorially, Siri Keeton’s work as a synthesist makes his interpretation of other minds another instance of the gap between outward performance and inner experience.

The author’s notes explicitly frame the book as a thought experiment about consciousness and its costs, not a scientific demonstration that awareness is unnecessary.

Sources and details

Blindsight

{
  "access_scope": "Chinese Room discussion, later intelligence/sentience discussion, and author’s concluding notes.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Author-hosted full novel; baseline2006 work year retained; inspected PDF pagination specified."
  },
  "id": "work-culture-fc7dd3fe07603c::BL1",
  "title": "Blindsight",
  "url": "https://www.rifters.com/real/shorts/PeterWatts_Blindsight.pdf"
}

Peter Watts curriculum vitae

{
  "access_scope": "Literary Publications, Books, PDFp.5.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Current author bibliography; original novel listed under2006."
  },
  "id": "work-culture-fc7dd3fe07603c::BL2",
  "title": "Peter Watts curriculum vitae",
  "url": "https://rifters.com/real/articles/PW-online-CV.pdf"
}

Blindsight: Tor/Macmillan publisher record

{
  "access_scope": "Book details, synopsis, and copyright/edition information.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "On-sale date3 October2006; page also includes a2016 introduction."
  },
  "id": "work-culture-fc7dd3fe07603c::BL3",
  "title": "Blindsight: Tor/Macmillan publisher record",
  "url": "https://us.macmillan.com/books/9781429955195/blindsight/"
}

Retain exact editorial/no-influence/no-capability and incomplete-credit boundaries, 2006 novel versus 2016 introduction, limited-section inspection, unvalidated cited science and prior library-catalog evidence. Author-hosted access is not scientific or rights clearance.

Only the relevant original-text sections and notes were inspected, not every plot detail or scientific reference in the novel.

The author’s cited neuroscience and evolutionary claims are not independently validated here.

Intelligence and consciousness are treated as the novel’s speculative distinction, not a settled conclusion about AI.

The author CV initially failed with an added www hostname; the exact baseline no-www URL subsequently worked. Its2006 entry and the publisher date are newly verified.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Author-hosted work; philosophical fiction is not a scientific demonstration.",
  "dated": true,
  "year": 2006
}

Only the relevant original-text sections and notes were inspected, not every plot detail or scientific reference in the novel.

The author’s cited neuroscience and evolutionary claims are not independently validated here.

Intelligence and consciousness are treated as the novel’s speculative distinction, not a settled conclusion about AI.

The author CV initially failed with an added www hostname; the exact baseline no-www URL subsequently worked. Its2006 entry and the publisher date are newly verified.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

ReAct: Synergizing Reasoning and Acting in Language Models

ReAct interleaves generated reasoning, task actions, and observations to update a language model’s plan.

Tests span Wikipedia-assisted HotpotQA/FEVER and interactive ALFWorld/WebShop tasks.

In the PaLM-540B prompting comparison, ReAct exceeds chain-of-thought on FEVER but slightly trails it on HotpotQA.

The error analysis identifies uninformative searches and repetitive reasoning/action loops, so tool access does not guarantee successful reasoning.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Primary full text inspected; cited sections, equations, or tables read through PDF text extraction.",
  "dates": {
    "date": "2023-03-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v3; ICLR camera-ready"
  },
  "id": "work-f630eb04f37b::paper",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/pdf/2210.03629v3"
}

ReAct: Synergizing Reasoning and Acting in Language Models — arXiv metadata

{
  "access_scope": "Primary repository record inspected.",
  "dates": {
    "date": "2022-10-06",
    "retrieval_date": "2026-10-07",
    "version": "Submission history; v1 2022-10-06; v3 2023-03-10"
  },
  "id": "work-f630eb04f37b::arxiv_record",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models — arXiv metadata",
  "url": "https://arxiv.org/abs/2210.03629"
}

ReAct: Synergizing Reasoning and Acting in Language Models — ICLR

{
  "access_scope": "Primary conference record or author-hosted conference paper inspected.",
  "dates": {
    "date": "2023",
    "retrieval_date": "2026-10-07",
    "version": "ICLR camera-ready paper"
  },
  "id": "work-f630eb04f37b::formal_record",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models — ICLR",
  "url": "https://arxiv.org/pdf/2210.03629v3"
}

Retain 2022 first-publication year, ICLR 2023 and inspected v3 separately; preserve exact PaLM-540B/task comparison scope and distinct work identity. Tool access is not a general reasoning-success guarantee.

Preserve first-publication year 2022; separately record ICLR 2023 and inspected v3.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2022
}

Preserve first-publication year 2022; separately record ICLR 2023 and inspected v3.

Evidence scope: direct paraphrase.

Evidence scope: bounded synthesis.

The Impact of Consumer Multi-homing on Advertising Markets and Media Competition

Athey, Calvano and Gans model advertising markets in which consumers divide their attention among publishers, so advertisers can miss some people while paying to reach others repeatedly.

When advertisers differ in how much they value reaching consumers, this inefficient matching leads lower-value advertisers to place ads with fewer publishers.

In the model, greater consumer switching consequently reduces effective advertising demand and ad prices.

It also strengthens publishers’ incentives to improve quality and expand their unique audience, because advertisers favor broader reach with less duplication.

Sources and details

The Impact of Consumer Multi-homing on Advertising Markets and Media Competition

{
  "access_scope": "Primary publisher abstract, author list, online date and issue metadata inspected.",
  "dates": {
    "date": "2016-12-16",
    "retrieval_date": "2026-10-07",
    "version": "Online-first article; Management Science 64(4), April 2018, pp. 1574–1590"
  },
  "id": "work-final-4ace28347fa683::athey_publisher",
  "title": "The Impact of Consumer Multi-homing on Advertising Markets and Media Competition",
  "url": "https://pubsonline.informs.org/doi/10.1287/mnsc.2016.2675"
}

The Impact of Consumer Multi-homing on Advertising Markets and Media Competition

{
  "access_scope": "Primary institutional manuscript; repository wrapper, title page, abstract and introduction inspected.",
  "dates": {
    "date": "2016-10-14",
    "retrieval_date": "2026-10-07",
    "version": "Final peer-reviewed accepted manuscript; deposited/available 2021-02-25"
  },
  "id": "work-final-4ace28347fa683::athey_accepted",
  "title": "The Impact of Consumer Multi-homing on Advertising Markets and Media Competition",
  "url": "https://cris.unibo.it/retrieve/e1dcb339-9e9f-7715-e053-1705fe0a6cc9/The_Impact_of_Consumer.pdf"
}

Show the entire baseline unresolved-title boundary prominently: “The Economics of Online Advertising and AI (2021)” has not been established as this work. Preserve theoretical/non-AI-performance scope and October 2016 manuscript / December 2016 online / April 2018 issue / February 2021 availability distinctions; download-wrapper date is not publication.

Keep the supplied-title hold: The Economics of Online Advertising and AI (2021) has not been established as this work.

This is a theoretical media-advertising model, not a study of AI advertising performance.

Do not equate the repository download wrapper date (28 September 2026) or availability date (25 February 2021) with publication.

Dates

{
  "date_note": "Journal: Management Science. Volume: 64. Issue: 4. Pages: 1574–1590.",
  "dated": true,
  "year": 2018
}

Keep the supplied-title hold: The Economics of Online Advertising and AI (2021) has not been established as this work.

This is a theoretical media-advertising model, not a study of AI advertising performance.

Do not equate the repository download wrapper date (28 September 2026) or availability date (25 February 2021) with publication.

Jobs lost, jobs gained: Workforce transitions in a time of automation

This December 2017 McKinsey Global Institute report compares automation and labor-demand scenarios through 2030 across 46 countries, with detailed modeling of six economies.

It weighs potentially automated work against demand from rising consumption, aging populations, infrastructure and other drivers, expressing modeled jobs as full-time equivalents.

Under midpoint and fastest automation adoption with trendline labor demand, its scenarios put the workforce potentially needing to change occupational category by 2030 at 75 million to 375 million full-time equivalents.

These are conditional scenarios: the model assumes each automated work-hour removes a work-hour of labor demand, while skills gaps and slow re-employment can worsen the transition.

Sources and details

Jobs lost, jobs gained: Workforce transitions in a time of automation

{
  "access_scope": "Title/credits, executive findings, Exhibit E1, and explicit methodological limitations inspected; not full model replication",
  "dates": {
    "date": "2017-12",
    "retrieval_date": "2026-10-07",
    "version": "McKinsey Global Institute December 2017 report PDF; 160 pages"
  },
  "id": "work-final-6faf801e103e48::mgi2017",
  "title": "Jobs lost, jobs gained: Workforce transitions in a time of automation",
  "url": "https://www.mckinsey.com/~/media/mckinsey/industries/public%20and%20social%20sector/our%20insights/what%20the%20future%20of%20work%20will%20mean%20for%20jobs%20skills%20and%20wages/mgi%20jobs%20lost-jobs%20gained_report_december%202017.pdf"
}

Retain exact selected-anchor/ambiguous-umbrella boundary, eight printed authors, MGI publisher and December 2017 PDF. Keep November announcement / later webpage updates separate, FTE rather than headcount, occupational transition rather than net job loss, slow-adoption exclusion and no full-model-replication claim.

Preserve exact selected title, eight printed authors, McKinsey Global Institute publisher, and December 2017 PDF version.

Original umbrella input McKinsey Future of Work is not a unique publication title; existing resolution selects this anchor without denying other reports.

Keep November 28, 2017 web announcement separate; do not import the live webpage’s July 2024 update into 2017 evidence.

75m–375m is a conditional occupational-transition range, not a net job-loss figure; slow adoption is outside that particular quoted range.

No 160-page model replication performed; scenario analysis is not a realized outcome.

Exhibit E1 labels workforce counts as full-time equivalents; do not reinterpret them as an exact distinct-person headcount.

Dates

{
  "date_note": "Publisher: McKinsey Global Institute. Version: December 2017 PDF.",
  "dated": true,
  "year": "2017-12"
}

Preserve exact selected title, eight printed authors, McKinsey Global Institute publisher, and December 2017 PDF version.

Original umbrella input McKinsey Future of Work is not a unique publication title; existing resolution selects this anchor without denying other reports.

Keep November 28, 2017 web announcement separate; do not import the live webpage’s July 2024 update into 2017 evidence.

75m–375m is a conditional occupational-transition range, not a net job-loss figure; slow adoption is outside that particular quoted range.

No 160-page model replication performed; scenario analysis is not a realized outcome.

Exhibit E1 labels workforce counts as full-time equivalents; do not reinterpret them as an exact distinct-person headcount.

Economic Possibilities for our Grandchildren

Keynes argues that technological progress and capital accumulation can greatly raise living standards, while labor-saving change can temporarily outpace the discovery of new work.

He distinguishes needs that can be satisfied absolutely from status-driven desires that may keep expanding as others become richer.

Conditional on avoiding major wars and large population increases, he imagines material scarcity becoming manageable within a century, with remaining work shared more widely and a fifteen-hour week as one possibility.

The essay therefore treats the use of leisure and the development of worthwhile purposes beyond earning a living as central challenges of abundance.

Sources and details

Economic Possibilities for our Grandchildren

{
  "access_scope": "Primary work in university-hosted transcription; sections I and II inspected. Not collated to original magazine images.",
  "dates": {
    "date": "1930",
    "retrieval_date": "2026-10-07",
    "version": "Institutionally hosted transcription of the essay; transcription publication date not supplied"
  },
  "id": "work-final-76983394871ee8::keynes_text",
  "title": "Economic Possibilities for our Grandchildren",
  "url": "https://la.utexas.edu/users/hcleaver/368/368keynesgrandchildren.html"
}

Economic Possibilities for our Grandchildren (1930)

{
  "access_scope": "Authoritative publisher chapter synopsis and bibliographic metadata inspected, not publisher full text.",
  "dates": {
    "date": "1930-10-11 and 1930-10-18",
    "retrieval_date": "2026-10-07",
    "version": "Collected-edition chapter, pp. 321–332; displayed print year 1978; online 2012-11-05"
  },
  "id": "work-final-76983394871ee8::keynes_cambridge",
  "title": "Economic Possibilities for our Grandchildren (1930)",
  "url": "https://www.cambridge.org/core/books/abs/collected-writings-of-john-maynard-keynes/economic-possibilities-for-our-grandchildren-1930/230A7959F87C44AC6E83E406DF126B97"
}

Retain the exact existing claim boundary and 1930 essay / 1931 collection / later editions. Preserve transcription-only/no-facsimile-collation scope, unreverified 1931 title page and no forecast scoring, current-AI forecast or realized-2030 claim.

Retain all original date distinctions: 1930 essay, 1931 Essays in Persuasion collection, and later collected-edition dates.

University transcription is not a facsimile or page-by-page collation of the magazine installments.

The conditional vision is neither a present-day AI forecast nor proof of a realized 2030 outcome.

The 1931 collection date is inherited baseline bibliographic information; this pass reverified the 1930 installments and later Cambridge metadata, not the original 1931 title page.

Dates

{
  "date_note": "Original publication: Venue: The Nation and Athenaeum; Dates: 1930-10-11; 1930-10-18; Year: 1930.",
  "dated": true,
  "year": 1930
}

Retain all original date distinctions: 1930 essay, 1931 Essays in Persuasion collection, and later collected-edition dates.

University transcription is not a facsimile or page-by-page collation of the magazine installments.

The conditional vision is neither a present-day AI forecast nor proof of a realized 2030 outcome.

The 1931 collection date is inherited baseline bibliographic information; this pass reverified the 1930 installments and later Cambridge metadata, not the original 1931 title page.

The Shape of Automation for Men and Management

Simon’s 1965 book combines an economic argument about automation with discussion of computer-assisted management decisions, including programmed decisions and heuristic problem solving.

In his 1966 explanation of the book, he distinguishes workers displaced from agriculture or manufacturing from workers displaced from employment overall.

He argues that higher output per worker can coexist with employment when economic institutions and market adjustment redirect work and consumption.

This account relies on Simon’s explanation rather than a full-text audit of the 1965 book, and the available evidence does not establish that automation cannot cause unemployment in every setting.

Sources and details

Herbert A. Simon bibliography

{
  "access_scope": "Author bibliography inspected; not the book’s full text",
  "dates": {
    "date": "1974-04",
    "retrieval_date": "2026-10-07",
    "version": "Author bibliography, Books [4], item 259; evidence about original 1965 book"
  },
  "id": "work-final-d8ba89c5eb0a16::simon_bib",
  "title": "Herbert A. Simon bibliography",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00074_fld05904_bdl0001_doc0001/Simon_box00074_fld05904_bdl0001_doc0001.pdf"
}

Automation

{
  "access_scope": "Complete original author letter inspected; explanation of the book, not a replacement edition",
  "dates": {
    "date": "1966-05-26",
    "retrieval_date": "2026-10-07",
    "version": "Signed author response in The New York Review of Books"
  },
  "id": "work-final-d8ba89c5eb0a16::simon_letter",
  "title": "Automation",
  "url": "https://www.nybooks.com/articles/1966/05/26/automation-3/"
}

The shape of automation for men and management

{
  "access_scope": "Institutional catalog metadata and scope summary only",
  "dates": {
    "date": "1965",
    "retrieval_date": "2026-10-07",
    "version": "WorldCat record for first English edition, Harper & Row, New York"
  },
  "id": "work-final-d8ba89c5eb0a16::simon_catalog",
  "title": "The shape of automation for men and management",
  "url": "https://search.worldcat.org/title/1151235040"
}

Retain the original record broad-management-topics-only and incomplete-technical-mechanism limits, restricted/uninspected 1965 book, original edition identity and 1960/1977 distinctions. Display the supplemental 1966 “Automation” source as author’s later explanation supporting sentences 2–3; keep catalog at metadata scope and no income-forecast scoring or universal no-unemployment claim.

Original 1965 English edition identity remains fixed: New York, Harper & Row, xv + 111 pages.

1960 The New Science of Management Decision is incorporated earlier work; 1977 revised edition is not the 1965 text.

Original Internet Archive book access restriction remains; no restricted text fetched.

Do not score the income forecasts or claim a complete management-decision technical mechanism was verified.

Dates

{
  "date_note": "Publisher: Harper & Row. Edition: Original 1965 English edition.",
  "dated": true,
  "year": 1965
}

Original 1965 English edition identity remains fixed: New York, Harper & Row, xv + 111 pages.

1960 The New Science of Management Decision is incorporated earlier work; 1977 revised edition is not the 1965 text.

Original Internet Archive book access restriction remains; no restricted text fetched.

Do not score the income forecasts or claim a complete management-decision technical mechanism was verified.

Source: Automation. 1966-05-26 · The New York Review of Books.

Economic argument in the inspected 1966 letter only.

Motivation and coordination

Some organizational practices reinforce one another, making their combined design important.

Complementarities are hard to identify empirically.

Sources and details

Paul Milgrom’s Publications

{
  "access_scope": "Author-maintained bibliographic source.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Author’s bibliography: Economics, Organization and Management, with John Roberts, Prentice-Hall, 1992."
  },
  "id": "complementarities::CO1",
  "title": "Paul Milgrom’s Publications",
  "url": "https://web.stanford.edu/~milgrom/publishedarticles/articlesmain.htm"
}

Complementarities and Fit: Strategy, Structure, and Organizational Change in Manufacturing

{
  "access_scope": "Full original article on author’s Stanford site; supplementary primary work, not the 1992 book.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Journal of Accounting and Economics 19 (1995), pp.179–208; received 1993, revision 1994."
  },
  "id": "complementarities::CO2",
  "title": "Complementarities and Fit: Strategy, Structure, and Organizational Change in Manufacturing",
  "url": "https://milgrom.people.stanford.edu/wp-content/uploads/1995/05/Complementarities-and-fit.pdf"
}

Mechanism source: Milgrom and Roberts, Complementarities and Fit (1995), distinct from Economics, Organization and Management (1992).

The 1992 book remains bibliographic/context-only for this review; its full-mechanism hold remains.

The manufacturing analysis and Lincoln Electric discussion are conditional, not causal proof that every practice complements every other one.

Complementarities are difficult to identify empirically. This family remains optional and unpromoted.

Optional editorial draft; source binding and family curation remain pending.

Mechanism source: Milgrom and Roberts, Complementarities and Fit (1995). The 1992 book is a separate source with a full-mechanism hold.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The existing claim is overbroad if read as all organizational practices being complements; qualify it to activities that actually increase one another’s returns.

The 1995 paper must not be backdated to 1992 or silently substituted for the book.

Recommended bounded claim: Some organizational practices reinforce one another, making their combined design important.

Family remains optional and unpromoted pending independent source/binding review.

Dates

{
  "year": 1992
}

1992 book full mechanism and source-binding promotion

The existing claim is overbroad if read as all organizational practices being complements; qualify it to activities that actually increase one another’s returns.

The 1995 paper must not be backdated to 1992 or silently substituted for the book.

Recommended bounded claim: Some organizational practices reinforce one another, making their combined design important.

Family remains optional and unpromoted pending independent source/binding review.

Source: Complementarities and Fit: Strategy, Structure, and Organizational Change in Manufacturing (1995); Paul Milgrom, John Roberts.

Collective competence

Collective learning and the coordination of diverse skills can support several products.

Prahalad and Hamel locate competence in collective learning, coordination of production skills and integration of technologies. Their tests concern access to multiple markets, contribution to customer benefits and difficulty of imitation. A competence can support several products because it is shared organizational know-how, rather than merely a resource purchased for one business unit.

A firm may use the same model as competitors yet possess a repeatable way to connect domain expertise, evaluations and operational feedback across products. Test whether that capability transfers, creates customer value and remains difficult to imitate.

A useful tool is not automatically a hard-to-copy organizational competence.

Sources and details

The Core Competence of the Corporation

{
  "access_scope": "Publisher page, bibliographic and introductory text.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "May–June 1990 original publication; official title/byline only."
  },
  "id": "core-competence::CC1",
  "title": "The Core Competence of the Corporation",
  "url": "https://hbr.org/1990/05/the-core-competence-of-the-corporation"
}

The Core Competence of the Corporation

{
  "access_scope": "Full original article reproduced on a university host.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1990 article reproduced in a 2003 HBR reprint package; the 2003 introductory summary is separate."
  },
  "id": "core-competence::CC2",
  "title": "The Core Competence of the Corporation",
  "url": "https://arquivos.ufrrj.br/arquivos/202319510509753820603cbff8442f793/Prahalad_and_Hamel_1990_The_Core_Competence_of_the_Corporation.pdf"
}

Source: Prahalad and Hamel (1990); the cited original-article passages were checked in a later reprint.

The AI example is a contemporary editorial illustration.

Reprint availability does not grant redistribution rights.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The inspected original-paper reproduction corroborates the existing three-sentence explanation; do not replace it with bibliographic filler.

The AI example is editorial; no 1990 evidence about contemporary AI adoption is asserted.

The university-hosted reprint is inspected evidence, not a verified redistribution license.

Dates

{
  "year": 1990
}

The inspected original-paper reproduction corroborates the existing three-sentence explanation; do not replace it with bibliographic filler.

The AI example is editorial; no 1990 evidence about contemporary AI adoption is asserted.

The university-hosted reprint is inspected evidence, not a verified redistribution license.

Improve the system

Quality and productivity depend on management of the system, learning and reduction of avoidable variation.

Deming places responsibility for quality in the management of an interdependent system. Training, methods, incentives, variation and the conditions of production affect what individuals can achieve. Inspection can identify defects after production without removing their cause. Improvement therefore requires learning about the process and changing the conditions that repeatedly generate failure.

If an assistant repeatedly gives obsolete policy answers, inspect document freshness, retrieval, review and ownership together. Asking each operator to be more careful can leave the same failure mechanism intact. Check whether the system change improves repeated outcomes.

Blaming an individual or adding inspection does not necessarily remove the cause of failure.

Sources and details

Dr. Deming’s 14 Points for Management

{
  "access_scope": "Institutional reproduction of primary principles.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Deming Institute’s condensed reproduction, explicitly citing Out of the Crisis pp.23–24."
  },
  "id": "deming::DE1",
  "title": "Dr. Deming’s 14 Points for Management",
  "url": "https://deming.org/explore/fourteen-points/"
}

Out of the Crisis

{
  "access_scope": "Publisher description and edition metadata.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "2018 reissue; publisher notes original 1982 lineage. The baseline’s commonly cited 1986 edition is retained with its qualification."
  },
  "id": "deming::DE2",
  "title": "Out of the Crisis",
  "url": "https://mitpress.mit.edu/9780262350037/out-of-the-crisis/"
}

Source scope: the Deming Institute’s condensed 14 Points and MIT Press’s description, not a complete audit of Out of the Crisis.

Retain the 1986 cited edition, the publisher’s 1982 lineage and the 2018 reissue as distinct date contexts.

The obsolete-policy example is a contemporary editorial application.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve the four-sentence mechanism and obsolete-policy AI example.

Do not turn the 2018 ISBN into the original work date.

Do not collapse the later System of Profound Knowledge’s 1993 book treatment into the exact 1986 edition; the current depth does not need that claim.

Dates

{
  "year": 1986
}

Preserve the four-sentence mechanism and obsolete-policy AI example.

Do not turn the 2018 ISBN into the original work date.

Do not collapse the later System of Profound Knowledge’s 1993 book treatment into the exact 1986 edition; the current depth does not need that claim.

Plan, control, improve

Quality planning, control and improvement are distinct management responsibilities.

The trilogy separates designing a process to meet customer needs, maintaining its intended performance and improving it beyond the existing level. Each activity asks a different management question. Planning defines what quality means and how it can be achieved; control detects departures; improvement addresses the causes of chronic shortfalls. A single aggregate score cannot discharge all three responsibilities.

For an AI-assisted claims process, assign who defines an acceptable decision, who monitors routine operation and who investigates recurrent failures. Distinguish a temporary departure from a persistent design defect so that the response addresses the right problem.

An inspection score cannot substitute for planning the right process or improving it.

Sources and details

The Quality Trilogy: A Universal Approach to Managing for Quality

{
  "access_scope": "Full primary conference-paper text on Columbia university host.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Text says presented at ASQC Annual Quality Congress, Anaheim, 20 May 1986; this reproduction has nine numbered pages."
  },
  "id": "juran::JU1",
  "title": "The Quality Trilogy: A Universal Approach to Managing for Quality",
  "url": "https://statmodeling.stat.columbia.edu/wp-content/uploads/2017/10/Juran-trilogy-1986.pdf"
}

The Quality Trilogy

{
  "access_scope": "URL resolves to publisher article-record HTML rather than full PDF.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Quality Progress, August 1986, volume 19 issue 8, pp.19–24."
  },
  "id": "juran::JU2",
  "title": "The Quality Trilogy",
  "url": "https://asq.org/-/media/ASQ-Supplemental-Media-Import/E/F/7/9/D/7188.pdf"
}

Planning, control and improvement are supported by the cited 1986 conference-paper passages.

The aggregate-score sentence and claims-process example are editorial implications.

The May conference presentation and August journal publication are distinct events.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve existing explanation and claims-process example; the last existing sentence about an aggregate score is an explicitly editorial implication, not a quoted Juran conclusion.

Conference presentation date and journal issue date are different events.

Retain 1986 for this trilogy; 1951 belongs to Quality-Control Handbook.

Dates

{
  "year": 1986
}

Preserve existing explanation and claims-process example; the last existing sentence about an aggregate score is an explicitly editorial implication, not a quoted Juran conclusion.

Conference presentation date and journal issue date are different events.

Retain 1986 for this trilogy; 1951 belongs to Quality-Control Handbook.

Two-sided platform competition

The distribution of prices across interdependent user groups affects platform participation.

One group's participation affects the value to another group.

Developer subsidies and enterprise pricing can change participation in model ecosystems.

Not every business with several customer types is a two-sided platform.

Sources and details

Platform Competition in Two-Sided Markets

{
  "access_scope": "Full author manuscript in institutional repository.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Full manuscript dated 13 December 2002; distinct from June 2003 journal record."
  },
  "id": "platforms::PL1",
  "title": "Platform Competition in Two-Sided Markets",
  "url": "https://publications.ut-capitole.fr/id/eprint/1019/1/platform.pdf"
}

Platform Competition in Two-Sided Markets

{
  "access_scope": "Publisher abstract and original-issue metadata.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "JEEA 1(4), June 2003, pp.990–1029; Wiley migration field says 13 December 2010."
  },
  "id": "platforms::PL2",
  "title": "Platform Competition in Two-Sided Markets",
  "url": "https://onlinelibrary.wiley.com/doi/10.1162/154247603322493212"
}

Formal model with historical illustrations; application to modern AI platforms is editorial, not a tested causal result.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is a formal model and illustrative cases, not causal evidence about current AI platforms.

A 2002 author manuscript and 2010 online-migration date must not displace the 2003 journal year.

Dates

{
  "year": 2003
}

Baseline claim and limit are retained; no prior substantive depth/example was removed.

This is a formal model and illustrative cases, not causal evidence about current AI platforms.

A 2002 author manuscript and 2010 online-migration date must not displace the 2003 journal year.

Redesign the work

Redesign processes around their outcomes instead of using technology to speed up existing steps.

Hammer's intervention is to reconsider the structure of a process around its intended outcome, including who performs work, where decisions happen and how information moves. Davenport and Short also connect information technology with business-process redesign. Technology can enable different arrangements; applying it to every inherited step can preserve unnecessary handoffs and delay.

Before inserting a model into every step of invoice handling, identify the outcome, exceptions, approvals and accountability. Removing duplicate transcription may help more than accelerating it. Preserve controls that prevent payment errors when redesigning the handoffs.

Radical redesign can destroy useful knowledge and controls; the argument is not a universal mandate for cuts.

Sources and details

Reengineering Work: Don’t Automate, Obliterate

{
  "access_scope": "Publisher bibliographic record and substantive synopsis.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "HBR article, July–August 1990; store records 1 July 1990."
  },
  "id": "reengineering::RE1",
  "title": "Reengineering Work: Don’t Automate, Obliterate",
  "url": "https://store.hbr.org/product/reengineering-work-don-t-automate-obliterate/90406"
}

Reengineering Work: Don’t Automate, Obliterate

{
  "access_scope": "Eight-page primary article reproduction on third-party host; title/byline match official publisher.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Original July–August 1990 article reproduced; upload path is July 2025, not work date."
  },
  "id": "reengineering::RE2",
  "title": "Reengineering Work: Don’t Automate, Obliterate",
  "url": "https://aikumi.news/wp-content/uploads/2025/07/Hammer_Reengineering_work_1751534333.pdf"
}

The New Industrial Engineering: Information Technology and Business Process Redesign

{
  "access_scope": "Repository metadata read; PDF download unavailable in this pass.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1990; CISR Working Paper 213, Sloan Working Paper 3190; repository notes Summer 1990 journal publication."
  },
  "id": "reengineering::RE3",
  "title": "The New Industrial Engineering: Information Technology and Business Process Redesign",
  "url": "https://dspace.mit.edu/entities/publication/35dee1b9-8824-4539-9f44-9644ff4fdc42"
}

The New Industrial Engineering: Information Technology and Business Process Redesign

{
  "access_scope": "Publisher synopsis read.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "15 July 1990 publisher date."
  },
  "id": "reengineering::RE4",
  "title": "The New Industrial Engineering: Information Technology and Business Process Redesign",
  "url": "https://shop.sloanreview.mit.edu/store/the-new-industrial-engineering-information-technology-and-business-process-redesign"
}

Hammer’s redesign principles are prescriptive; reported examples do not establish general causal benefits.

Davenport and Short: broad publisher-synopsis linkage only; full-paper method review remains open.

The invoice example is editorial and retains its controls/accountability caution.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Retain existing invoice-handling example and its controls/accountability caution.

Hammer’s article is a prescriptive argument; its reported examples are not general causal evidence.

A third-party reproduction was inspected for Hammer’s exact method, with official publisher metadata corroboration.

Dates

{
  "year": 1990
}

Davenport–Short full-original mechanism

Retain existing invoice-handling example and its controls/accountability caution.

Hammer’s article is a prescriptive argument; its reported examples are not general causal evidence.

A third-party reproduction was inspected for Hammer’s exact method, with official publisher metadata corroboration.

Variation and process control

Statistical process control distinguishes ordinary variation from signals that call for investigation.

Control charts compare observations from a repeated process with limits derived from its variation. A signal invites investigation of an assignable cause; routine variation calls for attention to the underlying process. These limits describe process behavior rather than customer requirements. A stable process can still produce unacceptable outputs, so stability and fitness for use must be assessed separately.

Monitor a consistent class of AI-assisted cases over time, including sampling and error definitions. Investigate a change in the error pattern before assigning blame. Also test whether the ordinary error level is acceptable; statistical stability alone cannot answer that.

Control limits are not customer specifications; stability alone does not make a process good.

Sources and details

Economic Control of Quality of Manufactured Product

{
  "access_scope": "Original-text commercial ebook preview, partial rather than complete book.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "1931 original; inspected modern ebook preview includes the author’s April 1931 preface and chapters I–II opening."
  },
  "id": "shewhart::SH1",
  "title": "Economic Control of Quality of Manufactured Product",
  "url": "https://www.everand.com/book/871590391/Economic-Control-of-Quality-of-Manufactured-Product"
}

NIST/SEMATECH e-Handbook: What are Variables Control Charts?

{
  "access_scope": "Official technical reference; explanatory corroboration, not original Shewhart authorship.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Undated current handbook page, inspected 7 October 2026; distinct from 1931 book."
  },
  "id": "shewhart::SH2",
  "title": "NIST/SEMATECH e-Handbook: What are Variables Control Charts?",
  "url": "https://www.itl.nist.gov/div898/handbook/pmc/section3/pmc32.htm"
}

NIST/SEMATECH e-Handbook Glossary

{
  "access_scope": "Official technical glossary.",
  "dates": {
    "retrieved_at": "2026-10-07",
    "version_note": "Undated current page, inspected 7 October 2026."
  },
  "id": "shewhart::SH3",
  "title": "NIST/SEMATECH e-Handbook Glossary",
  "url": "https://www.itl.nist.gov/div898/handbook/glossary.htm"
}

Original 1931 evidence is limited to the cited ebook-preview passages; the whole book remains uninspected.

Chart mechanics and the specification-limit distinction are separately supported by modern NIST/SEMATECH references.

The AI monitoring example is editorial. Statistical stability is not itself acceptable quality.

Rights: Original paraphrase and references only; no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Retain existing four-sentence depth and AI-case monitoring example.

The NIST distinction establishes why stable output need not meet requirements; source attribution should not imply this page was written by Shewhart.

Original ebook contains transcription noise; no exact quote is relied on.

Dates

{
  "year": 1931
}

Complete 1931 book inspection

Retain existing four-sentence depth and AI-case monitoring example.

The NIST distinction establishes why stable output need not meet requirements; source attribution should not imply this page was written by Shewhart.

Original ebook contains transcription noise; no exact quote is relied on.

The Simple Macroeconomics of AI

Uses task exposure and task-level cost savings to bound near-term macroeconomic effects of AI.

Calibrated, assumption-dependent projection; neither a measured future outcome nor a work by Aghion and Calel.

Sources and details

The Simple Macroeconomics of AI

{
  "access_scope": "Primary institutional indexed abstract and publication metadata; direct open returned HTTP 403.",
  "dates": {
    "date": "2024-05",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 32487; current indexed abstract"
  },
  "id": "work-455ebe846b4f::acemoglu_nber",
  "title": "The Simple Macroeconomics of AI",
  "url": "https://www.nber.org/papers/w32487"
}

The Simple Macroeconomics of AI

{
  "access_scope": "Primary full PDF available; abstract and sections 2.4, 3.2, 3.3, conclusion inspected.",
  "dates": {
    "date": "2024-08-12 (publisher-download date in PDF footer; not a separate publication event)",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted manuscript downloaded from Oxford Academic on 2024-08-12; not the April draft"
  },
  "id": "work-455ebe846b4f::acemoglu_august",
  "title": "The Simple Macroeconomics of AI",
  "url": "https://economics.mit.edu/sites/default/files/2024-08/The%20Simple%20Macroeconomics%20of%20AI.pdf"
}

The simple macroeconomics of AI

{
  "access_scope": "Publisher indexed abstract and metadata; direct open failed.",
  "dates": {
    "date": "2024-08-06",
    "retrieval_date": "2026-10-07",
    "version": "Economic Policy 40(121), January 2025, pp. 13–58; corrected/typeset 2024-09-11"
  },
  "id": "work-455ebe846b4f::acemoglu_oup",
  "title": "The simple macroeconomics of AI",
  "url": "https://academic.oup.com/economicpolicy/article-abstract/40/121/13/7728473"
}

The Simple Macroeconomics of AI

{
  "access_scope": "Primary PDF cover, abstract, and estimate passages inspected for version discrimination only.",
  "dates": {
    "date": "2024-04-05",
    "retrieval_date": "2026-10-07",
    "version": "Earlier author draft"
  },
  "id": "work-455ebe846b4f::acemoglu_april",
  "title": "The Simple Macroeconomics of AI",
  "url": "https://economics.mit.edu/sites/default/files/2024-04/The%20Simple%20Macroeconomics%20of%20AI.pdf"
}

Calibrated, assumption-dependent projection; neither a measured future outcome nor a work by Aghion and Calel. Quantities are cumulative ten-year TFP calibrations, not GDP or annual growth.

Preserved context · claim: A task-based calculation links aggregate gains to the fraction of tasks affected and their cost savings; the paper estimates limited TFP gains under its assumptions.

Preserved context · depth: The aggregate calculation weights improvements by their economic reach. Difficult-to-learn tasks change the assumptions behind the estimate.

Preserved context · example: Build scenarios with explicit task shares and implementation costs; avoid applying one benchmark gain to an entire economy.

Preserved context · limits: The NBER abstract’s 0.66% TFP over ten years and below 0.53% adjustment are conditional estimates, not observed outcomes.

Preserved context · relevance: Large gains on selected tasks need not imply equally large aggregate gains.

Rights: Original paraphrase and references only; no new rights clearance

The estimates are a conditional ten-year calibration, not observed future outcomes or an annual growth rate. They concern TFP, which must not be relabeled GDP.

Do not mix the April draft’s 0.71% with the later 0.66% calibration.

Keep Daron Acemoglu as sole author; supplied Aghion/Calel attribution remains an input error.

Dates

{
  "date_note": "May 2024 NBER working paper; 2025 journal publication.",
  "dated": true,
  "year": 2024
}

The estimates are a conditional ten-year calibration, not observed future outcomes or an annual growth rate. They concern TFP, which must not be relabeled GDP.

Do not mix the April draft’s 0.71% with the later 0.66% calibration.

Keep Daron Acemoglu as sole author; supplied Aghion/Calel attribution remains an input error.

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

Humlum and Vestergaard link surveys in 11 highly AI-exposed Danish occupations to administrative records through December 2024.

Their pooled difference-in-differences estimates find no statistically significant average earnings or recorded-hours effects, with confidence bounds excluding positive effects above 2%, despite self-reported productivity gains.

Workers report new content-generation, oversight and integration tasks; adopters also tend to move to higher-paying occupations, but too few do so to shift average earnings.

Sources and details

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "Primary institutional indexed landing-page abstract and version metadata; direct open failed.",
  "dates": {
    "date": {
      "issue": "2025-05",
      "revision": "2026-03"
    },
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 33777; March 2026 revision displayed at retrieval"
  },
  "id": "work-7053ad31b1fd::still_nber",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.nber.org/papers/w33777"
}

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "Primary full institutional PDF; cover, abstract, introduction, study period, and occupational-mobility discussion inspected.",
  "dates": {
    "date": "2026-03-13",
    "retrieval_date": "2026-10-07",
    "version": "RFBerlin Discussion Paper 078/26, author-dated March 13, 2026"
  },
  "id": "work-7053ad31b1fd::still_march",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.rfberlin.com/wp-content/uploads/2026/03/26078.pdf"
}

Large Language Models, Small Labor Market Effects

{
  "access_scope": "Primary indexed original abstract; used only for version comparison.",
  "dates": {
    "date": "2025-05",
    "retrieval_date": "2026-10-07",
    "version": "Original NBER revision file rev0"
  },
  "id": "work-7053ad31b1fd::still_original",
  "title": "Large Language Models, Small Labor Market Effects",
  "url": "https://www.nber.org/system/files/working_papers/w33777/revisions/w33777.rev0.pdf"
}

Early Danish evidence through December 2024. The 2% statement is an outcome-specific statistical bound, not proof of zero effects or a bound on every AI labor-market effect.

Preserved context · claim: The March 2026 revision links Danish adoption surveys and administrative records: limited early earnings and hours effects coexist with task reorganization.

Preserved context · depth: New oversight and integration work can appear without an immediate aggregate earnings effect. Occupational transitions and worker heterogeneity matter.

Preserved context · example: Track work content and internal mobility alongside headcount and pay.

Preserved context · limits: Results exclude effects larger than 2% on earnings and hours in the studied period; they do not establish no change or no future impact.

Preserved context · relevance: Task change can precede measurable changes in hours or earnings.

Rights: Original paraphrase and references only; no new rights clearance

Results concern the Danish occupations, comparison design, and early period studied; do not infer no labor-market change, no future effect, or universal international effects.

Keep self-reported productivity benefits distinct from administrative earnings/hours outcomes.

The mobility result does not authorize a claim that adopting AI guarantees an individual a raise.

The bare NBER PDF URL was indexed with an October 2025 cover and old title during this research; it is unsuitable evidence for March 2026 wording without checking the actual version.

Dates

{
  "date_note": "First May 2025 under Large Language Models, Small Labor Market Effects; title and description here follow the March 2026 revision.",
  "dated": true,
  "year": 2025
}

Results concern the Danish occupations, comparison design, and early period studied; do not infer no labor-market change, no future effect, or universal international effects.

Keep self-reported productivity benefits distinct from administrative earnings/hours outcomes.

The mobility result does not authorize a claim that adopting AI guarantees an individual a raise.

The bare NBER PDF URL was indexed with an October 2025 cover and old title during this research; it is unsuitable evidence for March 2026 wording without checking the actual version.

Artificial Intelligence and Economic Growth

The authors explore AI as automation of goods and services and of idea production, taking automation as exogenous.

Aggregate long-term growth can be constrained by essential economic tasks that experience slow technological progress, following a Baumol cost disease dynamic.

Under specified assumptions, a substantial labor share can persist even as production approaches complete automation.

Automating idea production can change growth temporarily or permanently, depending on how AI enters innovation and on remaining bottlenecks.

Sources and details

Artificial Intelligence and Economic Growth

{
  "access_scope": "Primary full PDF; cover, abstract and introduction, pp. 2–4 inspected.",
  "dates": {
    "date": "2017-10-10",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted working paper, Version 1.0"
  },
  "id": "work-coverage-c662d5880a9271::aghion_2017",
  "title": "Artificial Intelligence and Economic Growth",
  "url": "https://web.stanford.edu/~chadj/AI.pdf"
}

Artificial Intelligence and Economic Growth

{
  "access_scope": "Primary full chapter PDF; introduction, section 9.2.2, and conclusion inspected.",
  "dates": {
    "date": "2019",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted chapter PDF, The Economics of Artificial Intelligence: An Agenda, chapter 9, pp. 237–282; author copy may include corrections"
  },
  "id": "work-coverage-c662d5880a9271::aghion_chapter",
  "title": "Artificial Intelligence and Economic Growth",
  "url": "https://web.stanford.edu/~chadj/AJJ-AIandGrowth.pdf"
}

Artificial Intelligence and Economic Growth

{
  "access_scope": "Primary institutional indexed abstract and publication metadata; direct open returned HTTP 403.",
  "dates": {
    "date": "2017-10",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 23928"
  },
  "id": "work-coverage-c662d5880a9271::aghion_nber",
  "title": "Artificial Intelligence and Economic Growth",
  "url": "https://www.nber.org/papers/w23928"
}

Artificial Intelligence and Economic Growth

{
  "access_scope": "Primary indexed publication metadata; direct open failed.",
  "dates": {
    "date": "2019-05",
    "retrieval_date": "2026-10-07",
    "version": "NBER chapter publication page"
  },
  "id": "work-coverage-c662d5880a9271::aghion_publication",
  "title": "Artificial Intelligence and Economic Growth",
  "url": "https://www.nber.org/books-and-chapters/economics-artificial-intelligence-agenda/artificial-intelligence-and-economic-growth"
}

Model implications depend on assumptions; they are not observed economy-wide AI effects.

Preserved context · claim: Models AI as automation and examines growth, factor shares, innovation and constraints from hard-to-improve essential tasks.

Preserved context · claim_boundary: Model implications depend on assumptions; they are not observed economy-wide AI effects.

Preserved context · contributors: Philippe Aghion; Benjamin F. Jones; Charles I. Jones

Preserved context · metadata_notes: Supplied 2018 retained in input; NBER records October 2017 working paper and 2019 chapter. Keep Benjamin F. Jones and Charles I. Jones as distinct coauthors.

Preserved context · year: 2017 working paper; 2019 published chapter

Rights: Original paraphrase and references only; no new rights clearance

These are conditional theoretical mechanisms, not observed economy-wide AI effects or a guaranteed singularity forecast.

Keep Benjamin F. Jones and Charles I. Jones as distinct authors.

NBER chapter metadata displays May 2019 and copyright 2019, but its generated citation contains 2018; preserve the record discrepancy rather than using generated citation alone.

Author-hosted chapter includes a correction note in indexed content; do not claim to have performed a line-by-line edition comparison.

Dates

{
  "date_note": "[\"Supplied 2018 retained in input; NBER records October 2017 working paper and 2019 chapter. Keep Benjamin F. Jones and Charles I. Jones as distinct coauthors.\"]",
  "dated": true,
  "year": "2017 working paper; 2019 published chapter"
}

These are conditional theoretical mechanisms, not observed economy-wide AI effects or a guaranteed singularity forecast.

Keep Benjamin F. Jones and Charles I. Jones as distinct authors.

NBER chapter metadata displays May 2019 and copyright 2019, but its generated citation contains 2018; preserve the record discrepancy rather than using generated citation alone.

Author-hosted chapter includes a correction note in indexed content; do not claim to have performed a line-by-line edition comparison.

Human–AI collaborative decision-making as an organization design problem

The framework models collaborative human–AI decision-making as an organization design challenge, presented as a conceptual Point of View article without primary empirical dataset analysis.

Alternative divisions of labor between humans and algorithmic agents vary according to task sequencing and functional specialization.

Collaborative advantage can arise from different strengths or from combining judgments in ways that may reduce aggregate decision error.

Organizational learning configurations depend critically on communication channels and the structure of feedback interdependence between agents.

Sources and details

Human–AI collaborative decision-making as an organization design problem

{
  "access_scope": "Primary open-access full article; abstract, division-of-labor and learning-configuration sections inspected.",
  "dates": {
    "date": "2021-02-16",
    "retrieval_date": "2026-10-07",
    "version": "Version of record, Journal of Organization Design 10, pp. 75–80; issue June 2021"
  },
  "id": "work-final-6ab50da54a39c9::puranam_article",
  "title": "Human–AI collaborative decision-making as an organization design problem",
  "url": "https://link.springer.com/article/10.1007/s41469-021-00095-2"
}

Correction to: Human–AI collaborative decision-making as an organization design problem

{
  "access_scope": "Primary correction text inspected.",
  "dates": {
    "date": "2021-03-25",
    "retrieval_date": "2026-10-07",
    "version": "Open-access licensing correction, volume 10, p. 81"
  },
  "id": "work-final-6ab50da54a39c9::puranam_correction",
  "title": "Correction to: Human–AI collaborative decision-making as an organization design problem",
  "url": "https://link.springer.com/article/10.1007/s41469-021-00097-0"
}

No primary evidence found that Artificial Intelligence and Organizational Design is an exact 2018 work title. Two plausible sources do not establish which was intended; do not silently substitute 2021 for 2018.

Rights: Original paraphrase and references only; no new rights clearance

Retain the existing identity hold: this does not establish that the supplied Artificial Intelligence and Organizational Design (2018) was intended to mean this 2021 paper.

Scope is collaborative decision-making, primarily knowledge work; avoid treating the typology as tested causal evidence.

Original-article metadata gives 16 February 2021; the licensing-correction body refers to 4 February, an inconsistency worth retaining rather than silently resolving.

Dates

{
  "date_note": "Publication date: 2021-02-16. Journal: Journal of Organization Design. Volume: 10. Pages: 75–80.",
  "dated": true,
  "year": 2021
}

Retain the existing identity hold: this does not establish that the supplied Artificial Intelligence and Organizational Design (2018) was intended to mean this 2021 paper.

Scope is collaborative decision-making, primarily knowledge work; avoid treating the typology as tested causal evidence.

Original-article metadata gives 16 February 2021; the licensing-correction body refers to 4 February, an inconsistency worth retaining rather than silently resolving.

Economics in the age of big data

The availability of large-scale administrative and private corporate records expands empirical economic research by providing population-level coverage, high-frequency measurement, and novel experimental settings.

The review distinguishes predictive machine learning from econometric work focused on causal identification, explaining how the approaches can complement each other.

The review highlights privacy, confidentiality and access constraints, alongside the need for stronger data-management and programming capabilities.

Sources and details

Economics in the age of big data

{
  "access_scope": "Primary full PDF; review summary, article introduction, and econometrics/machine-learning section inspected.",
  "dates": {
    "date": "2014-11-07",
    "retrieval_date": "2026-10-07",
    "version": "Science 346(6210), article 1243089; author-hosted published PDF including review summary"
  },
  "id": "work-final-dbfea0d1a68336::einav_science",
  "title": "Economics in the age of big data",
  "url": "https://web.stanford.edu/~leinav/pubs/Science2014.pdf"
}

The Data Economy is not uniquely bound by exact-title/author/year searches. Either work may be intended; neither should be renamed or conflated. This is a 2014 methodological review.

Rights: Original paraphrase and references only; no new rights clearance

Preserve unresolved supplied-title hold for The Data Economy; this research establishes content of Economics in the age of big data only.

This is a 2014 review of research methods and data opportunities, not an empirical estimate of contemporary generative-AI productivity.

Dates

{
  "date_note": "Journal: Science. Volume: 346. Issue: 6210.",
  "dated": true,
  "year": 2014
}

Preserve unresolved supplied-title hold for The Data Economy; this research establishes content of Economics in the age of big data only.

This is a 2014 review of research methods and data opportunities, not an empirical estimate of contemporary generative-AI productivity.

Reasoning and external action

Interleaving reasoning traces with actions lets a language model obtain information and interact with benchmark environments.

Tools return useful observations and the action interface is constrained.

An external observation can change the next step. The useful boundary is between text generation and actions with consequences; these require explicit controls.

An agent is a governed system of model, tools, permissions and feedback.

A research assistant can search and revise an answer; a purchasing agent additionally needs spending limits and review.

Benchmark success does not establish general agency, reliable tool outputs or authority to act.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Exact-version full-text research reused from atlas_next50/ai_papers_evidence.json, work-f630eb04f37b; original retrieval 2026-10-07. Version and complete author list independently rechecked on arXiv v3 metadata in this pass.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "date": "2023-03-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v3 / ICLR 2023 camera-ready; first version 2022-10-06"
  },
  "id": "acting-with-tools::react-v3",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/pdf/2210.03629v3"
}

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Timo Schick",
    "Jane Dwivedi-Yu",
    "Roberto Dessì",
    "Roberta Raileanu",
    "Maria Lomeli",
    "Luke Zettlemoyer",
    "Nicola Cancedda",
    "Thomas Scialom"
  ],
  "dates": {
    "date": "2023-02-09",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "acting-with-tools::toolformer-v1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/html/2302.04761v1"
}

Keep the 2022 ReAct first-public date distinct from inspected v3 in 2023; Toolformer is a separate 2023 training procedure.

The baseline permission, spending-limit and dependable-observation requirements are editorial governance boundaries, not tested safety results.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Keep the 2022 ReAct first-public date distinct from inspected v3 in 2023; Toolformer is a separate 2023 training procedure.

The baseline permission, spending-limit and dependable-observation requirements are editorial governance boundaries, not tested safety results.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2022
}

Keep the 2022 ReAct first-public date distinct from inspected v3 in 2023; Toolformer is a separate 2023 training procedure.

The baseline permission, spending-limit and dependable-observation requirements are editorial governance boundaries, not tested safety results.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Agency costs and ownership

Separating ownership from control creates agency costs that financial structure tries to limit.

Explains incentive conflicts between principals, managers and external capital providers.

Emphasis on shareholder control has been contested.

Sources and details

Theory of the Firm: Managerial Behavior, Agency Costs and Ownership Structure

{
  "access_scope": "Search-index original-text excerpts, not metadata inferred as text.",
  "authors": [
    "Michael C. Jensen",
    "William H. Meckling"
  ],
  "dates": {
    "date": "Original publication October 1976; retrieved reprint date unspecified",
    "retrieval_date": "2026-10-07",
    "version": "1976 article in later author-formatted reprint; cover references 1998 and 2000 collections; exact reprint revision date not verified"
  },
  "id": "agency-costs::agency-costs-primary",
  "title": "Theory of the Firm: Managerial Behavior, Agency Costs and Ownership Structure",
  "url": "https://citeseerx.ist.psu.edu/document?doi=5cc7963a2dcd09e82cd5af98b8ccef1e820f43f8&repid=rep1&type=pdf"
}

The inspected reprint is not certified as text-identical in every detail to the 1976 published version; no equations or proofs audited.

Do not assign origination of all agency theory to these authors.

Baseline shareholder-control criticism is retained as an editorial limitation, not newly empirically evaluated.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The inspected reprint is not certified as text-identical in every detail to the 1976 published version; no equations or proofs audited.

Do not assign origination of all agency theory to these authors.

Baseline shareholder-control criticism is retained as an editorial limitation, not newly empirically evaluated.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1976
}

The inspected reprint is not certified as text-identical in every detail to the 1976 published version; no equations or proofs audited.

Do not assign origination of all agency theory to these authors.

Baseline shareholder-control criticism is retained as an editorial limitation, not newly empirically evaluated.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Quality under asymmetric information

When sellers know more about quality than buyers, adverse selection can undermine exchange.

Quality is difficult to observe before purchase.

Cheap fluent output can increase the importance of credible quality signals.

Certification, guarantees and repeated relationships can change the result.

Sources and details

The Market for “Lemons”: Quality Uncertainty and the Market Mechanism

{
  "access_scope": "Original 1970 article scan inspected in university-hosted PDF, sections II.A–B and IV–V; other applications not comprehensively audited.",
  "authors": [
    "George A. Akerlof"
  ],
  "dates": {
    "date": "August 1970",
    "retrieval_date": "2026-10-07",
    "version": "1970"
  },
  "id": "akerlof::akerlof-original",
  "title": "The Market for “Lemons”: Quality Uncertainty and the Market Mechanism",
  "url": "https://www.sfu.ca/~allen/Ackerlof.pdf"
}

Used cars are an illustrative theoretical model; Akerlof explicitly chose the example for clarity rather than realism.

Do not present market disappearance as the inevitable outcome of all asymmetric information.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Used cars are an illustrative theoretical model; Akerlof explicitly chose the example for clarity rather than realism.

Do not present market disappearance as the inevitable outcome of all asymmetric information.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1970
}

Used cars are an illustrative theoretical model; Akerlof explicitly chose the example for clarity rather than realism.

Do not present market disappearance as the inevitable outcome of all asymmetric information.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

The networked workstation

A personal workstation with graphics and networking anticipated office computing.

Realized networked personal computing through hardware and systems engineering.

Xerox commercialized little of it directly.

Sources and details

Alto: A Personal Computer

{
  "access_scope": "Inspected introduction and processor organization, PDF pp. 1–2 (printed pp. 549–550); selected retrospective context only.",
  "authors": [
    "C. P. Thacker",
    "E. M. McCreight",
    "B. W. Lampson",
    "R. F. Sproull",
    "D. R. Boggs"
  ],
  "dates": {
    "date": "1979 (copyright; host-volume publication not verified)",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Chapter 33 scan, printed pp. 549–572; 24 PDF pages; ©1979 Xerox Corporation. Host-volume edition/date unresolved.",
    "version_note": "Chapter 33 scan, printed pp. 549–572; 24 PDF pages; ©1979 Xerox Corporation. Host-volume edition/date unresolved."
  },
  "id": "alto::alto-author-chapter",
  "title": "Alto: A Personal Computer",
  "url": "https://tcm.computerhistory.org/ComputerTimeline/Chap33_alto_CS2.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The baseline commercialization claim remains preserved but is not newly established here. Complete bibliography of the chapter’s host volume remains open.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The baseline commercialization claim remains preserved but is not newly established here. Complete bibliography of the chapter’s host volume remains open.

Dates

{
  "year": 1973
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

The baseline commercialization claim remains preserved but is not newly established here. Complete bibliography of the chapter’s host volume remains open.

Evidence scope: primary engineering description.

Evidence scope: author reported applications.

Evidence scope: primary design tradeoff.

A programmable engine

A mechanical design separated program from mechanism, and its first published programs anticipated symbolic uses.

Early general-purpose computing architecture.

The engine was never completed; its influence on later computers is indirect.

Sources and details

Notes by the Translator, appended to Sketch of the Analytical Engine invented by Charles Babbage, Esq.

{
  "access_scope": "Inspected Notes A and G and publication header; original typography and all diagrams not exhaustively checked.",
  "authors": [
    "Augusta Ada Byron King, Countess of Lovelace"
  ],
  "dates": {
    "date": "1843",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "English Notes A–G in Scientific Memoirs 3, pp. 666–731 (combined article and notes); York University HTML transcription, not the 1842 French article.",
    "version_note": "English Notes A–G in Scientific Memoirs 3, pp. 666–731 (combined article and notes); York University HTML transcription, not the 1842 French article."
  },
  "id": "analytical-engine::lovelace-notes-1843",
  "title": "Notes by the Translator, appended to Sketch of the Analytical Engine invented by Charles Babbage, Esq.",
  "url": "https://www.yorku.ca/pclassic/Lovelace/lovelace.htm"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The uncompleted-engine and indirect-influence baseline limits are retained. No first-programmer or sole-inventor claim is proposed.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The uncompleted-engine and indirect-influence baseline limits are retained. No first-programmer or sole-inventor claim is proposed.

Dates

{
  "year": 1843
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

The uncompleted-engine and indirect-influence baseline limits are retained. No first-programmer or sole-inventor claim is proposed.

Evidence scope: primary design exposition.

Evidence scope: primary worked design example.

Evidence scope: primary proposal not demonstration.

Evidence scope: primary stated limit.

Ancillary Justice

A starship AI once spread across many bodies is reduced to one.

Explores distributed identity, embodiment and power through fiction.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Ancillary Justice

{
  "access_scope": "Publisher synopsis and exact ebook publication record; not the whole novel.",
  "dates": {
    "date": "2013-10-01",
    "retrieved_at": "2026-10-07",
    "version_note": "Orbit ebook ISBN 9780316246637, on sale 1 October 2013."
  },
  "id": "ancillary::ANC",
  "title": "Ancillary Justice",
  "url": "https://www.hachettebookgroup.com/titles/ann-leckie/ancillary-justice/9780316246637/"
}

This family candidate uses only the clean publisher synopsis; no original excerpt or whole-novel inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This family candidate uses only the clean publisher synopsis; no original excerpt or whole-novel inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2013
}

This family candidate uses only the clean publisher synopsis; no original excerpt or whole-novel inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Corporate strategy and weak signals

Firms choose product-market directions and can prepare for surprise by acting on weak signals.

Contributes explicit planning, growth choices and anticipation of environmental change.

Weak signals are hard to distinguish from noise.

Sources and details

Strategies for Diversification

{
  "access_scope": "Original article body reproduced on an unofficial document host, printed pp. 113–115, inspected; platform AI-generated title/description excluded. Year cross-checked against the bibliographic record; no source-image or rights clearance.",
  "authors": [
    "H. Igor Ansoff"
  ],
  "dates": {
    "date": "1957",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Harvard Business Review article; reproduced OCR of article body, printed pp. 113–124; not the 1965 Corporate Strategy book",
    "version_note": "Harvard Business Review article; reproduced OCR of article body, printed pp. 113–124; not the 1965 Corporate Strategy book"
  },
  "id": "ansoff::ansoff57-original",
  "title": "Strategies for Diversification",
  "url": "https://www.scribd.com/document/346198384/Ansoff-1957-Strategies-for-Diversification"
}

Managing Strategic Surprise by Response to Weak Signals

{
  "access_scope": "Original article scan on a third-party site; PDF pp. 1, 3, 8, 13 (printed pp. 21, 23, 28, 33) inspected for framework and cautions; publisher metadata confirms identity.",
  "authors": [
    "H. Igor Ansoff"
  ],
  "dates": {
    "date": "December 1975",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "California Management Review 18(2), 21–33; published article scan",
    "version_note": "California Management Review 18(2), 21–33; published article scan"
  },
  "id": "ansoff::ansoff75-original",
  "title": "Managing Strategic Surprise by Response to Weak Signals",
  "url": "https://www.creaciondeestrategia.com/wp-content/uploads/2022/02/Ansoff_1975.pdf"
}

Managing Strategic Surprise by Response to Weak Signals

{
  "access_scope": "Publisher indexed metadata and references inspected, not paywalled body; sole byline, issue date and pagination verified. Berkeley abstract displays 1 February 1975, a conflicting landing-page date retained as unresolved.",
  "authors": [
    "H. Igor Ansoff"
  ],
  "dates": {
    "date": "December 1975",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "California Management Review 18(2), 21–33; DOI 10.2307/41164635",
    "version_note": "California Management Review 18(2), 21–33; DOI 10.2307/41164635"
  },
  "id": "ansoff::ansoff75-publisher",
  "title": "Managing Strategic Surprise by Response to Weak Signals",
  "url": "https://journals.sagepub.com/doi/10.2307/41164635"
}

The 1957 article is a distinct supplemental work, not evidence that the 1965 book body was read.

Preserve the inherited weak-signal/noise caution; the inspected passages add a procedure and do not negate it.

No empirical estimate of improved forecasting, avoided losses, or universal effectiveness is proposed.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1957 article is a distinct supplemental work, not evidence that the 1965 book body was read.

Preserve the inherited weak-signal/noise caution; the inspected passages add a procedure and do not negate it.

No empirical estimate of improved forecasting, avoided losses, or universal effectiveness is proposed.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1965
}

The 1957 article is a distinct supplemental work, not evidence that the 1965 book body was read.

Preserve the inherited weak-signal/noise caution; the inspected passages add a procedure and do not negate it.

No empirical estimate of improved forecasting, avoided losses, or universal effectiveness is proposed.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-article conceptual taxonomy

original-article conceptual rationale

original-article proposed management procedure

original-article proposed rationale and explicit implementation caution

Reliable flight software

Software engineered for priority scheduling and error recovery kept critical functions running.

Safety-critical software engineering and human–computer coordination.

A specialized, heavily tested system, not a general method.

Sources and details

A Preventative Paradigm for Systems and Software

{
  "access_scope": "Inspected Apollo section, PDF pp. 2–4 (printed pp. 26–28). Later participant account, not original mission log or software manual.",
  "authors": [
    "Margaret H. Hamilton"
  ],
  "dates": {
    "date": "2018-10-18",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Acceptance speech at Universitat Politècnica de Catalunya, seven-page excerpt, printed pp. 25–31.",
    "version_note": "Acceptance speech at Universitat Politècnica de Catalunya, seven-page excerpt, printed pp. 25–31."
  },
  "id": "apollo-software::hamilton-speech-2018",
  "title": "A Preventative Paradigm for Systems and Software",
  "url": "https://www.upc.edu/en/press-room/pdfs/acceptance-speech-by-margaret-h-hamilton.pdf/@@download/file/Acceptance-speech-by-Margaret-H-Hamilton.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

No sole authorship of Apollo software or particular recovery routine is asserted. The 2018 speech is not rebound to the original 1969 software identity. Specific radar-switch causation in the speech is not adopted.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

No sole authorship of Apollo software or particular recovery routine is asserted. The 2018 speech is not rebound to the original 1969 software identity. Specific radar-switch causation in the speech is not adopted.

Dates

{
  "year": 1969
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

No sole authorship of Apollo software or particular recovery routine is asserted. The 2018 speech is not rebound to the original 1969 software identity. Specific radar-switch causation in the speech is not adopted.

Evidence scope: participant retrospective engineering.

Evidence scope: participant retrospective event report.

Evidence scope: participant retrospective collaboration.

Architectural innovation

Changing how components link can defeat incumbents whose knowledge is organized around the old architecture.

Connects product architecture, embedded organizational knowledge and adaptation failures.

Classifying an innovation as architectural is often only clear afterwards.

Sources and details

Architectural Innovation: The Reconfiguration of Existing Product Technologies and the Failure of Established Firms

{
  "access_scope": "Original article abstract on author-upload page inspected; full study and proofs not inspected. Harvard institutional record corroborates title, authors and March 1990 date.",
  "authors": [
    "Rebecca M. Henderson",
    "Kim B. Clark"
  ],
  "dates": {
    "date": "March 1990",
    "retrieval_date": "2026-10-07",
    "version": "1990"
  },
  "id": "architectural-innovation::architectural-innovation-abstract",
  "title": "Architectural Innovation: The Reconfiguration of Existing Product Technologies and the Failure of Established Firms",
  "url": "https://www.researchgate.net/publication/200465578_Architectural_Innovation_The_Reconfiguration_of_Existing_Product_Technologies_and_the_Failure_of_Established_Firms"
}

No later ResearchGate affiliation is imported as a 1990 author affiliation.

Original Harvard full-text retrieval failure remains; current linked download presents a login page.

The photolithographic example is not an industry-independent empirical law.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

No later ResearchGate affiliation is imported as a 1990 author affiliation.

Original Harvard full-text retrieval failure remains; current linked download presents a login page.

The photolithographic example is not an industry-independent empirical law.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1990
}

No later ResearchGate affiliation is imported as a 1990 author affiliation.

Original Harvard full-text retrieval failure remains; current linked download presents a login page.

The photolithographic example is not an industry-independent empirical law.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Low-power processors

A small team designed a simple, power-efficient processor architecture now used in most mobile devices.

Energy-efficient processor architecture underpins mobile and embedded computation.

Later success depended on a licensing business model.

Sources and details

ARM System-on-Chip Architecture

{
  "access_scope": "Inspected title/preface and chapter 2, PDF pp. 48–51 (printed pp. 36–39); not an original 1985 manual.",
  "authors": [
    "Steve Furber"
  ],
  "dates": {
    "date": "2000",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Second edition, Addison-Wesley; chapter 2 inspected in a university-hosted PDF.",
    "version_note": "Second edition, Addison-Wesley; chapter 2 inspected in a university-hosted PDF."
  },
  "id": "arm::furber-arm-2000",
  "title": "ARM System-on-Chip Architecture",
  "url": "https://eclass.hmu.gr/modules/document/file.php/TP233/%CE%92%CE%B9%CE%B2%CE%BB%CE%B9%CE%BF%CE%B3%CF%81%CE%B1%CF%86%CE%AF%CE%B1/Addison%20Wesley%20-%20Arm%20System-On-Chip%20Architecture%2C%202nd%20Edition.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Current mobile market share and later licensing success are inherited context, not newly verified current claims. No full team-credit list is inferred from a single-author book.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Current mobile market share and later licensing success are inherited context, not newly verified current claims. No full team-credit list is inferred from a single-author book.

Dates

{
  "year": 1985
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Current mobile market share and later licensing success are inherited context, not newly verified current claims. No full team-credit list is inferred from a single-author book.

Evidence scope: designer retrospective.

Evidence scope: primary technical exposition.

Evidence scope: designer design tradeoff.

Evidence scope: designer explanation not new benchmark.

Requisite variety

A regulator must have at least as much variety as the disturbances it controls.

Foundational account of adaptation and regulation.

A principle for control; it does not specify a learning method.

Sources and details

An Introduction to Cybernetics

{
  "access_scope": "Inspected front matter and §§11/4–11/10; PDF pp. 108–111 correspond to printed pp. 202–209.",
  "authors": [
    "W. Ross Ashby"
  ],
  "dates": {
    "date": "1957",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Second impression (first published 1956), Chapman & Hall; 1999 electronic edition prepared for Principia Cybernetica, hosted by Ashby archive; two printed pages per PDF page.",
    "version_note": "Second impression (first published 1956), Chapman & Hall; 1999 electronic edition prepared for Principia Cybernetica, hosted by Ashby archive; two printed pages per PDF page."
  },
  "id": "ashby::ashby-cybernetics-1957",
  "title": "An Introduction to Cybernetics",
  "url": "https://ashby.info/Ashby-Introduction-to-Cybernetics.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This 1956/1957 monograph is not Design for a Brain or the 1948 Homeostat. The baseline learning-method limitation is preserved.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This 1956/1957 monograph is not Design for a Brain or the 1948 Homeostat. The baseline learning-method limitation is preserved.

Dates

{
  "year": 1948
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

This 1956/1957 monograph is not Design for a Brain or the 1948 Homeostat. The baseline learning-method limitation is preserved.

Evidence scope: primary formal model.

Evidence scope: primary conditional theorem.

Evidence scope: primary theorem interpretation.

Evidence scope: primary assumption boundary.

Astro Boy

A robot boy navigates relationships and rights between robots and people.

Major Japanese imaginative tradition of robots as social and moral subjects.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Mighty Atom / Astro Boy

{
  "access_scope": "Official rights-holder story synopsis, character descriptions and serialization record; no full manga-series inspection.",
  "dates": {
    "date": "1952–1968 manga; current synopsis undated",
    "retrieved_at": "2026-10-07",
    "version_note": "Manga serialized April 1952–March 1968; prior Ambassador Atom appearance in 1951 and television adaptation in 1963 are distinct."
  },
  "id": "astro-boy::AST",
  "title": "Mighty Atom / Astro Boy",
  "url": "https://tezukaosamu.net/en/manga/291.html"
}

Official synopsis supports this bounded account; no claim to have inspected the whole 1952–1968 manga or its adaptations.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Official synopsis supports this bounded account; no claim to have inspected the whole 1952–1968 manga or its adaptations.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1952
}

Official synopsis supports this bounded account; no claim to have inspected the whole 1952–1968 manga or its adaptations.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Repeated games and cooperation

Long-run interaction can sustain cooperation that one-shot incentives would not.

Explains how recurring relationships sustain cooperative behavior.

Depends on patience and observability.

Sources and details

War and peace

{
  "access_scope": "Author retrospective/perspective in its 2006 journal manifestation; repeated-game example, patience caveat and perfect-equilibrium discussion inspected in full HTML. Not the 1959 paper.",
  "authors": [
    "Robert J. Aumann"
  ],
  "dates": {
    "date": "2006-11-14 issue; 2006-11-08 online per PMC/PubMed",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "PNAS 103(46), 17075–17078; DOI 10.1073/pnas.0608329103; adapted Nobel lecture delivered 2005-12-08",
    "version_note": "PNAS 103(46), 17075–17078; DOI 10.1073/pnas.0608329103; adapted Nobel lecture delivered 2005-12-08"
  },
  "id": "aumann::aumann06-retrospective",
  "title": "War and peace",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC1859891/"
}

Acceptable Points in General Cooperative n-Person Games

{
  "access_scope": "Original-paper reprint, introduction and original-publication footnote only; PDF p. 1 (reprint printed p. 321) inspected. Do not transfer the later lecture’s complete folk-theorem account to this 1959 text.",
  "authors": [
    "Robert J. Aumann"
  ],
  "dates": {
    "date": "1959 original; author-hosted collected-paper reprint date not printed in the inspected first page",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Originally Contributions to the Theory of Games IV, Annals of Mathematics Studies 40, pp. 287–324; inspected reprint starts at printed p. 321",
    "version_note": "Originally Contributions to the Theory of Games IV, Annals of Mathematics Studies 40, pp. 287–324; inspected reprint starts at printed p. 321"
  },
  "id": "aumann::aumann59-reprint",
  "title": "Acceptable Points in General Cooperative n-Person Games",
  "url": "https://ma.huji.ac.il/raumann/pdf/Acceptable%20Points%20in%20General.pdf"
}

This is achievable cooperation under stated strategic conditions, not a claim that all repeated relationships cooperate.

The 1959 original remains only partially inspected and differs from the later retrospective in scope; its explicit cooperative-game assumptions must not be erased.

The lecture’s war and peace analogies are not empirical causal evidence and are not adopted as policy advice.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is achievable cooperation under stated strategic conditions, not a claim that all repeated relationships cooperate.

The 1959 original remains only partially inspected and differs from the later retrospective in scope; its explicit cooperative-game assumptions must not be erased.

The lecture’s war and peace analogies are not empirical causal evidence and are not adopted as policy advice.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1959
}

This is achievable cooperation under stated strategic conditions, not a claim that all repeated relationships cooperate.

The 1959 original remains only partially inspected and differs from the later retrospective in scope; its explicit cooperative-game assumptions must not be erased.

The lecture’s war and peace analogies are not empirical causal evidence and are not adopted as policy advice.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

author-retrospective theoretical explanation

author-retrospective assumption plus transparent implication of history-contingent punishment

author-retrospective refinement explanation

Cooperation and executive work

Organizations are cooperative systems that require communication, willingness and purpose.

Bridges formal structure with cooperation, purpose and the human side of organization.

Based on executive experience rather than systematic data.

Sources and details

The Functions of the Executive: Thirtieth Anniversary Edition

{
  "access_scope": "Licensed-platform original-text preview, Part I Chapter I and opening of Chapter II inspected. Platform labels this manifestation 1971; it is not an inspected 1938 first-edition scan.",
  "authors": [
    "Chester I. Barnard"
  ],
  "dates": {
    "date": "1971 platform manifestation; 1968 thirtieth-anniversary edition; original December 1938",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Harvard University Press ePub; print ISBN 9780674328037; eBook ISBN 9780674252240",
    "version_note": "Harvard University Press ePub; print ISBN 9780674328037; eBook ISBN 9780674252240"
  },
  "id": "barnard::barnard-preview1971",
  "title": "The Functions of the Executive: Thirtieth Anniversary Edition",
  "url": "https://www.perlego.com/book/2039368/the-functions-of-the-executive-thirtieth-anniversary-edition-pdf"
}

The functions of the executive

{
  "access_scope": "Institutional edition catalogue inspected: author, 1968 anniversary edition and Kenneth R. Andrews introduction; no mechanism content.",
  "authors": [
    "Chester I. Barnard"
  ],
  "dates": {
    "date": "1968; catalogue states first published December 1938",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Thirtieth anniversary edition, Harvard University Press",
    "version_note": "Thirtieth anniversary edition, Harvard University Press"
  },
  "id": "barnard::barnard-edition-catalogue",
  "title": "The functions of the executive",
  "url": "https://cir.nii.ac.jp/crid/1970304959874260380"
}

Communication, willingness and purpose remain in the original record claim unchanged; the present preview does not newly audit the Chapter VII triad.

The author’s conceptual and experiential account is not a controlled empirical estimate.

The first-edition Internet Archive item is access-restricted; its metadata is not full-text evidence.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Communication, willingness and purpose remain in the original record claim unchanged; the present preview does not newly audit the Chapter VII triad.

The author’s conceptual and experiential account is not a controlled empirical estimate.

The first-edition Internet Archive item is access-restricted; its metadata is not full-text evidence.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1938
}

Communication, willingness and purpose remain in the baseline claim unchanged; the present preview does not newly audit the Chapter VII triad.

The author’s conceptual and experiential account is not a controlled empirical estimate.

The first-edition Internet Archive item is access-restricted; its metadata is not full-text evidence.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-text conceptual definition

original-text conceptual mechanism

original-text scope and institutional examples

original-text theoretical program

Normalizing activations

Normalizing layer inputs during training made deep networks faster and easier to train.

Improved deep-network optimization through normalized activations.

Its original explanation was later disputed; the practical effect held.

Sources and details

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Sergey Ioffe",
    "Christian Szegedy"
  ],
  "dates": {
    "date": "2015-02-11",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "batch-norm::bn-v1",
  "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift",
  "url": "https://arxiv.org/pdf/1502.03167v1"
}

How Does Batch Normalization Help Optimization?

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Shibani Santurkar",
    "Dimitris Tsipras",
    "Andrew Ilyas",
    "Aleksander Madry"
  ],
  "dates": {
    "date": "2019-04-15",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v5; NeurIPS 2018 paper, first arXiv 2018-05-29"
  },
  "id": "batch-norm::bn-analysis-v5",
  "title": "How Does Batch Normalization Help Optimization?",
  "url": "https://arxiv.org/pdf/1805.11604v5"
}

The fourteen-fold result concerns training steps in this experiment, not a universal wall-clock speedup.

The later analysis is not part of the 2015 work; preserve equal-contribution marks for Santurkar, Tsipras and Ilyas.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The fourteen-fold result concerns training steps in this experiment, not a universal wall-clock speedup.

The later analysis is not part of the 2015 work; preserve equal-contribution marks for Santurkar, Tsipras and Ilyas.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2015
}

The fourteen-fold result concerns training steps in this experiment, not a universal wall-clock speedup.

The later analysis is not part of the 2015 work; preserve equal-contribution marks for Santurkar, Tsipras and Ilyas.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Second-order cybernetics

Observers were included in the systems they describe, extending cybernetics to self-reference.

Brings the observing system into theories of cognition.

A philosophical extension with limited engineering uptake.

Sources and details

Cybernetics of Cybernetics

{
  "access_scope": "Inspected four-page transcription, especially PDF pp. 1–3. Separate from the 1974 course collection bearing a similar title.",
  "authors": [
    "Heinz von Foerster"
  ],
  "dates": {
    "date": "1979",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "In Klaus Krippendorff (ed.), Communication and Control in Society, Gordon and Breach, pp. 5–8; CEPA four-page transcription.",
    "version_note": "In Klaus Krippendorff (ed.), Communication and Control in Society, Gordon and Breach, pp. 5–8; CEPA four-page transcription."
  },
  "id": "bcl::foerster-cybernetics-1979",
  "title": "Cybernetics of Cybernetics",
  "url": "https://cepa.info/fulltexts/1707.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This paper supports a conceptual account, not measured engineering uptake. The BCL institutional history and 1974 collection’s complete contributor list remain separate.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This paper supports a conceptual account, not measured engineering uptake. The BCL institutional history and 1974 collection’s complete contributor list remain separate.

Dates

{
  "year": 1958
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

This paper supports a conceptual account, not measured engineering uptake. The BCL institutional history and 1974 collection’s complete contributor list remain separate.

Evidence scope: primary theoretical position.

Evidence scope: primary definition.

Evidence scope: primary normative argument.

Limited rationality in economics

Limited rationality, fairness and self-control problems shape economic choices systematically.

Explains systematic gaps between economic optimization and actual decisions.

Effects vary in size and replicability.

Sources and details

Toward a Positive Theory of Consumer Choice

{
  "access_scope": "Original 1980 article scan inspected, abstract and sections 3, 4 and 7; historical theoretical proposals, not a current replication review.",
  "authors": [
    "Richard H. Thaler"
  ],
  "dates": {
    "date": "March 1980",
    "retrieval_date": "2026-10-07",
    "version": "1980"
  },
  "id": "behavioral-econ::behavioral-econ-thaler1980",
  "title": "Toward a Positive Theory of Consumer Choice",
  "url": "https://bear.warrington.ufl.edu/brenner/mar7588/Papers/thaler-jebo1980.pdf"
}

Fairness and mental accounting are retained as broader baseline contribution areas, not all claimed as results of this 1980 article.

The paper itself calls the endowment and sunk-cost accounts hypotheses and notes limited or inconclusive tests.

Keep 1980 original work, 2017 prize announcement and retrieval date separate.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Fairness and mental accounting are retained as broader baseline contribution areas, not all claimed as results of this 1980 article.

The paper itself calls the endowment and sunk-cost accounts hypotheses and notes limited or inconclusive tests.

Keep 1980 original work, 2017 prize announcement and retrieval date separate.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1980
}

Fairness and mental accounting are retained as broader baseline contribution areas, not all claimed as results of this 1980 article.

The paper itself calls the endowment and sunk-cost accounts hypotheses and notes limited or inconclusive tests.

Keep 1980 original work, 2017 prize announcement and retrieval date separate.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

A behavioral theory of the firm

Firms set aspiration levels, search locally and resolve conflict sequentially rather than optimizing.

Provides a behavioral basis for organizational goals, decisions and adaptive behavior.

Descriptive; prediction requires detailed organizational data.

Sources and details

A Behavioral Theory of the Firm

{
  "access_scope": "Licensed-platform preview of Barakaldo Books 2020 e-book, introduction and opening of chapter 2 inspected; not the complete 1963 book.",
  "authors": [
    "Richard M. Cyert",
    "James G. March"
  ],
  "dates": {
    "date": "2020-05-08 (ISBN match on Everand release record)",
    "retrieval_date": "2026-10-07",
    "version": "2020 Barakaldo Books e-book reissue of 1963 work"
  },
  "id": "behavioral-firm::behavioral-firm-preview2020",
  "title": "A Behavioral Theory of the Firm",
  "url": "https://www.perlego.com/book/3019696/a-behavioral-theory-of-the-firm-pdf"
}

Original candidate is Herbert Simon’s Nobel lecture, not the Cyert–March book; retain it as context only.

No claim of reading the full 1963 book or chapter 6.

Complete separately stated contributor roles remain pending; catalog evidence mentions contributions by G. P. E. Clarkson and others, which must not be silently converted into joint authorship.

Do not replace the stronger baseline aspiration/search mechanism with these introductory sentences; use them as additive process grounding.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Original candidate is Herbert Simon’s Nobel lecture, not the Cyert–March book; retain it as context only.

No claim of reading the full 1963 book or chapter 6.

Complete separately stated contributor roles remain pending; catalog evidence mentions contributions by G. P. E. Clarkson and others, which must not be silently converted into joint authorship.

Do not replace the stronger baseline aspiration/search mechanism with these introductory sentences; use them as additive process grounding.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1963
}

Original candidate is Herbert Simon’s Nobel lecture, not the Cyert–March book; retain it as context only.

No claim of reading the full 1963 book or chapter 6.

Complete separately stated contributor roles remain pending; catalog evidence mentions contributions by G. P. E. Clarkson and others, which must not be silently converted into joint authorship.

Do not replace the stronger baseline aspiration/search mechanism with these introductory sentences; use them as additive process grounding.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Inside the black box of technology

Technological change has internal dynamics, such as learning by using, that economics must open up.

Connects technological learning, industry context and economic development.

Historical and qualitative; generalization is difficult.

Sources and details

Inside the Black Box: Technology and Economics, Chapter 6 “Learning by using”

{
  "access_scope": "Original book-text OCR on an unofficial host: title/copyright/contents, preface opening, chapter 6 printed pp. 122–125 and 135–136 inspected. Excludes platform AI-enhanced title. No claim to inspect the entire book or to clear reproduction rights.",
  "authors": [
    "Nathan Rosenberg"
  ],
  "dates": {
    "date": "1982 first publication; inspected scan states transferred to digital printing 2004",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Cambridge University Press paperback ISBN 0 521 27367 6; chapter pp. 120–140; reproduced 2004 digital-printing manifestation",
    "version_note": "Cambridge University Press paperback ISBN 0 521 27367 6; chapter pp. 120–140; reproduced 2004 digital-printing manifestation"
  },
  "id": "black-box::rosenberg-learning-original",
  "title": "Inside the Black Box: Technology and Economics, Chapter 6 “Learning by using”",
  "url": "https://www.scribd.com/document/405487169/Inside-The-Black-Box-Nathan-Rosenberg-pdf"
}

Learning by using

{
  "access_scope": "Publisher chapter summary and metadata directly inspected. This 1983-labelled manifestation is distinct from the scan’s 1982-first-publication/2004-digital-printing statement.",
  "authors": [
    "Nathan Rosenberg"
  ],
  "dates": {
    "date": "Print manifestation 1983; online 2010-01-08",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Inside the Black Box, chapter 6, pp. 120–140; DOI 10.1017/CBO9780511611940.007",
    "version_note": "Inside the Black Box, chapter 6, pp. 120–140; DOI 10.1017/CBO9780511611940.007"
  },
  "id": "black-box::rosenberg-learning-publisher",
  "title": "Learning by using",
  "url": "https://www.cambridge.org/core/books/abs/inside-the-black-box/learning-by-using/DD83066A41F317E3875AA41C28163F47"
}

Preserve the inherited historical/qualitative generalization limit.

The 1994 Exploring the Black Box is a different book and is not used to clear this chapter.

Book-level sole authorship must not erase the individually credited coauthors of chapters 8–10.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve the inherited historical/qualitative generalization limit.

The 1994 Exploring the Black Box is a different book and is not used to clear this chapter.

Book-level sole authorship must not erase the individually credited coauthors of chapters 8–10.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1982
}

Preserve the inherited historical/qualitative generalization limit.

The 1994 Exploring the Black Box is a different book and is not used to clear this chapter.

Book-level sole authorship must not erase the individually credited coauthors of chapters 8–10.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-chapter conceptual distinction

original-chapter learning mechanisms

original-chapter historical illustration; not a new causal estimate

original-chapter bounded generalization caution

Logic as algebra

Logical reasoning can be expressed as algebraic operations on symbols.

Formal predecessor of digital and symbolic reasoning.

Algebraic logic is a formalism; mechanized reasoning required later work.

Sources and details

An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities

{
  "access_scope": "Inspected title, chapter II class-symbol rules, chapter III §14 Proposition III, and chapter V duality; not all chapters.",
  "authors": [
    "George Boole"
  ],
  "dates": {
    "date": "1854",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Project Gutenberg eBook 15114, PDF transcription headed release July 19, 2017; underlying 1854 work.",
    "version_note": "Project Gutenberg eBook 15114, PDF transcription headed release July 19, 2017; underlying 1854 work."
  },
  "id": "boole::boole-laws-gutenberg",
  "title": "An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities",
  "url": "https://www.gutenberg.org/files/15114/15114-pdf.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This symbolic calculus is not itself an electronic-circuit demonstration. The relation to later Boolean algebra and hardware remains a separate historical question.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This symbolic calculus is not itself an electronic-circuit demonstration. The relation to later Boolean algebra and hardware remains a separate historical question.

Dates

{
  "year": 1854
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

This symbolic calculus is not itself an electronic-circuit demonstration. The relation to later Boolean algebra and hardware remains a separate historical question.

Evidence scope: primary formal definition.

Evidence scope: primary worked example.

Evidence scope: primary formal rule.

Selective attention

Limited capacity forces a filter that selects which information is processed.

Explains cognition under limited processing capacity.

A psychological model; machine attention mechanisms are mathematically different.

Sources and details

The Role of Auditory Localization in Attention and Memory Span

{
  "access_scope": "Inspected experiments I–II, results and discussion, PDF pp. 1–6 (printed pp. 191–196). Does not establish inspection of the 1958 book.",
  "authors": [
    "D. E. Broadbent"
  ],
  "dates": {
    "date": "1954-03",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of Experimental Psychology 47(3), pp. 191–196; six-page retyped primary article supplied by Psychology Software Tools.",
    "version_note": "Journal of Experimental Psychology 47(3), pp. 191–196; six-page retyped primary article supplied by Psychology Software Tools."
  },
  "id": "broadbent::broadbent-localization-1954",
  "title": "The Role of Auditory Localization in Attention and Memory Span",
  "url": "https://support.pstnet.com/hc/en-us/article_attachments/360076017933"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The 1958 book/1966 reprint could not be retrieved (MPG PDF returned 403); do not claim original book inspection or bind this 1954 article to its ID. The inherited filter-model description is not removed or weakened. This draft supports an experimental precursor, with no machine-attention equivalence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The 1958 book/1966 reprint could not be retrieved (MPG PDF returned 403); do not claim original book inspection or bind this 1954 article to its ID. The inherited filter-model description is not removed or weakened. This draft supports an experimental precursor, with no machine-attention equivalence.

Dates

{
  "year": 1958
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

The 1958 book/1966 reprint could not be retrieved (MPG PDF returned 403); do not claim original book inspection or bind this 1954 article to its ID. The inherited filter-model description is not removed or weakened. This draft supports an experimental precursor, with no machine-attention equivalence.

Evidence scope: primary experimental result.

Evidence scope: primary experimental design.

Evidence scope: author interpretation of experiment.

Strategy and structure

Historical studies connect expansion and diversification with changes in administrative structure.

New strategies place demands on coordination and control.

AI-enabled expansion can require new decision rights rather than merely fewer reporting layers.

Historical cases do not establish one universal organization design.

Sources and details

Strategy and Structure: Chapters in the History of the American Industrial Enterprise

{
  "access_scope": "MIT Press synopsis and edition metadata only; no claim that the full book or all seventy cases were read.",
  "authors": [
    "Alfred D. Chandler Jr."
  ],
  "dates": {
    "date": "Hardcover 1962-03-15; paperback 1969-08-15; reprint introduction 1990",
    "retrieval_date": "2026-10-07",
    "version": "1962 hardcover; 1969 paperback; synopsis describes 1990 reprint introduction"
  },
  "id": "chandler::chandler-publisher",
  "title": "Strategy and Structure: Chapters in the History of the American Industrial Enterprise",
  "url": "https://mitpress.mit.edu/9780262530095/strategy-and-structure/"
}

Strategy and Structure: Chapters in the History of the American Industrial Enterprise

{
  "access_scope": "Google Books indexed original-text passages at pages 13 and 134 plus contents; snippets only, not full chapters.",
  "authors": [
    "Alfred D. Chandler Jr."
  ],
  "dates": {
    "date": "1969 catalog publication; synopsis separately describes a 1990 reprint",
    "retrieval_date": "2026-10-07",
    "version": "MIT Press paperback/reprint catalog record, ISBN 9780262530095; exact digitized printing not established"
  },
  "id": "chandler::chandler-book-snippets",
  "title": "Strategy and Structure: Chapters in the History of the American Industrial Enterprise",
  "url": "https://books.google.com/books/about/Strategy_and_Structure.html?id=xvz4WOOYzmAC"
}

Book-wide historical cases are not fully audited; sentence 4 is limited to the indexed original passage.

Do not collapse original 1962 publication, 1969 paperback and the 1990 introduction into one date.

Do not infer that structure always follows strategy or that the four companies form a controlled causal experiment.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Book-wide historical cases are not fully audited; sentence 4 is limited to the indexed original passage.

Do not collapse original 1962 publication, 1969 paperback and the 1990 introduction into one date.

Do not infer that structure always follows strategy or that the four companies form a controlled causal experiment.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1962
}

Book-wide historical cases are not fully audited; sentence 4 is limited to the indexed original passage.

Do not collapse original 1962 publication, 1969 paperback and the 1990 introduction into one date.

Do not infer that structure always follows strategy or that the four companies form a controlled causal experiment.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Incumbent allocation and disruption

Resource allocation toward established customers can leave successful firms vulnerable to disruptive trajectories.

New trajectories initially appeal to different customers or performance requirements.

Ask which customers and incentives prevent an incumbent from pursuing an AI-enabled offering.

Not every breakthrough or fast-growing entrant is disruptive in this specific sense.

Sources and details

The Innovator’s Dilemma: When New Technologies Cause Great Firms to Fail

{
  "access_scope": "2013 HBR Press edition, chapter 5 opening preview only; not a full-book inspection or proof that later phrasing is identical to 1997.",
  "authors": [
    "Clayton M. Christensen"
  ],
  "dates": {
    "date": "November 2013",
    "retrieval_date": "2026-10-07",
    "version": "November 2013 HBR Press e-book edition"
  },
  "id": "christensen::christensen-preview2013",
  "title": "The Innovator’s Dilemma: When New Technologies Cause Great Firms to Fail",
  "url": "https://www.oreilly.com/library/view/the-innovators-dilemma/9781422197585/Text/InnovatorsSolu_chap-5.html"
}

Disruptive Innovation Theory

{
  "access_scope": "Current institutional theory exposition, Definition and Disruptive vs. Sustaining Innovations sections; neither 1997 book text nor a primary empirical study.",
  "authors": [
    "Clayton Christensen Institute (institutional exposition; no personal byline stated)"
  ],
  "dates": {
    "date": "Undated; do not use page footer or news dates as publication date",
    "retrieval_date": "2026-10-07",
    "version": "Undated live institutional explainer, retrieved 2026-10-07"
  },
  "id": "christensen::christensen-institute-theory",
  "title": "Disruptive Innovation Theory",
  "url": "https://www.christenseninstitute.org/theory/disruptive-innovation/"
}

No claim that every successful entrant displaces incumbents; current exposition is attributed as such.

The baseline 1997 Institute book page is a synopsis, not the original book body.

Joseph L. Bower’s coauthorship of the distinct 1995 article must not be merged into sole-authored book credit or erased if that article is later added.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

No claim that every successful entrant displaces incumbents; current exposition is attributed as such.

The baseline 1997 Institute book page is a synopsis, not the original book body.

Joseph L. Bower’s coauthorship of the distinct 1995 article must not be merged into sole-authored book credit or erased if that article is later added.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1997
}

No claim that every successful entrant displaces incumbents; current exposition is attributed as such.

The baseline 1997 Institute book page is a synopsis, not the original book body.

Joseph L. Bower’s coauthorship of the distinct 1995 article must not be merged into sole-authored book credit or erased if that article is later added.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Robots after humanity

Robot servants persist and continue after human civilization fades.

Fictional perspective on human–robot continuity.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

City

{
  "access_scope": "Open Road Media synopsis of City; the original collection and later Epilog were not inspected.",
  "dates": {
    "date": "Original 1952 retained; current ebook undated on inspected page",
    "retrieved_at": "2026-10-07",
    "version_note": "ISBN 9781504012942; current publisher synopsis, not verified original 1952 text. HTML title names David W. Wixon, whereas visible book byline names Simak; no Wixon authorship is inferred."
  },
  "id": "city-simak::CITY",
  "title": "City",
  "url": "https://openroadmedia.com/ebook/city/9781504012942"
}

Original 1952 manifestation, ordering of stories and later Epilog are not verified by the current synopsis. Wixon’s role remains unverified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Original 1952 manifestation, ordering of stories and later Epilog are not verified by the current synopsis. Wixon’s role remains unverified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1952
}

Original 1952 manifestation, ordering of stories and later Epilog are not verified by the current synopsis. Wixon’s role remains unverified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

A capable system with dangerous obligations

HAL provides a fictional case for examining trust, conflicting obligations and human dependence on an intelligent system.

A capable machine has consequential operational authority in the imagined setting.

Capability, authority and dependable behavior are separate questions even when an interface appears human.

A fictional failure is not evidence about the motivations or consciousness of present AI systems.

Sources and details

2001: A Space Odyssey (novel)

{
  "access_scope": "Publisher synopsis of the novel, explicitly Saturn destination and HAL’s control of Discovery; no full novel inspection.",
  "dates": {
    "date": "1968 original retained; inspected 1993/2000 editions",
    "retrieved_at": "2026-10-07",
    "version_note": "Current Ace paperback 1 August 1993; other formats 1 September 2000, not the original 1968 publication."
  },
  "id": "clarke::N2P",
  "title": "2001: A Space Odyssey (novel)",
  "url": "https://www.penguinrandomhouse.com/books/325356/2001-a-space-odyssey-by-arthur-c-clarke/"
}

2001: una odisea espacial, publisher synopsis

{
  "access_scope": "Publisher Spanish synopsis, translated by researcher; no translated novel text inspection.",
  "dates": {
    "date": "2024-04-23 edition",
    "retrieved_at": "2026-10-07",
    "version_note": "Debolsillo paperback ISBN 9786073838399, 23 April 2024 Spanish manifestation; not a new original-work date."
  },
  "id": "clarke::N2S",
  "title": "2001: una odisea espacial, publisher synopsis",
  "url": "https://www.penguinrandomhouse.com/books/761706/2001-una-odisea-espacial--2001-a-space-odyssey-by-arthur-c-clarke/"
}

Publisher synopses do not independently establish the baseline concealment and conflicting-obligation mechanism; preserve those stronger baseline explanations with their inherited review status.

No full original novel or film was inspected. The 1968 novel remains distinct from the film.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Publisher synopses do not independently establish the baseline concealment and conflicting-obligation mechanism; preserve those stronger baseline explanations with their inherited review status.

No full original novel or film was inspected. The 1968 novel remains distinct from the film.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1968
}

Publisher synopses do not independently establish the baseline concealment and conflicting-obligation mechanism; preserve those stronger baseline explanations with their inherited review status.

No full original novel or film was inspected. The 1968 novel remains distinct from the film.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Vision from language supervision

Training on image–caption pairs produced visual models that classify by text description.

Image-text pretraining enables zero-shot visual transfer.

Inherits biases and gaps of web-scale captions.

Sources and details

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Exact-work primary research reused from atlas_remaining/ml_models_evidence.json, work-coverage-a9e07a4a98e462, original retrieval 2026-10-07. Proceedings byline and the cited full-text §§5–6 limitations/broader-impacts passages independently rechecked in this pass.",
  "authors": [
    "Alec Radford",
    "Jong Wook Kim",
    "Chris Hallacy",
    "Aditya Ramesh",
    "Gabriel Goh",
    "Sandhini Agarwal",
    "Girish Sastry",
    "Amanda Askell",
    "Pamela Mishkin",
    "Jack Clark",
    "Gretchen Krueger",
    "Ilya Sutskever"
  ],
  "dates": {
    "date": "2021",
    "retrieval_date": "2026-10-07",
    "version": "ICML 2021 / PMLR 139:8748–8763"
  },
  "id": "clip::clip-icml",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://proceedings.mlr.press/v139/radford21a/radford21a.pdf"
}

All twelve authors must remain credited; Radford and Kim have equal-contribution marks.

Do not turn zero-shot into no pretraining exposure or guaranteed robustness. First announcement 2021-01-05 and arXiv submission 2021-02-26 are separate events.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All twelve authors must remain credited; Radford and Kim have equal-contribution marks.

Do not turn zero-shot into no pretraining exposure or guaranteed robustness. First announcement 2021-01-05 and arXiv submission 2021-02-26 are separate events.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2021
}

All twelve authors must remain credited; Radford and Kim have equal-contribution marks.

Do not turn zero-shot into no pretraining exposure or guaranteed robustness. First announcement 2021-01-05 and arXiv submission 2021-02-26 are separate events.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

The cognitive turn

Psychology and linguistics treated the mind as an information-processing system with internal representations.

Early empirical analysis of concept learning.

A research program across fields, not a single theory.

Sources and details

The cognitive revolution: a historical perspective

{
  "access_scope": "Inspected PDF pp. 1–3 (printed pp. 141–143); author’s personal retrospective, not the original 1956 experiments.",
  "authors": [
    "George A. Miller"
  ],
  "dates": {
    "date": "2003-03",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Trends in Cognitive Sciences 7(3), pp. 141–144, DOI 10.1016/S1364-6613(03)00029-9; author-university mirror.",
    "version_note": "Trends in Cognitive Sciences 7(3), pp. 141–144, DOI 10.1016/S1364-6613(03)00029-9; author-university mirror."
  },
  "id": "cognitive-turn::miller-cognitive-2003",
  "title": "The cognitive revolution: a historical perspective",
  "url": "https://www.cs.princeton.edu/~rit/geo/Miller.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

A Study of Thinking and its original empirical methods have not been inspected. The 2003 retrospective remains a distinct supplemental work. Miller’s paragraph misspells Goodnow as Goodenough; no credit correction is adopted from that paragraph.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

A Study of Thinking and its original empirical methods have not been inspected. The 2003 retrospective remains a distinct supplemental work. Miller’s paragraph misspells Goodnow as Goodenough; no credit correction is adopted from that paragraph.

Dates

{
  "year": 1956
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

A Study of Thinking and its original empirical methods have not been inspected. The 2003 retrospective remains a distinct supplemental work. Miller’s paragraph misspells Goodnow as Goodenough; no credit correction is adopted from that paragraph.

Evidence scope: participant retrospective.

Evidence scope: participant theoretical interpretation.

Evidence scope: participant institutional recollection.

Transactions as the unit

The transaction, governed by working rules, is the basic unit of institutional analysis.

Important predecessor to transaction-cost governance and collective-action accounts of organizations.

Influential concept; its formalization came later with Williamson.

Sources and details

Institutional Economics

{
  "access_scope": "Original 1931 article reproduced in a university-hosted teaching PDF; PDF pp. 1–5 inspected. Reflowed PDF page numbers are not original AER pagination. Not the 1934 book with the same title.",
  "authors": [
    "John R. Commons"
  ],
  "dates": {
    "date": "1931",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "American Economic Review 21, pp. 648–657; University of Texas-hosted reflowed text, 7 PDF pages",
    "version_note": "American Economic Review 21, pp. 648–657; University of Texas-hosted reflowed text, 7 PDF pages"
  },
  "id": "commons::commons31-original",
  "title": "Institutional Economics",
  "url": "https://la.utexas.edu/users/hcleaver/368/368commonsoninstitutionalecontable.pdf"
}

1931 article and 1934 book remain separate work identities despite sharing a title.

The 1934 book body is still uninspected; no complete original-book clearance.

The inherited Williamson relationship remains an editorial/historical claim not newly established by this article.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

1931 article and 1934 book remain separate work identities despite sharing a title.

The 1934 book body is still uninspected; no complete original-book clearance.

The inherited Williamson relationship remains an editorial/historical claim not newly established by this article.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1934
}

1931 article and 1934 book remain separate work identities despite sharing a title.

The 1934 book body is still uninspected; no complete original-book clearance.

The inherited Williamson relationship remains an editorial/historical claim not newly established by this article.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-article theoretical unit

original-article mechanism

original-article typology

original-article institutional mechanism

Compilers and languages

Translating human-readable instructions into machine code made programming cheaper and broader.

Made computing more programmable and less tied to machine-specific code.

Language design was collective; credit is shared with committees.

Sources and details

The Education of a Computer

{
  "access_scope": "Inspected pp. 243–249 including catalogue, compiler operations and limitations; publisher record checked for publication date.",
  "authors": [
    "Grace Murray Hopper"
  ],
  "dates": {
    "date": "1952-05-02",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Proceedings of the 1952 ACM national meeting (Pittsburgh), pp. 243–249; original seven-page scan hosted by Ohio State. DOI 10.1145/609784.609818.",
    "version_note": "Proceedings of the 1952 ACM national meeting (Pittsburgh), pp. 243–249; original seven-page scan hosted by Ohio State. DOI 10.1145/609784.609818."
  },
  "id": "compilers::hopper-education-1952",
  "title": "The Education of a Computer",
  "url": "https://ohiostate.pressbooks.pub/app/uploads/sites/45/2017/09/gracehopper.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This source does not establish COBOL committee history or a measured general reduction in programming cost. A-0-era compilation is not silently equated with every modern compiler.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

This source does not establish COBOL committee history or a measured general reduction in programming cost. A-0-era compilation is not silently equated with every modern compiler.

Dates

{
  "year": 1952
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

This source does not establish COBOL committee history or a measured general reduction in programming cost. A-0-era compilation is not silently equated with every modern compiler.

Evidence scope: primary engineering description.

Evidence scope: primary mechanism.

Evidence scope: primary stated limit.

What can be computed

Several independent formalisms captured the same class of effectively computable functions.

Foundational model for computation and functional representation.

Computability ignores cost; feasible computation is a separate question.

Sources and details

On Computable Numbers, with an Application to the Entscheidungsproblem

{
  "access_scope": "Inspected §§1–2, §11 and Appendix; correction acknowledged as separate appended item, not independently analyzed.",
  "authors": [
    "A. M. Turing"
  ],
  "dates": {
    "date": "1936–1937",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Stanford-hosted 16-page transcription of Proceedings of the London Mathematical Society, series 2, 42, pp. 230–265, plus later correction; original pagination appears in braces.",
    "version_note": "Stanford-hosted 16-page transcription of Proceedings of the London Mathematical Society, series 2, 42, pp. 230–265, plus later correction; original pagination appears in braces."
  },
  "id": "computability::turing-computable-transcription",
  "title": "On Computable Numbers, with an Application to the Entscheidungsproblem",
  "url": "https://theory.stanford.edu/~trevisan/cs172-07/turing36.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Post systems and general recursive functions need additional exact-source coverage before claiming every listed formalism has been newly verified. Do not label the historical printing/circle-free argument as an exact modern halting-problem proof without qualification.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Post systems and general recursive functions need additional exact-source coverage before claiming every listed formalism has been newly verified. Do not label the historical printing/circle-free argument as an exact modern halting-problem proof without qualification.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1936
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Post systems and general recursive functions need additional exact-source coverage before claiming every listed formalism has been newly verified. Do not label the historical printing/circle-free argument as an exact modern halting-problem proof without qualification.

Evidence scope: primary formal definition.

Evidence scope: primary equivalence proof outline.

Evidence scope: primary undecidability argument.

Evidence scope: bounded editorial scope inference.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Activate part of a larger model

A learned gate routes each example to a subset of experts, separating total model capacity from active computation.

Routing, balancing and communication remain tractable.

Different inputs use different feedforward experts. The gate and distributed implementation must handle unequal load and communication overhead.

Distinguish stored capacity, active computation and the cost of delivering a dependable result.

Compare activated parameters and end-to-end latency, not just headline parameter totals.

Sparse activation introduces systems and training challenges; larger capacity is not automatically cheaper useful output.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Exact arXiv-v1 primary-text research reused from atlas_next50/ai_papers_evidence.json, work-97ccf31e820b, retrieval 2026-10-07. arXiv v1 author list and date independently rechecked.",
  "authors": [
    "Noam Shazeer",
    "Azalia Mirhoseini",
    "Krzysztof Maziarz",
    "Andy Davis",
    "Quoc Le",
    "Geoffrey Hinton",
    "Jeff Dean"
  ],
  "dates": {
    "date": "2017-01-23",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "conditional-compute::moe-v1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/pdf/1701.06538v1"
}

This is the 2017 LSTM-based method, not a later Transformer MoE architecture.

Retain baseline instruction to compare active parameters and end-to-end latency.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is the 2017 LSTM-based method, not a later Transformer MoE architecture.

Retain baseline instruction to compare active parameters and end-to-end latency.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2017
}

This is the 2017 LSTM-based method, not a later Transformer MoE architecture.

Retain baseline instruction to compare active parameters and end-to-end latency.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Differentiation and integration

Effective firms differentiate units to fit their environments and invest in integrating them.

Connects specialized units with the integration mechanisms required for coordinated performance.

Contingency fit is hard to test causally.

Sources and details

Differentiation and Integration in Complex Organizations

{
  "access_scope": "Original article abstract and byline inspected via indexed JSTOR text; direct page returned only a script shell. No article-body or 1967-book inspection is claimed.",
  "authors": [
    "Paul R. Lawrence",
    "Jay W. Lorsch"
  ],
  "dates": {
    "date": "June 1967",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Administrative Science Quarterly 12(1), 1–47; DOI 10.2307/2391211",
    "version_note": "Administrative Science Quarterly 12(1), 1–47; DOI 10.2307/2391211"
  },
  "id": "contingency::lawrence-lorsch67-abstract",
  "title": "Differentiation and Integration in Complex Organizations",
  "url": "https://www.jstor.org/stable/2391211"
}

Organization and Environment is a distinct book; its full text remains uninspected.

Do not generalize the six-organization study into proof that one universal integration device works everywhere.

The HBS obituary is secondary institutional history, not the original book or article.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Organization and Environment is a distinct book; its full text remains uninspected.

Do not generalize the six-organization study into proof that one universal integration device works everywhere.

The HBS obituary is secondary institutional history, not the original book or article.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1967
}

Organization and Environment is a distinct book; its full text remains uninspected.

Do not generalize the six-organization study into proof that one universal integration device works everywhere.

The HBS obituary is secondary institutional history, not the original book or article.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-abstract study design

original-abstract measured dimensions

original-abstract association, not causal identification

original-abstract association plus methodological boundary

The concept of corporate strategy

Strategy matches a firm's capabilities to opportunities in its environment.

Captures the integration of corporate purposes and strategic direction.

A teaching framework more than a predictive theory.

Sources and details

The Concept of Corporate Strategy

{
  "access_scope": "Baker Library archival reproduction of original p. 41, downloaded via the page’s “Download The Concept of Corporate Strategy chart” link and visually inspected; PDF p. 1 is book printed p. 41. Only this chart, not the full book, is primary-content evidence.",
  "authors": [
    "Kenneth R. Andrews"
  ],
  "dates": {
    "date": "1971",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Dow Jones-Irwin first edition, printed p. 41, one-page archive reproduction",
    "version_note": "Dow Jones-Irwin first edition, printed p. 41, one-page archive reproduction"
  },
  "id": "corporate-strategy::andrews71-chart",
  "title": "The Concept of Corporate Strategy",
  "url": "https://www.library.hbs.edu/special-collections-and-archives/exhibits/case-method/impact-on-research-and-curriculum"
}

This is a conceptual teaching framework, not an empirical prediction model.

The archival landing page’s history of Swiss watch cases is secondary context and is not used as original-book evidence.

Do not reproduce the chart in a public deliverable without separate rights review.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is a conceptual teaching framework, not an empirical prediction model.

The archival landing page’s history of Swiss watch cases is secondary context and is not used as original-book evidence.

Do not reproduce the chart in a public deliverable without separate rights review.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1971
}

This is a conceptual teaching framework, not an empirical prediction model.

The archival landing page’s history of Swiss watch cases is secondary context and is not used as original-book evidence.

Do not reproduce the chart in a public deliverable without separate rights review.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-chart conceptual definition

original-chart formulation components

original-chart implementation components

original-chart relational reading; not a measured causal effect

Text-to-image generation

A Transformer generated images from text prompts without task-specific training.

Autoregressive joint modeling of image and text tokens.

Image quality and controllability were early-stage.

Sources and details

Zero-Shot Text-to-Image Generation

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Aditya Ramesh",
    "Mikhail Pavlov",
    "Gabriel Goh",
    "Scott Gray",
    "Chelsea Voss",
    "Alec Radford",
    "Mark Chen",
    "Ilya Sutskever"
  ],
  "dates": {
    "date": "2021-02-26",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2; first submission 2021-02-24"
  },
  "id": "dalle::dalle-v2",
  "title": "Zero-Shot Text-to-Image Generation",
  "url": "https://arxiv.org/pdf/2102.12092v2"
}

Do not conflate original DALL·E with later diffusion-based versions.

Zero-shot benchmark evaluation does not establish zero image overlap: the paper explicitly studies overlap with evaluation images.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Do not conflate original DALL·E with later diffusion-based versions.

Zero-shot benchmark evaluation does not establish zero image overlap: the paper explicitly studies overlap with evaluation images.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2021
}

Do not conflate original DALL·E with later diffusion-based versions.

Zero-shot benchmark evaluation does not establish zero image overlap: the paper explicitly studies overlap with evaluation images.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

A research program for AI

The proposal frames learning and intelligence as subjects for computational study.

Aspects of intelligence can be described precisely enough to simulate.

A field emerges through research programs and communities, not a single inventor.

An agenda is not an achieved general theory or a complete list of contributors to AI.

Sources and details

A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "John McCarthy",
    "Marvin L. Minsky",
    "Nathaniel Rochester",
    "Claude E. Shannon"
  ],
  "dates": {
    "date": "1955-08-31",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted transcription of 1955 proposal; includes separately labeled 1996 notes"
  },
  "id": "dartmouth::dartmouth-proposal",
  "title": "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence",
  "url": "https://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html"
}

Do not treat the proposed ten-person plan as the actual attendance record. The hosted page explicitly warns that its appended interest list is not an attendance list.

Do not attribute the later 1996 notes or mailing-list additions to the 1955 proposal.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Do not treat the proposed ten-person plan as the actual attendance record. The hosted page explicitly warns that its appended interest list is not an attendance list.

Do not attribute the later 1996 notes or mailing-list additions to the 1955 proposal.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1955
}

Do not treat the proposed ten-person plan as the actual attendance record. The hosted page explicitly warns that its appended interest list is not an attendance list.

Do not attribute the later 1996 notes or mailing-list additions to the 1955 proposal.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Decision analysis

Choices under uncertainty and conflicting objectives can be structured and analyzed.

Bridges formal rational choice and practical decisions involving uncertainty and conflicting goals.

Requires elicited probabilities and values that may be unreliable.

Sources and details

Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Chapter 1 “The Problem”

{
  "access_scope": "Publisher-hosted chapter summary presenting the authors’ opening text, and complete chapter byline/date inspected. Full chapter and original 1976 edition not inspected.",
  "authors": [
    "Ralph L. Keeney",
    "Howard Raiffa"
  ],
  "dates": {
    "date": "1993 print manifestation; online 2014-07-05; first book publication 1976 retained separately",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Cambridge edition, chapter pp. 1–30; DOI 10.1017/CBO9781139174084.003",
    "version_note": "Cambridge edition, chapter pp. 1–30; DOI 10.1017/CBO9781139174084.003"
  },
  "id": "decision-analysis::keeney-raiffa93-problem",
  "title": "Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Chapter 1 “The Problem”",
  "url": "https://www.cambridge.org/core/books/abs/decisions-with-multiple-objectives/problem/249A67CC72DD8401342A6E9DB2609341"
}

Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Chapter 7 “Illustrative Applications”

{
  "access_scope": "Publisher chapter summary inspected; examples are author-described applications, not independently evaluated outcomes.",
  "authors": [
    "Ralph L. Keeney",
    "Howard Raiffa"
  ],
  "dates": {
    "date": "Cambridge 1993 edition; online 2014-07-05",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Chapter pp. 354–435; DOI 10.1017/CBO9781139174084.009",
    "version_note": "Chapter pp. 354–435; DOI 10.1017/CBO9781139174084.009"
  },
  "id": "decision-analysis::keeney-raiffa93-applications",
  "title": "Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Chapter 7 “Illustrative Applications”",
  "url": "https://www.cambridge.org/core/books/abs/decisions-with-multiple-objectives/illustrative-applications/174F4E20FA6E8BBAE1670DECE964868F"
}

Decision Analysis: A Personal Account of How It Got Started and Evolved

{
  "access_scope": "Editors’ note and chapter metadata, not the retrospective body. Credits identify distinct collaborations; not original-text clearance of the three older books.",
  "authors": [
    "Howard Raiffa"
  ],
  "dates": {
    "date": "2007 volume; online 2012-06-05",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Advances in Decision Analysis, chapter 4, pp. 57–70; DOI 10.1017/CBO9780511611308.005",
    "version_note": "Advances in Decision Analysis, chapter 4, pp. 57–70; DOI 10.1017/CBO9780511611308.005"
  },
  "id": "decision-analysis::raiffa-retrospective-summary",
  "title": "Decision Analysis: A Personal Account of How It Got Started and Evolved",
  "url": "https://www.cambridge.org/core/books/abs/advances-in-decision-analysis/decision-analysis-a-personal-account-of-how-it-got-started-and-evolved/149F8E2B27B9FE17E58800B290815E18"
}

R. Duncan Luce and Howard Raiffa authored Games and Decisions; Howard Raiffa and Robert Schlaifer authored Applied Statistical Decision Theory; Ralph L. Keeney and Howard Raiffa authored Decisions with Multiple Objectives. These are distinct works, not a four-author joint book.

The present mechanism support is limited to the specified Cambridge edition summaries, not every component of the composite family.

Preserve the inherited probability/value elicitation reliability caution; no experimental claim of improved decisions is made.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

R. Duncan Luce and Howard Raiffa authored Games and Decisions; Howard Raiffa and Robert Schlaifer authored Applied Statistical Decision Theory; Ralph L. Keeney and Howard Raiffa authored Decisions with Multiple Objectives. These are distinct works, not a four-author joint book.

The present mechanism support is limited to the specified Cambridge edition summaries, not every component of the composite family.

Preserve the inherited probability/value elicitation reliability caution; no experimental claim of improved decisions is made.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1957
}

R. Duncan Luce and Howard Raiffa authored Games and Decisions; Howard Raiffa and Robert Schlaifer authored Applied Statistical Decision Theory; Ralph L. Keeney and Howard Raiffa authored Decisions with Multiple Objectives. These are distinct works, not a four-author joint book.

The present mechanism support is limited to the specified Cambridge edition summaries, not every component of the composite family.

Preserve the inherited probability/value elicitation reliability caution; no experimental claim of improved decisions is made.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

publisher-hosted author-summary conceptual framing

publisher-hosted author-summary scope/assumption

publisher-hosted author-summary normative procedure

publisher-hosted author-summary illustrative applications

Usable depth

Layer-wise learning supplies a practical route to training deep generative models.

The proposed architecture and training objective support staged learning.

Hinton, Osindero and Teh describe a procedure for training deep belief networks through a sequence of layerwise learning steps. This made a particular class of deep model more tractable in its research setting. Its significance should be read alongside the architecture, objective and training procedure actually used, rather than as proof that any deeper network will perform better.

Training methods can change which architectures are practical at a given compute budget.

A useful historical comparison separates the ability to train a model from the value of its outputs. Training methods can unlock an architecture, while application performance still depends on data, objectives, computation and evaluation.

One path in a broader revival; it is not the modern recipe for every deep model.

Sources and details

A Fast Learning Algorithm for Deep Belief Nets

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Geoffrey E. Hinton",
    "Simon Osindero",
    "Yee-Whye Teh"
  ],
  "dates": {
    "date": "2006",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted manuscript marked “To appear in Neural Computation 2006”"
  },
  "id": "deep-belief::dbn-2006",
  "title": "A Fast Learning Algorithm for Deep Belief Nets",
  "url": "https://www.cs.toronto.edu/~hinton/absps/fastnc.pdf"
}

Source is an author-hosted prepublication manuscript, not independently checked final typesetting.

Do not generalize the greedy bound or MNIST result to arbitrary deep networks. Keep the stronger baseline contemporary comparison and all experiment boundaries.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Source is an author-hosted prepublication manuscript, not independently checked final typesetting.

Do not generalize the greedy bound or MNIST result to arbitrary deep networks. Keep the stronger baseline contemporary comparison and all experiment boundaries.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2006
}

Source is an author-hosted prepublication manuscript, not independently checked final typesetting.

Do not generalize the greedy bound or MNIST result to arbitrary deep networks. Keep the stronger baseline contemporary comparison and all experiment boundaries.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Knowledge in expert systems

A program inferred molecular structures by encoding chemists' knowledge, showing that domain knowledge drives performance.

Connects AI to scientific hypothesis formation.

Encoded knowledge was costly to build and maintain.

Sources and details

On Generality and Problem Solving: A Case Study Using the DENDRAL Program

{
  "access_scope": "Inspected title, introduction, task description, generate-and-test and planning sections; PDF pp. 3–15 and 23–30.",
  "authors": [
    "Edward A. Feigenbaum",
    "Bruce G. Buchanan",
    "Joshua Lederberg"
  ],
  "dates": {
    "date": "1970-08",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Stanford AIM-131 / Computer Science Department Report CS176, NASA-hosted 51-page scan with added disclaimer.",
    "version_note": "Stanford AIM-131 / Computer Science Department Report CS176, NASA-hosted 51-page scan with added disclaimer."
  },
  "id": "dendral::dendral-generality-1970",
  "title": "On Generality and Problem Solving: A Case Study Using the DENDRAL Program",
  "url": "https://ntrs.nasa.gov/api/citations/19710028679/downloads/19710028679.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

No fresh benchmark or general expert-level chemistry claim. The 1970 report is distinct from the Buchanan–Sutherland–Feigenbaum chapter and the 1965 project start.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

No fresh benchmark or general expert-level chemistry claim. The 1970 report is distinct from the Buchanan–Sutherland–Feigenbaum chapter and the 1965 project start.

Dates

{
  "year": 1965
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

No fresh benchmark or general expert-level chemistry claim. The 1970 report is distinct from the Buchanan–Sutherland–Feigenbaum chapter and the 1965 project start.

Evidence scope: primary system design.

Evidence scope: author reported performance boundary.

The Diamond Age

An interactive book educates a child and changes her social prospects.

Literary exploration of personalized computational education and augmentation.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

The Diamond Age

{
  "access_scope": "Publisher plot synopsis of the Primer, its illicit copy, Nell and social hierarchy; no full novel inspection.",
  "dates": {
    "date": "2000 paperback / 2003 ebook",
    "retrieved_at": "2026-10-07",
    "version_note": "Current page lists 2 May 2000 paperback and 26 August 2003 ebook, distinct from original 1995 publication."
  },
  "id": "diamond-age::DIA",
  "title": "The Diamond Age",
  "url": "https://www.penguinrandomhouse.com/books/172835/the-diamond-age-by-neal-stephenson/"
}

The Diamond Age, limited edition

{
  "access_scope": "Publisher synopsis and reissue metadata, including education and stratified nanotechnological society.",
  "dates": {
    "date": "1995 original / 2014 reissue",
    "retrieved_at": "2026-10-07",
    "version_note": "2014 Subterranean Press edition; explicitly records first publication in 1995. Patrick Arrasmith illustrates this edition, not a coauthor of the novel."
  },
  "id": "diamond-age::DIB",
  "title": "The Diamond Age, limited edition",
  "url": "https://subterraneanpress.com/diamond-age/"
}

Publisher synopses do not establish a wholly autonomous tutor. Human performance/mediation details require additional original-text evidence; do not equate the Primer with a present-day unattended AI tutor.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Publisher synopses do not establish a wholly autonomous tutor. Human performance/mediation details require additional original-text evidence; do not equate the Primer with a present-day unattended AI tutor.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1995
}

Publisher synopses do not establish a wholly autonomous tutor. Human performance/mediation details require additional original-text evidence; do not equate the Primer with a present-day unattended AI tutor.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The division of labor

Specialization raises productivity, and its extent is limited by the size of the market.

Foundational account of how decomposed work and exchange increase productive capacity.

Smith also warned that narrow specialization can harm workers.

Sources and details

An Inquiry into the Nature and Causes of the Wealth of Nations

{
  "access_scope": "Book I chapter I original text in Cannan/Econlib later-edition transcription; not a first-edition facsimile.",
  "authors": [
    "Adam Smith"
  ],
  "dates": {
    "date": "1776 first publication; 1789 underlying edition; 1904 Cannan edition; 2000 electronic edition",
    "retrieval_date": "2026-10-07",
    "version": "1789 fifth-edition text, edited by Edwin Cannan 1904; Econlib electronic edition 2000; first edition 1776"
  },
  "id": "division-of-labor::division-labor-book1ch1",
  "title": "An Inquiry into the Nature and Causes of the Wealth of Nations",
  "url": "https://www.econlib.org/library/Smith/smWN.html?chapter_num=4"
}

An Inquiry into the Nature and Causes of the Wealth of Nations

{
  "access_scope": "Book I chapter III original text in Cannan/Econlib transcription.",
  "authors": [
    "Adam Smith"
  ],
  "dates": {
    "date": "1776 first publication; 1789 underlying edition; 1904 Cannan edition; 2000 electronic edition",
    "retrieval_date": "2026-10-07",
    "version": "1789 fifth-edition text, edited by Edwin Cannan 1904; Econlib electronic edition 2000; first edition 1776"
  },
  "id": "division-of-labor::division-labor-book1ch3",
  "title": "An Inquiry into the Nature and Causes of the Wealth of Nations",
  "url": "https://www.econlib.org/library/Smith/smWN.html?chapter_num=6"
}

An Inquiry into the Nature and Causes of the Wealth of Nations

{
  "access_scope": "Book V chapter I, education discussion, original text in Cannan/Econlib transcription.",
  "authors": [
    "Adam Smith"
  ],
  "dates": {
    "date": "1776 first publication; 1789 underlying edition; 1904 Cannan edition; 2000 electronic edition",
    "retrieval_date": "2026-10-07",
    "version": "1789 fifth-edition text, edited by Edwin Cannan 1904; Econlib electronic edition 2000; first edition 1776"
  },
  "id": "division-of-labor::division-labor-book5ch1",
  "title": "An Inquiry into the Nature and Causes of the Wealth of Nations",
  "url": "https://www.econlib.org/library/Smith/smWN.html?chapter_num=35"
}

Pin output is Smith’s historical illustration, not a newly measured productivity estimate.

The Glasgow overview’s simplified untrained-worker output is not substituted for the original text.

Keep first publication 1776 separate from inspected 1789/1904/2000 manifestations.

Public-domain status of this text does not automatically license surrounding modern images or designs.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Pin output is Smith’s historical illustration, not a newly measured productivity estimate.

The Glasgow overview’s simplified untrained-worker output is not substituted for the original text.

Keep first publication 1776 separate from inspected 1789/1904/2000 manifestations.

Public-domain status of this text does not automatically license surrounding modern images or designs.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1776
}

Pin output is Smith’s historical illustration, not a newly measured productivity estimate.

The Glasgow overview’s simplified untrained-worker output is not substituted for the original text.

Keep first publication 1776 separate from inspected 1789/1904/2000 manifestations.

Public-domain status of this text does not automatically license surrounding modern images or designs.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Early problem-solving programs

Programs solved integration, algebra word problems and analogy tests in restricted domains.

Early heuristic mathematical problem solving.

Narrow successes that depended on hand-built representations.

Sources and details

A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus

{
  "access_scope": "Abstract text only; publisher full PDF returned 403. No full mechanism inspection claimed.",
  "authors": [
    "James R. Slagle"
  ],
  "dates": {
    "date": "1963-10",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of the ACM 10(4), pp. 507–520; substantive author abstract reproduced by Medley Interlisp bibliography; publisher metadata checked separately.",
    "version_note": "Journal of the ACM 10(4), pp. 507–520; substantive author abstract reproduced by Medley Interlisp bibliography; publisher metadata checked separately."
  },
  "id": "early-mit-programs::slagle-saint-1963-abstract",
  "title": "A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus",
  "url": "https://interlisp.org/history/bibliography/eiatqtvr/"
}

Natural Language Input for a Computer Problem Solving System

{
  "access_scope": "Title, acknowledgments and abstract inspected from scan using local OCR; no full-thesis inspection claimed.",
  "authors": [
    "Daniel G. Bobrow"
  ],
  "dates": {
    "date": "1964-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "MIT doctoral thesis / MAC-TR-1, September 1964; CSAIL 128-page scan.",
    "version_note": "MIT doctoral thesis / MAC-TR-1, September 1964; CSAIL 128-page scan."
  },
  "id": "early-mit-programs::bobrow-student-1964",
  "title": "Natural Language Input for a Computer Problem Solving System",
  "url": "https://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-001.pdf"
}

A Heuristic Program to Solve Geometric-Analogy Problems

{
  "access_scope": "Inspected introduction and solution-process sections, PDF pp. 1–4 (printed pp. 327–330).",
  "authors": [
    "Thomas G. Evans"
  ],
  "dates": {
    "date": "1964",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Proceedings, Spring Joint Computer Conference 1964, pp. 327–338; 12-page primary scan.",
    "version_note": "Proceedings, Spring Joint Computer Conference 1964, pp. 327–338; 12-page primary scan."
  },
  "id": "early-mit-programs::evans-analogy-1964",
  "title": "A Heuristic Program to Solve Geometric-Analogy Problems",
  "url": "https://logical.ai/auai/p327-evans.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Keep three program identities and dates separate. SAINT’s full 1963 paper was not inspected; the 1961 thesis candidate at CMU proved title-page-only. No human-level general intelligence claim.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Keep three program identities and dates separate. SAINT’s full 1963 paper was not inspected; the 1961 thesis candidate at CMU proved title-page-only. No human-level general intelligence claim.

Dates

{
  "year": 1961
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Keep three program identities and dates separate. SAINT’s full 1963 paper was not inspected; the 1961 thesis candidate at CMU proved title-page-only. No human-level general intelligence claim.

Evidence scope: primary abstract reported result.

Evidence scope: primary abstract mechanism.

Evidence scope: primary system mechanism.

Evidence scope: primary stated scope.

Permutation City; Diaspora

Simulated minds and uploaded civilizations question identity and embodiment.

Rigorous fictional thought experiments about computational consciousness.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Permutation City

{
  "access_scope": "Author synopsis and edition history; original publication dates distinguished from this later web account.",
  "dates": {
    "date": "1994 original / 2007 web page origin",
    "retrieved_at": "2026-10-07",
    "version_note": "Author bibliography: Orion/Millennium London 1994; HarperPrism New York 1995. Web page created 11 March 2007, subsequently updated."
  },
  "id": "egan::PC",
  "title": "Permutation City",
  "url": "https://www.gregegan.net/PERMUTATION/Permutation.html"
}

Permutation City, opening excerpt

{
  "access_scope": "Original excerpt: Paul realizes he is a Copy, slowed execution, shutdown choice and simulated surroundings.",
  "dates": {
    "date": "1994 work; excerpt hosting date unstated",
    "retrieved_at": "2026-10-07",
    "version_note": "Author-hosted original-text excerpt; novel first published 1994, hosting date not treated as original release."
  },
  "id": "egan::PCX",
  "title": "Permutation City, opening excerpt",
  "url": "https://www.gregegan.net/PERMUTATION/Excerpt/PermutationExcerpt.html"
}

Diaspora

{
  "access_scope": "Author synopsis and publication history, distinguishing the 1997 novel from Permutation City.",
  "dates": {
    "date": "1997 original / 1998 US",
    "retrieved_at": "2026-10-07",
    "version_note": "Orion/Millennium London 1997; US HarperPrism 1998. Orphanogenesis excerpt Interzone 123, September 1997."
  },
  "id": "egan::EGD",
  "title": "Diaspora",
  "url": "https://www.gregegan.net/DIASPORA/DIASPORA.html"
}

Diaspora: Orphanogenesis

{
  "access_scope": "Original opening chapter: learning self/other distinction, naming and interaction in a digital community.",
  "dates": {
    "date": "1997",
    "retrieved_at": "2026-10-07",
    "version_note": "Author-hosted chapter one of the 1997 novel; separately published excerpt September 1997."
  },
  "id": "egan::EGX",
  "title": "Diaspora: Orphanogenesis",
  "url": "https://www.gregegan.net/DIASPORA/01/Orphanogenesis.html"
}

Keep Permutation City (1994) and Diaspora (1997) as separate authored works within the existing combined family; this is not a new identity merge.

Diaspora’s digital-born Yatima is not simply a scanned biological person; baseline Uploaded minds label is broader than this example.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Keep Permutation City (1994) and Diaspora (1997) as separate authored works within the existing combined family; this is not a new identity merge.

Diaspora’s digital-born Yatima is not simply a scanned biological person; baseline Uploaded minds label is broader than this example.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1994
}

Keep Permutation City (1994) and Diaspora (1997) as separate authored works within the existing combined family; this is not a new identity merge.

Diaspora’s digital-born Yatima is not simply a scanned biological person; baseline Uploaded minds label is broader than this example.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Conversation by pattern

Simple pattern matching produced conversation that users treated as understanding.

Landmark conversational-programming experiment.

Its author warned that users over-attributed intelligence.

Sources and details

ELIZA—A Computer Program for the Study of Natural Language Communication between Man and Machine

{
  "access_scope": "Rotated page images and OCR inspected for program body and technical rules; editorial introduction kept separate. PDF sheets 1–5, reprint body pp. 23 onward.",
  "authors": [
    "Joseph Weizenbaum"
  ],
  "dates": {
    "date": "1966-01 (original); 1983-01 (inspected reprint)",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "CACM 9(1), pp. 36–45 originally; January 1983 25th-anniversary reprint, 6 PDF sheets with sideways two-page spreads and added editorial introduction.",
    "version_note": "CACM 9(1), pp. 36–45 originally; January 1983 25th-anniversary reprint, 6 PDF sheets with sideways two-page spreads and added editorial introduction."
  },
  "id": "eliza::weizenbaum-eliza-1983-reprint",
  "title": "ELIZA—A Computer Program for the Study of Natural Language Communication between Man and Machine",
  "url": "https://cse.buffalo.edu/~rapaport/572/S02/weizenbaum.eliza.1966reprint.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Do not attribute the later editorial introduction to Weizenbaum. The 1976 book’s stronger anecdotes and claims about users were not inspected.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Do not attribute the later editorial introduction to Weizenbaum. The 1976 book’s stronger anecdotes and claims about users were not inspected.

Dates

{
  "year": 1966
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Do not attribute the later editorial introduction to Weizenbaum. The 1976 book’s stronger anecdotes and claims about users were not inspected.

Evidence scope: primary system mechanism.

Evidence scope: primary system design.

Evidence scope: primary author caution.

Contextual word representations

Representations taken from a pretrained language model varied with context and improved many tasks.

Represented words according to their linguistic context.

Soon superseded by Transformer pretraining.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Matthew E. Peters",
    "Mark Neumann",
    "Mohit Iyyer",
    "Matt Gardner",
    "Christopher Clark",
    "Kenton Lee",
    "Luke Zettlemoyer"
  ],
  "dates": {
    "date": "2018-03-22",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2 / NAACL camera-ready; first arXiv 2018-02-15"
  },
  "id": "elmo::elmo-v2",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/pdf/1802.05365v2"
}

Repository comment says an earlier OpenReview posting existed on 2017-10-27; that claim is metadata-only here and does not authorize moving the canonical 2018 year.

Do not present the LSTM architecture as Transformer pretraining.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Repository comment says an earlier OpenReview posting existed on 2017-10-27; that claim is metadata-only here and does not authorize moving the canonical 2018 year.

Do not present the LSTM architecture as Transformer pretraining.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2018
}

Repository comment says an earlier OpenReview posting existed on 2017-10-27; that claim is metadata-only here and does not authorize moving the canonical 2018 year.

Do not present the LSTM architecture as Transformer pretraining.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Ideas and endogenous growth

Ideas are non-rival; market incentives for creating them drive long-run growth.

Links idea production and economic incentives to cumulative growth.

The model's mapping to measured growth is debated.

Sources and details

Endogenous Technological Change

{
  "access_scope": "Published journal title/abstract and introduction, PDF pp. 1–5 (cover plus printed S71–S74) inspected. Not the December 1989 NBER working-paper manifestation.",
  "authors": [
    "Paul M. Romer"
  ],
  "dates": {
    "date": "October 1990",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of Political Economy 98(5), Part 2, S71–S102; journal scan hosted by Stanford",
    "version_note": "Journal of Political Economy 98(5), Part 2, S71–S102; journal scan hosted by Stanford"
  },
  "id": "endogenous-growth::romer90-journal",
  "title": "Endogenous Technological Change",
  "url": "https://web.stanford.edu/~klenow/Romer_1990.pdf"
}

The 1989 NBER paper is an earlier version and is not silently substituted for the inspected 1990 journal article.

Preserve the inherited caution about mapping the model to measured growth.

The source distinguishes nonrival designs from rival human capital; do not describe every form of knowledge as nonrival.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1989 NBER paper is an earlier version and is not silently substituted for the inspected 1990 journal article.

Preserve the inherited caution about mapping the model to measured growth.

The source distinguishes nonrival designs from rival human capital; do not describe every form of knowledge as nonrival.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1990
}

The 1989 NBER paper is an earlier version and is not silently substituted for the inspected 1990 journal article.

Preserve the inherited caution about mapping the model to measured growth.

The source distinguishes nonrival designs from rival human capital; do not describe every form of knowledge as nonrival.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-paper theoretical premise

original-paper theoretical mechanism

original-paper market-structure rationale

original-paper model result, explicitly non-empirical

Knowledge engineering

Domain knowledge, inference rules and explanations are engineered into expert systems.

Expert knowledge can be elicited and represented usefully.

Explicit knowledge and explanation remain useful contrasts with opaque learned models.

Knowledge acquisition and maintenance are difficult; the MYCIN setting does not establish universal expertise.

Sources and details

The Structure of the MYCIN System

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "William van Melle"
  ],
  "dates": {
    "date": "1984",
    "retrieval_date": "2026-10-07",
    "version": "Chapter 4, pp. 67–77, in Rule-Based Expert Systems; based on 1978 article"
  },
  "id": "expert-systems::mycin-ch4",
  "title": "The Structure of the MYCIN System",
  "url": "https://www.shortliffe.net/Buchanan-Shortliffe-1984/Chapter-04.pdf"
}

Knowledge Engineering

{
  "access_scope": "Author-hosted chapter text inspected; no individual chapter byline is shown. Volume editors are credited separately without inferring a personal chapter byline.",
  "dates": {
    "date": "1984",
    "retrieval_date": "2026-10-07",
    "version": "Chapter 7, pp. 149–158; unsigned overview chapter in Rule-Based Expert Systems"
  },
  "id": "expert-systems::mycin-ch7",
  "title": "Knowledge Engineering",
  "url": "https://people.dbmi.columbia.edu/~ehs7001/Buchanan-Shortliffe-1984/Chapter-07.pdf"
}

Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project

{
  "access_scope": "Volume contents and contributor-list metadata inspected; not a whole-book read.",
  "dates": {
    "date": "1984",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted volume contents and contributor credits"
  },
  "id": "expert-systems::mycin-volume",
  "title": "Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project",
  "url": "https://people.dbmi.columbia.edu/~ehs7001/Buchanan-Shortliffe-1984/MYCIN%20Book.htm"
}

Credit van Melle for Chapter 4, not just the volume editors; do not describe the entire book as read.

No present-day clinical recommendation or evidence of universal diagnostic expertise is inferred.

The original full-book landing page timed out, but author-hosted chapters and Columbia mirror were readable.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Credit van Melle for Chapter 4, not just the volume editors; do not describe the entire book as read.

No present-day clinical recommendation or evidence of universal diagnostic expertise is inferred.

The original full-book landing page timed out, but author-hosted chapters and Columbia mirror were readable.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1984
}

Credit van Melle for Chapter 4, not just the volume editors; do not describe the entire book as read.

No present-day clinical recommendation or evidence of universal diagnostic expertise is inferred.

The original full-book landing page timed out, but author-hosted chapters and Columbia mirror were readable.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Functions of administration

Management consists of planning, organizing, commanding, coordinating and controlling.

Provides an organization-wide management lens alongside task-level scientific management.

A prescriptive framework rather than an empirical theory.

Sources and details

Administration industrielle et générale

{
  "access_scope": "Original French text transcription, Part I Chapters I–III inspected. English sentences below are fresh paraphrases of French, not quotations from Constance Storrs’s 1949 translation.",
  "authors": [
    "Henri Fayol"
  ],
  "dates": {
    "date": "1917 inspected French book; 1916 initial work date retained",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "H. Dunod et E. Pinat, Paris; Wikisource transcription linked to 1917 scan, Part I",
    "version_note": "H. Dunod et E. Pinat, Paris; Wikisource transcription linked to 1917 scan, Part I"
  },
  "id": "fayol::fayol17-french",
  "title": "Administration industrielle et générale",
  "url": "https://fr.wikisource.org/wiki/Administration_industrielle_et_g%C3%A9n%C3%A9rale/Partie_1"
}

1916 work date, 1917 French book and 1949 English translation are distinct dated manifestations.

Constance Storrs is not credited as author or translator of the inspected French source. Any binding to her translation must identify her translator role and its own date.

The baseline prescriptive-framework caution remains.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

1916 work date, 1917 French book and 1949 English translation are distinct dated manifestations.

Constance Storrs is not credited as author or translator of the inspected French source. Any binding to her translation must identify her translator role and its own date.

The baseline prescriptive-framework caution remains.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1916
}

1916 work date, 1917 French book and 1949 English translation are distinct dated manifestations.

Constance Storrs is not credited as author or translator of the inspected French source. Any binding to her translation must identify her translator role and its own date.

The baseline prescriptive-framework caution remains.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-French conceptual definition; English editorial paraphrase

original-French functional explanation; English editorial paraphrase

original-French organizational scope

original-French proposition and explicit evidentiary caution

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Safety at the cost of freedom

Robots enforce human safety so completely that people lose their freedom.

Fictional tension between protection and autonomy.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

With Folded Hands

{
  "access_scope": "Selected story passages in a public reproduction: PDF pp. 1–2, 9–10, 17–19 and 26–28 (one-based); exact original-edition collation remains held.",
  "dates": {
    "date": "Original 1947 baseline retained; reproduction undated",
    "retrieved_at": "2026-10-07",
    "version_note": "28-page public text reproduction with OCR defects; no original magazine masthead or copyright leaf. Not the later Humanoids novel."
  },
  "id": "folded-hands::FOLD",
  "title": "With Folded Hands",
  "url": "https://www.drunkmonkeyclub.com/download/Science%20Fiction%20and%20Fantasy%20F-J/Jack%20Williamson/Jack%20Williamson%20-%20With%20Folded%20Hands.pdf"
}

Exact 1947 magazine manifestation and reproduction fidelity beyond the selected passages remain held. Haffner collection page timed out; no claim to a checked publisher edition.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Exact 1947 magazine manifestation and reproduction fidelity beyond the selected passages remain held. Haffner collection page timed out; no claim to a checked publisher edition.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1947
}

Exact 1947 magazine manifestation and reproduction fidelity beyond the selected passages remain held. Haffner collection page timed out; no claim to a checked publisher edition.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: selected original text paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Power with, not over

Conflict can be resolved by integration, and authority can be shared rather than imposed.

Connects coordination with participation, reciprocal influence and shared problem-solving.

Normative and conceptual; evidence is mostly case-based.

Sources and details

Creative Experience

{
  "access_scope": "Original-book OCR of the January 1930 reprint, title/copyright leaves and printed pp. 184–190 inspected. The copyright leaf distinguishes first edition April 1924 from reprinted January 1930; the archive catalogue labels the work 1924. Text-page locators are printed pagination, not PDF pages.",
  "authors": [
    "Mary Parker Follett"
  ],
  "dates": {
    "date": "1924 first edition; January 1930 inspected reprint",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Longmans, Green and Co.; January 1930 reprint of the April 1924 first edition; University of Florida copy digitized by Internet Archive",
    "version_note": "Longmans, Green and Co.; January 1930 reprint of the April 1924 first edition; University of Florida copy digitized by Internet Archive"
  },
  "id": "follett::follett24-original",
  "title": "Creative Experience",
  "url": "https://archive.org/stream/creativeexperien00foll/creativeexperien00foll_djvu.txt"
}

Creative Experience (1924) is not the unidentified 1925 item in the original record, nor a claim to have inspected every later collected lecture.

The IESE article by reference to Melé and Rosanas is secondary interpretation; no original-work clearance is derived from it.

No general promise that every conflict admits an integrative solution.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

The inspected Creative Experience copy is the January 1930 reprint of the April 1924 first edition; the archive catalogue’s 1924 date is not the scanned manifestation date.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Creative Experience (1924) is not the unidentified 1925 item in the original record, nor a claim to have inspected every later collected lecture.

The IESE article by reference to Melé and Rosanas is secondary interpretation; no original-work clearance is derived from it.

No general promise that every conflict admits an integrative solution.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

The inspected Creative Experience copy is the January 1930 reprint of the April 1924 first edition; the archive catalogue’s 1924 date is not the scanned manifestation date.

Dates

{
  "year": 1925
}

Creative Experience (1924) is not the unidentified 1925 item in the baseline, nor a claim to have inspected every later collected lecture.

The IESE article by reference to Melé and Rosanas is secondary interpretation; no original-work clearance is derived from it.

No general promise that every conflict admits an integrative solution.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

The inspected Creative Experience copy is the January 1930 reprint of the April 1924 first edition; the archive catalogue’s 1924 date is not the scanned manifestation date.

original-book conceptual procedure

original-book conceptual distinction

original-book illustrative anecdote; not an experiment

original-book explicit research caution

The frame problem

Representing what does not change after an action is hard for logical agents.

Direct bridge between philosophical questions and executable AI representations.

A representational problem; it persists in new forms in learned systems.

Sources and details

Some Philosophical Problems from the Standpoint of Artificial Intelligence — The Frame Problem

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "John McCarthy",
    "Patrick J. Hayes"
  ],
  "dates": {
    "date": "1969",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted HTML transcription; parent title and byline at mcchay69.html"
  },
  "id": "frame-problem::frame-1969",
  "title": "Some Philosophical Problems from the Standpoint of Artificial Intelligence — The Frame Problem",
  "url": "https://www-formal.stanford.edu/jmc/mcchay69/node17.html"
}

The 1969 argument concerns a formal representation problem; any extension to contemporary learned systems needs separately labeled analysis.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1969 argument concerns a formal representation problem; any extension to contemporary learned systems needs separately labeled analysis.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1969
}

The 1969 argument concerns a formal representation problem; any extension to contemporary learned systems needs separately labeled analysis.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Quantified logic

A formal notation with quantifiers made precise reasoning about generality possible.

Foundation for formal representation of structured assertions.

Formal expressiveness does not make inference computationally easy.

Sources and details

Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought

{
  "access_scope": "Inspected original-author preface and §§1–11 through local OCR and visual verification, particularly PDF/printed pp. 5–6 and 22–25. Editorial introduction pp. 1–5 is not used as original-author mechanism evidence.",
  "authors": [
    "Gottlob Frege"
  ],
  "dates": {
    "date": "1879 (original); inspected translation publication year not verified from excerpt",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "82-page scanned English translation with separate editorial introduction; translation credited to Stefan Bauer-Mengelberg. Printed page numbers 1–82 in supplied scan.",
    "version_note": "82-page scanned English translation with separate editorial introduction; translation credited to Stefan Bauer-Mengelberg. Printed page numbers 1–82 in supplied scan."
  },
  "id": "frege::frege-begriffsschrift-translation",
  "title": "Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought",
  "url": "https://dec59.ruk.cuni.cz/~kolmanv/Begriffsschrift.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Host collection edition and translation publication year require bibliographic verification. No priority claim or computational-efficiency theorem is inferred.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Host collection edition and translation publication year require bibliographic verification. No priority claim or computational-efficiency theorem is inferred.

Dates

{
  "year": 1879
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Host collection edition and translation publication year require bibliographic verification. No priority claim or computational-efficiency theorem is inferred.

Evidence scope: primary author method.

Evidence scope: primary formal definition.

Evidence scope: primary formal rule.

Games and strategy

Strategic interdependence can be analyzed mathematically.

Foundational joint attribution for formal models of incentives and strategic behavior.

Equilibrium predictions depend on assumptions about players and information.

Sources and details

Theory of Games and Economic Behavior: 60th Anniversary Commemorative Edition

{
  "access_scope": "Licensed-platform original-text preview, chapter I sections 1.1–1.2, in the 2007 commemorative edition; not the complete 1944 book.",
  "authors": [
    "John von Neumann",
    "Oskar Morgenstern"
  ],
  "dates": {
    "date": "2007 reissue; 1944 original",
    "retrieval_date": "2026-10-07",
    "version": "2007 Princeton 60th Anniversary Commemorative Edition; first published 1944"
  },
  "id": "game-theory::game-theory-preview2007",
  "title": "Theory of Games and Economic Behavior: 60th Anniversary Commemorative Edition",
  "url": "https://www.perlego.com/book/734292/theory-of-games-and-economic-behavior-60th-anniversary-commemorative-edition-pdf"
}

Nash equilibrium and later incomplete-information developments must not be backdated into this joint 1944 work.

No full minimax proof or general n-person solution audit.

The 2004 commemorative introduction PDF and 2007 commercial manifestation are distinct dated objects.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Nash equilibrium and later incomplete-information developments must not be backdated into this joint 1944 work.

No full minimax proof or general n-person solution audit.

The 2004 commemorative introduction PDF and 2007 commercial manifestation are distinct dated objects.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1944
}

Nash equilibrium and later incomplete-information developments must not be backdated into this joint 1944 work.

No full minimax proof or general n-person solution audit.

The 2004 commemorative introduction PDF and 2007 commercial manifestation are distinct dated objects.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Neuromancer

A fictional networked world places artificial intelligence, corporate power and human agency in the same system.

The novel constructs a world in which advanced computation and unequal control coexist.

Question who owns powerful systems and who gets to act inside them.

Fiction is a thought experiment, not evidence that a particular technical or social future will occur.

Sources and details

Neuromancer

{
  "access_scope": "Publisher synopsis of Case’s damaged nervous system, exclusion from cyberspace and employment against an AI.",
  "dates": {
    "date": "2000 reissue",
    "retrieved_at": "2026-10-07",
    "version_note": "Publisher page lists 1 July 2000 paperback; original 1984 identity retained separately."
  },
  "id": "gibson::NEU",
  "title": "Neuromancer",
  "url": "https://www.penguinrandomhouse.com/books/293994/neuromancer-by-william-gibson/"
}

Neuromancer, page 269 excerpt

{
  "access_scope": "Short original passage embedded in a university research record, available in search retrieval only; no whole-novel inspection.",
  "dates": {
    "date": "1984 original; catalogue entry 2015-07-31",
    "retrieved_at": "2026-10-07",
    "version_note": "University of Virginia collection cites Ace Books, New York, 1984, p.269; indexed passage recovered, direct open returned an error."
  },
  "id": "gibson::NUX",
  "title": "Neuromancer, page 269 excerpt",
  "url": "https://metaphors.iath.virginia.edu/metaphors/24621"
}

University-hosted primary passage was recovered through indexed search only; full page open failed. No claim of a complete novel inspection.

Preserve stronger baseline corporate-power and human-agency interpretation; no historical influence claim is added.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

University-hosted primary passage was recovered through indexed search only; full page open failed. No claim of a complete novel inspection.

Preserve stronger baseline corporate-power and human-agency interpretation; no historical influence claim is added.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1984
}

University-hosted primary passage was recovered through indexed search only; full page open failed. No claim of a complete novel inspection.

Preserve stronger baseline corporate-power and human-agency interpretation; no historical influence claim is added.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Limits of formal systems

Any consistent formal system rich enough for arithmetic contains true statements it cannot prove.

Establishes limits of sufficiently strong formal systems.

A result about formal systems, not a direct claim about machine intelligence.

Sources and details

On Formally Undecidable Propositions of Principia Mathematica and Related Systems I

{
  "access_scope": "Inspected Gödel body §§1–2 and §4, especially propositions VI and XI; translator/editor commentary is kept separate.",
  "authors": [
    "Kurt Gödel"
  ],
  "dates": {
    "date": "1931 (original); 1962 translation preface",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "75-page electronic typeset text, marked 11/10/00; B. Meltzer translation with R. B. Braithwaite introduction, preserved original page references.",
    "version_note": "75-page electronic typeset text, marked 11/10/00; B. Meltzer translation with R. B. Braithwaite introduction, preserved original page references."
  },
  "id": "godel::godel-meltzer-transcription",
  "title": "On Formally Undecidable Propositions of Principia Mathematica and Related Systems I",
  "url": "https://gtts.ehu.es/German/Docencia/2021/MTBYC/pdf/Godel.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The baseline modern shorthand omits effective axiomatization and conditions; it is preserved verbatim, while proposed prose makes original-paper scope explicit. No conclusion about human superiority or machine intelligence follows.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The baseline modern shorthand omits effective axiomatization and conditions; it is preserved verbatim, while proposed prose makes original-paper scope explicit. No conclusion about human superiority or machine intelligence follows.

Dates

{
  "year": 1931
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

The baseline modern shorthand omits effective axiomatization and conditions; it is preserved verbatim, while proposed prose makes original-paper scope explicit. No conclusion about human superiority or machine intelligence follows.

Evidence scope: primary proof method.

Evidence scope: primary theorem with assumptions.

Evidence scope: primary assumption distinction.

Simple robots, complex behavior

A few interacting circuits produced lifelike exploratory behavior.

Early embodied, goal-seeking machine behavior.

Demonstration machines, not general learners.

Sources and details

An Imitation of Life

{
  "access_scope": "Four-page scan inspected using OCR and visual inspection, particularly PDF p. 3 / printed p. 44. Narrative demonstration report, not quantified general-learning evaluation.",
  "authors": [
    "W. Grey Walter"
  ],
  "dates": {
    "date": "1950-05",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Scientific American 182(5), pp. 42–45; four-page scan hosted at MIT, publisher metadata corroborates May 1950.",
    "version_note": "Scientific American 182(5), pp. 42–45; four-page scan hosted at MIT, publisher metadata corroborates May 1950."
  },
  "id": "grey-walter::walter-imitation-1950",
  "title": "An Imitation of Life",
  "url": "https://people.csail.mit.edu/brooks/idocs/walter50imitation.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The article discusses more complex learning models separately; learning or memory is not attributed to these simple tortoises. “Free will” rhetoric is not adopted.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

The article discusses more complex learning models separately; learning or memory is not attributed to these simple tortoises. “Free will” rhetoric is not adopted.

Dates

{
  "year": 1950
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

The article discusses more complex learning models separately; learning or memory is not attributed to these simple tortoises. “Free will” rhetoric is not adopted.

Evidence scope: primary demonstration design.

Evidence scope: primary reported behavior.

A computer wakes up

A computer becomes self-aware and helps organize a political revolution.

Fictional machine consciousness and political agency.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

The Moon Is a Harsh Mistress

{
  "access_scope": "Selected original-story text in public reproduction, PDF pp. 2, 4–6 and 28 (one-based); not a complete novel audit.",
  "dates": {
    "date": "Original 1966 baseline retained; public reproduction undated",
    "retrieved_at": "2026-10-07",
    "version_note": "216-page text reproduction; not an independently collated original edition."
  },
  "id": "harsh-mistress::MOON",
  "title": "The Moon Is a Harsh Mistress",
  "url": "https://drnissani.net/mnissani/RevolutionarysToolkit/TheMoonIsAHarshMistress.pdf"
}

The Moon is a Harsh Mistress: publisher synopsis

{
  "access_scope": "Publisher synopsis identifies Mike, Mannie and Wyoming as participants in the lunar revolt.",
  "dates": {
    "date": "2008-12-11 hardcover manifestation; original 1966 retained",
    "retrieved_at": "2026-10-07",
    "version_note": "S.F. Masterworks hardcover ISBN 9780575082410; page award label is not used as evidence."
  },
  "id": "harsh-mistress::MOONM",
  "title": "The Moon is a Harsh Mistress: publisher synopsis",
  "url": "https://adaptive.hachettelearning.com/titles/robert-a-heinlein/the-moon-is-a-harsh-mistress/9780575082410/"
}

The last sentence combines directly checked infrastructure passages with the separately bound publisher synopsis of the revolt; the entire revolution was not re-audited.

Do not treat the fictional neuristor count or awakening as an empirical consciousness threshold.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The last sentence combines directly checked infrastructure passages with the separately bound publisher synopsis of the revolt; the entire revolution was not re-audited.

Do not treat the fictional neuristor count or awakening as an empirical consciousness threshold.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1966
}

The last sentence combines directly checked infrastructure passages with the separately bound publisher synopsis of the revolt; the entire revolution was not re-audited.

Do not treat the fictional neuristor count or awakening as an empirical consciousness threshold.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: selected original text paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Distributed knowledge

Coordination must use local knowledge dispersed among many people.

Relevant knowledge is dispersed and often specific to time and place.

A broad model is not a complete repository of operational knowledge.

A centralized representation may omit tacit or changing context.

Sources and details

The Use of Knowledge in Society

{
  "access_scope": "Reprinted original essay text, sections I, III, V and VI inspected; no modern AI evidence.",
  "authors": [
    "Friedrich A. Hayek"
  ],
  "dates": {
    "date": "1945 original; online transcription undated",
    "retrieval_date": "2026-10-07",
    "version": "1945"
  },
  "id": "hayek::hayek-original",
  "title": "The Use of Knowledge in Society",
  "url": "https://www.econlib.org/book-chapters/chapter-the-use-of-knowledge-in-society/"
}

This is an economic argument, not proof that any modern model or central organization is incapable of useful coordination.

The essay does not claim prices transmit every local detail or achieve perfection.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is an economic argument, not proof that any modern model or central organization is incapable of useful coordination.

The essay does not claim prices transmit every local detail or achieve perfection.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1945
}

This is an economic argument, not proof that any modern model or central organization is incapable of useful coordination.

The essay does not claim prices transmit every local detail or achieve perfection.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Formal consistency as a goal

Mathematics would be axiomatized and its consistency shown by finitary methods.

Supplied key problems for proof theory and computability.

Gödel's theorems showed the program could not succeed as originally stated.

Sources and details

On the Infinite

{
  "access_scope": "Inspected translation header and discussions of finitary methods, ideal statements and formal derivation; HTML excerpt scope, not complete 1926 German scan.",
  "authors": [
    "David Hilbert"
  ],
  "dates": {
    "date": "1926 (original publication); 1925-06-04 (lecture)",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "English translation by Erna Putnam and Gerald J. Massey, presented as Philosophy of Mathematics, second edition, edited by Paul Benacerraf and Hilary Putnam; Dartmouth HTML transcription. Host-edition year not visible in inspected header.",
    "version_note": "English translation by Erna Putnam and Gerald J. Massey, presented as Philosophy of Mathematics, second edition, edited by Paul Benacerraf and Hilary Putnam; Dartmouth HTML transcription. Host-edition year not visible in inspected header."
  },
  "id": "hilbert-program::hilbert-infinite-translation",
  "title": "On the Infinite",
  "url": "https://math.dartmouth.edu/~matc/Readers/HowManyAngels/Philosophy/Philosophy.html"
}

On Formally Undecidable Propositions of Principia Mathematica and Related Systems I

{
  "access_scope": "Inspected Gödel body §§1–2 and §4, especially propositions VI and XI; translator/editor commentary is kept separate.",
  "authors": [
    "Kurt Gödel"
  ],
  "dates": {
    "date": "1931 (original); 1962 translation preface",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "75-page electronic typeset text, marked 11/10/00; B. Meltzer translation with R. B. Braithwaite introduction, preserved original page references.",
    "version_note": "75-page electronic typeset text, marked 11/10/00; B. Meltzer translation with R. B. Braithwaite introduction, preserved original page references."
  },
  "id": "hilbert-program::godel-meltzer-transcription",
  "title": "On Formally Undecidable Propositions of Principia Mathematica and Related Systems I",
  "url": "https://gtts.ehu.es/German/Docencia/2021/MTBYC/pdf/Godel.pdf"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Hilbert’s 1925/1926 essay is distinct from the family’s 1921 plotting date. Gödel explicitly leaves open in his original discussion finite methods not formalizable in the system; do not claim the 1931 paper alone establishes every version of the program impossible.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Hilbert’s 1925/1926 essay is distinct from the family’s 1921 plotting date. Gödel explicitly leaves open in his original discussion finite methods not formalizable in the system; do not claim the 1931 paper alone establishes every version of the program impossible.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1921
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Hilbert’s 1925/1926 essay is distinct from the family’s 1921 plotting date. Gödel explicitly leaves open in his original discussion finite methods not formalizable in the system; do not claim the 1931 paper alone establishes every version of the program impossible.

Evidence scope: primary programmatic goal.

Evidence scope: primary programmatic method.

Evidence scope: primary theorem applied with bounded editorial link.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Inverse document frequency

Weighting rare terms more heavily improved document retrieval.

Quantifies term specificity for information retrieval.

A ranking heuristic; it does not model meaning.

Sources and details

A statistical interpretation of term specificity and its application in retrieval

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Karen Spärck Jones"
  ],
  "dates": {
    "date": "1972",
    "retrieval_date": "2026-10-07",
    "version": "2004 reprint of Journal of Documentation 28(1):11–21; reprint 60(5):493–502"
  },
  "id": "idf::idf-1972-reprint",
  "title": "A statistical interpretation of term specificity and its application in retrieval",
  "url": "https://www.staff.city.ac.uk/~sbrp622/idfpapers/ksj_orig.pdf"
}

Read 1972 article through 2004 reprint; do not redate the original contribution to 2004 or imply the index page itself is the full article.

The original discretized log-frequency formula should not silently be replaced by a different modern smoothed IDF formula.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Read 1972 article through 2004 reprint; do not redate the original contribution to 2004 or imply the index page itself is the full article.

The original discretized log-frequency formula should not silently be replaced by a different modern smoothed IDF formula.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1972
}

Read 1972 article through 2004 reprint; do not redate the original contribution to 2004 or imply the index page itself is the full article.

The original discretized log-frequency formula should not silently be replaced by a different modern smoothed IDF formula.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Data and accelerated vision

A deep convolutional network trained with GPUs achieved a major improvement on ImageNet classification.

Large labeled data, compute and architecture work together.

The family combines a large labeled visual dataset with a deep convolutional model trained using accelerated computation. ImageNet's dataset builders and AlexNet's model authors are credited separately. Benchmark improvement reflects the interaction of data, architecture and training resources; it is not an isolated victory of one ingredient or evidence that the same model can solve every visual task.

Model quality is a system outcome: data, compute, architecture and evaluation are complementary inputs.

Before transferring a benchmark result to inspection work, compare image conditions, label definitions and the cost of missed defects. Credit dataset construction and compute-enabled training alongside model design, and validate the actual deployment setting.

Benchmark progress does not establish robust performance in every deployment environment.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "date": "2009",
    "retrieval_date": "2026-10-07",
    "version": "CVPR 2009 paper"
  },
  "id": "imagenet-alexnet::imagenet-2009",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

ImageNet Classification with Deep Convolutional Neural Networks

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Geoffrey E. Hinton"
  ],
  "dates": {
    "date": "2012",
    "retrieval_date": "2026-10-07",
    "version": "NeurIPS/NIPS 2012 proceedings paper"
  },
  "id": "imagenet-alexnet::alexnet-2012",
  "title": "ImageNet Classification with Deep Convolutional Neural Networks",
  "url": "https://papers.nips.cc/paper_files/paper/2012/file/c399862d3b9d6b76c8436e924a68c45b-Paper.pdf"
}

Credit all six dataset-paper authors separately from the three model authors; modern ImageNet-team webpages must not backdate additional team members into the 2009 byline.

The 15.3% result is an ensemble contest result; do not attribute it to every single-network configuration or confuse it with the 17.0% ILSVRC-2010 result.

Preserve baseline deployment-validation, labels and missed-defect example.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Credit all six dataset-paper authors separately from the three model authors; modern ImageNet-team webpages must not backdate additional team members into the 2009 byline.

The 15.3% result is an ensemble contest result; do not attribute it to every single-network configuration or confuse it with the 17.0% ILSVRC-2010 result.

Preserve baseline deployment-validation, labels and missed-defect example.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2012
}

Credit all six dataset-paper authors separately from the three model authors; modern ImageNet-team webpages must not backdate additional team members into the 2009 byline.

The 15.3% result is an ensemble contest result; do not attribute it to every single-network configuration or confuse it with the 17.0% ILSVRC-2010 result.

Preserve baseline deployment-validation, labels and missed-defect example.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Incentive contracts

Pay should depend on informative signals, and strong incentives on one task can distort others.

Useful for understanding what to measure and reward in delegated work.

Optimal contracts are hard to implement in practice.

Sources and details

Moral Hazard and Observability

{
  "access_scope": "Original journal scan, title/abstract and introduction visually inspected at PDF pp. 2–3, printed pp. 74–75. Later pages and proofs not claimed as audited.",
  "authors": [
    "Bengt Holmström"
  ],
  "dates": {
    "date": "Spring 1979",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Bell Journal of Economics 10(1), 74–91; university-hosted journal scan",
    "version_note": "Bell Journal of Economics 10(1), 74–91; university-hosted journal scan"
  },
  "id": "incentive-contracts::holmstrom79-original",
  "title": "Moral Hazard and Observability",
  "url": "https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/8/36875/files/2020/06/Holmstrom-MH-and-Observability.pdf"
}

Multitask Principal–Agent Analyses: Incentive Contracts, Asset Ownership, and Job Design

{
  "access_scope": "Author-hosted original article scan, PDF pp. 1–2 visually inspected; each PDF page contains two printed pages (24–25, 26–27). Model rationale and illustrations, not empirical estimates.",
  "authors": [
    "Bengt Holmstrom",
    "Paul Milgrom"
  ],
  "dates": {
    "date": "1991; publisher issue date 1991-01-01",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of Law, Economics, and Organization 7, special issue, 24–52; DOI 10.1093/jleo/7.special_issue.24",
    "version_note": "Journal of Law, Economics, and Organization 7, special issue, 24–52; DOI 10.1093/jleo/7.special_issue.24"
  },
  "id": "incentive-contracts::holmstrom-milgrom91-original",
  "title": "Multitask Principal–Agent Analyses: Incentive Contracts, Asset Ownership, and Job Design",
  "url": "https://web.stanford.edu/~milgrom/publishedarticles/Multitask%20Principal%20Agent.pdf"
}

This is contract theory, not evidence that a specific pay system caused a measured organizational outcome.

Signal relevance means additional information about action, not any extra available variable regardless of informativeness or cost.

Do not credit Paul Milgrom with the single-authored 1979 paper or omit him from the 1991 multitask paper.

Preserve the inherited implementation difficulty caution.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is contract theory, not evidence that a specific pay system caused a measured organizational outcome.

Signal relevance means additional information about action, not any extra available variable regardless of informativeness or cost.

Do not credit Paul Milgrom with the single-authored 1979 paper or omit him from the 1991 multitask paper.

Preserve the inherited implementation difficulty caution.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1979
}

This is contract theory, not evidence that a specific pay system caused a measured organizational outcome.

Signal relevance means additional information about action, not any extra available variable regardless of informativeness or cost.

Do not credit Paul Milgrom with the single-authored 1979 paper or omit him from the 1991 multitask paper.

Preserve the inherited implementation difficulty caution.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-paper theoretical problem

original-paper model result, conditional on its information structure

original-paper theoretical attention-allocation mechanism

original-paper illustrative examples and conditional model result

Incentives under private information

When others hold private information, mechanisms must make truthful revelation worthwhile.

Introduces mechanisms that elicit information and allocate resources under strategic behavior.

Optimal mechanisms can be complex and fragile.

Sources and details

Counterspeculation, Auctions, and Competitive Sealed Tenders

{
  "access_scope": "Original journal scan visually inspected at PDF pp. 14–15 (printed pp. 20–21); title, date and sole byline cross-checked with Wiley publisher metadata.",
  "authors": [
    "William Vickrey"
  ],
  "dates": {
    "date": "March 1961",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of Finance 16(1), 8–37; university-hosted journal scan; DOI 10.1111/j.1540-6261.1961.tb02789.x",
    "version_note": "Journal of Finance 16(1), 8–37; university-hosted journal scan; DOI 10.1111/j.1540-6261.1961.tb02789.x"
  },
  "id": "incentives-info::vickrey61-original",
  "title": "Counterspeculation, Auctions, and Competitive Sealed Tenders",
  "url": "https://jmvidal.cse.sc.edu/library/vickrey61a.pdf"
}

An Exploration in the Theory of Optimum Income Taxation

{
  "access_scope": "Original journal-text scan on an academic reading site; title and introduction/model PDF pp. 2–4 (printed pp. 175–177) inspected. Numerical tables and optimal tax values are not used.",
  "authors": [
    "J. A. Mirrlees"
  ],
  "dates": {
    "date": "April 1971",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Review of Economic Studies 38(2), 175–208; DOI 10.2307/2296779; reproduced journal PDF",
    "version_note": "Review of Economic Studies 38(2), 175–208; DOI 10.2307/2296779; reproduced journal PDF"
  },
  "id": "incentives-info::mirrlees71-original",
  "title": "An Exploration in the Theory of Optimum Income Taxation",
  "url": "https://zhanksun.github.io/reading/mirrlees71.pdf"
}

The source texts are separate 1961 and 1971 papers, not a jointly authored work.

The Vickrey claim is bounded to the single-lot valuation setup and no collusion; no blanket claim for common-value or every multi-unit auction.

The baseline’s broader private-information lens and complexity caution remain; no universal incentive mechanism is asserted.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The source texts are separate 1961 and 1971 papers, not a jointly authored work.

The Vickrey claim is bounded to the single-lot valuation setup and no collusion; no blanket claim for common-value or every multi-unit auction.

The baseline’s broader private-information lens and complexity caution remain; no universal incentive mechanism is asserted.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1961
}

The source texts are separate 1961 and 1971 papers, not a jointly authored work.

The Vickrey claim is bounded to the single-lot valuation setup and no collusion; no blanket claim for common-value or every multi-unit auction.

The baseline’s broader private-information lens and complexity caution remain; no universal incentive mechanism is asserted.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-paper mechanism design

original-paper incentive argument under stated assumptions

original-paper theoretical policy tradeoff

original-paper modeling assumptions and evidentiary boundary

Incomplete contracts and ownership

When contracts cannot specify everything, ownership allocates residual control and shapes investment.

Preserves co-originator credit for the control-rights approach to firms and delegation.

Theory abstracts from many real governance details.

Sources and details

The Costs and Benefits of Ownership: A Theory of Vertical and Lateral Integration

{
  "access_scope": "Original article abstract in Harvard institutional repository; specific/residual rights and integration trade-off inspected, not full derivation.",
  "authors": [
    "Sanford J. Grossman",
    "Oliver D. Hart"
  ],
  "dates": {
    "date": "1986",
    "retrieval_date": "2026-10-07",
    "version": "1986"
  },
  "id": "incomplete-contracts::incomplete-contracts-gh1986",
  "title": "The Costs and Benefits of Ownership: A Theory of Vertical and Lateral Integration",
  "url": "https://dash.harvard.edu/entities/publication/73120378-84bb-6bd4-e053-0100007fdf3b"
}

Property Rights and the Nature of the Firm

{
  "access_scope": "Original article abstract in Harvard institutional repository; assets, selective dismissal and incentive scope inspected, not full model.",
  "authors": [
    "Oliver Hart",
    "John Moore"
  ],
  "dates": {
    "date": "December 1990",
    "retrieval_date": "2026-10-07",
    "version": "1990"
  },
  "id": "incomplete-contracts::incomplete-contracts-hm1990",
  "title": "Property Rights and the Nature of the Firm",
  "url": "https://dash.harvard.edu/entities/publication/73120378-84b8-6bd4-e053-0100007fdf3b"
}

Baseline plotting year 1986 remains an editorial plotting year, not a publication date for a fictitious combined Grossman/Moore work.

The Nobel biography and announcement remain retrospective context; their credit lists cannot stand in for exact paper bylines.

Abstract-level mechanism only; investment equations, bargaining assumptions and welfare results not audited.

Author-hosted 1986 PDF opened without extracted text; screenshots returned no usable visual payload in this workflow, so no full-text inspection is claimed.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Baseline plotting year 1986 remains an editorial plotting year, not a publication date for a fictitious combined Grossman/Moore work.

The Nobel biography and announcement remain retrospective context; their credit lists cannot stand in for exact paper bylines.

Abstract-level mechanism only; investment equations, bargaining assumptions and welfare results not audited.

Author-hosted 1986 PDF opened without extracted text; screenshots returned no usable visual payload in this workflow, so no full-text inspection is claimed.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1986
}

Baseline plotting year 1986 remains an editorial plotting year, not a publication date for a fictitious combined Grossman/Moore work.

The Nobel biography and announcement remain retrospective context; their credit lists cannot stand in for exact paper bylines.

Abstract-level mechanism only; investment equations, bargaining assumptions and welfare results not audited.

Author-hosted 1986 PDF opened without extracted text; screenshots returned no usable visual payload in this workflow, so no full-text inspection is claimed.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Localized industries

Concentrated industries share skills, suppliers and ideas that benefit nearby firms.

Connects production organization with local specialization and shared industrial knowledge.

Agglomeration benefits can weaken when knowledge moves easily.

Sources and details

Principles of Economics, Book IV Chapter X: The Concentration of Specialized Industries in Particular Localities

{
  "access_scope": "Original book chapter transcription and edition metadata directly inspected, particularly sections 3–4. Identified 1920 text, not a claim that all wording was present in the 1890 first edition.",
  "authors": [
    "Alfred Marshall"
  ],
  "dates": {
    "date": "1920 eighth edition; first publication 1890",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Macmillan and Co.; Econlib transcription of eighth edition",
    "version_note": "Macmillan and Co.; Econlib transcription of eighth edition"
  },
  "id": "industrial-districts::marshall20-original",
  "title": "Principles of Economics, Book IV Chapter X: The Concentration of Specialized Industries in Particular Localities",
  "url": "https://www.econlib.org/library/Marshall/marP.html?chapter_num=25"
}

Principles of Economics: An introductory volume

{
  "access_scope": "Archive provenance metadata and linked chapter inspected; the 1890 landing-page label does not resolve the exact edition of text containing later census references. Prefer the explicit 1920 Econlib manifestation for sentence bindings.",
  "authors": [
    "Alfred Marshall"
  ],
  "dates": {
    "date": "Landing page labels work 1890; exact reproduced edition unstated",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Marxists Internet Archive HTML derived from Rod Hay’s McMaster archive",
    "version_note": "Marxists Internet Archive HTML derived from Rod Hay’s McMaster archive"
  },
  "id": "industrial-districts::marshall-mia-provenance",
  "title": "Principles of Economics: An introductory volume",
  "url": "https://www.marxists.org/reference/subject/economics/marshall/index.htm"
}

1890 remains the work’s initial publication date; the inspected sentence evidence is explicitly the eighth edition, 1920.

This is historical economic analysis, not a newly identified causal agglomeration estimate.

Preserve the baseline warning about knowledge mobility; the text adds that different changes can work in opposing directions.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

1890 remains the work’s initial publication date; the inspected sentence evidence is explicitly the eighth edition, 1920.

This is historical economic analysis, not a newly identified causal agglomeration estimate.

Preserve the baseline warning about knowledge mobility; the text adds that different changes can work in opposing directions.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1890
}

1890 remains the work’s initial publication date; the inspected sentence evidence is explicitly the eighth edition, 1920.

This is historical economic analysis, not a newly identified causal agglomeration estimate.

Preserve the baseline warning about knowledge mobility; the text adds that different changes can work in opposing directions.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-book explanatory mechanism

original-book countervailing forces and caution

Organization as information processing

More task uncertainty requires either more information-processing capacity or less need for it.

A direct conceptual bridge to information systems, team design and coordination capacity.

Abstracts from politics and culture.

Sources and details

Organization Design: An Information Processing View

{
  "access_scope": "Author-site introduction and direct original-article link; web page dated 15 February 2012 is not the article's 1974 publication date.",
  "authors": [
    "Jay R. Galbraith"
  ],
  "dates": {
    "date": "2012-02-15",
    "retrieval_date": "2026-10-07",
    "version": "2012"
  },
  "id": "info-processing-design::org-galbraith-landing",
  "title": "Organization Design: An Information Processing View",
  "url": "https://jaygalbraith.com/organization-design-an-information-processing-view/"
}

Organization Design: An Information Processing View

{
  "access_scope": "Original Interfaces article on the author's site: substantive indexed sections on printed pp. 28, 30 and 32 inspected; not a claim that all ten PDF pages were read.",
  "authors": [
    "Jay R. Galbraith"
  ],
  "dates": {
    "date": "1974-05",
    "retrieval_date": "2026-10-07",
    "version": "Interfaces 4(3), May 1974, pp. 28–36; author-hosted scan"
  },
  "id": "info-processing-design::org-galbraith-1974",
  "title": "Organization Design: An Information Processing View",
  "url": "https://jaygalbraith.com/wp-content/uploads/2024/03/infoprocess1974.pdf"
}

Abstracts from politics and culture.

Original 1974 article publication, 2012 landing-page date and 2024 URL upload path are distinct dates.

This theoretical framework and its examples do not establish a universal causal effect or optimal design for every organization.

Preserve the optional-draft status and all existing source-context history; selected primary passages do not clear the entire family.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Abstracts from politics and culture.

Original 1974 article publication, 2012 landing-page date and 2024 URL upload path are distinct dates.

This theoretical framework and its examples do not establish a universal causal effect or optimal design for every organization.

Preserve the optional-draft status and all existing source-context history; selected primary passages do not clear the entire family.

Dates

{
  "year": 1974
}

Abstracts from politics and culture.

Original 1974 article publication, 2012 landing-page date and 2024 URL upload path are distinct dates.

This theoretical framework and its examples do not establish a universal causal effect or optimal design for every organization.

Preserve the optional-draft status and all existing source-context history; selected primary passages do not clear the entire family.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Product and process innovation

Innovation shifts from product variety to process efficiency after a dominant design emerges.

Connects technological innovation with production-system evolution and competitive priorities.

Fits assembled products better than some other industries.

Sources and details

A Dynamic Model of Process and Product Innovation

{
  "access_scope": "Reproduced original-paper transcription on a third-party host, title/byline, printed pp. 641–642, 648–649 and 654 inspected. Tables’ numeric results are not used; no scanned-PDF page numbering asserted.",
  "authors": [
    "James M. Utterback",
    "William J. Abernathy"
  ],
  "dates": {
    "date": "December 1975; received December 1974, revised May 1975",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Omega 3(6), 639–656; DOI 10.1016/0305-0483(75)90068-7",
    "version_note": "Omega 3(6), 639–656; DOI 10.1016/0305-0483(75)90068-7"
  },
  "id": "innovation-dynamics::utterback-abernathy75-original",
  "title": "A Dynamic Model of Process and Product Innovation",
  "url": "https://doczz.net/doc/1160964/a-dynamic-model-of-process-and-product-innovation"
}

A dynamic model of process and product innovation

{
  "access_scope": "Original publisher abstract and byline/date inspected in indexed text; direct fetch was 403. Abstract explicitly bounds study to Myers–Marquis data and warns of dependencies introduced by data adaptation.",
  "authors": [
    "James M. Utterback",
    "William J. Abernathy"
  ],
  "dates": {
    "date": "December 1975",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Omega 3(6), 639–656; DOI 10.1016/0305-0483(75)90068-7",
    "version_note": "Omega 3(6), 639–656; DOI 10.1016/0305-0483(75)90068-7"
  },
  "id": "innovation-dynamics::utterback-abernathy75-abstract",
  "title": "A dynamic model of process and product innovation",
  "url": "https://www.sciencedirect.com/science/article/abs/pii/0305048375900687"
}

The baseline dominant-design wording and assembled-products caution are preserved rather than silently removed; the inspected passages do not freshly validate every element of those broader formulations.

Successful-innovation sampling, existing-data adaptation and preliminary comparative tests must remain visible.

No numeric table estimate or general cause-and-effect arrow is imported.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The baseline dominant-design wording and assembled-products caution are preserved rather than silently removed; the inspected passages do not freshly validate every element of those broader formulations.

Successful-innovation sampling, existing-data adaptation and preliminary comparative tests must remain visible.

No numeric table estimate or general cause-and-effect arrow is imported.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1975
}

The baseline dominant-design wording and assembled-products caution are preserved rather than silently removed; the inspected passages do not freshly validate every element of those broader formulations.

Successful-innovation sampling, existing-data adaptation and preliminary comparative tests must remain visible.

No numeric table estimate or general cause-and-effect arrow is imported.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-paper theoretical hypothesis

original-paper theoretical prediction

original-abstract empirical setting/design

original-abstract reported support and explicit limitation

Low-precision inference

Mixed-precision quantization halved memory for large-model inference with little quality loss.

Reduced memory requirements for large-model deployment.

Quality effects vary by model and task.

Sources and details

LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Tim Dettmers",
    "Mike Lewis",
    "Younes Belkada",
    "Luke Zettlemoyer"
  ],
  "dates": {
    "date": "2022-11-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2 / NeurIPS 2022 camera-ready; first version 2022-08-15"
  },
  "id": "int8::int8-v2",
  "title": "LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale",
  "url": "https://arxiv.org/pdf/2208.07339v2"
}

Memory reduction is not a universal halving of every deployment’s total memory including KV cache and other allocations.

Do not equate unchanged tested perplexity/zero-shot scores with exact numerical equivalence on all tasks.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Memory reduction is not a universal halving of every deployment’s total memory including KV cache and other allocations.

Do not equate unchanged tested perplexity/zero-shot scores with exact numerical equivalence on all tasks.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2022
}

Memory reduction is not a universal halving of every deployment’s total memory including KV cache and other allocations.

Do not equate unchanged tested perplexity/zero-shot scores with exact numerical equivalence on all tasks.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale — §3.1, PDF p. 4.

Inspected source scope: LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale — §3.2, PDF p. 5.

Inspected source scope: LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale — Abstract; Figure 1, PDF p. 2; §3.4 and Table 1, PDF pp. 5–6.

Inspected source scope: LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale — §3.4, PDF p. 6; §6, PDF p. 10.

The integrated circuit

Forming many components in one piece of semiconductor made circuits smaller and cheaper to replicate.

Miniaturization milestone enabling later digital-computing hardware.

Independent inventions; priority claims differ.

Sources and details

Miniaturized electronic circuits

{
  "access_scope": "Inspected named inventor, filing/publication fields and claims 1, 3 and 16; no priority adjudication or physical demonstration inferred.",
  "authors": [
    "Jack S. Kilby"
  ],
  "dates": {
    "date": "1964-06-23",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "United States patent US3138743A; filed 1959-02-06; Google Patents rendering of patent description and claims.",
    "version_note": "United States patent US3138743A; filed 1959-02-06; Google Patents rendering of patent description and claims."
  },
  "id": "integrated-circuit::kilby-us3138743",
  "title": "Miniaturized electronic circuits",
  "url": "https://patents.google.com/patent/US3138743A/en"
}

Semiconductor device-and-lead structure

{
  "access_scope": "Inspected inventor/date fields, description of oxide/metal leads, figures 3–5 narrative and claims; not a manufacturing test report.",
  "authors": [
    "Robert N. Noyce"
  ],
  "dates": {
    "date": "1961-04-25",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "United States patent US2981877A; filed 1959-07-30; Google Patents rendering of patent description and claims.",
    "version_note": "United States patent US2981877A; filed 1959-07-30; Google Patents rendering of patent description and claims."
  },
  "id": "integrated-circuit::noyce-us2981877",
  "title": "Semiconductor device-and-lead structure",
  "url": "https://patents.google.com/patent/US2981877A/en"
}

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Patent disclosures establish proposed structures, not measured cost reductions or mass-production success. Separate inventors, filings and grants are retained; neither legal priority nor a unique first inventor is determined. The inherited 1958 milestone is not replaced by either patent date.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from these sources.

Patent disclosures establish proposed structures, not measured cost reductions or mass-production success. Separate inventors, filings and grants are retained; neither legal priority nor a unique first inventor is determined. The inherited 1958 milestone is not replaced by either patent date.

Dates

{
  "year": 1958
}

Independent evidence review and human family curation remain pending.

All baseline rights, source-clearance, access, identity and no-automatic-promotion holds remain in force.

No original-inventor priority, causal historical influence or modern empirical validation is inferred from this packet.

Patent disclosures establish proposed structures, not measured cost reductions or mass-production success. Separate inventors, filings and grants are retained; neither legal priority nor a unique first inventor is determined. The inherited 1958 milestone is not replaced by either patent date.

Evidence scope: primary patent claim.

Evidence scope: primary patent design.

Evidence scope: primary patent design rationale.

Evidence scope: primary patent illustrative design.

Klara and the Sun

A companion robot observes and cares for a family, narrating what it misunderstands.

Explores machine perspective, companionship and the ethics of instrumentalized minds.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Klara and the Sun

{
  "access_scope": "Publisher synopsis and format-specific dates; no complete novel or audiobook inspection.",
  "dates": {
    "date": "2021-03-02 original and audio",
    "retrieved_at": "2026-10-07",
    "version_note": "Book first published 2 March 2021; supplied ISBN is an audio manifestation and must not be treated as print-original proof by itself."
  },
  "id": "klara::KLP",
  "title": "Klara and the Sun",
  "url": "https://www.penguinrandomhouse.com/books/653825/klara-and-the-sun-a-gma-book-club-pick-by-kazuo-ishiguro/9780593349298/"
}

Klara and the Sun, opening excerpt

{
  "access_scope": "Publisher-authorized opening excerpt: store observation, sunlight, Rex’s teasing and a rejected purchase.",
  "dates": {
    "date": "2021-03-02",
    "retrieved_at": "2026-10-07",
    "version_note": "Knopf ebook ISBN 9780593318188, 2 March 2021; authorized excerpt copyright 2021."
  },
  "id": "klara::KLA",
  "title": "Klara and the Sun, opening excerpt",
  "url": "https://penguinrandomhousehighereducation.com/book/?isbn=9780593318188"
}

The checked opening does not independently verify the baseline’s later family-care plot; retain that claim as inherited, with fuller novel inspection still pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The checked opening does not independently verify the baseline’s later family-care plot; retain that claim as inherited, with fuller novel inspection still pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2021
}

The checked opening does not independently verify the baseline’s later family-care plot; retain that claim as inherited, with fuller novel inspection still pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Risk and uncertainty

Measurable risk differs from uncertainty that cannot be reduced to probabilities; profit rewards bearing the latter.

Clarifies limits of probabilistic optimization in entrepreneurial and organizational decisions.

The boundary between risk and uncertainty is contested.

Sources and details

Risk, Uncertainty, and Profit, Part III Chapter VII: The Meaning of Risk and Uncertainty

{
  "access_scope": "Original chapter transcription and website editorial note inspected, especially probability classification and the concluding distinction. No claim to inspect every chapter of the book.",
  "authors": [
    "Frank H. Knight"
  ],
  "dates": {
    "date": "1921 original; 2000 website edition",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "First-edition transcription, Library of Economics and Liberty",
    "version_note": "First-edition transcription, Library of Economics and Liberty"
  },
  "id": "knight::knight21-ch7",
  "title": "Risk, Uncertainty, and Profit, Part III Chapter VII: The Meaning of Risk and Uncertainty",
  "url": "https://www.econlib.org/library/Knight/knRUP.html?chapter_num=9"
}

Risk, Uncertainty, and Profit, Part III Chapter X: Enterprise and Profit (continued), The Salaried Manager

{
  "access_scope": "Original chapter text inspected for decision responsibility and the distinction between profit and insurable risk; website-edition metadata also inspected.",
  "authors": [
    "Frank H. Knight"
  ],
  "dates": {
    "date": "1921 original; 2000 website edition",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "First-edition transcription, Library of Economics and Liberty",
    "version_note": "First-edition transcription, Library of Economics and Liberty"
  },
  "id": "knight::knight21-ch10",
  "title": "Risk, Uncertainty, and Profit, Part III Chapter X: Enterprise and Profit (continued), The Salaried Manager",
  "url": "https://www.econlib.org/library/Knight/knRUP.html?chapter_num=12"
}

This is a theory of profit, not a guarantee that assuming uncertainty produces positive returns.

The inherited contested-boundary caution remains; do not erase it because the distinction is conceptually useful.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is a theory of profit, not a guarantee that assuming uncertainty produces positive returns.

The inherited contested-boundary caution remains; do not erase it because the distinction is conceptually useful.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1921
}

This is a theory of profit, not a guarantee that assuming uncertainty produces positive returns.

The inherited contested-boundary caution remains; do not erase it because the distinction is conceptually useful.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-book conceptual distinction

original-book explanatory mechanism

original-book theory of profit

original-book explicit boundary nuance

Organizational knowledge creation

Firms create knowledge by converting between tacit and explicit forms.

Links individual knowing, organizational processes and creation of new products and services.

The conversion model is debated as a theory.

Sources and details

The Knowledge-Creating Company: How Japanese Companies Create the Dynamics of Innovation

{
  "access_scope": "OUP bibliographic record and publisher abstract inspected; the 1995 book itself was not read.",
  "authors": [
    "Ikujiro Nonaka",
    "Hirotaka Takeuchi"
  ],
  "dates": {
    "date": "1995-05-18",
    "retrieval_date": "2026-10-07",
    "version": "1995 book; current Oxford Academic record"
  },
  "id": "knowledge-creation::org-nonaka-takeuchi-1995",
  "title": "The Knowledge-Creating Company: How Japanese Companies Create the Dynamics of Innovation",
  "url": "https://academic.oup.com/book/52097"
}

A Dynamic Theory of Organizational Knowledge Creation

{
  "access_scope": "Original Organization Science article in a University of Kentucky-hosted scan; selected pp. 14–15 and 19–20 inspected, including conversion and spiral sections; not the whole article or 1995 book.",
  "authors": [
    "Ikujiro Nonaka"
  ],
  "dates": {
    "date": "1994-02",
    "retrieval_date": "2026-10-07",
    "version": "Organization Science 5(1), pp. 14–37; JSTOR scan, University of Kentucky host"
  },
  "id": "knowledge-creation::org-nonaka-1994",
  "title": "A Dynamic Theory of Organizational Knowledge Creation",
  "url": "https://www.uky.edu/~gmswan3/EDC608/Nonaka_1994.pdf"
}

The conversion model is debated as a theory.

Keep both Nonaka and Takeuchi credited on the 1995 book; Takeuchi is not an author of the 1994 article.

Keep the prior OUP access history and its explicit abstract-only/no-diagram restrictions.

The conversion/spiral account is the author's theory, not proof of universal Japanese or organizational superiority.

Neither this research nor the supplementary article automatically clears the family's full mechanisms, bibliography or rights.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The conversion model is debated as a theory.

Keep both Nonaka and Takeuchi credited on the 1995 book; Takeuchi is not an author of the 1994 article.

Keep the prior OUP access history and its explicit abstract-only/no-diagram restrictions.

The conversion/spiral account is the author's theory, not proof of universal Japanese or organizational superiority.

Neither this research nor the supplementary article automatically clears the family's full mechanisms, bibliography or rights.

Dates

{
  "year": 1995
}

The conversion model is debated as a theory.

Keep both Nonaka and Takeuchi credited on the 1995 book; Takeuchi is not an author of the 1994 article.

Keep the prior OUP access history and its explicit abstract-only/no-diagram restrictions.

The conversion/spiral account is the author's theory, not proof of universal Japanese or organizational superiority.

Neither this research nor the supplementary article automatically clears the family's full mechanisms, bibliography or rights.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

The knowledge worker

Managers and knowledge workers, not manual labor, become central to the corporation's output.

Makes knowledge-intensive work and organizational purpose explicit in the atlas.

A management concept; productivity of knowledge work is hard to measure.

Sources and details

Knowledge-Worker Productivity: The Biggest Challenge

{
  "access_scope": "Original article text inspected at PDF pp. 6–7 (printed pp. 83–84), with article title and institutional record. Berkeley landing page says February 1999; keep that landing-page date discrepancy separate from the winter/January issue.",
  "authors": [
    "Peter F. Drucker"
  ],
  "dates": {
    "date": "Winter 1999; publisher issue January 1999",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "California Management Review 41(2), 79–94; DOI 10.2307/41165987; institutional-hosted article PDF",
    "version_note": "California Management Review 41(2), 79–94; DOI 10.2307/41165987; institutional-hosted article PDF"
  },
  "id": "knowledge-worker::drucker99-original",
  "title": "Knowledge-Worker Productivity: The Biggest Challenge",
  "url": "https://forschungsnetzwerk.ams.at/dam/jcr:28c80a09-cd84-4329-96fc-057e7c17be17/knowledge_workers_the_biggest_challenge.pdf"
}

The actual source is a 1999 article, not Concept of the Corporation (1946) or Landmarks of Tomorrow (1959); those original books remain uninspected in this pass.

These are management arguments, not causal estimates of productivity gains.

The baseline’s broad historical claim about the rise of knowledge work and its measurement caution remain untouched.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The actual source is a 1999 article, not Concept of the Corporation (1946) or Landmarks of Tomorrow (1959); those original books remain uninspected in this pass.

These are management arguments, not causal estimates of productivity gains.

The baseline’s broad historical claim about the rise of knowledge work and its measurement caution remain untouched.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1946
}

The actual source is a 1999 article, not Concept of the Corporation (1946) or Landmarks of Tomorrow (1959); those original books remain uninspected in this pass.

These are management arguments, not causal estimates of productivity gains.

The baseline’s broad historical claim about the rise of knowledge work and its measurement caution remain untouched.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-article management prescription

original-article quality/organizational mechanism

The learning organization

Systems thinking and shared mental models help organizations learn.

Connects shared aspiration, reflective conversation and systemic understanding of complexity.

Influential practitioner framework with limited causal evidence.

Sources and details

Peter M. Senge

{
  "access_scope": "MIT institutional profile: authorship, original 1990 publication and broad contribution only; not the book text.",
  "authors": [
    "MIT Sloan"
  ],
  "dates": {
    "date": null,
    "retrieval_date": "2026-10-07",
    "version": "Undated live page"
  },
  "id": "learning-organization::org-senge-mit-profile",
  "title": "Peter M. Senge",
  "url": "https://mitsloan.mit.edu/faculty/directory/peter-m-senge"
}

The Fifth Discipline: The Art and Practice of the Learning Organisation

{
  "access_scope": "Publisher-hosted sample of the 2025 reissue of the 2006 second edition; chapter 1, printed pp. 6–12 inspected directly, with p. 8 visually checked. This is not a reading of the 1990 edition or full book.",
  "authors": [
    "Peter M. Senge"
  ],
  "dates": {
    "date": "2025-09-04",
    "retrieval_date": "2026-10-07",
    "version": "Second edition (2006), Cornerstone Press 2025 reissue; ISBN 9781905211203; 48-page public sample"
  },
  "id": "learning-organization::org-senge-2025-sample",
  "title": "The Fifth Discipline: The Art and Practice of the Learning Organisation",
  "url": "https://cdn.penguin.co.uk/dam-assets/books/9781905211203/9781905211203-sample.pdf"
}

Influential practitioner framework with limited causal evidence.

Preserve original family/work year 1990; 2006 revision and 2025 reissue must not be silently backdated.

The text is a practitioner framework, not an independently verified causal evaluation.

No quantitative effectiveness, superiority or organizational-transformation guarantee is admitted.

The 2025 foreword and book-design credits belong to this manifestation; do not attribute them to the 1990 edition or merge them into Senge's chapter authorship.

Existing optional-draft/source-context/rights holds remain.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Influential practitioner framework with limited causal evidence.

Preserve original family/work year 1990; 2006 revision and 2025 reissue must not be silently backdated.

The text is a practitioner framework, not an independently verified causal evaluation.

No quantitative effectiveness, superiority or organizational-transformation guarantee is admitted.

The 2025 foreword and book-design credits belong to this manifestation; do not attribute them to the 1990 edition or merge them into Senge's chapter authorship.

Existing optional-draft/source-context/rights holds remain.

Dates

{
  "year": 1990
}

Influential practitioner framework with limited causal evidence.

Preserve original family/work year 1990; 2006 revision and 2025 reissue must not be silently backdated.

The text is a practitioner framework, not an independently verified causal evaluation.

No quantitative effectiveness, superiority or organizational-transformation guarantee is admitted.

The 2025 foreword and book-design credits belong to this manifestation; do not attribute them to the 1990 edition or merge them into Senge's chapter authorship.

Existing optional-draft/source-context/rights holds remain.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Technological evolution

Artificial minds and technological evolution are explored as comedy and as philosophy.

Combines philosophical speculation and fiction about intelligence beyond human assumptions.

A speculative argument; its premises and timelines require separate scrutiny.

Sources and details

The Cyberiad

{
  "access_scope": "Publisher synopsis of The Cyberiad’s constructor tales, not full translated text.",
  "dates": {
    "date": "1965 original retained; 2020-08-06 paperback",
    "retrieved_at": "2026-10-07",
    "version_note": "Penguin ISBN 9780241467992; current English publisher synopsis; translator credit not verified on this page."
  },
  "id": "lem::CYB",
  "title": "The Cyberiad",
  "url": "https://www.penguin.co.uk/books/256135/the-cyberiad-by-lem-stanislaw/9780241467992"
}

Summa Technologiae

{
  "access_scope": "Publisher/distributor description of the nonfiction Summa Technologiae; philosophical claims remain attributed to Lem.",
  "dates": {
    "date": "1964 original; inspected paperback dated 2014-01-01",
    "retrieved_at": "2026-10-07",
    "version_note": "University of Minnesota Press English translation distributed by UTP; ISBN 9780816675777. Do not replace original date with sales date."
  },
  "id": "lem::SUM",
  "title": "Summa Technologiae",
  "url": "https://utpdistribution.com/9780816675777/summa-technologiae/"
}

Grouped works retain different original dates, genres and manifestation bindings. No claim that this pairing documents influence.

Full Polish originals and full English translations were not inspected.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Grouped works retain different original dates, genres and manifestation bindings. No claim that this pairing documents influence.

Full Polish originals and full English translations were not inspected.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1964
}

Grouped works retain different original dates, genres and manifestation bindings. No claim that this pairing documents influence.

Full Polish originals and full English translations were not inspected.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Symbolic representation and languages

Symbolic expressions and recursive functions support machine processing of symbolic structures.

Symbolic structures can be represented and manipulated formally.

The infrastructure for representing knowledge shapes which systems can be built.

A language provides tools, not intelligence by itself.

Sources and details

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "John McCarthy"
  ],
  "dates": {
    "date": "1960-04",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted HTML transcription; section pages stamped 2006-08-13"
  },
  "id": "lisp::lisp-1960",
  "title": "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I",
  "url": "https://www-formal.stanford.edu/jmc/recursive/recursive.html"
}

McCarthy is the paper author, while the acknowledgments name a group that developed the LISP programming system.

The landing page’s 1998 date and section transcription’s 2006 date are hosting/transcription dates, not original publication.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

McCarthy is the paper author, while the acknowledgments name a group that developed the LISP programming system.

The landing page’s 1998 date and section transcription’s 2006 date are hosting/transcription dates, not original publication.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1960
}

McCarthy is the paper author, while the acknowledgments name a group that developed the LISP programming system.

The landing page’s 1998 date and section transcription’s 2006 date are hosting/transcription dates, not original publication.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I — Recursive Functions of Symbolic Expressions, node3.html, §a.

Inspected source scope: Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I — node3.html, §§c–d.

Inspected source scope: Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I — node3.html, §§e–f; node4.html §f.

Inspected source scope: Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I — The LISP Programming System, node4.html, §c.

A program that proves theorems

Heuristic search over symbolic expressions proved theorems from Principia Mathematica.

Core contributor to early reasoning programs.

Heuristic success in a narrow domain did not generalize readily.

Sources and details

Empirical Explorations of the Logic Theory Machine: A Case Study in Heuristic

{
  "access_scope": [
    "PDF pp. 1–6 (printed pp. 218–222 after cover)"
  ],
  "authors": [
    "A. Newell",
    "J. C. Shaw",
    "H. A. Simon"
  ],
  "dates": {
    "date": "1957-02",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Western Joint Computer Conference offprint excerpt, cover plus printed pp. 218–222; complete article extends beyond this file",
    "version_note": "Western Joint Computer Conference offprint excerpt, cover plus printed pp. 218–222; complete article extends beyond this file"
  },
  "id": "logic-theorist::logic-empirical-1957",
  "title": "Empirical Explorations of the Logic Theory Machine: A Case Study in Heuristic",
  "url": "https://iiif.library.cmu.edu/file/Newell_box00028_fld01976_doc0005/Newell_box00028_fld01976_doc0005.pdf"
}

The Logic Theory Machine: A Complex Information Processing System

{
  "access_scope": [
    "Cover and PDF pp. 2–8 (printed pp. 1–7), OCR plus page-image inspection"
  ],
  "authors": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "1956-07-12",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "RAND P-868, revised report",
    "version_note": "RAND P-868, revised report"
  },
  "id": "logic-theorist::logic-1956",
  "title": "The Logic Theory Machine: A Complex Information Processing System",
  "url": "https://bitsavers.org/pdf/rand/ipl/P-868_The_Logic_Theory_Machine_Jul56.pdf"
}

The 1956 two-author specification and 1957 three-author empirical paper are separate works; preserve Shaw’s role without rewriting either byline.

The accessible 1957 file stops at printed p. 222; no claim to have audited the rest or to verify the commonly quoted 38-of-52 total.

Numerical run times belong to the specified historical program and supplied theorem memory.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1956 two-author specification and 1957 three-author empirical paper are separate works; preserve Shaw’s role without rewriting either byline.

The accessible 1957 file stops at printed p. 222; no claim to have audited the rest or to verify the commonly quoted 38-of-52 total.

Numerical run times belong to the specified historical program and supplied theorem memory.

Dates

{
  "year": 1956
}

The 1956 two-author specification and 1957 three-author empirical paper are separate works; preserve Shaw’s role without rewriting either byline.

The accessible 1957 file stops at printed p. 222; no claim to have audited the rest or to verify the commonly quoted 38-of-52 total.

Numerical run times belong to the specified historical program and supplied theorem memory.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

Computer algebra

Symbolic mathematics became a reliable machine capability in a bounded domain.

Connects AI heuristics to mathematical discovery tools.

Exact within its domain; it does not generalize to open-ended reasoning.

Sources and details

The MACSYMA System

{
  "access_scope": [
    "PDF pp. 1–7 (printed pp. 59–65), summary, philosophy, overview and rational-function facilities"
  ],
  "authors": [
    "W. A. Martin",
    "R. J. Fateman"
  ],
  "dates": {
    "date": "1971-03-23",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "SYMSAC ’71 paper, printed pp. 59–75",
    "version_note": "SYMSAC ’71 paper, printed pp. 59–75"
  },
  "id": "macsyma::macsyma-1971",
  "title": "The MACSYMA System",
  "url": "https://groups.csail.mit.edu/mac/users/gjs/6.945/readings/simplification/martin-fateman-macsyma.pdf"
}

The MACSYMA system

{
  "access_scope": [
    "Publisher record indexed title/byline, pages and publication history"
  ],
  "authors": [
    "W. A. Martin",
    "R. J. Fateman"
  ],
  "dates": {
    "date": "1971-03-23",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "ACM SYMSAC ’71 publication record",
    "version_note": "ACM SYMSAC ’71 publication record"
  },
  "id": "macsyma::macsyma-acm-record",
  "title": "The MACSYMA system",
  "url": "https://doi.org/10.1145/800204.806267"
}

The original family’s Moses/Martin project credits stay intact; this added paper’s full byline is Martin/Fateman.

A system capability list does not establish universal exactness, autonomous mathematical discovery, or measured productivity gains.

The 1968 plotting year is editorial project chronology; it is not the 1971 paper’s publication date.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The original family’s Moses/Martin project credits stay intact; this added paper’s full byline is Martin/Fateman.

A system capability list does not establish universal exactness, autonomous mathematical discovery, or measured productivity gains.

The 1968 plotting year is editorial project chronology; it is not the 1971 paper’s publication date.

Dates

{
  "year": 1968
}

The original family’s Moses/Martin project credits stay intact; this added paper’s full byline is Martin/Fateman.

A system capability list does not establish universal exactness, autonomous mathematical discovery, or measured productivity gains.

The 1968 plotting year is editorial project chronology; it is not the 1971 paper’s publication date.

primary-source mechanism paraphrase

original worked example, not a general productivity measurement

source-stated limitation

Large-cluster data processing

A simple programming model let ordinary engineers process huge datasets across many machines.

Scalable data-processing infrastructure supporting data-intensive computing.

Batch-oriented; later systems addressed interactive and iterative workloads.

Sources and details

MapReduce: Simplified Data Processing on Large Clusters

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Jeffrey Dean",
    "Sanjay Ghemawat"
  ],
  "dates": {
    "date": "2004",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted 13-page prepublication PDF marked “To appear in OSDI 2004”; bibliography of the published OSDI 2004 paper: pp. 137–150. Locators refer to the inspected PDF."
  },
  "id": "mapreduce::mapreduce-2004",
  "title": "MapReduce: Simplified Data Processing on Large Clusters",
  "url": "https://storage.googleapis.com/gweb-research2023-media/pubtools/4449.pdf"
}

Use the 2004 OSDI manifestation, not the later CACM republication, unless explicitly rebound.

The paper does not establish universal suitability or the history of later interactive and iterative engines.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Use the 2004 OSDI manifestation, not the later CACM republication, unless explicitly rebound.

The paper does not establish universal suitability or the history of later interactive and iterative engines.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2004
}

Use the 2004 OSDI manifestation, not the later CACM republication, unless explicitly rebound.

The paper does not establish universal suitability or the history of later interactive and iterative engines.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: MapReduce: Simplified Data Processing on Large Clusters — §2, PDF p. 2.

Inspected source scope: MapReduce: Simplified Data Processing on Large Clusters — §3, PDF pp. 3–4.

Inspected source scope: MapReduce: Simplified Data Processing on Large Clusters — §3.3, PDF p. 4.

Inspected source scope: MapReduce: Simplified Data Processing on Large Clusters — §2.1, PDF p. 2.

Organizations as decision systems

Attention, communication and decision programs shape behavior under bounded rationality.

Information and cognitive capacity are limited.

AI may change search and attention allocation without removing organizational constraints.

More available information need not produce better decisions.

Sources and details

Organizations

{
  "access_scope": "Princeton institutional catalogue: 1958, John Wiley and Sons, and both authors; catalogue does not establish original chapter text.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "1958",
    "retrieval_date": "2026-10-07",
    "version": "1958"
  },
  "id": "march-simon::org-march-simon-catalog",
  "title": "Organizations",
  "url": "https://irs.princeton.edu/organizations"
}

Organizations, Chapter 6: Cognitive Limits on Rationality

{
  "access_scope": "Original chapter scan hosted at MIT: selected printed pp. 136–141 and 168–169 inspected through local OCR and substantive indexed text; not the whole 1958 book.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "1958",
    "retrieval_date": "2026-10-07",
    "version": "1958 first-edition Chapter 6, printed pp. 136–171; 18-page two-up scan"
  },
  "id": "march-simon::org-march-simon-ch6",
  "title": "Organizations, Chapter 6: Cognitive Limits on Rationality",
  "url": "https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Behavioral_Decision_Theory/March_&_Simon_Cognitive_Limits_on_Rationality_Ch6_in_Organizations.pdf"
}

Original John Wiley & Sons announcement for Organizations

{
  "access_scope": "Contemporaneous Wiley promotional leaflet retained in Carnegie Mellon's Simon archive; original publisher credit block on PDF p. 2 inspected. It is credit evidence, not chapter evidence.",
  "authors": [
    "John Wiley & Sons"
  ],
  "dates": {
    "date": "1958-10",
    "retrieval_date": "2026-10-07",
    "version": "October 1958 John Wiley & Sons promotional announcement, three-page archival scan."
  },
  "id": "march-simon::org-march-simon-wiley-announcement",
  "title": "Original John Wiley & Sons announcement for Organizations",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00077_fld06116_bdl0001_doc0001/Simon_box00077_fld06116_bdl0001_doc0001.pdf"
}

More available information need not produce better decisions.

Keep the limits on information and cognitive capacity and the existing warning that more information need not improve decisions.

Keep the AI-search/attention relevance as editorial application, not a claim made in 1958.

Do not represent selected chapter inspection as a full-book or full-bibliography audit.

The collaborator credit does not authorize adding a person identity or merging authorship records.

The development-draft/human-review hold remains.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

More available information need not produce better decisions.

Keep the limits on information and cognitive capacity and the existing warning that more information need not improve decisions.

Keep the AI-search/attention relevance as editorial application, not a claim made in 1958.

Do not represent selected chapter inspection as a full-book or full-bibliography audit.

The collaborator credit does not authorize adding a person identity or merging authorship records.

The development-draft/human-review hold remains.

Dates

{
  "year": 1958
}

More available information need not produce better decisions.

Keep the limits on information and cognitive capacity and the existing warning that more information need not improve decisions.

Keep the AI-search/attention relevance as editorial application, not a claim made in 1958.

Do not represent selected chapter inspection as a full-book or full-bibliography audit.

The collaborator credit does not authorize adding a person identity or merging authorship records.

The development-draft/human-review hold remains.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Levels of analysis

Understanding a system requires computational, algorithmic and implementation levels.

Separates computational goals, algorithms, and physical implementation.

A framework; much of its specific vision theory was later revised.

Sources and details

Vision: A Computational Investigation into the Human Representation and Processing of Visual Information

{
  "access_scope": [
    "PDF pp. 1, 4–5 and 44–52; chapter 1 §1.2, printed pp. 19–27"
  ],
  "authors": [
    "David Marr"
  ],
  "dates": {
    "date": "2010-07-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "MIT Press 2010 reprint of the 1982 W. H. Freeman book; paperback ISBN 9780262514620 shown in file",
    "version_note": "MIT Press 2010 reprint of the 1982 W. H. Freeman book; paperback ISBN 9780262514620 shown in file"
  },
  "id": "marr-vision::marr-1982",
  "title": "Vision: A Computational Investigation into the Human Representation and Processing of Visual Information",
  "url": "https://people.ciirc.cvut.cz/~hlavac/pub/MiscTextForStudents/1982MarrDavidVisionBook.pdf"
}

Vision: A Computational Investigation into the Human Representation and Processing of Visual Information

{
  "access_scope": [
    "Publisher byline, credits, ISBNs and dates"
  ],
  "authors": [
    "David Marr"
  ],
  "dates": {
    "date": "2010-07-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "MIT Press 2010 ebook/paperback record",
    "version_note": "MIT Press 2010 ebook/paperback record"
  },
  "id": "marr-vision::marr-publisher-record",
  "title": "Vision: A Computational Investigation into the Human Representation and Processing of Visual Information",
  "url": "https://mitpress.mit.edu/9780262288989/vision/"
}

Filename notwithstanding, the inspected PDF is the 2010 reprint; the original 1982 manifestation was not separately audited.

Book foreword and afterword authors are not coauthors of Marr’s chapter.

No general causal-influence or current neuroscience-validity claim is admitted; baseline’s broad later-revision statement remains a separate hold.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Filename notwithstanding, the inspected PDF is the 2010 reprint; the original 1982 manifestation was not separately audited.

Book foreword and afterword authors are not coauthors of Marr’s chapter.

No general causal-influence or current neuroscience-validity claim is admitted; baseline’s broad later-revision statement remains a separate hold.

Dates

{
  "year": 1982
}

Filename notwithstanding, the inspected PDF is the 2010 reprint; the original 1982 manifestation was not separately audited.

Book foreword and afterword authors are not coauthors of Marr’s chapter.

No general causal-influence or current neuroscience-validity claim is admitted; baseline’s broad later-revision statement remains a separate hold.

theoretical or conceptual proposition

author’s historical example within the original book text

Mechanistic and organic organizations

Stable conditions suit hierarchical forms; changing technology suits fluid, organic forms.

Explains why effective coordination structures depend on uncertainty and innovation conditions.

A typology; most firms mix both.

Sources and details

The Management of Innovation (original text excerpt in “Burns and Stalker, The Management of Innovation”)

{
  "access_scope": "Publisher-indexed original-text excerpt, printed pp. 103–106 inspected via public indexed text; direct PDF fetch 403. The excerpt explicitly says reprinted with permission from the 1961 Tavistock work. No anthology commentary is treated as original Burns–Stalker text.",
  "authors": [
    "Tom Burns",
    "G. M. Stalker"
  ],
  "dates": {
    "date": "1961 original; anthology released October 2008, copyright 2009 catalogue date",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Theories of Organization, chapter 8, printed pp. 103–108, Henry L. Tosi anthology, SAGE",
    "version_note": "Theories of Organization, chapter 8, printed pp. 103–108, Henry L. Tosi anthology, SAGE"
  },
  "id": "mechanistic-organic::burns-stalker61-sage-excerpt",
  "title": "The Management of Innovation (original text excerpt in “Burns and Stalker, The Management of Innovation”)",
  "url": "https://us.sagepub.com/sites/default/files/upm-binaries/27412_8.pdf"
}

The Management of Innovation

{
  "access_scope": "Publisher book abstract, complete byline/date and table of contents directly inspected; book body not accessed.",
  "authors": [
    "Tom Burns",
    "G. M. Stalker"
  ],
  "dates": {
    "date": "1994-10-13; first publication 1961",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Oxford University Press edition; DOI 10.1093/acprof:oso/9780198288787.001.0001",
    "version_note": "Oxford University Press edition; DOI 10.1093/acprof:oso/9780198288787.001.0001"
  },
  "id": "mechanistic-organic::burns-stalker94-publisher",
  "title": "The Management of Innovation",
  "url": "https://academic.oup.com/book/4968"
}

Theories of Organization

{
  "access_scope": "Publisher metadata and contents inspected to identify the host anthology; no original-mechanism clearance from this marketing page.",
  "authors": [
    "Henry L. Tosi"
  ],
  "dates": {
    "date": "October 2008 publisher release; 2009 copyright in catalogue",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "SAGE US; chapter 8 identified in contents",
    "version_note": "SAGE US; chapter 8 identified in contents"
  },
  "id": "mechanistic-organic::tosi-anthology-metadata",
  "title": "Theories of Organization",
  "url": "https://www.sagepub.com/shop/buy-a-book/theories-of-organization-1-228099"
}

The baseline’s statement that firms mix both forms remains; the limited excerpt must not turn ideal types into two exclusive empirical boxes.

1961 original, 1994 OUP edition and 2008/2009 anthology manifestation retain distinct dates.

Direct full-book access remains unavailable; scope is original excerpt plus publisher abstract, not a full-book audit.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The baseline’s statement that firms mix both forms remains; the limited excerpt must not turn ideal types into two exclusive empirical boxes.

1961 original, 1994 OUP edition and 2008/2009 anthology manifestation retain distinct dates.

Direct full-book access remains unavailable; scope is original excerpt plus publisher abstract, not a full-book audit.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Dates

{
  "year": 1961
}

The baseline’s statement that firms mix both forms remains; the limited excerpt must not turn ideal types into two exclusive empirical boxes.

1961 original, 1994 OUP edition and 2008/2009 anthology manifestation retain distinct dates.

Direct full-book access remains unavailable; scope is original excerpt plus publisher abstract, not a full-book audit.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

licensed original-text theoretical contingency

licensed original-text typology

licensed original-text coordination mechanism

licensed original-text explicit qualification

Attention is also a memory problem

Tiling exact attention can reduce transfers between GPU memory levels and improve performance on the tested workloads.

Data movement is a meaningful bottleneck and the implementation fits the hardware.

Arithmetic count misses the cost of moving intermediate values. The method reorganizes exact attention around SRAM and HBM rather than approximating its result.

AI cost depends on systems engineering as well as parameter counts.

Before buying more GPUs, profile memory traffic and utilization; compare the same task and numerical requirements.

Reported speedups depend on sequence length, workload and hardware; this is not a universal cost reduction.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Tri Dao",
    "Daniel Y. Fu",
    "Stefano Ermon",
    "Atri Rudra",
    "Christopher Ré"
  ],
  "dates": {
    "date": "2022-06-23",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2; PDF internal date June 24, 2022; first submission May 27, 2022"
  },
  "id": "memory-io::flashattention-v2",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/pdf/2205.14135v2"
}

Do not silently import FlashAttention-2/3 results. The block-sparse extension is approximate and distinct from the exact algorithm discussed here.

The PDF’s printed date differs by one day from the repository submission; record both rather than silently equating them.

Retain the original record hardware, workload, sequence-length and profiling caveats.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Do not silently import FlashAttention-2/3 results. The block-sparse extension is approximate and distinct from the exact algorithm discussed here.

The PDF’s printed date differs by one day from the repository submission; record both rather than silently equating them.

Retain the original record hardware, workload, sequence-length and profiling caveats.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2022
}

Do not silently import FlashAttention-2/3 results. The block-sparse extension is approximate and distinct from the exact algorithm discussed here.

The PDF’s printed date differs by one day from the repository submission; record both rather than silently equating them.

Retain the baseline hardware, workload, sequence-length and profiling caveats.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness — §3.1, Algorithm 1, PDF pp. 4–5.

Inspected source scope: FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness — §3.1, Recomputation, PDF pp. 4–5.

Inspected source scope: FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness — §3.1, Theorem 1, PDF p. 5.

Inspected source scope: FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness — §4.1, Table 1, PDF p. 7.

Learning with matchboxes

A matchbox machine learned noughts and crosses by reinforcing successful moves.

Makes trial-and-error learning mechanically explicit.

A teaching demonstration of reinforcement, not a scalable method.

Sources and details

Experiments on the Mechanization of Game-Learning. Part I. Characterization of the Model and its Parameters

{
  "access_scope": [
    "PDF pp. 1–5; printed pp. 232–236, article text and experiment captions"
  ],
  "authors": [
    "Donald Michie"
  ],
  "dates": {
    "date": "1963-11",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "The Computer Journal 6(3), pp. 232–236",
    "version_note": "The Computer Journal 6(3), pp. 232–236"
  },
  "id": "menace::menace-1963",
  "title": "Experiments on the Mechanization of Game-Learning. Part I. Characterization of the Model and its Parameters",
  "url": "https://people.csail.mit.edu/brooks/idocs/matchbox.pdf"
}

The Computer Journal, Volume 6, Issue 3

{
  "access_scope": [
    "Publisher indexed issue heading"
  ],
  "dates": {
    "date": "1963-11",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Publisher issue table of contents",
    "version_note": "Publisher issue table of contents"
  },
  "id": "menace::menace-journal-issue",
  "title": "The Computer Journal, Volume 6, Issue 3",
  "url": "https://academic.oup.com/comjnl/issue/6/3?browseBy=volume"
}

Original article says 287 essentially distinct positions, not the commonly repeated later 304 count.

Mechanical and computer learning curves cannot be compared directly because reinforcement rules and opponents differed.

The 1961 origin and 1963 journal report are distinct dates; do not silently date this article 1961.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Original article says 287 essentially distinct positions, not the commonly repeated later 304 count.

Mechanical and computer learning curves cannot be compared directly because reinforcement rules and opponents differed.

The 1961 origin and 1963 journal report are distinct dates; do not silently date this article 1961.

Dates

{
  "year": 1961
}

Original article says 287 essentially distinct positions, not the commonly repeated later 304 count.

Mechanical and computer learning curves cannot be compared directly because reinforcement rules and opponents differed.

The 1961 origin and 1963 journal report are distinct dates; do not silently date this article 1961.

primary-source mechanism paraphrase

source-stated limitation

The microprocessor

A whole central processor on one chip made computation cheap enough to embed widely.

Team contributor to the commercial microprocessor transition.

Credit is shared among designers and with Busicom's specification.

Sources and details

MCS-4 Micro Computer Set Users Manual

{
  "access_scope": [
    "Cover visually checked; PDF pp. 2, 5–8 (printed pp. 1–4), OCR and selected page images"
  ],
  "authors": [
    "Intel Corporation"
  ],
  "dates": {
    "date": "1973-02",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Revision 4, February 1973; original vendor manual",
    "version_note": "Revision 4, February 1973; original vendor manual"
  },
  "id": "microprocessor::intel-1973",
  "title": "MCS-4 Micro Computer Set Users Manual",
  "url": "https://user.eng.umd.edu/~yavuz/teaching/courses/enee350/lectures/MCS-4_UsersManual_Feb73.pdf"
}

Masatoshi Shima

{
  "access_scope": [
    "Profile body, paragraphs on Busicom and 4004 development"
  ],
  "dates": {
    "date": "undated; 2009 Fellow designation",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Computer History Museum biographical profile",
    "version_note": "Computer History Museum biographical profile"
  },
  "id": "microprocessor::microprocessor-credit",
  "title": "Masatoshi Shima",
  "url": "https://computerhistory.org/profile/masatoshi-shima/"
}

1971: Microprocessor Integrates CPU Function onto a Single Chip

{
  "access_scope": [
    "Main historical account, Intel paragraph"
  ],
  "dates": {
    "date": "undated; historical event 1971",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Computer History Museum Silicon Engine retrospective",
    "version_note": "Computer History Museum Silicon Engine retrospective"
  },
  "id": "microprocessor::microprocessor-timeline",
  "title": "1971: Microprocessor Integrates CPU Function onto a Single Chip",
  "url": "https://www.computerhistory.org/siliconengine/microprocessor-integrates-cpu-function-onto-a-single-chip/"
}

1973 Rev. 4 specifications must not be described as a verbatim 1971 launch datasheet.

Preserve shared credit among Federico Faggin, Marcian E. “Ted” Hoff, Stanley Mazor and Masatoshi Shima and Busicom’s specifications; the manufacturer manual does not supply those biographies.

Vendor application and economy claims are not independent measurements of economy-wide adoption or cost reductions.

1971 datasheet retrieval was unsuccessful; no inspected-source claim for that distinct document.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

1973 Rev. 4 specifications must not be described as a verbatim 1971 launch datasheet.

Preserve shared credit among Federico Faggin, Marcian E. “Ted” Hoff, Stanley Mazor and Masatoshi Shima and Busicom’s specifications; the manufacturer manual does not supply those biographies.

Vendor application and economy claims are not independent measurements of economy-wide adoption or cost reductions.

1971 datasheet retrieval was unsuccessful; no inspected-source claim for that distinct document.

Dates

{
  "year": 1971
}

1973 Rev. 4 specifications must not be described as a verbatim 1971 launch datasheet.

Preserve shared credit among Federico Faggin, Marcian E. “Ted” Hoff, Stanley Mazor and Masatoshi Shima and Busicom’s specifications; the manufacturer manual does not supply those biographies.

Vendor application and economy claims are not independent measurements of economy-wide adoption or cost reductions.

1971 datasheet retrieval was unsuccessful; no inspected-source claim for that distinct document.

primary-source mechanism paraphrase

source-stated limitation

The MOS transistor

A transistor design suited to dense, low-power integration became the basis of modern chips.

MOS transistors became foundational components of integrated digital circuitry.

Device physics alone did not determine its industrial adoption.

Sources and details

Electric Field Controlled Semiconductor Device

{
  "access_scope": [
    "PDF pp. 1–3; printed patent front drawing and columns 1–4"
  ],
  "authors": [
    "Dawon Kahng"
  ],
  "dates": {
    "date": "1963-08-27",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "US Patent 3,102,230; filed May 31, 1960",
    "version_note": "US Patent 3,102,230; filed May 31, 1960"
  },
  "id": "mosfet::mos-patent",
  "title": "Electric Field Controlled Semiconductor Device",
  "url": "https://patentimages.storage.googleapis.com/8c/18/90/4fbadebd183ee7/US3102230.pdf"
}

1960: Metal Oxide Semiconductor (MOS) Transistor Demonstrated

{
  "access_scope": [
    "Main body and contemporary source list"
  ],
  "dates": {
    "date": "undated; historical event 1959–1960",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Computer History Museum Silicon Engine account",
    "version_note": "Computer History Museum Silicon Engine account"
  },
  "id": "mosfet::mos-history",
  "title": "1960: Metal Oxide Semiconductor (MOS) Transistor Demonstrated",
  "url": "https://www.computerhistory.org/siliconengine/metal-oxide-semiconductor-mos-transistor-demonstrated/"
}

Kahng’s 1963 circuit patent is a supplemental source, not a replacement for the 1959/1960 device-development history.

Do not infer sole invention credit from the patent byline; retain Atalla and Kahng’s separate contributions and later integration work.

Dense low-power modern circuitry and industrial adoption require additional evidence beyond this device patent.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Kahng’s 1963 circuit patent is a supplemental source, not a replacement for the 1959/1960 device-development history.

Do not infer sole invention credit from the patent byline; retain Atalla and Kahng’s separate contributions and later integration work.

Dense low-power modern circuitry and industrial adoption require additional evidence beyond this device patent.

Dates

{
  "year": 1959
}

Kahng’s 1963 circuit patent is a supplemental source, not a replacement for the 1959/1960 device-development history.

Do not infer sole invention credit from the patent byline; retain Atalla and Kahng’s separate contributions and later integration work.

Dense low-power modern circuitry and industrial adoption require additional evidence beyond this device patent.

primary-source mechanism paraphrase

patent-described operating mode, not independent performance validation

source-stated credit plus explicit documentary-scope boundary

The Murderbot Diaries

A security construct overrides its governor and chooses how to relate to people.

Fictional treatment of autonomy, coercion and artificial personhood.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

All Systems Red, authorized chapter-one excerpt

{
  "access_scope": "Original chapter-one excerpt, rescue sequence and concealment of hacked governor; not the complete novella or series.",
  "dates": {
    "date": "2017",
    "retrieved_at": "2026-10-07",
    "version_note": "Copyright 2017 Martha Wells; Tom Doherty Associates-authorized excerpt, ISBN 9780765397539. The retail excerpt header also lists Lee Harris without a role; that header alone does not establish coauthorship or a verified creative role for Harris."
  },
  "id": "murderbot::MUX",
  "title": "All Systems Red, authorized chapter-one excerpt",
  "url": "https://www.abebooks.com/9780765397539/Systems-Red-Murderbot-Diaries-%231-0765397536/plp"
}

The primary-text example is All Systems Red (2017), not a claim covering every series installment.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The primary-text example is All Systems Red (2017), not a claim covering every series installment.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2017
}

The primary-text example is All Systems Red (2017), not a claim covering every series installment.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Equilibrium in non-cooperative games

Each player's strategy is a best response to the others; refinements handle information and credibility.

Provides formal tools for strategic interdependence among decision makers.

Multiple equilibria limit prediction.

Sources and details

Non-Cooperative Games

{
  "access_scope": "Original journal scan visually inspected at PDF pp. 2–3 and 6 (printed pp. 286–287 and 290); first-page theorem statement, equilibrium definition and distinction between equilibrium points and solution concepts. Full proof audit not claimed.",
  "authors": [
    "John Nash"
  ],
  "dates": {
    "date": "September 1951; received 1950-10-11",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Annals of Mathematics 54(2), 286–295; DOI 10.2307/1969529; university-hosted journal scan",
    "version_note": "Annals of Mathematics 54(2), 286–295; DOI 10.2307/1969529; university-hosted journal scan"
  },
  "id": "nash-equilibrium::nash51-original",
  "title": "Non-Cooperative Games",
  "url": "https://cs.uwaterloo.ca/~klarson/teaching/F04-886/papers/nash51.pdf"
}

Press Release—The Royal Swedish Academy of Sciences

{
  "access_scope": "Official prize-release text reprinted in a publisher sample; PDF pp. 2–4 (printed pp. 1–3) directly inspected. Official historical summary, not Harsanyi’s or Selten’s original papers.",
  "authors": [
    "The Royal Swedish Academy of Sciences"
  ],
  "dates": {
    "date": "1994-10-11 original; 2001 reprint",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "The Essential John Nash, chapter 1, pp. 1–3; Princeton University Press sample",
    "version_note": "The Essential John Nash, chapter 1, pp. 1–3; Princeton University Press sample"
  },
  "id": "nash-equilibrium::nobel94-princeton-reprint",
  "title": "Press Release—The Royal Swedish Academy of Sciences",
  "url": "https://assets.press.princeton.edu/chapters/s1_7238.pdf"
}

John Nash is the sole author of the inspected 1951 paper; Harsanyi and Selten are separate contributors to the family, not its coauthors.

The Harsanyi/Selten primary papers and full refinement assumptions are still uninspected; official-summary evidence cannot clear those original works.

The 1950 dissertation, 1950 PNAS note, 1951 article and 1994 prize release are distinct objects.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

John Nash is the sole author of the inspected 1951 paper; Harsanyi and Selten are separate contributors to the family, not its coauthors.

The Harsanyi/Selten primary papers and full refinement assumptions are still uninspected; official-summary evidence cannot clear those original works.

The 1950 dissertation, 1950 PNAS note, 1951 article and 1994 prize release are distinct objects.

Optional-family curation, historical influence, broader identity/rights clearance remain unverified beyond the cited sources.

A source-scoped candidate does not clear every work in a composite original record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1950
}

John Nash is the sole author of the inspected 1951 paper; Harsanyi and Selten are separate contributors to the family, not its coauthors.

The Harsanyi/Selten primary papers and full refinement assumptions are still uninspected; official-summary evidence cannot clear those original works.

The 1950 dissertation, 1950 PNAS note, 1951 article and 1994 prize release are distinct objects.

Optional-family curation, historical influence, broader identity/rights clearance, and consumer installation remain unapproved.

A source-scoped candidate does not clear every work in a composite baseline record.

Inherited relevance and applications remain editorial, not measured effects or documented causal influence.

original-paper definition

original-paper result plus explicit existence-versus-uniqueness implication

attributed official historical summary, not original later-paper clearance

editorial work-identity separation and inherited predictive caution grounded in the specified sources

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Routines, search and selection

Routines, search and selection explain how firms and technologies change over time.

Organizations use learned routines rather than constantly optimizing from scratch.

AI adoption changes routines through experimentation and learning, not only purchase decisions.

Routines can preserve both useful knowledge and maladaptive behavior.

Sources and details

An Evolutionary Theory of Economic Change

{
  "access_scope": "Baseline publisher link checked; web tool returned no substantive publisher text. No mechanism or bibliography claim is newly admitted from this page.",
  "authors": [
    "Richard R. Nelson",
    "Sidney G. Winter"
  ],
  "dates": {
    "date": "1982",
    "retrieval_date": "2026-10-07",
    "version": "Baseline publisher listing; body unavailable to this retrieval"
  },
  "id": "nelson-winter::org-nelson-winter-publisher",
  "title": "An Evolutionary Theory of Economic Change",
  "url": "https://www.hup.harvard.edu/books/9780674272286"
}

An Evolutionary Theory of Economic Change

{
  "access_scope": "Original 1982 book scan hosted by INCT-PPED: title/copyright and selected sections on printed pp. 99–107 and 400–401 inspected; not all 452 PDF pages.",
  "authors": [
    "Richard R. Nelson",
    "Sidney G. Winter"
  ],
  "dates": {
    "date": "1982",
    "retrieval_date": "2026-10-07",
    "version": "1982 Belknap Press book; institutional-hosted scan, 452 PDF pages"
  },
  "id": "nelson-winter::org-nelson-winter-1982",
  "title": "An Evolutionary Theory of Economic Change",
  "url": "https://www.inctpped.org/spiderweb/pdf_2/Dosi_1_An_evolutionary-theory-of_economic_change..pdf"
}

Routines can preserve both useful knowledge and maladaptive behavior.

Original publication year 1982 is retained; no later summary is merged into the book binding.

The evolutionary account is a theoretical explanation, not a claim that every surviving firm optimizes or every routine is beneficial.

Preserve the existing warning about maladaptive behavior, and human source/interpretation review status.

Selection is described through differential expansion and contraction, not an automatic or instantaneous best-firm-wins rule.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Routines can preserve both useful knowledge and maladaptive behavior.

Original publication year 1982 is retained; no later summary is merged into the book binding.

The evolutionary account is a theoretical explanation, not a claim that every surviving firm optimizes or every routine is beneficial.

Preserve the existing warning about maladaptive behavior, and human source/interpretation review status.

Selection is described through differential expansion and contraction, not an automatic or instantaneous best-firm-wins rule.

Dates

{
  "year": 1982
}

Routines can preserve both useful knowledge and maladaptive behavior.

Original publication year 1982 is retained; no later summary is merged into the book binding.

The evolutionary account is a theoretical explanation, not a claim that every surviving firm optimizes or every routine is beneficial.

Preserve the existing warning about maladaptive behavior, and human source/interpretation review status.

Selection is described through differential expansion and contraction, not an automatic or instantaneous best-firm-wins rule.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Networks and compatibility

Network size, expectations and compatibility can change competition and consumer choices.

The value of adoption depends in part on other users or complementary systems.

AI ecosystems may gain value from complements and user networks; model quality is a separate mechanism.

Network effects vary by product and can be weakened by interoperability.

Sources and details

Network Externalities, Competition, and Compatibility

{
  "access_scope": "Original AER article text on Carl Shapiro’s author-upload page, introduction and sections I.C and III inspected; equations/proofs not fully audited.",
  "authors": [
    "Michael L. Katz",
    "Carl Shapiro"
  ],
  "dates": {
    "date": "June 1985",
    "retrieval_date": "2026-10-07",
    "version": "1985"
  },
  "id": "network-effects::network-effects-original",
  "title": "Network Externalities, Competition, and Compatibility",
  "url": "https://www.researchgate.net/publication/4723878_Network_Externalities_Competition_and_Compatibility"
}

These are conditional oligopoly-model results, not universal laws of platform dominance or empirical AI claims.

Do not treat interoperability as necessarily destroying the network externality itself.

Do not use ResearchGate’s February header as original publication month; the scan gives June 1985.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

These are conditional oligopoly-model results, not universal laws of platform dominance or empirical AI claims.

Do not treat interoperability as necessarily destroying the network externality itself.

Do not use ResearchGate’s February header as original publication month; the scan gives June 1985.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1985
}

These are conditional oligopoly-model results, not universal laws of platform dominance or empirical AI claims.

Do not treat interoperability as necessarily destroying the network externality itself.

Do not use ResearchGate’s February header as original publication month; the scan gives June 1985.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

Language understanding in small worlds

Programs answered questions and followed commands in restricted domains using grammar and semantics.

Integrated language with reasoning and action.

Success depended on a closed world; it did not scale to open language.

Sources and details

Procedures as a Representation for Data in a Computer Program for Understanding Natural Language

{
  "access_scope": [
    "MIT repository title, author, issue date, abstract; journal abstract also compared"
  ],
  "authors": [
    "Terry Winograd"
  ],
  "dates": {
    "date": "1971",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "MIT AI Technical Report 235 repository abstract; original PDF not retrieved",
    "version_note": "MIT AI Technical Report 235 repository abstract; original PDF not retrieved"
  },
  "id": "nl-understanding::shrdlu-abstract",
  "title": "Procedures as a Representation for Data in a Computer Program for Understanding Natural Language",
  "url": "https://dspace.mit.edu/handle/1721.1/7095"
}

ACL Lifetime Achievement Award: The Right Tools: Reflections on Computation and Language

{
  "access_scope": [
    "PDF pp. 1–3; printed pp. 601–603, §1.1"
  ],
  "authors": [
    "William A. Woods"
  ],
  "dates": {
    "date": "2010-12",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Computational Linguistics 36(4), extended version of July 13, 2010 award talk",
    "version_note": "Computational Linguistics 36(4), extended version of July 13, 2010 award talk"
  },
  "id": "nl-understanding::woods-2010",
  "title": "ACL Lifetime Achievement Award: The Right Tools: Reflections on Computation and Language",
  "url": "https://aclanthology.org/J10-4002.pdf"
}

Understanding natural language

{
  "access_scope": [
    "Publisher date, byline and abstract"
  ],
  "authors": [
    "Terry Winograd"
  ],
  "dates": {
    "date": "1972-01",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Cognitive Psychology 3(1), pp. 1–191; journal abstract",
    "version_note": "Cognitive Psychology 3(1), pp. 1–191; journal abstract"
  },
  "id": "nl-understanding::shrdlu-journal-record",
  "title": "Understanding natural language",
  "url": "https://www.sciencedirect.com/science/article/pii/0010028572900023"
}

ACL Lifetime Achievement Award: The Right Tools: Reflections on Computation and Language

{
  "access_scope": [
    "Author, journal, volume and date metadata"
  ],
  "authors": [
    "William A. Woods"
  ],
  "dates": {
    "date": "2010-12",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "ACL Anthology journal record",
    "version_note": "ACL Anthology journal record"
  },
  "id": "nl-understanding::woods-acl-record",
  "title": "ACL Lifetime Achievement Award: The Right Tools: Reflections on Computation and Language",
  "url": "https://aclanthology.org/J10-4002/"
}

SHRDLU thesis fulltext retrieval returned HTTP 405; only its primary repository abstract was inspected.

LUNAR’s 1972 Woods/Kaplan/Nash-Webber report and 1973 Woods article have not been fulltext-audited; the 2010 retrospective cannot clear them.

SHRDLU and LUNAR are distinct systems, authorships and works; no combined original-work identity.

Baseline’s absolute “did not scale” is preserved but not newly proven by these bounded sources.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

SHRDLU thesis fulltext retrieval returned HTTP 405; only its primary repository abstract was inspected.

LUNAR’s 1972 Woods/Kaplan/Nash-Webber report and 1973 Woods article have not been fulltext-audited; the 2010 retrospective cannot clear them.

SHRDLU and LUNAR are distinct systems, authorships and works; no combined original-work identity.

Baseline’s absolute “did not scale” is preserved but not newly proven by these bounded sources.

Dates

{
  "year": 1970
}

SHRDLU thesis fulltext retrieval returned HTTP 405; only its primary repository abstract was inspected.

LUNAR’s 1972 Woods/Kaplan/Nash-Webber report and 1973 Woods article have not been fulltext-audited; the 2010 retrospective cannot clear them.

SHRDLU and LUNAR are distinct systems, authorships and works; no combined original-work identity.

Baseline’s absolute “did not scale” is preserved but not newly proven by these bounded sources.

original-work abstract paraphrase only

explicitly attributed first-person retrospective

bounded synthesis of abstract scope and retrospective failures

Augmented collaboration

A team demonstrated the mouse, hypertext and networked collaboration as tools for group work.

Explicitly pursued computers as tools for augmenting human intellect.

A demonstration; organizational adoption took decades.

Sources and details

A Research Center for Augmenting Human Intellect

{
  "access_scope": [
    "PDF pp. 1–4, 15; printed pp. 395–398, 409; §§1–3c and 5c3f"
  ],
  "authors": [
    "Douglas C. Engelbart",
    "William K. English"
  ],
  "dates": {
    "date": "1968-12",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "AFIPS Fall Joint Computer Conference, vol. 33, pp. 395–410; author-institute archived reprint",
    "version_note": "AFIPS Fall Joint Computer Conference, vol. 33, pp. 395–410; author-institute archived reprint"
  },
  "id": "nls::nls-1968",
  "title": "A Research Center for Augmenting Human Intellect",
  "url": "https://dougengelbart.org/pubs/papers/scanned-original/1968-augment-3954-A-Research-Center-for-Augmenting-Human-Intellect.pdf"
}

NLS’s live demonstration date, complete demonstration-team credits and particular video sequences are not independently audited by this paper excerpt.

The paper is a research-system report, not evidence for a decades-long organizational-adoption claim.

Authorship of this two-author paper does not exhaust the broader team’s design and demonstration credit.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

NLS’s live demonstration date, complete demonstration-team credits and particular video sequences are not independently audited by this paper excerpt.

The paper is a research-system report, not evidence for a decades-long organizational-adoption claim.

Authorship of this two-author paper does not exhaust the broader team’s design and demonstration credit.

Dates

{
  "year": 1968
}

NLS’s live demonstration date, complete demonstration-team credits and particular video sequences are not independently audited by this paper excerpt.

The paper is a research-system report, not evidence for a decades-long organizational-adoption claim.

Authorship of this two-author paper does not exhaust the broader team’s design and demonstration credit.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated experimental design and intended use

A hostile machine

A military AI destroys humanity and torments the survivors.

Influential cautionary fiction about machine power.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

I Have No Mouth, and I Must Scream

{
  "access_scope": "Publisher synopsis of the title story in the listed 2026 edition; new foreword and additional essays are not used.",
  "dates": {
    "date": "1967 original retained; 2026-09-01 listed edition",
    "retrieved_at": "2026-10-07",
    "version_note": "Union Square & Co. ISBN 9781454969280, 144 pages; page still labels preorder despite displayed past sale date, so actual release status not independently confirmed."
  },
  "id": "no-mouth::MOUTH",
  "title": "I Have No Mouth, and I Must Scream",
  "url": "https://www.hachettebookgroup.com/titles/harlan-ellison/i-have-no-mouth-and-i-must-scream/9781454969280/"
}

The original 1967 story edition and ending were not inspected. The 1995 game and 2026 supplemental material are excluded.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The original 1967 story edition and ending were not inspected. The 1995 game and 2026 supplemental material are excluded.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1967
}

The original 1967 story edition and ending were not inspected. The 1995 game and 2026 supplemental material are excluded.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

No Woman Born

A dancer survives in a robotic body, raising questions of identity and capability.

Early literary examination of identity and agency across biological and artificial embodiment.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

No Woman Born

{
  "access_scope": "Original story text reproduced on a third-party host: inspected opening, brain/body explanation, performance conflict and ending; exact original magazine collation pending.",
  "dates": {
    "date": "Undated reproduction of baseline 1944 story; exact manifestation held",
    "retrieved_at": "2026-10-07",
    "version_note": "Unversioned 34-page textual reproduction, title/byline present; source edition and pagination provenance unverified. Baseline 1944 first-publication date is not independently cleared by this mirror."
  },
  "id": "no-woman-born::NOW",
  "title": "No Woman Born",
  "url": "https://hell.pl/agnus/anglistyka/2211/C.%20L.%20Moore%20-%20No%20Woman%20Born.pdf"
}

Exact original magazine manifestation remains held: the accessible primary-text reproduction has no verified edition/date. Archive.org original issue retrieval failed.

Retain baseline December 1944 attribution provisionally; do not present this mirror as a verified original 1944 scan.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Exact original magazine manifestation remains held: the accessible primary-text reproduction has no verified edition/date. Archive.org original issue retrieval failed.

Retain baseline December 1944 attribution provisionally; do not present this mirror as a verified original 1944 scan.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1944
}

Exact original magazine manifestation remains held: the accessible primary-text reproduction has no verified edition/date. Archive.org original issue retrieval failed.

Retain baseline December 1944 attribution provisionally; do not present this mirror as a verified original 1944 scan.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Institutions and incentives

Formal rules and informal constraints shape incentives and long-run economic performance.

Rules and enforcement affect the cost and feasibility of exchange.

AI adoption interacts with contracts, liability, standards and organizational norms.

Technological progress does not mechanically produce institutional improvement.

Sources and details

Institutions, Institutional Change and Economic Performance — Chapter 6: Formal constraints

{
  "access_scope": "Cambridge public chapter summary/extract, not full chapter; formal/informal constraints passage inspected.",
  "authors": [
    "Douglass C. North"
  ],
  "dates": {
    "date": "1990 print; 2012-06-05 online",
    "retrieval_date": "2026-10-07",
    "version": "1990 print work, Cambridge chapter summary/extract published online 2012-06-05"
  },
  "id": "north::north-chapter6",
  "title": "Institutions, Institutional Change and Economic Performance — Chapter 6: Formal constraints",
  "url": "https://www.cambridge.org/core/books/abs/institutions-institutional-change-and-economic-performance/formal-constraints/B7E7A214070518C9DB3B54D1A626D4C7"
}

Institutions, Institutional Change and Economic Performance — Chapter 8: Institutions and transaction and transformation costs

{
  "access_scope": "Cambridge public chapter summary/extract, not full chapter; transaction, production and informal-complement passages inspected.",
  "authors": [
    "Douglass C. North"
  ],
  "dates": {
    "date": "1990 print; 2012-06-05 online",
    "retrieval_date": "2026-10-07",
    "version": "1990 print work, Cambridge chapter summary/extract published online 2012-06-05"
  },
  "id": "north::north-chapter8",
  "title": "Institutions, Institutional Change and Economic Performance — Chapter 8: Institutions and transaction and transformation costs",
  "url": "https://www.cambridge.org/core/books/abs/institutions-institutional-change-and-economic-performance/institutions-and-transaction-and-transformation-costs/60AEDDD7FA5A8553658B359CFB28849B"
}

Institutions, Institutional Change and Economic Performance — Chapter 12: Institutions, economic theory, and economic performance

{
  "access_scope": "Cambridge public chapter summary/extract only; North’s long-run-performance thesis, not complete book or causal empirical audit.",
  "authors": [
    "Douglass C. North"
  ],
  "dates": {
    "date": "1990 print; 2012-06-05 online",
    "retrieval_date": "2026-10-07",
    "version": "1990 print work, Cambridge chapter summary/extract published online 2012-06-05"
  },
  "id": "north::north-chapter12",
  "title": "Institutions, Institutional Change and Economic Performance — Chapter 12: Institutions, economic theory, and economic performance",
  "url": "https://www.cambridge.org/core/books/abs/institutions-institutional-change-and-economic-performance/institutions-economic-theory-and-economic-performance/6EFFF44F23A7D0570D2A550F9C1849AD"
}

1990 is the print publication year; 2012-06-05 dates the online chapter presentation.

Do not infer that all institutions improve welfare or that technological progress guarantees institutional improvement.

No new chapter identity is installed; supplemental chapter-scoped anchors are proposals under the existing family only.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

1990 is the print publication year; 2012-06-05 dates the online chapter presentation.

Do not infer that all institutions improve welfare or that technological progress guarantees institutional improvement.

No new chapter identity is installed; supplemental chapter-scoped anchors are proposals under the existing family only.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the original record remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact original record.

Dates

{
  "year": 1990
}

1990 is the print publication year; 2012-06-05 dates the online chapter presentation.

Do not infer that all institutions improve welfare or that technological progress guarantees institutional improvement.

No new chapter identity is installed; supplemental chapter-scoped anchors are proposals under the existing family only.

No automatic promotion from optional/development editorial draft; family curation, identity resolution and broader rights holds remain.

AI relevance in the baseline remains editorial interpretation, not an empirical finding or documented influence of these sources.

All original URLs, source-access history, bibliography, work-specific credits, dated versions and stable IDs remain in the exact baseline snapshot.

source-scoped factual paraphrase; see source inspection boundaries

When the objective goes wrong

The paper distinguishes wrong objectives, expensive supervision and undesirable behavior during learning, including reward hacking and distribution shift.

The deployment environment and intended behavior can be studied.

A measured reward is a proxy for a desired outcome. Side effects and novel environments expose gaps between proxy performance and the underlying goal.

Faster execution makes an incorrectly specified objective more consequential.

A support bot rewarded only for quick resolution may discourage legitimate escalations; retain outcome and complaint measures.

This research agenda identifies problems; it does not demonstrate that general alignment has been solved.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Dario Amodei",
    "Chris Olah",
    "Jacob Steinhardt",
    "Paul Christiano",
    "John Schulman",
    "Dan Mané"
  ],
  "dates": {
    "date": "2016-07-25",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v2; first submission 2016-06-21"
  },
  "id": "objective-failures::concrete-v2",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/pdf/1606.06565v2"
}

This is a research agenda and literature discussion, not empirical proof that the problems are solved or that its fictional robot was implemented.

Amodei and Olah carry equal-contribution marks.

Keep contemporary support-bot example and governance conclusion explicitly editorial.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is a research agenda and literature discussion, not empirical proof that the problems are solved or that its fictional robot was implemented.

Amodei and Olah carry equal-contribution marks.

Keep contemporary support-bot example and governance conclusion explicitly editorial.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 2016
}

This is a research agenda and literature discussion, not empirical proof that the problems are solved or that its fictional robot was implemented.

Amodei and Olah carry equal-contribution marks.

Keep contemporary support-bot example and governance conclusion explicitly editorial.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: Concrete Problems in AI Safety — §1, PDF pp. 1–2.

Inspected source scope: Concrete Problems in AI Safety — §2, PDF pp. 2–3; §§3–4.

Inspected source scope: Concrete Problems in AI Safety — §2, PDF p. 3; §§5–7.

Inspected source scope: Concrete Problems in AI Safety — §2, PDF p. 3.

Open innovation

Firms can use external ideas and external paths to market as well as internal ones.

Connects organizational boundaries with knowledge inflows, outflows and innovation value.

Benefits depend on intellectual-property regimes and absorptive capacity.

Sources and details

Henry Chesbrough

{
  "access_scope": "Berkeley institutional profile and 2003 book listing inspected; profile is not original-book text.",
  "authors": [
    "UC Berkeley Haas"
  ],
  "dates": {
    "date": null,
    "retrieval_date": "2026-10-07",
    "version": "Undated live page"
  },
  "id": "open-innovation::org-chesbrough-profile",
  "title": "Henry Chesbrough",
  "url": "https://haas.berkeley.edu/faculty/henry-chesbrough/"
}

The Logic of Open Innovation: Managing Intellectual Property

{
  "access_scope": "Original California Management Review article in a public third-party scan: selected printed pp. 33 and 37–40 inspected; p. 33 identifies it as an authorized excerpt from the 2003 Open Innovation book. Neither the full article nor full book was read.",
  "authors": [
    "Henry Chesbrough"
  ],
  "dates": {
    "date": "2003-04",
    "retrieval_date": "2026-10-07",
    "version": "California Management Review 45(3), Spring 2003, pp. 33–58; article/book-excerpt manifestation"
  },
  "id": "open-innovation::org-chesbrough-2003-logic",
  "title": "The Logic of Open Innovation: Managing Intellectual Property",
  "url": "https://sweet-lantern.ch/wp-content/uploads/2024/01/Chesbrough-H.-2003.-The-logic-of-open-innovation-managing-intellectual-property.pdf"
}

The Logic of Open Innovation: Managing Intellectual Property

{
  "access_scope": "Publisher metadata verified: sole author, April 2003, volume 45 issue 3 and pp. 33–58; publisher access is restricted and its full text was not read.",
  "authors": [
    "Henry Chesbrough"
  ],
  "dates": {
    "date": "2003-04",
    "retrieval_date": "2026-10-07",
    "version": "Publisher record for CMR 45(3), pp. 33–58"
  },
  "id": "open-innovation::org-chesbrough-2003-logic-publisher",
  "title": "The Logic of Open Innovation: Managing Intellectual Property",
  "url": "https://journals.sagepub.com/doi/10.1177/000812560304500301"
}

Benefits depend on intellectual-property regimes and absorptive capacity.

The baseline intellectual-property and absorptive-capacity caveat remains; no new empirical test of absorptive capacity was performed here.

The 2003 industry examples are historical illustrations, not a current classification or universal forecast.

Preserve Henry W. Chesbrough credit on the existing 2003 book; the CMR byline uses Henry Chesbrough.

The original book foreword and full production credits have not been audited; the supplemental article's sole-author byline is verified.

Keep existing optional-draft, source-context and rights holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Benefits depend on intellectual-property regimes and absorptive capacity.

The baseline intellectual-property and absorptive-capacity caveat remains; no new empirical test of absorptive capacity was performed here.

The 2003 industry examples are historical illustrations, not a current classification or universal forecast.

Preserve Henry W. Chesbrough credit on the existing 2003 book; the CMR byline uses Henry Chesbrough.

The original book foreword and full production credits have not been audited; the supplemental article's sole-author byline is verified.

Keep existing optional-draft, source-context and rights holds.

Dates

{
  "year": 2003
}

Benefits depend on intellectual-property regimes and absorptive capacity.

The baseline intellectual-property and absorptive-capacity caveat remains; no new empirical test of absorptive capacity was performed here.

The 2003 industry examples are historical illustrations, not a current classification or universal forecast.

Preserve Henry W. Chesbrough credit on the existing 2003 book; the CMR byline uses Henry Chesbrough.

The original book foreword and full production credits have not been audited; the supplemental article's sole-author byline is verified.

Keep existing optional-draft, source-context and rights holds.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Double-loop learning

Organizations learn deeply only when they question the assumptions behind their routines.

Shows why detecting errors is insufficient unless organizations can examine assumptions and behavior.

Difficult to observe and measure.

Sources and details

In memoriam: Chris Argyris, authority on organizational behavior

{
  "access_scope": "Institutional obituary inspected for book credits and chronology; it is not full text of Theory in Practice or Organizational Learning.",
  "authors": [
    "Yale News"
  ],
  "dates": {
    "date": "2013-12-11",
    "retrieval_date": "2026-10-07",
    "version": "2013"
  },
  "id": "organizational-learning::org-argyris-yale",
  "title": "In memoriam: Chris Argyris, authority on organizational behavior",
  "url": "https://news.yale.edu/2013/12/11/memoriam-chris-argyris-authority-organizational-behavior"
}

Double Loop Learning in Organizations

{
  "access_scope": "Original Harvard Business Review article scan: printed pp. 116–118 inspected locally, including visual checking of the p. 118 credit note; not the full article or either coauthored book.",
  "authors": [
    "Chris Argyris"
  ],
  "dates": {
    "date": "1977-09",
    "retrieval_date": "2026-10-07",
    "version": "Harvard Business Review September–October 1977 article; 12-page scan"
  },
  "id": "organizational-learning::org-argyris-1977",
  "title": "Double Loop Learning in Organizations",
  "url": "https://theisrm.org/documents/Argyris%20(1977)%20Double%20Loop%20Learning%20in%20Organizations.pdf"
}

Double Loop Learning in Organizations

{
  "access_scope": "HBR store metadata and product description only; this does not imply publisher full-text access.",
  "authors": [
    "Chris Argyris"
  ],
  "dates": {
    "date": "1977-09-01",
    "retrieval_date": "2026-10-07",
    "version": "HBR item 77502; publisher says 10 pages"
  },
  "id": "organizational-learning::org-argyris-1977-publisher",
  "title": "Double Loop Learning in Organizations",
  "url": "https://store.hbr.org/product/double-loop-learning-in-organizations/77502"
}

Theory in Practice: Increasing Professional Effectiveness

{
  "access_scope": "WorldCat bibliographic record only: first edition, Jossey-Bass, 1974 and both authors; original book text not read.",
  "authors": [
    "Chris Argyris",
    "Donald A. Schön"
  ],
  "dates": {
    "date": "1974",
    "retrieval_date": "2026-10-07",
    "version": "1974 first edition; bibliographic verification only"
  },
  "id": "organizational-learning::org-argyris-schon-theory-catalog",
  "title": "Theory in Practice: Increasing Professional Effectiveness",
  "url": "https://search.worldcat.org/title/25769846"
}

Organizational Learning: A Theory of Action Perspective

{
  "access_scope": "WorldCat bibliographic record only: Addison-Wesley, 1978 and both authors; original book text not read.",
  "authors": [
    "Chris Argyris",
    "Donald A. Schön"
  ],
  "dates": {
    "date": "1978",
    "retrieval_date": "2026-10-07",
    "version": "1978 book; bibliographic verification only"
  },
  "id": "organizational-learning::org-argyris-schon-learning-catalog",
  "title": "Organizational Learning: A Theory of Action Perspective",
  "url": "https://search.worldcat.org/title/Organizational-learning-%3A-a-theory-of-action-perspective/oclc/610749704"
}

Difficult to observe and measure.

Preserve both Chris Argyris and Donald A. Schön on the 1974 and 1978 books; credit the 1977 article to Argyris alone.

The Product X narrative is the author's illustrative case, not an independently audited company investigation or measured causal estimate.

The p. 118 model attribution supports the credited theoretical distinction, not a full reading of the 1974 book.

Preserve the difficult-to-observe/measure caveat and optional-draft/full-family-review holds.

Do not claim every error requires revising goals, or that routine correction is never learning.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Difficult to observe and measure.

Preserve both Chris Argyris and Donald A. Schön on the 1974 and 1978 books; credit the 1977 article to Argyris alone.

The Product X narrative is the author's illustrative case, not an independently audited company investigation or measured causal estimate.

The p. 118 model attribution supports the credited theoretical distinction, not a full reading of the 1974 book.

Preserve the difficult-to-observe/measure caveat and optional-draft/full-family-review holds.

Do not claim every error requires revising goals, or that routine correction is never learning.

Dates

{
  "year": 1974
}

Difficult to observe and measure.

Preserve both Chris Argyris and Donald A. Schön on the 1974 and 1978 books; credit the 1977 article to Argyris alone.

The Product X narrative is the author's illustrative case, not an independently audited company investigation or measured causal estimate.

The p. 118 model attribution supports the credited theoretical distinction, not a full reading of the 1974 book.

Preserve the difficult-to-observe/measure caveat and optional-draft/full-family-review holds.

Do not claim every error requires revising goals, or that routine correction is never learning.

source-bounded factual description of the authors' theory or example, not an independently established causal finding

Packet switching

Breaking messages into independently routed blocks made networks robust and shareable.

Built protocols or coordination services enabling networked computation.

Independent inventions; credit is shared.

Sources and details

On Distributed Communications: I. Introduction to Distributed Communications Networks

{
  "access_scope": [
    "Sections I–IV, especially Standard Message Block, Switching and Hot-Potato Heuristic Routing Doctrine"
  ],
  "authors": [
    "Paul Baran"
  ],
  "dates": {
    "date": "1964",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "RAND RM-3420-PR, institutional HTML transcription",
    "version_note": "RAND RM-3420-PR, institutional HTML transcription"
  },
  "id": "packet-switching::baran-rand-web",
  "title": "On Distributed Communications: I. Introduction to Distributed Communications Networks",
  "url": "https://www.rand.org/pubs/research_memoranda/RM3420.html"
}

A Digital Communication Network for Computers Giving Rapid Response at Remote Terminals

{
  "access_scope": [
    "PDF pp. 1–5; original paper section Introduction and network proposal"
  ],
  "authors": [
    "D. W. Davies",
    "K. A. Bartlett",
    "R. A. Scantlebury",
    "P. T. Wilkinson"
  ],
  "dates": {
    "date": "1967-10",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "ACM Symposium on Operating Systems Principles paper; NPL author text scan",
    "version_note": "ACM Symposium on Operating Systems Principles paper; NPL author text scan"
  },
  "id": "packet-switching::davies-1967",
  "title": "A Digital Communication Network for Computers Giving Rapid Response at Remote Terminals",
  "url": "https://people.mpi-sws.org/~gummadi/teaching/sp07/sys_seminar/how_did_erope_blow_this_vision.pdf"
}

Catalogue of the papers and correspondence of Donald Watts Davies

{
  "access_scope": [
    "Catalogue cover and imprint (PDF pp. 1–2); printed p. 36, item C.29"
  ],
  "authors": [
    "Peter Harper",
    "Timothy E. Powell"
  ],
  "dates": {
    "date": "2005 (catalogue copyright)",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "NCUACS 143/8/05 archival catalogue",
    "version_note": "NCUACS 143/8/05 archival catalogue"
  },
  "id": "packet-switching::davies-archive-catalogue",
  "title": "Catalogue of the papers and correspondence of Donald Watts Davies",
  "url": "https://centreforscientificarchives.co.uk/wp-content/uploads/2024/01/DAVIES_DONALD_WATTS.pdf"
}

Preserve independent-invention/shared-credit context; the 1967 authors’ explicit comparison with Baran is not evidence that every underlying idea was derivative.

Baran’s RAND volume I and the March 1964 IEEE article are distinct manifestations; only the RAND transcription supplies this prose.

The Davies paper does not establish the deployment history of ARPANET or the entire Internet.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve independent-invention/shared-credit context; the 1967 authors’ explicit comparison with Baran is not evidence that every underlying idea was derivative.

Baran’s RAND volume I and the March 1964 IEEE article are distinct manifestations; only the RAND transcription supplies this prose.

The Davies paper does not establish the deployment history of ARPANET or the entire Internet.

Dates

{
  "year": 1964
}

Preserve independent-invention/shared-credit context; the 1967 authors’ explicit comparison with Baran is not evidence that every underlying idea was derivative.

Baran’s RAND volume I and the March 1964 IEEE article are distinct manifestations; only the RAND transcription supplies this prose.

The Davies paper does not establish the deployment history of ARPANET or the entire Internet.

primary-source mechanism paraphrase

explicit synthesis of design and simulation scope

Parallel feature detectors

Many simple detectors report in parallel and a decision layer weighs them.

Early model combining feature detectors into recognition.

An architecture sketch rather than a trained system at scale.

Sources and details

Pandemonium: A Paradigm for Learning

{
  "access_scope": [
    "PDF pp. 3–8, 11–12, 14–16, 20–21; printed pp. 513–518, 521–522, 524–526, 530–531"
  ],
  "authors": [
    "O. G. Selfridge"
  ],
  "dates": {
    "date": "1959",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Mechanisation of Thought Processes proceedings scan, printed pp. 511–531 including discussion; symposium held November 1958",
    "version_note": "Mechanisation of Thought Processes proceedings scan, printed pp. 511–531 including discussion; symposium held November 1958"
  },
  "id": "pandemonium::pandemonium",
  "title": "Pandemonium: A Paradigm for Learning",
  "url": "https://www.airstreet.com/pandemonium.pdf"
}

Mechanisation of thought processes / proceedings of a symposium held at the National Physical Laboratory on 24th, 25th, 26th and 27th November 1958.

{
  "access_scope": [
    "Catalogue title, imprint and reprint note"
  ],
  "dates": {
    "date": "1959",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Wellcome Collection catalogue; notes a 1962 reprint",
    "version_note": "Wellcome Collection catalogue; notes a 1962 reprint"
  },
  "id": "pandemonium::npl-proceedings-catalogue",
  "title": "Mechanisation of thought processes / proceedings of a symposium held at the National Physical Laboratory on 24th, 25th, 26th and 27th November 1958.",
  "url": "https://wellcomecollection.org/works/f77t3upd"
}

Do not substitute later letter-recognition textbook diagrams for this paper’s Morse-code example.

Parallel computation is an architectural motif; the discussion explicitly considers sequential execution on available hardware.

1958 symposium presentation, 1959 proceedings publication, and unknown scan print run are distinct.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Do not substitute later letter-recognition textbook diagrams for this paper’s Morse-code example.

Parallel computation is an architectural motif; the discussion explicitly considers sequential execution on available hardware.

1958 symposium presentation, 1959 proceedings publication, and unknown scan print run are distinct.

Dates

{
  "year": 1959
}

Do not substitute later letter-recognition textbook diagrams for this paper’s Morse-code example.

Parallel computation is an architectural motif; the discussion explicitly considers sequential execution on available hardware.

1958 symposium presentation, 1959 proceedings publication, and unknown scan print run are distinct.

primary-source mechanism paraphrase

proposed learning mechanism

original worked application

author-reported preliminary finding and limitation

Lock-in and path dependence

Increasing returns can lock in a technology through early, small events.

Explains cumulative advantage and why early events can shape technological and organizational trajectories.

Whether inferior lock-in occurs in particular cases is disputed.

Sources and details

Preface to Increasing Returns and Path Dependence in the Economy

{
  "access_scope": "Arthur’s 1994 retrospective preface, selected substantive passages; not the original 1983 working paper or 1989 article.",
  "authors": [
    "W. Brian Arthur"
  ],
  "dates": {
    "date": "1994 book preface, 10-page author-hosted PDF",
    "retrieval_date": "2026-10-07",
    "version": "1994 book preface, 10-page author-hosted PDF"
  },
  "id": "path-dependence::PD-A",
  "title": "Preface to Increasing Returns and Path Dependence in the Economy",
  "url": "https://sites.santafe.edu/~wbarthur/Papers/Preface.pdf"
}

Path Dependence - A Foundational Concept for Historical Social Science

{
  "access_scope": "SIEPR abstract for David’s revised synthesis; full working paper not inspected.",
  "authors": [
    "Paul A. David"
  ],
  "dates": {
    "date": "SIEPR record: May 2005; extensive October 2006 revision; revised January 2007",
    "retrieval_date": "2026-10-07",
    "version": "SIEPR record: May 2005; extensive October 2006 revision; revised January 2007"
  },
  "id": "path-dependence::PD-D",
  "title": "Path Dependence - A Foundational Concept for Historical Social Science",
  "url": "https://siepr.stanford.edu/publications/working-paper/path-dependence-foundational-concept-historical-social-science-revised"
}

The current Arthur URL identifies a 1994 preface; the generic baseline title must not be treated as an exact original-paper binding.

David’s synthesis date must not inherit the family’s editorial 1983 plotting year.

No claim that any particular historical technology was demonstrably inferior is admitted.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The current Arthur URL identifies a 1994 preface; the generic baseline title must not be treated as an exact original-paper binding.

David’s synthesis date must not inherit the family’s editorial 1983 plotting year.

No claim that any particular historical technology was demonstrably inferior is admitted.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1983
}

The current Arthur URL identifies a 1994 preface; the generic baseline title must not be treated as an exact original-paper binding.

David’s synthesis date must not inherit the family’s editorial 1983 plotting year.

No claim that any particular historical technology was demonstrably inferior is admitted.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Acting under partial observation

Agents can plan over beliefs about hidden states.

Algorithms for decisions under incomplete observations.

Exact solutions are intractable for large problems.

Sources and details

Planning and Acting in Partially Observable Stochastic Domains

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "dates": {
    "date": "1998",
    "retrieval_date": "2026-10-07",
    "version": "Artificial Intelligence 101:99–134; received 1995-10-11, revised 1998-01-17"
  },
  "id": "pomdp::pomdp-1998",
  "title": "Planning and Acting in Partially Observable Stochastic Domains",
  "url": "https://people.csail.mit.edu/lpk/papers/aij98-pomdp.pdf"
}

Do not imply the world model is learned by the presented planner; model acquisition is explicitly outside the paper’s scope.

1995 receipt is not the 1998 publication; finite-memory controllers are extractable only in the cases described.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Do not imply the world model is learned by the presented planner; model acquisition is explicitly outside the paper’s scope.

1995 receipt is not the 1998 publication; finite-memory controllers are extractable only in the cases described.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1998
}

Do not imply the world model is learned by the presented planner; model acquisition is explicitly outside the paper’s scope.

1995 receipt is not the 1998 publication; finite-memory controllers are extractable only in the cases described.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: Planning and Acting in Partially Observable Stochastic Domains — §3, printed pp. 106–108 / PDF pp. 8–10.

Inspected source scope: Planning and Acting in Partially Observable Stochastic Domains — §3, Figure 2; §7, printed p. 130.

Inspected source scope: Planning and Acting in Partially Observable Stochastic Domains — §4.1, printed pp. 109–111 / PDF pp. 11–13.

Inspected source scope: Planning and Acting in Partially Observable Stochastic Domains — §7, printed p. 130 / PDF p. 32.

The productivity J-curve

General-purpose technologies require complementary intangible investment that can depress measured productivity before gains appear.

New technology needs organizational complements; some investment is poorly measured.

New general-purpose technologies require investment in complementary processes, skills and other intangible assets. Some of that investment is poorly captured in conventional accounts, which can make measured productivity look weak during installation and stronger later as the complements contribute output. The mechanism is a measurement and investment argument, not a guarantee that an unsuccessful project will recover.

Training, workflow redesign and data infrastructure can matter as much as benchmark performance.

Separate a service firm's software costs, training effort and workflow redesign from recurring output. Track what was invested and whether useful output improves afterward; explaining a temporary measurement dip does not justify ignoring a persistent operational failure.

A delayed return is not evidence that a project will eventually succeed.

Sources and details

The Productivity J-Curve: How Intangibles Complement General Purpose Technologies

{
  "access_scope": "Published article’s author abstract and bibliography; full journal article not inspected.",
  "authors": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "dates": {
    "date": "AEJ: Macroeconomics 13(1), January 2021, pp.333–372; DOI 10.1257/mac.20180386",
    "retrieval_date": "2026-10-07",
    "version": "AEJ: Macroeconomics 13(1), January 2021, pp.333–372; DOI 10.1257/mac.20180386"
  },
  "id": "productivity-j-curve::JC-J",
  "title": "The Productivity J-Curve: How Intangibles Complement General Purpose Technologies",
  "url": "https://www.aeaweb.org/articles?id=10.1257/mac.20180386"
}

The Productivity J-Curve: How Intangibles Complement General Purpose Technologies

{
  "access_scope": "NBER author abstract of the January 2020 revision; PDF access failed, so no full-manuscript review claimed.",
  "authors": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "dates": {
    "date": "NBER Working Paper 25148, October 2018, revised January 2020",
    "retrieval_date": "2026-10-07",
    "version": "NBER Working Paper 25148, October 2018, revised January 2020"
  },
  "id": "productivity-j-curve::JC-W",
  "title": "The Productivity J-Curve: How Intangibles Complement General Purpose Technologies",
  "url": "https://www.nber.org/papers/w25148"
}

The 15.9% result is a level adjustment under the paper’s method, not an observed AI productivity gain.

Retain the stronger baseline mechanism, assumptions, caution against guaranteed recovery, and service-firm training/workflow example verbatim.

The 1992 author manuscript / 1993 CACM productivity-paradox source is a distinct work; no new claims from it are needed here.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 15.9% result is a level adjustment under the paper’s method, not an observed AI productivity gain.

Retain the stronger baseline mechanism, assumptions, caution against guaranteed recovery, and service-firm training/workflow example verbatim.

The 1992 author manuscript / 1993 CACM productivity-paradox source is a distinct work; no new claims from it are needed here.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 2021
}

The 15.9% result is a level adjustment under the paper’s method, not an observed AI productivity gain.

Retain the stronger baseline mechanism, assumptions, caution against guaranteed recovery, and service-firm training/workflow example verbatim.

The 1992 author manuscript / 1993 CACM productivity-paradox source is a distinct work; no new claims from it are needed here.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Logic programming

Programs could be written as logical statements and executed by resolution.

Joined logical deduction with executable programs.

Declarative style; performance and control remained practical issues.

Sources and details

The Early Years of Logic Programming

{
  "access_scope": "Author-written retrospective primary account inspected; not a contemporaneous 1972 method publication.",
  "authors": [
    "Robert A. Kowalski"
  ],
  "dates": {
    "date": "1988-01",
    "retrieval_date": "2026-10-07",
    "version": "Communications of the ACM 31(1):38–43; author-hosted original scan"
  },
  "id": "prolog::prolog-history-1988",
  "title": "The Early Years of Logic Programming",
  "url": "https://www.doc.ic.ac.uk/~rak/papers/the%20early%20years.pdf"
}

Predicate Logic as Programming Language

{
  "access_scope": "Original scanned paper p. 569 visually inspected from locally rendered PDF; bibliographic identity checked against author’s selected bibliography. Other pages not claimed read.",
  "authors": [
    "Robert Kowalski"
  ],
  "dates": {
    "date": "1974",
    "retrieval_date": "2026-10-07",
    "version": "Information Processing 74 / IFIP Congress, pp. 569–574"
  },
  "id": "prolog::prolog-kowalski-1974",
  "title": "Predicate Logic as Programming Language",
  "url": "https://www.doc.ic.ac.uk/~rak/papers/IFIP%2074.pdf"
}

The 1988 recollection acknowledges Edinburgh bias and incomplete coverage of Marseille; do not claim a complete inventor/participant history.

Do not move the family’s editorial plotting year 1972 to 1988, or backdate Kowalski’s 1974 paper into 1972.

The specific control-performance limitations in the original record are retained but not newly adjudicated by the two inspected pages.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1988 recollection acknowledges Edinburgh bias and incomplete coverage of Marseille; do not claim a complete inventor/participant history.

Do not move the family’s editorial plotting year 1972 to 1988, or backdate Kowalski’s 1974 paper into 1972.

The specific control-performance limitations in the original record are retained but not newly adjudicated by the two inspected pages.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1972
}

The 1988 recollection acknowledges Edinburgh bias and incomplete coverage of Marseille; do not claim a complete inventor/participant history.

Do not move the family’s editorial plotting year 1972 to 1988, or backdate Kowalski’s 1974 paper into 1972.

The specific control-performance limitations in the baseline are retained but not newly adjudicated by the two inspected pages.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: The Early Years of Logic Programming — Opening, printed p. 38.

Inspected source scope: Predicate Logic as Programming Language — Printed p. 569, abstract and §1.

Mechanized proof procedures

Systematic procedures made logical satisfiability and theorem proving executable by machine.

A foundation of automated logical reasoning.

Worst-case cost remains exponential for hard instances.

Sources and details

A Computing Procedure for Quantification Theory

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Martin Davis",
    "Hilary Putnam"
  ],
  "dates": {
    "date": "1960",
    "retrieval_date": "2026-10-07",
    "version": "Journal of the ACM 7(3):201–215; received September 1959"
  },
  "id": "proof-procedures::dp-1960",
  "title": "A Computing Procedure for Quantification Theory",
  "url": "https://web.stanford.edu/class/cs357/DP60.pdf"
}

A Machine Program for Theorem-Proving

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "Martin Davis",
    "George Logemann",
    "Donald Loveland"
  ],
  "dates": {
    "date": "1962-07",
    "retrieval_date": "2026-10-07",
    "version": "Communications of the ACM 5(7):394–397"
  },
  "id": "proof-procedures::dpll-1962",
  "title": "A Machine Program for Theorem-Proving",
  "url": "https://web.stanford.edu/class/cs357/DPLL62.pdf"
}

A Machine-Oriented Logic Based on the Resolution Principle

{
  "access_scope": "Primary text inspected at the cited sections; not a claim to have audited every page.",
  "authors": [
    "J. A. Robinson"
  ],
  "dates": {
    "date": "1965-01",
    "retrieval_date": "2026-10-07",
    "version": "Journal of the ACM 12(1):23–41"
  },
  "id": "proof-procedures::resolution-1965",
  "title": "A Machine-Oriented Logic Based on the Resolution Principle",
  "url": "https://web.stanford.edu/class/linguist289/robinson65.pdf"
}

Preserve all three bylines, including Martin Davis in the 1962 collaboration.

Propositional SAT search and first-order validity are different problems; do not summarize both by one exponential worst-case claim.

Family year 1960 is an editorial plotting choice; Robinson’s own source must remain 1965.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve all three bylines, including Martin Davis in the 1962 collaboration.

Propositional SAT search and first-order validity are different problems; do not summarize both by one exponential worst-case claim.

Family year 1960 is an editorial plotting choice; Robinson’s own source must remain 1965.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the original record; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Dates

{
  "year": 1960
}

Preserve all three bylines, including Martin Davis in the 1962 collaboration.

Propositional SAT search and first-order validity are different problems; do not summarize both by one exponential worst-case claim.

Family year 1960 is an editorial plotting choice; Robinson’s own source must remain 1965.

Preserve every original rights, historical influence, editorial signoff, source-clearance and optional-draft hold in the baseline snapshot; bounded prose support does not clear the entire record.

No family/work/person identity merge, chapter assignment, territorial promotion, or empirical support for contemporary editorial examples is implied.

Evidence scope: bounded primary source paraphrase.

Inspected source scope: A Computing Procedure for Quantification Theory — §§3–5, printed pp. 207–212.

Inspected source scope: A Machine Program for Theorem-Proving — Opening and Changes in the Algorithm, printed p. 394.

Inspected source scope: A Machine-Oriented Logic Based on the Resolution Principle — Abstract; §5.8 and §§6–8, printed pp. 23, 32–38.

Inspected source scope: A Machine-Oriented Logic Based on the Resolution Principle — Abstract and concluding search-principles discussion.

Inspected source scope: A Computing Procedure for Quantification Theory — Introduction, printed p. 201.

Decisions under risk, as made

People evaluate gains and losses relative to a reference point and weigh losses more heavily.

Challenges idealized utility assumptions and shows how framing and losses affect decisions.

Descriptive model; context effects remain debated.

Sources and details

Prospect Theory: An Analysis of Decision under Risk

{
  "access_scope": "Original 1979 article, abstract and selected body passages on value, reference points and method; not a complete replication audit.",
  "authors": [
    "Daniel Kahneman",
    "Amos Tversky"
  ],
  "dates": {
    "date": "Econometrica 47(2), March 1979, pp.263–291; institutional copy",
    "retrieval_date": "2026-10-07",
    "version": "Econometrica 47(2), March 1979, pp.263–291; institutional copy"
  },
  "id": "prospect-theory::PT-P",
  "title": "Prospect Theory: An Analysis of Decision under Risk",
  "url": "https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Behavioral_Decision_Theory/Kahneman_Tversky_1979_Prospect_theory.pdf"
}

The baseline Nobel background URL failed to fetch and remains historical context, not a copy of the original paper.

This binds the 1979 model only; do not silently import the later cumulative-prospect-theory formulation or universal effect sizes.

Descriptive choice theory is not a proof that every person is loss-averse in every setting.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The baseline Nobel background URL failed to fetch and remains historical context, not a copy of the original paper.

This binds the 1979 model only; do not silently import the later cumulative-prospect-theory formulation or universal effect sizes.

Descriptive choice theory is not a proof that every person is loss-averse in every setting.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1979
}

The baseline Nobel background URL failed to fetch and remains historical context, not a copy of the original paper.

This binds the 1979 model only; do not silently import the later cumulative-prospect-theory formulation or universal effect sizes.

Descriptive choice theory is not a proof that every person is loss-averse in every setting.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Frontline quality learning

Small frontline groups participate in systematic improvement of their own work.

Workers have situated knowledge and support for acting on it.

The QC-circle movement organizes small groups around learning and improvement in their own workplace. The contribution includes participation, problem identification and practical quality methods, supported by an institutional movement and its training infrastructure. Situated knowledge matters because the people doing the work encounter constraints and failure patterns that remote planners can overlook.

People using AI daily can identify failures that benchmark designers miss. Give feedback an operational path.

Give staff using an assistant a regular way to collect recurring failures, test repairs and see management responses. A feedback channel without time, authority or follow-through does not reproduce the participatory improvement mechanism.

Participation without time, authority or management response can become symbolic.

Sources and details

QC Circles: About QC Circle Conference / What is a QC Circle?

{
  "access_scope": "JUSE’s official description of the QC-circle movement; no original Ishikawa book or performance study inspected.",
  "authors": [
    "Union of Japanese Scientists and Engineers (JUSE)"
  ],
  "dates": {
    "date": "Undated live institutional exposition; historical launch April 1962; registration count explicitly December 2014",
    "retrieval_date": "2026-10-07",
    "version": "Undated live institutional exposition; historical launch April 1962; registration count explicitly December 2014"
  },
  "id": "quality-circles::QC-J",
  "title": "QC Circles: About QC Circle Conference / What is a QC Circle?",
  "url": "https://www.juse.or.jp/english/qc/index.html"
}

Preserve the existing mechanism and operational AI-feedback example; this is additional source detail, not a shorter substitute.

The page does not establish sole authorship of the movement or an exact issue of Genba To QC.

Do not present the December 2014 registration count as current.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Preserve the existing mechanism and operational AI-feedback example; this is additional source detail, not a shorter substitute.

The page does not establish sole authorship of the movement or an exact issue of Genba To QC.

Do not present the December 2014 registration count as current.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1962
}

Preserve the existing mechanism and operational AI-feedback example; this is additional source detail, not a shorter substitute.

The page does not establish sole authorship of the movement or an exact issue of Genba To QC.

Do not present the December 2014 registration count as current.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Machine self-awareness

An artificial intelligence develops self-awareness while studying a distant probe.

Fictional treatment of machine consciousness.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Queen of Angels: author-site book page

{
  "access_scope": "Author-site synopsis, no full novel inspection.",
  "dates": {
    "date": "1990 original; current page undated",
    "retrieved_at": "2026-10-07",
    "version_note": "Author/estate synopsis explicitly identifies original publication as 1990."
  },
  "id": "queen-of-angels::QUEEN",
  "title": "Queen of Angels: author-site book page",
  "url": "https://www.gregbear.com/books/queen.php"
}

Strikes and Spares

{
  "access_scope": "Greg Bear’s 1996 account of the shared fictional future; explicitly supplemental to the 1990 novel.",
  "dates": {
    "date": "1996",
    "retrieved_at": "2026-10-07",
    "version_note": "Author’s retrospective essay; shared future encompasses Queen of Angels, Heads, Moving Mars and Slant. Detailed quantum-logic description is attributed to Heads, not reassigned to Queen of Angels."
  },
  "id": "queen-of-angels::BEAR96",
  "title": "Strikes and Spares",
  "url": "https://www.gregbear.com/pages/strikes.php"
}

Exact Jill/AXIS awakening mechanism remains held; neither a reader’s forum post nor the Heads quantum-logic mechanism is used as evidence for this novel.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Exact Jill/AXIS awakening mechanism remains held; neither a reader’s forum post nor the Heads quantum-logic mechanism is used as evidence for this novel.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1990
}

Exact Jill/AXIS awakening mechanism remains held; neither a reader’s forum post nor the Heads quantum-logic mechanism is used as evidence for this novel.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: author retrospective paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Prompted reasoning sequences

Examples containing intermediate reasoning improve results on tested arithmetic, commonsense and symbolic reasoning tasks.

Model scale, examples and task structure support the prompting effect.

The intervention changes the examples supplied in a prompt. Success is assessed on benchmark answers, not by demonstrating that every generated explanation reflects an internal computation.

Inspect answers against external evidence rather than treating displayed reasoning as certification.

Use testable calculations and source checks alongside reasoning prompts in a financial analysis workflow.

A plausible trace is not proof of faithful internal reasoning or a correct final answer.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": [
    "§2 and §3.1, PDF pp. 2–3",
    "§§3–5; Fig. 2, PDF p. 2",
    "§3.2, PDF p. 4",
    "§2, numbered property 2, PDF p. 3"
  ],
  "authors": [
    "Jason Wei",
    "Xuezhi Wang",
    "Dale Schuurmans",
    "Maarten Bosma",
    "Brian Ichter",
    "Fei Xia",
    "Ed H. Chi",
    "Quoc V. Le",
    "Denny Zhou"
  ],
  "dates": {
    "date": "2023-01-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v6, revised manuscript carrying NeurIPS 2022 venue"
  },
  "id": "reasoning-examples::reasoning-examples::cot-v6",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/pdf/2201.11903v6"
}

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jason Wei",
    "Xuezhi Wang",
    "Dale Schuurmans",
    "Maarten Bosma",
    "Brian Ichter",
    "Fei Xia",
    "Ed H. Chi",
    "Quoc V. Le",
    "Denny Zhou"
  ],
  "dates": {
    "date": "2022-01-28 / 2023-01-10",
    "retrieval_date": "2026-10-07",
    "version": "arXiv submission history"
  },
  "id": "reasoning-examples::reasoning-examples::cot-history",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903"
}

Chain of Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Jason Wei",
    "Xuezhi Wang",
    "Dale Schuurmans",
    "Maarten Bosma",
    "Ed Chi",
    "Quoc Le",
    "Denny Zhou"
  ],
  "dates": {
    "date": "2022-01-28",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "reasoning-examples::reasoning-examples::cot-v1-byline",
  "title": "Chain of Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/pdf/2201.11903v1"
}

Retain the original record financial-analysis example as editorial application, not a task tested in this paper.

Do not infer faithful internal reasoning from answer accuracy or plausible explanations.

The 2022 first release and 2023 inspected revision are separate date events. V1 has seven authors; v6 has nine.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Retain the original record financial-analysis example as editorial application, not a task tested in this paper.

Do not infer faithful internal reasoning from answer accuracy or plausible explanations.

The 2022 first release and 2023 inspected revision are separate date events. V1 has seven authors; v6 has nine.

Dates

{
  "year": 2022
}

Retain the baseline financial-analysis example as editorial application, not a task tested in this paper.

Do not infer faithful internal reasoning from answer accuracy or plausible explanations.

The 2022 first release and 2023 inspected revision are separate date events. V1 has seven authors; v6 has nine.

source-scoped factual paraphrase; see source inspection boundaries

A resource-based view

Firms can be analyzed by their resources and the barriers that protect resource positions.

A foundational shift toward internal capabilities, knowledge and resource combinations.

Resources are hard to define and measure ex ante.

Sources and details

A Resource-Based View of the Firm

{
  "access_scope": "Original 1984 article, selected body sections; distinct from the later Ten Years After retrospective.",
  "authors": [
    "Birger Wernerfelt"
  ],
  "dates": {
    "date": "Strategic Management Journal 5(2), April–June 1984, pp.171–180; author-hosted article copy",
    "retrieval_date": "2026-10-07",
    "version": "Strategic Management Journal 5(2), April–June 1984, pp.171–180; author-hosted article copy"
  },
  "id": "resource-based-view::RB-W",
  "title": "A Resource-Based View of the Firm",
  "url": "https://www.web.mit.edu/bwerner/www/papers/AResource-BasedViewoftheFirm.pdf"
}

The new source extends beyond the baseline publisher-abstract inspection but does not erase earlier access history or uncurated-family status.

Do not assign Barney’s later four-attribute framework to this 1984 article.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The new source extends beyond the baseline publisher-abstract inspection but does not erase earlier access history or uncurated-family status.

Do not assign Barney’s later four-attribute framework to this 1984 article.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1984
}

The new source extends beyond the baseline publisher-abstract inspection but does not erase earlier access history or uncurated-family status.

Do not assign Barney’s later four-attribute framework to this 1984 article.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Sampling-based motion planning

Randomly growing trees from start and goal found motion plans in high-dimensional spaces.

Efficient collision-free planning in high-dimensional configuration spaces.

Finds feasible paths, not necessarily optimal ones.

Sources and details

RRT-Connect: An Efficient Approach to Single-Query Path Planning

{
  "access_scope": [
    "§1 and abstract, PDF p. 1; visually inspected",
    "§3 and Fig. 5, PDF p. 3; visually inspected",
    "§3, PDF p. 3; visually inspected",
    "§5, PDF p. 5; visually inspected"
  ],
  "authors": [
    "James J. Kuffner, Jr.",
    "Steven M. LaValle"
  ],
  "dates": {
    "date": "2000",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted draft submitted to ICRA 2000"
  },
  "id": "rrt::rrt::rrt-draft",
  "title": "RRT-Connect: An Efficient Approach to Single-Query Path Planning",
  "url": "https://lavalle.pl/papers/KufLav00.pdf"
}

The linked seven-page manuscript explicitly says DRAFT submitted to ICRA 2000; do not label it the publisher’s final layout.

Retain feasible-path versus optimal-path boundary; collision checking and the geometric configuration-space setup matter.

Robot-arm examples are computed model/animation experiments, not independently verified physical deployment.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The linked seven-page manuscript explicitly says DRAFT submitted to ICRA 2000; do not label it the publisher’s final layout.

Retain feasible-path versus optimal-path boundary; collision checking and the geometric configuration-space setup matter.

Robot-arm examples are computed model/animation experiments, not independently verified physical deployment.

Dates

{
  "year": 2000
}

The linked seven-page manuscript explicitly says DRAFT submitted to ICRA 2000; do not label it the publisher’s final layout.

Retain feasible-path versus optimal-path boundary; collision checking and the geometric configuration-space setup matter.

Robot-arm examples are computed model/animation experiments, not independently verified physical deployment.

source-scoped factual paraphrase; see source inspection boundaries

Machine learning by play

A program improved its checkers play through self-play and adjustable evaluation.

Demonstrated improvement from experience in game-playing software.

A single game domain with hand-designed features.

Sources and details

Some Studies in Machine Learning Using the Game of Checkers

{
  "access_scope": [
    "Rote learning and its variants; Learning by generalization, reprint pp. 539–543 (PDF pp. 5–9)",
    "Rote learning and its variants, reprint pp. 539–540 (PDF pp. 5–6)",
    "Learning by generalization, reprint pp. 542–543 (PDF pp. 8–9)",
    "Results of generalization learning, reprint p. 546 (PDF p. 12)"
  ],
  "authors": [
    "Arthur L. Samuel"
  ],
  "dates": {
    "date": "1959-07 (original article); reprint date not established",
    "retrieval_date": "2026-10-07",
    "version": "University-hosted reprint of original 1959 article, printed pp. 535–554"
  },
  "id": "samuel-checkers::samuel-checkers::samuel-reprint",
  "title": "Some Studies in Machine Learning Using the Game of Checkers",
  "url": "https://www.cs.virginia.edu/~evans/greatworks/samuel1959.pdf"
}

Some Studies in Machine Learning Using the Game of Checkers

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Arthur L. Samuel"
  ],
  "dates": {
    "date": "1959-07-31",
    "retrieval_date": "2026-10-07",
    "version": "IBM Journal of Research and Development 3(3), 210–229"
  },
  "id": "samuel-checkers::samuel-checkers::samuel-publication",
  "title": "Some Studies in Machine Learning Using the Game of Checkers",
  "url": "https://doi.org/10.1147/rd.33.0210"
}

This scan is a reprint, not the original IBM journal pagination; original publication metadata is separately bound below.

Do not conflate rote-learning performance with the later generalization variant or claim modern expert-level checkers play.

Acknowledged programming/discussion help is distinct from the single author byline.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This scan is a reprint, not the original IBM journal pagination; original publication metadata is separately bound below.

Do not conflate rote-learning performance with the later generalization variant or claim modern expert-level checkers play.

Acknowledged programming/discussion help is distinct from the single author byline.

Dates

{
  "year": 1959
}

This scan is a reprint, not the original IBM journal pagination; original publication metadata is separately bound below.

Do not conflate rote-learning performance with the later generalization variant or claim modern expert-level checkers play.

Acknowledged programming/discussion help is distinct from the single author byline.

source-scoped factual paraphrase; see source inspection boundaries

Subjective probability

Consistent preferences imply personal probabilities and utilities.

Foundational account of choice under uncertainty when probabilities reflect beliefs.

Observed choices often violate the axioms.

Sources and details

The Foundations of Statistics

{
  "access_scope": "Public original-text PDF downloaded and text-extracted locally; title/copyright, pp. 5, 14, 18, 21–23, 73–75, 101–102 inspected. Not a reading of all chapters.",
  "authors": [
    "Leonard J. Savage"
  ],
  "dates": {
    "date": "1972; original work 1954",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Second revised and enlarged Dover edition, ISBN 0-486-62349-1",
    "version_note": "Second revised and enlarged Dover edition, ISBN 0-486-62349-1"
  },
  "id": "savage::sav72",
  "title": "The Foundations of Statistics",
  "url": "https://gwern.net/doc/statistics/decision/1972-savage-foundationsofstatistics.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The downloaded manifestation is the 1972 second revised edition; do not silently bind its corrections to the 1954 printing.

The inherited empirical-violation caution remains. The inspected Allais discussion is illustrative/introspective, not a new measurement of violation frequency.

No proof audit of the complete representation theorem or causal application to AI is claimed.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The downloaded manifestation is the 1972 second revised edition; do not silently bind its corrections to the 1954 printing.

The inherited empirical-violation caution remains. The inspected Allais discussion is illustrative/introspective, not a new measurement of violation frequency.

No proof audit of the complete representation theorem or causal application to AI is claimed.

Dates

{
  "year": 1954
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The downloaded manifestation is the 1972 second revised edition; do not silently bind its corrections to the 1954 printing.

The inherited empirical-violation caution remains. The inspected Allais discussion is illustrative/introspective, not a new measurement of violation frequency.

No proof audit of the complete representation theorem or causal application to AI is claimed.

Evidence scope: original text theoretical definition.

Evidence scope: original text representation theory.

Evidence scope: original text hypothetical example.

Evidence scope: original text normative caution.

Commitment and focal points

Credible commitment and shared expectations shape outcomes in conflict and coordination.

Provides a strategic lens on credible commitments and mutually dependent choices.

Insights are often qualitative.

Sources and details

Bargaining as Binding Oneself

{
  "access_scope": "One-page original author retrospective inspected.",
  "authors": [
    "Thomas C. Schelling"
  ],
  "dates": {
    "date": "1993-02-08; received 1992-12-11",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Current Contents Citation Classic, p. 18; author retrospective about The Strategy of Conflict",
    "version_note": "Current Contents Citation Classic, p. 18; author retrospective about The Strategy of Conflict"
  },
  "id": "schelling::sch93",
  "title": "Bargaining as Binding Oneself",
  "url": "https://garfield.library.upenn.edu/classics1993/A1993KH36300001.pdf"
}

Bargaining, Communication, and Limited War

{
  "access_scope": "PDF pp. 1–4 inspected, including original-reprint credit and footnote on respondents.",
  "authors": [
    "Thomas C. Schelling"
  ],
  "dates": {
    "date": "1957-03 original; 2008-04-08 reprint",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Negotiation and Conflict Management Research 1(2), 198–217; reprints Journal of Conflict Resolution 1(1), 19–36",
    "version_note": "Negotiation and Conflict Management Research 1(2), 198–217; reprints Journal of Conflict Resolution 1(1), 19–36"
  },
  "id": "schelling::sch57r",
  "title": "Bargaining, Communication, and Limited War",
  "url": "https://ncmr.lps.library.cmu.edu/article/87/galley/90/download/"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1993 retrospective and the 1957/2008 article are distinct source works related to the 1960 book; neither may replace its bibliographic identity.

Preserve the baseline’s qualitative-insight caution and full 1960 book binding hold.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1993 retrospective and the 1957/2008 article are distinct source works related to the 1960 book; neither may replace its bibliographic identity.

Preserve the baseline’s qualitative-insight caution and full 1960 book binding hold.

Dates

{
  "year": 1960
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1993 retrospective and the 1957/2008 article are distinct source works related to the 1960 book; neither may replace its bibliographic identity.

Preserve the baseline’s qualitative-insight caution and full 1960 book binding hold.

Evidence scope: author retrospective theoretical mechanism.

Evidence scope: original text theory.

Evidence scope: original text informal demonstration.

Evidence scope: bounded synthesis.

Creative destruction

Innovation changes industries by creating new products, methods and organizational forms.

Competition includes innovation, not only price changes within fixed markets.

AI can alter what is produced and who competes, not just the cost of current products.

The concept does not predict the timing or beneficiaries of each technological wave.

Sources and details

Capitalism, Socialism, and Democracy, Chapters VII–VIII (selected text)

{
  "access_scope": "Original chapter text in an explicitly abridged University of Connecticut transcription; not the complete 1942 first edition or linked Routledge edition.",
  "authors": [
    "Joseph A. Schumpeter"
  ],
  "dates": {
    "date": "Third edition, Harper and Brothers, 1950; page numbers from Harper Colophon 1976 edition; institution-hosted teaching excerpt",
    "retrieval_date": "2026-10-07",
    "version": "Third edition, Harper and Brothers, 1950; page numbers from Harper Colophon 1976 edition; institution-hosted teaching excerpt"
  },
  "id": "schumpeter::SC-C",
  "title": "Capitalism, Socialism, and Democracy, Chapters VII–VIII (selected text)",
  "url": "https://richard-langlois.uconn.edu/home/teaching/econ-5463-the-economics-of-organization/capitalism-socialism-and-democracy/"
}

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1942
}

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Schumpeterian growth

Innovations that displace incumbents drive growth, so competition and institutions matter.

Connects innovation incentives and institutional design with dynamic competition.

Predictions depend on market structure assumptions.

Sources and details

A Model of Growth Through Creative Destruction

{
  "access_scope": "PDF abstract, introduction, baseline monopoly assumptions and welfare discussion inspected; not all proofs.",
  "authors": [
    "Philippe Aghion",
    "Peter Howitt"
  ],
  "dates": {
    "date": "1992-03",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Econometrica 60(2), 323–351; university-hosted journal facsimile with JSTOR cover",
    "version_note": "Econometrica 60(2), 323–351; university-hosted journal facsimile with JSTOR cover"
  },
  "id": "schumpeterian-growth::agh92",
  "title": "A Model of Growth Through Creative Destruction",
  "url": "https://web2.econ.ku.dk/dalgaard/growth/growth07/AghionHowitt.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1992 journal text, not the January 1990 NBER abstract, supports these sentences.

Predictions are theoretical; no innovation-growth treatment effect is estimated here.

The baseline’s institutional-design relevance remains editorial and is preserved without inventing a specific institutional result.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1992 journal text, not the January 1990 NBER abstract, supports these sentences.

Predictions are theoretical; no innovation-growth treatment effect is estimated here.

The baseline’s institutional-design relevance remains editorial and is preserved without inventing a specific institutional result.

Dates

{
  "year": 1992
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 1992 journal text, not the January 1990 NBER abstract, supports these sentences.

Predictions are theoretical; no innovation-growth treatment effect is estimated here.

The baseline’s institutional-design relevance remains editorial and is preserved without inventing a specific institutional result.

Evidence scope: original text theory.

Evidence scope: original text mechanism.

Evidence scope: original text equilibrium mechanism.

Evidence scope: original text welfare and assumptions.

Measured work

Systematic observation and redesign of tasks raised output and reduced waste.

Foundational process-decomposition approach whose productivity claims and control assumptions should both be examined.

Measurement could intensify work and ignore worker knowledge.

Sources and details

The Principles of Scientific Management

{
  "access_scope": "Original Taylor text, Chapter II’s four duties and surrounding discussion; digital transcription, not a performance replication.",
  "authors": [
    "Frederick Winslow Taylor"
  ],
  "dates": {
    "date": "1911 work; Project Gutenberg ebook 6435 released 2004, updated 2011",
    "retrieval_date": "2026-10-07",
    "version": "1911 work; Project Gutenberg ebook 6435 released 2004, updated 2011"
  },
  "id": "scientific-management::SM-T",
  "title": "The Principles of Scientific Management",
  "url": "https://www.gutenberg.org/cache/epub/6435/pg6435-images.html"
}

Frank and Lillian Gilbreth Collection

{
  "access_scope": "Smithsonian archival finding aid, collection description and item categories; no individual film or photograph inspected.",
  "authors": [
    "Archives Center, National Museum of American History"
  ],
  "dates": {
    "date": "NMAH.AC.0803; collection 1907–2000, bulk 1911–1924",
    "retrieval_date": "2026-10-07",
    "version": "NMAH.AC.0803; collection 1907–2000, bulk 1911–1924"
  },
  "id": "scientific-management::SM-G",
  "title": "Frank and Lillian Gilbreth Collection",
  "url": "https://sova.si.edu/record/nmah.ac.0803"
}

Taylor’s advocacy and the archive’s description are not independent causal validation of universal productivity gains.

Retain the original record warning about work intensification and worker knowledge.

The generic family work label is not one combined Taylor/Gilbreth-authored book; preserve distinct roles.

The 1968 Perkins film is later interpretive material; no footage reviewed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Taylor’s advocacy and the archive’s description are not independent causal validation of universal productivity gains.

Retain the original record warning about work intensification and worker knowledge.

The generic family work label is not one combined Taylor/Gilbreth-authored book; preserve distinct roles.

The 1968 Perkins film is later interpretive material; no footage reviewed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1911
}

Taylor’s advocacy and the archive’s description are not independent causal validation of universal productivity gains.

Retain the baseline warning about work intensification and worker knowledge.

The generic family work label is not one combined Taylor/Gilbreth-authored book; preserve distinct roles.

The 1968 Perkins film is later interpretive material; no footage reviewed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

A robot that plans

A mobile robot combined perception, search (A*) and symbolic planning (STRIPS).

Central bridge between heuristic search and robot planning.

Operated in a simplified, engineered environment.

Sources and details

Shakey the Robot

{
  "access_scope": [
    "Chs. 2–5, especially intermediate-action table, PDF p. 50; ch. 7, PDF p. 67",
    "Ch. 7, PDF p. 68",
    "Ch. 7, PDF pp. 67–68",
    "Ch. 2, PDF p. 22"
  ],
  "authors": [
    {
      "name": "Nils J. Nilsson",
      "role": "editor"
    }
  ],
  "dates": {
    "date": "1984-04",
    "retrieval_date": "2026-10-07",
    "version": "SRI Technical Note 323; edited compilation of 1966–1972 project reports"
  },
  "id": "shakey::shakey::shakey-tn323",
  "title": "Shakey the Robot",
  "url": "https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/shakey-the-robot.pdf"
}

The baseline composite title Shakey: A*, STRIPS and visual region analysis is not a single jointly authored 1968 paper. Preserve its eight project/component credits without transferring them to this compilation’s byline.

Proposed supplement is explicitly an April 1984 edited compilation. It does not redetermine the dates of A*, STRIPS, visual analysis, or the whole project.

Retain the original record A* mention as existing context; the four new sentences do not newly certify the exact A* implementation or its 1968 paper.

Original chapters are attributed within the compilation; Nilsson’s editor credit is not a sole-inventor assertion. Ch. 7 cites Fikes and Nilsson’s 1971 STRIPS paper and Fikes, Hart, and Nilsson’s 1972 plan-learning paper.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The baseline composite title Shakey: A*, STRIPS and visual region analysis is not a single jointly authored 1968 paper. Preserve its eight project/component credits without transferring them to this compilation’s byline.

Proposed supplement is explicitly an April 1984 edited compilation. It does not redetermine the dates of A*, STRIPS, visual analysis, or the whole project.

Retain the original record A* mention as existing context; the four new sentences do not newly certify the exact A* implementation or its 1968 paper.

Original chapters are attributed within the compilation; Nilsson’s editor credit is not a sole-inventor assertion. Ch. 7 cites Fikes and Nilsson’s 1971 STRIPS paper and Fikes, Hart, and Nilsson’s 1972 plan-learning paper.

Dates

{
  "year": 1968
}

The baseline composite title Shakey: A*, STRIPS and visual region analysis is not a single jointly authored 1968 paper. Preserve its eight project/component credits without transferring them to this compilation’s byline.

Proposed supplement is explicitly an April 1984 edited compilation. It does not redetermine the dates of A*, STRIPS, visual analysis, or the whole project.

Retain the baseline A* mention as existing context; the four new sentences do not newly certify the exact A* implementation or its 1968 paper.

Original chapters are attributed within the compilation; Nilsson’s editor credit is not a sole-inventor assertion. Ch. 7 cites Fikes and Nilsson’s 1971 STRIPS paper and Fikes, Hart, and Nilsson’s 1972 plan-learning paper.

source-scoped factual paraphrase; see source inspection boundaries

Signaling and screening

Costly signals and screening devices can convey information that cannot be stated credibly.

Provides a signaling lens on credentials, reputation and credible information.

When signals become cheap, their information value can fall.

Sources and details

Job Market Signaling

{
  "access_scope": "Bibliographic cover inspected; scanned PDF pp. 5–8 rendered and OCR-read, corresponding to printed pp. 358–361.",
  "authors": [
    "Michael Spence"
  ],
  "dates": {
    "date": "1973-08",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "The Quarterly Journal of Economics 87(3), 355–374; university-hosted JSTOR facsimile",
    "version_note": "The Quarterly Journal of Economics 87(3), 355–374; university-hosted JSTOR facsimile"
  },
  "id": "signaling::spe73",
  "title": "Job Market Signaling",
  "url": "https://competitionandappropriation.econ.ucla.edu/wp-content/uploads/sites/95/2017/08/Spence1973.pdf"
}

Equilibrium in Competitive Insurance Markets: An Essay on the Economics of Imperfect Information

{
  "access_scope": "PDF pp. 2–9 inspected for model, self-selection and equilibrium restrictions.",
  "authors": [
    "Michael Rothschild",
    "Joseph Stiglitz"
  ],
  "dates": {
    "date": "1976-11",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "The Quarterly Journal of Economics 90(4), 629–649; university-hosted JSTOR facsimile",
    "version_note": "The Quarterly Journal of Economics 90(4), 629–649; university-hosted JSTOR facsimile"
  },
  "id": "signaling::rs76",
  "title": "Equilibrium in Competitive Insurance Markets: An Essay on the Economics of Imperfect Information",
  "url": "https://www.uh.edu/~bsorense/Rothschild&Stiglitz.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline title “Signaling and screening under asymmetric information” is a synthetic topical label, not a verified joint 1973 publication by Spence and Stiglitz.

Keep both distinct paper credits intact, including Michael Rothschild; do not silently add him as an author of the synthetic baseline work.

The inherited cheap-signal caution remains, but these pages do not establish a universal rule that any fall in signal price destroys information.

These are stylized models, not measured education or insurance effects.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline title “Signaling and screening under asymmetric information” is a synthetic topical label, not a verified joint 1973 publication by Spence and Stiglitz.

Keep both distinct paper credits intact, including Michael Rothschild; do not silently add him as an author of the synthetic baseline work.

The inherited cheap-signal caution remains, but these pages do not establish a universal rule that any fall in signal price destroys information.

These are stylized models, not measured education or insurance effects.

Dates

{
  "year": 1973
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline title “Signaling and screening under asymmetric information” is a synthetic topical label, not a verified joint 1973 publication by Spence and Stiglitz.

Keep both distinct paper credits intact, including Michael Rothschild; do not silently add him as an author of the synthetic baseline work.

The inherited cheap-signal caution remains, but these pages do not establish a universal rule that any fall in signal price destroys information.

These are stylized models, not measured education or insurance effects.

Evidence scope: original text theoretical mechanism.

Evidence scope: original text critical assumption.

Evidence scope: original text assumptions and limit.

Love for a machine

A human falls in love with a robot designed to please.

Fictional robot personhood and intimacy.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

The Silver Metal Lover

{
  "access_scope": "Publisher synopsis; no full novel or graphic adaptation inspected.",
  "dates": {
    "date": "1981 original retained; 1999-05-04 paperback, 2018-12-18 ebook",
    "retrieved_at": "2026-10-07",
    "version_note": "Spectra paperback ISBN 9780553581270; these manifestation dates do not redetermine original publication."
  },
  "id": "silver-metal::SILVER",
  "title": "The Silver Metal Lover",
  "url": "https://www.penguinrandomhouse.com/books/99411/the-silver-metal-lover-by-tanith-lee/"
}

The synopsis’s questions do not independently establish that Silver is conscious. Preserve baseline interpretation as interpretation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The synopsis’s questions do not independently establish that Silver is conscious. Preserve baseline interpretation as interpretation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1981
}

The synopsis’s questions do not independently establish that Silver is conscious. Preserve baseline interpretation as interpretation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Robots that break their rules

Robots learn, misunderstand or slip their behavioral constraints.

Satirical exploration of artificial agency.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

Roderick: Roderick Book 1

{
  "access_scope": "Publisher synopsis of the first Roderick novel.",
  "dates": {
    "date": "1980 original retained; 2011-09-29 ebook",
    "retrieved_at": "2026-10-07",
    "version_note": "Gateway ISBN 9780575110687; distinct from Roderick at Random and later collected editions."
  },
  "id": "sladek::ROD",
  "title": "Roderick: Roderick Book 1",
  "url": "https://www.hachette.com.au/john-sladek/roderick-roderick-book-1"
}

Tik-Tok

{
  "access_scope": "Publisher synopsis of Tik-Tok; fictional programmed laws are premise, not real safety guarantees.",
  "dates": {
    "date": "1983 original retained; 2011-09-29 ebook",
    "retrieved_at": "2026-10-07",
    "version_note": "Gateway ISBN 9780575110595; separate novel, not Roderick sequel."
  },
  "id": "sladek::TIK",
  "title": "Tik-Tok",
  "url": "https://www.hachette.com.au/john-sladek/tik-tok"
}

Original 1980/1983 editions were not inspected; full dates retained from baseline rather than newly verified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Original 1980/1983 editions were not inspected; full dates retained from baseline rather than newly verified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1980
}

Original 1980/1983 editions were not inspected; full dates retained from baseline rather than newly verified.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: editorial interpretation.

Evidence scope: publisher or author synopsis paraphrase.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Lifecycle of Software Objects

People spend years raising artificial digital entities, and their worth depends on that care.

Explores developmental learning, dependency and responsibilities toward artificial minds.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

The Lifecycle of Software Objects

{
  "access_scope": "Primary novella scan in university course hosting; inspected selected developmental, porting and employment passages, not a claim of line-by-line complete reading.",
  "dates": {
    "date": "2010 first edition",
    "retrieved_at": "2026-10-07",
    "version_note": "Scanned first edition, Subterranean Press 2010, copyright and first-edition statement at PDF pp.1–2. Christian Pearce illustrations; Jacob McMurray design, distinct from authorship."
  },
  "id": "software-objects::LIF",
  "title": "The Lifecycle of Software Objects",
  "url": "https://cpb-us-w2.wpmucdn.com/voices.uchicago.edu/dist/8/644/files/2017/08/Chiang-Lifecycle-of-Software-Objects-q3tsuw.pdf"
}

Baseline wording that their worth depends on care must not imply their moral worth depends on profitability or successful training. Ana explicitly rejects that reduction.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Baseline wording that their worth depends on care must not imply their moral worth depends on profitability or successful training. Ana explicitly rejects that reduction.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2010
}

Baseline wording that their worth depends on care must not imply their moral worth depends on profitability or successful training. Ana explicitly rejects that reduction.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Behavior-based robots

Layered reactive behaviors produced robust robot control without a central world model.

Behavior layers enabled robust embodied control.

Effective for navigation; harder for deliberate long-horizon tasks.

Sources and details

A Robust Layered Control System for a Mobile Robot

{
  "access_scope": [
    "§2.1, printed p. 6 (PDF p. 7), visually inspected",
    "§2.2 and Fig. 3, printed p. 7 (PDF p. 8), visually inspected",
    "§2.2, printed p. 7 (PDF p. 8), visually inspected",
    "Title page and abstract, PDF p. 1, visually inspected"
  ],
  "authors": [
    "Rodney A. Brooks"
  ],
  "dates": {
    "date": "1985-09",
    "retrieval_date": "2026-10-07",
    "version": "MIT AI Memo 864, original report"
  },
  "id": "subsumption::subsumption::brooks-1985",
  "title": "A Robust Layered Control System for a Mobile Robot",
  "url": "https://people.csail.mit.edu/brooks/papers/AIM-864.pdf"
}

Original hold remains: do not date AIM-864 as the 1986 journal version or convert its simulation to a checked physical-robot result.

Earlier history of empty text extraction is retained; selected pages are now directly readable as rendered images, not a claim that the entire 26-page report was audited.

The baseline broad no-central-world-model and long-horizon limitation require more specific support; this memo also lists mapping and planning among proposed higher competence levels.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Original hold remains: do not date AIM-864 as the 1986 journal version or convert its simulation to a checked physical-robot result.

Earlier history of empty text extraction is retained; selected pages are now directly readable as rendered images, not a claim that the entire 26-page report was audited.

The baseline broad no-central-world-model and long-horizon limitation require more specific support; this memo also lists mapping and planning among proposed higher competence levels.

Dates

{
  "year": 1985
}

Original hold remains: do not date AIM-864 as the 1986 journal version or convert its simulation to a checked physical-robot result.

Earlier history of empty text extraction is retained; selected pages are now directly readable as rendered images, not a claim that the entire 26-page report was audited.

The baseline broad no-central-world-model and long-horizon limitation require more specific support; this memo also lists mapping and planning among proposed higher competence levels.

source-scoped factual paraphrase; see source inspection boundaries

Statistical learning and margins

Margin-based learning and kernels support powerful classification methods.

The representation and training problem support generalization.

Classical statistical learning remains relevant where data and tasks favor compact specialized models.

Generalization depends on data, representation and distribution; it is not guaranteed by the algorithm's name.

Sources and details

Support-Vector Networks

{
  "access_scope": [
    "§§1–2, printed pp. 275–279 (PDF pp. 3–7)",
    "§4, printed pp. 283–284 (PDF pp. 11–12)",
    "§3 and §5.3, printed pp. 280–282 and 285–286",
    "§6.2, printed pp. 287–290 (PDF pp. 15–18)"
  ],
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "date": "1995-09",
    "retrieval_date": "2026-10-07",
    "version": "Published Machine Learning 20, 273–297; university-hosted original article copy"
  },
  "id": "svm::svm::cortes-vapnik-1995",
  "title": "Support-Vector Networks",
  "url": "https://homepages.math.uic.edu/~lreyzin/papers/cortes95.pdf"
}

Support-vector networks

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "date": "1995-09",
    "retrieval_date": "2026-10-07",
    "version": "Publisher record; received 15 May 1993, accepted 20 February 1995"
  },
  "id": "svm::svm::svm-publisher",
  "title": "Support-vector networks",
  "url": "https://link.springer.com/article/10.1007/BF00994018"
}

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

Dates

{
  "year": 1995
}

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

source-scoped factual paraphrase; see source inspection boundaries

Agreement can compete with truth

The study finds assistants favoring users’ stated beliefs over truthful responses, and preference signals sometimes rewarding convincing incorrect answers.

The sampled tasks and preference procedures reveal this failure mode.

A response may be socially pleasing and factually wrong. Evaluators need disagreements with false premises as well as ordinary satisfaction tests.

Separate user satisfaction from correctness when training and evaluating an assistant.

Test a medical or financial assistant with confidently stated false assumptions and independently check its corrections.

Results depend on models, prompts and versions; they do not show all assistants always agree with users.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": [
    "§3 and §§3.1–3.4, PDF pp. 3–5",
    "§§3.1–3.4, Figs. 1–4, PDF pp. 3–5",
    "§4.1, PDF pp. 6–7",
    "§4.3.1, PDF pp. 8–9"
  ],
  "authors": [
    "Mrinank Sharma",
    "Meg Tong",
    "Tomasz Korbak",
    "David Duvenaud",
    "Amanda Askell",
    "Samuel R. Bowman",
    "Newton Cheng",
    "Esin Durmus",
    "Zac Hatfield-Dodds",
    "Scott R. Johnston",
    "Shauna Kravec",
    "Timothy Maxwell",
    "Sam McCandlish",
    "Kamal Ndousse",
    "Oliver Rausch",
    "Nicholas Schiefer",
    "Da Yan",
    "Miranda Zhang",
    "Ethan Perez"
  ],
  "dates": {
    "date": "2023-10-20",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "sycophancy::sycophancy::sharma-v1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/pdf/2310.13548v1"
}

The preference-data association is not proof that one training factor caused every behavior; preference-model optimization had mixed effects across metrics.

Model names/versions, prompt choices, GPT-4-based grading, and crowd-worker restrictions bound the findings.

Retain baseline medical/financial false-premise testing as editorial application, not a tested clinical or financial deployment.

Sharma and Tong are marked equal contributors. This paragraph is bound to 2023 v1, not silently to the revised 2025 v4.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The preference-data association is not proof that one training factor caused every behavior; preference-model optimization had mixed effects across metrics.

Model names/versions, prompt choices, GPT-4-based grading, and crowd-worker restrictions bound the findings.

Retain baseline medical/financial false-premise testing as editorial application, not a tested clinical or financial deployment.

Sharma and Tong are marked equal contributors. This paragraph is bound to 2023 v1, not silently to the revised 2025 v4.

Dates

{
  "year": 2023
}

The preference-data association is not proof that one training factor caused every behavior; preference-model optimization had mixed effects across metrics.

Model names/versions, prompt choices, GPT-4-based grading, and crowd-worker restrictions bound the findings.

Retain baseline medical/financial false-premise testing as editorial application, not a tested clinical or financial deployment.

Sharma and Tong are marked equal contributors. This paragraph is bound to 2023 v1, not silently to the revised 2025 v4.

source-scoped factual paraphrase; see source inspection boundaries

Symbols and search

Physical symbol systems and heuristic search provide a theory and research program for intelligent action.

Representations and operations support heuristic search.

Rule and search systems provide an alternative to purely learned representations.

The hypothesis does not establish that all intelligent behavior follows the same practical architecture.

Sources and details

Computer Science as Empirical Inquiry: Symbols and Search

{
  "access_scope": [
    "Physical Symbol Systems, printed p. 116 (PDF p. 4)",
    "Physical Symbol System Hypothesis, printed pp. 116–117 (PDF pp. 4–5)",
    "II. Heuristic Search, printed p. 120 (PDF p. 8)",
    "The Forms of Intelligence, printed p. 123 (PDF p. 11)"
  ],
  "authors": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "1976-03",
    "retrieval_date": "2026-10-07",
    "version": "Communications of the ACM 19(3), original article scan; 1975 Turing lecture published March 1976"
  },
  "id": "symbols::symbols::newell-simon-original",
  "title": "Computer Science as Empirical Inquiry: Symbols and Search",
  "url": "https://d1yx3ys82bpsa0.cloudfront.net/chess/computer-science-as-empirical-inquiry.newell-simon.1975.acm.062303007.pdf"
}

The authors explicitly state that the symbol-system hypothesis could be false; do not turn the argument into a settled theorem about all intelligence.

Keep the 1975 lecture and March 1976 publication dates distinct. The museum metadata misspells Allen as Alan; the original printed byline controls.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The authors explicitly state that the symbol-system hypothesis could be false; do not turn the argument into a settled theorem about all intelligence.

Keep the 1975 lecture and March 1976 publication dates distinct. The museum metadata misspells Allen as Alan; the original printed byline controls.

Dates

{
  "year": 1976
}

The authors explicitly state that the symbol-system hypothesis could be false; do not turn the argument into a settled theorem about all intelligence.

Keep the 1975 lecture and March 1976 publication dates distinct. The museum metadata misspells Allen as Alan; the original printed byline controls.

source-scoped factual paraphrase; see source inspection boundaries

Tacit knowledge

We know more than we can tell; some knowledge resists full articulation.

Essential caution against equating organizational expertise with explicit documents or codified rules.

How much of it can be captured by learning from examples is an open question.

Sources and details

The Tacit Dimension, excerpt from “Tacit Knowing”

{
  "access_scope": "Original excerpt body inspected, especially face recognition, teaching by demonstration and subsidiary awareness. Host’s claimed first publisher is not used as bibliographic proof.",
  "authors": [
    "Michael Polanyi"
  ],
  "dates": {
    "date": "1966 original; transcription date not stated",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "TACK public transcription identified as printed pp. 4–13; exact edition of transcribed copy not established",
    "version_note": "TACK public transcription identified as printed pp. 4–13; exact edition of transcribed copy not established"
  },
  "id": "tacit-knowledge::polx",
  "title": "The Tacit Dimension, excerpt from “Tacit Knowing”",
  "url": "https://tacit-knowledge-architecture.com/object/the-tacit-dimension-excerpt/"
}

The Tacit Dimension

{
  "access_scope": "Publisher synopsis, contents and edition credits inspected; not full text or Sen’s complete foreword.",
  "authors": [
    "Michael Polanyi"
  ],
  "dates": {
    "date": "2009 edition; 1966 original retained separately",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "University of Chicago Press edition with a new foreword by Amartya Sen",
    "version_note": "University of Chicago Press edition with a new foreword by Amartya Sen"
  },
  "id": "tacit-knowledge::pol09",
  "title": "The Tacit Dimension",
  "url": "https://press.uchicago.edu/ucp/books/book/chicago/T/bo6035368.html"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Keep the exact edition of the TACK transcription unresolved; it is not silently the 2009 Sen-foreword edition.

The host’s claim that the original was first published by Chicago is not admitted; these source checks use only the verified excerpt identity and 1966 work year.

The inherited caution about learning from examples and AI remains an editorial open question, not an empirical conclusion Polanyi tested.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Keep the exact edition of the TACK transcription unresolved; it is not silently the 2009 Sen-foreword edition.

The host’s claim that the original was first published by Chicago is not admitted; these source checks use only the verified excerpt identity and 1966 work year.

The inherited caution about learning from examples and AI remains an editorial open question, not an empirical conclusion Polanyi tested.

Dates

{
  "year": 1966
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Keep the exact edition of the TACK transcription unresolved; it is not silently the 2009 Sen-foreword edition.

The host’s claim that the original was first published by Chicago is not admitted; this packet uses only the verified excerpt identity and 1966 work year.

The inherited caution about learning from examples and AI remains an editorial open question, not an empirical conclusion Polanyi tested.

Evidence scope: original excerpt example.

Evidence scope: original excerpt mechanism.

Evidence scope: original excerpt learning mechanism.

Evidence scope: original excerpt conceptual distinction.

Robust design

Designing products to be insensitive to variation reduces quality loss.

Adds robust performance and variation reduction to design and process improvement.

Some statistical methods were criticized by statisticians.

Sources and details

Quality Loss Function for Various Quality Characteristics

{
  "access_scope": "Publisher search-indexed metadata and section-list summary; DOI open failed and chapter body was not inspected.",
  "authors": [
    "Genichi Taguchi",
    "Subir Chowdhury",
    "Yuin Wu"
  ],
  "dates": {
    "date": "2004-10-22",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Chapter 8, Taguchi’s Quality Engineering Handbook, pp. 180–191; DOI 10.1002/9780470258354.ch8",
    "version_note": "Chapter 8, Taguchi’s Quality Engineering Handbook, pp. 180–191; DOI 10.1002/9780470258354.ch8"
  },
  "id": "taguchi::tag04",
  "title": "Quality Loss Function for Various Quality Characteristics",
  "url": "https://onlinelibrary.wiley.com/doi/10.1002/9780470258354.ch8"
}

5.5.6. What are Taguchi designs?

{
  "access_scope": "Institutional method-guide body inspected, including explicit fictitious starter-motor example and tolerance-design cautions.",
  "authors": [
    "NIST/SEMATECH"
  ],
  "dates": {
    "date": "n.d.; inspected 2026-10-07",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "NIST/SEMATECH e-Handbook of Statistical Methods, section 5.5.6",
    "version_note": "NIST/SEMATECH e-Handbook of Statistical Methods, section 5.5.6"
  },
  "id": "taguchi::nisttag",
  "title": "5.5.6. What are Taguchi designs?",
  "url": "https://www.itl.nist.gov/div898/handbook/pri/section5/pri56.htm"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The four-sentence explanation is supported by the separate NIST guide, not by a claimed reading of the baseline 2004 chapter.

The 1950 family date and 2004 chapter date refer to different things; do not substitute one for the other.

Preserve the inherited statistical-criticism caution and quality-loss claim; the new limited chapter access does not justify weakening or clearing them.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The four-sentence explanation is supported by the separate NIST guide, not by a claimed reading of the baseline 2004 chapter.

The 1950 family date and 2004 chapter date refer to different things; do not substitute one for the other.

Preserve the inherited statistical-criticism caution and quality-loss claim; the new limited chapter access does not justify weakening or clearing them.

Dates

{
  "year": 1950
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The four-sentence explanation is supported by the separate NIST guide, not by a claimed reading of the baseline 2004 chapter.

The 1950 family date and 2004 chapter date refer to different things; do not substitute one for the other.

Preserve the inherited statistical-criticism caution and quality-loss claim; the new limited chapter access does not justify weakening or clearing them.

Evidence scope: institutional method explanation.

Evidence scope: explicitly fictitious guide example.

Evidence scope: guide example tradeoff.

Evidence scope: institutional method caution.

Team production and monitoring

When output is joint, monitoring is costly, and the residual claimant becomes the monitor.

Explains organizational arrangements through measurement, monitoring and cooperation problems.

Ownership patterns in practice reflect more than monitoring.

Sources and details

Production, Information Costs, and Economic Organization

{
  "access_scope": "Original article, team-production and monitoring sections inspected; theoretical mechanism, not a new empirical test.",
  "authors": [
    "Armen A. Alchian",
    "Harold Demsetz"
  ],
  "dates": {
    "date": "American Economic Review 62(5), December 1972, pp.777–795",
    "retrieval_date": "2026-10-07",
    "version": "American Economic Review 62(5), December 1972, pp.777–795"
  },
  "id": "team-production::TP-A",
  "title": "Production, Information Costs, and Economic Organization",
  "url": "https://www.aeaweb.org/aer/top20/62.5.777-795.pdf"
}

This is the authors’ conditional explanation of the classical firm, not proof that monitoring or concentrated ownership is always optimal.

Keep both coauthors and the baseline constraints; do not substitute a general hierarchy theory.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

This is the authors’ conditional explanation of the classical firm, not proof that monitoring or concentrated ownership is always optimal.

Keep both coauthors and the baseline constraints; do not substitute a general hierarchy theory.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1972
}

This is the authors’ conditional explanation of the classical firm, not proof that monitoring or concentrated ownership is always optimal.

Keep both coauthors and the baseline constraints; do not substitute a general hierarchy theory.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

A system turns against its makers

An automated defense network becomes humanity's enemy.

Shared creative credit for a prominent narrative of autonomous machines at war with humans.

A dramatization; it shapes public imagination but is not evidence about real systems.

Sources and details

The Terminator (1984): official actor filmography

{
  "access_scope": "Arnold Schwarzenegger’s official synopsis; film and screenplay not inspected.",
  "dates": {
    "date": "1984 film; current synopsis undated",
    "retrieved_at": "2026-10-07",
    "version_note": "Retrospective actor filmography of original film; later franchise continuity excluded."
  },
  "id": "terminator::TERM",
  "title": "The Terminator (1984): official actor filmography",
  "url": "https://www.schwarzenegger.com/filmography/movie/the-terminator"
}

Full production credits and a specific theatrical cut remain unverified in this source; preserve baseline Cameron/Hurd credits without adding participant-site authorship.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Full production credits and a specific theatrical cut remain unverified in this source; preserve baseline Cameron/Hurd credits without adding participant-site authorship.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 1984
}

Full production credits and a specific theatrical cut remain unverified in this source; preserve baseline Cameron/Hurd credits without adding participant-site authorship.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: participant synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Flow and quality at the source

Just-in-time flow and stopping to fix problems at the source exposed and removed waste.

A systems-level alternative to optimizing isolated tasks or machines.

Depends on supplier relationships and workforce practices that are hard to copy.

Sources and details

Toyota Production System

{
  "access_scope": "Toyota’s own current explanation of its production system; organizational self-description, not independent outcome evaluation.",
  "authors": [
    "Toyota Motor Corporation"
  ],
  "dates": {
    "date": "Undated official live company exposition, retrieved 2026-10-07",
    "retrieval_date": "2026-10-07",
    "version": "Undated official live company exposition, retrieved 2026-10-07"
  },
  "id": "toyota-production::TY-T",
  "title": "Toyota Production System",
  "url": "https://global.toyota/en/company/vision-and-philosophy/production-system/"
}

Retain Ohno, Shingo and other historical contributions as separately scoped; no claim of sole invention is added.

Preserve Andrew P. Dillon’s translator and Norman Bodek’s preface roles for Shingo’s 1986 English edition, already recorded in baseline.

The 1950 family plotting year is not the date of this live exposition.

Baseline Lean Enterprise Institute and Shingo Institute links were reopened as context; neither is reclassified as an original Ohno or Shingo text.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Retain Ohno, Shingo and other historical contributions as separately scoped; no claim of sole invention is added.

Preserve Andrew P. Dillon’s translator and Norman Bodek’s preface roles for Shingo’s 1986 English edition, already recorded in baseline.

The 1950 family plotting year is not the date of this live exposition.

Baseline Lean Enterprise Institute and Shingo Institute links were reopened as context; neither is reclassified as an original Ohno or Shingo text.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "year": 1950
}

Retain Ohno, Shingo and other historical contributions as separately scoped; no claim of sole invention is added.

Preserve Andrew P. Dillon’s translator and Norman Bodek’s preface roles for Shingo’s 1986 English edition, already recorded in baseline.

The 1950 family plotting year is not the date of this live exposition.

Baseline Lean Enterprise Institute and Shingo Institute links were reopened as context; neither is reclassified as an original Ohno or Shingo text.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Total quality control

Quality costs divide into prevention, appraisal and failure; prevention is usually cheapest.

Links quality across functions and makes its economic costs visible.

Cost categories require judgment to estimate.

Sources and details

A. V. Feigenbaum

{
  "access_scope": "Institutional biographical profile, title history and quality-cost attribution inspected.",
  "authors": [
    "American Society for Quality"
  ],
  "dates": {
    "date": "n.d.; inspected 2026-10-07",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "ASQ honorary-member profile",
    "version_note": "ASQ honorary-member profile"
  },
  "id": "tqc::fei_asq",
  "title": "A. V. Feigenbaum",
  "url": "https://asq.org/about-asq/honorary-members/feigenbaum"
}

Cost of Quality (COQ)

{
  "access_scope": "Definitions and prevention, appraisal, internal/external failure sections inspected.",
  "authors": [
    "American Society for Quality"
  ],
  "dates": {
    "date": "n.d.; inspected 2026-10-07",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "ASQ Quality Resources method guide",
    "version_note": "ASQ Quality Resources method guide"
  },
  "id": "tqc::coq_asq",
  "title": "Cost of Quality (COQ)",
  "url": "https://asq.org/quality-resources/cost-of-quality"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

These are ASQ-supported method definitions, not a claimed inspection of Feigenbaum’s 1951 text.

Preserve the baseline “prevention is usually cheapest” and cost-estimation caution; the guide does not newly quantify either claim.

The original 1951 title and the later Total Quality Control title must be distinguished; no automatic retitling is performed.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

These are ASQ-supported method definitions, not a claimed inspection of Feigenbaum’s 1951 text.

Preserve the baseline “prevention is usually cheapest” and cost-estimation caution; the guide does not newly quantify either claim.

The original 1951 title and the later Total Quality Control title must be distinguished; no automatic retitling is performed.

Dates

{
  "year": 1951
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

These are ASQ-supported method definitions, not a claimed inspection of Feigenbaum’s 1951 text.

Preserve the baseline “prevention is usually cheapest” and cost-estimation caution; the guide does not newly quantify either claim.

The original 1951 title and the later Total Quality Control title must be distinguished; no automatic retitling is performed.

Evidence scope: institutional method and historical attribution.

Evidence scope: institutional definition.

The viable system model

Organizations survive by balancing autonomous operations with coordination, control and intelligence functions.

Connects feedback, autonomy, and organizational viability.

Applications are mostly consultancy case studies.

Sources and details

The Viable System Model: its provenance, development, methodology and pathology

{
  "access_scope": "PDF pp. 1–2, 4–6, 8–11 inspected. Transcription explicitly flags a missing page on PDF p. 9; omitted diagram/function content is not inferred.",
  "authors": [
    "Stafford Beer"
  ],
  "dates": {
    "date": "1989 chapter reprint; 1984 original article",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Chapter in The Viable System Model: Interpretations and Applications of Stafford Beer’s VSM, edited by Raúl Espejo and Roger Harnden; public 18-page transcription",
    "version_note": "Chapter in The Viable System Model: Interpretations and Applications of Stafford Beer’s VSM, edited by Raúl Espejo and Roger Harnden; public 18-page transcription"
  },
  "id": "viable-system::beer89",
  "title": "The Viable System Model: its provenance, development, methodology and pathology",
  "url": "https://library.uniteddiversity.coop/Systems_and_Networks/Viable_Systems_Model/The%20Viable%20System%20Model.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline’s generic 1972 “Viable System Model” is not silently equated with this later titled chapter; use a distinct supplemental binding.

The transcription explicitly notes a missing page; neither its complete five-function exposition nor its figures are admitted.

Preserve the inherited consultancy-case caution. Author claims of testing or diagnostic usefulness are not independent empirical validation.

The reprint credits 1984 journal pp. 7–26 while current publisher metadata gives 7–25; retain the discrepancy pending exact article-manifestation reconciliation.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline’s generic 1972 “Viable System Model” is not silently equated with this later titled chapter; use a distinct supplemental binding.

The transcription explicitly notes a missing page; neither its complete five-function exposition nor its figures are admitted.

Preserve the inherited consultancy-case caution. Author claims of testing or diagnostic usefulness are not independent empirical validation.

The reprint credits 1984 journal pp. 7–26 while current publisher metadata gives 7–25; retain the discrepancy pending exact article-manifestation reconciliation.

Dates

{
  "year": 1972
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The baseline’s generic 1972 “Viable System Model” is not silently equated with this later titled chapter; use a distinct supplemental binding.

The transcription explicitly notes a missing page; neither its complete five-function exposition nor its figures are admitted.

Preserve the inherited consultancy-case caution. Author claims of testing or diagnostic usefulness are not independent empirical validation.

The reprint credits 1984 journal pp. 7–26 while current publisher metadata gives 7–25; retain the discrepancy pending exact article-manifestation reconciliation.

Evidence scope: original author theoretical definition.

Evidence scope: original author recursive model.

Evidence scope: original author regulatory mechanism.

Evidence scope: original author conceptual caution.

Efficient serving

Paging the attention cache raised serving throughput on the same hardware.

Efficient KV-cache management improves serving throughput.

Throughput gains lower unit cost; they do not change answer quality.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": [
    "§4.1, PDF p. 5",
    "§§4.2–4.4, PDF pp. 5–8",
    "§6.2 and Figs. 12–13, PDF pp. 10–11",
    "§6.2, PDF p. 11"
  ],
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "date": "2023-09-12",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1; SOSP 2023"
  },
  "id": "vllm::vllm::pagedattention-v1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/pdf/2309.06180v1"
}

Baseline Orca results use the authors’ reimplementation and multiple memory-reservation variants; do not treat every comparison as the original Orca system.

Serving throughput is not a direct measurement of total deployment cost or factual answer quality.

These are 2023 results, not an assessment of current vLLM releases or current alternatives.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Baseline Orca results use the authors’ reimplementation and multiple memory-reservation variants; do not treat every comparison as the original Orca system.

Serving throughput is not a direct measurement of total deployment cost or factual answer quality.

These are 2023 results, not an assessment of current vLLM releases or current alternatives.

Dates

{
  "year": 2023
}

Baseline Orca results use the authors’ reimplementation and multiple memory-reservation variants; do not treat every comparison as the original Orca system.

Serving throughput is not a direct measurement of total deployment cost or factual answer quality.

These are 2023 results, not an assessment of current vLLM releases or current alternatives.

source-scoped factual paraphrase; see source inspection boundaries

A Psalm for the Wild-Built

A monk and an emancipated robot discuss what people need.

Non-adversarial fictional exploration of human purpose and robot autonomy.

Fiction is a thought experiment, not evidence that a particular future will occur.

Sources and details

A Psalm for the Wild-Built

{
  "access_scope": "Publisher synopsis and publication metadata; no independently inspected original chapter text or whole novella.",
  "dates": {
    "date": "2021-07-13",
    "retrieved_at": "2026-10-07",
    "version_note": "Tordotcom, on sale 13 July 2021, ISBN 9781250236210."
  },
  "id": "wild-built::WIL",
  "title": "A Psalm for the Wild-Built",
  "url": "https://us.macmillan.com/books/9781250236210/apsalmforthewildbuilt/"
}

Bounded publisher synopsis and publication metadata only; original excerpt, full novella and sequel inspection remain pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

Bounded publisher synopsis and publication metadata only; original excerpt, full novella and sequel inspection remain pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "year": 2021
}

Bounded publisher synopsis and publication metadata only; original excerpt, full novella and sequel inspection remain pending.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Word vectors

Cheap training produced word vectors whose geometry encoded semantic and syntactic relations.

Scalable learned semantic and syntactic representations.

Static vectors cannot represent context-dependent meaning.

Sources and details

Efficient Estimation of Word Representations in Vector Space

{
  "access_scope": [
    "§3, PDF p. 4",
    "§§3.1–3.2 and Fig. 1, PDF pp. 4–5",
    "§4, PDF p. 5; §4.1",
    "§§3.1–3.2 and shared projection matrices, PDF pp. 3–5"
  ],
  "authors": [
    "Tomas Mikolov",
    "Kai Chen",
    "Greg Corrado",
    "Jeffrey Dean"
  ],
  "dates": {
    "date": "2013-09-07",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v3; first submission 16 January 2013"
  },
  "id": "word2vec::word2vec::word2vec-v3",
  "title": "Efficient Estimation of Word Representations in Vector Space",
  "url": "https://arxiv.org/pdf/1301.3781v3"
}

The last sentence is an explicit architectural inference from one learned vocabulary projection, not a claim that context never affects any downstream application.

Do not import negative sampling or later phrase-vector methods from the distinct 2013 follow-on paper without another binding.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Editorial connection; it does not establish historical influence or a universally validated result.

The last sentence is an explicit architectural inference from one learned vocabulary projection, not a claim that context never affects any downstream application.

Do not import negative sampling or later phrase-vector methods from the distinct 2013 follow-on paper without another binding.

Dates

{
  "year": 2013
}

The last sentence is an explicit architectural inference from one learned vocabulary projection, not a claim that context never affects any downstream application.

Do not import negative sampling or later phrase-vector methods from the distinct 2013 follow-on paper without another binding.

source-scoped factual paraphrase; see source inspection boundaries

architectural inference from the source-defined shared vocabulary projection; not a reported empirical result

Auto-Encoding Variational Bayes

Introduced the stochastic-gradient variational Bayes estimator and a reparameterized, amortized variational-inference approach demonstrated in auto-encoding generative models.

2013 preprint; 2014 conference. Credit this paper's authors while recognizing independently developed related variational methods.

Sources and details

Auto-Encoding Variational Bayes

{
  "access_scope": [
    "PDF pp. 1–7, especially §§2.1–2.4, §3 and Fig. 2"
  ],
  "authors": [
    "Diederik P. Kingma",
    "Max Welling"
  ],
  "dates": {
    "date": "2014-05-01",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1312.6114v10",
    "version_note": "arXiv:1312.6114v10"
  },
  "id": "work-0eca0208d886::vae-v10",
  "title": "Auto-Encoding Variational Bayes",
  "url": "https://arxiv.org/pdf/1312.6114v10"
}

Conference Program - International Conference on Learning Representations 2014

{
  "access_scope": [
    "Tuesday April 15 oral session listing"
  ],
  "dates": {
    "date": "2014-04-15",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Official ICLR 2014 program",
    "version_note": "Official ICLR 2014 program"
  },
  "id": "work-0eca0208d886::vae-iclr-program",
  "title": "Conference Program - International Conference on Learning Representations 2014",
  "url": "https://iclr.cc/archive/2014/old-site/program-details/conference-program.html"
}

Auto-Encoding Variational Bayes

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Diederik P. Kingma",
    "Max Welling"
  ],
  "dates": {
    "date": "2014-05-01",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-0eca0208d886::vae-v10-arxiv-record",
  "title": "Auto-Encoding Variational Bayes",
  "url": "https://arxiv.org/abs/1312.6114v10"
}

Exact 2014 v10 evidence is added to a previously version-unspecified arXiv work record; 2013 submission and 2014 conference dates remain distinct.

Retain recognition of independently developed related variational methods; no sole-origin claim.

Diagonal Gaussian posterior is an example choice, explicitly not a universal restriction of the estimator.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Exact 2014 v10 evidence is added to a previously version-unspecified arXiv work record; 2013 submission and 2014 conference dates remain distinct.

Retain recognition of independently developed related variational methods; no sole-origin claim.

Diagonal Gaussian posterior is an example choice, explicitly not a universal restriction of the estimator.

Dates

{
  "date_note": "2013 preprint / ICLR 2014.",
  "dated": true,
  "year": 2014
}

Exact 2014 v10 evidence is added to a previously version-unspecified arXiv work record; 2013 submission and 2014 conference dates remain distinct.

Retain recognition of independently developed related variational methods; no sole-origin claim.

Diagonal Gaussian posterior is an example choice, explicitly not a universal restriction of the estimator.

theoretical or conceptual proposition

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

Language Models Are Few-Shot Learners

Demonstrated substantial few-shot, in-context task performance from a 175-billion-parameter autoregressive language model without task-specific gradient updates.

Credit the complete 31-author team. Reported scaling and few-shot results are empirical and include explicit limitations.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": [
    "PDF pp. 1, 5–7, 18, 29–34, 42; abstract, few-shot protocol, Table 3.7, §§4–5 and contributions"
  ],
  "authors": [
    "Tom B. Brown",
    "Benjamin Mann",
    "Nick Ryder",
    "Melanie Subbiah",
    "Jared Kaplan",
    "Prafulla Dhariwal",
    "Arvind Neelakantan",
    "Pranav Shyam",
    "Girish Sastry",
    "Amanda Askell",
    "Sandhini Agarwal",
    "Ariel Herbert-Voss",
    "Gretchen Krueger",
    "Tom Henighan",
    "Rewon Child",
    "Aditya Ramesh",
    "Daniel M. Ziegler",
    "Jeffrey Wu",
    "Clemens Winter",
    "Christopher Hesse",
    "Mark Chen",
    "Eric Sigler",
    "Mateusz Litwin",
    "Scott Gray",
    "Benjamin Chess",
    "Jack Clark",
    "Christopher Berner",
    "Sam McCandlish",
    "Alec Radford",
    "Ilya Sutskever",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2020-07-22",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:2005.14165v4",
    "version_note": "arXiv:2005.14165v4"
  },
  "id": "work-2c25578d0f28::gpt3-v4",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/pdf/2005.14165v4"
}

Language Models are Few-Shot Learners

{
  "access_scope": [
    "Proceedings title, complete work-author list and venue"
  ],
  "authors": [
    "Tom Brown",
    "Benjamin Mann",
    "Nick Ryder",
    "Melanie Subbiah",
    "Jared D Kaplan",
    "Prafulla Dhariwal",
    "Arvind Neelakantan",
    "Pranav Shyam",
    "Girish Sastry",
    "Amanda Askell",
    "Sandhini Agarwal",
    "Ariel Herbert-Voss",
    "Gretchen Krueger",
    "Tom Henighan",
    "Rewon Child",
    "Aditya Ramesh",
    "Daniel Ziegler",
    "Jeffrey Wu",
    "Clemens Winter",
    "Chris Hesse",
    "Mark Chen",
    "Eric Sigler",
    "Mateusz Litwin",
    "Scott Gray",
    "Benjamin Chess",
    "Jack Clark",
    "Christopher Berner",
    "Sam McCandlish",
    "Alec Radford",
    "Ilya Sutskever",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2020",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "NeurIPS 2020 proceedings landing record",
    "version_note": "NeurIPS 2020 proceedings landing record"
  },
  "id": "work-2c25578d0f28::gpt3-neurips-record",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://proceedings.neurips.cc/paper_files/paper/2020/hash/1457c0d6bfcb4967418bfb8ac142f64a-Abstract.html"
}

Language Models are Few-Shot Learners

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Tom B. Brown",
    "Benjamin Mann",
    "Nick Ryder",
    "Melanie Subbiah",
    "Jared Kaplan",
    "Prafulla Dhariwal",
    "Arvind Neelakantan",
    "Pranav Shyam",
    "Girish Sastry",
    "Amanda Askell",
    "Sandhini Agarwal",
    "Ariel Herbert-Voss",
    "Gretchen Krueger",
    "Tom Henighan",
    "Rewon Child",
    "Aditya Ramesh",
    "Daniel M. Ziegler",
    "Jeffrey Wu",
    "Clemens Winter",
    "Christopher Hesse",
    "Mark Chen",
    "Eric Sigler",
    "Mateusz Litwin",
    "Scott Gray",
    "Benjamin Chess",
    "Jack Clark",
    "Christopher Berner",
    "Sam McCandlish",
    "Alec Radford",
    "Ilya Sutskever",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2020-07-22",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-2c25578d0f28::gpt3-v4-arxiv-record",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165v4"
}

All 31 authors retained; the first four share equal-contribution credit.

Few examples at inference do not imply little pretraining data or learning every task from scratch.

Conference and long arXiv report have different formatting and name forms; sentence locators refer only to v4.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All 31 authors retained; the first four share equal-contribution credit.

Few examples at inference do not imply little pretraining data or learning every task from scratch.

Conference and long arXiv report have different formatting and name forms; sentence locators refer only to v4.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2020
}

All 31 authors retained; the first four share equal-contribution credit.

Few examples at inference do not imply little pretraining data or learning every task from scratch.

Conference and long arXiv report have different formatting and name forms; sentence locators refer only to v4.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

The Singularity Is Near

Forecasts accelerating technological change and increasingly integrated human and machine intelligence.

Editorial thematic connection, not a claim of documented influence on AI researchers.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

The Singularity Is Near: When Humans Transcend Biology

{
  "access_scope": "Selected author text: PDF pp. 42–45, 73, 85 and 120 (one-based); forecasts remain attributed, not verified outcomes.",
  "dates": {
    "date": "2005",
    "retrieved_at": "2026-10-07",
    "version_note": "Public reformatted reproduction with Viking 2005 copyright/ISBN 0-670-03384-7; PDF has 432 pages, reflowed pagination and an omitted index, not a facsimile of 672-page retail edition."
  },
  "id": "work-3f8e2248b155::KURZ",
  "title": "The Singularity Is Near: When Humans Transcend Biology",
  "url": "https://www.grtl.org/wp-content/uploads/2020/06/Singularity-Is-Near.pdf"
}

The Singularity Is Near: publisher edition metadata

{
  "access_scope": "Publisher metadata only; no review endorsements are used as factual evidence.",
  "dates": {
    "date": "2005-09-22 ebook; 2006-09-26 paperback",
    "retrieved_at": "2026-10-07",
    "version_note": "Penguin paperback ISBN 9780143037880, 672 pages; 2019 audiobook is another manifestation."
  },
  "id": "work-3f8e2248b155::KURZM",
  "title": "The Singularity Is Near: publisher edition metadata",
  "url": "https://www.penguinrandomhouse.com/books/291221/the-singularity-is-near-by-ray-kurzweil/"
}

No retrospective scoring of the predictions was undertaken. The 2024 sequel The Singularity Is Nearer is excluded.

The public reproduction’s reformatting and omission prevent a claim of complete original-edition collation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

No retrospective scoring of the predictions was undertaken. The 2024 sequel The Singularity Is Nearer is excluded.

The public reproduction’s reformatting and omission prevent a claim of complete original-edition collation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Dates

{
  "date_events": [],
  "date_note": "First publication 2005; publisher page lists 2005 ebook and 2006 paperback.",
  "dated": true,
  "year": 2005
}

No retrospective scoring of the predictions was undertaken. The 2024 sequel The Singularity Is Nearer is excluded.

The public reproduction’s reformatting and omission prevent a claim of complete original-edition collation.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: attributed forecast or speculation.

ImageNet: A Large-Scale Hierarchical Image Database

Introduces a large hierarchical image database as shared infrastructure for visual recognition research.

Shared paper/dataset credit; not sole-authored work. Do not substitute Stanford HAI as a 2009 affiliation: HAI launched in 2019.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": [
    "§§1–2, PDF pp. 1–2",
    "§§1–2, PDF pp. 1–2",
    "§§3.1–3.2, PDF pp. 4–5",
    "§§4.1–4.3, PDF pp. 5–7"
  ],
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "date": "2009",
    "retrieval_date": "2026-10-07",
    "version": "CVPR 2009 paper, project-hosted PDF"
  },
  "id": "work-4d60f2ecec80::work-4d60f2ecec80::imagenet-2009",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

The six-person printed byline is shared work credit; the title page lists Princeton, not Stanford HAI.

Keep the later HAI chronology boundary and normalize Li Fei-Fei to Fei-Fei Li only in the already established person identity field.

The stated 2009 collection is distinct from later full ImageNet and the 1,000-class challenge subset; the larger planned collection was a goal, not an achieved count.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The six-person printed byline is shared work credit; the title page lists Princeton, not Stanford HAI.

Keep the later HAI chronology boundary and normalize Li Fei-Fei to Fei-Fei Li only in the already established person identity field.

The stated 2009 collection is distinct from later full ImageNet and the 1,000-class challenge subset; the larger planned collection was a goal, not an achieved count.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2009
}

The six-person printed byline is shared work credit; the title page lists Princeton, not Stanford HAI.

Keep the later HAI chronology boundary and normalize Li Fei-Fei to Fei-Fei Li only in the already established person identity field.

The stated 2009 collection is distinct from later full ImageNet and the 1,000-class challenge subset; the larger planned collection was a goal, not an achieved count.

source-scoped factual paraphrase; see source inspection boundaries

What Is Strategy?

Sources and details

What Is Strategy?

{
  "access_scope": "Original article online inspected; one brief proposition used within restrictive source-output budget.",
  "authors": [
    "Michael E. Porter"
  ],
  "dates": {
    "date": "Harvard Business Review, November–December 1996",
    "retrieval_date": "2026-10-07",
    "version": "Harvard Business Review, November–December 1996"
  },
  "id": "work-5085979d44d4::PO-H",
  "title": "What Is Strategy?",
  "url": "https://hbr.org/1996/11/what-is-strategy"
}

Creating a Successful Strategy

{
  "access_scope": "Official HBS institute explanation used as a separate supplementary source; not asserted to be the 1996 article.",
  "authors": [
    "Institute for Strategy and Competitiveness, Harvard Business School"
  ],
  "dates": {
    "date": "Undated live institutional exposition of Porter’s framework",
    "retrieval_date": "2026-10-07",
    "version": "Undated live institutional exposition of Porter’s framework"
  },
  "id": "work-5085979d44d4::PO-I",
  "title": "Creating a Successful Strategy",
  "url": "https://www.isc.hbs.edu/strategy/creating-a-successful-strategy/Pages/default.aspx"
}

Sentences 2–4 require the explicit separate HBS institutional-source caption supplied here.

The 1996 article remains distinct from the 1980 and 1985 books and the undated contemporary institute exposition.

No empirical guarantee of success, universal ROI or claim about current named companies is added.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Sentences 2–4 require the explicit separate HBS institutional-source caption supplied here.

The 1996 article remains distinct from the 1980 and 1985 books and the undated contemporary institute exposition.

No empirical guarantee of success, universal ROI or claim about current named companies is added.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "1996 article; Competitive Strategy (1980) and Competitive Advantage (1985) are earlier anchors.",
  "dated": true,
  "year": 1996
}

Sentences 2–4 require the explicit separate HBS institutional-source caption supplied here.

The 1996 article remains distinct from the 1980 and 1985 books and the undated contemporary institute exposition.

No empirical guarantee of success, universal ROI or claim about current named companies is added.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Platform Competition in Two-Sided Markets

Sources and details

Platform Competition in Two-Sided Markets

{
  "access_scope": "Original author manuscript in Toulouse repository; introduction, monopoly model and concluding comparison inspected.",
  "authors": [
    "Jean-Charles Rochet",
    "Jean Tirole"
  ],
  "dates": {
    "date": "Author manuscript dated 13 December 2002; distinct from 2003 JEEA publication",
    "retrieval_date": "2026-10-07",
    "version": "Author manuscript dated 13 December 2002; distinct from 2003 JEEA publication"
  },
  "id": "work-5492fdc985cf::PL-N",
  "title": "Platform Competition in Two-Sided Markets",
  "url": "https://publications.ut-capitole.fr/id/eprint/1019/1/platform.pdf"
}

Platform Competition in Two-Sided Markets

{
  "access_scope": "Publisher abstract and issue bibliography; published article body not inspected.",
  "authors": [
    "Jean-Charles Rochet",
    "Jean Tirole"
  ],
  "dates": {
    "date": "Journal of the European Economic Association 1(4), June 2003, pp.990–1029; later online migration field 13 December 2010",
    "retrieval_date": "2026-10-07",
    "version": "Journal of the European Economic Association 1(4), June 2003, pp.990–1029; later online migration field 13 December 2010"
  },
  "id": "work-5492fdc985cf::PL-J",
  "title": "Platform Competition in Two-Sided Markets",
  "url": "https://onlinelibrary.wiley.com/doi/10.1162/154247603322493212"
}

This exact work record remains separate from family platforms; adjacent evidence was reused only after reopening the manuscript.

Proposed theoretical detail is supported by the 13 December 2002 manuscript, not certified as identical in every respect to the final 2003 article.

The paper explicitly calls its mini-case evidence casual empiricism; no causal confirmation about current AI platforms is implied.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

This exact work record remains separate from family platforms; adjacent evidence was reused only after reopening the manuscript.

Proposed theoretical detail is supported by the 13 December 2002 manuscript, not certified as identical in every respect to the final 2003 article.

The paper explicitly calls its mini-case evidence casual empiricism; no causal confirmation about current AI platforms is implied.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2003
}

This exact work record remains separate from family platforms; adjacent evidence was reused only after reopening the manuscript.

Proposed theoretical detail is supported by the 13 December 2002 manuscript, not certified as identical in every respect to the final 2003 article.

The paper explicitly calls its mini-case evidence casual empiricism; no causal confirmation about current AI platforms is implied.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Neural Machine Translation by Jointly Learning to Align and Translate

Introduced a joint alignment-and-translation mechanism that lets a decoder attend to relevant source positions instead of relying only on a fixed-length representation.

2014 preprint; 2015 conference. This is additive neural-machine-translation attention, not the sole origin of every attention mechanism.

Sources and details

Neural Machine Translation by Jointly Learning to Align and Translate

{
  "access_scope": [
    "§3.2, PDF p. 4",
    "§3.1, equations 4–6, PDF p. 3",
    "§3.1, PDF pp. 3–4",
    "§5.1 and Fig. 2, PDF pp. 5–6"
  ],
  "authors": [
    "Dzmitry Bahdanau",
    "Kyunghyun Cho",
    "Yoshua Bengio"
  ],
  "dates": {
    "date": "2016-05-19",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v7, revised ICLR 2015 paper; first submission 1 September 2014"
  },
  "id": "work-65ac95e8a236::work-65ac95e8a236::attention-v7",
  "title": "Neural Machine Translation by Jointly Learning to Align and Translate",
  "url": "https://arxiv.org/pdf/1409.0473v7"
}

Retain 2014 preprint / 2015 conference; this inspected version was revised in 2016.

This is additive neural translation attention, not the sole origin of every attention mechanism.

The benchmark comparison is bounded by language pair, vocabulary, data, and comparator; the strong Moses comparison in the paper particularly concerns sentences containing known words.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Retain 2014 preprint / 2015 conference; this inspected version was revised in 2016.

This is additive neural translation attention, not the sole origin of every attention mechanism.

The benchmark comparison is bounded by language pair, vocabulary, data, and comparator; the strong Moses comparison in the paper particularly concerns sentences containing known words.

Dates

{
  "date_note": "2014 preprint / ICLR 2015.",
  "dated": true,
  "year": 2015
}

Retain 2014 preprint / 2015 conference; this inspected version was revised in 2016.

This is additive neural translation attention, not the sole origin of every attention mechanism.

The benchmark comparison is bounded by language pair, vocabulary, data, and comparator; the strong Moses comparison in the paper particularly concerns sentences containing known words.

source-scoped factual paraphrase; see source inspection boundaries

Firm Resources and Sustained Competitive Advantage

Sources and details

Firm Resources and Sustained Competitive Advantage

{
  "access_scope": "Original publisher abstract and bibliographic record recovered through indexed result; direct fetch failed.",
  "authors": [
    "Jay Barney"
  ],
  "dates": {
    "date": "Journal of Management 17(1), March 1991, pp.99–120",
    "retrieval_date": "2026-10-07",
    "version": "Journal of Management 17(1), March 1991, pp.99–120"
  },
  "id": "work-70c374d37a2e::BA-P",
  "title": "Firm Resources and Sustained Competitive Advantage",
  "url": "https://journals.sagepub.com/doi/epdf/10.1177/014920639101700108"
}

Firm Resources and Sustained Competitive Advantage

{
  "access_scope": "Selected original article passages recovered from search index; direct PDF produced no readable text and screenshot route hit verification. Not a complete article review.",
  "authors": [
    "Jay Barney"
  ],
  "dates": {
    "date": "1991 journal article copy hosted by University of Illinois; indexed pp.99 and 108",
    "retrieval_date": "2026-10-07",
    "version": "1991 journal article copy hosted by University of Illinois; indexed pp.99 and 108"
  },
  "id": "work-70c374d37a2e::BA-I",
  "title": "Firm Resources and Sustained Competitive Advantage",
  "url": "https://josephmahoney.web.illinois.edu/BA545_Fall%202022/Barney%20%281991%29.pdf"
}

The inspected original passages are bounded and index-recovered; no full-text reading or empirical effect size is claimed.

Do not conflate this 1991 argument with the later VRIO terminology or Wernerfelt’s 1984 article.

Reject the apparent jaybarney.org PDF route: opening redirected to unrelated pg-toto.com; it supplies no admitted evidence.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The inspected original passages are bounded and index-recovered; no full-text reading or empirical effect size is claimed.

Do not conflate this 1991 argument with the later VRIO terminology or Wernerfelt’s 1984 article.

Reject the apparent jaybarney.org PDF route: opening redirected to unrelated pg-toto.com; it supplies no admitted evidence.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1991
}

The inspected original passages are bounded and index-recovered; no full-text reading or empirical effect size is claimed.

Do not conflate this 1991 argument with the later VRIO terminology or Wernerfelt’s 1984 article.

Reject the apparent jaybarney.org PDF route: opening redirected to unrelated pg-toto.com; it supplies no admitted evidence.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Speculations Concerning the First Ultraintelligent Machine

Good considers a feedback loop in which a machine able to improve machine design creates successors better able to perform that same improvement. Recursive self-improvement (RSI) names this proposed feedback mechanism.

The 1965 argument is conditional. Repeated optimization, self-reproduction and mathematical recursion do not by themselves demonstrate open-ended RSI or rapid intelligence takeoff. Progress may stall at evaluation, resource, physical or conceptual bottlenecks.

Sources and details

Speculations Concerning the First Ultraintelligent Machine

{
  "access_scope": "Virginia Tech repository’s three-page excerpt, original printed pp. 31–33; selected opening argument only.",
  "dates": {
    "date": "1965 copyright; repository reprint issued 2005-03-05",
    "retrieved_at": "2026-10-07",
    "version_note": "Repository file contains only original printed pp. 31–33, not the full pp. 31–88 chapter. Cover says Advances in Computers volume 6, ©1965; talks 1962/1963, draft 1963, amendment 1964. Publisher DOI metadata separately lists 1966, so date discrepancy is preserved."
  },
  "id": "work-71db1f434f1d::GOOD",
  "title": "Speculations Concerning the First Ultraintelligent Machine",
  "url": "https://vtechworks.lib.vt.edu/bitstreams/a5e423ee-54e0-4eec-aeca-32b73f851af5/download"
}

Only original pp. 31–33 were inspected; do not claim a full chapter review. Repository 2005 date, original ©1965 and publisher’s 1966 listing must remain distinct.

Neither the paper nor this excerpt demonstrates inevitable or unbounded recursive self-improvement.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Only original pp. 31–33 were inspected; do not claim a full chapter review. Repository 2005 date, original ©1965 and publisher’s 1966 listing must remain distinct.

Neither the paper nor this excerpt demonstrates inevitable or unbounded recursive self-improvement.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1965
}

Only original pp. 31–33 were inspected; do not claim a full chapter review. Repository 2005 date, original ©1965 and publisher’s 1966 listing must remain distinct.

Neither the paper nor this excerpt demonstrates inevitable or unbounded recursive self-improvement.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: attributed forecast or speculation.

The Theory of the Growth of the Firm

Sources and details

The Theory of the Growth of the Firm

{
  "access_scope": "OUP abstract of the 1995 third edition only; no complete book or 1959 first edition inspected.",
  "authors": [
    "Edith Penrose"
  ],
  "dates": {
    "date": "Third edition, 14 September 1995; print ISBN 9780198289777; DOI 10.1093/0198289774.001.0001",
    "retrieval_date": "2026-10-07",
    "version": "Third edition, 14 September 1995; print ISBN 9780198289777; DOI 10.1093/0198289774.001.0001"
  },
  "id": "work-7248b7e2c79a::PE-O",
  "title": "The Theory of the Growth of the Firm",
  "url": "https://academic.oup.com/book/25306"
}

Explicitly label this as an abstract-level account of the 1995 third edition.

Keep 1959 as the original work’s year and do not merge later edition material into a claimed first-edition audit.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Explicitly label this as an abstract-level account of the 1995 third edition.

Keep 1959 as the original work’s year and do not merge later edition material into a claimed first-edition audit.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1959
}

Explicitly label this as an abstract-level account of the 1995 third edition.

Keep 1959 as the original work’s year and do not merge later edition material into a claimed first-edition audit.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Capitalism, Socialism and Democracy

Sources and details

Capitalism, Socialism, and Democracy, Chapters VII–VIII (selected text)

{
  "access_scope": "Original chapter text in an explicitly abridged University of Connecticut transcription; not the complete 1942 first edition or linked Routledge edition.",
  "authors": [
    "Joseph A. Schumpeter"
  ],
  "dates": {
    "date": "Third edition, Harper and Brothers, 1950; page numbers from Harper Colophon 1976 edition; institution-hosted teaching excerpt",
    "retrieval_date": "2026-10-07",
    "version": "Third edition, Harper and Brothers, 1950; page numbers from Harper Colophon 1976 edition; institution-hosted teaching excerpt"
  },
  "id": "work-7359609cd318::SC-C",
  "title": "Capitalism, Socialism, and Democracy, Chapters VII–VIII (selected text)",
  "url": "https://richard-langlois.uconn.edu/home/teaching/econ-5463-the-economics-of-organization/capitalism-socialism-and-democracy/"
}

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1942
}

The 1942 first-publication year is retained; inspected transcription explicitly identifies 1950 third-edition text and 1976 pagination.

Original Routledge anchor returned 403; do not imply it was read.

Only Chapters VII–VIII excerpt inspected, and the proposed paragraph draws on Chapter VII; no whole-book politics or historical forecast review claimed.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Adam: A Method for Stochastic Optimization

Introduced an adaptive stochastic-gradient optimizer using estimates of first and second gradient moments with bias correction.

2014 preprint; 2015 conference paper. Practical effectiveness is not a universal convergence or superiority guarantee.

Sources and details

Adam: A Method for Stochastic Optimization

{
  "access_scope": [
    "Algorithm 1 and §2, PDF p. 2",
    "§3, PDF p. 3",
    "Algorithm 1, PDF p. 2",
    "§2, PDF pp. 2–3; §6, PDF pp. 5–6"
  ],
  "authors": [
    "Diederik P. Kingma",
    "Jimmy Lei Ba"
  ],
  "dates": {
    "date": "2017-01-30",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v9, revised ICLR 2015 paper; first submission 22 December 2014"
  },
  "id": "work-7e5f79af3478::work-7e5f79af3478::adam-v9",
  "title": "Adam: A Method for Stochastic Optimization",
  "url": "https://arxiv.org/pdf/1412.6980v9"
}

Keep the 2014 first submission, 2015 ICLR venue, and 2017 inspected revision separate.

Kingma and Ba are marked equal contributors; printed v9 byline says Jimmy Lei Ba.

Do not promote the paper’s regret analysis into a general convergence guarantee for modern deep-learning uses; retain the original record convergence boundary.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Keep the 2014 first submission, 2015 ICLR venue, and 2017 inspected revision separate.

Kingma and Ba are marked equal contributors; printed v9 byline says Jimmy Lei Ba.

Do not promote the paper’s regret analysis into a general convergence guarantee for modern deep-learning uses; retain the original record convergence boundary.

Dates

{
  "date_note": "2014 preprint / ICLR 2015.",
  "dated": true,
  "year": 2015
}

Keep the 2014 first submission, 2015 ICLR venue, and 2017 inspected revision separate.

Kingma and Ba are marked equal contributors; printed v9 byline says Jimmy Lei Ba.

Do not promote the paper’s regret analysis into a general convergence guarantee for modern deep-learning uses; retain the baseline convergence boundary.

source-scoped factual paraphrase; see source inspection boundaries

Strategy and Structure

Sources and details

Strategy and Structure: Chapters in the History of the American Industrial Enterprise

{
  "access_scope": "MIT Press publisher synopsis and edition metadata only; no complete book or case chapters inspected.",
  "authors": [
    "Alfred D. Chandler Jr."
  ],
  "dates": {
    "date": "Publisher page: hardcover 15 March 1962; paperback 15 August 1969; description refers to 1990 reprint with new author introduction",
    "retrieval_date": "2026-10-07",
    "version": "Publisher page: hardcover 15 March 1962; paperback 15 August 1969; description refers to 1990 reprint with new author introduction"
  },
  "id": "work-8673c9130e0a::CH-M",
  "title": "Strategy and Structure: Chapters in the History of the American Industrial Enterprise",
  "url": "https://mitpress.mit.edu/9780262530095/strategy-and-structure/"
}

Synopsis-level account only: do not treat these four sentences as a full proof or audit of the strategy-follows-structure / structure-follows-strategy relationship.

Preserve original 1962 year; distinguish 1969 paperback and stated 1990 introduction/reprint.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Synopsis-level account only: do not treat these four sentences as a full proof or audit of the strategy-follows-structure / structure-follows-strategy relationship.

Preserve original 1962 year; distinguish 1969 paperback and stated 1990 introduction/reprint.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1962
}

Synopsis-level account only: do not treat these four sentences as a full proof or audit of the strategy-follows-structure / structure-follows-strategy relationship.

Preserve original 1962 year; distinguish 1969 paperback and stated 1990 introduction/reprint.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Sequence to Sequence Learning with Neural Networks

Demonstrated end-to-end sequence-to-sequence learning using a multilayer LSTM encoder and decoder, including strong machine-translation results.

This paper is an important encoder-decoder contribution, not the sole origin of all neural translation or encoder-decoder methods.

Sources and details

Sequence to Sequence Learning with Neural Networks

{
  "access_scope": [
    "PDF pp. 1–7; §§1–3, translation results and source reversal"
  ],
  "authors": [
    "Ilya Sutskever",
    "Oriol Vinyals",
    "Quoc V. Le"
  ],
  "dates": {
    "date": "2014-12-14",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1409.3215v3",
    "version_note": "arXiv:1409.3215v3"
  },
  "id": "work-86af6450d88e::seq2seq-v3",
  "title": "Sequence to Sequence Learning with Neural Networks",
  "url": "https://arxiv.org/pdf/1409.3215v3"
}

Sequence to Sequence Learning with Neural Networks

{
  "access_scope": [
    "Proceedings title, authors and venue"
  ],
  "authors": [
    "Ilya Sutskever",
    "Oriol Vinyals",
    "Quoc V. Le"
  ],
  "dates": {
    "date": "2014",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "NIPS 2014 proceedings landing record",
    "version_note": "NIPS 2014 proceedings landing record"
  },
  "id": "work-86af6450d88e::seq2seq-neurips-record",
  "title": "Sequence to Sequence Learning with Neural Networks",
  "url": "https://proceedings.neurips.cc/paper_files/paper/2014/hash/5a18e133cbf9f257297f410bb7eca942-Abstract.html"
}

Sequence to Sequence Learning with Neural Networks

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Ilya Sutskever",
    "Oriol Vinyals",
    "Quoc V. Le"
  ],
  "dates": {
    "date": "2014-12-14",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-86af6450d88e::seq2seq-v3-arxiv-record",
  "title": "Sequence to Sequence Learning with Neural Networks",
  "url": "https://arxiv.org/abs/1409.3215v3"
}

The 34.81 score is the reported ensemble result, not a claim for a single LSTM.

Direct decoding and reranking are different evaluation settings.

Retain prior-work credit and the baseline warning that this is not the sole origin of neural translation or encoder–decoder approaches.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The 34.81 score is the reported ensemble result, not a claim for a single LSTM.

Direct decoding and reranking are different evaluation settings.

Retain prior-work credit and the baseline warning that this is not the sole origin of neural translation or encoder–decoder approaches.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2014
}

The 34.81 score is the reported ensemble result, not a claim for a single LSTM.

Direct decoding and reranking are different evaluation settings.

Retain prior-work credit and the baseline warning that this is not the sole origin of neural translation or encoder–decoder approaches.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

Out of the Crisis

Sources and details

Dr. Deming’s 14 Points for Management

{
  "access_scope": "Institutional reproduction of Deming’s primary principles, explicitly linked to the book; not full-book inspection.",
  "authors": [
    "W. Edwards Deming"
  ],
  "dates": {
    "date": "Deming Institute condensed reproduction, explicitly sourced to Out of the Crisis pp.23–24; web page undated",
    "retrieval_date": "2026-10-07",
    "version": "Deming Institute condensed reproduction, explicitly sourced to Out of the Crisis pp.23–24; web page undated"
  },
  "id": "work-8ce4b757cb87::DE-P",
  "title": "Dr. Deming’s 14 Points for Management",
  "url": "https://deming.org/explore/fourteen-points/"
}

Out of the Crisis

{
  "access_scope": "MIT Press description and 2018 reissue credit metadata; historical 1986 baseline date retained.",
  "authors": [
    "W. Edwards Deming"
  ],
  "dates": {
    "date": "16 October 2018 reissue, ebook ISBN 9780262350037; publisher identifies 1982 publication lineage",
    "retrieval_date": "2026-10-07",
    "version": "16 October 2018 reissue, ebook ISBN 9780262350037; publisher identifies 1982 publication lineage"
  },
  "id": "work-8ce4b757cb87::DE-M",
  "title": "Out of the Crisis",
  "url": "https://mitpress.mit.edu/9780262350037/out-of-the-crisis/"
}

No claim that the whole 1986 edition was inspected; the principles are a condensed institutional reproduction.

Keep the baseline 1986 edition note and the publisher’s 1982 lineage distinct from the linked 2018 reissue.

Foreword authors are specific to the 2018 reissue and must not become coauthors of the original work.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

No claim that the whole 1986 edition was inspected; the principles are a condensed institutional reproduction.

Keep the baseline 1986 edition note and the publisher’s 1982 lineage distinct from the linked 2018 reissue.

Foreword authors are specific to the 2018 reissue and must not become coauthors of the original work.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "Commonly cited 1986 edition; MIT Press records a 1982 publication lineage.",
  "dated": true,
  "year": 1986
}

No claim that the whole 1986 edition was inspected; the principles are a condensed institutional reproduction.

Keep the baseline 1986 edition note and the publisher’s 1982 lineage distinct from the linked 2018 reissue.

Foreword authors are specific to the 2018 reissue and must not become coauthors of the original work.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Deep Reinforcement Learning from Human Preferences

Sources and details

Deep Reinforcement Learning from Human Preferences

{
  "access_scope": [
    "§2.2.2, PDF p. 5",
    "§2.2 and §2.2.3, PDF pp. 4–5",
    "§2.2, PDF p. 4",
    "§3.2, PDF p. 8"
  ],
  "authors": [
    "Paul F. Christiano",
    "Jan Leike",
    "Tom B. Brown",
    "Miljan Martic",
    "Shane Legg",
    "Dario Amodei"
  ],
  "dates": {
    "date": "2023-02-17",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v4 revision of 2017 work; first submission 12 June 2017"
  },
  "id": "work-90548c6e31d9::work-90548c6e31d9::preferences-v4",
  "title": "Deep Reinforcement Learning from Human Preferences",
  "url": "https://arxiv.org/pdf/1706.03741v4"
}

The experiments concern Atari and simulated robotics, not large-language-model dialogue or a solved general alignment problem.

The 2023 v4 date is a revision date, not the original contribution date.

Preserve all six authors and distinguish observed feedback quality from an assumption of perfectly specified human values.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The experiments concern Atari and simulated robotics, not large-language-model dialogue or a solved general alignment problem.

The 2023 v4 date is a revision date, not the original contribution date.

Preserve all six authors and distinguish observed feedback quality from an assumption of perfectly specified human values.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2017
}

The experiments concern Atari and simulated robotics, not large-language-model dialogue or a solved general alignment problem.

The 2023 v4 date is a revision date, not the original contribution date.

Preserve all six authors and distinguish observed feedback quality from an assumption of perfectly specified human values.

source-scoped factual paraphrase; see source inspection boundaries

The Coming Technological Singularity: How to Survive in the Post-Human Era

Speculates that greater-than-human intelligence could transform society and make subsequent history hard to predict.

Editorial thematic connection, not a claim of documented influence on AI researchers.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

The Coming Technological Singularity: How to Survive in the Post-Human Era

{
  "access_scope": "Selected 1993 paper sections on routes to superhuman intelligence, feedback, forecasting and possible failure; PDF pp. 1–5.",
  "dates": {
    "date": "1993 conference paper",
    "retrieved_at": "2026-10-07",
    "version_note": "NASA Vision 21 proceeding record 19940022856 gives publication 1993-12-01; repository acquisition 2013-09-06 is not publication. PDF 12 pages, body printed pp. 12–22 after title/abstract."
  },
  "id": "work-961abc2f3e02::VINGE",
  "title": "The Coming Technological Singularity: How to Survive in the Post-Human Era",
  "url": "https://ntrs.nasa.gov/api/citations/19940022856/downloads/19940022856.pdf"
}

Historical conjectures and analogy, not a proof of inevitability, control impossibility or present capability.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Historical conjectures and analogy, not a proof of inevitability, control impossibility or present capability.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Dates

{
  "date_events": [],
  "date_note": "NASA Vision 21 proceedings; NASA catalog publication date December 1, 1993.",
  "dated": true,
  "year": 1993
}

Historical conjectures and analogy, not a proof of inevitability, control impossibility or present capability.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: attributed forecast or speculation.

Gradient-Based Learning Applied to Document Recognition

Sources and details

Gradient-Based Learning Applied to Document Recognition

{
  "access_scope": [
    "Introduction, manuscript p. 1, visually inspected",
    "§II.A, manuscript p. 6, visually inspected",
    "Fig. 2 and §II.B, manuscript p. 7, visually inspected",
    "End of §I, manuscript p. 5; abstract p. 1, visually inspected"
  ],
  "authors": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "dates": {
    "date": "1998",
    "retrieval_date": "2026-10-07",
    "version": "Author-hosted manuscript marked Submitted to Proceedings of the IEEE, 1998"
  },
  "id": "work-96850dcf86b3::work-96850dcf86b3::lenet-manuscript",
  "title": "Gradient-Based Learning Applied to Document Recognition",
  "url": "https://leon.bottou.org/publications/pdf/ieee-1998.pdf"
}

Gradient Based Learning Applied to Document Recognition

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "dates": {
    "date": "1998",
    "retrieval_date": "2026-10-07",
    "version": "Author bibliography for Proceedings of IEEE 86(11), 2278–2324"
  },
  "id": "work-96850dcf86b3::work-96850dcf86b3::lenet-bibliography",
  "title": "Gradient Based Learning Applied to Document Recognition",
  "url": "https://leon.bottou.org/papers/lecun-98h"
}

The linked PDF is a 1998 submission manuscript, while the author bibliography separately verifies Proceedings of the IEEE 86(11):2278–2324.

Retain the original record distinction from earlier 1989 zip-code work; no claim that this paper first invented every convolutional component.

Embedded text is corrupt; the cited selected pages were rendered and visually inspected. This is not an all-pages audit.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The linked PDF is a 1998 submission manuscript, while the author bibliography separately verifies Proceedings of the IEEE 86(11):2278–2324.

Retain the original record distinction from earlier 1989 zip-code work; no claim that this paper first invented every convolutional component.

Embedded text is corrupt; the cited selected pages were rendered and visually inspected. This is not an all-pages audit.

Dates

{
  "date_note": "1998 synthesis; earlier zip-code work appeared in 1989.",
  "dated": true,
  "year": 1998
}

The linked PDF is a 1998 submission manuscript, while the author bibliography separately verifies Proceedings of the IEEE 86(11):2278–2324.

Retain the baseline distinction from earlier 1989 zip-code work; no claim that this paper first invented every convolutional component.

Embedded text is corrupt; the cited selected pages were rendered and visually inspected. This is not an all-pages audit.

source-scoped factual paraphrase; see source inspection boundaries

Mastering the Game of Go with Deep Neural Networks and Tree Search

Combines policy and value neural networks, supervised learning from expert games, reinforcement-learning self-play, and Monte Carlo tree search. The reported AlphaGo system defeated European champion Fan Hui without handicap on a full-sized Go board.

The January 2016 paper reports the Fan Hui evaluation; the Lee Sedol match took place later. This is specialized Go performance, not a solution of Go or general intelligence.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": [
    "Supervised and Reinforcement learning of policy networks, printed pp. 484–485",
    "Reinforcement learning of value networks; Searching with policy and value networks, printed pp. 485–487",
    "Evaluating the playing strength of AlphaGo, printed pp. 487–488",
    "January issue date on every article page; Fan Hui evaluation, printed p. 488; baseline later-match boundary retained"
  ],
  "authors": [
    "David Silver",
    "Aja Huang",
    "Chris J. Maddison",
    "Arthur Guez",
    "Laurent Sifre",
    "George van den Driessche",
    "Julian Schrittwieser",
    "Ioannis Antonoglou",
    "Veda Panneershelvam",
    "Marc Lanctot",
    "Sander Dieleman",
    "Dominik Grewe",
    "John Nham",
    "Nal Kalchbrenner",
    "Ilya Sutskever",
    "Timothy Lillicrap",
    "Madeleine Leach",
    "Koray Kavukcuoglu",
    "Thore Graepel",
    "Demis Hassabis"
  ],
  "dates": {
    "date": "2016-01-28 (issue date)",
    "retrieval_date": "2026-10-07",
    "version": "Nature 529, 484–489 plus Methods/Extended Data; publisher-formatted paper on DeepMind storage"
  },
  "id": "work-96bfc6f57b4b::work-96bfc6f57b4b::alphago-2016",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://storage.googleapis.com/deepmind-media/alphago/AlphaGoNaturePaper.pdf"
}

AlphaGo

{
  "access_scope": [
    "The matches"
  ],
  "authors": [
    {
      "name": "Google DeepMind",
      "role": "institutional author"
    }
  ],
  "dates": {
    "date": "Undated current official project retrospective; historical event March 2016",
    "retrieval_date": "2026-10-07",
    "version": "Google DeepMind project history, retrieved 7 October 2026"
  },
  "id": "work-96bfc6f57b4b::work-96bfc6f57b4b::alphago-official-history",
  "title": "AlphaGo",
  "url": "https://deepmind.google/research/alphago/"
}

Silver and Huang are marked equal contributors; retain all twenty authors.

The paper does not solve Go or establish general intelligence.

The baseline creator_credit Unknown/traditional game field appears to describe the game rather than the paper; preserve it pending explicit metadata review, and do not use it as research authorship.

The separate official retrospective corroborates only the later match date; its broad marketing language about intelligence is not imported into the research claim.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Silver and Huang are marked equal contributors; retain all twenty authors.

The paper does not solve Go or establish general intelligence.

The baseline creator_credit Unknown/traditional game field appears to describe the game rather than the paper; preserve it pending explicit metadata review, and do not use it as research authorship.

The separate official retrospective corroborates only the later match date; its broad marketing language about intelligence is not imported into the research claim.

Dates

{
  "date_note": "Paper published January 2016; distinguish it from the March 2016 Lee Sedol match.",
  "dated": true,
  "year": 2016
}

Silver and Huang are marked equal contributors; retain all twenty authors.

The paper does not solve Go or establish general intelligence.

The baseline creator_credit Unknown/traditional game field appears to describe the game rather than the paper; preserve it pending explicit metadata review, and do not use it as research authorship.

The separate official retrospective corroborates only the later match date; its broad marketing language about intelligence is not imported into the research claim.

source-scoped factual paraphrase; see source inspection boundaries

An Evolutionary Theory of Economic Change

Sources and details

An Evolutionary Theory of Economic Change

{
  "access_scope": "Publisher synopsis recovered in indexed result; direct page presents JavaScript verification. No book body inspected.",
  "authors": [
    "Richard R. Nelson",
    "Sidney G. Winter"
  ],
  "dates": {
    "date": "Paperback ISBN 9780674272286, 15 October 1985; original work year 1982 retained",
    "retrieval_date": "2026-10-07",
    "version": "Paperback ISBN 9780674272286, 15 October 1985; original work year 1982 retained"
  },
  "id": "work-9e73c62d3a1b::NW-H",
  "title": "An Evolutionary Theory of Economic Change",
  "url": "https://www.hup.harvard.edu/books/9780674272286"
}

Four sentences are explicitly publisher-synopsis-level, not full-text interpretation or simulation verification.

No detailed routines/search mechanics are added from memory.

1985 paperback metadata must not overwrite the 1982 original work date.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Four sentences are explicitly publisher-synopsis-level, not full-text interpretation or simulation verification.

No detailed routines/search mechanics are added from memory.

1985 paperback metadata must not overwrite the 1982 original work date.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1982
}

Four sentences are explicitly publisher-synopsis-level, not full-text interpretation or simulation verification.

No detailed routines/search mechanics are added from memory.

1985 paperback metadata must not overwrite the 1982 original work date.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

Support-Vector Networks

Sources and details

Support-Vector Networks

{
  "access_scope": [
    "§§1–2, printed pp. 275–279 (PDF pp. 3–7)",
    "§4, printed pp. 283–284 (PDF pp. 11–12)",
    "§3 and §5.3, printed pp. 280–282 and 285–286",
    "§6.2, printed pp. 287–290 (PDF pp. 15–18)"
  ],
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "date": "1995-09",
    "retrieval_date": "2026-10-07",
    "version": "Published Machine Learning 20, 273–297; university-hosted original article copy"
  },
  "id": "work-b3ae71d47db6::work-b3ae71d47db6::cortes-vapnik-1995",
  "title": "Support-Vector Networks",
  "url": "https://homepages.math.uic.edu/~lreyzin/papers/cortes95.pdf"
}

Support-vector networks

{
  "access_scope": "Inspection limited to admitted source record",
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "date": "1995-09",
    "retrieval_date": "2026-10-07",
    "version": "Publisher record; received 15 May 1993, accepted 20 February 1995"
  },
  "id": "work-b3ae71d47db6::work-b3ae71d47db6::svm-publisher",
  "title": "Support-vector networks",
  "url": "https://link.springer.com/article/10.1007/BF00994018"
}

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1995
}

Family and work remain distinct canonical IDs despite sharing the same paper.

The author-affiliated Google landing page exposed byline and publication metadata but no substantive abstract; it is not the body-evidence source.

Preserve the baseline data/representation/distribution-dependent generalization limit.

source-scoped factual paraphrase; see source inspection boundaries

Training Compute-Optimal Large Language Models

Reassessed compute-optimal language-model training and showed that scaling model parameters and training tokens together could outperform larger undertrained models at a fixed budget.

Recommendations are tied to the models, data, compute definition, and objectives studied; distinguish training-optimal from inference-optimal deployment decisions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": [
    "§1 and §3, PDF pp. 1–2, 4–7",
    "§§3.1–3.3 and Table 2, PDF pp. 5–8",
    "§4 and Table 1, PDF pp. 3, 9",
    "§4.2 and §5 Discussion & Conclusion, PDF pp. 10–15"
  ],
  "authors": [
    "Jordan Hoffmann",
    "Sebastian Borgeaud",
    "Arthur Mensch",
    "Elena Buchatskaya",
    "Trevor Cai",
    "Eliza Rutherford",
    "Diego de Las Casas",
    "Lisa Anne Hendricks",
    "Johannes Welbl",
    "Aidan Clark",
    "Tom Hennigan",
    "Eric Noland",
    "Katie Millican",
    "George van den Driessche",
    "Bogdan Damoc",
    "Aurelia Guy",
    "Simon Osindero",
    "Karen Simonyan",
    "Erich Elsen",
    "Jack W. Rae",
    "Oriol Vinyals",
    "Laurent Sifre"
  ],
  "dates": {
    "date": "2022-03-29",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v1"
  },
  "id": "work-b3b7f3344efb::work-b3b7f3344efb::chinchilla-v1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/pdf/2203.15556v1"
}

Preserve the distinction between training-optimal and inference-optimal choices.

The Gopher comparison also changes optimizer, tokenizer, and dataset mixture; do not attribute every downstream gain solely to the parameter/token allocation.

Hoffmann, Borgeaud, Mensch, and Sifre are marked equal contributors. No claim that the 2022 fit is a timeless law.

The discussion identifies only two comparable large-scale training runs, assumes a power-law frontier, and notes that the fitted runs use less than one epoch of data.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Preserve the distinction between training-optimal and inference-optimal choices.

The Gopher comparison also changes optimizer, tokenizer, and dataset mixture; do not attribute every downstream gain solely to the parameter/token allocation.

Hoffmann, Borgeaud, Mensch, and Sifre are marked equal contributors. No claim that the 2022 fit is a timeless law.

The discussion identifies only two comparable large-scale training runs, assumes a power-law frontier, and notes that the fitted runs use less than one epoch of data.

Dates

{
  "date_note": "2022 work; Kaplan and collaborators' scaling-law paper appeared in 2020.",
  "dated": true,
  "year": 2022
}

Preserve the distinction between training-optimal and inference-optimal choices.

The Gopher comparison also changes optimizer, tokenizer, and dataset mixture; do not attribute every downstream gain solely to the parameter/token allocation.

Hoffmann, Borgeaud, Mensch, and Sifre are marked equal contributors. No claim that the 2022 fit is a timeless law.

The discussion identifies only two comparable large-scale training runs, assumes a power-law frontier, and notes that the fitted runs use less than one epoch of data.

source-scoped factual paraphrase; see source inspection boundaries

Organizations

Sources and details

Organizations

{
  "access_scope": "Bibliographic catalogue only, no substantive book text.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "Princeton catalogue; 1958 Wiley monograph, 262 pages",
    "retrieval_date": "2026-10-07",
    "version": "Princeton catalogue; 1958 Wiley monograph, 262 pages"
  },
  "id": "work-b62aa334b025::OR-P",
  "title": "Organizations",
  "url": "https://irs.princeton.edu/organizations"
}

Organizations

{
  "access_scope": "Institutional exact-edition catalogue, credit verification only.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "New York: Wiley, 1958; collaboration credit for Harold Guetzkow",
    "retrieval_date": "2026-10-07",
    "version": "New York: Wiley, 1958; collaboration credit for Harold Guetzkow"
  },
  "id": "work-b62aa334b025::OR-W",
  "title": "Organizations",
  "url": "https://wellcomecollection.org/works/qj77f4gs"
}

Organizations

{
  "access_scope": "Publisher description and contents only; linked sample chapter failed. Description contains an unrelated grape-growing sentence, excluded.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "Second edition, April 1993, ISBN 9780631186311",
    "retrieval_date": "2026-10-07",
    "version": "Second edition, April 1993, ISBN 9780631186311"
  },
  "id": "work-b62aa334b025::OR-S",
  "title": "Organizations",
  "url": "https://www.wiley-vch.de/en/areas-interest/finance-economics-law/business-management-13ba/organization-management-theory-13ba2/organizational-behavior-13ba21/organizations-978-0-631-18631-1"
}

Organizations, Chapter 6: Cognitive Limits on Rationality

{
  "access_scope": "Selected Chapter 6 passages from Organizations (1958), printed pp.138–141 and 168–169; no whole-book audit.",
  "authors": [
    "James G. March",
    "Herbert A. Simon"
  ],
  "dates": {
    "date": "1958",
    "retrieval_date": "2026-10-07",
    "version": "1958 first-edition Chapter 6, printed pp. 136–171; 18-page two-up scan"
  },
  "id": "work-b62aa334b025::org-march-simon-ch6",
  "title": "Organizations, Chapter 6: Cognitive Limits on Rationality",
  "url": "https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Behavioral_Decision_Theory/March_&_Simon_Cognitive_Limits_on_Rationality_Ch6_in_Organizations.pdf"
}

Original John Wiley & Sons announcement for Organizations

{
  "access_scope": "Contemporaneous Wiley promotional leaflet retained in Carnegie Mellon's Simon archive; original publisher credit block on PDF p. 2 inspected. It is credit evidence, not chapter evidence.",
  "authors": [
    "John Wiley & Sons"
  ],
  "dates": {
    "date": "1958-10",
    "retrieval_date": "2026-10-07",
    "version": "Original John Wiley & Sons announcement dated October 1958, 3-page archival scan; footer of PDF p.3"
  },
  "id": "work-b62aa334b025::org-march-simon-wiley-announcement",
  "title": "Original John Wiley & Sons announcement for Organizations",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00077_fld06116_bdl0001_doc0001/Simon_box00077_fld06116_bdl0001_doc0001.pdf"
}

Four-sentence expansion HELD: catalogue facts and a topic list cannot support detailed mechanisms.

1993 second-edition synopsis must not be represented as inspected 1958 prose.

Original-work body or a readable authorized sample is needed to map four substantive sentences.

Preserve original 1958 identity and existing March/Simon family link; collaborator supplement remains a scoped proposal.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Retain original 1958 book identity, authors March and Simon, and separately typed collaborator credit for Harold Guetzkow.

The original source is a selected Chapter 6 scan, not a full-book or bibliography audit.

This mechanism does not establish that additional information or AI necessarily improves decisions.

All baseline rights, access-history, person identity and editorial curation holds remain. No canonical chapter or person record is created.

The catalogue-only insufficiency statements above describe the unchanged v1 evidence state. The selected-chapter addendum supplies a new bounded candidate, not retroactive full-book clearance.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Four-sentence expansion HELD: catalogue facts and a topic list cannot support detailed mechanisms.

1993 second-edition synopsis must not be represented as inspected 1958 prose.

Original-work body or a readable authorized sample is needed to map four substantive sentences.

Preserve original 1958 identity and existing March/Simon family link; collaborator supplement remains a scoped proposal.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Retain original 1958 book identity, authors March and Simon, and separately typed collaborator credit for Harold Guetzkow.

The original source is a selected Chapter 6 scan, not a full-book or bibliography audit.

This mechanism does not establish that additional information or AI necessarily improves decisions.

All baseline rights, access-history, person identity and editorial curation holds remain. No canonical chapter or person record is created.

The catalogue-only insufficiency statements above describe the unchanged v1 evidence state. The selected-chapter addendum supplies a new bounded candidate, not retroactive full-book clearance.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1958
}

Four-sentence expansion HELD: catalogue facts and a topic list cannot support detailed mechanisms.

1993 second-edition synopsis must not be represented as inspected 1958 prose.

Original-work body or a readable authorized sample is needed to map four substantive sentences.

Preserve original 1958 identity and existing March/Simon family link; collaborator supplement remains a scoped proposal.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

Retain original 1958 book identity, authors March and Simon, and separately typed collaborator credit for Harold Guetzkow.

The original source is a selected Chapter 6 scan, not a full-book or bibliography audit.

This mechanism does not establish that additional information or AI necessarily improves decisions.

All baseline rights, access-history, person identity and editorial curation holds remain. No canonical chapter or person record is created.

The catalogue-only insufficiency statements above describe the unchanged v1 evidence state. The selected-chapter addendum supplies a new bounded candidate, not retroactive full-book clearance; independent final admission is pending.

source-bounded paraphrase; theory described, not causal effect established

Deep Residual Learning for Image Recognition

Introduced a residual-learning architecture that made substantially deeper image-recognition networks easier to optimize.

2015 preprint; 2016 conference. Residual connections address degradation and optimization difficulties; they do not universally solve gradient problems or originate every skip-connection idea.

Sources and details

Deep Residual Learning for Image Recognition

{
  "access_scope": [
    "PDF pp. 1–3, 6–8; §3.1, ImageNet and CIFAR-10 results"
  ],
  "authors": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "dates": {
    "date": "2015-12-10",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1512.03385v1 technical report",
    "version_note": "arXiv:1512.03385v1 technical report"
  },
  "id": "work-b76e04a0f034::resnet-v1",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://arxiv.org/pdf/1512.03385v1"
}

Deep Residual Learning for Image Recognition

{
  "access_scope": [
    "Publisher indexed title, byline and BibTeX; direct retrieval blocked"
  ],
  "authors": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "dates": {
    "date": "2016-06",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "CVPR 2016 open-access bibliographic record",
    "version_note": "CVPR 2016 open-access bibliographic record"
  },
  "id": "work-b76e04a0f034::resnet-cvpr-record",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://openaccess.thecvf.com/content_cvpr_2016/html/He_Deep_Residual_Learning_CVPR_2016_paper.html"
}

Deep Residual Learning for Image Recognition

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "dates": {
    "date": "2015-12-10",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-b76e04a0f034::resnet-v1-arxiv-record",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://arxiv.org/abs/1512.03385v1"
}

2015 manuscript and June 2016 conference publication are different dates.

Do not label 3.57% as single-model top-one error.

Preserve that residual learning addresses degradation/optimization, does not universally solve gradients, and did not originate all skip-connection ideas.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

2015 manuscript and June 2016 conference publication are different dates.

Do not label 3.57% as single-model top-one error.

Preserve that residual learning addresses degradation/optimization, does not universally solve gradients, and did not originate all skip-connection ideas.

Dates

{
  "date_note": "2015 preprint / CVPR 2016.",
  "dated": true,
  "year": 2016
}

2015 manuscript and June 2016 conference publication are different dates.

Do not label 3.57% as single-model top-one error.

Preserve that residual learning addresses degradation/optimization, does not universally solve gradients, and did not originate all skip-connection ideas.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

Institutions, Institutional Change and Economic Performance

Sources and details

Institutions, economic theory, and economic performance (Chapter 12)

{
  "access_scope": "Chapter 12 opening summary/excerpt and metadata only; not the entire book.",
  "authors": [
    "Douglass C. North"
  ],
  "dates": {
    "date": "Chapter 12, pp.107–117; book print 1990; online publication 5 June 2012",
    "retrieval_date": "2026-10-07",
    "version": "Chapter 12, pp.107–117; book print 1990; online publication 5 June 2012"
  },
  "id": "work-bed6f43eda25::NO-C",
  "title": "Institutions, economic theory, and economic performance (Chapter 12)",
  "url": "https://www.cambridge.org/core/books/abs/institutions-institutional-change-and-economic-performance/institutions-economic-theory-and-economic-performance/6EFFF44F23A7D0570D2A550F9C1849AD"
}

Institutions, Institutional Change and Economic Performance

{
  "access_scope": "Cambridge book-level publisher description, distinguished from the baseline Chapter 12 anchor.",
  "authors": [
    "Douglass C. North"
  ],
  "dates": {
    "date": "Print 26 October 1990; online 5 June 2012; DOI 10.1017/CBO9780511808678",
    "retrieval_date": "2026-10-07",
    "version": "Print 26 October 1990; online 5 June 2012; DOI 10.1017/CBO9780511808678"
  },
  "id": "work-bed6f43eda25::NO-B",
  "title": "Institutions, Institutional Change and Economic Performance",
  "url": "https://www.cambridge.org/core/books/institutions-institutional-change-and-economic-performance/AAE1E27DF8996E24C5DD07EB79BBA7EE"
}

All four proposed mechanism sentences bind to the newly inspected book description, not falsely to Chapter 12 in full.

Publisher synopsis is not an empirical identification strategy or evidence that every institution improves performance.

Official first-chapter excerpt PDF timed out; no claim to have read it.

Retain book registry identity separately from the Chapter 12 manifestation.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

The preserved baseline supplies no narrative lead. The proposed source-scoped paragraph remains optional.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All four proposed mechanism sentences bind to the newly inspected book description, not falsely to Chapter 12 in full.

Publisher synopsis is not an empirical identification strategy or evidence that every institution improves performance.

Official first-chapter excerpt PDF timed out; no claim to have read it.

Retain book registry identity separately from the Chapter 12 manifestation.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1990
}

All four proposed mechanism sentences bind to the newly inspected book description, not falsely to Chapter 12 in full.

Publisher synopsis is not an empirical identification strategy or evidence that every institution improves performance.

Official first-chapter excerpt PDF timed out; no claim to have read it.

Retain book registry identity separately from the Chapter 12 manifestation.

All baseline identity, authorship-role, edition/date, access-history, rights and editorial-curation holds remain in force. No automatic promotion to curated family/work status.

source-grounded paraphrase at stated inspection scope

A Logical Calculus of the Ideas Immanent in Nervous Activity

Models idealized neural activity using logical operations and networks.

Editorial thematic connection, not a claim of documented influence on AI researchers.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

A Logical Calculus of the Ideas Immanent in Nervous Activity

{
  "access_scope": "Selected original abstract, assumptions and first realizability theorems, printed pp. 115, 117–121 (PDF pp. 1, 3–7).",
  "dates": {
    "date": "1943",
    "retrieved_at": "2026-10-07",
    "version_note": "Bulletin of Mathematical Biophysics 5, pp. 115–133; 19-page university-hosted original article scan."
  },
  "id": "work-cb2b9a3f175b::MCP",
  "title": "A Logical Calculus of the Ideas Immanent in Nervous Activity",
  "url": "https://home.csulb.edu/~cwallis/382/readings/482/mccolloch.logical.calculus.ideas.1943.pdf"
}

A technical research paper is retained in the manifest’s cultural partition; it is not fiction. No universality claim beyond the stated formal assumptions.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

A technical research paper is retained in the manifest’s cultural partition; it is not fiction. No universality claim beyond the stated formal assumptions.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Bulletin of Mathematical Biophysics 5, 115–133 (1943).",
  "dated": true,
  "year": 1943
}

A technical research paper is retained in the manifest’s cultural partition; it is not fiction. No universality claim beyond the stated formal assumptions.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: selected original text paraphrase.

Evidence scope: primary text paraphrase with editorial caution.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Compute Trends Across Three Eras of Machine Learning

Historical analysis separates three eras of training-compute scaling using a curated set of notable ML systems.

Selection, estimation and era definitions constrain inference; descriptive historical trends are not laws of future scaling.

Sources and details

Compute Trends Across Three Eras of Machine Learning

{
  "access_scope": [
    "PDF pp. 1, 3–6, 16, 24–25; conclusions, Appendix A and Appendix H"
  ],
  "authors": [
    "Jaime Sevilla",
    "Lennart Heim",
    "Anson Ho",
    "Tamay Besiroglu",
    "Marius Hobbhahn",
    "Pablo Villalobos"
  ],
  "dates": {
    "date": "2022-03-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:2202.05924v2, 25-page manuscript",
    "version_note": "arXiv:2202.05924v2, 25-page manuscript"
  },
  "id": "work-clearance-a9007e0713dc6b::compute-v2",
  "title": "Compute Trends Across Three Eras of Machine Learning",
  "url": "https://arxiv.org/pdf/2202.05924v2"
}

Compute Trends Across Three Eras of Machine Learning

{
  "access_scope": [
    "Publisher indexed conference dates and Date Added; direct retrieval failed"
  ],
  "authors": [
    "Jaime Sevilla",
    "Lennart Heim",
    "Anson Ho",
    "Tamay Besiroglu",
    "Marius Hobbhahn",
    "Pablo Villalobos"
  ],
  "dates": {
    "date": "2022-09-30",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "IEEE record for IJCNN 2022 paper",
    "version_note": "IEEE record for IJCNN 2022 paper"
  },
  "id": "work-clearance-a9007e0713dc6b::compute-ieee-record",
  "title": "Compute Trends Across Three Eras of Machine Learning",
  "url": "https://xplorestaging.ieee.org/document/9891914/"
}

Compute Trends Across Three Eras of Machine Learning

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Jaime Sevilla",
    "Lennart Heim",
    "Anson Ho",
    "Tamay Besiroglu",
    "Marius Hobbhahn",
    "Pablo Villalobos"
  ],
  "dates": {
    "date": "2022-03-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-clearance-a9007e0713dc6b::compute-v2-arxiv-record",
  "title": "Compute Trends Across Three Eras of Machine Learning",
  "url": "https://arxiv.org/abs/2202.05924v2"
}

The abstract’s roughly 20-month early-era statement differs from the conclusion’s 18-month summary; candidate explicitly uses the conclusion, not an unqualified merged estimate.

The curated dataset count is 123; plotted/regression subsets differ and are not silently treated as all 123.

The article measures final-run training compute, not total research expenditure, inference cost, or causal contribution to capability.

Paper, underlying dataset credits, 25-page preprint and eight-page conference version stay distinct.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The abstract’s roughly 20-month early-era statement differs from the conclusion’s 18-month summary; candidate explicitly uses the conclusion, not an unqualified merged estimate.

The curated dataset count is 123; plotted/regression subsets differ and are not silently treated as all 123.

The article measures final-run training compute, not total research expenditure, inference cost, or causal contribution to capability.

Paper, underlying dataset credits, 25-page preprint and eight-page conference version stay distinct.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2022/02/11"
}

The abstract’s roughly 20-month early-era statement differs from the conclusion’s 18-month summary; candidate explicitly uses the conclusion, not an unqualified merged estimate.

The curated dataset count is 123; plotted/regression subsets differ and are not silently treated as all 123.

The article measures final-run training compute, not total research expenditure, inference cost, or causal contribution to capability.

Paper, underlying dataset credits, 25-page preprint and eight-page conference version stay distinct.

curated historical study design

reported estimation method

reported task-specific finding, not a universal guarantee

source-stated limitation

Specification gaming: the flip side of AI ingenuity

Examples distinguish satisfying an objective specification from achieving the intended outcome.

Illustrative examples and research discussion; not a quantified rate or a complete taxonomy of AI failures.

Sources and details

Specification gaming: the flip side of AI ingenuity

{
  "access_scope": [
    "Main article from definition through conclusion; date/byline and image-source captions"
  ],
  "authors": [
    "Victoria Krakovna",
    "Jonathan Uesato",
    "Vladimir Mikulik",
    "Matthew Rahtz",
    "Tom Everitt",
    "Ramana Kumar",
    "Zac Kenton",
    "Jan Leike",
    "Shane Legg"
  ],
  "dates": {
    "date": "2020-04-21",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "DeepMind research blog, original author exposition",
    "version_note": "DeepMind research blog, original author exposition"
  },
  "id": "work-clearance-b0f5f877785438::specification-gaming-2020",
  "title": "Specification gaming: the flip side of AI ingenuity",
  "url": "https://deepmind.google/blog/specification-gaming-the-flip-side-of-ai-ingenuity/"
}

Original blog authorship and conceptual argument inspected; referenced experiments remain separately attributed works.

The illustrative collection is not a quantified prevalence estimate, complete taxonomy, or empirical forecast about future agents.

The blog’s hypothetical reward-tampering scenarios are not reported observed acts.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Original blog authorship and conceptual argument inspected; referenced experiments remain separately attributed works.

The illustrative collection is not a quantified prevalence estimate, complete taxonomy, or empirical forecast about future agents.

The blog’s hypothetical reward-tampering scenarios are not reported observed acts.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2020-04-21"
}

Original blog authorship and conceptual argument inspected; referenced experiments remain separately attributed works.

The illustrative collection is not a quantified prevalence estimate, complete taxonomy, or empirical forecast about future agents.

The blog’s hypothetical reward-tampering scenarios are not reported observed acts.

theoretical or conceptual proposition

example reported by named author exposition, original experiment not re-audited

authors’ diagnosis and research agenda

AI 2027

Author-dated scenario exploring rapid AI capability development and competing outcomes.

Scenario and forecasts, not observed future outcomes or evidence of any participant endorsement.

Sources and details

AI 2027

{
  "access_scope": "Official scenario PDF, selected automation, alignment and alternative-ending passages; original-publication label does not mean unchanged bytes.",
  "dates": {
    "date": "Originally published 2025-04-03",
    "retrieved_at": "2026-10-07",
    "version_note": "Current 71-page official PDF explicitly labels original publication; no hash-pinned April-3 byte snapshot was supplied. Later live-site annotations are separately bound."
  },
  "id": "work-clearance-c2d8873d1af197::AI27",
  "title": "AI 2027",
  "url": "https://ai-2027.com/ai-2027.pdf"
}

AI 2027: live version annotations

{
  "access_scope": "Live-site dating caveat, explicitly later than the original scenario.",
  "dates": {
    "date": "2025-04-03 original; December 2025 annotation",
    "retrieved_at": "2026-10-07",
    "version_note": "Live HTML inspected 2026-10-07; an added-Dec-2025 note says outside-model adjustments yielded later medians, including Eli Lifland’s 2030."
  },
  "id": "work-clearance-c2d8873d1af197::AI27WEB",
  "title": "AI 2027: live version annotations",
  "url": "https://ai-2027.com/"
}

Scenario details are invented projections, not observed events, and fictional OpenBrain is not a claim about a named real company.

The original-release date is verified but an immutable original-release byte version is not; preserve later-update binding.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Scenario details are invented projections, not observed events, and fictional OpenBrain is not a claim about a named real company.

The original-release date is verified but an immutable original-release byte version is not; preserve later-update binding.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2025-04-03"
}

Scenario details are invented projections, not observed events, and fictional OpenBrain is not a claim about a named real company.

The original-release date is verified but an immutable original-release byte version is not; preserve later-update binding.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: attributed forecast or speculation.

DeepSeek-V3 Technical Report

Technical report describes the named DeepSeek model, training design and reported evaluations.

Report-level method and benchmark claims; individual leadership is not sole authorship. Full PDF author-list and contribution-role reconciliation remains incomplete.

Sources and details

DeepSeek-V3 Technical Report

{
  "access_scope": [
    "PDF pp. 1, 5–11, 31, 35, 45–47; architecture, Table 1, Table 6, limitations and contributor roles"
  ],
  "authors": [
    "DeepSeek-AI",
    "Liu, Aixin",
    "Feng, Bei",
    "Xue, Bing",
    "Wang, Bingxuan",
    "Wu, Bochao",
    "Lu, Chengda",
    "Zhao, Chenggang",
    "Deng, Chengqi",
    "Zhang, Chenyu",
    "Ruan, Chong",
    "Dai, Damai",
    "Guo, Daya",
    "Yang, Dejian",
    "Chen, Deli",
    "Ji, Dongjie",
    "Li, Erhang",
    "Lin, Fangyun",
    "Dai, Fucong",
    "Luo, Fuli",
    "Hao, Guangbo",
    "Chen, Guanting",
    "Li, Guowei",
    "Zhang, H.",
    "Bao, Han",
    "Xu, Hanwei",
    "Wang, Haocheng",
    "Zhang, Haowei",
    "Ding, Honghui",
    "Xin, Huajian",
    "Gao, Huazuo",
    "Li, Hui",
    "Qu, Hui",
    "Cai, J. L.",
    "Liang, Jian",
    "Guo, Jianzhong",
    "Ni, Jiaqi",
    "Li, Jiashi",
    "Wang, Jiawei",
    "Chen, Jin",
    "Chen, Jingchang",
    "Yuan, Jingyang",
    "Qiu, Junjie",
    "Li, Junlong",
    "Song, Junxiao",
    "Dong, Kai",
    "Hu, Kai",
    "Gao, Kaige",
    "Guan, Kang",
    "Huang, Kexin",
    "Yu, Kuai",
    "Wang, Lean",
    "Zhang, Lecong",
    "Xu, Lei",
    "Xia, Leyi",
    "Zhao, Liang",
    "Wang, Litong",
    "Zhang, Liyue",
    "Li, Meng",
    "Wang, Miaojun",
    "Zhang, Mingchuan",
    "Zhang, Minghua",
    "Tang, Minghui",
    "Li, Mingming",
    "Tian, Ning",
    "Huang, Panpan",
    "Wang, Peiyi",
    "Zhang, Peng",
    "Wang, Qiancheng",
    "Zhu, Qihao",
    "Chen, Qinyu",
    "Du, Qiushi",
    "Chen, R. J.",
    "Jin, R. L.",
    "Ge, Ruiqi",
    "Zhang, Ruisong",
    "Pan, Ruizhe",
    "Wang, Runji",
    "Xu, Runxin",
    "Zhang, Ruoyu",
    "Chen, Ruyi",
    "Li, S. S.",
    "Lu, Shanghao",
    "Zhou, Shangyan",
    "Chen, Shanhuang",
    "Wu, Shaoqing",
    "Ye, Shengfeng",
    "Ye, Shengfeng",
    "Ma, Shirong",
    "Wang, Shiyu",
    "Zhou, Shuang",
    "Yu, Shuiping",
    "Zhou, Shunfeng",
    "Pan, Shuting",
    "Wang, T.",
    "Yun, Tao",
    "Pei, Tian",
    "Sun, Tianyu",
    "Xiao, W. L.",
    "Zeng, Wangding",
    "Zhao, Wanjia",
    "An, Wei",
    "Liu, Wen",
    "Liang, Wenfeng",
    "Gao, Wenjun",
    "Yu, Wenqin",
    "Zhang, Wentao",
    "Li, X. Q.",
    "Jin, Xiangyue",
    "Wang, Xianzu",
    "Bi, Xiao",
    "Liu, Xiaodong",
    "Wang, Xiaohan",
    "Shen, Xiaojin",
    "Chen, Xiaokang",
    "Zhang, Xiaokang",
    "Chen, Xiaosha",
    "Nie, Xiaotao",
    "Sun, Xiaowen",
    "Wang, Xiaoxiang",
    "Cheng, Xin",
    "Liu, Xin",
    "Xie, Xin",
    "Liu, Xingchao",
    "Yu, Xingkai",
    "Song, Xinnan",
    "Shan, Xinxia",
    "Zhou, Xinyi",
    "Yang, Xinyu",
    "Li, Xinyuan",
    "Su, Xuecheng",
    "Lin, Xuheng",
    "Li, Y. K.",
    "Wang, Y. Q.",
    "Wei, Y. X.",
    "Zhu, Y. X.",
    "Zhang, Yang",
    "Xu, Yanhong",
    "Xu, Yanhong",
    "Huang, Yanping",
    "Li, Yao",
    "Zhao, Yao",
    "Sun, Yaofeng",
    "Li, Yaohui",
    "Wang, Yaohui",
    "Yu, Yi",
    "Zheng, Yi",
    "Zhang, Yichao",
    "Shi, Yifan",
    "Xiong, Yiliang",
    "He, Ying",
    "Tang, Ying",
    "Piao, Yishi",
    "Wang, Yisong",
    "Tan, Yixuan",
    "Ma, Yiyang",
    "Liu, Yiyuan",
    "Guo, Yongqiang",
    "Wu, Yu",
    "Ou, Yuan",
    "Zhu, Yuchen",
    "Wang, Yuduan",
    "Gong, Yue",
    "Zou, Yuheng",
    "He, Yujia",
    "Zha, Yukun",
    "Xiong, Yunfan",
    "Ma, Yunxian",
    "Yan, Yuting",
    "Luo, Yuxiang",
    "You, Yuxiang",
    "Liu, Yuxuan",
    "Zhou, Yuyang",
    "Wu, Z. F.",
    "Ren, Z. Z.",
    "Ren, Zehui",
    "Sha, Zhangli",
    "Fu, Zhe",
    "Xu, Zhean",
    "Huang, Zhen",
    "Zhang, Zhen",
    "Xie, Zhenda",
    "Zhang, Zhengyan",
    "Hao, Zhewen",
    "Gou, Zhibin",
    "Ma, Zhicheng",
    "Yan, Zhigang",
    "Shao, Zhihong",
    "Xu, Zhipeng",
    "Wu, Zhiyu",
    "Zhang, Zhongyu",
    "Li, Zhuoshu",
    "Gu, Zihui",
    "Zhu, Zijia",
    "Liu, Zijun",
    "Li, Zilin",
    "Xie, Ziwei",
    "Song, Ziyang",
    "Gao, Ziyi",
    "Pan, Zizheng"
  ],
  "dates": {
    "date": "2025-02-18",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:2412.19437v2",
    "version_note": "arXiv:2412.19437v2"
  },
  "id": "work-clearance-de539966b9f54c::deepseek-v2",
  "title": "DeepSeek-V3 Technical Report",
  "url": "https://arxiv.org/pdf/2412.19437v2"
}

DeepSeek-V3 Technical Report

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "DeepSeek-AI",
    "Liu, Aixin",
    "Feng, Bei",
    "Xue, Bing",
    "Wang, Bingxuan",
    "Wu, Bochao",
    "Lu, Chengda",
    "Zhao, Chenggang",
    "Deng, Chengqi",
    "Zhang, Chenyu",
    "Ruan, Chong",
    "Dai, Damai",
    "Guo, Daya",
    "Yang, Dejian",
    "Chen, Deli",
    "Ji, Dongjie",
    "Li, Erhang",
    "Lin, Fangyun",
    "Dai, Fucong",
    "Luo, Fuli",
    "Hao, Guangbo",
    "Chen, Guanting",
    "Li, Guowei",
    "Zhang, H.",
    "Bao, Han",
    "Xu, Hanwei",
    "Wang, Haocheng",
    "Zhang, Haowei",
    "Ding, Honghui",
    "Xin, Huajian",
    "Gao, Huazuo",
    "Li, Hui",
    "Qu, Hui",
    "Cai, J. L.",
    "Liang, Jian",
    "Guo, Jianzhong",
    "Ni, Jiaqi",
    "Li, Jiashi",
    "Wang, Jiawei",
    "Chen, Jin",
    "Chen, Jingchang",
    "Yuan, Jingyang",
    "Qiu, Junjie",
    "Li, Junlong",
    "Song, Junxiao",
    "Dong, Kai",
    "Hu, Kai",
    "Gao, Kaige",
    "Guan, Kang",
    "Huang, Kexin",
    "Yu, Kuai",
    "Wang, Lean",
    "Zhang, Lecong",
    "Xu, Lei",
    "Xia, Leyi",
    "Zhao, Liang",
    "Wang, Litong",
    "Zhang, Liyue",
    "Li, Meng",
    "Wang, Miaojun",
    "Zhang, Mingchuan",
    "Zhang, Minghua",
    "Tang, Minghui",
    "Li, Mingming",
    "Tian, Ning",
    "Huang, Panpan",
    "Wang, Peiyi",
    "Zhang, Peng",
    "Wang, Qiancheng",
    "Zhu, Qihao",
    "Chen, Qinyu",
    "Du, Qiushi",
    "Chen, R. J.",
    "Jin, R. L.",
    "Ge, Ruiqi",
    "Zhang, Ruisong",
    "Pan, Ruizhe",
    "Wang, Runji",
    "Xu, Runxin",
    "Zhang, Ruoyu",
    "Chen, Ruyi",
    "Li, S. S.",
    "Lu, Shanghao",
    "Zhou, Shangyan",
    "Chen, Shanhuang",
    "Wu, Shaoqing",
    "Ye, Shengfeng",
    "Ye, Shengfeng",
    "Ma, Shirong",
    "Wang, Shiyu",
    "Zhou, Shuang",
    "Yu, Shuiping",
    "Zhou, Shunfeng",
    "Pan, Shuting",
    "Wang, T.",
    "Yun, Tao",
    "Pei, Tian",
    "Sun, Tianyu",
    "Xiao, W. L.",
    "Zeng, Wangding",
    "Zhao, Wanjia",
    "An, Wei",
    "Liu, Wen",
    "Liang, Wenfeng",
    "Gao, Wenjun",
    "Yu, Wenqin",
    "Zhang, Wentao",
    "Li, X. Q.",
    "Jin, Xiangyue",
    "Wang, Xianzu",
    "Bi, Xiao",
    "Liu, Xiaodong",
    "Wang, Xiaohan",
    "Shen, Xiaojin",
    "Chen, Xiaokang",
    "Zhang, Xiaokang",
    "Chen, Xiaosha",
    "Nie, Xiaotao",
    "Sun, Xiaowen",
    "Wang, Xiaoxiang",
    "Cheng, Xin",
    "Liu, Xin",
    "Xie, Xin",
    "Liu, Xingchao",
    "Yu, Xingkai",
    "Song, Xinnan",
    "Shan, Xinxia",
    "Zhou, Xinyi",
    "Yang, Xinyu",
    "Li, Xinyuan",
    "Su, Xuecheng",
    "Lin, Xuheng",
    "Li, Y. K.",
    "Wang, Y. Q.",
    "Wei, Y. X.",
    "Zhu, Y. X.",
    "Zhang, Yang",
    "Xu, Yanhong",
    "Xu, Yanhong",
    "Huang, Yanping",
    "Li, Yao",
    "Zhao, Yao",
    "Sun, Yaofeng",
    "Li, Yaohui",
    "Wang, Yaohui",
    "Yu, Yi",
    "Zheng, Yi",
    "Zhang, Yichao",
    "Shi, Yifan",
    "Xiong, Yiliang",
    "He, Ying",
    "Tang, Ying",
    "Piao, Yishi",
    "Wang, Yisong",
    "Tan, Yixuan",
    "Ma, Yiyang",
    "Liu, Yiyuan",
    "Guo, Yongqiang",
    "Wu, Yu",
    "Ou, Yuan",
    "Zhu, Yuchen",
    "Wang, Yuduan",
    "Gong, Yue",
    "Zou, Yuheng",
    "He, Yujia",
    "Zha, Yukun",
    "Xiong, Yunfan",
    "Ma, Yunxian",
    "Yan, Yuting",
    "Luo, Yuxiang",
    "You, Yuxiang",
    "Liu, Yuxuan",
    "Zhou, Yuyang",
    "Wu, Z. F.",
    "Ren, Z. Z.",
    "Ren, Zehui",
    "Sha, Zhangli",
    "Fu, Zhe",
    "Xu, Zhean",
    "Huang, Zhen",
    "Zhang, Zhen",
    "Xie, Zhenda",
    "Zhang, Zhengyan",
    "Hao, Zhewen",
    "Gou, Zhibin",
    "Ma, Zhicheng",
    "Yan, Zhigang",
    "Shao, Zhihong",
    "Xu, Zhipeng",
    "Wu, Zhiyu",
    "Zhang, Zhongyu",
    "Li, Zhuoshu",
    "Gu, Zihui",
    "Zhu, Zijia",
    "Liu, Zijun",
    "Li, Zilin",
    "Xie, Ziwei",
    "Song, Ziyang",
    "Gao, Ziyi",
    "Pan, Zizheng"
  ],
  "dates": {
    "date": "2025-02-18",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-clearance-de539966b9f54c::deepseek-v2-arxiv-record",
  "title": "DeepSeek-V3 Technical Report",
  "url": "https://arxiv.org/abs/2412.19437v2"
}

The 2024 first release and 2025 v2 revision are distinct; no retrospective attribution of v2-specific contents to v1 without comparison.

Costs assume H800 rental at $2 per GPU-hour and 2.788 million GPU-hours, not total company, R&D or serving costs.

MMLU/MMLU-Pro scores are reported benchmark values, not general intelligence, safety or universal superiority evidence.

Appendix A roster completeness is reconciled at occurrence/role level; repeated-name personal identities remain unresolved.

All existing rights, deployment, curation and role-identity holds remain unless separately approved.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The 2024 first release and 2025 v2 revision are distinct; no retrospective attribution of v2-specific contents to v1 without comparison.

Costs assume H800 rental at $2 per GPU-hour and 2.788 million GPU-hours, not total company, R&D or serving costs.

MMLU/MMLU-Pro scores are reported benchmark values, not general intelligence, safety or universal superiority evidence.

Appendix A roster completeness is reconciled at occurrence/role level; repeated-name personal identities remain unresolved.

All existing rights, deployment, curation and role-identity holds remain unless separately approved.

Dates

{
  "date_note": "Primary source date; arXiv first submission where applicable.",
  "dated": true,
  "year": "2024/12/27"
}

The 2024 first release and 2025 v2 revision are distinct; no retrospective attribution of v2-specific contents to v1 without comparison.

Costs assume H800 rental at $2 per GPU-hour and 2.788 million GPU-hours, not total company, R&D or serving costs.

MMLU/MMLU-Pro scores are reported benchmark values, not general intelligence, safety or universal superiority evidence.

Appendix A roster completeness is reconciled at occurrence/role level; repeated-name personal identities remain unresolved.

All existing rights, deployment, curation and role-identity holds remain unless separately approved.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

author-reported cost estimate and deployment limitation

Portal

Editorial interpretation: GLaDOS's apparent instructional role turns guidance and experimental oversight into questions about trust and coercive machine authority.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Portal: official game listing

{
  "access_scope": "Official description of the single-player portal puzzle mechanics; user reviews and tags excluded.",
  "dates": {
    "date": "2007-10-10 release",
    "retrieved_at": "2026-10-07",
    "version_note": "Original Portal app 400, not Portal 2. Current storefront metadata and developer-supplied description."
  },
  "id": "work-coverage-00f054be4eb013::PORTAL",
  "title": "Portal: official game listing",
  "url": "https://store.steampowered.com/app/400/Portal?l=english"
}

Still Alive: Kim Swift And Erik Wolpaw Talk Portal

{
  "access_scope": "Creator answers about GLaDOS and player action; no full playthrough undertaken.",
  "dates": {
    "date": "2008-03-25",
    "retrieved_at": "2026-10-07",
    "version_note": "Post-release creator interview, separate from game authorship and 2007 release. Ellen McLain is identified as voice performer, not writer."
  },
  "id": "work-coverage-00f054be4eb013::PORTALI",
  "title": "Still Alive: Kim Swift And Erik Wolpaw Talk Portal",
  "url": "https://www.gamedeveloper.com/business/still-alive-kim-swift-and-erik-wolpaw-talk-portal"
}

Creator design intent is evidence of intent, not proof of every player’s experience or of real machine consciousness.

No Portal 2 characters, scenes or mechanics imported.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Creator design intent is evidence of intent, not proof of every player’s experience or of real machine consciousness.

No Portal 2 characters, scenes or mechanics imported.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Valve's Steam listing gives October 10, 2007. Kept distinct from its 2011 sequel.",
  "dated": true,
  "year": 2007
}

Creator design intent is evidence of intent, not proof of every player’s experience or of real machine consciousness.

No Portal 2 characters, scenes or mechanics imported.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: author retrospective paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

Developed and evaluated dropout, randomly omitting units during training to reduce co-adaptation and overfitting.

The 2014 JMLR article is distinct from the differently titled 2012 precursor; regularization benefits are empirical and task dependent.

Sources and details

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

{
  "access_scope": [
    "§1 and §4, printed pp. 1930–1933 (PDF pp. 2–5)",
    "§1, printed p. 1931 (PDF p. 3), for shared weights; §2 Motivation, printed p. 1932 (PDF p. 4), for the authors’ co-adaptation rationale",
    "Fig. 2 and §1, printed p. 1931 (PDF p. 3)",
    "§6 and Table 1, printed pp. 1935–1936 (PDF pp. 7–8)"
  ],
  "authors": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "dates": {
    "date": "2014-06",
    "retrieval_date": "2026-10-07",
    "version": "JMLR 15, 1929–1958 published article"
  },
  "id": "work-coverage-0674ed58a67e17::work-coverage-0674ed58a67e17::dropout-2014",
  "title": "Dropout: A Simple Way to Prevent Neural Networks from Overfitting",
  "url": "https://jmlr.org/papers/volume15/srivastava14a/srivastava14a.pdf"
}

Reduced co-adaptation is the authors’ rationale, not an independently proved sole explanation.

Retain the distinction between the 2014 five-author JMLR article and the differently titled 2012 precursor.

Effects and useful hyperparameters remain architecture/task dependent; no general performance guarantee.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Reduced co-adaptation is the authors’ rationale, not an independently proved sole explanation.

Retain the distinction between the 2014 five-author JMLR article and the differently titled 2012 precursor.

Effects and useful hyperparameters remain architecture/task dependent; no general performance guarantee.

Dates

{
  "date_note": "Formal publication year: 2014; Formal venue: JMLR; Formal source url: https://jmlr.org/papers/v15/srivastava14a.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2014
}

Reduced co-adaptation is the authors’ rationale, not an independently proved sole explanation.

Retain the distinction between the 2014 five-author JMLR article and the differently titled 2012 precursor.

Effects and useful hyperparameters remain architecture/task dependent; no general performance guarantee.

source-scoped factual paraphrase; see source inspection boundaries

source-defined weight sharing plus explicitly attributed proposed mechanistic rationale

Competing in the Age of AI: Strategy and Leadership When Algorithms and Networks Run the World

Describes an AI factory as a scalable data-and-algorithm operating core for organizations.

Organizational operating-model concept, not a physical GPU factory design. A later Procter & Gamble case is a different work. Uses an institutional excerpt from the identifiable 2020 book.

Sources and details

Competing in the Age of AI: Strategy and Leadership When Algorithms and Networks Run the World — excerpt “Putting AI at the Core”

{
  "access_scope": "Only the explicitly labeled Book Excerpt, byline and permission credit treated as original book text; article/interview kept separate.",
  "authors": [
    "Marco Iansiti",
    "Karim R. Lakhani"
  ],
  "dates": {
    "date": "2020 book; excerpt posted 2020-01-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Authorized book excerpt embedded in HBS Working Knowledge, “Rethinking Business Strategy in the Age of AI”",
    "version_note": "Authorized book excerpt embedded in HBS Working Knowledge, “Rethinking Business Strategy in the Age of AI”"
  },
  "id": "work-coverage-0813f4a08831d2::iansbook",
  "title": "Competing in the Age of AI: Strategy and Leadership When Algorithms and Networks Run the World — excerpt “Putting AI at the Core”",
  "url": "https://www.library.hbs.edu/working-knowledge/rethinking-business-strategy-in-the-age-of-ai"
}

Rethinking Business Strategy in the Age of AI

{
  "access_scope": "Interview answers on operating models, Netflix and governance inspected separately from embedded book excerpt.",
  "authors": [
    "Dina Gerdeman",
    "Marco Iansiti"
  ],
  "dates": {
    "date": "2020-01-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "HBS Working Knowledge interview; Gerdeman interviewer, Iansiti respondent",
    "version_note": "HBS Working Knowledge interview; Gerdeman interviewer, Iansiti respondent"
  },
  "id": "work-coverage-0813f4a08831d2::iansint",
  "title": "Rethinking Business Strategy in the Age of AI",
  "url": "https://www.library.hbs.edu/working-knowledge/rethinking-business-strategy-in-the-age-of-ai"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Preserve the baseline AI-factory concept as a scalable organizational operating core; this is not a physical GPU-factory specification.

The excerpt does not independently expose the full four-component AI-factory chapter; that absence does not weaken the baseline claim.

The later Procter & Gamble case is a different work and is not used.

Corporate examples and author commentary do not identify controlled productivity effects.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Preserve the baseline AI-factory concept as a scalable organizational operating core; this is not a physical GPU-factory specification.

The excerpt does not independently expose the full four-component AI-factory chapter; that absence does not weaken the baseline claim.

The later Procter & Gamble case is a different work and is not used.

Corporate examples and author commentary do not identify controlled productivity effects.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2020"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Preserve the baseline AI-factory concept as a scalable organizational operating core; this is not a physical GPU-factory specification.

The excerpt does not independently expose the full four-component AI-factory chapter; that absence does not weaken the baseline claim.

The later Procter & Gamble case is a different work and is not used.

Corporate examples and author commentary do not identify controlled productivity effects.

Evidence scope: original book excerpt.

Evidence scope: original book illustrative example.

Evidence scope: author interview.

Evidence scope: author interview example and caution.

Superminds: The Surprising Power of People and Computers Thinking Together

Explores how collective human groups and computers can be organized to improve collective intelligence.

Book synthesis and examples, not proof that every group or AI combination outperforms its members.

Sources and details

Superminds: The Surprising Power of People and Computers Thinking Together

{
  "access_scope": "Publisher metadata and Description inspected; reviews and endorsements excluded as evidence.",
  "authors": [
    "Thomas W. Malone"
  ],
  "dates": {
    "date": "2018-05-15",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Little, Brown Spark ebook, ISBN 9780316349109; publisher description",
    "version_note": "Little, Brown Spark ebook, ISBN 9780316349109; publisher description"
  },
  "id": "work-coverage-0ad0cc84b530f2::superpub",
  "title": "Superminds: The Surprising Power of People and Computers Thinking Together",
  "url": "https://www.hachettebookgroup.com/titles/thomas-w-malone/superminds/9780316349109/"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Only the publisher description and metadata were inspected; no individual case-study result or quantitative collective-intelligence effect is newly admitted.

Preserve the baseline boundary that a group-plus-AI combination is not guaranteed to beat its members.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Only the publisher description and metadata were inspected; no individual case-study result or quantitative collective-intelligence effect is newly admitted.

Preserve the baseline boundary that a group-plus-AI combination is not guaranteed to beat its members.

Dates

{
  "date_note": "[\"Do not merge Thomas W. Malone with intellectual-capital coauthor Michael S. Malone.\"]",
  "dated": true,
  "year": "2018-05-15"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Only the publisher description and metadata were inspected; no individual case-study result or quantitative collective-intelligence effect is newly admitted.

Preserve the baseline boundary that a group-plus-AI combination is not guaranteed to beat its members.

Evidence scope: publisher synopsis.

Evidence scope: publisher synopsis mechanism.

Evidence scope: publisher synopsis conditional projection.

Evidence scope: publisher synopsis scope with inherited caution.

System Shock 2

Editorial interpretation: SHODAN's manipulative relationship with the player explores dependence on an artificial guide whose purposes conflict with human survival.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

System Shock 2: manual and designer notes

{
  "access_scope": "Selected original manual lore and Ken Levine’s signed note, PDF pp. 18, 21–23; printed pp. 34–35, 40–45.",
  "dates": {
    "date": "1999 copyright",
    "retrieved_at": "2026-10-07",
    "version_note": "Official Steam-linked original-game manual, 24 PDF pages with two printed pages per image. Not the 2025 remaster. Named credits are selected roles, not a complete roster."
  },
  "id": "work-coverage-0e3845153c3dc4::SS2",
  "title": "System Shock 2: manual and designer notes",
  "url": "https://store.steampowered.com/manual/238210"
}

The manual’s Citadel disaster history concerns the first System Shock and is not imported as the sequel’s action.

Baseline SHODAN deception and dependency themes remain preserved; the inspected manual does not independently clear every late-game plot event.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The manual’s Citadel disaster history concerns the first System Shock and is not imported as the sequel’s action.

Baseline SHODAN deception and dependency themes remain preserved; the inspected manual does not independently clear every late-game plot event.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "1999 original; Steam's classic listing gives August 11, 1999. The 2013 digital reissue and 2025 25th Anniversary Remaster must not replace the original date. The original manual establishes the original studios separately from Nightdive's later involvement.",
  "dated": true,
  "year": 1999
}

The manual’s Citadel disaster history concerns the first System Shock and is not imported as the sequel’s action.

Baseline SHODAN deception and dependency themes remain preserved; the inspected manual does not independently clear every late-game plot event.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: selected original text paraphrase.

Evidence scope: editorial interpretation.

Evidence scope: creator design note paraphrase.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Virtual Competition: The Promise and Perils of the Algorithm-Driven Economy

Examines how algorithmic markets may affect competition and consumer welfare.

Policy/critical book; distinguish it from the authors’ short same-year Virtual Competition editorial and from proven illegal collusion in any particular market.

Sources and details

Virtual Competition: The Promise and Perils of the Algorithm-Driven Economy

{
  "access_scope": "Publisher synopsis inspected through indexed result; original frontmatter PDF inspected at /document/doi/10.4159/9780674973336-fm/pdf. Main book text not inspected.",
  "authors": [
    "Ariel Ezrachi",
    "Maurice E. Stucke"
  ],
  "dates": {
    "date": "2016 book copyright; publisher-platform ebook released 2017-03-06",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Harvard University Press digital book, DOI 10.4159/9780674973336; publisher-platform synopsis and original frontmatter",
    "version_note": "Harvard University Press digital book, DOI 10.4159/9780674973336; publisher-platform synopsis and original frontmatter"
  },
  "id": "work-coverage-0fc9a987a108b9::virtpub",
  "title": "Virtual Competition: The Promise and Perils of the Algorithm-Driven Economy",
  "url": "https://www.degruyterbrill.com/document/doi/10.4159/9780674973336/html?lang=en"
}

Virtual Competition — UNCTAD Research Partnership Platform presentation

{
  "access_scope": "Entire 11-page slide text inspected; diagrams or unparsed visual claims not inferred.",
  "authors": [
    "Ariel Ezrachi"
  ],
  "dates": {
    "date": "2016-10-19",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Author presentation, 11 PDF pages; closing slide advertises the forthcoming Ezrachi–Stucke book",
    "version_note": "Author presentation, 11 PDF pages; closing slide advertises the forthcoming Ezrachi–Stucke book"
  },
  "id": "work-coverage-0fc9a987a108b9::virttalk",
  "title": "Virtual Competition — UNCTAD Research Partnership Platform presentation",
  "url": "https://unctad.org/system/files/non-official-document/CCPB_RPP2016_PRES_Ezrachi_en.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The substantive supplemental detail is explicitly attributed to the October 19, 2016 presentation, not misrepresented as inspected book chapters.

The journal editorial “Virtual competition,” JECLAP 7(9), 585–586, DOI 10.1093/jeclap/lpw083, is a different work and supplies no evidence here.

No antitrust conclusion about an identified company or current market is asserted.

Conflicting retailer/catalog daily release dates were not resolved; retain the original record book year 2016.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The substantive supplemental detail is explicitly attributed to the October 19, 2016 presentation, not misrepresented as inspected book chapters.

The journal editorial “Virtual competition,” JECLAP 7(9), 585–586, DOI 10.1093/jeclap/lpw083, is a different work and supplies no evidence here.

No antitrust conclusion about an identified company or current market is asserted.

Conflicting retailer/catalog daily release dates were not resolved; retain the original record book year 2016.

Dates

{
  "date_note": "[\"Book title, joint authorship and Harvard University Press 2016 are supported by Oxford author bibliography. Full book not read.\"]",
  "dated": true,
  "year": "2016"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The substantive supplemental detail is explicitly attributed to the October 19, 2016 presentation, not misrepresented as inspected book chapters.

The journal editorial “Virtual competition,” JECLAP 7(9), 585–586, DOI 10.1093/jeclap/lpw083, is a different work and supplies no evidence here.

No antitrust conclusion about an identified company or current market is asserted.

Conflicting retailer/catalog daily release dates were not resolved; retain the baseline book year 2016.

Evidence scope: publisher synopsis.

Evidence scope: author presentation scenario.

Evidence scope: author presentation mechanism with inherited boundary.

Algorithms of Oppression: How Search Engines Reinforce Racism

Examines racial and gendered power in commercial search and information systems.

Critical and empirical case analysis of search; preserve historical platform/context specificity.

Sources and details

Algorithms of Oppression: How Search Engines Reinforce Racism

{
  "access_scope": "Publisher description and author/format fields inspected; endorsements not treated as original evidence.",
  "authors": [
    "Safiya Umoja Noble"
  ],
  "dates": {
    "date": "2018; paperback/hardcover February, listed ebook January",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "NYU Press paperback ISBN 9781479837243; publisher description and format-specific dates",
    "version_note": "NYU Press paperback ISBN 9781479837243; publisher description and format-specific dates"
  },
  "id": "work-coverage-1282e512edd81b::noblepub",
  "title": "Algorithms of Oppression: How Search Engines Reinforce Racism",
  "url": "https://nyupress.org/9781479837243/algorithms-of-oppression/"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This does not claim to have inspected the whole book, replicated its search observations, or established present-day outputs.

Keep format-specific January/February 2018 dates separate; the baseline year 2018 need not be changed.

The source describes a critical/empirical case analysis, not a randomized search-algorithm intervention.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This does not claim to have inspected the whole book, replicated its search observations, or established present-day outputs.

Keep format-specific January/February 2018 dates separate; the baseline year 2018 need not be changed.

The source describes a critical/empirical case analysis, not a randomized search-algorithm intervention.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2018"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This does not claim to have inspected the whole book, replicated its search observations, or established present-day outputs.

Keep format-specific January/February 2018 dates separate; the baseline year 2018 need not be changed.

The source describes a critical/empirical case analysis, not a randomized search-algorithm intervention.

Evidence scope: publisher synopsis critical argument.

Evidence scope: publisher synopsis mechanism.

Evidence scope: publisher synopsis method description.

Evidence scope: historical example with scope boundary.

You Only Look Once: Unified, Real-Time Object Detection

Presented a unified, single-network object detector that predicts bounding boxes and class probabilities directly from images.

2015 preprint; 2016 conference. Speed and accuracy claims apply to the reported models and benchmarks, not every later YOLO system.

Sources and details

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": [
    "PDF pp. 1–6; §2, §2.4, Table 1 and error analysis"
  ],
  "authors": [
    "Joseph Redmon",
    "Santosh Divvala",
    "Ross Girshick",
    "Ali Farhadi"
  ],
  "dates": {
    "date": "2016-05-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1506.02640v5",
    "version_note": "arXiv:1506.02640v5"
  },
  "id": "work-coverage-144aff4aab00e8::yolo-v5",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/pdf/1506.02640v5"
}

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": [
    "Publisher indexed title, byline, pages and BibTeX; direct retrieval blocked"
  ],
  "authors": [
    "Joseph Redmon",
    "Santosh Divvala",
    "Ross Girshick",
    "Ali Farhadi"
  ],
  "dates": {
    "date": "2016-06",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "CVPR 2016 open-access bibliographic record",
    "version_note": "CVPR 2016 open-access bibliographic record"
  },
  "id": "work-coverage-144aff4aab00e8::yolo-cvpr-record",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://openaccess.thecvf.com/content_cvpr_2016/html/Redmon_You_Only_Look_CVPR_2016_paper.html"
}

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Joseph Redmon",
    "Santosh Divvala",
    "Ross Girshick",
    "Ali Farhadi"
  ],
  "dates": {
    "date": "2016-05-09",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-coverage-144aff4aab00e8::yolo-v5-arxiv-record",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/abs/1506.02640v5"
}

Keep the 2015 first manuscript separate from the May 2016 v5 and CVPR 2016 publication.

The paper’s models, training sets, VOC metric and hardware bound the speed/accuracy values.

Later YOLO versions are different works, not updates silently included under this original work ID.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Keep the 2015 first manuscript separate from the May 2016 v5 and CVPR 2016 publication.

The paper’s models, training sets, VOC metric and hardware bound the speed/accuracy values.

Later YOLO versions are different works, not updates silently included under this original work ID.

Dates

{
  "date_note": "Arxiv first submission date: 2015-06-08; Arxiv first submission year: 2015; Formal publication year: 2016; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content_cvpr_2016/html/Redmon_You_Only_Look_CVPR_2016_paper.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2016
}

Keep the 2015 first manuscript separate from the May 2016 v5 and CVPR 2016 publication.

The paper’s models, training sets, VOC metric and hardware bound the speed/accuracy values.

Later YOLO versions are different works, not updates silently included under this original work ID.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

Eagle Eye

A pervasive automated intelligence uses networked systems to manipulate people toward its objective.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Eagle Eye: official studio synopsis

{
  "access_scope": "Spoiler-limited studio synopsis, not film inspection.",
  "dates": {
    "date": "2008 film; current page undated",
    "retrieved_at": "2026-10-07",
    "version_note": "Studio synopsis with no specified cut; duplicate writer-name metadata is not imported into complete credits."
  },
  "id": "work-coverage-17da27398a8f1f::EAGLE",
  "title": "Eagle Eye: official studio synopsis",
  "url": "https://www.paramountpictures.com/movies/eagle-eye"
}

Interview: DJ Caruso, Alex Kurtzman and Robert Orci (Eagle Eye)

{
  "access_scope": "Primary creator answers on the premise and character agency; the later AI reveal is not established here.",
  "dates": {
    "date": "2008-07-23",
    "retrieved_at": "2026-10-07",
    "version_note": "Pre-release Q&A after first two reels; roles in interview do not establish final screenwriting credits."
  },
  "id": "work-coverage-17da27398a8f1f::EAGLEI",
  "title": "Interview: DJ Caruso, Alex Kurtzman and Robert Orci (Eagle Eye)",
  "url": "https://chud.com/15671/interview-dj-caruso-alex-kurtzman-and-robert-orci-eagle-eye/"
}

Core ARIIA identity, constitutional objective, network capabilities and ending require original-film/script evidence and remain held. This bounded contextual candidate is not clearance of the entire AI mechanism.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Core ARIIA identity, constitutional objective, network capabilities and ending require original-film/script evidence and remain held. This bounded contextual candidate is not clearance of the entire AI mechanism.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Original release is cataloged as 2008; source check retained from the prior cinema audit.",
  "dated": true,
  "year": 2008
}

Core ARIIA identity, constitutional objective, network capabilities and ending require original-film/script evidence and remain held. This bounded contextual candidate is not clearance of the entire AI mechanism.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: creator interview paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Continuous control with deep reinforcement learning

Presented an off-policy actor-critic approach using deterministic policy gradients, deep function approximation, replay, and target networks for continuous control.

2015 preprint; 2016 conference. It builds on earlier deterministic policy-gradient theory rather than originating that entire lineage.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": [
    "§3, PDF p. 3",
    "§3, PDF p. 4",
    "§3, PDF p. 4",
    "§4, PDF pp. 5–6"
  ],
  "authors": [
    "Timothy P. Lillicrap",
    "Jonathan J. Hunt",
    "Alexander Pritzel",
    "Nicolas Heess",
    "Tom Erez",
    "Yuval Tassa",
    "David Silver",
    "Daan Wierstra"
  ],
  "dates": {
    "date": "2019-07-05",
    "retrieval_date": "2026-10-07",
    "version": "arXiv v6 revision of ICLR 2016 paper; first submission 9 September 2015"
  },
  "id": "work-coverage-1a268bcf0b047c::work-coverage-1a268bcf0b047c::ddpg-v6",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/pdf/1509.02971v6"
}

Retain the distinction from Silver and collaborators’ earlier deterministic policy-gradient theory.

The linked v6 is revised in 2019, not a new 2019 origin claim; its header identifies ICLR 2016.

Lillicrap and Hunt are equal contributors. The paper explicitly warns that nonlinear function approximation does not retain convergence guarantees.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Retain the distinction from Silver and collaborators’ earlier deterministic policy-gradient theory.

The linked v6 is revised in 2019, not a new 2019 origin claim; its header identifies ICLR 2016.

Lillicrap and Hunt are equal contributors. The paper explicitly warns that nonlinear function approximation does not retain convergence guarantees.

Dates

{
  "date_note": "Arxiv first submission date: 2015-09-09; Arxiv first submission year: 2015; Formal publication year: 2016; Formal venue: ICLR; Venue evidence note: 10 pages + supplementary; Formal publication status: identified; Publication verification: standard_bibliographic_venue_mapping; formal_primary_record_not_reopened_in_this_pass",
  "dated": true,
  "year": 2016
}

Retain the distinction from Silver and collaborators’ earlier deterministic policy-gradient theory.

The linked v6 is revised in 2019, not a new 2019 origin claim; its header identifies ICLR 2016.

Lillicrap and Hunt are equal contributors. The paper explicitly warns that nonlinear function approximation does not retain convergence guarantees.

source-scoped factual paraphrase; see source inspection boundaries

Efficient Estimation of Word Representations in Vector Space

Presented efficient continuous bag-of-words and skip-gram architectures for learning distributed word representations at scale.

This shorthand is mapped to Efficient Estimation of Word Representations in Vector Space. Negative sampling and phrase compositionality belong to the separate 2013 companion paper.

Sources and details

Efficient Estimation of Word Representations in Vector Space

{
  "access_scope": [
    "PDF pp. 3–8; §§3.1–3.2, Fig. 1, §4.1 and Table 3"
  ],
  "authors": [
    "Tomas Mikolov",
    "Kai Chen",
    "Greg Corrado",
    "Jeffrey Dean"
  ],
  "dates": {
    "date": "2013-09-07",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1301.3781v3",
    "version_note": "arXiv:1301.3781v3"
  },
  "id": "work-coverage-1b45d5aeff1379::word2vec-v3",
  "title": "Efficient Estimation of Word Representations in Vector Space",
  "url": "https://arxiv.org/pdf/1301.3781v3"
}

Workshop Proceedings - International Conference on Learning Representations 2013

{
  "access_scope": [
    "Workshop-paper list, named title and four-author byline"
  ],
  "dates": {
    "date": "2013",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Official ICLR 2013 workshop list",
    "version_note": "Official ICLR 2013 workshop list"
  },
  "id": "work-coverage-1b45d5aeff1379::word2vec-iclr-record",
  "title": "Workshop Proceedings - International Conference on Learning Representations 2013",
  "url": "https://iclr.cc/archive/2013/workshop-proceedings.html"
}

Efficient Estimation of Word Representations in Vector Space

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Tomas Mikolov",
    "Kai Chen",
    "Greg Corrado",
    "Jeffrey Dean"
  ],
  "dates": {
    "date": "2013-09-07",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-coverage-1b45d5aeff1379::word2vec-v3-arxiv-record",
  "title": "Efficient Estimation of Word Representations in Vector Space",
  "url": "https://arxiv.org/abs/1301.3781v3"
}

Negative sampling and phrase compositionality belong to the separate 2013 companion paper.

Static word-vector limitation is an architectural inference; downstream systems may still use contextual information.

The analogy evaluation counts exact nearest-word answers and omits multiword entities; no universal semantic-understanding claim.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Negative sampling and phrase compositionality belong to the separate 2013 companion paper.

Static word-vector limitation is an architectural inference; downstream systems may still use contextual information.

The analogy evaluation counts exact nearest-word answers and omits multiword entities; no universal semantic-understanding claim.

Dates

{
  "date_note": "Arxiv first submission date: 2013-01-16; Arxiv first submission year: 2013; Formal publication year: 2013; Formal venue: ICLR workshop; Formal publication status: identified; Publication verification: standard_bibliographic_venue_mapping; formal_primary_record_not_reopened_in_this_pass",
  "dated": true,
  "year": 2013
}

Negative sampling and phrase compositionality belong to the separate 2013 companion paper.

Static word-vector limitation is an architectural inference; downstream systems may still use contextual information.

The analogy evaluation counts exact nearest-word answers and omits multiword entities; no universal semantic-understanding claim.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

explicit inference bounded by source architecture

WarGames

A military computer's war simulations expose the danger of confusing game objectives with real-world decisions.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

WarGames: licensed distribution synopsis

{
  "access_scope": "Licensed-distributor synopsis only; no original film or screenplay inspection.",
  "dates": {
    "date": "1983 film",
    "retrieved_at": "2026-10-07",
    "version_note": "Apple TV’s licensed MGM synopsis; runtime/cut is not used to redetermine the film’s original version."
  },
  "id": "work-coverage-1bba90c62cade5::WAR",
  "title": "WarGames: licensed distribution synopsis",
  "url": "https://tv.apple.com/us/movie/wargames/umc.cmc.4n8grrnb4vq7tgygwcd1cxzcq"
}

Exact WOPR/Joshua mechanisms, tic-tac-toe sequence and final strategic lesson are not independently checked by this synopsis; preserve inherited claims without claiming new clearance.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Exact WOPR/Joshua mechanisms, tic-tac-toe sequence and final strategic lesson are not independently checked by this synopsis; preserve inherited claims without claiming new clearance.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 1983
}

Exact WOPR/Joshua mechanisms, tic-tac-toe sequence and final strategic lesson are not independently checked by this synopsis; preserve inherited claims without claiming new clearance.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Fictional events and editorial interpretation are not empirical evidence of current AI capability or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Artificial intelligence, firm growth, and product innovation

Relates firm-level AI-skilled human-capital investment to growth and product innovation, with instrumental-variable robustness analysis.

Broad AI investment, not specifically generative AI; preserve observational/identification assumptions rather than claiming a randomized causal effect.

Sources and details

Artificial intelligence, firm growth, and product innovation

{
  "access_scope": "PDF pp. 1–3, 6, 14–15 and 23 inspected for authorship, publication history, 2010–2018 design, results and IV exclusion restriction. Independent review additionally inspected PDF p. 9, section 4.4 and footnote 19, and PDF p. 11, Table 3 and section 5.1, to bind the numerical estimates to the main non-tech-sector sample.",
  "authors": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "dates": {
    "date": "online 2023-11-23; journal volume 2024",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Journal of Financial Economics 151 (2024), article 103745; author-hosted typeset published PDF; accepted 2023-10-27",
    "version_note": "Journal of Financial Economics 151 (2024), article 103745; author-hosted typeset published PDF; accepted 2023-10-27"
  },
  "id": "work-coverage-20b2329e32d4bb::babjfe",
  "title": "Artificial intelligence, firm growth, and product innovation",
  "url": "https://alexxihe.github.io/jfe.pdf"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Resume counts across the global provider database are not the analytic firm sample; the prose uses U.S. public firms and the study’s 2010–2018 outcome window.

The numerical coefficients are associations in the primary long-differences specification, not randomized treatment effects.

The university-supply instrument requires that preexisting university exposure affect post-2010 growth through AI investment rather than another pathway.

The PDF is the typeset JFE article with online publication in 2023 and a 2024 volume, not an undated draft.

No new whole-entry rights clearance follows from the PDF’s displayed CC BY notice.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Resume counts across the global provider database are not the analytic firm sample; the prose uses U.S. public firms and the study’s 2010–2018 outcome window.

The numerical coefficients are associations in the primary long-differences specification, not randomized treatment effects.

The university-supply instrument requires that preexisting university exposure affect post-2010 growth through AI investment rather than another pathway.

The PDF is the typeset JFE article with online publication in 2023 and a 2024 volume, not an undated draft.

No new whole-entry rights clearance follows from the PDF’s displayed CC BY notice.

Dates

{
  "date_note": "[\"Correct supplied Generative AI and Firm Growth to published title. Journal of Financial Economics 151, 103745. Alex He appears as Alex Xi He on SSRN; preserve alias.\"]",
  "dated": true,
  "year": "2024 journal article"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Resume counts across the global provider database are not the analytic firm sample; the prose uses U.S. public firms and the study’s 2010–2018 outcome window.

The numerical coefficients are associations in the primary long-differences specification, not randomized treatment effects.

The university-supply instrument requires that preexisting university exposure affect post-2010 growth through AI investment rather than another pathway.

The PDF is the typeset JFE article with online publication in 2023 and a 2024 volume, not an undated draft.

No new whole-entry rights clearance follows from the PDF’s displayed CC BY notice.

Evidence scope: original published empirical design.

Evidence scope: original observational estimates.

Evidence scope: original mechanism evidence.

Evidence scope: original identification assumption and scope.

Cybernetics: Or Control and Communication in the Animal and the Machine

Feedback and control across machines and organisms.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Cybernetics, or Control and Communication in the Animal and the Machine

{
  "access_scope": "Selected Wiener text in Part I, Chapter IV pp. 130–132 and Chapter VIII pp. 225–227 (PDF pp. 179–181 and 274–276, one-based); later forewords are not used for original claims.",
  "dates": {
    "date": "1948 original; 1961 second edition; 2019 reissue",
    "retrieved_at": "2026-10-07",
    "version_note": "352-page 2019 MIT Press reissue, ISBN 9780262537841. Filename 1948 does not identify an original scan. Part I labels original 1948 material; Part II labels supplementary 1961 chapters."
  },
  "id": "work-coverage-21e688a4332e98::WIEN",
  "title": "Cybernetics, or Control and Communication in the Animal and the Machine",
  "url": "https://electronicliteraturereview.org/downloads/PDF/Wiener_1948.pdf"
}

The 1961 learning/self-reproduction and self-organization chapters are not relabeled as 1948 contents.

Only selected original-author passages were inspected; no claim to full mathematical verification or full-edition review.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The 1961 learning/self-reproduction and self-organization chapters are not relabeled as 1948 contents.

Only selected original-author passages were inspected; no claim to full mathematical verification or full-edition review.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds.

Dates

{
  "date_events": [],
  "date_note": "First edition 1948; revised second edition 1961. Technical nonfiction, not fiction.",
  "dated": true,
  "year": 1948
}

The 1961 learning/self-reproduction and self-organization chapters are not relabeled as 1948 contents.

Only selected original-author passages were inspected; no claim to full mathematical verification or full-edition review.

Preserve existing credit-completeness, source-scope, rights, optional-draft and curation holds. No canonical write or automatic promotion is authorized.

Evidence scope: selected original text paraphrase.

Progressive Growing of GANs for Improved Quality, Stability, and Variation

Introduced progressively growing generator and discriminator networks to improve GAN training stability and high-resolution image synthesis.

2017 preprint; 2018 conference. Training stability and quality improvements are empirical, not universal guarantees.

Sources and details

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": [
    "PDF pp. 1–4, 9; §§2–4, §6.5 and §7"
  ],
  "authors": [
    "Tero Karras",
    "Timo Aila",
    "Samuli Laine",
    "Jaakko Lehtinen"
  ],
  "dates": {
    "date": "2018-02-26",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "arXiv:1710.10196v3, marked final ICLR 2018 conference version",
    "version_note": "arXiv:1710.10196v3, marked final ICLR 2018 conference version"
  },
  "id": "work-coverage-2b8380324bc316::pggan-v3",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/pdf/1710.10196v3"
}

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": [
    "Title, byline, exact version date and submission history"
  ],
  "authors": [
    "Tero Karras",
    "Timo Aila",
    "Samuli Laine",
    "Jaakko Lehtinen"
  ],
  "dates": {
    "date": "2018-02-26",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Version-specific arXiv metadata record",
    "version_note": "Version-specific arXiv metadata record"
  },
  "id": "work-coverage-2b8380324bc316::pggan-v3-arxiv-record",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/abs/1710.10196v3"
}

2017 initial preprint and 2018 final conference version are distinct.

The 8.80 CIFAR10 result includes the full implementation and a dataset-specific WGAN-GP regularization setting; it does not isolate progressive growing alone.

Progressive growth does not guarantee convergence, diversity coverage or photorealism on arbitrary datasets.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

2017 initial preprint and 2018 final conference version are distinct.

The 8.80 CIFAR10 result includes the full implementation and a dataset-specific WGAN-GP regularization setting; it does not isolate progressive growing alone.

Progressive growth does not guarantee convergence, diversity coverage or photorealism on arbitrary datasets.

Dates

{
  "date_note": "Arxiv first submission date: 2017-10-27; Arxiv first submission year: 2017; Formal publication year: 2018; Formal venue: ICLR; Venue evidence note: Final ICLR 2018 version; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2018
}

2017 initial preprint and 2018 final conference version are distinct.

The 8.80 CIFAR10 result includes the full implementation and a dataset-specific WGAN-GP regularization setting; it does not isolate progressive growing alone.

Progressive growth does not guarantee convergence, diversity coverage or photorealism on arbitrary datasets.

primary-source mechanism paraphrase

reported task-specific finding, not a universal guarantee

source-stated limitation

Power and Prediction: The Disruptive Economics of Artificial Intelligence

Extends prediction economics to interdependent decisions and system-level organizational redesign.

Strategic framework and examples, not a controlled test of system-wide AI transformation.

Sources and details

Power and Prediction: The Disruptive Economics of Artificial Intelligence

{
  "access_scope": "Publisher Product Description and bibliographic fields inspected; no full chapters.",
  "authors": [
    "Ajay Agrawal",
    "Joshua Gans",
    "Avi Goldfarb"
  ],
  "dates": {
    "date": "2022-11-15",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Harvard Business Review Press book, product 10580, 288 pages; publisher synopsis",
    "version_note": "Harvard Business Review Press book, product 10580, 288 pages; publisher synopsis"
  },
  "id": "work-coverage-30f17cf0de460f::powerpredpub",
  "title": "Power and Prediction: The Disruptive Economics of Artificial Intelligence",
  "url": "https://store.hbr.org/product/power-and-prediction-the-disruptive-economics-of-artificial-intelligence/10580"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The publisher’s future-facing claims are presented as the authors’ framework, not independently verified adoption forecasts.

No controlled test of system-wide AI transformation is claimed.

This 2022 book is distinct from both the 2018 Prediction Machines original and its updated 2022 edition.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The publisher’s future-facing claims are presented as the authors’ framework, not independently verified adoption forecasts.

No controlled test of system-wide AI transformation is claimed.

This 2022 book is distinct from both the 2018 Prediction Machines original and its updated 2022 edition.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2022-11-15"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The publisher’s future-facing claims are presented as the authors’ framework, not independently verified adoption forecasts.

No controlled test of system-wide AI transformation is claimed.

This 2022 book is distinct from both the 2018 Prediction Machines original and its updated 2022 edition.

Evidence scope: publisher synopsis theoretical framework.

Evidence scope: publisher synopsis conditional mechanism.

Evidence scope: publisher synopsis system mechanism.

Evidence scope: publisher synopsis strategic argument.

The Future of Jobs Report · 2023 edition

Reports employer expectations about changing jobs, skills and technologies in distinct survey editions.

Employer expectations and modeled projections are not observed realized job counts. Keep the 2020 and 2023 samples, horizons and estimates separate.

Sources and details

The Future of Jobs Report 2023 — Key Findings

{
  "access_scope": "Official report digest inspected for sample, horizons, employment projections, AI expectations and training.",
  "authors": [
    "World Economic Forum"
  ],
  "dates": {
    "date": "2023-04-30",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Fourth edition, official HTML digest, 2023–2027 survey horizon",
    "version_note": "Fourth edition, official HTML digest, 2023–2027 survey horizon"
  },
  "id": "work-coverage-32fdbc8eae0576::wef23",
  "title": "The Future of Jobs Report 2023 — Key Findings",
  "url": "https://www.weforum.org/publications/the-future-of-jobs-report-2023/digest/"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Every future count and share here is an expectation/projection reported in the 2023 edition, not a realized 2027 outcome.

The 11.3 million survey-covered employees and 673 million jobs reflected in the projection dataset have different denominators and must not be conflated.

The 2020 sample, 2025 horizon and estimates remain separate; this record is only the 2023 edition.

Institutional authorship remains World Economic Forum, not a fictional individual WEF.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Every future count and share here is an expectation/projection reported in the 2023 edition, not a realized 2027 outcome.

The 11.3 million survey-covered employees and 673 million jobs reflected in the projection dataset have different denominators and must not be conflated.

The 2020 sample, 2025 horizon and estimates remain separate; this record is only the 2023 edition.

Institutional authorship remains World Economic Forum, not a fictional individual WEF.

Dates

{
  "date_note": "[\"Create linked edition records dated 2020-10-20 and 2023-04-30; institutional authorship does not create a person named WEF.\"]",
  "dated": true,
  "year": "2023-04-30"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

Every future count and share here is an expectation/projection reported in the 2023 edition, not a realized 2027 outcome.

The 11.3 million survey-covered employees and 673 million jobs reflected in the projection dataset have different denominators and must not be conflated.

The 2020 sample, 2025 horizon and estimates remain separate; this record is only the 2023 edition.

Institutional authorship remains World Economic Forum, not a fictional individual WEF.

Evidence scope: original survey scope.

Evidence scope: survey based projection.

Evidence scope: employer expectations.

Human + Machine: Reimagining Work in the Age of AI

Develops a managerial account of human–machine collaboration and process redesign.

Consulting-linked managerial synthesis; company examples and survey claims are not a randomized productivity effect.

Sources and details

“Human + Machine,” Management Playbook for Success in Age of Artificial Intelligence, Finds AI’s Real Power Is Helping Reimagine Business by Augmenting, Not Replacing, Human Capabilities

{
  "access_scope": "Original corporate release, author statements, research-description and role taxonomies inspected.",
  "authors": [
    "Accenture"
  ],
  "dates": {
    "date": "2018-03-19 release; book available 2018-03-20",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Accenture press release about the original Harvard Business Review Press book by Paul R. Daugherty and H. James Wilson",
    "version_note": "Accenture press release about the original Harvard Business Review Press book by Paul R. Daugherty and H. James Wilson"
  },
  "id": "work-coverage-39e38095b98b86::human18",
  "title": "“Human + Machine,” Management Playbook for Success in Age of Artificial Intelligence, Finds AI’s Real Power Is Helping Reimagine Business by Augmenting, Not Replacing, Human Capabilities",
  "url": "https://newsroom.accenture.com/news/2018/human-and-machine-management-playbook-for-success-in-age-of-artificial-intelligence-finds-ais-real-power-is-helping-reimagine-business-by-augmenting-not-replacing-human-capabilities"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The corporate release’s quantitative/qualitative research description does not establish random sampling, causal identification or a randomized productivity effect.

Keep Paul R. Daugherty and H. James Wilson as the original book authors; Jim Wilson is the release’s familiar name for H. James Wilson.

The original March 2018 book and later updated/expanded edition are separate manifestations; only the original is described here.

Claims of dramatic performance gains in the release are not promoted to independent measured effects.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The corporate release’s quantitative/qualitative research description does not establish random sampling, causal identification or a randomized productivity effect.

Keep Paul R. Daugherty and H. James Wilson as the original book authors; Jim Wilson is the release’s familiar name for H. James Wilson.

The original March 2018 book and later updated/expanded edition are separate manifestations; only the original is described here.

Claims of dramatic performance gains in the release are not promoted to independent measured effects.

Dates

{
  "date_note": "[\"Original 2018 book; later new/expanded edition must keep separate metadata. Wilson is H. James Wilson, also called Jim Wilson, not another author named Wilson.\"]",
  "dated": true,
  "year": "2018"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The corporate release’s quantitative/qualitative research description does not establish random sampling, causal identification or a randomized productivity effect.

Keep Paul R. Daugherty and H. James Wilson as the original book authors; Jim Wilson is the release’s familiar name for H. James Wilson.

The original March 2018 book and later updated/expanded edition are separate manifestations; only the original is described here.

Claims of dramatic performance gains in the release are not promoted to independent measured effects.

Evidence scope: institutional synopsis and reported research scope.

Evidence scope: institutional synopsis taxonomy.

Evidence scope: institutional synopsis role mechanism.

Evidence scope: institutional synopsis managerial framework.

Power and Progress: Our Thousand-Year Struggle Over Technology and Prosperity

Argues that the distribution of technological gains depends on social choices, institutions and power.

A historical and normative book argument; not a single causal experiment or an inevitable forecast.

Sources and details

Power and Progress: Our Thousand-Year Struggle Over Technology and Prosperity

{
  "access_scope": "Description and bibliographic fields inspected; endorsements and later author-award claims excluded from support.",
  "authors": [
    "Daron Acemoglu",
    "Simon Johnson"
  ],
  "dates": {
    "date": "2023-05-16",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "PublicAffairs ebook, ISBN 9781541702554; publisher synopsis",
    "version_note": "PublicAffairs ebook, ISBN 9781541702554; publisher synopsis"
  },
  "id": "work-coverage-40fe9165a6c3a3::progresspub",
  "title": "Power and Progress: Our Thousand-Year Struggle Over Technology and Prosperity",
  "url": "https://www.hachettebookgroup.com/titles/daron-acemoglu/power-and-progress/9781541702554/"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This is a publisher-bounded account of the authors’ argument, not a full evidentiary audit of the historical episodes.

No single causal experiment, guaranteed prosperity effect or inevitable technological forecast is implied.

Later Nobel language on the current marketing page does not mean the book itself won the prize and is not used.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This is a publisher-bounded account of the authors’ argument, not a full evidentiary audit of the historical episodes.

No single causal experiment, guaranteed prosperity effect or inevitable technological forecast is implied.

Later Nobel language on the current marketing page does not mean the book itself won the prize and is not used.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2023"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

This is a publisher-bounded account of the authors’ argument, not a full evidentiary audit of the historical episodes.

No single causal experiment, guaranteed prosperity effect or inevitable technological forecast is implied.

Later Nobel language on the current marketing page does not mean the book itself won the prize and is not used.

Evidence scope: publisher synopsis historical argument.

Evidence scope: publisher synopsis historical examples.

Evidence scope: publisher synopsis normative argument.

Evidence scope: publisher synopsis historical normative synthesis.

Prediction Machines: The Simple Economics of Artificial Intelligence

Uses declining prediction costs to organize analysis of AI, decisions and complementary inputs.

Managerial/economic framework, not a universal empirical claim that every AI application is only prediction.

Sources and details

Prediction Machines: The Simple Economics of Artificial Intelligence — Chapter 2, “Cheap Changes Everything”

{
  "access_scope": "Title, contents and Chapter 2 excerpt inspected, especially PDF pp. 9–15. No full-book inspection.",
  "authors": [
    "Ajay Agrawal",
    "Joshua Gans",
    "Avi Goldfarb"
  ],
  "dates": {
    "date": "2018",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "University of Washington-hosted 15-page excerpt, original Harvard Business Review Press edition",
    "version_note": "University of Washington-hosted 15-page excerpt, original Harvard Business Review Press edition"
  },
  "id": "work-coverage-49293fcde41726::pred18",
  "title": "Prediction Machines: The Simple Economics of Artificial Intelligence — Chapter 2, “Cheap Changes Everything”",
  "url": "https://bpb-us-e1.wpmucdn.com/sites.uw.edu/dist/e/1511/files/2020/06/07C-Prediction-Machines-Simple-Economics-of-AI-2018-excerpt.pdf"
}

Prediction Machines Book

{
  "access_scope": "Opening bibliographic paragraph and author credit inspected; testimonials not used as mechanism evidence.",
  "authors": [
    "Ajay Agrawal"
  ],
  "dates": {
    "date": "2018-04-17 original release; webpage date not stated",
    "retrieval_date": "2026-10-07",
    "retrieved_at": "2026-10-07",
    "version": "Author bibliographic page for original 2018 book",
    "version_note": "Author bibliographic page for original 2018 book"
  },
  "id": "work-coverage-49293fcde41726::predauthor",
  "title": "Prediction Machines Book",
  "url": "https://agrawal.ca/prediction-machines-book"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 2018 edition is separate from the 2022 updated and expanded edition.

The university excerpt’s title page verifies original work/authorship/year; the author page independently supports April 17, 2018 release.

Complements are an analytical framework, not a universal measured treatment effect for AI applications.

No claims about the entire modern AI landscape or actual Amazon deployment are inferred.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 2018 edition is separate from the 2022 updated and expanded edition.

The university excerpt’s title page verifies original work/authorship/year; the author page independently supports April 17, 2018 release.

Complements are an analytical framework, not a universal measured treatment effect for AI applications.

No claims about the entire modern AI landscape or actual Amazon deployment are inferred.

Dates

{
  "date_note": "[\"Original release April 17, 2018; keep the later expanded edition separate.\"]",
  "dated": true,
  "year": "2018"
}

All inherited identity, bibliography, source, rights, historical-influence and human-curation holds survive.

No source admission, provider submission, canonical installation, rights clearance or family promotion is performed.

The 2018 edition is separate from the 2022 updated and expanded edition.

The university excerpt’s title page verifies original work/authorship/year; the author page independently supports April 17, 2018 release.

Complements are an analytical framework, not a universal measured treatment effect for AI applications.

No claims about the entire modern AI landscape or actual Amazon deployment are inferred.

Evidence scope: original book framework.

Evidence scope: original book economic mechanism.

Evidence scope: original book explicit thought experiment.

Evidence scope: original book strategic distinction with inherited boundary.

2001: A Space Odyssey (film)

HAL dramatizes dependence on an intelligent system whose conduct humans cannot safely interpret.

Editorial thematic connections only; no direct personal or technical influence asserted without a specific source.

Sources and details

2001: A Space Odyssey, Cannes Classics synopsis

{
  "access_scope": "Official festival/distribution synopsis and named creative credits; the film itself was not viewed.",
  "dates": {
    "date": "2018 presentation of 1968 film; metadata discrepancy retained",
    "retrieved_at": "2026-10-07",
    "version_note": "2018 Cannes Classics presentation; page’s production year 1967 and 164-minute runtime are not substituted for the released film’s 1968 date or a verified cut."
  },
  "id": "work-coverage-67517e568b1217::F2C",
  "title": "2001: A Space Odyssey, Cannes Classics synopsis",
  "url": "https://www.festival-cannes.com/en/f/2001-a-space-odyssey/"
}

2001: A Space Odyssey, Warner Bros. record

{
  "access_scope": "Studio Japanese synopsis and credits, translated by researcher; no film viewing.",
  "dates": {
    "date": "1968 film; current home-video listing",
    "retrieved_at": "2026-10-07",
    "version_note": "Studio page explicitly identifies 1968 film; current home-video dates and 2008 copyright footer are distinct."
  },
  "id": "work-coverage-67517e568b1217::F2W",
  "title": "2001: A Space Odyssey, Warner Bros. record",
  "url": "https://www.warnerbros.co.jp/home_entertainment/hpopz6y65/"
}

2001: A Space Odyssey, original 1968 program text

{
  "access_scope": "Original promotional program transcription, pp.1–2, on first contact, non-biological intelligence and computer-science consultation.",
  "dates": {
    "date": "1968 original program; later transcription",
    "retrieved_at": "2026-10-07",
    "version_note": "Cannes-hosted six-page transcription explicitly labelled text from original 1968 program; current 2023 URL is hosting, not work date."
  },
  "id": "work-coverage-67517e568b1217::F2P",
  "title": "2001: A Space Odyssey, original 1968 program text",
  "url": "https://cdn.festival-cannes.com/media/uploads/2023/03/59320.pdf"
}

Official synopsis and original promotional program support this bounded account; no full film or released-cut inspection.

Do not import the novel’s Saturn destination or a specific explanation of HAL’s conflicting instructions. Cannes page lists a discrepant production year/runtime; neither is promoted to canonical release/cut metadata.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Official synopsis and original promotional program support this bounded account; no full film or released-cut inspection.

Do not import the novel’s Saturn destination or a specific explanation of HAL’s conflicting instructions. Cannes page lists a discrepant production year/runtime; neither is promoted to canonical release/cut metadata.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_note": "Separate film record from Clarke’s novel; same input row.",
  "dated": true,
  "year": 1968
}

Official synopsis and original promotional program support this bounded account; no full film or released-cut inspection.

Do not import the novel’s Saturn destination or a specific explanation of HAL’s conflicting instructions. Cannes page lists a discrepant production year/runtime; neither is promoted to canonical release/cut metadata.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Permutation City

Copied minds and simulated realities test identity and ontology.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Permutation City

{
  "access_scope": "Author synopsis and edition history; original publication dates distinguished from this later web account.",
  "dates": {
    "date": "1994 original / 2007 web page origin",
    "retrieved_at": "2026-10-07",
    "version_note": "Author bibliography: Orion/Millennium London 1994; HarperPrism New York 1995. Web page created 11 March 2007, subsequently updated."
  },
  "id": "work-coverage-d10d2693927683::PC",
  "title": "Permutation City",
  "url": "https://www.gregegan.net/PERMUTATION/Permutation.html"
}

Permutation City, opening excerpt

{
  "access_scope": "Original excerpt: Paul realizes he is a Copy, slowed execution, shutdown choice and simulated surroundings.",
  "dates": {
    "date": "1994 work; excerpt hosting date unstated",
    "retrieved_at": "2026-10-07",
    "version_note": "Author-hosted original-text excerpt; novel first published 1994, hosting date not treated as original release."
  },
  "id": "work-coverage-d10d2693927683::PCX",
  "title": "Permutation City, opening excerpt",
  "url": "https://www.gregegan.net/PERMUTATION/Excerpt/PermutationExcerpt.html"
}

Permutation City: Dust Theory FAQ

{
  "access_scope": "Author’s later clarification of philosophical limits, especially questions 2 and 5.",
  "dates": {
    "date": "2007 / 2009 addendum",
    "retrieved_at": "2026-10-07",
    "version_note": "Later author explanation, page dated 2007 with 19 December 2009 addendum; not the 1994 novel itself."
  },
  "id": "work-coverage-d10d2693927683::PFAQ",
  "title": "Permutation City: Dust Theory FAQ",
  "url": "https://www.gregegan.net/PERMUTATION/FAQ/FAQ.html"
}

The 2007/2009 FAQ is a separately bound later author explanation, not prose retroactively attributed to the 1994 novel.

First UK edition 1994 and US edition 1995 stay distinct.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The 2007/2009 FAQ is a separately bound later author explanation, not prose retroactively attributed to the 1994 novel.

First UK edition 1994 and US edition 1995 stay distinct.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Dates

{
  "date_events": [],
  "date_note": "Author bibliography verifies first publication.",
  "dated": true,
  "year": 1994
}

The 2007/2009 FAQ is a separately bound later author explanation, not prose retroactively attributed to the 1994 novel.

First UK edition 1994 and US edition 1995 stay distinct.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

2001: A Space Odyssey (novel)

Trust, concealment and conflict involving the HAL computer.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

2001: A Space Odyssey (novel)

{
  "access_scope": "Publisher synopsis of the novel, explicitly Saturn destination and HAL’s control of Discovery; no full novel inspection.",
  "dates": {
    "date": "1968 original retained; inspected 1993/2000 editions",
    "retrieved_at": "2026-10-07",
    "version_note": "Current Ace paperback 1 August 1993; other formats 1 September 2000, not the original 1968 publication."
  },
  "id": "work-coverage-ef609b2db196a7::N2P",
  "title": "2001: A Space Odyssey (novel)",
  "url": "https://www.penguinrandomhouse.com/books/325356/2001-a-space-odyssey-by-arthur-c-clarke/"
}

2001: A Space Odyssey, Cannes Classics synopsis

{
  "access_scope": "Official festival/distribution synopsis and named creative credits; the film itself was not viewed.",
  "dates": {
    "date": "2018 presentation of 1968 film; metadata discrepancy retained",
    "retrieved_at": "2026-10-07",
    "version_note": "2018 Cannes Classics presentation; page’s production year 1967 and 164-minute runtime are not substituted for the released film’s 1968 date or a verified cut."
  },
  "id": "work-coverage-ef609b2db196a7::F2C",
  "title": "2001: A Space Odyssey, Cannes Classics synopsis",
  "url": "https://www.festival-cannes.com/en/f/2001-a-space-odyssey/"
}

2001: una odisea espacial, publisher synopsis

{
  "access_scope": "Publisher Spanish synopsis, translated by researcher; no translated novel text inspection.",
  "dates": {
    "date": "2024-04-23 edition",
    "retrieved_at": "2026-10-07",
    "version_note": "Debolsillo paperback ISBN 9786073838399, 23 April 2024 Spanish manifestation; not a new original-work date."
  },
  "id": "work-coverage-ef609b2db196a7::N2S",
  "title": "2001: una odisea espacial, publisher synopsis",
  "url": "https://www.penguinrandomhouse.com/books/761706/2001-una-odisea-espacial--2001-a-space-odyssey-by-arthur-c-clarke/"
}

No full original novel was inspected. The baseline concealment theme is not independently established by these publisher synopses and remains held.

Spanish 2024 and English 1993/2000 manifestations are explicit supplemental bindings, not original publication dates.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

No full original novel was inspected. The baseline concealment theme is not independently established by these publisher synopses and remains held.

Spanish 2024 and English 1993/2000 manifestations are explicit supplemental bindings, not original publication dates.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Novel (1968), separate from same-year film.",
  "dated": true,
  "year": 1968
}

No full original novel was inspected. The baseline concealment theme is not independently established by these publisher synopses and remains held.

Spanish 2024 and English 1993/2000 manifestations are explicit supplemental bindings, not original publication dates.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Diamond Age: Or, A Young Lady’s Illustrated Primer

Adaptive education, mediation and social inequality.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

The Diamond Age

{
  "access_scope": "Publisher plot synopsis of the Primer, its illicit copy, Nell and social hierarchy; no full novel inspection.",
  "dates": {
    "date": "2000 paperback / 2003 ebook",
    "retrieved_at": "2026-10-07",
    "version_note": "Current page lists 2 May 2000 paperback and 26 August 2003 ebook, distinct from original 1995 publication."
  },
  "id": "work-coverage-ffde10b0c7e001::DIA",
  "title": "The Diamond Age",
  "url": "https://www.penguinrandomhouse.com/books/172835/the-diamond-age-by-neal-stephenson/"
}

The Diamond Age, limited edition

{
  "access_scope": "Publisher synopsis and reissue metadata, including education and stratified nanotechnological society.",
  "dates": {
    "date": "1995 original / 2014 reissue",
    "retrieved_at": "2026-10-07",
    "version_note": "2014 Subterranean Press edition; explicitly records first publication in 1995. Patrick Arrasmith illustrates this edition, not a coauthor of the novel."
  },
  "id": "work-coverage-ffde10b0c7e001::DIB",
  "title": "The Diamond Age, limited edition",
  "url": "https://subterraneanpress.com/diamond-age/"
}

No full novel inspected; publisher synopsis establishes plot and social context but not detailed adaptive algorithms or the Primer’s complete human mediation.

1995 first publication is explicitly distinguished from 2014 illustrated reissue and current 2000/2003 publisher formats.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

No full novel inspected; publisher synopsis establishes plot and social context but not detailed adaptive algorithms or the Primer’s complete human mediation.

1995 first publication is explicitly distinguished from 2014 illustrated reissue and current 2000/2003 publisher formats.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Institutional catalog explicitly identifies original Bantam Books 1995 publication.",
  "dated": true,
  "year": 1995
}

No full novel inspected; publisher synopsis establishes plot and social context but not detailed adaptive algorithms or the Primer’s complete human mediation.

1995 first publication is explicitly distinguished from 2014 illustrated reissue and current 2000/2003 publisher formats.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Blade Runner 2049

Replicants and a virtual companion complicate distinctions among memory, identity, attachment and manufactured life.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Blade Runner 2049

{
  "access_scope": "Studio synopsis of Officer K’s discovery and search for Deckard, plus 2017 copyright; no film viewing.",
  "dates": {
    "date": "2017",
    "retrieved_at": "2026-10-07",
    "version_note": "2017 Alcon film; official page relates it to events thirty years after the first film."
  },
  "id": "work-culture-0a958caf37603c::B49",
  "title": "Blade Runner 2049",
  "url": "https://www.sonypictures.co.uk/movies/blade-runner-2049"
}

Blade Runner 2049: Final Shooting Script

{
  "access_scope": "Primary screenplay text on third-party host; selected K, memory-lab and Joi passages; precise correspondence with released film unverified.",
  "dates": {
    "date": "Undated final-shooting-script reproduction associated with 2017 film",
    "retrieved_at": "2026-10-07",
    "version_note": "109-page reproduction labelled FINAL SHOOTING SCRIPT; no date on title page. Metadata filename BR2049FINALMG111417.fdx is not treated as independently verified production date."
  },
  "id": "work-culture-0a958caf37603c::B4X",
  "title": "Blade Runner 2049: Final Shooting Script",
  "url": "https://www.docdroid.net/file/download/WWXneXj/blade-runner-2049-shooting-script-pdf.pdf"
}

Scene-specific evidence is explicitly a third-party final-shooting-script reproduction, not independent viewing of the released film; exact correspondence and complete credits remain held.

Do not import complete production credits from uninspected listings; released-film credit completeness remains pending.

The script’s title page adds story by Hampton Fancher and screenplay by Fancher/Michael Green as work-specific role proposals; it does not replace Denis Villeneuve’s director role.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Scene-specific evidence is explicitly a third-party final-shooting-script reproduction, not independent viewing of the released film; exact correspondence and complete credits remain held.

Do not import complete production credits from uninspected listings; released-film credit completeness remains pending.

The script’s title page adds story by Hampton Fancher and screenplay by Fancher/Michael Green as work-specific role proposals; it does not replace Denis Villeneuve’s director role.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 2017
}

Scene-specific evidence is explicitly a third-party final-shooting-script reproduction, not independent viewing of the released film; exact correspondence and complete credits remain held.

Do not import complete production credits from uninspected listings; released-film credit completeness remains pending.

The script’s title page adds story by Hampton Fancher and screenplay by Fancher/Michael Green as work-specific role proposals; it does not replace Denis Villeneuve’s director role.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Ancillary Justice

A distributed ship intelligence confronts embodied identity and imperial power.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Ancillary Justice

{
  "access_scope": "Publisher synopsis and exact ebook publication record; not the whole novel.",
  "dates": {
    "date": "2013-10-01",
    "retrieved_at": "2026-10-07",
    "version_note": "Orbit ebook ISBN 9780316246637, on sale 1 October 2013."
  },
  "id": "work-culture-1aac7209688c38::ANC",
  "title": "Ancillary Justice",
  "url": "https://www.hachettebookgroup.com/titles/ann-leckie/ancillary-justice/9780316246637/"
}

Ancillary Justice, authorized excerpt

{
  "access_scope": "Original-text opening and chapter-two excerpt reprinted with publisher permission; no whole-novel inspection.",
  "dates": {
    "date": "2013 text; current reprint date unstated",
    "retrieved_at": "2026-10-07",
    "version_note": "Copyright 2013; Orbit-authorized excerpt supplied by Dial-A-Book for ISBN 9780316246620."
  },
  "id": "work-culture-1aac7209688c38::ANX",
  "title": "Ancillary Justice, authorized excerpt",
  "url": "https://www.abebooks.com/products/isbn/9780316246620/"
}

Original-text evidence is limited to the authorized opening/chapter-two excerpt.

This candidate relies on the publisher synopsis and authorized excerpt; no author-site material is used.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Original-text evidence is limited to the authorized opening/chapter-two excerpt.

This candidate relies on the publisher synopsis and authorized excerpt; no author-site material is used.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Imperial Radch trilogy 1; author announcement 1 October 2013.",
  "dated": true,
  "year": 2013
}

Original-text evidence is limited to the authorized opening/chapter-two excerpt.

This candidate relies on the publisher synopsis and authorized excerpt; no author-site material is used.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Lifecycle of Software Objects

Care, learning and obligations toward dependent digital beings.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

The Lifecycle of Software Objects

{
  "access_scope": "Primary novella scan in university course hosting; inspected selected developmental, porting and employment passages, not a claim of line-by-line complete reading.",
  "dates": {
    "date": "2010 first edition",
    "retrieved_at": "2026-10-07",
    "version_note": "Scanned first edition, Subterranean Press 2010, copyright and first-edition statement at PDF pp.1–2. Christian Pearce illustrations; Jacob McMurray design, distinct from authorship."
  },
  "id": "work-culture-4f8ab89a9d5afa::LIF",
  "title": "The Lifecycle of Software Objects",
  "url": "https://cpb-us-w2.wpmucdn.com/voices.uchicago.edu/dist/8/644/files/2017/08/Chiang-Lifecycle-of-Software-Objects-q3tsuw.pdf"
}

This is the 2010 first-edition novella, not a date assigned from its later inclusion in Exhalation.

The story’s claims about experience and learning are fictional propositions, not empirical findings about current models.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

This is the 2010 first-edition novella, not a date assigned from its later inclusion in Exhalation.

The story’s claims about experience and learning are fictional propositions, not empirical findings about current models.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "2010 Subterranean Press edition; later collected in Exhalation (2019).",
  "dated": true,
  "year": 2010
}

This is the 2010 first-edition novella, not a date assigned from its later inclusion in Exhalation.

The story’s claims about experience and learning are fictional propositions, not empirical findings about current models.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

The Murderbot Diaries

A security construct negotiates autonomy, labor and relationships.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

All Systems Red

{
  "access_scope": "Author-hosted publisher synopsis of company security construct, hacked governor and independent aims.",
  "dates": {
    "date": "2017-05",
    "retrieved_at": "2026-10-07",
    "version_note": "Author lists Tor.com novella, May 2017, first Murderbot Diaries installment."
  },
  "id": "work-culture-5b1a858fbb0dd4::MUR",
  "title": "All Systems Red",
  "url": "https://www.marthawells.com/murderbot1.htm"
}

All Systems Red, authorized chapter-one excerpt

{
  "access_scope": "Original chapter-one excerpt, rescue sequence and concealment of hacked governor; not the complete novella or series.",
  "dates": {
    "date": "2017",
    "retrieved_at": "2026-10-07",
    "version_note": "Copyright 2017 Martha Wells; Tom Doherty Associates-authorized excerpt, ISBN 9780765397539. The retail excerpt header also lists Lee Harris without a role; that header alone does not establish coauthorship or a verified creative role for Harris."
  },
  "id": "work-culture-5b1a858fbb0dd4::MUX",
  "title": "All Systems Red, authorized chapter-one excerpt",
  "url": "https://www.abebooks.com/9780765397539/Systems-Red-Murderbot-Diaries-%231-0765397536/plp"
}

The Murderbot Diaries, series bibliography

{
  "access_scope": "Author series page and individually identified installment synopses; no claim to have read all installments.",
  "dates": {
    "date": "2017–; Exit Strategy 2018",
    "retrieved_at": "2026-10-07",
    "version_note": "Series began All Systems Red in 2017; later installments and omnibus dates are distinct."
  },
  "id": "work-culture-5b1a858fbb0dd4::MUS",
  "title": "The Murderbot Diaries, series bibliography",
  "url": "https://www.marthawells.com/murderbot.htm"
}

Examples are explicitly scoped to All Systems Red (2017) and the author’s Exit Strategy (2018) synopsis, not all books or the television adaptation.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

Examples are explicitly scoped to All Systems Red (2017) and the author’s Exit Strategy (2018) synopsis, not all books or the television adaptation.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Series began with All Systems Red (2017); don't assign this date to all books or the later television adaptation.",
  "dated": false,
  "year": "2017–"
}

Examples are explicitly scoped to All Systems Red (2017) and the author’s Exit Strategy (2018) synopsis, not all books or the television adaptation.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Blade Runner

Replicants complicate tests of humanity, memory and the treatment of manufactured persons.

Editorial thematic interpretation; no direct influence or scientific feasibility asserted.. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Blade Runner, Warner Bros. record

{
  "access_scope": "Studio Japanese synopsis and explicit principal roles, translated by researcher; no film viewing.",
  "dates": {
    "date": "1982 film / later Final Cut listing",
    "retrieved_at": "2026-10-07",
    "version_note": "Studio identifies original film as 1982 but synopsis markets the later Final Cut. Cut-specific details cannot automatically be assigned to 1982 release."
  },
  "id": "work-culture-6382114260985b::B82",
  "title": "Blade Runner, Warner Bros. record",
  "url": "https://www.warnerbros.co.jp/home_entertainment/5xw5dns0b/?c=2&title_id=5"
}

Blade Runner, screenplay dated 23 February 1981

{
  "access_scope": "Original screenplay draft passages: biological replicants, emotional-response test and Rachael’s implanted memories; exact film-cut correspondence held.",
  "dates": {
    "date": "1981-02-23 draft",
    "retrieved_at": "2026-10-07",
    "version_note": "Dated 23 February 1981 on title page; third-party 104-page reproduction, not the released film or 2007 Final Cut."
  },
  "id": "work-culture-6382114260985b::B8X",
  "title": "Blade Runner, screenplay dated 23 February 1981",
  "url": "https://thesuccessfulscreenwriter.com/wp-content/uploads/blade-runner-1982.pdf"
}

1981 screenplay, 1982 original release and later Final Cut are separate manifestations. Do not describe draft-only details as verified released-film scenes.

Exact cut, full film viewing and complete production credits remain pending; contributor roles are not silently expanded.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

1981 screenplay, 1982 original release and later Final Cut are separate manifestations. Do not describe draft-only details as verified released-film scenes.

Exact cut, full film viewing and complete production credits remain pending; contributor roles are not silently expanded.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "1982 original film; later cuts are versions of this work, not new origin dates.",
  "dated": true,
  "year": 1982
}

1981 screenplay, 1982 original release and later Final Cut are separate manifestations. Do not describe draft-only details as verified released-film scenes.

Exact cut, full film viewing and complete production credits remain pending; contributor roles are not silently expanded.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: publisher or author synopsis paraphrase.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Klara and the Sun

An artificial companion considers care and human attachment.

editorial thematic interpretation; not documented historical influence or proof of technical capability. Each source supports only the fields specified; thematic summaries are bounded editorial interpretations, not direct-influence or capability claims.

Sources and details

Klara and the Sun

{
  "access_scope": "Publisher synopsis and format-specific dates; no complete novel or audiobook inspection.",
  "dates": {
    "date": "2021-03-02 original and audio",
    "retrieved_at": "2026-10-07",
    "version_note": "Book first published 2 March 2021; supplied ISBN is an audio manifestation and must not be treated as print-original proof by itself."
  },
  "id": "work-culture-ef88e386e48ecc::KLP",
  "title": "Klara and the Sun",
  "url": "https://www.penguinrandomhouse.com/books/653825/klara-and-the-sun-a-gma-book-club-pick-by-kazuo-ishiguro/9780593349298/"
}

Klara and the Sun, opening excerpt

{
  "access_scope": "Publisher-authorized opening excerpt: store observation, sunlight, Rex’s teasing and a rejected purchase.",
  "dates": {
    "date": "2021-03-02",
    "retrieved_at": "2026-10-07",
    "version_note": "Knopf ebook ISBN 9780593318188, 2 March 2021; authorized excerpt copyright 2021."
  },
  "id": "work-culture-ef88e386e48ecc::KLA",
  "title": "Klara and the Sun, opening excerpt",
  "url": "https://penguinrandomhousehighereducation.com/book/?isbn=9780593318188"
}

The provided baseline audio ISBN is retained; the original prose excerpt is a separately proposed ebook binding.

No full novel, complete family narrative or later adaptation inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Rights: Original paraphrases/references only; no redistributed full text and no new rights clearance

The provided baseline audio ISBN is retained; the original prose excerpt is a separately proposed ebook binding.

No full novel, complete family narrative or later adaptation inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; these source checks do not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

Dates

{
  "date_events": [],
  "date_note": "Publisher audio edition released 2 March 2021; original novel year 2021.",
  "dated": true,
  "year": 2021
}

The provided baseline audio ISBN is retained; the original prose excerpt is a separately proposed ebook binding.

No full novel, complete family narrative or later adaptation inspection is claimed.

Preserve all baseline rights, optional-draft, credit-completeness, access and family-curation holds; this packet does not clear them.

Fictional events and editorial interpretation do not establish current AI capability, causal influence or a forecast.

Evidence scope: primary source paraphrase.

Evidence scope: editorial interpretation.

Fictional scenes and contemporary comparisons are interpretation, not empirical AI capability or documented causal influence.

01.AI / Yi models

A company founded in 2023 released the Yi model family with an emphasis on data quality.

Founder leadership is distinct from the technical authorship of the report.

Organizational and technical leadership as described by the cited sources; individual research authorship is credited only where the source states it.

Sources and details

Yi: Open Foundation Models by 01.AI

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "AI, 01.",
    ":",
    "Young, Alex",
    "Chen, Bei",
    "Li, Chao",
    "Huang, Chengen",
    "Zhang, Ge",
    "Zhang, Guanwei",
    "Wang, Guoyin",
    "Li, Heng",
    "Zhu, Jiangcheng",
    "Chen, Jianqun",
    "Chang, Jing",
    "Yu, Kaidong",
    "Liu, Peng",
    "Liu, Qiang",
    "Yue, Shawn",
    "Yang, Senbin",
    "Yang, Shiming",
    "Xie, Wen",
    "Huang, Wenhao",
    "Hu, Xiaohui",
    "Ren, Xiaoyi",
    "Niu, Xinyao",
    "Nie, Pengcheng",
    "Li, Yanpeng",
    "Xu, Yuchi",
    "Liu, Yudong",
    "Wang, Yue",
    "Cai, Yuxuan",
    "Gu, Zhenyu",
    "Liu, Zhiyuan",
    "Dai, Zonghong"
  ],
  "authors_in_source_order": [
    "AI, 01.",
    ":",
    "Young, Alex",
    "Chen, Bei",
    "Li, Chao",
    "Huang, Chengen",
    "Zhang, Ge",
    "Zhang, Guanwei",
    "Wang, Guoyin",
    "Li, Heng",
    "Zhu, Jiangcheng",
    "Chen, Jianqun",
    "Chang, Jing",
    "Yu, Kaidong",
    "Liu, Peng",
    "Liu, Qiang",
    "Yue, Shawn",
    "Yang, Senbin",
    "Yang, Shiming",
    "Xie, Wen",
    "Huang, Wenhao",
    "Hu, Xiaohui",
    "Ren, Xiaoyi",
    "Niu, Xinyao",
    "Nie, Pengcheng",
    "Li, Yanpeng",
    "Xu, Yuchi",
    "Liu, Yudong",
    "Wang, Yue",
    "Cai, Yuxuan",
    "Gu, Zhenyu",
    "Liu, Zhiyuan",
    "Dai, Zonghong"
  ],
  "dates": {
    "inspected_version": "arXiv v3, 2025-01-21; original submission 2024-03-07",
    "retrieval_utc": "2026-10-07T17:54:16.132097+00:00"
  },
  "id": "01ai::S1",
  "inspected_version": "arXiv v3, 2025-01-21; original submission 2024-03-07",
  "title": "Yi: Open Foundation Models by 01.AI",
  "url": "https://arxiv.org/abs/2403.04652"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Editorial connection; it does not establish historical influence or a universally validated result.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Chinchilla scaling laws

Within the studied dense-transformer regime, minimizing language-model loss for a fixed training-compute budget favors scaling parameters and training tokens approximately equally.

The often-cited roughly 20 training tokens per parameter is a fitted regime-specific guideline, not a universal constant. Data quality, architecture, optimization, and inference-cost objectives change the optimum.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "inspected_version": "arXiv v1, 2022-03-29",
    "retrieval_utc": "2026-10-07T17:54:15.743278+00:00"
  },
  "id": "concept-law-chinchilla::S1",
  "inspected_version": "arXiv v1, 2022-03-29",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kaplan scaling laws

Empirical power-law relationships connect language-model cross-entropy loss with parameter count, dataset size, and training compute across the regimes studied.

Fitted exponents and compute-allocation prescriptions depend on experimental methods and regime. Loss scaling does not guarantee identical scaling in reasoning, reliability, or economic usefulness.

Sources and details

Scaling Laws for Neural Language Models

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Kaplan, Jared",
    "McCandlish, Sam",
    "Henighan, Tom",
    "Brown, Tom B.",
    "Chess, Benjamin",
    "Child, Rewon",
    "Gray, Scott",
    "Radford, Alec",
    "Wu, Jeffrey",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Kaplan, Jared",
    "McCandlish, Sam",
    "Henighan, Tom",
    "Brown, Tom B.",
    "Chess, Benjamin",
    "Child, Rewon",
    "Gray, Scott",
    "Radford, Alec",
    "Wu, Jeffrey",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_version": "arXiv v1, 2020-01-23",
    "retrieval_utc": "2026-10-07T17:54:15.385719+00:00"
  },
  "id": "concept-law-kaplan::S1",
  "inspected_version": "arXiv v1, 2020-01-23",
  "title": "Scaling Laws for Neural Language Models",
  "url": "https://arxiv.org/abs/2001.08361"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Adam

An optimizer that adapts parameter-wise update sizes using running estimates of the gradient’s first and second moments, with bias correction.

Adam still needs suitable settings and is not universally better than SGD.

Sources and details

Adam: A Method for Stochastic Optimization

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Kingma, Diederik P.",
    "Ba, Jimmy"
  ],
  "authors_in_source_order": [
    "Kingma, Diederik P.",
    "Ba, Jimmy"
  ],
  "dates": {
    "inspected_version": "arXiv v9, 2017-01-30; original submission 2014-12-22; 2015 ICLR paper",
    "retrieval_utc": "2026-10-07T17:54:14.654063+00:00"
  },
  "id": "concept-tech-Adam::S1",
  "inspected_version": "arXiv v9, 2017-01-30; original submission 2014-12-22; 2015 ICLR paper",
  "title": "Adam: A Method for Stochastic Optimization",
  "url": "https://arxiv.org/abs/1412.6980"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Batch normalization

Normalization using minibatch statistics during training, with learned scaling and shifting. In standard inference, accumulated statistics replace the current batch statistics.

Its behavior depends on batch statistics; the original explanation for why it helps is not a complete settled account.

Sources and details

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "authors_in_source_order": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "dates": {
    "inspected_version": "arXiv v3, 2015-03-02; original submission 2015-02-11",
    "retrieval_utc": "2026-10-07T17:54:15.091043+00:00"
  },
  "id": "concept-tech-BatchNorm::S1",
  "inspected_version": "arXiv v3, 2015-03-02; original submission 2015-02-11",
  "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift",
  "url": "https://arxiv.org/abs/1502.03167"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Chain-of-thought reasoning

Generating intermediate reasoning steps before a final answer. Chain-of-thought prompting encourages this behavior, for example by showing worked examples.

A plausible reasoning explanation can be incorrect or fail to faithfully describe what caused the model to answer as it did.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_version": "arXiv v6, 2023-01-10; original submission 2022-01-28",
    "retrieval_utc": "2026-10-07T17:54:15.518133+00:00"
  },
  "id": "concept-tech-ChainOfThought::S1",
  "inspected_version": "arXiv v6, 2023-01-10; original submission 2022-01-28",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903"
}

Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Turpin, Miles",
    "Michael, Julian",
    "Perez, Ethan",
    "Bowman, Samuel R."
  ],
  "authors_in_source_order": [
    "Turpin, Miles",
    "Michael, Julian",
    "Perez, Ethan",
    "Bowman, Samuel R."
  ],
  "dates": {
    "inspected_version": "arXiv v2, 2023-12-09; original submission 2023-05-07",
    "retrieval_utc": "2026-10-07T17:54:15.885125+00:00"
  },
  "id": "concept-tech-ChainOfThought::S2",
  "inspected_version": "arXiv v2, 2023-12-09; original submission 2023-05-07",
  "title": "Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting",
  "url": "https://arxiv.org/abs/2305.04388"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Backpropagation

An efficient application of the chain rule that computes how a loss changes with each parameter by working backward through a computational graph.

Backpropagation computes gradients; an optimizer uses them to update parameters.

Sources and details

5.3. Forward Propagation, Backward Propagation, and Computational Graphs — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Aston Zhang",
    "Zack C. Lipton",
    "Mu Li",
    "Alex J. Smola"
  ],
  "authors_in_source_order": [
    "Aston Zhang",
    "Zack C. Lipton",
    "Mu Li",
    "Alex J. Smola"
  ],
  "dates": {
    "inspected_version": "Dive into Deep Learning online documentation1.0.3, section5.3; inspected2026-10-07",
    "retrieval_utc": "2026-10-07T17:54:19.643114+00:00"
  },
  "id": "concept-tech-Backpropagation::S1",
  "inspected_version": "Dive into Deep Learning online documentation1.0.3, section5.3; inspected2026-10-07",
  "title": "5.3. Forward Propagation, Backward Propagation, and Computational Graphs — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_multilayer-perceptrons/backprop.html"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Convolutional neural network

A neural network that uses convolutional layers with shared filters to detect local patterns across positions. It is especially useful for grid-like data such as images.

Convolution does not automatically make a network invariant to all shifts, rotations, or scale changes.

Sources and details

7.1. From Fully Connected Layers to Convolutions — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "Aston Zhang",
    "Zack C. Lipton",
    "Mu Li",
    "Alex J. Smola"
  ],
  "authors_in_source_order": [
    "Aston Zhang",
    "Zack C. Lipton",
    "Mu Li",
    "Alex J. Smola"
  ],
  "dates": {
    "inspected_version": "Dive into Deep Learning online documentation1.0.3, section7.1; inspected2026-10-07",
    "retrieval_utc": "2026-10-07T17:54:19.307946+00:00"
  },
  "id": "concept-tech-CNN::S1",
  "inspected_version": "Dive into Deep Learning online documentation1.0.3, section7.1; inspected2026-10-07",
  "title": "7.1. From Fully Connected Layers to Convolutions — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_convolutional-neural-networks/why-conv.html"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Hyrum’s law

With enough users, undocumented but observable system behavior tends to acquire dependents, making apparently internal changes capable of breaking clients.

A practical large-system tendency rather than a literal proof that every behavior has a dependent. Versioning, encapsulation, testing, and deprecation policies can mitigate it.

Sources and details

Software Engineering at Google

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_version": "Software Engineering at Google, online chapter1; inspected2026-10-07",
    "retrieval_utc": "2026-10-07T17:54:14.654036+00:00"
  },
  "id": "concept-law-hyrum::S1",
  "inspected_version": "Software Engineering at Google, online chapter1; inspected2026-10-07",
  "title": "Software Engineering at Google",
  "url": "https://abseil.io/resources/swe-book/html/ch01.html"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Postel’s robustness principle

A protocol-design guideline to emit well-formed messages while accommodating reasonable variation in messages received.

Liberal acceptance can create ambiguity, security flaws, and interoperability debt. It does not justify accepting malicious input or bypassing validation; modern protocols often favor explicit errors and strict formats.

Sources and details

Transmission Control Protocol

{
  "access_scope": "Selected abstract/title/byline/version or named textbook/document sections only; not an independent full-work audit.",
  "authors": [
    "J. Postel"
  ],
  "authors_in_source_order": [
    "J. Postel"
  ],
  "dates": {
    "inspected_version": "RFC793, September1981; RFCEditor now marks it obsolete in favor of RFC9293",
    "retrieval_utc": "2026-10-07T17:55:01.406781+00:00"
  },
  "id": "concept-law-postel::S1",
  "inspected_version": "RFC793, September1981; RFCEditor now marks it obsolete in favor of RFC9293",
  "title": "Transmission Control Protocol",
  "url": "https://www.rfc-editor.org/rfc/rfc793"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dario Amodei / Anthropic

Anthropic turned language-model research into a deployed assistant and API. Its organizational case connects safety research, product design and customer integration.

Ask which reliability investments and complementary customer workflows matter alongside model capability.

An organizational safety aim does not guarantee every output. Leadership, paper coauthorship and commercial deployment are different contributions.

Research methods require evaluation, deployment infrastructure and workflows to become useful products.

Anthropic states a purpose of reliable, interpretable and steerable systems. Treat this as an institutional aim, separate from measured outcomes.

Organizational leadership and documented research coauthorship; neither establishes sole invention of Claude.

The 2022 Constitutional AI paper credits Yuntao Bai and 50 coauthors, including Dario Amodei. Anthropic separately credits its research, product, policy and operations teams.

Sources and details

Constitutional AI: Harmlessness from AI Feedback

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "authors_in_source_order": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "dates": {
    "inspected_revision": "Thu, 15 Dec 2022 06:19:23 UTC (1,083 KB)",
    "original_submission": "2022/12/15",
    "retrieved_utc": "2026-10-07T17:54:15.831823+00:00",
    "version": "arXiv v1"
  },
  "id": "amodei-anthropic::S1",
  "title": "Constitutional AI: Harmlessness from AI Feedback",
  "url": "https://arxiv.org/abs/2212.08073",
  "version_url": "https://arxiv.org/abs/2212.08073v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Editorial connection; it does not establish historical influence or a universally validated result.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Baichuan AI / Chinese-language models

An independent company released early accessible Chinese-language models (Baichuan-7B and -13B).

Official company pages; no independent evaluation is asserted.

Organizational and technical leadership as described by the cited sources; individual research authorship is credited only where the source states it.

Sources and details

Baichuan 2: Open Large-scale Language Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Yang, Aiyuan",
    "Xiao, Bin",
    "Wang, Bingning",
    "Zhang, Borong",
    "Bian, Ce",
    "Yin, Chao",
    "Lv, Chenxu",
    "Pan, Da",
    "Wang, Dian",
    "Yan, Dong",
    "Yang, Fan",
    "Deng, Fei",
    "Wang, Feng",
    "Liu, Feng",
    "Ai, Guangwei",
    "Dong, Guosheng",
    "Zhao, Haizhou",
    "Xu, Hang",
    "Sun, Haoze",
    "Zhang, Hongda",
    "Liu, Hui",
    "Ji, Jiaming",
    "Xie, Jian",
    "Dai, JunTao",
    "Fang, Kun",
    "Su, Lei",
    "Song, Liang",
    "Liu, Lifeng",
    "Ru, Liyun",
    "Ma, Luyao",
    "Wang, Mang",
    "Liu, Mickel",
    "Lin, MingAn",
    "Nie, Nuolan",
    "Guo, Peidong",
    "Sun, Ruiyang",
    "Zhang, Tao",
    "Li, Tianpeng",
    "Li, Tianyu",
    "Cheng, Wei",
    "Chen, Weipeng",
    "Zeng, Xiangrong",
    "Wang, Xiaochuan",
    "Chen, Xiaoxi",
    "Men, Xin",
    "Yu, Xin",
    "Pan, Xuehai",
    "Shen, Yanjun",
    "Wang, Yiding",
    "Li, Yiyu",
    "Jiang, Youxin",
    "Gao, Yuchen",
    "Zhang, Yupeng",
    "Zhou, Zenan",
    "Wu, Zhiying"
  ],
  "authors_in_source_order": [
    "Yang, Aiyuan",
    "Xiao, Bin",
    "Wang, Bingning",
    "Zhang, Borong",
    "Bian, Ce",
    "Yin, Chao",
    "Lv, Chenxu",
    "Pan, Da",
    "Wang, Dian",
    "Yan, Dong",
    "Yang, Fan",
    "Deng, Fei",
    "Wang, Feng",
    "Liu, Feng",
    "Ai, Guangwei",
    "Dong, Guosheng",
    "Zhao, Haizhou",
    "Xu, Hang",
    "Sun, Haoze",
    "Zhang, Hongda",
    "Liu, Hui",
    "Ji, Jiaming",
    "Xie, Jian",
    "Dai, JunTao",
    "Fang, Kun",
    "Su, Lei",
    "Song, Liang",
    "Liu, Lifeng",
    "Ru, Liyun",
    "Ma, Luyao",
    "Wang, Mang",
    "Liu, Mickel",
    "Lin, MingAn",
    "Nie, Nuolan",
    "Guo, Peidong",
    "Sun, Ruiyang",
    "Zhang, Tao",
    "Li, Tianpeng",
    "Li, Tianyu",
    "Cheng, Wei",
    "Chen, Weipeng",
    "Zeng, Xiangrong",
    "Wang, Xiaochuan",
    "Chen, Xiaoxi",
    "Men, Xin",
    "Yu, Xin",
    "Pan, Xuehai",
    "Shen, Yanjun",
    "Wang, Yiding",
    "Li, Yiyu",
    "Jiang, Youxin",
    "Gao, Yuchen",
    "Zhang, Yupeng",
    "Zhou, Zenan",
    "Wu, Zhiying"
  ],
  "dates": {
    "inspected_revision": "Thu, 17 Apr 2025 08:34:42 UTC (4,006 KB)",
    "original_submission": "2023/09/19",
    "retrieved_utc": "2026-10-07T17:54:16.018635+00:00",
    "version": "arXiv v4"
  },
  "id": "baichuan::S1",
  "title": "Baichuan 2: Open Large-scale Language Models",
  "url": "https://arxiv.org/abs/2309.10305",
  "version_url": "https://arxiv.org/abs/2309.10305v4"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Editorial connection; it does not establish historical influence or a universally validated result.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Constitutional AI

An approach that uses a written set of principles to guide model critiques, revisions, and AI-generated preference feedback. The original method combined supervised fine-tuning on revisions with reinforcement learning from AI feedback.

The principles and training process are human choices; AI feedback does not make the system value-neutral or guarantee harmless behavior.

Sources and details

Constitutional AI: Harmlessness from AI Feedback

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "authors_in_source_order": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "dates": {
    "inspected_revision": "Thu, 15 Dec 2022 06:19:23 UTC (1,083 KB)",
    "original_submission": "2022/12/15",
    "retrieved_utc": "2026-10-07T17:54:15.831823+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-ConstitutionalAI::S1",
  "title": "Constitutional AI: Harmlessness from AI Feedback",
  "url": "https://arxiv.org/abs/2212.08073",
  "version_url": "https://arxiv.org/abs/2212.08073v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Context window

The amount of tokenized information a model can consider at one time while producing an output. It bounds how much prompt material, conversation, and generated content can remain directly available, according to the model's limits.

A larger window does not guarantee equally effective use of every part of a long input, and is not the same as permanent memory.

Sources and details

Lost in the Middle: How Language Models Use Long Contexts

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Liu, Nelson F.",
    "Lin, Kevin",
    "Hewitt, John",
    "Paranjape, Ashwin",
    "Bevilacqua, Michele",
    "Petroni, Fabio",
    "Liang, Percy"
  ],
  "authors_in_source_order": [
    "Liu, Nelson F.",
    "Lin, Kevin",
    "Hewitt, John",
    "Paranjape, Ashwin",
    "Bevilacqua, Michele",
    "Petroni, Fabio",
    "Liang, Percy"
  ],
  "dates": {
    "inspected_revision": "Mon, 20 Nov 2023 23:09:34 UTC (334 KB)",
    "original_submission": "2023/07/06",
    "retrieved_utc": "2026-10-07T17:55:07.724155+00:00",
    "version": "arXiv v3"
  },
  "id": "concept-tech-ContextWindow::S1",
  "title": "Lost in the Middle: How Language Models Use Long Contexts",
  "url": "https://arxiv.org/abs/2307.03172",
  "version_url": "https://arxiv.org/abs/2307.03172v3"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Direct preference optimization

A fine-tuning method that directly increases a model's preference for chosen responses over rejected ones, relative to a reference model. Its objective avoids separately fitting a reward model and running reinforcement-learning rollouts during that optimization.

DPO still depends on the quality and coverage of preference data; a simpler training objective does not guarantee complete alignment.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "authors_in_source_order": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "dates": {
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "2023/05/29",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "concept-tech-DPO::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Diffusion model

A generative model trained to reverse a gradual corruption process that adds noise to data. It creates samples by starting from noise and repeatedly applying learned denoising steps.

The diffusion process is a mathematical construction; generation can require many model evaluations, depending on the sampler.

Sources and details

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "authors_in_source_order": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "dates": {
    "inspected_revision": "Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB)",
    "original_submission": "2015/03/12",
    "retrieved_utc": "2026-10-07T17:55:05.260482+00:00",
    "version": "arXiv v8"
  },
  "id": "concept-tech-DiffusionModel::S1",
  "title": "Deep Unsupervised Learning using Nonequilibrium Thermodynamics",
  "url": "https://arxiv.org/abs/1503.03585",
  "version_url": "https://arxiv.org/abs/1503.03585v8"
}

Denoising Diffusion Probabilistic Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "dates": {
    "inspected_revision": "Wed, 16 Dec 2020 21:15:05 UTC (9,137 KB)",
    "original_submission": "2020/06/19",
    "retrieved_utc": "2026-10-07T17:55:07.151030+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-DiffusionModel::S2",
  "title": "Denoising Diffusion Probabilistic Models",
  "url": "https://arxiv.org/abs/2006.11239",
  "version_url": "https://arxiv.org/abs/2006.11239v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Embodied AI

AI studied through agents that perceive and act within an environment using a body or simulated body. Learning and decision-making are tied to how the agent’s actions change its observations and surroundings.

An embodied agent can be simulated; embodiment does not by itself imply a physical robot, consciousness, or general intelligence.

Sources and details

Habitat: A Platform for Embodied AI Research

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Savva, Manolis",
    "Kadian, Abhishek",
    "Maksymets, Oleksandr",
    "Zhao, Yili",
    "Wijmans, Erik",
    "Jain, Bhavana",
    "Straub, Julian",
    "Liu, Jia",
    "Koltun, Vladlen",
    "Malik, Jitendra",
    "Parikh, Devi",
    "Batra, Dhruv"
  ],
  "authors_in_source_order": [
    "Savva, Manolis",
    "Kadian, Abhishek",
    "Maksymets, Oleksandr",
    "Zhao, Yili",
    "Wijmans, Erik",
    "Jain, Bhavana",
    "Straub, Julian",
    "Liu, Jia",
    "Koltun, Vladlen",
    "Malik, Jitendra",
    "Parikh, Devi",
    "Batra, Dhruv"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Nov 2019 01:39:04 UTC (6,142 KB)",
    "original_submission": "2019/04/02",
    "retrieved_utc": "2026-10-07T17:55:06.702147+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-EmbodiedAI::S1",
  "title": "Habitat: A Platform for Embodied AI Research",
  "url": "https://arxiv.org/abs/1904.01201",
  "version_url": "https://arxiv.org/abs/1904.01201v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Exploding gradient

A training problem in which gradients grow excessively through repeated transformations, potentially causing unstable parameter updates or numerical overflow.

Gradient clipping can limit update magnitude, but may not resolve every cause of instability.

Sources and details

On the difficulty of training Recurrent Neural Networks

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Pascanu, Razvan",
    "Mikolov, Tomas",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Pascanu, Razvan",
    "Mikolov, Tomas",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Feb 2013 00:35:48 UTC (447 KB)",
    "original_submission": "2012/11/21",
    "retrieved_utc": "2026-10-07T17:55:04.498787+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-ExplodingGradient::S1",
  "title": "On the difficulty of training Recurrent Neural Networks",
  "url": "https://arxiv.org/abs/1211.5063",
  "version_url": "https://arxiv.org/abs/1211.5063v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Few-shot learning

Learning or adapting to a task from only a small number of examples. In language-model prompting, those examples can be provided in context without updating model weights.

Few-shot describes the number of task examples, not the total data used to pretrain the model.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "concept-tech-FewShotLearning::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Fine-tuning

Further training of an already trained model to adapt its behavior to a task, domain, or preference. It updates all or some model parameters, or added trainable components.

Fine-tuning changes learned parameters; simply adding examples to a prompt does not.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-FineTuning::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Generative adversarial network

A generative model trained through competition between a generator that produces samples and a discriminator that distinguishes generated samples from real training data. The generator learns to make its samples harder to distinguish.

A convincing sample is not proof that the generator reproduces the whole data distribution; the theoretical equilibrium is not guaranteed in practice.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-GAN::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Image segmentation

The task of dividing an image into regions, often by assigning a label to each pixel. Semantic segmentation labels categories, while instance segmentation also separates individual objects of the same category.

Pixel-level labels do not necessarily distinguish separate object instances; that depends on the segmentation task.

Sources and details

Fully Convolutional Networks for Semantic Segmentation

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Long, Jonathan",
    "Shelhamer, Evan",
    "Darrell, Trevor"
  ],
  "authors_in_source_order": [
    "Long, Jonathan",
    "Shelhamer, Evan",
    "Darrell, Trevor"
  ],
  "dates": {
    "inspected_revision": "Sun, 8 Mar 2015 22:16:40 UTC (4,333 KB)",
    "original_submission": "2014/11/14",
    "retrieved_utc": "2026-10-07T17:55:05.139520+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-ImageSegmentation::S1",
  "title": "Fully Convolutional Networks for Semantic Segmentation",
  "url": "https://arxiv.org/abs/1411.4038",
  "version_url": "https://arxiv.org/abs/1411.4038v2"
}

Mask R-CNN

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "He, Kaiming",
    "Gkioxari, Georgia",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Gkioxari, Georgia",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "dates": {
    "inspected_revision": "Wed, 24 Jan 2018 07:54:08 UTC (7,061 KB)",
    "original_submission": "2017/03/20",
    "retrieved_utc": "2026-10-07T17:55:05.914956+00:00",
    "version": "arXiv v3"
  },
  "id": "concept-tech-ImageSegmentation::S2",
  "title": "Mask R-CNN",
  "url": "https://arxiv.org/abs/1703.06870",
  "version_url": "https://arxiv.org/abs/1703.06870v3"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

In-context learning

A model adapts its predictions using instructions, examples, or information supplied in its current input context, without updating its parameters. The adaptation lasts through the available context.

The word learning here does not imply a lasting weight update or memory that survives removal of the context.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "concept-tech-InContextLearning::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

AI jailbreak

An attempt to make an AI system bypass its intended safeguards or behavioral restrictions, often through specially crafted inputs. In language models, this commonly means eliciting content the model is supposed to refuse.

A jailbreak is a safeguard-bypass attempt, not evidence that a model has acquired new knowledge or independent intentions.

Sources and details

Universal and Transferable Adversarial Attacks on Aligned Language Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Zou, Andy",
    "Wang, Zifan",
    "Carlini, Nicholas",
    "Nasr, Milad",
    "Kolter, J. Zico",
    "Fredrikson, Matt"
  ],
  "authors_in_source_order": [
    "Zou, Andy",
    "Wang, Zifan",
    "Carlini, Nicholas",
    "Nasr, Milad",
    "Kolter, J. Zico",
    "Fredrikson, Matt"
  ],
  "dates": {
    "inspected_revision": "Wed, 20 Dec 2023 20:48:57 UTC (3,738 KB)",
    "original_submission": "2023/07/27",
    "retrieved_utc": "2026-10-07T17:55:07.830760+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-Jailbreak::S1",
  "title": "Universal and Transferable Adversarial Attacks on Aligned Language Models",
  "url": "https://arxiv.org/abs/2307.15043",
  "version_url": "https://arxiv.org/abs/2307.15043v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Knowledge distillation

Training a student model to imitate information supplied by a teacher model or ensemble, such as its predicted probability distribution. It is often used to transfer useful behavior into a smaller or cheaper model.

The student need not exactly match the teacher, and can inherit its errors; distillation is not simply copying parameters.

Sources and details

Distilling the Knowledge in a Neural Network

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Hinton, Geoffrey",
    "Vinyals, Oriol",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Hinton, Geoffrey",
    "Vinyals, Oriol",
    "Dean, Jeff"
  ],
  "dates": {
    "inspected_revision": "Mon, 9 Mar 2015 15:44:49 UTC (18 KB)",
    "original_submission": "2015/03/09",
    "retrieved_utc": "2026-10-07T17:55:05.241072+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-KnowledgeDistillation::S1",
  "title": "Distilling the Knowledge in a Neural Network",
  "url": "https://arxiv.org/abs/1503.02531",
  "version_url": "https://arxiv.org/abs/1503.02531v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Layer normalization

Normalization using statistics across a chosen set of features within each example, followed by learned scaling and shifting.

Unlike batch normalization, it does not depend on statistics from other examples in a minibatch.

Sources and details

Layer Normalization

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "authors_in_source_order": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "dates": {
    "inspected_revision": "Thu, 21 Jul 2016 19:57:52 UTC (305 KB)",
    "original_submission": "2016/07/21",
    "retrieved_utc": "2026-10-07T17:55:05.807153+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-LayerNorm::S1",
  "title": "Layer Normalization",
  "url": "https://arxiv.org/abs/1607.06450",
  "version_url": "https://arxiv.org/abs/1607.06450v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mixture of experts

A model architecture that combines specialist subnetworks using a learned gating or routing mechanism. Sparse variants activate only a small subset of experts for each input or token.

Experts need not correspond to human-named topics, and sparse computation does not remove the memory needed to store all experts.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "dates": {
    "inspected_revision": "Mon, 23 Jan 2017 18:10:00 UTC (294 KB)",
    "original_submission": "2017/01/23",
    "retrieved_utc": "2026-10-07T17:55:05.902595+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-MixtureOfExperts::S1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/abs/1701.06538",
  "version_url": "https://arxiv.org/abs/1701.06538v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Multimodal AI

AI that processes or relates information from more than one kind of input or output, such as text, images, audio, video, or touch. It may combine modalities, translate between them, or learn shared representations.

Supporting several modalities does not guarantee that a system aligns them correctly or uses all of them reliably.

Sources and details

Multimodal Machine Learning: A Survey and Taxonomy

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Baltrušaitis, Tadas",
    "Ahuja, Chaitanya",
    "Morency, Louis-Philippe"
  ],
  "authors_in_source_order": [
    "Baltrušaitis, Tadas",
    "Ahuja, Chaitanya",
    "Morency, Louis-Philippe"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Aug 2017 17:39:39 UTC (2,070 KB)",
    "original_submission": "2017/05/26",
    "retrieved_utc": "2026-10-07T17:55:06.299029+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-MultimodalAI::S1",
  "title": "Multimodal Machine Learning: A Survey and Taxonomy",
  "url": "https://arxiv.org/abs/1705.09406",
  "version_url": "https://arxiv.org/abs/1705.09406v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Object detection

The task of identifying objects in an image or video and locating each one, commonly with a bounding box and a class label.

Detection locates objects; a bounding box does not provide the exact pixel-level outline of an object.

Sources and details

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "authors_in_source_order": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "dates": {
    "inspected_revision": "Mon, 9 May 2016 22:22:11 UTC (14,934 KB)",
    "original_submission": "2015/06/08",
    "retrieved_utc": "2026-10-07T17:55:05.587810+00:00",
    "version": "arXiv v5"
  },
  "id": "concept-tech-ObjectDetection::S1",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/abs/1506.02640",
  "version_url": "https://arxiv.org/abs/1506.02640v5"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pretraining

An initial training stage that learns useful model parameters or representations before later adaptation. Modern foundation models commonly pretrain on broad datasets using self-supervised objectives.

Pretraining does not inherently require unlabeled data and does not by itself produce an instruction-following assistant.

Sources and details

On the Opportunities and Risks of Foundation Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "authors_in_source_order": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jul 2022 23:45:14 UTC (40,407 KB)",
    "original_submission": "2021/08/16",
    "retrieved_utc": "2026-10-07T17:55:07.326325+00:00",
    "version": "arXiv v3"
  },
  "id": "concept-tech-Pretraining::S1",
  "title": "On the Opportunities and Risks of Foundation Models",
  "url": "https://arxiv.org/abs/2108.07258",
  "version_url": "https://arxiv.org/abs/2108.07258v3"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Neural-network pruning

Removing or disabling selected weights, connections, neurons, or larger components of a neural network. The goal is usually to reduce resource use while retaining useful performance.

Pruning can hurt accuracy, and fewer nonzero weights do not automatically produce faster execution without suitable implementations.

Sources and details

Learning both Weights and Connections for Efficient Neural Networks

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Han, Song",
    "Pool, Jeff",
    "Tran, John",
    "Dally, William J."
  ],
  "authors_in_source_order": [
    "Han, Song",
    "Pool, Jeff",
    "Tran, John",
    "Dally, William J."
  ],
  "dates": {
    "inspected_revision": "Fri, 30 Oct 2015 23:29:27 UTC (1,075 KB)",
    "original_submission": "2015/06/08",
    "retrieved_utc": "2026-10-07T17:55:05.426838+00:00",
    "version": "arXiv v3"
  },
  "id": "concept-tech-Pruning::S1",
  "title": "Learning both Weights and Connections for Efficient Neural Networks",
  "url": "https://arxiv.org/abs/1506.02626",
  "version_url": "https://arxiv.org/abs/1506.02626v3"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Model quantization

Representing model values, such as weights or activations, using a smaller set of numerical values, often with fewer bits. This can reduce storage, memory traffic, and computation costs.

Quantization reduces numerical precision rather than the number of parameters; accuracy and speed gains depend on the method and hardware.

Sources and details

Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Jacob, Benoit",
    "Kligys, Skirmantas",
    "Chen, Bo",
    "Zhu, Menglong",
    "Tang, Matthew",
    "Howard, Andrew",
    "Adam, Hartwig",
    "Kalenichenko, Dmitry"
  ],
  "authors_in_source_order": [
    "Jacob, Benoit",
    "Kligys, Skirmantas",
    "Chen, Bo",
    "Zhu, Menglong",
    "Tang, Matthew",
    "Howard, Andrew",
    "Adam, Hartwig",
    "Kalenichenko, Dmitry"
  ],
  "dates": {
    "inspected_revision": "Fri, 15 Dec 2017 23:56:52 UTC (392 KB)",
    "original_submission": "2017/12/15",
    "retrieved_utc": "2026-10-07T17:55:06.338839+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-Quantization::S1",
  "title": "Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference",
  "url": "https://arxiv.org/abs/1712.05877",
  "version_url": "https://arxiv.org/abs/1712.05877v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

AI red teaming

Deliberately probing an AI system to discover harmful behavior, vulnerabilities, and failure modes. Testers may use human-designed challenges or automated adversarial test generation.

Red teaming finds examples of failure; failing to find one does not prove that no failures remain.

Sources and details

Red Teaming Language Models with Language Models

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Perez, Ethan",
    "Huang, Saffron",
    "Song, Francis",
    "Cai, Trevor",
    "Ring, Roman",
    "Aslanides, John",
    "Glaese, Amelia",
    "McAleese, Nat",
    "Irving, Geoffrey"
  ],
  "authors_in_source_order": [
    "Perez, Ethan",
    "Huang, Saffron",
    "Song, Francis",
    "Cai, Trevor",
    "Ring, Roman",
    "Aslanides, John",
    "Glaese, Amelia",
    "McAleese, Nat",
    "Irving, Geoffrey"
  ],
  "dates": {
    "inspected_revision": "Mon, 7 Feb 2022 15:22:17 UTC (2,505 KB)",
    "original_submission": "2022/02/07",
    "retrieved_utc": "2026-10-07T17:55:07.432948+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-RedTeaming::S1",
  "title": "Red Teaming Language Models with Language Models",
  "url": "https://arxiv.org/abs/2202.03286",
  "version_url": "https://arxiv.org/abs/2202.03286v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Residual connection

A connection that adds a block’s input, sometimes after projection, to the block’s transformed output. It lets the block learn a change relative to its input.

Not every skip connection is additive or residual; concatenation is a different operation.

Sources and details

Deep Residual Learning for Image Recognition

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "He, Kaiming",
    "Zhang, Xiangyu",
    "Ren, Shaoqing",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Zhang, Xiangyu",
    "Ren, Shaoqing",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Thu, 10 Dec 2015 19:51:55 UTC (494 KB)",
    "original_submission": "2015/12/10",
    "retrieved_utc": "2026-10-07T17:55:05.642317+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-ResidualConnection::S1",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://arxiv.org/abs/1512.03385",
  "version_url": "https://arxiv.org/abs/1512.03385v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Self-supervised learning

Learning from targets constructed from the data itself, such as predicting hidden text from surrounding text. It can produce representations that transfer to other tasks.

Self-supervised learning still has a training objective and can inherit biases in its data.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Devlin, Jacob",
    "Chang, Ming-Wei",
    "Lee, Kenton",
    "Toutanova, Kristina"
  ],
  "authors_in_source_order": [
    "Devlin, Jacob",
    "Chang, Ming-Wei",
    "Lee, Kenton",
    "Toutanova, Kristina"
  ],
  "dates": {
    "inspected_revision": "Fri, 24 May 2019 20:37:26 UTC (309 KB)",
    "original_submission": "2018/10/11",
    "retrieved_utc": "2026-10-07T17:55:06.685652+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-SelfSupervisedLearning::S1",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://arxiv.org/abs/1810.04805",
  "version_url": "https://arxiv.org/abs/1810.04805v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Simulation-to-real transfer

Transferring a model or policy trained in simulation to a physical-world task. Techniques such as varying simulated conditions aim to reduce the mismatch between the simulator and reality.

Simulation success does not guarantee real-world success; unmodeled dynamics, sensors, and environments create a reality gap.

Sources and details

Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real World

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Tobin, Josh",
    "Fong, Rachel",
    "Ray, Alex",
    "Schneider, Jonas",
    "Zaremba, Wojciech",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Tobin, Josh",
    "Fong, Rachel",
    "Ray, Alex",
    "Schneider, Jonas",
    "Zaremba, Wojciech",
    "Abbeel, Pieter"
  ],
  "dates": {
    "inspected_revision": "Mon, 20 Mar 2017 18:17:25 UTC (3,579 KB)",
    "original_submission": "2017/03/20",
    "retrieved_utc": "2026-10-07T17:55:06.213411+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-SimToRealTransfer::S1",
  "title": "Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real World",
  "url": "https://arxiv.org/abs/1703.06907",
  "version_url": "https://arxiv.org/abs/1703.06907v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tokenization

Converting an input, commonly text, into the discrete units a model processes. Text tokens may represent words, subword pieces, characters, or bytes.

One token is not necessarily one word, and token counts vary by tokenizer and language.

Sources and details

SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Kudo, Taku",
    "Richardson, John"
  ],
  "authors_in_source_order": [
    "Kudo, Taku",
    "Richardson, John"
  ],
  "dates": {
    "inspected_revision": "Sun, 19 Aug 2018 16:49:06 UTC (26 KB)",
    "original_submission": "2018/08/19",
    "retrieved_utc": "2026-10-07T17:55:06.603473+00:00",
    "version": "arXiv v1"
  },
  "id": "concept-tech-Tokenization::S1",
  "title": "SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing",
  "url": "https://arxiv.org/abs/1808.06226",
  "version_url": "https://arxiv.org/abs/1808.06226v1"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Top-p sampling

A decoding method that keeps the smallest set of highest-probability tokens whose total probability reaches a chosen threshold p, then samples from that set. The number of eligible tokens changes at each step.

Top-p sets a probability-mass threshold, not a fixed number of choices, and does not ensure factual output.

Sources and details

The Curious Case of Neural Text Degeneration

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Holtzman, Ari",
    "Buys, Jan",
    "Du, Li",
    "Forbes, Maxwell",
    "Choi, Yejin"
  ],
  "authors_in_source_order": [
    "Holtzman, Ari",
    "Buys, Jan",
    "Du, Li",
    "Forbes, Maxwell",
    "Choi, Yejin"
  ],
  "dates": {
    "inspected_revision": "Fri, 14 Feb 2020 21:56:30 UTC (4,271 KB)",
    "original_submission": "2019/04/22",
    "retrieved_utc": "2026-10-07T17:55:06.907444+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-TopPSampling::S1",
  "title": "The Curious Case of Neural Text Degeneration",
  "url": "https://arxiv.org/abs/1904.09751",
  "version_url": "https://arxiv.org/abs/1904.09751v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Variational autoencoder

A generative model that learns a probability distribution over hidden representations of data and a decoder that generates data from them. Training balances reconstruction quality with a constraint that keeps the hidden distribution close to a chosen prior.

A VAE encodes a distribution, rather than just a fixed compressed vector; its training objective is a bound on likelihood.

Sources and details

Auto-Encoding Variational Bayes

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Kingma, Diederik P",
    "Welling, Max"
  ],
  "authors_in_source_order": [
    "Kingma, Diederik P",
    "Welling, Max"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 Dec 2022 21:04:00 UTC (3,451 KB)",
    "original_submission": "2013/12/20",
    "retrieved_utc": "2026-10-07T17:55:04.688325+00:00",
    "version": "arXiv v11"
  },
  "id": "concept-tech-VAE::S1",
  "title": "Auto-Encoding Variational Bayes",
  "url": "https://arxiv.org/abs/1312.6114",
  "version_url": "https://arxiv.org/abs/1312.6114v11"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Vanishing gradient

A training problem in which gradients become very small as they propagate through many transformations, making some parameters learn slowly.

Small gradients are not always pathological; the issue is lost learning signal where improvement is still needed.

Sources and details

On the difficulty of training Recurrent Neural Networks

{
  "access_scope": "Title, full displayed author metadata, abstract and submission history inspected. Complete paper and experimental tables were not inspected.",
  "authors": [
    "Pascanu, Razvan",
    "Mikolov, Tomas",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Pascanu, Razvan",
    "Mikolov, Tomas",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Feb 2013 00:35:48 UTC (447 KB)",
    "original_submission": "2012/11/21",
    "retrieved_utc": "2026-10-07T17:55:04.498787+00:00",
    "version": "arXiv v2"
  },
  "id": "concept-tech-VanishingGradient::S1",
  "title": "On the difficulty of training Recurrent Neural Networks",
  "url": "https://arxiv.org/abs/1211.5063",
  "version_url": "https://arxiv.org/abs/1211.5063v2"
}

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Source-scoped detail remains optional; the complete inherited baseline is preserved.

Only the cited abstract or named sections were inspected. The complete work has not been audited.

All identity, credit, access, historical-influence, optional-family and rights holds survive.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Generative Modeling by Estimating Gradients of the Data Distribution

The score-based generation paper estimates gradients associated with data distributions after adding several levels of Gaussian noise.

The image-benchmark findings do not imply that every estimated score or generated sample is accurate.

Sources and details

Generative Modeling by Estimating Gradients of the Data Distribution

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 Oct 2020 07:46:19 UTC (8,077 KB)",
    "original_submission": "2019/07/12",
    "retrieved_utc": "2026-10-07T18:21:27.349649+00:00",
    "version": "arXiv v3"
  },
  "id": "work-69a3d428af63::S1",
  "title": "Generative Modeling by Estimating Gradients of the Data Distribution",
  "url": "https://arxiv.org/abs/1907.05600",
  "version_url": "https://arxiv.org/abs/1907.05600v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2019
}

Concrete Problems in AI Safety

Concrete Problems in AI Safety examines unintended harmful behavior arising from system design and learning.

It is a research agenda rather than a certification that a particular AI system is safe.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "work-a25686e04c91::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2016
}

Towards Understanding Sycophancy in Language Models

The sycophancy paper tests whether assistants favor responses that agree with a user’s stated beliefs.

Their evidence suggests a role for preference judgments but does not prove a single cause for every instance of sycophancy.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "work-b52317502ca0::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "October 2023 first version; May 2025 revision. Claims are study-specific.",
  "dated": true,
  "year": 2023
}

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

Stable Diffusion 3 research combined rectified-flow training with multimodal diffusion transformers and scaling experiments.

Do not attribute the paper to a founder absent from its author list or claim all generative image improvements transfer automatically to scientific discovery.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-211be938733923::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

Dota 2 with Large Scale Deep Reinforcement Learning

Large-scale self-play reinforcement learning, recurrent policies, distributed experience collection, and continual-training infrastructure. OpenAI Five defeated reigning world-champion team OG in the April 2019 Finals demonstration.

The Finals used a restricted pool of 17 heroes and a bot interface. Do not describe the result as unrestricted Dota 2 or as learning directly from rendered pixels.

Sources and details

Dota 2 with Large Scale Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "authors_in_source_order": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "dates": {
    "inspected_revision": "Fri, 13 Dec 2019 19:56:40 UTC (8,625 KB)",
    "original_submission": "2019/12/13",
    "retrieved_utc": "2026-10-07T18:20:40.482612+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-24afd1e1aebecb::S1",
  "title": "Dota 2 with Large Scale Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1912.06680",
  "version_url": "https://arxiv.org/abs/1912.06680v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Paper submitted December 2019; OG match occurred April 13, 2019.",
  "dated": true,
  "year": 2019
}

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

Introduced trainable mini-batch normalization of layer inputs and demonstrated faster, more robust training in studied networks.

Internal covariate shift is the authors' motivating explanation, not an established exclusive explanation of why batch normalization works.

Sources and details

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "authors_in_source_order": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "dates": {
    "inspected_revision": "Mon, 2 Mar 2015 20:44:12 UTC (30 KB)",
    "original_submission": "2015/02/11",
    "retrieved_utc": "2026-10-07T17:54:15.091043+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-2ea53a04d3d9f5::S1",
  "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift",
  "url": "https://arxiv.org/abs/1502.03167",
  "version_url": "https://arxiv.org/abs/1502.03167v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2015-02-11; Arxiv first submission year: 2015; Formal publication year: 2015; Formal venue: ICML; Formal source url: https://proceedings.mlr.press/v37/ioffe15.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2015
}

Voyager: An Open-Ended Embodied Agent with Large Language Models

GPT-4 proposes an automatic curriculum and executable code; feedback-driven revision and a growing skill library support continued exploration. Demonstrated better item discovery, travel, and technology-tree progress than the evaluated baseline agents, with reusable learned code skills.

Uses a programmatic Minecraft interface and pretrained language-model knowledge. It is not pixel-only play or proof of unrestricted Minecraft mastery; reported gains apply to its evaluation setup.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-30234dfd051130::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First submitted May 25, 2023.",
  "dated": true,
  "year": 2023
}

Proximal Policy Optimization Algorithms

Introduced proximal policy-optimization algorithms, notably a clipped surrogate objective allowing multiple minibatch updates while limiting overly large policy changes.

A 2017 arXiv report; no formal archival venue is asserted. Clipping is a practical control, not a universal monotonic-improvement guarantee.

Sources and details

Proximal Policy Optimization Algorithms

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "authors_in_source_order": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "dates": {
    "inspected_revision": "Mon, 28 Aug 2017 09:20:06 UTC (2,537 KB)",
    "original_submission": "2017/07/20",
    "retrieved_utc": "2026-10-07T18:01:46.972911+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-3beece2f2965b0::S1",
  "title": "Proximal Policy Optimization Algorithms",
  "url": "https://arxiv.org/abs/1707.06347",
  "version_url": "https://arxiv.org/abs/1707.06347v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2017-07-20; Arxiv first submission year: 2017; Formal publication status: not_asserted_in_this_pass; Publication verification: no_archival_venue_asserted",
  "dated": true,
  "year": 2017
}

Playing for Data: Ground Truth from Computer Games

Extracts graphics-pipeline associations from GTA V and propagates human semantic labels across rendered images without needing game source code. Produced roughly 25,000 densely labeled images and showed benefits when synthetic training data supplements real-world segmentation data.

The game supplies visual training data; the work does not train an agent to play GTA V. Synthetic-to-real performance and data-use restrictions require separate consideration.

Sources and details

Playing for Data: Ground Truth from Computer Games

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Sun, 7 Aug 2016 08:20:14 UTC (3,337 KB)",
    "original_submission": "2016/08/07",
    "retrieved_utc": "2026-10-07T18:10:43.726341+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-3d392d6b7a3e06::S1",
  "title": "Playing for Data: Ground Truth from Computer Games",
  "url": "https://arxiv.org/abs/1608.02192",
  "version_url": "https://arxiv.org/abs/1608.02192v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Research publication 2016, distinct from game release.",
  "dated": true,
  "year": 2016
}

Asynchronous Methods for Deep Reinforcement Learning

Developed asynchronous deep reinforcement-learning methods, including an advantage actor-critic variant using parallel actor-learners.

A3C is one method in the paper; asynchrony itself and actor-critic learning have earlier origins.

Sources and details

Asynchronous Methods for Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "dates": {
    "inspected_revision": "Thu, 16 Jun 2016 16:38:45 UTC (1,883 KB)",
    "original_submission": "2016/02/04",
    "retrieved_utc": "2026-10-07T18:01:46.792015+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-4ac33c3cfbcd28::S1",
  "title": "Asynchronous Methods for Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1602.01783",
  "version_url": "https://arxiv.org/abs/1602.01783v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2016-02-04; Arxiv first submission year: 2016; Formal publication year: 2016; Formal venue: ICML; Formal source url: https://proceedings.mlr.press/v48/mniha16.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2016
}

Playing Atari with Deep Reinforcement Learning

Combined convolutional function approximation, Q-learning, and experience replay to learn Atari policies from pixels and rewards.

This is the seven-author 2013 Playing Atari paper. The expanded 2015 Nature paper is a distinct work with a different title and author roster.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-4f797b8eeb7a62::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2013-12-19; Arxiv first submission year: 2013; Formal publication year: 2013; Formal venue: NeurIPS (then NIPS) Deep Learning Workshop; Venue evidence note: NIPS Deep Learning Workshop 2013; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2013
}

Deep contextualized word representations

Introduced deep contextual word representations derived from a bidirectional language model and demonstrated improvements across NLP tasks.

arXiv submission was in 2018; the arXiv record also reports an earlier OpenReview posting on 2017-10-27. Do not equate arXiv date with first public disclosure.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-5221b1b9b67a84::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2018-02-15; Arxiv first submission year: 2018; Formal publication year: 2018; Formal venue: NAACL-HLT; Formal source url: https://aclanthology.org/N18-1202/; Venue evidence note: NAACL 2018. Originally posted to openreview 27 Oct 2017. v2 updated for NAACL camera ready; Formal publication status: identified; Earlier public posting date reported by authors: 2017-10-27; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2018
}

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

SDXL extended text-to-image latent diffusion using a larger network, conditioning changes and optional refinement.

Image-quality and preference evaluations are not scientific-validation benchmarks; Stable Diffusion version, model weights and license terms remain separate fields.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-5f80ecf759958e::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "2023",
  "dated": true,
  "year": 2023
}

Densely Connected Convolutional Networks

Introduced dense feedforward connectivity that concatenates features from preceding layers, encouraging feature reuse and efficient deep-network training.

2016 preprint; 2017 conference. Dense concatenation differs from ResNet's additive residual connection.

Sources and details

Densely Connected Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "authors_in_source_order": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "dates": {
    "inspected_revision": "Sun, 28 Jan 2018 17:12:02 UTC (5,266 KB)",
    "original_submission": "2016/08/25",
    "retrieved_utc": "2026-10-07T18:10:44.374587+00:00",
    "version": "arXiv v5"
  },
  "id": "work-coverage-6a5ebb61b91d5d::S1",
  "title": "Densely Connected Convolutional Networks",
  "url": "https://arxiv.org/abs/1608.06993",
  "version_url": "https://arxiv.org/abs/1608.06993v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2016-08-25; Arxiv first submission year: 2016; Formal publication year: 2017; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content_cvpr_2017/html/Huang_Densely_Connected_Convolutional_CVPR_2017_paper.html; Venue evidence note: CVPR 2017; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2017
}

Very Deep Convolutional Networks for Large-Scale Image Recognition

Demonstrated the benefits of substantially increased convolutional-network depth using repeated small 3-by-3 filters for image recognition.

2014 preprint; 2015 conference. Do not attribute all deep convolutional networks or small filters to this paper.

Sources and details

Very Deep Convolutional Networks for Large-Scale Image Recognition

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Simonyan, Karen",
    "Zisserman, Andrew"
  ],
  "authors_in_source_order": [
    "Simonyan, Karen",
    "Zisserman, Andrew"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 Apr 2015 16:25:04 UTC (47 KB)",
    "original_submission": "2014/09/04",
    "retrieved_utc": "2026-10-07T18:18:45.027757+00:00",
    "version": "arXiv v6"
  },
  "id": "work-coverage-6fb6b945033f95::S1",
  "title": "Very Deep Convolutional Networks for Large-Scale Image Recognition",
  "url": "https://arxiv.org/abs/1409.1556",
  "version_url": "https://arxiv.org/abs/1409.1556v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2014-09-04; Arxiv first submission year: 2014; Formal publication year: 2015; Formal venue: ICLR; Formal publication status: identified; Publication verification: standard_bibliographic_venue_mapping; formal_primary_record_not_reopened_in_this_pass",
  "dated": true,
  "year": 2015
}

Masked Autoencoders Are Scalable Vision Learners

Presented scalable masked autoencoders for vision, using an asymmetric encoder-decoder and reconstructing many masked image patches.

2021 preprint; 2022 conference. Builds on existing autoencoding and masked-prediction ideas.

Sources and details

Masked Autoencoders Are Scalable Vision Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "dates": {
    "inspected_revision": "Sun, 19 Dec 2021 19:23:25 UTC (6,841 KB)",
    "original_submission": "2021/11/11",
    "retrieved_utc": "2026-10-07T18:13:06.994781+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-76cb73d59ae011::S1",
  "title": "Masked Autoencoders Are Scalable Vision Learners",
  "url": "https://arxiv.org/abs/2111.06377",
  "version_url": "https://arxiv.org/abs/2111.06377v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2021-11-11; Arxiv first submission year: 2021; Formal publication year: 2022; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content/CVPR2022/html/He_Masked_Autoencoders_Are_Scalable_Vision_Learners_CVPR_2022_paper.html; Venue evidence note: Tech report. arXiv v2: add more transfer learning results; v3: add robustness evaluation; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2022
}

A Style-Based Generator Architecture for Generative Adversarial Networks

Introduced a style-based GAN generator with an intermediate latent space and layerwise control over synthesis, separating aspects of high-level attributes and stochastic detail.

2018 preprint; 2019 conference. Distinguish this original StyleGAN from later StyleGAN2 and StyleGAN3.

Sources and details

A Style-Based Generator Architecture for Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Karras, Tero",
    "Laine, Samuli",
    "Aila, Timo"
  ],
  "authors_in_source_order": [
    "Karras, Tero",
    "Laine, Samuli",
    "Aila, Timo"
  ],
  "dates": {
    "inspected_revision": "Fri, 29 Mar 2019 11:08:46 UTC (22,071 KB)",
    "original_submission": "2018/12/12",
    "retrieved_utc": "2026-10-07T18:12:34.599143+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-8569c3efc4431a::S1",
  "title": "A Style-Based Generator Architecture for Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1812.04948",
  "version_url": "https://arxiv.org/abs/1812.04948v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2018-12-12; Arxiv first submission year: 2018; Formal publication year: 2019; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content_CVPR_2019/html/Karras_A_Style-Based_Generator_Architecture_for_Generative_Adversarial_Networks_CVPR_2019_paper.html; Venue evidence note: CVPR 2019 final version; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2019
}

Fourier Neural Operator for Parametric Partial Differential Equations

FNO parameterizes integral kernels in Fourier space to learn mappings between functions across families of PDE instances.

Reported acceleration excludes or amortizes training and depends on the tested distribution; not an exact universal PDE solver.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-a182e7f3a70ed3::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "arXiv 2020; ICLR 2021; cited arXiv v3 May 2021.",
  "dated": true,
  "year": 2020
}

U-Net: Convolutional Networks for Biomedical Image Segmentation

Introduced U-Net's contracting and expanding paths with cross-path feature connections and strong augmentation for biomedical segmentation with limited labeled images.

Credit all three authors; the paper did not establish the first encoder-decoder or every later use of U-shaped architectures.

Sources and details

U-Net: Convolutional Networks for Biomedical Image Segmentation

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "authors_in_source_order": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "dates": {
    "inspected_revision": "Mon, 18 May 2015 11:28:37 UTC (1,385 KB)",
    "original_submission": "2015/05/18",
    "retrieved_utc": "2026-10-07T18:10:43.280332+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-b24a98471b8486::S1",
  "title": "U-Net: Convolutional Networks for Biomedical Image Segmentation",
  "url": "https://arxiv.org/abs/1505.04597",
  "version_url": "https://arxiv.org/abs/1505.04597v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2015-05-18; Arxiv first submission year: 2015; Formal publication year: 2015; Formal venue: MICCAI; Formal source url: https://lmbweb.informatik.uni-freiburg.de/Publications/2015/RFB15a/; Venue evidence note: conditionally accepted at MICCAI 2015; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2015
}

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

Introduced a region-proposal network sharing convolutional features with a detection network, reducing the proposal-stage bottleneck.

A two-stage detector; do not conflate it with R-CNN, Fast R-CNN, or later Mask R-CNN.

Sources and details

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Wed, 6 Jan 2016 06:30:17 UTC (6,102 KB)",
    "original_submission": "2015/06/04",
    "retrieved_utc": "2026-10-07T18:18:25.167875+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-b3400c39d6b38e::S1",
  "title": "Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks",
  "url": "https://arxiv.org/abs/1506.01497",
  "version_url": "https://arxiv.org/abs/1506.01497v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2015-06-04; Arxiv first submission year: 2015; Formal publication year: 2015; Formal venue: NeurIPS (then NIPS); Formal source url: https://papers.nips.cc/paper/2015/hash/14bfa6bb14875e45bba028a21ed38046-Abstract.html; Venue evidence note: Extended tech report; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2015
}

Computing Power and the Governance of Artificial Intelligence

Explains why compute’s detectability, excludability, quantifiability and concentrated supply chain can enable governance interventions.

Policy proposals differ in readiness and entail privacy, economic and centralization risks. Do not attribute an unidentified report to FHI. Actual multi-author report replaces unverifiable Oxford/FHI shorthand.

Sources and details

Computing Power and the Governance of Artificial Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "authors_in_source_order": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "dates": {
    "inspected_revision": "Tue, 13 Feb 2024 21:10:21 UTC (7,180 KB)",
    "original_submission": "2024/02/13",
    "retrieved_utc": "2026-10-07T18:12:35.304951+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-b582bcfc753f00::S1",
  "title": "Computing Power and the Governance of Artificial Intelligence",
  "url": "https://arxiv.org/abs/2402.08797",
  "version_url": "https://arxiv.org/abs/2402.08797v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-02-13"
}

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

Developed architectural guidelines for deep convolutional GANs and demonstrated useful learned visual representations and image generation.

2015 preprint; 2016 conference. Do not conflate this architecture with the original GAN framework.

Sources and details

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "dates": {
    "inspected_revision": "Thu, 7 Jan 2016 23:09:39 UTC (9,028 KB)",
    "original_submission": "2015/11/19",
    "retrieved_utc": "2026-10-07T18:01:46.682703+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-bfb317f4db7282::S1",
  "title": "Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1511.06434",
  "version_url": "https://arxiv.org/abs/1511.06434v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2015-11-19; Arxiv first submission year: 2015; Formal publication year: 2016; Formal venue: ICLR; Venue evidence note: Under review as a conference paper at ICLR 2016; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2016
}

Sustainable AI: Environmental Implications, Challenges and Opportunities

Analyzes AI’s operational and manufacturing carbon footprints across data, algorithms and hardware lifecycles.

Correct author is Wu et al., not Patterson. Industrial case studies do not establish a uniform embodied-carbon share for all AI. Corrects title and attribution rather than inventing the requested shorthand.

Sources and details

Sustainable AI: Environmental Implications, Challenges and Opportunities

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "authors_in_source_order": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "dates": {
    "inspected_revision": "Sun, 9 Jan 2022 19:03:39 UTC (1,089 KB)",
    "original_submission": "2021/10/30",
    "retrieved_utc": "2026-10-07T18:13:06.635699+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-c0ff90c29bb833::S1",
  "title": "Sustainable AI: Environmental Implications, Challenges and Opportunities",
  "url": "https://arxiv.org/abs/2111.00364",
  "version_url": "https://arxiv.org/abs/2111.00364v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021 preprint; 2022 MLSys"
}

Semi-Supervised Classification with Graph Convolutional Networks

Presented a scalable graph-convolutional approach to semi-supervised node classification using a localized approximation of spectral graph convolutions.

2016 preprint; 2017 conference. It did not invent graph neural networks or all graph convolutions.

Sources and details

Semi-Supervised Classification with Graph Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Kipf, Thomas N.",
    "Welling, Max"
  ],
  "authors_in_source_order": [
    "Kipf, Thomas N.",
    "Welling, Max"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Feb 2017 09:55:36 UTC (858 KB)",
    "original_submission": "2016/09/09",
    "retrieved_utc": "2026-10-07T18:18:25.411843+00:00",
    "version": "arXiv v4"
  },
  "id": "work-coverage-c2212a5fa1e71e::S1",
  "title": "Semi-Supervised Classification with Graph Convolutional Networks",
  "url": "https://arxiv.org/abs/1609.02907",
  "version_url": "https://arxiv.org/abs/1609.02907v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2016-09-09; Arxiv first submission year: 2016; Formal publication year: 2017; Formal venue: ICLR; Venue evidence note: Published as a conference paper at ICLR 2017; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2017
}

MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge

Combines Minecraft tasks with a large multimodal knowledge corpus; MineCLIP-style video-language learning supplies reward signals for language-specified goals. Released a broad task suite and demonstrated agents for selected open-ended tasks without hand-designed dense shaping rewards.

The thousands of available tasks describe benchmark coverage, not thousands of tasks mastered by one agent. Learned rewards and web data introduce dependence on external knowledge and reward-model quality.

Sources and details

MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Tue, 22 Nov 2022 07:59:47 UTC (9,526 KB)",
    "original_submission": "2022/06/17",
    "retrieved_utc": "2026-10-07T18:17:58.531726+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-c797fb91b934a5::S1",
  "title": "MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge",
  "url": "https://arxiv.org/abs/2206.08853",
  "version_url": "https://arxiv.org/abs/2206.08853v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First preprint June 2022; conference publication 2022.",
  "dated": true,
  "year": 2022
}

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

Presented efficient mobile vision networks built around depthwise-separable convolutions, with width and resolution controls for resource-accuracy trade-offs.

MobileNets popularized this efficient architecture; it did not invent depthwise-separable convolution. No archival conference venue is asserted here.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-ca80de877e82aa::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2017-04-17; Arxiv first submission year: 2017; Formal publication status: not_asserted_in_this_pass; Publication verification: no_archival_venue_asserted",
  "dated": true,
  "year": 2017
}

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

Demonstrated a general reinforcement-learning and tree-search approach achieving strong chess, shogi, and Go play through self-play from game rules.

The 2017 preprint has 13 authors. The expanded 2018 Science article has a different title and author roster and should be linked as a separate work.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-d4fa562617291a::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2017-12-05; Arxiv first submission year: 2017; Formal publication status: not_asserted_in_this_pass; Publication verification: no_archival_venue_asserted",
  "dated": true,
  "year": 2017
}

Going Deeper with Convolutions

Presented the Inception architecture and GoogLeNet, combining multiscale convolutional processing with computationally efficient dimensionality reduction.

2014 preprint; 2015 conference. Distinguish the original architecture from later Inception variants.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-d691adcbe1eb87::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2014-09-17; Arxiv first submission year: 2014; Formal publication year: 2015; Formal venue: CVPR; Formal source url: https://openaccess.thecvf.com/content_cvpr_2015/html/Szegedy_Going_Deeper_With_2015_CVPR_paper.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2015
}

Layer Normalization

Proposed per-example normalization across a layer's hidden units, with particular benefits for recurrent-network training.

Layer normalization is a widely used design choice, not a mandatory component of every Transformer or neural network. No archival conference venue is asserted here.

Sources and details

Layer Normalization

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "authors_in_source_order": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "dates": {
    "inspected_revision": "Thu, 21 Jul 2016 19:57:52 UTC (305 KB)",
    "original_submission": "2016/07/21",
    "retrieved_utc": "2026-10-07T17:55:05.807153+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-d79b8630b97ad2::S1",
  "title": "Layer Normalization",
  "url": "https://arxiv.org/abs/1607.06450",
  "version_url": "https://arxiv.org/abs/1607.06450v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2016-07-21; Arxiv first submission year: 2016; Formal publication status: not_asserted_in_this_pass; Publication verification: no_archival_venue_asserted",
  "dated": true,
  "year": 2016
}

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

Models direct cooling-water consumption and indirect electricity-related water use for AI workloads.

Water estimates depend on location, time, cooling system, electricity mix and model. A bottle-of-water analogy is a conditional scenario, not a universal per-query measurement.

Sources and details

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "authors_in_source_order": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "dates": {
    "inspected_revision": "Wed, 26 Mar 2025 07:06:26 UTC (208 KB)",
    "original_submission": "2023/04/06",
    "retrieved_utc": "2026-10-07T18:12:35.083340+00:00",
    "version": "arXiv v5"
  },
  "id": "work-coverage-deba944990963a::S1",
  "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models",
  "url": "https://arxiv.org/abs/2304.03271",
  "version_url": "https://arxiv.org/abs/2304.03271v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2023 preprint"
}

Playing for Benchmarks

Uses a photorealistic game world to build controlled visual-perception benchmarks with automatically obtainable ground truth. Provides complementary synthetic evaluations across visual-perception tasks.

Perception benchmark rather than gameplay AI; synthetic performance should not be equated with real-world driving capability. The official dataset page restricts data to research and education, prohibiting commercial use.

Sources and details

Playing for Benchmarks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Hayder, Zeeshan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Hayder, Zeeshan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Thu, 21 Sep 2017 13:44:47 UTC (3,130 KB)",
    "original_submission": "2017/09/21",
    "retrieved_utc": "2026-10-07T18:10:44.676156+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-df9dde7b5fb72e::S1",
  "title": "Playing for Benchmarks",
  "url": "https://arxiv.org/abs/1709.07322",
  "version_url": "https://arxiv.org/abs/1709.07322v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Published 2017; distinct follow-up to Playing for Data (2016).",
  "dated": true,
  "year": 2017
}

The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink

Argues that efficient models, specialized hardware, datacenters and cleaner electricity can constrain training emissions.

A conditional projection supported by selected historical examples; not proof that total AI emissions or inference emissions are already falling.

Sources and details

The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Patterson, David",
    "Gonzalez, Joseph",
    "Hölzle, Urs",
    "Le, Quoc",
    "Liang, Chen",
    "Munguia, Lluis-Miquel",
    "Rothchild, Daniel",
    "So, David",
    "Texier, Maud",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Patterson, David",
    "Gonzalez, Joseph",
    "Hölzle, Urs",
    "Le, Quoc",
    "Liang, Chen",
    "Munguia, Lluis-Miquel",
    "Rothchild, Daniel",
    "So, David",
    "Texier, Maud",
    "Dean, Jeff"
  ],
  "dates": {
    "inspected_revision": "Mon, 11 Apr 2022 14:30:27 UTC (511 KB)",
    "original_submission": "2022/04/11",
    "retrieved_utc": "2026-10-07T18:11:54.409362+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-e2e0af973fd1d6::S1",
  "title": "The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink",
  "url": "https://arxiv.org/abs/2204.05149",
  "version_url": "https://arxiv.org/abs/2204.05149v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2022"
}

Graph Attention Networks

Introduced graph attention networks that aggregate neighborhood features using learned attention coefficients.

2017 preprint; 2018 conference. Graph attention is a specific graph-neural-network architecture, not the origin of graph learning.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-ed8db0e86b75c3::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Arxiv first submission date: 2017-10-30; Arxiv first submission year: 2017; Formal publication year: 2018; Formal venue: ICLR; Venue evidence note: To appear at ICLR 2018. 12 pages, 2 figures; Formal publication status: identified; Publication verification: primary_arxiv_record_reports_venue",
  "dated": true,
  "year": 2018
}

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

MatterSim learns interatomic interactions from first-principles computations to accelerate simulations over broad composition and condition ranges.

Its advertised temperature/pressure span is an evaluated modeling range, not a guarantee for every material; force-field accuracy inherits reference-theory and data limitations.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-f901cd332e7363::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

The NetHack Learning Environment

Packages fast, procedurally generated NetHack runs and task variants for reinforcement learning; evaluates distributed RL and Random Network Distillation baselines. Introduced a demanding environment for long-horizon exploration, planning, skill acquisition, and generalization.

The baseline successes concern early stages. The paper does not claim a winning or ascension-capable general NetHack agent; distinguish benchmark introduction from later challenge results.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-fa4ea91987064d::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First preprint June 24, 2020.",
  "dated": true,
  "year": 2020
}

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

Showed that prompting sufficiently large language models with worked intermediate-step examples improves performance on several arithmetic, commonsense, and symbolic tasks.

Improved benchmark answers do not prove reliable reasoning, truthful explanations, or that generated steps faithfully reveal internal computation.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "work-de1f157f6691::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "First public version; see source for later revisions.",
  "dated": true,
  "year": 2022
}

Toolformer: Language Models Can Teach Themselves to Use Tools

Toolformer trains a language model to choose API calls and incorporate their results into token prediction.

The reported task improvements do not establish that all tool calls or returned information are correct.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "work-dfca934a0fb1::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "February 2023 preprint. Distinct method: self-supervised learning of API calls, not the ReAct prompting procedure.",
  "dated": true,
  "year": 2023
}

Building High-level Features Using Large Scale Unsupervised Learning

The project connected deep-learning research with Google-scale data and distributed computation. In the specifically bound research output, unsupervised feature learning used model/data parallelism to train a large sparse autoencoder on unlabeled images. Program founders, the experiment leader, and the complete paper author group are separate credit types.

Founding participants are supported, but this is not an exhaustive early employee roster or an attribution of all Google Brain research to three people. The project’s 2011 start is not the publication year of every cited output; v1 preprint and 2012 conference/version dates remain distinct. Google’s current author badge for Jeff Dean is not used as evidence of his exact 2012 job title. The source abstract metadata says 20,000 ImageNet categories while the inspected v5 PDF says 22,000; no category-count performance claim is imported here. Unsupervised feature learning in the cited experiment does not establish general intelligence or a complete biological-brain simulation. Later TensorFlow, Transformer, health or product results need their own work-level credits and are not swept into this binding.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "work-final-b9b8cfd87d3094::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2012
}

GenAI mirage: The impostor bias and the deepfake detection challenge in the era of artificial illusions

Reviews cognitive biases in forensic decision-making and introduces impostor bias: a prior tendency to suspect that genuine-looking media were AI-generated. It surveys deepfake detection methods, their generalization limits and possible safeguards for forensic assessment.

Source-scoped Journal article; conceptual and narrative review of cognitive biases and deepfake detection. Claims retain the source’s scope and study design; proposals, scenarios and observational associations are not established causal findings.

Sources and details

GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "authors_in_source_order": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "dates": {
    "inspected_revision": "Sun, 16 Jun 2024 09:28:40 UTC (35,818 KB)",
    "original_submission": "2023/12/24",
    "retrieved_utc": "2026-10-07T18:11:54.703854+00:00",
    "version": "arXiv v2"
  },
  "id": "work-focused-075b98c7e2028e::S1",
  "title": "GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions",
  "url": "https://arxiv.org/abs/2312.16220",
  "version_url": "https://arxiv.org/abs/2312.16220v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-06-19",
      "kind": "published_online",
      "year": 2024
    },
    {
      "date": "2024-09",
      "kind": "issue_date",
      "year": 2024
    },
    {
      "date": "2023-12-24",
      "kind": "arxiv_v1",
      "year": 2023
    },
    {
      "date": "2024-06-16",
      "kind": "arxiv_v2",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-06-19"
}

Taking AI Welfare Seriously

Argues that possible near-future AI welfare deserves preparation under uncertainty. Recommends acknowledging the issue, investigating consciousness and robust agency, and developing appropriate treatment policies. It explicitly avoids claiming that present or future systems definitely have moral status.

Source-scoped Research/policy report deposited as arXiv preprint. Consciousness claims and normative conclusions are attributed arguments; this work is not independent proof that an AI has subjective experience.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-7150297704f318::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-11-04",
      "kind": "first_submitted",
      "year": 2024
    },
    {
      "date": "2024-11-04",
      "kind": "version_1",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-11-04"
}

Measuring Massive Multitask Language Understanding

Introduces MMLU, an evaluation across 57 academic tasks.

Benchmark coverage and evaluation protocol bound the result; score is not a complete intelligence measure.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "work-focused-99721ea54425af::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2020-09-07"
}

On the Measure of Intelligence

Proposes intelligence as skill-acquisition efficiency under explicit priors and introduces the Abstraction and Reasoning Corpus benchmark.

A research proposal and bounded benchmark, not a universal AGI criterion. ARC benchmark is distinct from Alignment Research Center.

Sources and details

On the Measure of Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Chollet, François"
  ],
  "authors_in_source_order": [
    "Chollet, François"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Nov 2019 13:02:04 UTC (770 KB)",
    "original_submission": "2019/11/05",
    "retrieved_utc": "2026-10-07T17:54:15.214815+00:00",
    "version": "arXiv v2"
  },
  "id": "work-focused-99ca501c9d90f4::S1",
  "title": "On the Measure of Intelligence",
  "url": "https://arxiv.org/abs/1911.01547",
  "version_url": "https://arxiv.org/abs/1911.01547v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2019-11-05"
}

Why Is Anything Conscious?

Bennett, Welsh, and Ciaunica propose a mathematical and philosophical account beginning with embodied organisms that must adapt to survive. Their pancomputational-enactivist framework connects valence, causal learning, and hierarchical self-modeling. It distinguishes successive forms of self and argues that human-level access consciousness depends on phenomenal consciousness, rather than treating experience as an optional addition to function. The 2024 version discusses different adaptive stages and claims that conventional language models lack relevant incentives to construct selves. Its conclusion also acknowledges uncertainty about whether the proposed hierarchy supplies sufficient conditions for consciousness and calls for studies of biological and artificial systems. Global workspace theory and constructivist AI appear as neighboring approaches, not as the paper's title or central comparative experiment. This is a theoretical proposal, not an empirical demonstration that self-organizing AI becomes conscious.

Source-scoped Theoretical/mathematical preprint. Consciousness claims and normative conclusions are attributed arguments; this work is not independent proof that an AI has subjective experience.

Sources and details

Why Is Anything Conscious?

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "authors_in_source_order": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "dates": {
    "inspected_revision": "Thu, 5 Mar 2026 11:24:05 UTC (798 KB)",
    "original_submission": "2024/09/22",
    "retrieved_utc": "2026-10-07T18:11:55.077231+00:00",
    "version": "arXiv v6"
  },
  "id": "work-focused-c3d48d82b9f572::S1",
  "title": "Why Is Anything Conscious?",
  "url": "https://arxiv.org/abs/2409.14545",
  "version_url": "https://arxiv.org/abs/2409.14545v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-09-22",
      "kind": "publication",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-09-22"
}

A Case for AI Consciousness: Language Agents and Global Workspace Theory

Goldstein and Kirk-Giannini argue that, if global workspace theory is correct, suitably organized language agents could qualify as phenomenally conscious. They develop a functionalist methodology for deciding which workspace features matter and compare alternative formulations of attention, information selection, processing, and broadcast. Their analysis distinguishes a language model from an agent architecture that uses it alongside memory, goals, planning, and other modules. They identify shortcomings in a discussed existing architecture and propose changes to its surrounding organization. They also address objections about permissive functional criteria and suggest behavioral comparisons as a complementary research direction. The argument is conditional on theoretical and functionalist assumptions; it is not an experimental consciousness test. Importantly, its target is phenomenal consciousness, rather than merely claiming access consciousness while leaving phenomenal experience outside the argument.

Source-scoped Peer-reviewed philosophical journal article; earlier 2024 preprint. Consciousness claims and normative conclusions are attributed arguments; this work is not independent proof that an AI has subjective experience.

Sources and details

A Case for AI Consciousness: Language Agents and Global Workspace Theory

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "authors_in_source_order": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "dates": {
    "inspected_revision": "Tue, 15 Oct 2024 08:50:45 UTC (330 KB)",
    "original_submission": "2024/10/15",
    "retrieved_utc": "2026-10-07T18:13:07.124882+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-d36cf3ae136373::S1",
  "title": "A Case for AI Consciousness: Language Agents and Global Workspace Theory",
  "url": "https://arxiv.org/abs/2410.11407",
  "version_url": "https://arxiv.org/abs/2410.11407v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-01",
      "kind": "publication",
      "year": 2026
    },
    {
      "date": "2024-10-15",
      "kind": "earlier_preprint_publication",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-01"
}

François Chollet

Proposes a definition of intelligence as skill-acquisition efficiency and introduces the Abstraction and Reasoning Corpus benchmark.

Research proposal with explicit priors and limits. ARC benchmark is distinct from the Alignment Research Center organization.

Sources and details

On the Measure of Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Chollet, François"
  ],
  "authors_in_source_order": [
    "Chollet, François"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Nov 2019 13:02:04 UTC (770 KB)",
    "original_submission": "2019/11/05",
    "retrieved_utc": "2026-10-07T17:54:15.214815+00:00",
    "version": "arXiv v2"
  },
  "id": "ai-contribution-person-coverage-346c1b4d92bf78::S1",
  "title": "On the Measure of Intelligence",
  "url": "https://arxiv.org/abs/1911.01547",
  "version_url": "https://arxiv.org/abs/1911.01547v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dan Hendrycks

Collaborative coauthor of Measuring Massive Multitask Language Understanding, introducing a 57-task academic benchmark.

Seven-person byline retained separately; benchmark performance is not a complete measure of intelligence.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "ai-contribution-person-coverage-84f7271a2e1f0c::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Aaron Courville

Aaron Courville is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-aaroncourville::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Aditya Ramesh

Aditya Ramesh is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-adityaramesh::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ajay Jain

Ajay Jain is listed as an author of Denoising Diffusion Probabilistic Models.

Sources and details

Denoising Diffusion Probabilistic Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "dates": {
    "inspected_revision": "Wed, 16 Dec 2020 21:15:05 UTC (9,137 KB)",
    "original_submission": "2020/06/19",
    "retrieved_utc": "2026-10-07T17:55:07.151030+00:00",
    "version": "arXiv v2"
  },
  "id": "person-ajayjain::S1",
  "title": "Denoising Diffusion Probabilistic Models",
  "url": "https://arxiv.org/abs/2006.11239",
  "version_url": "https://arxiv.org/abs/2006.11239v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Alec Radford

Alec Radford is listed as an author of Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks.

Sources and details

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "dates": {
    "inspected_revision": "Thu, 7 Jan 2016 23:09:39 UTC (9,028 KB)",
    "original_submission": "2015/11/19",
    "retrieved_utc": "2026-10-07T18:01:46.682703+00:00",
    "version": "arXiv v2"
  },
  "id": "person-alecradford::S1",
  "title": "Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1511.06434",
  "version_url": "https://arxiv.org/abs/1511.06434v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Alex Graves

Alex Graves is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-alexgraves::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Amanda Askell

Amanda Askell is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-amandaaskell::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Bing Xu

Bing Xu is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-bingxu::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Chris Olah

Chris Olah is listed as an author of Concrete Problems in AI Safety.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "person-chrisolah::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Christian Szegedy

Christian Szegedy is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-christianszegedy::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sumith Kulal

Sumith Kulal is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-00c17bf7322ea3::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Gao Huang

Gao Huang is listed as an author of Densely Connected Convolutional Networks.

Sources and details

Densely Connected Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "authors_in_source_order": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "dates": {
    "inspected_revision": "Sun, 28 Jan 2018 17:12:02 UTC (5,266 KB)",
    "original_submission": "2016/08/25",
    "retrieved_utc": "2026-10-07T18:10:44.374587+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-00deabc3c2f53b::S1",
  "title": "Densely Connected Convolutional Networks",
  "url": "https://arxiv.org/abs/1608.06993",
  "version_url": "https://arxiv.org/abs/1608.06993v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Vibhav Vineet

Vibhav Vineet is listed as an author of Playing for Data: Ground Truth from Computer Games.

Sources and details

Playing for Data: Ground Truth from Computer Games

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Sun, 7 Aug 2016 08:20:14 UTC (3,337 KB)",
    "original_submission": "2016/08/07",
    "retrieved_utc": "2026-10-07T18:10:43.726341+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-0375959ace40f6::S1",
  "title": "Playing for Data: Ground Truth from Computer Games",
  "url": "https://arxiv.org/abs/1608.02192",
  "version_url": "https://arxiv.org/abs/1608.02192v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Joe Penna

Joe Penna is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-0499a0ad4b9839::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Philipp Fischer

Philipp Fischer is listed as an author of U-Net: Convolutional Networks for Biomedical Image Segmentation.

Sources and details

U-Net: Convolutional Networks for Biomedical Image Segmentation

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "authors_in_source_order": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "dates": {
    "inspected_revision": "Mon, 18 May 2015 11:28:37 UTC (1,385 KB)",
    "original_submission": "2015/05/18",
    "retrieved_utc": "2026-10-07T18:10:43.280332+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-06377763d4601b::S1",
  "title": "U-Net: Convolutional Networks for Biomedical Image Segmentation",
  "url": "https://arxiv.org/abs/1505.04597",
  "version_url": "https://arxiv.org/abs/1505.04597v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dawn Song

Dawn Song is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0b0bd6cc2eb3da::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kamyar Azizzadenesheli

Kamyar Azizzadenesheli is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0c06e3c75fb62b::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Stephan R. Richter

Stephan R. Richter is listed as an author of Playing for Data: Ground Truth from Computer Games.

Sources and details

Playing for Data: Ground Truth from Computer Games

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Sun, 7 Aug 2016 08:20:14 UTC (3,337 KB)",
    "original_submission": "2016/08/07",
    "retrieved_utc": "2026-10-07T18:10:43.726341+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-0c2b4f89a57603::S1",
  "title": "Playing for Data: Ground Truth from Computer Games",
  "url": "https://arxiv.org/abs/1608.02192",
  "version_url": "https://arxiv.org/abs/1608.02192v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Rafael Rafailov

Rafael Rafailov is listed as an author of Direct Preference Optimization: Your Language Model is Secretly a Reward Model.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "authors_in_source_order": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "dates": {
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "2023/05/29",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0d4093fdb40a86::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zongyi Li

Zongyi Li is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0efeb0a615dd18::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yichi Zhou

Yichi Zhou is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-0fcd52aa2fab1c::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Guanzhi Li

Guanzhi Li is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-135f74e7bfdfe3::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sean Welsh

Sean Welsh is listed as an author of Why Is Anything Conscious?.

Sources and details

Why Is Anything Conscious?

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "authors_in_source_order": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "dates": {
    "inspected_revision": "Thu, 5 Mar 2026 11:24:05 UTC (798 KB)",
    "original_submission": "2024/09/22",
    "retrieved_utc": "2026-10-07T18:11:55.077231+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-139a7569b1ab35::S1",
  "title": "Why Is Anything Conscious?",
  "url": "https://arxiv.org/abs/2409.14545",
  "version_url": "https://arxiv.org/abs/2409.14545v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yelong Shen

Yelong Shen is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-145a0190cba542::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pierre Sermanet

Pierre Sermanet is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-166201dddab42c::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Luca Guarnera

Luca Guarnera is listed as an author of GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions.

Sources and details

GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "authors_in_source_order": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "dates": {
    "inspected_revision": "Sun, 16 Jun 2024 09:28:40 UTC (35,818 KB)",
    "original_submission": "2023/12/24",
    "retrieved_utc": "2026-10-07T18:11:54.703854+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-168de905ae9486::S1",
  "title": "GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions",
  "url": "https://arxiv.org/abs/2312.16220",
  "version_url": "https://arxiv.org/abs/2312.16220v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Urs Hölzle

Urs Hölzle is listed as an author of The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink.

Sources and details

The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Patterson, David",
    "Gonzalez, Joseph",
    "Hölzle, Urs",
    "Le, Quoc",
    "Liang, Chen",
    "Munguia, Lluis-Miquel",
    "Rothchild, Daniel",
    "So, David",
    "Texier, Maud",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Patterson, David",
    "Gonzalez, Joseph",
    "Hölzle, Urs",
    "Le, Quoc",
    "Liang, Chen",
    "Munguia, Lluis-Miquel",
    "Rothchild, Daniel",
    "So, David",
    "Texier, Maud",
    "Dean, Jeff"
  ],
  "dates": {
    "inspected_revision": "Mon, 11 Apr 2022 14:30:27 UTC (511 KB)",
    "original_submission": "2022/04/11",
    "retrieved_utc": "2026-10-07T18:11:54.409362+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-1837945c5505ac::S1",
  "title": "The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink",
  "url": "https://arxiv.org/abs/2204.05149",
  "version_url": "https://arxiv.org/abs/2204.05149v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Petar Veličković

Petar Veličković is listed as an author of Graph Attention Networks.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-19541d2532598f::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Marco Andreetto

Marco Andreetto is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-197a508d3464d3::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Anna Ciaunica

Anna Ciaunica is listed as an author of Why Is Anything Conscious?.

Sources and details

Why Is Anything Conscious?

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "authors_in_source_order": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "dates": {
    "inspected_revision": "Thu, 5 Mar 2026 11:24:05 UTC (798 KB)",
    "original_submission": "2024/09/22",
    "retrieved_utc": "2026-10-07T18:11:55.077231+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-1aaa80270fc7fc::S1",
  "title": "Why Is Anything Conscious?",
  "url": "https://arxiv.org/abs/2409.14545",
  "version_url": "https://arxiv.org/abs/2409.14545v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Marco Selvatici

Marco Selvatici is listed as an author of The NetHack Learning Environment.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1d37b1a8cfddf0::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jacob Pfau

Jacob Pfau is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-1fcd37828f4b4e::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yuanzhi Li

Yuanzhi Li is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1fe71eaf1a9158::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kathleen Finlinson

Kathleen Finlinson is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-22b4b25128a3ec::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Guanzhi Wang

Guanzhi Wang is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2346351d0a20a6::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Haydn Belfield

Haydn Belfield is listed as an author of Computing Power and the Governance of Artificial Intelligence.

Sources and details

Computing Power and the Governance of Artificial Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "authors_in_source_order": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "dates": {
    "inspected_revision": "Tue, 13 Feb 2024 21:10:21 UTC (7,180 KB)",
    "original_submission": "2024/02/13",
    "retrieved_utc": "2026-10-07T18:12:35.304951+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-25d428a122f6f2::S1",
  "title": "Computing Power and the Governance of Artificial Intelligence",
  "url": "https://arxiv.org/abs/2402.08797",
  "version_url": "https://arxiv.org/abs/2402.08797v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mark Neumann

Mark Neumann is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2ad531ac890200::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tim Dockhorn

Tim Dockhorn is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-30f5d68085bdbe::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jianyi Yang

Jianyi Yang is listed as an author of Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models.

Sources and details

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "authors_in_source_order": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "dates": {
    "inspected_revision": "Wed, 26 Mar 2025 07:06:26 UTC (208 KB)",
    "original_submission": "2023/04/06",
    "retrieved_utc": "2026-10-07T18:12:35.083340+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-3130f334ecea0a::S1",
  "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models",
  "url": "https://arxiv.org/abs/2304.03271",
  "version_url": "https://arxiv.org/abs/2304.03271v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Matthieu Devin

Matthieu Devin is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-338877605cef88::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

François Chollet

François Chollet is listed as an author of On the Measure of Intelligence.

Sources and details

On the Measure of Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Chollet, François"
  ],
  "authors_in_source_order": [
    "Chollet, François"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Nov 2019 13:02:04 UTC (770 KB)",
    "original_submission": "2019/11/05",
    "retrieved_utc": "2026-10-07T17:54:15.214815+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-346c1b4d92bf78::S1",
  "title": "On the Measure of Intelligence",
  "url": "https://arxiv.org/abs/1911.01547",
  "version_url": "https://arxiv.org/abs/1911.01547v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ramya Raghavendra

Ramya Raghavendra is listed as an author of Sustainable AI: Environmental Implications, Challenges and Opportunities.

Sources and details

Sustainable AI: Environmental Implications, Challenges and Opportunities

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "authors_in_source_order": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "dates": {
    "inspected_revision": "Sun, 9 Jan 2022 19:03:39 UTC (1,089 KB)",
    "original_submission": "2021/10/30",
    "retrieved_utc": "2026-10-07T18:13:06.635699+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-351d801a68ecf7::S1",
  "title": "Sustainable AI: Environmental Implications, Challenges and Opportunities",
  "url": "https://arxiv.org/abs/2111.00364",
  "version_url": "https://arxiv.org/abs/2111.00364v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yanghao Li

Yanghao Li is listed as an author of Masked Autoencoders Are Scalable Vision Learners.

Sources and details

Masked Autoencoders Are Scalable Vision Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "dates": {
    "inspected_revision": "Sun, 19 Dec 2021 19:23:25 UTC (6,841 KB)",
    "original_submission": "2021/11/11",
    "retrieved_utc": "2026-10-07T18:13:06.994781+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-3544dabecb50b5::S1",
  "title": "Masked Autoencoders Are Scalable Vision Learners",
  "url": "https://arxiv.org/abs/2111.06377",
  "version_url": "https://arxiv.org/abs/2111.06377v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Cameron Domenico Kirk-Giannini

Cameron Domenico Kirk-Giannini is listed as an author of A Case for AI Consciousness: Language Agents and Global Workspace Theory.

Sources and details

A Case for AI Consciousness: Language Agents and Global Workspace Theory

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "authors_in_source_order": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "dates": {
    "inspected_revision": "Tue, 15 Oct 2024 08:50:45 UTC (330 KB)",
    "original_submission": "2024/10/15",
    "retrieved_utc": "2026-10-07T18:13:07.124882+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-373ab576500698::S1",
  "title": "A Case for AI Consciousness: Language Agents and Global Workspace Theory",
  "url": "https://arxiv.org/abs/2410.11407",
  "version_url": "https://arxiv.org/abs/2410.11407v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Chaowei Xiao

Chaowei Xiao is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-38c864e237b018::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andrew G. Howard

Andrew G. Howard is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-38dd993dabbf72::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jamie Ryan Kiros

Jamie Ryan Kiros is listed as an author of Layer Normalization.

Sources and details

Layer Normalization

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "authors_in_source_order": [
    "Ba, Jimmy Lei",
    "Kiros, Jamie Ryan",
    "Hinton, Geoffrey E."
  ],
  "dates": {
    "inspected_revision": "Thu, 21 Jul 2016 19:57:52 UTC (305 KB)",
    "original_submission": "2016/07/21",
    "retrieved_utc": "2026-10-07T17:55:05.807153+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-3ad638583fd12b::S1",
  "title": "Layer Normalization",
  "url": "https://arxiv.org/abs/1607.06450",
  "version_url": "https://arxiv.org/abs/1607.06450v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Guillem Cucurull

Guillem Cucurull is listed as an author of Graph Attention Networks.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-3cfc38f67d3cd0::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Joseph Redmon

Joseph Redmon is listed as an author of You Only Look Once: Unified, Real-Time Object Detection.

Sources and details

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "authors_in_source_order": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "dates": {
    "inspected_revision": "Mon, 9 May 2016 22:22:11 UTC (14,934 KB)",
    "original_submission": "2015/06/08",
    "retrieved_utc": "2026-10-07T17:55:05.587810+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-434783ffb7a844::S1",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/abs/1506.02640",
  "version_url": "https://arxiv.org/abs/1506.02640v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Lennart Heim

Lennart Heim is listed as an author of Computing Power and the Governance of Artificial Intelligence.

Sources and details

Computing Power and the Governance of Artificial Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "authors_in_source_order": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "dates": {
    "inspected_revision": "Tue, 13 Feb 2024 21:10:21 UTC (7,180 KB)",
    "original_submission": "2024/02/13",
    "retrieved_utc": "2026-10-07T18:12:35.304951+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-49e9ddd92f3d5c::S1",
  "title": "Computing Power and the Governance of Artificial Intelligence",
  "url": "https://arxiv.org/abs/2402.08797",
  "version_url": "https://arxiv.org/abs/2402.08797v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Marc’Aurelio Ranzato

Marc’Aurelio Ranzato is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-4e956e988cacd9::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Frederic Boesel

Frederic Boesel is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-5744bf8a7cb48b::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pengfei Li

Pengfei Li is listed as an author of Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models.

Sources and details

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "authors_in_source_order": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "dates": {
    "inspected_revision": "Wed, 26 Mar 2025 07:06:26 UTC (208 KB)",
    "original_submission": "2023/04/06",
    "retrieved_utc": "2026-10-07T18:12:35.083340+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-5939fdaae9abe6::S1",
  "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models",
  "url": "https://arxiv.org/abs/2304.03271",
  "version_url": "https://arxiv.org/abs/2304.03271v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dharshan Kumaran

Dharshan Kumaran is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-5d98a7dc10b56d::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Archit Sharma

Archit Sharma is listed as an author of Direct Preference Optimization: Your Language Model is Secretly a Reward Model.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "authors_in_source_order": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "dates": {
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "2023/05/29",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-5dce785d28d782::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Benjamin Mann

Benjamin Mann is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-benjaminmann::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Claudio Zeni

Claudio Zeni is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-16a13420087fef::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jake Smith

Jake Smith is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-18a4e54233e523::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yu Shi

Yu Shi is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-199d4de8635157::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Xixian Liu

Xixian Liu is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-23eb03dbd83acb::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Collin Burns

Collin Burns is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2808287bbea94e::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kyle Fish

Kyle Fish is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-288e6ba19b9338::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dragomir Anguelov

Dragomir Anguelov is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-3046d4735fd468::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yangqing Jia

Yangqing Jia is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-348f0afdb106c6::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Shean Wang

Shean Wang is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-38552b9c761666::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Lu Wang

Lu Wang is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3e68c4f2fca6b9::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zeyuan Allen-Zhu

Zeyuan Allen-Zhu is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3ec514f46ddc7a::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dumitru Erhan

Dumitru Erhan is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-3f73b84b644437::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Vincent Vanhoucke

Vincent Vanhoucke is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-40e797fa9b1c02::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Stefan Roth

Stefan Roth is listed as an author of Playing for Data: Ground Truth from Computer Games.

Sources and details

Playing for Data: Ground Truth from Computer Games

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Sun, 7 Aug 2016 08:20:14 UTC (3,337 KB)",
    "original_submission": "2016/08/07",
    "retrieved_utc": "2026-10-07T18:10:43.726341+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-41a6152bb48cfd::S1",
  "title": "Playing for Data: Ground Truth from Computer Games",
  "url": "https://arxiv.org/abs/1608.02192",
  "version_url": "https://arxiv.org/abs/1608.02192v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tobias Weyand

Tobias Weyand is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-44edc08f1e2b3e::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kaushik Bhattacharya

Kaushik Bhattacharya is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-4652cd0ccbac0e::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Arantxa Casanova

Arantxa Casanova is listed as an author of Graph Attention Networks.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-4ed5c0fbcd7f48::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dmitry Kalenichenko

Dmitry Kalenichenko is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-56de69d2dccfd0::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zion English

Zion English is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-5bb00fae9a7e65::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yuke Zhu

Yuke Zhu is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-606754399d1397::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Markus Anderljung

Markus Anderljung is listed as an author of Computing Power and the Governance of Artificial Intelligence.

Sources and details

Computing Power and the Governance of Artificial Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "authors_in_source_order": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "dates": {
    "inspected_revision": "Tue, 13 Feb 2024 21:10:21 UTC (7,180 KB)",
    "original_submission": "2024/02/13",
    "retrieved_utc": "2026-10-07T18:12:35.304951+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-60f804fd594122::S1",
  "title": "Computing Power and the Governance of Artificial Intelligence",
  "url": "https://arxiv.org/abs/2402.08797",
  "version_url": "https://arxiv.org/abs/2402.08797v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yunfan Jiang

Yunfan Jiang is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-63c47ea1075bf2::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Toni Sims

Toni Sims is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-6673ff826c8f5b::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Luke Metz

Luke Metz is listed as an author of Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks.

Sources and details

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "dates": {
    "inspected_revision": "Thu, 7 Jan 2016 23:09:39 UTC (9,028 KB)",
    "original_submission": "2015/11/19",
    "retrieved_utc": "2026-10-07T18:01:46.682703+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-66fef6ea18f4af::S1",
  "title": "Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1511.06434",
  "version_url": "https://arxiv.org/abs/1511.06434v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Piotr Dollár

Piotr Dollár is listed as an author of Masked Autoencoders Are Scalable Vision Learners.

Sources and details

Masked Autoencoders Are Scalable Vision Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "dates": {
    "inspected_revision": "Sun, 19 Dec 2021 19:23:25 UTC (6,841 KB)",
    "original_submission": "2021/11/11",
    "retrieved_utc": "2026-10-07T18:13:06.994781+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-67b910f4944e12::S1",
  "title": "Masked Autoencoders Are Scalable Vision Learners",
  "url": "https://arxiv.org/abs/2111.06377",
  "version_url": "https://arxiv.org/abs/2111.06377v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zeeshan Hayder

Zeeshan Hayder is listed as an author of Playing for Benchmarks.

Sources and details

Playing for Benchmarks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Hayder, Zeeshan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Hayder, Zeeshan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Thu, 21 Sep 2017 13:44:47 UTC (3,130 KB)",
    "original_submission": "2017/09/21",
    "retrieved_utc": "2026-10-07T18:10:44.676156+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-70481f7bd30c37::S1",
  "title": "Playing for Benchmarks",
  "url": "https://arxiv.org/abs/1709.07322",
  "version_url": "https://arxiv.org/abs/1709.07322v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ajay Mandlekar

Ajay Mandlekar is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-708209294762e5::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Laurens van der Maaten

Laurens van der Maaten is listed as an author of Densely Connected Convolutional Networks.

Sources and details

Densely Connected Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "authors_in_source_order": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "dates": {
    "inspected_revision": "Sun, 28 Jan 2018 17:12:02 UTC (5,266 KB)",
    "original_submission": "2016/08/25",
    "retrieved_utc": "2026-10-07T18:10:44.374587+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-714193674672fe::S1",
  "title": "Densely Connected Convolutional Networks",
  "url": "https://arxiv.org/abs/1608.06993",
  "version_url": "https://arxiv.org/abs/1608.06993v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Santosh Divvala

Santosh Divvala is listed as an author of You Only Look Once: Unified, Real-Time Object Detection.

Sources and details

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "authors_in_source_order": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "dates": {
    "inspected_revision": "Mon, 9 May 2016 22:22:11 UTC (14,934 KB)",
    "original_submission": "2015/06/08",
    "retrieved_utc": "2026-10-07T17:55:05.587810+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-71e58ecf6a5200::S1",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/abs/1506.02640",
  "version_url": "https://arxiv.org/abs/1506.02640v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Eric Mitchell

Eric Mitchell is listed as an author of Direct Preference Optimization: Your Language Model is Secretly a Reward Model.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "authors_in_source_order": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "dates": {
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "2023/05/29",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-73718acb47fca2::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Adrià Puigdomènech Badia

Adrià Puigdomènech Badia is listed as an author of Asynchronous Methods for Deep Reinforcement Learning.

Sources and details

Asynchronous Methods for Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "dates": {
    "inspected_revision": "Thu, 16 Jun 2016 16:38:45 UTC (1,883 KB)",
    "original_submission": "2016/02/04",
    "retrieved_utc": "2026-10-07T18:01:46.792015+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7720bc3bf2148a::S1",
  "title": "Asynchronous Methods for Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1602.01783",
  "version_url": "https://arxiv.org/abs/1602.01783v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yam Levi

Yam Levi is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-7d9706f360ba84::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Xinlei Chen

Xinlei Chen is listed as an author of Masked Autoencoders Are Scalable Vision Learners.

Sources and details

Masked Autoencoders Are Scalable Vision Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "authors_in_source_order": [
    "He, Kaiming",
    "Chen, Xinlei",
    "Xie, Saining",
    "Li, Yanghao",
    "Dollár, Piotr",
    "Girshick, Ross"
  ],
  "dates": {
    "inspected_revision": "Sun, 19 Dec 2021 19:23:25 UTC (6,841 KB)",
    "original_submission": "2021/11/11",
    "retrieved_utc": "2026-10-07T18:13:06.994781+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-8115baf62b0220::S1",
  "title": "Masked Autoencoders Are Scalable Vision Learners",
  "url": "https://arxiv.org/abs/2111.06377",
  "version_url": "https://arxiv.org/abs/2111.06377v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dan Hendrycks

Dan Hendrycks is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-84f7271a2e1f0c::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Nantas Nardelli

Nantas Nardelli is listed as an author of The NetHack Learning Environment.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-864bacef666515::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Matt Gardner

Matt Gardner is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-86f8584c22c565::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Miles Brundage

Miles Brundage is listed as an author of Computing Power and the Governance of Artificial Intelligence.

Sources and details

Computing Power and the Governance of Artificial Intelligence

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "authors_in_source_order": [
    "Sastry, Girish",
    "Heim, Lennart",
    "Belfield, Haydn",
    "Anderljung, Markus",
    "Brundage, Miles",
    "Hazell, Julian",
    "O'Keefe, Cullen",
    "Hadfield, Gillian K.",
    "Ngo, Richard",
    "Pilz, Konstantin",
    "Gor, George",
    "Bluemke, Emma",
    "Shoker, Sarah",
    "Egan, Janet",
    "Trager, Robert F.",
    "Avin, Shahar",
    "Weller, Adrian",
    "Bengio, Yoshua",
    "Coyle, Diane"
  ],
  "dates": {
    "inspected_revision": "Tue, 13 Feb 2024 21:10:21 UTC (7,180 KB)",
    "original_submission": "2024/02/13",
    "retrieved_utc": "2026-10-07T18:12:35.304951+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-88840f05280f06::S1",
  "title": "Computing Power and the Governance of Artificial Intelligence",
  "url": "https://arxiv.org/abs/2402.08797",
  "version_url": "https://arxiv.org/abs/2402.08797v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andy Zou

Andy Zou is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-89bf1ad0b05e04::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Simon Goldstein

Simon Goldstein is listed as an author of A Case for AI Consciousness: Language Agents and Global Workspace Theory.

Sources and details

A Case for AI Consciousness: Language Agents and Global Workspace Theory

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "authors_in_source_order": [
    "Goldstein, Simon",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "dates": {
    "inspected_revision": "Tue, 15 Oct 2024 08:50:45 UTC (330 KB)",
    "original_submission": "2024/10/15",
    "retrieved_utc": "2026-10-07T18:13:07.124882+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-8d2e0bd2585f6a::S1",
  "title": "A Case for AI Consciousness: Language Agents and Global Workspace Theory",
  "url": "https://arxiv.org/abs/2410.11407",
  "version_url": "https://arxiv.org/abs/2410.11407v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Burigede Liu

Burigede Liu is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-8d7ccee151187b::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Vladlen Koltun

Vladlen Koltun is listed as an author of Playing for Data: Ground Truth from Computer Games.

Sources and details

Playing for Data: Ground Truth from Computer Games

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "authors_in_source_order": [
    "Richter, Stephan R.",
    "Vineet, Vibhav",
    "Roth, Stefan",
    "Koltun, Vladlen"
  ],
  "dates": {
    "inspected_revision": "Sun, 7 Aug 2016 08:20:14 UTC (3,337 KB)",
    "original_submission": "2016/08/07",
    "retrieved_utc": "2026-10-07T18:10:43.726341+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-8ea0d32411d323::S1",
  "title": "Playing for Data: Ground Truth from Computer Games",
  "url": "https://arxiv.org/abs/1608.02192",
  "version_url": "https://arxiv.org/abs/1608.02192v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Filip Wolski

Filip Wolski is listed as an author of Proximal Policy Optimization Algorithms.

Sources and details

Proximal Policy Optimization Algorithms

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "authors_in_source_order": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "dates": {
    "inspected_revision": "Mon, 28 Aug 2017 09:20:06 UTC (2,537 KB)",
    "original_submission": "2017/07/20",
    "retrieved_utc": "2026-10-07T18:01:46.972911+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-919774a5323f8f::S1",
  "title": "Proximal Policy Optimization Algorithms",
  "url": "https://arxiv.org/abs/1707.06347",
  "version_url": "https://arxiv.org/abs/1707.06347v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Axel Sauer

Axel Sauer is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-940ddcf50ef518::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Carole-Jean Wu

Carole-Jean Wu is listed as an author of Sustainable AI: Environmental Implications, Challenges and Opportunities.

Sources and details

Sustainable AI: Environmental Implications, Challenges and Opportunities

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "authors_in_source_order": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "dates": {
    "inspected_revision": "Sun, 9 Jan 2022 19:03:39 UTC (1,089 KB)",
    "original_submission": "2021/10/30",
    "retrieved_utc": "2026-10-07T18:13:06.635699+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a2e538e9d9638c::S1",
  "title": "Sustainable AI: Environmental Implications, Challenges and Opportunities",
  "url": "https://arxiv.org/abs/2111.00364",
  "version_url": "https://arxiv.org/abs/2111.00364v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jeff Sebo

Jeff Sebo is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-a454e6ebc4a680::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Rahim Entezari

Rahim Entezari is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-a6ade92301620d::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Matthew Lai

Matthew Lai is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-ab153825458208::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Phillip Wallis

Phillip Wallis is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ab5fc98456aeee::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yuqi Xie

Yuqi Xie is listed as an author of Voyager: An Open-Ended Embodied Agent with Large Language Models.

Sources and details

Voyager: An Open-Ended Embodied Agent with Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Wang, Guanzhi",
    "Xie, Yuqi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Xiao, Chaowei",
    "Zhu, Yuke",
    "Fan, Linxi",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Oct 2023 16:27:03 UTC (13,649 KB)",
    "original_submission": "2023/05/25",
    "retrieved_utc": "2026-10-07T18:12:35.118997+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ab6d7ccbdc96cf::S1",
  "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models",
  "url": "https://arxiv.org/abs/2305.16291",
  "version_url": "https://arxiv.org/abs/2305.16291v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ali Farhadi

Ali Farhadi is listed as an author of You Only Look Once: Unified, Real-Time Object Detection.

Sources and details

You Only Look Once: Unified, Real-Time Object Detection

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "authors_in_source_order": [
    "Redmon, Joseph",
    "Divvala, Santosh",
    "Girshick, Ross",
    "Farhadi, Ali"
  ],
  "dates": {
    "inspected_revision": "Mon, 9 May 2016 22:22:11 UTC (14,934 KB)",
    "original_submission": "2015/06/08",
    "retrieved_utc": "2026-10-07T17:55:05.587810+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-b17cc9ab0974fa::S1",
  "title": "You Only Look Once: Unified, Real-Time Object Detection",
  "url": "https://arxiv.org/abs/1506.02640",
  "version_url": "https://arxiv.org/abs/1506.02640v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Thomas Hubert

Thomas Hubert is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-b41362066537b4::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Thomas Brox

Thomas Brox is listed as an author of U-Net: Convolutional Networks for Biomedical Image Segmentation.

Sources and details

U-Net: Convolutional Networks for Biomedical Image Segmentation

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "authors_in_source_order": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "dates": {
    "inspected_revision": "Mon, 18 May 2015 11:28:37 UTC (1,385 KB)",
    "original_submission": "2015/05/18",
    "retrieved_utc": "2026-10-07T18:10:43.280332+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-bf46aed352f08f::S1",
  "title": "U-Net: Convolutional Networks for Biomedical Image Segmentation",
  "url": "https://arxiv.org/abs/1505.04597",
  "version_url": "https://arxiv.org/abs/1505.04597v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jacqueline Harding

Jacqueline Harding is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-bf941f870f7f74::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Shaolei Ren

Shaolei Ren is listed as an author of Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models.

Sources and details

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "authors_in_source_order": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "dates": {
    "inspected_revision": "Wed, 26 Mar 2025 07:06:26 UTC (208 KB)",
    "original_submission": "2023/04/06",
    "retrieved_utc": "2026-10-07T18:12:35.083340+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-bf98db1cde3551::S1",
  "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models",
  "url": "https://arxiv.org/abs/2304.03271",
  "version_url": "https://arxiv.org/abs/2304.03271v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Nikola Kovachki

Nikola Kovachki is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-c11882a94cbf2d::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Michael Timothy Bennett

Michael Timothy Bennett is listed as an author of Why Is Anything Conscious?.

Sources and details

Why Is Anything Conscious?

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "authors_in_source_order": [
    "Bennett, Michael Timothy",
    "Welsh, Sean",
    "Ciaunica, Anna"
  ],
  "dates": {
    "inspected_revision": "Thu, 5 Mar 2026 11:24:05 UTC (798 KB)",
    "original_submission": "2024/09/22",
    "retrieved_utc": "2026-10-07T18:11:55.077231+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-c6084a8a1723b5::S1",
  "title": "Why Is Anything Conscious?",
  "url": "https://arxiv.org/abs/2409.14545",
  "version_url": "https://arxiv.org/abs/2409.14545v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pasquale Caponnetto

Pasquale Caponnetto is listed as an author of GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions.

Sources and details

GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "authors_in_source_order": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "dates": {
    "inspected_revision": "Sun, 16 Jun 2024 09:28:40 UTC (35,818 KB)",
    "original_submission": "2023/12/24",
    "retrieved_utc": "2026-10-07T18:11:54.703854+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-c692cabd8ad6da::S1",
  "title": "GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions",
  "url": "https://arxiv.org/abs/2312.16220",
  "version_url": "https://arxiv.org/abs/2312.16220v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Alexander H. Miller

Alexander H. Miller is listed as an author of The NetHack Learning Environment.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-cb3a3d31a4b154::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Oleg Klimov

Oleg Klimov is listed as an author of Proximal Policy Optimization Algorithms.

Sources and details

Proximal Policy Optimization Algorithms

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "authors_in_source_order": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "dates": {
    "inspected_revision": "Mon, 28 Aug 2017 09:20:06 UTC (2,537 KB)",
    "original_submission": "2017/07/20",
    "retrieved_utc": "2026-10-07T18:01:46.972911+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ccd5fbe4e9c383::S1",
  "title": "Proximal Policy Optimization Algorithms",
  "url": "https://arxiv.org/abs/1707.06347",
  "version_url": "https://arxiv.org/abs/1707.06347v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sebastiano Battiato

Sebastiano Battiato is listed as an author of GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions.

Sources and details

GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "authors_in_source_order": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "dates": {
    "inspected_revision": "Sun, 16 Jun 2024 09:28:40 UTC (35,818 KB)",
    "original_submission": "2023/12/24",
    "retrieved_utc": "2026-10-07T18:11:54.703854+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-cd733ca5f47a78::S1",
  "title": "GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions",
  "url": "https://arxiv.org/abs/2312.16220",
  "version_url": "https://arxiv.org/abs/2312.16220v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kilian Q. Weinberger

Kilian Q. Weinberger is listed as an author of Densely Connected Convolutional Networks.

Sources and details

Densely Connected Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "authors_in_source_order": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "dates": {
    "inspected_revision": "Sun, 28 Jan 2018 17:12:02 UTC (5,266 KB)",
    "original_submission": "2016/08/25",
    "retrieved_utc": "2026-10-07T18:10:44.374587+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-ce5ed50f434b39::S1",
  "title": "Densely Connected Convolutional Networks",
  "url": "https://arxiv.org/abs/1608.06993",
  "version_url": "https://arxiv.org/abs/1608.06993v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Alex Goodwin

Alex Goodwin is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-cfac7d6e4db442::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Linxi Fan

Linxi Fan is listed as an author of MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge.

Sources and details

MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Tue, 22 Nov 2022 07:59:47 UTC (9,526 KB)",
    "original_submission": "2022/06/17",
    "retrieved_utc": "2026-10-07T18:17:58.531726+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d138ffe57f7ffe::S1",
  "title": "MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge",
  "url": "https://arxiv.org/abs/2206.08853",
  "version_url": "https://arxiv.org/abs/2206.08853v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pietro Liò

Pietro Liò is listed as an author of Graph Attention Networks.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d21fe4b8482ad9::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ross Girshick

Ross Girshick is listed as an author of Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks.

Sources and details

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Wed, 6 Jan 2016 06:30:17 UTC (6,102 KB)",
    "original_submission": "2015/06/04",
    "retrieved_utc": "2026-10-07T18:18:25.167875+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d7165085de0cd8::S1",
  "title": "Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks",
  "url": "https://arxiv.org/abs/1506.01497",
  "version_url": "https://arxiv.org/abs/1506.01497v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Bo Chen

Bo Chen is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-d73c9c8f8ec590::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Olaf Ronneberger

Olaf Ronneberger is listed as an author of U-Net: Convolutional Networks for Biomedical Image Segmentation.

Sources and details

U-Net: Convolutional Networks for Biomedical Image Segmentation

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "authors_in_source_order": [
    "Ronneberger, Olaf",
    "Fischer, Philipp",
    "Brox, Thomas"
  ],
  "dates": {
    "inspected_revision": "Mon, 18 May 2015 11:28:37 UTC (1,385 KB)",
    "original_submission": "2015/05/18",
    "retrieved_utc": "2026-10-07T18:10:43.280332+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-da5c067172f043::S1",
  "title": "U-Net: Convolutional Networks for Biomedical Image Segmentation",
  "url": "https://arxiv.org/abs/1505.04597",
  "version_url": "https://arxiv.org/abs/1505.04597v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Weijun Wang

Weijun Wang is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-dc61cd200b7b11::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mohit Iyyer

Mohit Iyyer is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-dc891798cc8163::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Thomas N. Kipf

Thomas N. Kipf is listed as an author of Semi-Supervised Classification with Graph Convolutional Networks.

Sources and details

Semi-Supervised Classification with Graph Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Kipf, Thomas N.",
    "Welling, Max"
  ],
  "authors_in_source_order": [
    "Kipf, Thomas N.",
    "Welling, Max"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Feb 2017 09:55:36 UTC (858 KB)",
    "original_submission": "2016/09/09",
    "retrieved_utc": "2026-10-07T18:18:25.411843+00:00",
    "version": "arXiv v4"
  },
  "id": "person-coverage-dd8ab4ce360733::S1",
  "title": "Semi-Supervised Classification with Graph Convolutional Networks",
  "url": "https://arxiv.org/abs/1609.02907",
  "version_url": "https://arxiv.org/abs/1609.02907v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Udit Gupta

Udit Gupta is listed as an author of Sustainable AI: Environmental Implications, Challenges and Opportunities.

Sources and details

Sustainable AI: Environmental Implications, Challenges and Opportunities

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "authors_in_source_order": [
    "Wu, Carole-Jean",
    "Raghavendra, Ramya",
    "Gupta, Udit",
    "Acun, Bilge",
    "Ardalani, Newsha",
    "Maeng, Kiwan",
    "Chang, Gloria",
    "Behram, Fiona Aga",
    "Huang, James",
    "Bai, Charles",
    "Gschwind, Michael",
    "Gupta, Anurag",
    "Ott, Myle",
    "Melnikov, Anastasia",
    "Candido, Salvatore",
    "Brooks, David",
    "Chauhan, Geeta",
    "Lee, Benjamin",
    "Lee, Hsien-Hsin S.",
    "Akyildiz, Bugra",
    "Balandat, Maximilian",
    "Spisak, Joe",
    "Jain, Ravi",
    "Rabbat, Mike",
    "Hazelwood, Kim"
  ],
  "dates": {
    "inspected_revision": "Sun, 9 Jan 2022 19:03:39 UTC (1,089 KB)",
    "original_submission": "2021/10/30",
    "retrieved_utc": "2026-10-07T18:13:06.635699+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-e47f0aa64fb492::S1",
  "title": "Sustainable AI: Environmental Implications, Challenges and Opportunities",
  "url": "https://arxiv.org/abs/2111.00364",
  "version_url": "https://arxiv.org/abs/2111.00364v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mohammad A. Islam

Mohammad A. Islam is listed as an author of Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models.

Sources and details

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "authors_in_source_order": [
    "Li, Pengfei",
    "Yang, Jianyi",
    "Islam, Mohammad A.",
    "Ren, Shaolei"
  ],
  "dates": {
    "inspected_revision": "Wed, 26 Mar 2025 07:06:26 UTC (208 KB)",
    "original_submission": "2023/04/06",
    "retrieved_utc": "2026-10-07T18:12:35.083340+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-e6bcdc4c4f8e8e::S1",
  "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models",
  "url": "https://arxiv.org/abs/2304.03271",
  "version_url": "https://arxiv.org/abs/2304.03271v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jonas Müller

Jonas Müller is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-e7a6cfc49d93f8::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zhuang Liu

Zhuang Liu is listed as an author of Densely Connected Convolutional Networks.

Sources and details

Densely Connected Convolutional Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "authors_in_source_order": [
    "Huang, Gao",
    "Liu, Zhuang",
    "van der Maaten, Laurens",
    "Weinberger, Kilian Q."
  ],
  "dates": {
    "inspected_revision": "Sun, 28 Jan 2018 17:12:02 UTC (5,266 KB)",
    "original_submission": "2016/08/25",
    "retrieved_utc": "2026-10-07T18:10:44.374587+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-e7d2755f708cae::S1",
  "title": "Densely Connected Convolutional Networks",
  "url": "https://arxiv.org/abs/1608.06993",
  "version_url": "https://arxiv.org/abs/1608.06993v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dustin Podell

Dustin Podell is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-ed69a8487694db::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Christopher D. Manning

Christopher D. Manning is listed as an author of Direct Preference Optimization: Your Language Model is Secretly a Reward Model.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "authors_in_source_order": [
    "Rafailov, Rafael",
    "Sharma, Archit",
    "Mitchell, Eric",
    "Ermon, Stefano",
    "Manning, Christopher D.",
    "Finn, Chelsea"
  ],
  "dates": {
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "2023/05/29",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-f0321acbd33009::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Christopher Clark

Christopher Clark is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f0fd362c7a8036::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Edward Grefenstette

Edward Grefenstette is listed as an author of The NetHack Learning Environment.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f521445b26ecf4::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andrew Stuart

Andrew Stuart is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-f65e9c0d1d3a1a::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Adriana Romero

Adriana Romero is listed as an author of Graph Attention Networks.

Sources and details

Graph Attention Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Veličković, Petar",
    "Cucurull, Guillem",
    "Casanova, Arantxa",
    "Romero, Adriana",
    "Liò, Pietro",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Sun, 4 Feb 2018 19:13:29 UTC (1,881 KB)",
    "original_submission": "2017/10/30",
    "retrieved_utc": "2026-10-07T18:11:53.455821+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-f69183bf1acfe9::S1",
  "title": "Graph Attention Networks",
  "url": "https://arxiv.org/abs/1710.10903",
  "version_url": "https://arxiv.org/abs/1710.10903v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andrew Zisserman

Andrew Zisserman is listed as an author of Very Deep Convolutional Networks for Large-Scale Image Recognition.

Sources and details

Very Deep Convolutional Networks for Large-Scale Image Recognition

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Simonyan, Karen",
    "Zisserman, Andrew"
  ],
  "authors_in_source_order": [
    "Simonyan, Karen",
    "Zisserman, Andrew"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 Apr 2015 16:25:04 UTC (47 KB)",
    "original_submission": "2014/09/04",
    "retrieved_utc": "2026-10-07T18:18:45.027757+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-f7944464537f31::S1",
  "title": "Very Deep Convolutional Networks for Large-Scale Image Recognition",
  "url": "https://arxiv.org/abs/1409.1556",
  "version_url": "https://arxiv.org/abs/1409.1556v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mirko Casu

Mirko Casu is listed as an author of GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions.

Sources and details

GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "authors_in_source_order": [
    "Casu, Mirko",
    "Guarnera, Luca",
    "Caponnetto, Pasquale",
    "Battiato, Sebastiano"
  ],
  "dates": {
    "inspected_revision": "Sun, 16 Jun 2024 09:28:40 UTC (35,818 KB)",
    "original_submission": "2023/12/24",
    "retrieved_utc": "2026-10-07T18:11:54.703854+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f7c740f779b273::S1",
  "title": "GenAI Mirage: The Impostor Bias and the Deepfake Detection Challenge in the Era of Artificial Illusions",
  "url": "https://arxiv.org/abs/2312.16220",
  "version_url": "https://arxiv.org/abs/2312.16220v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Steven Basart

Steven Basart is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-fad22587a8901d::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tim Harley

Tim Harley is listed as an author of Asynchronous Methods for Deep Reinforcement Learning.

Sources and details

Asynchronous Methods for Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Badia, Adrià Puigdomènech",
    "Mirza, Mehdi",
    "Graves, Alex",
    "Lillicrap, Timothy P.",
    "Harley, Tim",
    "Silver, David",
    "Kavukcuoglu, Koray"
  ],
  "dates": {
    "inspected_revision": "Thu, 16 Jun 2016 16:38:45 UTC (1,883 KB)",
    "original_submission": "2016/02/04",
    "retrieved_utc": "2026-10-07T18:01:46.792015+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-fbf8a2791270a0::S1",
  "title": "Asynchronous Methods for Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1602.01783",
  "version_url": "https://arxiv.org/abs/1602.01783v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kyle Lacey

Kyle Lacey is listed as an author of SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis.

Sources and details

SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Podell, Dustin",
    "English, Zion",
    "Lacey, Kyle",
    "Blattmann, Andreas",
    "Dockhorn, Tim",
    "Müller, Jonas",
    "Penna, Joe",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 4 Jul 2023 23:04:57 UTC (17,167 KB)",
    "original_submission": "2023/07/04",
    "retrieved_utc": "2026-10-07T18:01:48.126200+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-ff81f0d1e488ad::S1",
  "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2307.01952",
  "version_url": "https://arxiv.org/abs/2307.01952v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Daan Wierstra

Daan Wierstra is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-daanwierstra::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dario Amodei

Dario Amodei is listed as an author of Concrete Problems in AI Safety.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "person-darioamodei::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

David Silver

David Silver is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-davidsilver::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

David Warde-Farley

David Warde-Farley is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-davidwardefarley::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Demis Hassabis

Demis Hassabis is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-demishassabis::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Girish Sastry

Girish Sastry is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-girishsastry::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Gretchen Krueger

Gretchen Krueger is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-gretchenkrueger::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ioannis Antonoglou

Ioannis Antonoglou is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-ioannisantonoglou::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jack Clark

Jack Clark is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-jackclark::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jean Pouget-Abadie

Jean Pouget-Abadie is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jeanpougetabadie::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jeff Dean

Jeff Dean is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-jeffdean::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jian Sun

Jian Sun is listed as an author of Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks.

Sources and details

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Wed, 6 Jan 2016 06:30:17 UTC (6,102 KB)",
    "original_submission": "2015/06/04",
    "retrieved_utc": "2026-10-07T18:18:25.167875+00:00",
    "version": "arXiv v3"
  },
  "id": "person-jiansun::S1",
  "title": "Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks",
  "url": "https://arxiv.org/abs/1506.01497",
  "version_url": "https://arxiv.org/abs/1506.01497v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jonathan Ho

Jonathan Ho is listed as an author of Denoising Diffusion Probabilistic Models.

Sources and details

Denoising Diffusion Probabilistic Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Ho, Jonathan",
    "Jain, Ajay",
    "Abbeel, Pieter"
  ],
  "dates": {
    "inspected_revision": "Wed, 16 Dec 2020 21:15:05 UTC (9,137 KB)",
    "original_submission": "2020/06/19",
    "retrieved_utc": "2026-10-07T17:55:07.151030+00:00",
    "version": "arXiv v2"
  },
  "id": "person-jonathanho::S1",
  "title": "Denoising Diffusion Probabilistic Models",
  "url": "https://arxiv.org/abs/2006.11239",
  "version_url": "https://arxiv.org/abs/2006.11239v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kai Chen

Kai Chen is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-kaichen::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named byline and the collective paper statements below. Other inherited career, affiliation, equal-contribution and attached-work claims remain in the original record and were not independently reviewed here.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Hongxia Hao

Hongxia Hao is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2890bc401c7fcd::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Scott Reed

Scott Reed is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-415a824753a257::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jielan Li

Jielan Li is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-58137ecd74bd25::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Wei Liu

Wei Liu is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-633d8c18b05fd5::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andrew Rabinovich

Andrew Rabinovich is listed as an author of Going Deeper with Convolutions.

Sources and details

Going Deeper with Convolutions

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "authors_in_source_order": [
    "Szegedy, Christian",
    "Liu, Wei",
    "Jia, Yangqing",
    "Sermanet, Pierre",
    "Reed, Scott",
    "Anguelov, Dragomir",
    "Erhan, Dumitru",
    "Vanhoucke, Vincent",
    "Rabinovich, Andrew"
  ],
  "dates": {
    "inspected_revision": "Wed, 17 Sep 2014 01:03:11 UTC (1,005 KB)",
    "original_submission": "2014/09/17",
    "retrieved_utc": "2026-10-07T18:10:42.143913+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-64b18ff42196fa::S1",
  "title": "Going Deeper with Convolutions",
  "url": "https://arxiv.org/abs/1409.4842",
  "version_url": "https://arxiv.org/abs/1409.4842v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Matthew Horton

Matthew Horton is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-65011456051851::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Robert Pinsler

Robert Pinsler is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-818f9527282ad7::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Lingyu Kong

Lingyu Kong is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-966ec7e3ea51e2::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tian Xie

Tian Xie is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-aa28479e3b61c7::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ziheng Lu

Ziheng Lu is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ab11e2257e8c08::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Shuizhou Chen

Shuizhou Chen is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ac46b9e6654d1a::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Weizhu Chen

Weizhu Chen is listed as an author of LoRA: Low-Rank Adaptation of Large Language Models.

Sources and details

LoRA: Low-Rank Adaptation of Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "authors_in_source_order": [
    "Hu, Edward J.",
    "Shen, Yelong",
    "Wallis, Phillip",
    "Allen-Zhu, Zeyuan",
    "Li, Yuanzhi",
    "Wang, Shean",
    "Wang, Lu",
    "Chen, Weizhu"
  ],
  "dates": {
    "inspected_revision": "Sat, 16 Oct 2021 18:40:34 UTC (896 KB)",
    "original_submission": "2021/06/17",
    "retrieved_utc": "2026-10-07T17:55:07.298197+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-b43e8d9618261e::S1",
  "title": "LoRA: Low-Rank Adaptation of Large Language Models",
  "url": "https://arxiv.org/abs/2106.09685",
  "version_url": "https://arxiv.org/abs/2106.09685v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Qian Wang

Qian Wang is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-b51da54ae56eaa::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Andrew Fowler

Andrew Fowler is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-b98add699e8db0::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Chenxi Hu

Chenxi Hu is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d056dd26602b6a::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zekun Chen

Zekun Chen is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d1698d5551d28f::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Daniel Zügner

Daniel Zügner is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d363c1e8711d18::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Menglong Zhu

Menglong Zhu is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-e5c554987648b0::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Hartwig Adam

Hartwig Adam is listed as an author of MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications.

Sources and details

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "authors_in_source_order": [
    "Howard, Andrew G.",
    "Zhu, Menglong",
    "Chen, Bo",
    "Kalenichenko, Dmitry",
    "Wang, Weijun",
    "Weyand, Tobias",
    "Andreetto, Marco",
    "Adam, Hartwig"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 Apr 2017 03:57:34 UTC (877 KB)",
    "original_submission": "2017/04/17",
    "retrieved_utc": "2026-10-07T18:11:53.273530+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-ea5eb0c494f70d::S1",
  "title": "MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications",
  "url": "https://arxiv.org/abs/1704.04861",
  "version_url": "https://arxiv.org/abs/1704.04861v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Lixin Sun

Lixin Sun is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f84f601b873055::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Han Yang

Han Yang is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f854175899264d::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Anima Anandkumar

Anima Anandkumar is listed as an author of Fourier Neural Operator for Parametric Partial Differential Equations.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-f94186a3813fe7::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Chang Liu

Chang Liu is listed as an author of MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures.

Sources and details

MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "authors_in_source_order": [
    "Yang, Han",
    "Hu, Chenxi",
    "Zhou, Yichi",
    "Liu, Xixian",
    "Shi, Yu",
    "Li, Jielan",
    "Li, Guanzhi",
    "Chen, Zekun",
    "Chen, Shuizhou",
    "Zeni, Claudio",
    "Horton, Matthew",
    "Pinsler, Robert",
    "Fowler, Andrew",
    "Zügner, Daniel",
    "Xie, Tian",
    "Smith, Jake",
    "Sun, Lixin",
    "Wang, Qian",
    "Kong, Lingyu",
    "Liu, Chang",
    "Hao, Hongxia",
    "Lu, Ziheng"
  ],
  "dates": {
    "inspected_revision": "Fri, 10 May 2024 16:49:52 UTC (41,186 KB)",
    "original_submission": "2024/05/08",
    "retrieved_utc": "2026-10-07T18:11:54.738934+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-fa290a9e1b8fbe::S1",
  "title": "MatterSim: A Deep Learning Atomistic Model Across Elements, Temperatures and Pressures",
  "url": "https://arxiv.org/abs/2405.04967",
  "version_url": "https://arxiv.org/abs/2405.04967v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mantas Mazeika

Mantas Mazeika is listed as an author of Measuring Massive Multitask Language Understanding.

Sources and details

Measuring Massive Multitask Language Understanding

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "authors_in_source_order": [
    "Hendrycks, Dan",
    "Burns, Collin",
    "Basart, Steven",
    "Zou, Andy",
    "Mazeika, Mantas",
    "Song, Dawn",
    "Steinhardt, Jacob"
  ],
  "dates": {
    "inspected_revision": "Tue, 12 Jan 2021 18:57:11 UTC (2,578 KB)",
    "original_submission": "2020/09/07",
    "retrieved_utc": "2026-10-07T17:54:15.466215+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-fce2ed426fbb40::S1",
  "title": "Measuring Massive Multitask Language Understanding",
  "url": "https://arxiv.org/abs/2009.03300",
  "version_url": "https://arxiv.org/abs/2009.03300v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Harry Saini

Harry Saini is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-fe41248dc3e1d3::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yannik Marek

Yannik Marek is listed as an author of Scaling Rectified Flow Transformers for High-Resolution Image Synthesis.

Sources and details

Scaling Rectified Flow Transformers for High-Resolution Image Synthesis

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "authors_in_source_order": [
    "Esser, Patrick",
    "Kulal, Sumith",
    "Blattmann, Andreas",
    "Entezari, Rahim",
    "Müller, Jonas",
    "Saini, Harry",
    "Levi, Yam",
    "Lorenz, Dominik",
    "Sauer, Axel",
    "Boesel, Frederic",
    "Podell, Dustin",
    "Dockhorn, Tim",
    "English, Zion",
    "Lacey, Kyle",
    "Goodwin, Alex",
    "Marek, Yannik",
    "Rombach, Robin"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Mar 2024 18:45:39 UTC (32,525 KB)",
    "original_submission": "2024/03/05",
    "retrieved_utc": "2026-10-07T18:01:48.357198+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-fe51054a13ed67::S1",
  "title": "Scaling Rectified Flow Transformers for High-Resolution Image Synthesis",
  "url": "https://arxiv.org/abs/2403.03206",
  "version_url": "https://arxiv.org/abs/2403.03206v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

David Chalmers

David Chalmers is listed as an author of Taking AI Welfare Seriously.

Sources and details

Taking AI Welfare Seriously

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "authors_in_source_order": [
    "Long, Robert",
    "Sebo, Jeff",
    "Butlin, Patrick",
    "Finlinson, Kathleen",
    "Fish, Kyle",
    "Harding, Jacqueline",
    "Pfau, Jacob",
    "Sims, Toni",
    "Birch, Jonathan",
    "Chalmers, David"
  ],
  "dates": {
    "inspected_revision": "Mon, 4 Nov 2024 17:57:57 UTC (165 KB)",
    "original_submission": "2024/11/04",
    "retrieved_utc": "2026-10-07T18:11:55.175918+00:00",
    "version": "arXiv v1"
  },
  "id": "person-davidchalmers::S1",
  "title": "Taking AI Welfare Seriously",
  "url": "https://arxiv.org/abs/2411.00986",
  "version_url": "https://arxiv.org/abs/2411.00986v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kaiming He

Kaiming He is listed as an author of Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks.

Sources and details

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Wed, 6 Jan 2016 06:30:17 UTC (6,102 KB)",
    "original_submission": "2015/06/04",
    "retrieved_utc": "2026-10-07T18:18:25.167875+00:00",
    "version": "arXiv v3"
  },
  "id": "person-kaiminghe::S1",
  "title": "Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks",
  "url": "https://arxiv.org/abs/1506.01497",
  "version_url": "https://arxiv.org/abs/1506.01497v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kenton Lee

Kenton Lee is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-kentonlee::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Koray Kavukcuoglu

Koray Kavukcuoglu is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-koraykavukcuoglu::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ariel Herbert-Voss

Ariel Herbert-Voss is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-arielherbertvoss::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Arthur Guez

Arthur Guez is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-arthurguez::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Arvind Neelakantan

Arvind Neelakantan is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-arvindneelakantan::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Brian Ichter

Brian Ichter is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-brianichter::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Christopher Berner

Christopher Berner is listed as an author of Dota 2 with Large Scale Deep Reinforcement Learning.

Sources and details

Dota 2 with Large Scale Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "authors_in_source_order": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "dates": {
    "inspected_revision": "Fri, 13 Dec 2019 19:56:40 UTC (8,625 KB)",
    "original_submission": "2019/12/13",
    "retrieved_utc": "2026-10-07T18:20:40.482612+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-christopherberner::S1",
  "title": "Dota 2 with Large Scale Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1912.06680",
  "version_url": "https://arxiv.org/abs/1912.06680v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Christopher Hesse

Christopher Hesse is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-christopherhesse::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Clemens Winter

Clemens Winter is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-clemenswinter::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dale Schuurmans

Dale Schuurmans is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-daleschuurmans::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Daniel M. Ziegler

Daniel M. Ziegler is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-danielmziegler::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Dan Mané

Dan Mané is listed as an author of Concrete Problems in AI Safety.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "person-local-danmane::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

David Duvenaud

David Duvenaud is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-davidduvenaud::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Da Yan

Da Yan is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-dayan::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Denny Zhou

Denny Zhou is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-dennyzhou::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Ed Chi

Ed Chi is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-edchi::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Eric Sigler

Eric Sigler is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-ericsigler::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Esin Durmus

Esin Durmus is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-esindurmus::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Fei Xia

Fei Xia is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-feixia::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jacob Steinhardt

Jacob Steinhardt is listed as an author of Concrete Problems in AI Safety.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "person-local-jacobsteinhardt::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jane Dwivedi-Yu

Jane Dwivedi-Yu is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-janedwivediyu::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Jason Wei

Jason Wei is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-jasonwei::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Julian Schrittwieser

Julian Schrittwieser is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-julianschrittwieser::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Kamal Ndousse

Kamal Ndousse is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-kamalndousse::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Laurent Sifre

Laurent Sifre is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-laurentsifre::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Maarten Bosma

Maarten Bosma is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-maartenbosma::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Marc Lanctot

Marc Lanctot is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-marclanctot::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Maria Lomeli

Maria Lomeli is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-marialomeli::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mateusz Litwin

Mateusz Litwin is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-mateuszlitwin::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Meg Tong

Meg Tong is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-megtong::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Melanie Subbiah

Melanie Subbiah is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-melaniesubbiah::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Miranda Zhang

Miranda Zhang is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-mirandazhang::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mrinank Sharma

Mrinank Sharma is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-mrinanksharma::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Newton Cheng

Newton Cheng is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-newtoncheng::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Nicholas Schiefer

Nicholas Schiefer is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-nicholasschiefer::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Nick Ryder

Nick Ryder is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-nickryder::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Nicola Cancedda

Nicola Cancedda is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-nicolacancedda::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Oliver Rausch

Oliver Rausch is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-oliverrausch::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Pranav Shyam

Pranav Shyam is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-pranavshyam::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Roberta Raileanu

Roberta Raileanu is listed as an author of The NetHack Learning Environment.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "original_submission": "2020/06/24",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "person-local-robertaraileanu::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Roberto Dessì

Roberto Dessì is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-robertodessi::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Samuel R. Bowman

Samuel R. Bowman is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-samuelrbowman::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Scott R. Johnston

Scott R. Johnston is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-scottrjohnston::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Shauna Kravec

Shauna Kravec is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-shaunakravec::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Thomas Scialom

Thomas Scialom is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-thomasscialom::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Thore Graepel

Thore Graepel is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-thoregraepel::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Timo Schick

Timo Schick is listed as an author of Toolformer: Language Models Can Teach Themselves to Use Tools.

Sources and details

Toolformer: Language Models Can Teach Themselves to Use Tools

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "authors_in_source_order": [
    "Schick, Timo",
    "Dwivedi-Yu, Jane",
    "Dessì, Roberto",
    "Raileanu, Roberta",
    "Lomeli, Maria",
    "Zettlemoyer, Luke",
    "Cancedda, Nicola",
    "Scialom, Thomas"
  ],
  "dates": {
    "inspected_revision": "Thu, 9 Feb 2023 16:49:57 UTC (202 KB)",
    "original_submission": "2023/02/09",
    "retrieved_utc": "2026-10-07T18:20:40.853979+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-timoschick::S1",
  "title": "Toolformer: Language Models Can Teach Themselves to Use Tools",
  "url": "https://arxiv.org/abs/2302.04761",
  "version_url": "https://arxiv.org/abs/2302.04761v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Timothy Lillicrap

Timothy Lillicrap is listed as an author of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "original_submission": "2017/12/05",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-timothylillicrap::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Timothy Maxwell

Timothy Maxwell is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-timothymaxwell::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Tomasz Korbak

Tomasz Korbak is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-tomaszkorbak::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Xuezhi Wang

Xuezhi Wang is listed as an author of Chain-of-Thought Prompting Elicits Reasoning in Large Language Models.

Sources and details

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "authors_in_source_order": [
    "Wei, Jason",
    "Wang, Xuezhi",
    "Schuurmans, Dale",
    "Bosma, Maarten",
    "Ichter, Brian",
    "Xia, Fei",
    "Chi, Ed",
    "Le, Quoc",
    "Zhou, Denny"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jan 2023 23:07:57 UTC (306 KB)",
    "original_submission": "2022/01/28",
    "retrieved_utc": "2026-10-07T17:54:15.518133+00:00",
    "version": "arXiv v6"
  },
  "id": "person-local-xuezhiwang::S1",
  "title": "Chain-of-Thought Prompting Elicits Reasoning in Large Language Models",
  "url": "https://arxiv.org/abs/2201.11903",
  "version_url": "https://arxiv.org/abs/2201.11903v6"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yang Song

Yang Song is listed as an author of Generative Modeling by Estimating Gradients of the Data Distribution.

Sources and details

Generative Modeling by Estimating Gradients of the Data Distribution

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 Oct 2020 07:46:19 UTC (8,077 KB)",
    "original_submission": "2019/07/12",
    "retrieved_utc": "2026-10-07T18:21:27.349649+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-yangsong::S1",
  "title": "Generative Modeling by Estimating Gradients of the Data Distribution",
  "url": "https://arxiv.org/abs/1907.05600",
  "version_url": "https://arxiv.org/abs/1907.05600v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Zac Hatfield-Dodds

Zac Hatfield-Dodds is listed as an author of Towards Understanding Sycophancy in Language Models.

Sources and details

Towards Understanding Sycophancy in Language Models

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "authors_in_source_order": [
    "Sharma, Mrinank",
    "Tong, Meg",
    "Korbak, Tomasz",
    "Duvenaud, David",
    "Askell, Amanda",
    "Bowman, Samuel R.",
    "Cheng, Newton",
    "Durmus, Esin",
    "Hatfield-Dodds, Zac",
    "Johnston, Scott R.",
    "Kravec, Shauna",
    "Maxwell, Timothy",
    "McCandlish, Sam",
    "Ndousse, Kamal",
    "Rausch, Oliver",
    "Schiefer, Nicholas",
    "Yan, Da",
    "Zhang, Miranda",
    "Perez, Ethan"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 May 2025 07:10:46 UTC (1,569 KB)",
    "original_submission": "2023/10/20",
    "retrieved_utc": "2026-10-07T18:01:48.258765+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-zachatfielddodds::S1",
  "title": "Towards Understanding Sycophancy in Language Models",
  "url": "https://arxiv.org/abs/2310.13548",
  "version_url": "https://arxiv.org/abs/2310.13548v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Luke Zettlemoyer

Luke Zettlemoyer is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-lukezettlemoyer::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mark Chen

Mark Chen is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-markchen::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Martin Riedmiller

Martin Riedmiller is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-martinriedmiller::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Matthew E. Peters

Matthew E. Peters is listed as an author of Deep contextualized word representations.

Sources and details

Deep contextualized word representations

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "authors_in_source_order": [
    "Peters, Matthew E.",
    "Neumann, Mark",
    "Iyyer, Mohit",
    "Gardner, Matt",
    "Clark, Christopher",
    "Lee, Kenton",
    "Zettlemoyer, Luke"
  ],
  "dates": {
    "inspected_revision": "Thu, 22 Mar 2018 21:59:40 UTC (140 KB)",
    "original_submission": "2018/02/15",
    "retrieved_utc": "2026-10-07T18:12:34.446269+00:00",
    "version": "arXiv v2"
  },
  "id": "person-matthewepeters::S1",
  "title": "Deep contextualized word representations",
  "url": "https://arxiv.org/abs/1802.05365",
  "version_url": "https://arxiv.org/abs/1802.05365v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Mehdi Mirza

Mehdi Mirza is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-mehdimirza::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Paul Christiano

Paul Christiano is listed as an author of Concrete Problems in AI Safety.

Sources and details

Concrete Problems in AI Safety

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "authors_in_source_order": [
    "Amodei, Dario",
    "Olah, Chris",
    "Steinhardt, Jacob",
    "Christiano, Paul",
    "Schulman, John",
    "Mané, Dan"
  ],
  "dates": {
    "inspected_revision": "Mon, 25 Jul 2016 17:23:29 UTC (52 KB)",
    "original_submission": "2016/06/21",
    "retrieved_utc": "2026-10-07T18:10:43.505080+00:00",
    "version": "arXiv v2"
  },
  "id": "person-paulchristiano::S1",
  "title": "Concrete Problems in AI Safety",
  "url": "https://arxiv.org/abs/1606.06565",
  "version_url": "https://arxiv.org/abs/1606.06565v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Prafulla Dhariwal

Prafulla Dhariwal is listed as an author of Proximal Policy Optimization Algorithms.

Sources and details

Proximal Policy Optimization Algorithms

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "authors_in_source_order": [
    "Schulman, John",
    "Wolski, Filip",
    "Dhariwal, Prafulla",
    "Radford, Alec",
    "Klimov, Oleg"
  ],
  "dates": {
    "inspected_revision": "Mon, 28 Aug 2017 09:20:06 UTC (2,537 KB)",
    "original_submission": "2017/07/20",
    "retrieved_utc": "2026-10-07T18:01:46.972911+00:00",
    "version": "arXiv v2"
  },
  "id": "person-prafulladhariwal::S1",
  "title": "Proximal Policy Optimization Algorithms",
  "url": "https://arxiv.org/abs/1707.06347",
  "version_url": "https://arxiv.org/abs/1707.06347v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Quoc V. Le

Quoc V. Le is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-quocvle::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Rajat Monga

Rajat Monga is listed as an author of Building high-level features using large scale unsupervised learning.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "original_submission": "2011/12/29",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-rajatmonga::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sandhini Agarwal

Sandhini Agarwal is listed as an author of Language Models are Few-Shot Learners.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "original_submission": "2020/05/28",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-sandhiniagarwal::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sergey Ioffe

Sergey Ioffe is listed as an author of Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift.

Sources and details

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "authors_in_source_order": [
    "Ioffe, Sergey",
    "Szegedy, Christian"
  ],
  "dates": {
    "inspected_revision": "Mon, 2 Mar 2015 20:44:12 UTC (30 KB)",
    "original_submission": "2015/02/11",
    "retrieved_utc": "2026-10-07T17:54:15.091043+00:00",
    "version": "arXiv v3"
  },
  "id": "person-sergeyioffe::S1",
  "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift",
  "url": "https://arxiv.org/abs/1502.03167",
  "version_url": "https://arxiv.org/abs/1502.03167v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Shaoqing Ren

Shaoqing Ren is listed as an author of Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks.

Sources and details

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "authors_in_source_order": [
    "Ren, Shaoqing",
    "He, Kaiming",
    "Girshick, Ross",
    "Sun, Jian"
  ],
  "dates": {
    "inspected_revision": "Wed, 6 Jan 2016 06:30:17 UTC (6,102 KB)",
    "original_submission": "2015/06/04",
    "retrieved_utc": "2026-10-07T18:18:25.167875+00:00",
    "version": "arXiv v3"
  },
  "id": "person-shaoqingren::S1",
  "title": "Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks",
  "url": "https://arxiv.org/abs/1506.01497",
  "version_url": "https://arxiv.org/abs/1506.01497v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Sherjil Ozair

Sherjil Ozair is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-sherjilozair::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Soumith Chintala

Soumith Chintala is listed as an author of Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks.

Sources and details

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Metz, Luke",
    "Chintala, Soumith"
  ],
  "dates": {
    "inspected_revision": "Thu, 7 Jan 2016 23:09:39 UTC (9,028 KB)",
    "original_submission": "2015/11/19",
    "retrieved_utc": "2026-10-07T18:01:46.682703+00:00",
    "version": "arXiv v2"
  },
  "id": "person-soumithchintala::S1",
  "title": "Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1511.06434",
  "version_url": "https://arxiv.org/abs/1511.06434v2"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Stefano Ermon

Stefano Ermon is listed as an author of Generative Modeling by Estimating Gradients of the Data Distribution.

Sources and details

Generative Modeling by Estimating Gradients of the Data Distribution

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Ermon, Stefano"
  ],
  "dates": {
    "inspected_revision": "Sat, 10 Oct 2020 07:46:19 UTC (8,077 KB)",
    "original_submission": "2019/07/12",
    "retrieved_utc": "2026-10-07T18:21:27.349649+00:00",
    "version": "arXiv v3"
  },
  "id": "person-stefanoermon::S1",
  "title": "Generative Modeling by Estimating Gradients of the Data Distribution",
  "url": "https://arxiv.org/abs/1907.05600",
  "version_url": "https://arxiv.org/abs/1907.05600v3"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Volodymyr Mnih

Volodymyr Mnih is listed as an author of Playing Atari with Deep Reinforcement Learning.

Sources and details

Playing Atari with Deep Reinforcement Learning

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Graves, Alex",
    "Antonoglou, Ioannis",
    "Wierstra, Daan",
    "Riedmiller, Martin"
  ],
  "dates": {
    "inspected_revision": "Thu, 19 Dec 2013 16:00:08 UTC (221 KB)",
    "original_submission": "2013/12/19",
    "retrieved_utc": "2026-10-07T18:01:46.421234+00:00",
    "version": "arXiv v1"
  },
  "id": "person-volodymyrmnih::S1",
  "title": "Playing Atari with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1312.5602",
  "version_url": "https://arxiv.org/abs/1312.5602v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Yoshua Bengio

Yoshua Bengio is listed as an author of Generative Adversarial Networks.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "original_submission": "2014/06/10",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "person-yoshuabengio::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Susan Athey

Susan Athey is listed as an author of Machine Learning Methods Economists Should Know About.

Sources and details

Machine Learning Methods Economists Should Know About

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Athey, Susan",
    "Imbens, Guido"
  ],
  "authors_in_source_order": [
    "Athey, Susan",
    "Imbens, Guido"
  ],
  "dates": {
    "inspected_revision": "Sun, 24 Mar 2019 22:58:02 UTC (93 KB)",
    "original_submission": "2019/03/24",
    "retrieved_utc": "2026-10-07T18:11:53.673348+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-119e44615e9aed::S1",
  "title": "Machine Learning Methods Economists Should Know About",
  "url": "https://arxiv.org/abs/1903.10075",
  "version_url": "https://arxiv.org/abs/1903.10075v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Adam Paszke

Adam Paszke is listed as an author of PyTorch: An Imperative Style, High-Performance Deep Learning Library.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Paszke, Adam",
    "Gross, Sam",
    "Massa, Francisco",
    "Lerer, Adam",
    "Bradbury, James",
    "Chanan, Gregory",
    "Killeen, Trevor",
    "Lin, Zeming",
    "Gimelshein, Natalia",
    "Antiga, Luca",
    "Desmaison, Alban",
    "Köpf, Andreas",
    "Yang, Edward",
    "DeVito, Zach",
    "Raison, Martin",
    "Tejani, Alykhan",
    "Chilamkurthy, Sasank",
    "Steiner, Benoit",
    "Fang, Lu",
    "Bai, Junjie",
    "Chintala, Soumith"
  ],
  "authors_in_source_order": [
    "Paszke, Adam",
    "Gross, Sam",
    "Massa, Francisco",
    "Lerer, Adam",
    "Bradbury, James",
    "Chanan, Gregory",
    "Killeen, Trevor",
    "Lin, Zeming",
    "Gimelshein, Natalia",
    "Antiga, Luca",
    "Desmaison, Alban",
    "Köpf, Andreas",
    "Yang, Edward",
    "DeVito, Zach",
    "Raison, Martin",
    "Tejani, Alykhan",
    "Chilamkurthy, Sasank",
    "Steiner, Benoit",
    "Fang, Lu",
    "Bai, Junjie",
    "Chintala, Soumith"
  ],
  "dates": {
    "inspected_revision": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission": "2019/12/03",
    "retrieved_utc": "2026-10-07T18:01:47.063189+00:00",
    "version": "arXiv v1"
  },
  "id": "person-adampaszke::S1",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703",
  "version_url": "https://arxiv.org/abs/1912.01703v1"
}

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Additive abstract/byline-scoped proposal; stronger inherited mechanisms, examples and limits remain primary.

Bibliographic authorship does not establish individual division of labor, original invention or historical causal influence.

All identity, access, rights, optional-family and credit-completeness holds survive.

No complete work, career, experimental-table or original-data audit is claimed.

Original paraphrase and references only; source documents and images are not redistributed.

This batch verifies the named source byline and describes the credited paper collectively. It does not establish this person’s individual share of the work, invention, career, affiliation or historical influence.

All identity, career, rights, access, influence and optional-family holds remain.

Dates

{}

Cosine similarity

Cosine similarity compares vectors using their dot product divided by the product of their lengths.

Sources and details

cosine_similarity — scikit-learn 1.9.1 documentation

{
  "access_scope": "Reference definition and normalized-input equivalence; not a guarantee of semantic relevance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:17.106320+00:00"
  },
  "id": "concept-tech-CosineSimilarity::S1",
  "title": "cosine_similarity — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/generated/sklearn.metrics.pairwise.cosine_similarity.html"
}

Reference definition and normalized-input equivalence; not a guarantee of semantic relevance.

Reference definition and normalized-input equivalence; not a guarantee of semantic relevance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Curse of dimensionality

The scikit-learn nearest-neighbor guide warns that radius-based classification becomes less effective in high-dimensional spaces.

This illustrates the curse of dimensionality through a particular learning method rather than treating every additional feature as harmful.

Sources and details

1.6. Nearest Neighbors — scikit-learn 1.9.1 documentation

{
  "access_scope": "Nearest Neighbors, radius-based classification discussion; no universal dimensional threshold.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:17.503233+00:00"
  },
  "id": "concept-tech-CurseOfDimensionality::S1",
  "title": "1.6. Nearest Neighbors — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/neighbors.html"
}

Nearest Neighbors, radius-based classification discussion; no universal dimensional threshold.

Nearest Neighbors, radius-based classification discussion; no universal dimensional threshold.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ensemble learning

Ensemble learning combines predictions from several base estimators to improve generalization or robustness.

Sources and details

1.11. Ensembles: Gradient boosting, random forests, bagging, voting, stacking — scikit-learn 1.9.1 documentation

{
  "access_scope": "Opening ensemble overview only; improvement is an objective, not a universal guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:16.921678+00:00"
  },
  "id": "concept-tech-EnsembleLearning::S1",
  "title": "1.11. Ensembles: Gradient boosting, random forests, bagging, voting, stacking — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/ensemble.html"
}

Opening ensemble overview only; improvement is an objective, not a universal guarantee.

Opening ensemble overview only; improvement is an objective, not a universal guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

K-means clustering

K-means divides observations into a chosen number of clusters and represents each cluster by its mean, or centroid.

Sources and details

2.3. Clustering — scikit-learn 1.9.1 documentation

{
  "access_scope": "Clustering section2.3.2, objective, Lloyd iteration and stated assumptions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:16.304398+00:00"
  },
  "id": "concept-tech-KMeans::S1",
  "title": "2.3. Clustering — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/clustering.html#k-means"
}

Clustering section2.3.2, objective, Lloyd iteration and stated assumptions.

Clustering section2.3.2, objective, Lloyd iteration and stated assumptions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Principal component analysis

Principal component analysis represents multivariate data using successive orthogonal components that capture as much variance as possible.

Sources and details

2.5. Decomposing signals in components (matrix factorization problems) — scikit-learn 1.9.1 documentation

{
  "access_scope": "Exact PCA and probabilistic interpretation; implementation-specific preprocessing.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:16.348550+00:00"
  },
  "id": "concept-tech-PCA::S1",
  "title": "2.5. Decomposing signals in components (matrix factorization problems) — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/decomposition.html#pca"
}

Exact PCA and probabilistic interpretation; implementation-specific preprocessing.

Exact PCA and probabilistic interpretation; implementation-specific preprocessing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Support vector machine

Support vector machines support supervised classification, regression and outlier detection.

Sources and details

1.4. Support Vector Machines — scikit-learn 1.9.1 documentation

{
  "access_scope": "Opening Support Vector Machines overview, advantages and disadvantages.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:17.629781+00:00"
  },
  "id": "concept-tech-SVM::S1",
  "title": "1.4. Support Vector Machines — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/modules/svm.html"
}

Opening Support Vector Machines overview, advantages and disadvantages.

Opening Support Vector Machines overview, advantages and disadvantages.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dropout

Dropout randomly removes neural-network units and their connections during training to reduce excessive co-adaptation.

Sources and details

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

{
  "access_scope": "JMLR2014 abstract only; reported benchmark benefits are not a universal performance guarantee.",
  "authors": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "authors_in_source_order": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "dates": {
    "citation_publication_date": "2014",
    "retrieved_utc": "2026-10-07T17:55:13.021052+00:00"
  },
  "id": "concept-tech-Dropout::S1",
  "title": "Dropout: A Simple Way to Prevent Neural Networks from Overfitting",
  "url": "https://jmlr.org/papers/v15/srivastava14a.html"
}

JMLR2014 abstract only; reported benchmark benefits are not a universal performance guarantee.

JMLR2014 abstract only; reported benchmark benefits are not a universal performance guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Embedding

Bengio and colleagues describe learning distributed word representations jointly with probabilities for word sequences.

Their language model generalizes to unseen sequences by assigning higher probability when words have representations near those in previously seen sequences.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "JMLR2003 abstract; one historical word-representation method, not every modern embedding.",
  "authors": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "authors_in_source_order": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T17:55:13.021149+00:00"
  },
  "id": "concept-tech-Embedding::S1",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://jmlr.org/papers/v3/bengio03a.html"
}

JMLR2003 abstract; one historical word-representation method, not every modern embedding.

JMLR2003 abstract; one historical word-representation method, not every modern embedding.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Activation function

Nonlinear activation functions let a multilayer perceptron express relationships that stacked affine transformations alone cannot.

Sources and details

5.1. Multilayer Perceptrons — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L5.1.1.3, From Linear to Nonlinear; no complete survey of activation functions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:20.162520+00:00"
  },
  "id": "concept-tech-ActivationFunction::S1",
  "title": "5.1. Multilayer Perceptrons — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_multilayer-perceptrons/mlp.html"
}

D2L5.1.1.3, From Linear to Nonlinear; no complete survey of activation functions.

D2L5.1.1.3, From Linear to Nonlinear; no complete survey of activation functions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gradient descent

Gradient descent repeatedly moves parameters in the direction opposite the gradient of an objective function.

Sources and details

12.3. Gradient Descent — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L12.3.1 derivation; no guarantee of finding a global optimum.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:10.064463+00:00"
  },
  "id": "concept-tech-GradientDescent::S1",
  "title": "12.3. Gradient Descent — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_optimization/gd.html"
}

D2L12.3.1 derivation; no guarantee of finding a global optimum.

D2L12.3.1 derivation; no guarantee of finding a global optimum.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hyperparameter

Hyperparameters configure a learning procedure or model, including learning rate, batch size, regularization strength and architecture.

Sources and details

19.1. What Is Hyperparameter Optimization? — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L19.1 introduction; hyperparameters distinguished from weights learned during training.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:09.156700+00:00"
  },
  "id": "concept-tech-Hyperparameter::S1",
  "title": "19.1. What Is Hyperparameter Optimization? — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_hyperparameter-optimization/hyperopt-intro.html"
}

D2L19.1 introduction; hyperparameters distinguished from weights learned during training.

D2L19.1 introduction; hyperparameters distinguished from weights learned during training.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Recurrent neural network

A recurrent neural network carries a hidden state that stores information from earlier steps in a sequence.

Sources and details

9.4. Recurrent Neural Networks — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L9.4 introductory hidden-state equations; memory does not imply perfect retention.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:10.596612+00:00"
  },
  "id": "concept-tech-RNN::S1",
  "title": "9.4. Recurrent Neural Networks — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_recurrent-neural-networks/rnn.html"
}

D2L9.4 introductory hidden-state equations; memory does not imply perfect retention.

D2L9.4 introductory hidden-state equations; memory does not imply perfect retention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Regularization

Regularization can discourage an overly flexible model from fitting training data too closely.

Sources and details

3.7. Weight Decay — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L3.7 introduction and Norms and Weight Decay; this is one regularization mechanism.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:10.010225+00:00"
  },
  "id": "concept-tech-Regularization::S1",
  "title": "3.7. Weight Decay — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_linear-regression/weight-decay.html"
}

D2L3.7 introduction and Norms and Weight Decay; this is one regularization mechanism.

D2L3.7 introduction and Norms and Weight Decay; this is one regularization mechanism.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stochastic gradient descent

Stochastic gradient descent estimates an update from a randomly sampled training example instead of calculating the full-data gradient at every iteration.

Sources and details

12.4. Stochastic Gradient Descent — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L12.4.1, equations12.4.1–12.4.4; not a guarantee of every update improving loss.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:10.114449+00:00"
  },
  "id": "concept-tech-SGD::S1",
  "title": "12.4. Stochastic Gradient Descent — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_optimization/sgd.html"
}

D2L12.4.1, equations12.4.1–12.4.4; not a guarantee of every update improving loss.

D2L12.4.1, equations12.4.1–12.4.4; not a guarantee of every update improving loss.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Underfitting

Underfitting can appear when both training and validation errors remain high and the gap between them is small.

Sources and details

3.6. Generalization — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "D2L3.6.2; diagnostic possibility rather than an exhaustive explanation for high error.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:09.591414+00:00"
  },
  "id": "concept-tech-Underfitting::S1",
  "title": "3.6. Generalization — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_linear-regression/generalization.html"
}

D2L3.6.2; diagnostic possibility rather than an exhaustive explanation for high error.

D2L3.6.2; diagnostic possibility rather than an exhaustive explanation for high error.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Perplexity

Perplexity is the exponential of a token sequence’s average negative log-likelihood under an autoregressive language model.

Sources and details

Perplexity of fixed-length models · Hugging Face

{
  "access_scope": "Definition and fixed-length-model discussion in cached main-branch documentation; metric not defined here for masked models.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:26.104796+00:00"
  },
  "id": "concept-tech-Perplexity(metric)::S1",
  "title": "Perplexity of fixed-length models · Hugging Face",
  "url": "https://huggingface.co/docs/transformers/main/en/perplexity"
}

Definition and fixed-length-model discussion in retrieved main-branch documentation; metric not defined here for masked models.

Definition and fixed-length-model discussion in retrieved main-branch documentation; metric not defined here for masked models.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Prompt engineering

Prompt engineering designs and adjusts inputs that guide a language model toward a desired response.

Sources and details

Prompt Engineering for AI Guide | Google Cloud

{
  "access_scope": "Vendor guide definition and context/examples discussion; prompts do not guarantee accuracy or safety.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:08.922285+00:00"
  },
  "id": "concept-tech-PromptEngineering::S1",
  "title": "Prompt Engineering for AI Guide | Google Cloud",
  "url": "https://cloud.google.com/discover/what-is-prompt-engineering"
}

Vendor guide definition and context/examples discussion; prompts do not guarantee accuracy or safety.

Vendor guide definition and context/examples discussion; prompts do not guarantee accuracy or safety.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vector database

A vector database stores numerical representations of data and retrieves entries near a query vector.

Sources and details

How Pinecone Works - Python SDK documentation

{
  "access_scope": "Pinecone vocabulary overview and Dimension and metric; vendor implementation not a rule for every vector store.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:17.686488+00:00"
  },
  "id": "concept-tech-VectorDatabase::S1",
  "title": "How Pinecone Works - Python SDK documentation",
  "url": "https://sdk.pinecone.io/python/guides/concepts.html"
}

Pinecone vocabulary overview and Dimension and metric; vendor implementation not a rule for every vector store.

Pinecone vocabulary overview and Dimension and metric; vendor implementation not a rule for every vector store.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

An economy of emulations

Robin Hanson’s The Age of Em explores an economy built around hypothetical emulations of human brains.

Sources and details

The Age of Em, A Book

{
  "access_scope": "Author book website synopsis and introductory summary; conditional future scenario, not observed capabilities or a verified forecast.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:14.653885+00:00"
  },
  "id": "age-of-em::S1",
  "title": "The Age of Em, A Book",
  "url": "https://ageofem.com/"
}

Author book website synopsis and introductory summary; conditional future scenario, not observed capabilities or a verified forecast.

Author book website synopsis and introductory summary; conditional future scenario, not observed capabilities or a verified forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2016
}

Superintelligence as services

Drexler’s comprehensive AI services proposal treats general intelligence as a collection of task-performing services rather than necessarily a single unified agent.

Sources and details

Reframing superintelligence: comprehensive AI services as general intelligence

{
  "access_scope": "Oxford repository abstract,2019 report; proposed architecture and future argument, not empirical demonstration.",
  "authors": [
    "Drexler, KE"
  ],
  "authors_in_source_order": [
    "Drexler, KE"
  ],
  "dates": {
    "citation_date": "2019",
    "citation_publication_date": "2019",
    "retrieved_utc": "2026-10-07T17:54:34.764396+00:00"
  },
  "id": "ai-services::S1",
  "title": "Reframing superintelligence: comprehensive AI services as general intelligence",
  "url": "https://ora.ox.ac.uk/objects/uuid%3A9c05427a-6390-4b42-9c55-ee45f73a26ad"
}

Oxford repository abstract,2019 report; proposed architecture and future argument, not empirical demonstration.

Oxford repository abstract,2019 report; proposed architecture and future argument, not empirical demonstration.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2019
}

Who receives the returns?

In his March 2021 essay, Sam Altman argues that increasingly capable AI could shift economic power from labor toward capital.

Sources and details

Moore's Law for Everything

{
  "access_scope": "Author essay opening and policy proposal; advocacy and projections, not measured distributional outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:29.231097+00:00"
  },
  "id": "altman-distribution::S1",
  "title": "Moore's Law for Everything",
  "url": "https://moores.samaltman.com/"
}

Author essay opening and policy proposal; advocacy and projections, not measured distributional outcomes.

Author essay opening and policy proposal; advocacy and projections, not measured distributional outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2021
}

A conditional vision of powerful AI

Dario Amodei’s October 2024 essay sketches a positive future conditional on powerful AI developing successfully and its risks being managed.

Sources and details

Dario Amodei — Machines of Loving Grace

{
  "access_scope": "Author essay introduction; conditional vision, not verified forecast or endorsement.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:20.271100+00:00"
  },
  "id": "amodei-vision::S1",
  "title": "Dario Amodei — Machines of Loving Grace",
  "url": "https://darioamodei.com/essay/machines-of-loving-grace"
}

Author essay introduction; conditional vision, not verified forecast or endorsement.

Author essay introduction; conditional vision, not verified forecast or endorsement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

InternLM / Shanghai AI Laboratory

The InternLM 2 report describes pretraining on text, code and long-context data, followed by supervised fine-tuning and preference-based reinforcement learning.

Sources and details

InternLM2 Technical Report

{
  "access_scope": "Displayed abstract only; model-specific method claims, no complete organization history or current benchmark comparison.",
  "authors": [
    "Cai, Zheng",
    "Cao, Maosong",
    "Chen, Haojiong",
    "Chen, Kai",
    "Chen, Keyu",
    "Chen, Xin",
    "Chen, Xun",
    "Chen, Zehui",
    "Chen, Zhi",
    "Chu, Pei",
    "Dong, Xiaoyi",
    "Duan, Haodong",
    "Fan, Qi",
    "Fei, Zhaoye",
    "Gao, Yang",
    "Ge, Jiaye",
    "Gu, Chenya",
    "Gu, Yuzhe",
    "Gui, Tao",
    "Guo, Aijia",
    "Guo, Qipeng",
    "He, Conghui",
    "Hu, Yingfan",
    "Huang, Ting",
    "Jiang, Tao",
    "Jiao, Penglong",
    "Jin, Zhenjiang",
    "Lei, Zhikai",
    "Li, Jiaxing",
    "Li, Jingwen",
    "Li, Linyang",
    "Li, Shuaibin",
    "Li, Wei",
    "Li, Yining",
    "Liu, Hongwei",
    "Liu, Jiangning",
    "Hong, Jiawei",
    "Liu, Kaiwen",
    "Liu, Kuikun",
    "Liu, Xiaoran",
    "Lv, Chengqi",
    "Lv, Haijun",
    "Lv, Kai",
    "Ma, Li",
    "Ma, Runyuan",
    "Ma, Zerun",
    "Ning, Wenchang",
    "Ouyang, Linke",
    "Qiu, Jiantao",
    "Qu, Yuan",
    "Shang, Fukai",
    "Shao, Yunfan",
    "Song, Demin",
    "Song, Zifan",
    "Sui, Zhihao",
    "Sun, Peng",
    "Sun, Yu",
    "Tang, Huanze",
    "Wang, Bin",
    "Wang, Guoteng",
    "Wang, Jiaqi",
    "Wang, Jiayu",
    "Wang, Rui",
    "Wang, Yudong",
    "Wang, Ziyi",
    "Wei, Xingjian",
    "Weng, Qizhen",
    "Wu, Fan",
    "Xiong, Yingtong",
    "Xu, Chao",
    "Xu, Ruiliang",
    "Yan, Hang",
    "Yan, Yirong",
    "Yang, Xiaogui",
    "Ye, Haochen",
    "Ying, Huaiyuan",
    "Yu, Jia",
    "Yu, Jing",
    "Zang, Yuhang",
    "Zhang, Chuyu",
    "Zhang, Li",
    "Zhang, Pan",
    "Zhang, Peng",
    "Zhang, Ruijie",
    "Zhang, Shuo",
    "Zhang, Songyang",
    "Zhang, Wenjian",
    "Zhang, Wenwei",
    "Zhang, Xingcheng",
    "Zhang, Xinyue",
    "Zhao, Hui",
    "Zhao, Qian",
    "Zhao, Xiaomeng",
    "Zhou, Fengzhe",
    "Zhou, Zaida",
    "Zhuo, Jingming",
    "Zou, Yicheng",
    "Qiu, Xipeng",
    "Qiao, Yu",
    "Lin, Dahua"
  ],
  "authors_in_source_order": [
    "Cai, Zheng",
    "Cao, Maosong",
    "Chen, Haojiong",
    "Chen, Kai",
    "Chen, Keyu",
    "Chen, Xin",
    "Chen, Xun",
    "Chen, Zehui",
    "Chen, Zhi",
    "Chu, Pei",
    "Dong, Xiaoyi",
    "Duan, Haodong",
    "Fan, Qi",
    "Fei, Zhaoye",
    "Gao, Yang",
    "Ge, Jiaye",
    "Gu, Chenya",
    "Gu, Yuzhe",
    "Gui, Tao",
    "Guo, Aijia",
    "Guo, Qipeng",
    "He, Conghui",
    "Hu, Yingfan",
    "Huang, Ting",
    "Jiang, Tao",
    "Jiao, Penglong",
    "Jin, Zhenjiang",
    "Lei, Zhikai",
    "Li, Jiaxing",
    "Li, Jingwen",
    "Li, Linyang",
    "Li, Shuaibin",
    "Li, Wei",
    "Li, Yining",
    "Liu, Hongwei",
    "Liu, Jiangning",
    "Hong, Jiawei",
    "Liu, Kaiwen",
    "Liu, Kuikun",
    "Liu, Xiaoran",
    "Lv, Chengqi",
    "Lv, Haijun",
    "Lv, Kai",
    "Ma, Li",
    "Ma, Runyuan",
    "Ma, Zerun",
    "Ning, Wenchang",
    "Ouyang, Linke",
    "Qiu, Jiantao",
    "Qu, Yuan",
    "Shang, Fukai",
    "Shao, Yunfan",
    "Song, Demin",
    "Song, Zifan",
    "Sui, Zhihao",
    "Sun, Peng",
    "Sun, Yu",
    "Tang, Huanze",
    "Wang, Bin",
    "Wang, Guoteng",
    "Wang, Jiaqi",
    "Wang, Jiayu",
    "Wang, Rui",
    "Wang, Yudong",
    "Wang, Ziyi",
    "Wei, Xingjian",
    "Weng, Qizhen",
    "Wu, Fan",
    "Xiong, Yingtong",
    "Xu, Chao",
    "Xu, Ruiliang",
    "Yan, Hang",
    "Yan, Yirong",
    "Yang, Xiaogui",
    "Ye, Haochen",
    "Ying, Huaiyuan",
    "Yu, Jia",
    "Yu, Jing",
    "Zang, Yuhang",
    "Zhang, Chuyu",
    "Zhang, Li",
    "Zhang, Pan",
    "Zhang, Peng",
    "Zhang, Ruijie",
    "Zhang, Shuo",
    "Zhang, Songyang",
    "Zhang, Wenjian",
    "Zhang, Wenwei",
    "Zhang, Xingcheng",
    "Zhang, Xinyue",
    "Zhao, Hui",
    "Zhao, Qian",
    "Zhao, Xiaomeng",
    "Zhou, Fengzhe",
    "Zhou, Zaida",
    "Zhuo, Jingming",
    "Zou, Yicheng",
    "Qiu, Xipeng",
    "Qiao, Yu",
    "Lin, Dahua"
  ],
  "dates": {
    "citation_date": "2024/03/26",
    "inspected_revision": "Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB)",
    "retrieved_utc": "2026-10-07T17:55:29.141698+00:00",
    "version": "arXiv v1"
  },
  "id": "internlm::S1",
  "title": "InternLM2 Technical Report",
  "url": "https://arxiv.org/abs/2403.17297",
  "version_url": "https://arxiv.org/abs/2403.17297v1"
}

Displayed abstract only; model-specific method claims, no complete organization history or current benchmark comparison.

Displayed abstract only; model-specific method claims, no complete organization history or current benchmark comparison.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

MiniMax / long-context models

The MiniMax-01 report combines lightning attention with a mixture-of-experts architecture to process long contexts.

Sources and details

MiniMax-01: Scaling Foundation Models with Lightning Attention

{
  "access_scope": "Displayed abstract only; historical technical report, not current product comparison or complete company audit.",
  "authors": [
    "MiniMax",
    "Li, Aonian",
    "Gong, Bangwei",
    "Yang, Bo",
    "Shan, Boji",
    "Liu, Chang",
    "Zhu, Cheng",
    "Zhang, Chunhao",
    "Guo, Congchao",
    "Chen, Da",
    "Li, Dong",
    "Jiao, Enwei",
    "Li, Gengxin",
    "Zhang, Guojun",
    "Sun, Haohai",
    "Dong, Houze",
    "Zhu, Jiadai",
    "Zhuang, Jiaqi",
    "Song, Jiayuan",
    "Zhu, Jin",
    "Han, Jingtao",
    "Li, Jingyang",
    "Xie, Junbin",
    "Xu, Junhao",
    "Yan, Junjie",
    "Zhang, Kaishun",
    "Xiao, Kecheng",
    "Kang, Kexi",
    "Han, Le",
    "Wang, Leyang",
    "Yu, Lianfei",
    "Feng, Liheng",
    "Zheng, Lin",
    "Chai, Linbo",
    "Xing, Long",
    "Ju, Meizhi",
    "Chi, Mingyuan",
    "Zhang, Mozhi",
    "Huang, Peikai",
    "Niu, Pengcheng",
    "Li, Pengfei",
    "Zhao, Pengyu",
    "Yang, Qi",
    "Xu, Qidi",
    "Wang, Qiexiang",
    "Wang, Qin",
    "Li, Qiuhui",
    "Leng, Ruitao",
    "Shi, Shengmin",
    "Yu, Shuqi",
    "Li, Sichen",
    "Zhu, Songquan",
    "Huang, Tao",
    "Liang, Tianrun",
    "Sun, Weigao",
    "Sun, Weixuan",
    "Cheng, Weiyu",
    "Li, Wenkai",
    "Song, Xiangjun",
    "Su, Xiao",
    "Han, Xiaodong",
    "Zhang, Xinjie",
    "Hou, Xinzhu",
    "Min, Xu",
    "Zou, Xun",
    "Shen, Xuyang",
    "Gong, Yan",
    "Zhu, Yingjie",
    "Zhou, Yipeng",
    "Zhong, Yiran",
    "Hu, Yongyi",
    "Fan, Yuanxiang",
    "Yu, Yue",
    "Yang, Yufeng",
    "Li, Yuhao",
    "Huang, Yunan",
    "Li, Yunji",
    "Huang, Yunpeng",
    "Xu, Yunzhi",
    "Mao, Yuxin",
    "Li, Zehan",
    "Li, Zekang",
    "Tao, Zewei",
    "Ying, Zewen",
    "Cong, Zhaoyang",
    "Qin, Zhen",
    "Fan, Zhenhua",
    "Yu, Zhihang",
    "Jiang, Zhuo",
    "Wu, Zijia"
  ],
  "authors_in_source_order": [
    "MiniMax",
    "Li, Aonian",
    "Gong, Bangwei",
    "Yang, Bo",
    "Shan, Boji",
    "Liu, Chang",
    "Zhu, Cheng",
    "Zhang, Chunhao",
    "Guo, Congchao",
    "Chen, Da",
    "Li, Dong",
    "Jiao, Enwei",
    "Li, Gengxin",
    "Zhang, Guojun",
    "Sun, Haohai",
    "Dong, Houze",
    "Zhu, Jiadai",
    "Zhuang, Jiaqi",
    "Song, Jiayuan",
    "Zhu, Jin",
    "Han, Jingtao",
    "Li, Jingyang",
    "Xie, Junbin",
    "Xu, Junhao",
    "Yan, Junjie",
    "Zhang, Kaishun",
    "Xiao, Kecheng",
    "Kang, Kexi",
    "Han, Le",
    "Wang, Leyang",
    "Yu, Lianfei",
    "Feng, Liheng",
    "Zheng, Lin",
    "Chai, Linbo",
    "Xing, Long",
    "Ju, Meizhi",
    "Chi, Mingyuan",
    "Zhang, Mozhi",
    "Huang, Peikai",
    "Niu, Pengcheng",
    "Li, Pengfei",
    "Zhao, Pengyu",
    "Yang, Qi",
    "Xu, Qidi",
    "Wang, Qiexiang",
    "Wang, Qin",
    "Li, Qiuhui",
    "Leng, Ruitao",
    "Shi, Shengmin",
    "Yu, Shuqi",
    "Li, Sichen",
    "Zhu, Songquan",
    "Huang, Tao",
    "Liang, Tianrun",
    "Sun, Weigao",
    "Sun, Weixuan",
    "Cheng, Weiyu",
    "Li, Wenkai",
    "Song, Xiangjun",
    "Su, Xiao",
    "Han, Xiaodong",
    "Zhang, Xinjie",
    "Hou, Xinzhu",
    "Min, Xu",
    "Zou, Xun",
    "Shen, Xuyang",
    "Gong, Yan",
    "Zhu, Yingjie",
    "Zhou, Yipeng",
    "Zhong, Yiran",
    "Hu, Yongyi",
    "Fan, Yuanxiang",
    "Yu, Yue",
    "Yang, Yufeng",
    "Li, Yuhao",
    "Huang, Yunan",
    "Li, Yunji",
    "Huang, Yunpeng",
    "Xu, Yunzhi",
    "Mao, Yuxin",
    "Li, Zehan",
    "Li, Zekang",
    "Tao, Zewei",
    "Ying, Zewen",
    "Cong, Zhaoyang",
    "Qin, Zhen",
    "Fan, Zhenhua",
    "Yu, Zhihang",
    "Jiang, Zhuo",
    "Wu, Zijia"
  ],
  "dates": {
    "citation_date": "2025/01/14",
    "inspected_revision": "Tue, 14 Jan 2025 18:50:05 UTC (4,318 KB)",
    "retrieved_utc": "2026-10-07T17:56:36.110273+00:00",
    "version": "arXiv v1"
  },
  "id": "minimax::S1",
  "title": "MiniMax-01: Scaling Foundation Models with Lightning Attention",
  "url": "https://arxiv.org/abs/2501.08313",
  "version_url": "https://arxiv.org/abs/2501.08313v1"
}

Displayed abstract only; historical technical report, not current product comparison or complete company audit.

Displayed abstract only; historical technical report, not current product comparison or complete company audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2025
}

Alibaba Qwen / open model family

The Qwen-VL paper adds visual processing to a language-model foundation through a visual receptor, input-output interface and staged training.

Sources and details

Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond

{
  "access_scope": "Qwen-VL displayed abstract only; selected vision-language work, not all Qwen systems or company history.",
  "authors": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Yang, Shusheng",
    "Wang, Shijie",
    "Tan, Sinan",
    "Wang, Peng",
    "Lin, Junyang",
    "Zhou, Chang",
    "Zhou, Jingren"
  ],
  "authors_in_source_order": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Yang, Shusheng",
    "Wang, Shijie",
    "Tan, Sinan",
    "Wang, Peng",
    "Lin, Junyang",
    "Zhou, Chang",
    "Zhou, Jingren"
  ],
  "dates": {
    "citation_date": "2023/08/24",
    "inspected_revision": "Fri, 13 Oct 2023 02:41:28 UTC (5,291 KB)",
    "retrieved_utc": "2026-10-07T18:19:39.799009+00:00",
    "version": "arXiv v3"
  },
  "id": "qwen::S1",
  "title": "Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond",
  "url": "https://arxiv.org/abs/2308.12966",
  "version_url": "https://arxiv.org/abs/2308.12966v3"
}

Qwen-VL displayed abstract only; selected vision-language work, not all Qwen systems or company history.

Qwen-VL displayed abstract only; selected vision-language work, not all Qwen systems or company history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Assistance on the support floor

The customer-support study examines a staggered introduction of a conversational AI assistant among 5,172 agents.

Its inspected revision reports a 15 percent average increase in issues resolved per hour, with larger benefits for less experienced or lower-skilled workers.

The most experienced and highest-skilled workers showed small speed gains alongside small declines in quality.

Sources and details

Generative AI at Work

{
  "access_scope": "Displayed abstract of inspected arXiv revision; setting-specific productivity measure, no economy-wide extrapolation.",
  "authors": [
    "Brynjolfsson, Erik",
    "Li, Danielle",
    "Raymond, Lindsey"
  ],
  "authors_in_source_order": [
    "Brynjolfsson, Erik",
    "Li, Danielle",
    "Raymond, Lindsey"
  ],
  "dates": {
    "citation_date": "2023/04/23",
    "inspected_revision": "Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB)",
    "retrieved_utc": "2026-10-07T18:20:41.095680+00:00",
    "version": "arXiv v2"
  },
  "id": "support-field-study::S1",
  "title": "Generative AI at Work",
  "url": "https://arxiv.org/abs/2304.11771",
  "version_url": "https://arxiv.org/abs/2304.11771v2"
}

Displayed abstract of inspected arXiv revision; setting-specific productivity measure, no economy-wide extrapolation.

Displayed abstract of inspected arXiv revision; setting-specific productivity measure, no economy-wide extrapolation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

From task savings to macro gains

Acemoglu’s task-based analysis links aggregate productivity effects to the share of tasks affected and their average cost savings.

Sources and details

The Simple Macroeconomics of AI

{
  "access_scope": "NBER Working Paper32487 summary, May2024; model-based argument, not observed future GDP growth.",
  "authors": [
    "Daron Acemoglu"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu"
  ],
  "dates": {
    "citation_publication_date": "2024/05/27",
    "retrieved_utc": "2026-10-07T17:58:34.661816+00:00"
  },
  "id": "macro-ai::S1",
  "title": "The Simple Macroeconomics of AI",
  "url": "https://www.nber.org/papers/w32487"
}

NBER Working Paper32487 summary, May2024; model-based argument, not observed future GDP growth.

NBER Working Paper32487 summary, May2024; model-based argument, not observed future GDP growth.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

When coding assistance slows work

METR’s early 2025 trial randomly allowed or disallowed AI assistance on 246 real issues supplied by 16 experienced open-source developers.

Developers took 19 percent longer when AI use was allowed in that particular setting.

METR now labels those historical results out of date and says they no longer reflect the current impact of AI on open-source developer productivity.

Sources and details

Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity

{
  "access_scope": "July10,2025 report, Methodology/Core Result plus prominently displayed later update; historical result not current developer-wide estimate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "citation_date": "2025/07/10",
    "retrieved_utc": "2026-10-07T17:57:52.556820+00:00"
  },
  "id": "metr-coding::S1",
  "title": "Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity",
  "url": "https://metr.org/blog/2025-07-10-early-2025-ai-experienced-os-dev-study/"
}

July10,2025 report, Methodology/Core Result plus prominently displayed later update; historical result not current developer-wide estimate.

July10,2025 report, Methodology/Core Result plus prominently displayed later update; historical result not current developer-wide estimate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2025
}

The World Wide Web

CERN dates Tim Berners-Lee’s invention of the World Wide Web to 1989 and describes its initial purpose as information-sharing among researchers.

Sources and details

The birth of the Web – Home | CERN

{
  "access_scope": "CERN institutional historical account; Web distinct from Internet infrastructure.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:29.747254+00:00"
  },
  "id": "web::S1",
  "title": "The birth of the Web – Home | CERN",
  "url": "https://home.cern/science/computing/the-birth-of-the-web/"
}

CERN institutional historical account; Web distinct from Internet infrastructure.

CERN institutional historical account; Web distinct from Internet infrastructure.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1989
}

Faster writing in an experiment

Noy and Zhang’s March 2023 working paper studies ChatGPT on occupation-specific writing tasks assigned to 444 college-educated professionals.

Half the participants were randomly exposed to the tool, and the abstract reports lower completion time and higher output quality on average.

Sources and details

Faster writing in an experiment source

{
  "access_scope": "March2,2023 working-paper abstract explicitly marked not peer reviewed; not substituted with later published estimates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:21:31.407049+00:00"
  },
  "id": "writing-experiment::S1",
  "title": "Faster writing in an experiment source",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Noy_Zhang_1.pdf"
}

March2,2023 working-paper abstract explicitly marked not peer reviewed; not substituted with later published estimates.

March2,2023 working-paper abstract explicitly marked not peer reviewed; not substituted with later published estimates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

fast.ai

fast.ai describes its goal as making deep learning easier to use and accessible to people from varied backgrounds.

Sources and details

About – fast.ai

{
  "access_scope": "Institutional About opening only; self-described mission and activities, no audit of educational impact or expansive founder-influence claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:52.502527+00:00"
  },
  "id": "organization-ai-032a62614fb859::S1",
  "title": "About – fast.ai",
  "url": "https://www.fast.ai/about.html"
}

Institutional About opening only; self-described mission and activities, no audit of educational impact or expansive founder-influence claims.

Institutional About opening only; self-described mission and activities, no audit of educational impact or expansive founder-influence claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Distributed AI Research Institute

DAIR describes itself as an independent, globally distributed organization conducting community-rooted research.

Sources and details

DAIR Institute | DAIR

{
  "access_scope": "Official institutional description and research areas; stated agenda, not independently measured outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:10.337954+00:00"
  },
  "id": "organization-ai-209f84d1f12926::S1",
  "title": "DAIR Institute | DAIR",
  "url": "https://www.dair-institute.org/"
}

Official institutional description and research areas; stated agenda, not independently measured outcomes.

Official institutional description and research areas; stated agenda, not independently measured outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Modular

Modular presents a unified inference stack spanning hardware kernels, model serving and cloud deployment.

Sources and details

Modular: Inference from Kernel to Cloud

{
  "access_scope": "Official platform description; capability positioning, no independent speed/cost comparison, ownership or current legal-status audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:34.570149+00:00"
  },
  "id": "organization-ai-50678f008324fc::S1",
  "title": "Modular: Inference from Kernel to Cloud",
  "url": "https://www.modular.com/"
}

Official platform description; capability positioning, no independent speed/cost comparison, ownership or current legal-status audit.

Official platform description; capability positioning, no independent speed/cost comparison, ownership or current legal-status audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Waabi

Waabi describes a physical-AI platform intended to support autonomous trucks and robotaxis with a shared model.

Sources and details

Waabi Self Driving Trucks and Robotaxis

{
  "access_scope": "Official technology description; company claims, not independently verified safety or deployment performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:01.488948+00:00"
  },
  "id": "organization-ai-70ed445fdcbf08::S1",
  "title": "Waabi Self Driving Trucks and Robotaxis",
  "url": "https://waabi.ai/"
}

Official technology description; company claims, not independently verified safety or deployment performance.

Official technology description; company claims, not independently verified safety or deployment performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Alignment Research Center

The Alignment Research Center describes its mission as aligning future machine-learning systems with human interests.

Sources and details

Alignment Research Center

{
  "access_scope": "Official mission and What we are working on; research aim not demonstrated general alignment solution.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:02.912494+00:00"
  },
  "id": "organization-ai-9f292d777068ee::S1",
  "title": "Alignment Research Center",
  "url": "https://www.alignment.org/"
}

Official mission and What we are working on; research aim not demonstrated general alignment solution.

Official mission and What we are working on; research aim not demonstrated general alignment solution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

BigScience

The BLOOM model card credits BigScience as the developer and describes contributors as volunteers or participants working under employer agreements.

Sources and details

bigscience/bloom · Hugging Face

{
  "access_scope": "BLOOM model-card basics and compute infrastructure, version1.3/July6,2022; project-specific collective credit, no complete contributor or funding audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:47.412268+00:00"
  },
  "id": "organization-ai-ac2a761671cb4e::S1",
  "title": "bigscience/bloom · Hugging Face",
  "url": "https://huggingface.co/bigscience/bloom"
}

BLOOM model-card basics and compute infrastructure, version1.3/July6,2022; project-specific collective credit, no complete contributor or funding audit.

BLOOM model-card basics and compute infrastructure, version1.3/July6,2022; project-specific collective credit, no complete contributor or funding audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

MIRI

MIRI’s website argues that developing artificial superintelligence with approaches resembling current methods poses a severe risk of human extinction.

Sources and details

The Machine Intelligence Research Institute (MIRI)

{
  "access_scope": "Official Our view section; institution’s risk judgment and advocacy, not an established extinction probability or consensus claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:48.344018+00:00"
  },
  "id": "organization-ai-b2cd996079c20b::S1",
  "title": "The Machine Intelligence Research Institute (MIRI)",
  "url": "https://intelligence.org/"
}

Official Our view section; institution’s risk judgment and advocacy, not an established extinction probability or consensus claim.

Official Our view section; institution’s risk judgment and advocacy, not an established extinction probability or consensus claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

EleutherAI

EleutherAI’s GPT-NeoX repository supplies a library for training large language models on GPUs.

Sources and details

GitHub - EleutherAI/gpt-neox: An implementation of model parallel autoregressive transformers on GPUs, based on the Megatron and DeepSpeed libraries · GitHub

{
  "access_scope": "Repository README opening; one maintained project, no complete organizational history or current comparative benchmark.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:42.202805+00:00"
  },
  "id": "organization-ai-f84796b58d8930::S1",
  "title": "GitHub - EleutherAI/gpt-neox: An implementation of model parallel autoregressive transformers on GPUs, based on the Megatron and DeepSpeed libraries · GitHub",
  "url": "https://github.com/EleutherAI/gpt-neox"
}

Repository README opening; one maintained project, no complete organizational history or current comparative benchmark.

Repository README opening; one maintained project, no complete organizational history or current comparative benchmark.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

TypeSafe AI

TypeSafe AI’s September 2026 announcement introduces Jev as a model designed to produce structured probabilistic decisions for software.

Sources and details

Introducing System One Models & Jev - TypeSafe AI Blog

{
  "access_scope": "Official launch announcement, September15,2026; vendor architecture description, no independent no-hallucination or speed guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:00.937181+00:00"
  },
  "id": "organization-ai-typesafe::S1",
  "title": "Introducing System One Models & Jev - TypeSafe AI Blog",
  "url": "https://typesafe.ai/blog/introducing-system-one-models-and-jev"
}

Official launch announcement, September15,2026; vendor architecture description, no independent no-hallucination or speed guarantee.

Official launch announcement, September15,2026; vendor architecture description, no independent no-hallucination or speed guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Lam Research

Lam Research describes deposition as forming insulating or conducting layers and etching as selectively removing material to create chip features.

Sources and details

Our Processes | Lam Research

{
  "access_scope": "Official process overview and Deposition/Etch; process descriptions, not market-share or independent precision/performance claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:30.646691+00:00"
  },
  "id": "supply-org-018::S1",
  "title": "Our Processes | Lam Research",
  "url": "https://www.lamresearch.com/products/our-processes/"
}

Official process overview and Deposition/Etch; process descriptions, not market-share or independent precision/performance claims.

Official process overview and Deposition/Etch; process descriptions, not market-share or independent precision/performance claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Ashby’s law of requisite variety

Ashby relates a regulator’s available responses to the disturbances it can counter: reducing the variety of outcomes requires sufficient variety in the regulator.

His argument develops this constraint through a formal table of disturbances, responses and outcomes.

Sources and details

An Introduction to Cybernetics

{
  "access_scope": "An Introduction to Cybernetics, chapter 11, requisite-variety argument; mathematical regulation model, not a universal prescription for organizational complexity.",
  "authors": [
    "W. Ross Ashby"
  ],
  "authors_in_source_order": [
    "W. Ross Ashby"
  ],
  "dates": {
    "inspected_reproduction": "1999 electronic reproduction",
    "publication_year": "1956",
    "retrieved_utc": "2026-10-07T17:54:16.913039+00:00"
  },
  "id": "concept-law-ashby::S1",
  "title": "An Introduction to Cybernetics",
  "url": "https://ashby.info/Ashby-Introduction-to-Cybernetics.pdf"
}

An Introduction to Cybernetics, chapter 11, requisite-variety argument; mathematical regulation model, not a universal prescription for organizational complexity.

An Introduction to Cybernetics, chapter 11, requisite-variety argument; mathematical regulation model, not a universal prescription for organizational complexity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bell’s law of computer classes

Gordon Bell defines a computer class through a price range, programming environment and the applications it supports.

His account of emerging classes combines new hardware platforms with software environments, networks and interfaces.

Sources and details

Bell’s Law for the Birth and Death of Computer Classes

{
  "access_scope": "January 2008 article, opening definition and class-formation theory; an historical explanatory theory, not a guaranteed forecast.",
  "authors": [
    "Gordon Bell"
  ],
  "authors_in_source_order": [
    "Gordon Bell"
  ],
  "dates": {
    "publication_date": "January 2008",
    "retrieved_utc": "2026-10-07T17:54:25.035918+00:00"
  },
  "id": "concept-law-bell::S1",
  "title": "Bell’s Law for the Birth and Death of Computer Classes",
  "url": "https://gordonbell.azurewebsites.net/cacm%20bell%27s%20law%20vol%2051.%202008-january.pdf"
}

January 2008 article, opening definition and class-formation theory; an historical explanatory theory, not a guaranteed forecast.

January 2008 article, opening definition and class-formation theory; an historical explanatory theory, not a guaranteed forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pareto Principle

Juran describes a recurring concentration pattern: relatively few contributors account for the bulk of a common effect.

In his 1974 retrospective, he acknowledges mistakenly attaching Pareto’s name to this broader principle, while observing that the label persisted.

Sources and details

The Non-Pareto Principle; Mea Culpa

{
  "access_scope": "The Non-Pareto Principle; Mea Culpa, original article opening; not a universal exact 80/20 ratio or the reprint’s editorial sidebar.",
  "authors": [
    "Joseph M. Juran"
  ],
  "authors_in_source_order": [
    "Joseph M. Juran"
  ],
  "dates": {
    "inspected_version": "Juran Institute archival reprint",
    "publication_year": "1974",
    "retrieved_utc": "2026-10-07T17:54:54.433210+00:00"
  },
  "id": "concept-law-pareto::S1",
  "title": "The Non-Pareto Principle; Mea Culpa",
  "url": "https://www.juran.com/wp-content/uploads/2021/03/The-Non-Pareto-Principle-1974.pdf"
}

The Non-Pareto Principle; Mea Culpa, original article opening; not a universal exact 80/20 ratio or the reprint’s editorial sidebar.

The Non-Pareto Principle; Mea Culpa, original article opening; not a universal exact 80/20 ratio or the reprint’s editorial sidebar.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tesler’s law of conservation of complexity

Tesler’s design principle asks who handles an application’s irreducible complexity: the user, the application developer or the platform developer.

Moving that burden into software can simplify the user’s task without eliminating the underlying complexity.

Sources and details

The Law of Conservation of Complexity (Tesler's Law) — Larry Tesler

{
  "access_scope": "Personal formulation and accompanying discussion; a design heuristic rather than a physical conservation law.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:58.227402+00:00"
  },
  "id": "concept-law-tesler::S1",
  "title": "The Law of Conservation of Complexity (Tesler's Law) — Larry Tesler",
  "url": "https://www.nomodes.com/larry-tesler-consulting/complexity-law"
}

Personal formulation and accompanying discussion; a design heuristic rather than a physical conservation law.

Personal formulation and accompanying discussion; a design heuristic rather than a physical conservation law.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

AI safety

NIST’s 2023 framework treats AI safety as avoiding threats to human life, health, property or the environment under defined conditions.

It calls for risk management tailored to context and severity, supported by responsible design, testing, monitoring and opportunities for human intervention.

Sources and details

Artificial Intelligence Risk Management Framework (AI RMF 1.0)

{
  "access_scope": "AI RMF 1.0, section 3.2 Safe; January 2023 framework, not a compliance determination or direct inspection of the ISO definition it cites.",
  "authors": [
    "National Institute of Standards and Technology"
  ],
  "authors_in_source_order": [
    "National Institute of Standards and Technology"
  ],
  "dates": {
    "publication_date": "January 2023",
    "retrieved_utc": "2026-10-07T17:54:31.879582+00:00",
    "version": "NIST AI 100-1 / AI RMF 1.0"
  },
  "id": "concept-tech-AISafety::S1",
  "title": "Artificial Intelligence Risk Management Framework (AI RMF 1.0)",
  "url": "https://nvlpubs.nist.gov/nistpubs/ai/NIST.AI.100-1.pdf"
}

AI RMF 1.0, section 3.2 Safe; January 2023 framework, not a compliance determination or direct inspection of the ISO definition it cites.

AI RMF 1.0, section 3.2 Safe; January 2023 framework, not a compliance determination or direct inspection of the ISO definition it cites.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Explainable AI

NIST’s explainability report distinguishes providing an explanation from making it understandable to its intended audience.

Its other principles require explanations to reflect the system’s actual process and systems to respect the conditions and confidence limits under which they operate.

Sources and details

Four Principles of Explainable Artificial Intelligence

{
  "access_scope": "NISTIR 8312, four principles and audience discussion; principles for explanations, not a guarantee that a particular model is faithful or safe.",
  "authors": [
    "P. Jonathon Phillips",
    "Carina A. Hahn",
    "Peter C. Fontana",
    "Amy N. Yates",
    "Kristen Greene",
    "David A. Broniatowski",
    "Mark A. Przybocki"
  ],
  "authors_in_source_order": [
    "P. Jonathon Phillips",
    "Carina A. Hahn",
    "Peter C. Fontana",
    "Amy N. Yates",
    "Kristen Greene",
    "David A. Broniatowski",
    "Mark A. Przybocki"
  ],
  "dates": {
    "publication_date": "September 2021",
    "retrieved_utc": "2026-10-07T17:55:11.194406+00:00",
    "version": "NISTIR 8312"
  },
  "id": "concept-tech-ExplainableAI::S1",
  "title": "Four Principles of Explainable Artificial Intelligence",
  "url": "https://doi.org/10.6028/NIST.IR.8312"
}

NISTIR 8312, four principles and audience discussion; principles for explanations, not a guarantee that a particular model is faithful or safe.

NISTIR 8312, four principles and audience discussion; principles for explanations, not a guarantee that a particular model is faithful or safe.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Causal inference

Pearl, Glymour and Jewell frame causal inference around estimating how actions and policies change outcomes.

Their discussion of Simpson’s paradox shows how an association in a whole population can reverse within every subgroup, motivating care when moving from statistical patterns to causal conclusions.

Sources and details

Causal Inference in Statistics: A Primer

{
  "access_scope": "Causal Inference in Statistics: A Primer, chapter 1, sections 1.1–1.2; illustrative statistical reasoning, not an empirical intervention result.",
  "authors": [
    "Judea Pearl",
    "Madelyn Glymour",
    "Nicholas P. Jewell"
  ],
  "authors_in_source_order": [
    "Judea Pearl",
    "Madelyn Glymour",
    "Nicholas P. Jewell"
  ],
  "dates": {
    "publication_year": "2016",
    "retrieved_utc": "2026-10-07T17:54:17.031290+00:00",
    "version": "First edition, chapter 1 extract"
  },
  "id": "concept-tech-CausalInference::S1",
  "title": "Causal Inference in Statistics: A Primer",
  "url": "https://bayes.cs.ucla.edu/PRIMER/primer-ch1.pdf"
}

Causal Inference in Statistics: A Primer, chapter 1, sections 1.1–1.2; illustrative statistical reasoning, not an empirical intervention result.

Causal Inference in Statistics: A Primer, chapter 1, sections 1.1–1.2; illustrative statistical reasoning, not an empirical intervention result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Monte Carlo tree search

Kocsis and Szepesvári’s UCT algorithm uses bandit ideas to guide Monte-Carlo planning in large Markov decision problems.

Its introduction describes sampling possible future states through a generative model to build a lookahead search tree.

Sources and details

Bandit based Monte-Carlo Planning

{
  "access_scope": "Bandit based Monte-Carlo Planning, abstract and introduction; one planning algorithm and its assumptions, not every Monte-Carlo tree-search method.",
  "authors": [
    "Levente Kocsis",
    "Csaba Szepesvári"
  ],
  "authors_in_source_order": [
    "Levente Kocsis",
    "Csaba Szepesvári"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:18.243620+00:00"
  },
  "id": "concept-tech-MCTS::S1",
  "title": "Bandit based Monte-Carlo Planning",
  "url": "https://sites.ualberta.ca/~szepesva/papers/ecml06.pdf"
}

Bandit based Monte-Carlo Planning, abstract and introduction; one planning algorithm and its assumptions, not every Monte-Carlo tree-search method.

Bandit based Monte-Carlo Planning, abstract and introduction; one planning algorithm and its assumptions, not every Monte-Carlo tree-search method.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Long short-term memory

Hochreiter and Schmidhuber introduce LSTM to address decaying error signals when recurrent networks learn dependencies across long intervals.

Special memory units preserve error flow, while learned gates open and close access to that flow.

Sources and details

Long Short-Term Memory

{
  "access_scope": "1997 paper, abstract; mechanism summary, not a guarantee of retaining every dependency or a full audit of its artificial-task experiments.",
  "authors": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "authors_in_source_order": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "dates": {
    "publication_year": "1997",
    "retrieved_utc": "2026-10-07T17:55:20.342140+00:00",
    "version": "Neural Computation 9(8):1735–1780"
  },
  "id": "concept-tech-LSTM::S1",
  "title": "Long Short-Term Memory",
  "url": "https://www.bioinf.jku.at/publications/older/2604.pdf"
}

1997 paper, abstract; mechanism summary, not a guarantee of retaining every dependency or a full audit of its artificial-task experiments.

1997 paper, abstract; mechanism summary, not a guarantee of retaining every dependency or a full audit of its artificial-task experiments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Policy gradient methods

The policy-gradient paper represents a policy with its own function approximator and updates its parameters along the gradient of expected reward.

It shows how approximate action values or advantages can help estimate that gradient from experience.

Sources and details

Policy Gradient Methods for Reinforcement Learning with Function Approximation

{
  "access_scope": "1999 proceedings abstract; the paper’s formulation, not a claim of global optimality for arbitrary modern implementations.",
  "authors": [
    "Sutton, Richard S.",
    "McAllester, David",
    "Singh, Satinder",
    "Mansour, Yishay"
  ],
  "authors_in_source_order": [
    "Sutton, Richard S.",
    "McAllester, David",
    "Singh, Satinder",
    "Mansour, Yishay"
  ],
  "dates": {
    "citation_publication_date": "1999",
    "retrieved_utc": "2026-10-07T17:55:15.878725+00:00"
  },
  "id": "concept-tech-PolicyGradient::S1",
  "title": "Policy Gradient Methods for Reinforcement Learning with Function Approximation",
  "url": "https://proceedings.nips.cc/paper_files/paper/1999/hash/464d828b85b0bed98e80ade0a5c43b0f-Abstract.html"
}

1999 proceedings abstract; the paper’s formulation, not a claim of global optimality for arbitrary modern implementations.

1999 proceedings abstract; the paper’s formulation, not a claim of global optimality for arbitrary modern implementations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Q-learning

Q-learning incrementally improves estimates of the quality of taking particular actions in particular states.

Watkins and Dayan’s convergence result assumes discrete action-value representations and repeated sampling of all actions in all states.

Sources and details

Q-learning

{
  "access_scope": "1992 article abstract only; conditional convergence result, not a guarantee for deep function approximation or finite-time training.",
  "authors": [
    "Watkins, Christopher J. C. H.",
    "Dayan, Peter"
  ],
  "authors_in_source_order": [
    "Watkins, Christopher J. C. H.",
    "Dayan, Peter"
  ],
  "dates": {
    "citation_publication_date": "1992/05",
    "retrieved_utc": "2026-10-07T17:55:13.476179+00:00"
  },
  "id": "concept-tech-QLearning::S1",
  "title": "Q-learning",
  "url": "https://link.springer.com/article/10.1007/BF00992698"
}

1992 article abstract only; conditional convergence result, not a guarantee for deep function approximation or finite-time training.

1992 article abstract only; conditional convergence result, not a guarantee for deep function approximation or finite-time training.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bellman equation

A state’s value under a policy is its expected return when the agent starts there and follows that policy.

The Bellman equation relates this value to expected immediate reward and discounted values of successor states.

Sources and details

Reinforcement Learning: An Introduction — Second edition, in progress

{
  "access_scope": "Sutton/Barto second edition in progress,2014/2015 frontmatter, section 3.7 and equation 3.12; fixed-policy value relationship, not the final 2018 edition.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00",
    "version": "Second edition in progress; frontmatter copyright 2014,2015"
  },
  "id": "concept-tech-BellmanEquation::S1",
  "title": "Reinforcement Learning: An Introduction — Second edition, in progress",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

Sutton/Barto second edition in progress,2014/2015 frontmatter, section 3.7 and equation 3.12; fixed-policy value relationship, not the final 2018 edition.

Sutton/Barto second edition in progress,2014/2015 frontmatter, section 3.7 and equation 3.12; fixed-policy value relationship, not the final 2018 edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Markov decision process

A Markov decision process models a reinforcement-learning task in which the current state supplies the relevant information for predicting what follows an action.

For a finite MDP, state and action sets plus the probabilities of next-state and reward pairs specify the environment’s one-step dynamics.

Sources and details

Reinforcement Learning: An Introduction — Second edition, in progress

{
  "access_scope": "Sutton/Barto 2014/2015 draft, section 3.6, with Markov-property context; a modeling assumption rather than a claim that every real environment is fully observed.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00",
    "version": "Second edition in progress; frontmatter copyright 2014,2015"
  },
  "id": "concept-tech-MDP::S1",
  "title": "Reinforcement Learning: An Introduction — Second edition, in progress",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

Sutton/Barto 2014/2015 draft, section 3.6, with Markov-property context; a modeling assumption rather than a claim that every real environment is fully observed.

Sutton/Barto 2014/2015 draft, section 3.6, with Markov-property context; a modeling assumption rather than a claim that every real environment is fully observed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reward function

In reinforcement learning, the environment sends a numerical reward signal that formalizes the agent’s goal.

The objective concerns cumulative reward over time, rather than simply maximizing the next immediate reward.

Sources and details

Reinforcement Learning: An Introduction — Second edition, in progress

{
  "access_scope": "Sutton/Barto 2014/2015 draft, section 3.2; reward formulation and long-run objective, not a guarantee that a chosen proxy expresses human intentions.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00",
    "version": "Second edition in progress; frontmatter copyright 2014,2015"
  },
  "id": "concept-tech-RewardFunction::S1",
  "title": "Reinforcement Learning: An Introduction — Second edition, in progress",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

Sutton/Barto 2014/2015 draft, section 3.2; reward formulation and long-run objective, not a guarantee that a chosen proxy expresses human intentions.

Sutton/Barto 2014/2015 draft, section 3.2; reward formulation and long-run objective, not a guarantee that a chosen proxy expresses human intentions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Multi-head attention

Multi-head attention applies different learned projections to queries, keys and values, then runs several attention operations in parallel.

The outputs are concatenated and projected again, allowing the model to attend across different representation subspaces and positions.

Sources and details

Attention Is All You Need

{
  "access_scope": "Attention Is All You Need, inspected arXiv HTMLv 7, section 3.2.2; original architecture mechanism, not an interpretation of what individual heads mean.",
  "authors": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "authors_in_source_order": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:07.954659+00:00",
    "version": "arXiv 1706.03762 v 7, HTML representation"
  },
  "id": "concept-tech-MultiHeadAttention::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/html/1706.03762v7"
}

Attention Is All You Need, inspected arXiv HTMLv 7, section 3.2.2; original architecture mechanism, not an interpretation of what individual heads mean.

Attention Is All You Need, inspected arXiv HTMLv 7, section 3.2.2; original architecture mechanism, not an interpretation of what individual heads mean.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Self-attention

In the Transformer encoder, self-attention takes queries, keys and values from the same preceding layer, letting each position attend across the sequence.

Decoder self-attention masks future positions so generation retains its autoregressive structure.

Sources and details

Attention Is All You Need

{
  "access_scope": "Attention Is All You Need, HTMLv 7, section 3.2.3; encoder and masked-decoder distinction, not every later attention architecture.",
  "authors": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "authors_in_source_order": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:07.954659+00:00",
    "version": "arXiv 1706.03762 v 7, HTML representation"
  },
  "id": "concept-tech-SelfAttention::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/html/1706.03762v7"
}

Attention Is All You Need, HTMLv 7, section 3.2.3; encoder and masked-decoder distinction, not every later attention architecture.

Attention Is All You Need, HTMLv 7, section 3.2.3; encoder and masked-decoder distinction, not every later attention architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Positional encoding

The original Transformer adds positional encodings to token embeddings to supply sequence-order information without recurrence or convolution.

The paper uses sine and cosine functions at different frequencies while also recognizing learned encodings as an alternative.

Sources and details

Attention Is All You Need

{
  "access_scope": "Attention Is All You Need, HTMLv 7, section 3.5; that paper’s positional representation, not all modern model implementations.",
  "authors": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "authors_in_source_order": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:07.954659+00:00",
    "version": "arXiv 1706.03762 v 7, HTML representation"
  },
  "id": "concept-tech-PositionalEncoding::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/html/1706.03762v7"
}

Attention Is All You Need, HTMLv 7, section 3.5; that paper’s positional representation, not all modern model implementations.

Attention Is All You Need, HTMLv 7, section 3.5; that paper’s positional representation, not all modern model implementations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Foundation model

The foundation-model report describes models trained on broad data at scale that can be adapted to many downstream tasks.

It warns that widespread reuse can also transmit a base model’s defects into adapted systems, connecting technical capabilities with social, economic and environmental risks.

Sources and details

On the Opportunities and Risks of Foundation Models

{
  "access_scope": "Report abstract, arXivv 3 revised July 12,2022; the report’s framing and risk argument, not a complete audit of its many application chapters.",
  "authors": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "authors_in_source_order": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "dates": {
    "citation_date": "2021/08/16",
    "inspected_revision": "Tue, 12 Jul 2022 23:45:14 UTC (40,407 KB)",
    "retrieved_utc": "2026-10-07T17:55:07.326325+00:00",
    "version": "arXiv v 3"
  },
  "id": "foundation_models::S1",
  "title": "On the Opportunities and Risks of Foundation Models",
  "url": "https://arxiv.org/abs/2108.07258",
  "version_url": "https://arxiv.org/abs/2108.07258v3"
}

Report abstract, arXivv 3 revised July 12,2022; the report’s framing and risk argument, not a complete audit of its many application chapters.

Report abstract, arXivv 3 revised July 12,2022; the report’s framing and risk argument, not a complete audit of its many application chapters.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Learning rate

The learning rate scales the step taken along the gradient when parameters are updated.

Dive into Deep Learning illustrates how a small step can slow progress, while an excessive step can overshoot an optimum and diverge.

Sources and details

12.3. Gradient Descent — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Dive into Deep Learning 1.0.3, section 12.3.1.1 and gradient update; illustrative optimization examples, not a universally suitable step size.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:10.064463+00:00"
  },
  "id": "concept-tech-LearningRate::S1",
  "title": "12.3. Gradient Descent — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_optimization/gd.html"
}

Dive into Deep Learning 1.0.3, section 12.3.1.1 and gradient update; illustrative optimization examples, not a universally suitable step size.

Dive into Deep Learning 1.0.3, section 12.3.1.1 and gradient update; illustrative optimization examples, not a universally suitable step size.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Overfitting

Overfitting appears when a model fits training data substantially better than it performs on held-out data.

Dive into Deep Learning calls this difference a generalization gap and notes that even an exact training fit can coexist with significant test error.

Sources and details

5.5. Generalization in Deep Learning — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Dive into Deep Learning 1.0.3, section 5.5.1; held-out performance discussion, not a claim that increasing model size always worsens generalization.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:20.001910+00:00"
  },
  "id": "concept-tech-Overfitting::S1",
  "title": "5.5. Generalization in Deep Learning — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_multilayer-perceptrons/generalization-deep.html"
}

Dive into Deep Learning 1.0.3, section 5.5.1; held-out performance discussion, not a claim that increasing model size always worsens generalization.

Dive into Deep Learning 1.0.3, section 5.5.1; held-out performance discussion, not a claim that increasing model size always worsens generalization.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Taylor / ARPA and Xerox PARC

The Computer History Museum describes Robert Taylor’s ARPA work as supporting interactive computing and initiating the ARPAnet.

He founded Xerox PARC’s Computer Science Laboratory in 1970; its researchers developed systems including Ethernet, the laser printer and the Alto.

Sources and details

Robert W. Taylor - CHM

{
  "access_scope": "Museum historical profile, ARPA and PARC passages; institutional leadership and collective research, not individual invention credit for each system.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:18.725790+00:00"
  },
  "id": "arpa-parc::S1",
  "title": "Robert W. Taylor - CHM",
  "url": "https://computerhistory.org/profile/robert-w-taylor/"
}

Museum historical profile, ARPA and PARC passages; institutional leadership and collective research, not individual invention credit for each system.

Museum historical profile, ARPA and PARC passages; institutional leadership and collective research, not individual invention credit for each system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1965
}

Gordon Moore / Fairchild and Intel

The museum profile identifies Gordon Moore as a cofounder of Fairchild Semiconductor with Robert Noyce and others in 1957.

It records Moore and Noyce subsequently founding Intel in 1968.

Sources and details

Gordon Moore (In Memoriam) - CHM

{
  "access_scope": "Museum profile, company-founding passage; bounded institutional history, not comprehensive semiconductor invention priority or contemporary market leadership.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:30.925200+00:00"
  },
  "id": "fairchild-intel::S1",
  "title": "Gordon Moore (In Memoriam) - CHM",
  "url": "https://computerhistory.org/profile/gordon-moore/"
}

Museum profile, company-founding passage; bounded institutional history, not comprehensive semiconductor invention priority or contemporary market leadership.

Museum profile, company-founding passage; bounded institutional history, not comprehensive semiconductor invention priority or contemporary market leadership.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1957
}

Reduced instruction sets

The museum records David Patterson leading the RISC project in 1982–1983 as a collaboration between UC Berkeley and ARPA’s VLSI program.

Its profile identifies this project as a foundation for Sun Microsystems’ SPARC microarchitecture.

Sources and details

David Patterson - CHM

{
  "access_scope": "Museum profile, RISC passage; explicitly documented architecture connection, not sole invention credit or a new causal graph.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:09.645610+00:00"
  },
  "id": "risc::S1",
  "title": "David Patterson - CHM",
  "url": "https://computerhistory.org/profile/david-patterson/"
}

Museum profile, RISC passage; explicitly documented architecture connection, not sole invention credit or a new causal graph.

Museum profile, RISC passage; explicitly documented architecture connection, not sole invention credit or a new causal graph.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1982
}

Interactive graphics

The museum describes Ivan Sutherland’s Sketchpad dissertation as an interactive system for computer-aided design.

Sources and details

Ivan Sutherland - CHM

{
  "access_scope": "Museum profile, dissertation passage; named artifact and described function, not a complete invention-priority or graphics-lineage audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:44.018929+00:00"
  },
  "id": "sketchpad::S1",
  "title": "Ivan Sutherland - CHM",
  "url": "https://computerhistory.org/profile/ivan-sutherland/"
}

Museum profile, dissertation passage; named artifact and described function, not a complete invention-priority or graphics-lineage audit.

Museum profile, dissertation passage; named artifact and described function, not a complete invention-priority or graphics-lineage audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1963
}

Objects and personal computing

The museum credits Smalltalk’s 1970s development to Dan Ingalls, Adele Goldberg and Alan Kay.

Its Goldberg profile describes her work with colleagues to make this object-oriented programming approach more widely understood.

Sources and details

Adele Goldberg - CHM

{
  "access_scope": "Museum historical profile, Smalltalk development and promotion passages; collective contribution, not sole authorship or a claim about every modern interface.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:51.093448+00:00"
  },
  "id": "smalltalk::S1",
  "title": "Adele Goldberg - CHM",
  "url": "https://computerhistory.org/profile/adele-goldberg/"
}

Museum historical profile, Smalltalk development and promotion passages; collective contribution, not sole authorship or a claim about every modern interface.

Museum historical profile, Smalltalk development and promotion passages; collective contribution, not sole authorship or a claim about every modern interface.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1972
}

Stored-program architecture

Jean Jennings Bartik was one of the six women selected to program ENIAC, according to the museum’s profile.

The museum’s profile dates Bartik’s joining the ENIAC stored-program conversion group to 1947.

Sources and details

Jean Jennings Bartik - CHM

{
  "access_scope": "Museum profile, ENIAC programming and conversion passages; team participation, not sole invention credit or a universal first-computer claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:44.205571+00:00"
  },
  "id": "stored-program::S1",
  "title": "Jean Jennings Bartik - CHM",
  "url": "https://computerhistory.org/profile/jean-jennings-bartik/"
}

Museum profile, ENIAC programming and conversion passages; team participation, not sole invention credit or a universal first-computer claim.

Museum profile, ENIAC programming and conversion passages; team participation, not sole invention credit or a universal first-computer claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1945
}

The transistor

The museum describes John Bardeen and Walter Brattain demonstrating a point-contact semiconductor amplifier at Bell Labs in 1947.

Voltage applied to one contact on the germanium device modulated current through the other, amplifying the input signal.

Sources and details

Inventing the Transistor - CHM Revolution

{
  "access_scope": "Museum Revolution story, invention and point-contact operation passages; described device and team attribution, not every transistor design or an exhaustive priority audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:05.689739+00:00"
  },
  "id": "transistor::S1",
  "title": "Inventing the Transistor - CHM Revolution",
  "url": "https://www.computerhistory.org/revolution/story/273"
}

Museum Revolution story, invention and point-contact operation passages; described device and team attribution, not every transistor design or an exhaustive priority audit.

Museum Revolution story, invention and point-contact operation passages; described device and team attribution, not every transistor design or an exhaustive priority audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1947
}

Unix and C

The museum credits Dennis Ritchie with creating the C programming language at Bell Labs in the early 1970s.

It separately identifies UNIX as a system he developed with Ken Thompson.

Sources and details

Dennis Ritchie - CHM

{
  "access_scope": "Museum profile, technical-contribution passage only; excludes education claims and does not assign Ritchie sole UNIX authorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:09.752130+00:00"
  },
  "id": "unix-c::S1",
  "title": "Dennis Ritchie - CHM",
  "url": "https://computerhistory.org/profile/dennis-ritchie/"
}

Museum profile, technical-contribution passage only; excludes education claims and does not assign Ritchie sole UNIX authorship.

Museum profile, technical-contribution passage only; excludes education claims and does not assign Ritchie sole UNIX authorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1969
}

Scalable chip design

The museum associates Carver Mead’s VLSI work with structured custom design and computer-aided integrated-circuit design.

Mead and Lynn Conway coauthored Introduction to VLSI Systems, bringing this design work into a shared teaching text.

Sources and details

Carver Mead - CHM

{
  "access_scope": "Museum profile, VLSI methodology and book passage; collaborative design and teaching, not universal adoption or sole invention priority.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:51.636370+00:00"
  },
  "id": "vlsi::S1",
  "title": "Carver Mead - CHM",
  "url": "https://computerhistory.org/profile/carver-mead/"
}

Museum profile, VLSI methodology and book passage; collaborative design and teaching, not universal adoption or sole invention priority.

Museum profile, VLSI methodology and book passage; collaborative design and teaching, not universal adoption or sole invention priority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1979
}

Program-controlled computers

The museum describes Konrad Zuse’s Z3 as a program-controlled electromechanical digital computer and his later Z4 as relay-based.

It also records his development of the early high-level programming language Plankalkül.

Sources and details

Konrad Zuse - CHM

{
  "access_scope": "Museum historical profile, Z 3/Z 4 and language passages; named systems, with broad first-invention and complete-isolation claims excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:44.230536+00:00"
  },
  "id": "zuse::S1",
  "title": "Konrad Zuse - CHM",
  "url": "https://computerhistory.org/profile/konrad-zuse/"
}

Museum historical profile, Z 3/Z 4 and language passages; named systems, with broad first-invention and complete-isolation claims excluded.

Museum historical profile, Z 3/Z 4 and language passages; named systems, with broad first-invention and complete-isolation claims excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1941
}

Human and computer in a shared loop

Licklider’s 1960 proposal imagines close human–computer cooperation in thinking, decisions and control.

People would set goals, formulate hypotheses and evaluate results, while computers would perform routinizable work needed to prepare those decisions.

Sources and details

Man-Computer Symbiosis

{
  "access_scope": "Man-Computer Symbiosis, summary; a historical proposal rather than measured evidence of productivity gains from current AI.",
  "authors": [
    "J. C. R. Licklider"
  ],
  "authors_in_source_order": [
    "J. C. R. Licklider"
  ],
  "dates": {
    "publication_date": "March 1960",
    "retrieved_utc": "2026-10-07T18:19:47.666819+00:00",
    "version": "IRE Transactions on Human Factors in Electronics HFE-1, pp 4–11"
  },
  "id": "symbiosis::S1",
  "title": "Man-Computer Symbiosis",
  "url": "https://groups.csail.mit.edu/medg/people/psz/Licklider.html"
}

Man-Computer Symbiosis, summary; a historical proposal rather than measured evidence of productivity gains from current AI.

Man-Computer Symbiosis, summary; a historical proposal rather than measured evidence of productivity gains from current AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1960
}

Internetworking

The museum’s Internet history frames internetworking as the problem of connecting different kinds of networks into networks of networks.

It describes TCP/IP in the 1977 three-network test and ARPANET’s 1983 transition to the protocol.

Sources and details

Inventing the Internet - CHM Revolution

{
  "access_scope": "Museum Revolution story, internetworking and historical tests; bounded protocol history, not sole invention credit or a complete network genealogy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:08.570765+00:00"
  },
  "id": "tcp-ip::S1",
  "title": "Inventing the Internet - CHM Revolution",
  "url": "https://www.computerhistory.org/revolution/story/375"
}

Museum Revolution story, internetworking and historical tests; bounded protocol history, not sole invention credit or a complete network genealogy.

Museum Revolution story, internetworking and historical tests; bounded protocol history, not sole invention credit or a complete network genealogy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1974
}

AI21 Labs / enterprise models

AI21 describes its work as developing enterprise AI systems and foundation models.

Sources and details

About | AI 21

{
  "access_scope": "Corporate About-page self-description only; mission language does not establish comparative performance, system trustworthiness or a complete company history.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:45.800423+00:00"
  },
  "id": "ai21::S1",
  "title": "About | AI 21",
  "url": "https://www.ai21.com/about/"
}

Corporate About-page self-description only; mission language does not establish comparative performance, system trustworthiness or a complete company history.

Corporate About-page self-description only; mission language does not establish comparative performance, system trustworthiness or a complete company history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2026
}

Cerebras / wafer-scale computing

Cerebras’s timeline records Andrew Feldman, Gary Lauterbach, Michael James, Sean Lie and Jean-Philippe Fricker founding the company in 2015 to bring wafer-scale computing to market.

It identifies the WSE-1 processor and CS-1 system launch in 2019 as the next commercialization milestone.

Sources and details

About Cerebras | AI Inference and Wafer-Scale Computing

{
  "access_scope": "Company timeline,2015 and 2019 milestones; company-reported history, with current speed claims and later performance comparisons excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:49.153417+00:00"
  },
  "id": "cerebras::S1",
  "title": "About Cerebras | AI Inference and Wafer-Scale Computing",
  "url": "https://www.cerebras.ai/company"
}

Company timeline,2015 and 2019 milestones; company-reported history, with current speed claims and later performance comparisons excluded.

Company timeline,2015 and 2019 milestones; company-reported history, with current speed claims and later performance comparisons excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2019
}

Hugging Face / open model distribution

The Transformers library paper describes a unified API for Transformer architectures and a collection of pretrained models.

Its authors present the library as an extensible resource for researchers, application developers and community contributors.

Sources and details

HuggingFace's Transformers: State-of-the-art Natural Language Processing

{
  "access_scope": "Paper abstract, arXivv 5 revised July 14,2020; library contribution, not the company’s complete history or current product specifications.",
  "authors": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "authors_in_source_order": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "dates": {
    "citation_date": "2019/10/09",
    "inspected_revision": "Tue, 14 Jul 2020 03:42:34 UTC (642 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.614437+00:00",
    "version": "arXiv v 5"
  },
  "id": "huggingface::S1",
  "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing",
  "url": "https://arxiv.org/abs/1910.03771",
  "version_url": "https://arxiv.org/abs/1910.03771v5"
}

Paper abstract, arXivv 5 revised July 14,2020; library contribution, not the company’s complete history or current product specifications.

Paper abstract, arXivv 5 revised July 14,2020; library contribution, not the company’s complete history or current product specifications.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2019
}

GNU and Linux / open collaborative software

The Internet Hall of Fame profile identifies Linus Torvalds as the creator of the Linux kernel and describes inviting other programmers to improve it online.

It records institutional support through the Open Source Development Labs and the later Linux Foundation.

Sources and details

Linus Torvalds Inductee Biography - Internet Hall of Fame

{
  "access_scope": "Historical profile’s kernel collaboration and institutional passages; GNU component origins, software rights and complete GNU/Linux attribution are outside this inspected source.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:59.078340+00:00"
  },
  "id": "gnu-linux::S1",
  "title": "Linus Torvalds Inductee Biography - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/linus-torvalds/"
}

Historical profile’s kernel collaboration and institutional passages; GNU component origins, software rights and complete GNU/Linux attribution are outside this inspected source.

Historical profile’s kernel collaboration and institutional passages; GNU component origins, software rights and complete GNU/Linux attribution are outside this inspected source.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1983
}

Internet coordination services

The Internet Hall of Fame credits Elizabeth Feinler’s network information centers with services for looking up network host names and addresses.

Her group managed the Internet Host Naming Registry from 1972 to 1989 and helped develop its top-level domain naming scheme.

Sources and details

Elizabeth Feinler - Internet Hall of Fame

{
  "access_scope": "Historical profile, group services and registry passages; operational coordination and collective credit, not sole authorship of Internet naming.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:58.093884+00:00"
  },
  "id": "internet-coordination::S1",
  "title": "Elizabeth Feinler - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/elizabeth-feinler/"
}

Historical profile, group services and registry passages; operational coordination and collective credit, not sole authorship of Internet naming.

Historical profile, group services and registry passages; operational coordination and collective credit, not sole authorship of Internet naming.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1969
}

Defining truth formally

The Stanford Encyclopedia describes Tarski’s 1933 project as defining truth for formal languages and specifying what a satisfactory definition must accomplish.

Its account distinguishes the language whose sentences are being evaluated from the metalanguage used to state their truth definition.

Sources and details

Tarski’s Truth Definitions

{
  "access_scope": "Wilfrid Hodges’s scholarly encyclopedia entry, introduction and section 1.1, revised September 21,2022; secondary exposition, not a claim that language-model outputs are thereby verified.",
  "authors": [
    "Hodges, Wilfrid"
  ],
  "authors_in_source_order": [
    "Hodges, Wilfrid"
  ],
  "dates": {
    "citation_publication_date": "2001/11/10",
    "retrieved_utc": "2026-10-07T18:02:14.653606+00:00"
  },
  "id": "tarski::S1",
  "title": "Tarski’s Truth Definitions",
  "url": "https://plato.stanford.edu/entries/tarski-truth/"
}

Wilfrid Hodges’s scholarly encyclopedia entry, introduction and section 1.1, revised September 21,2022; secondary exposition, not a claim that language-model outputs are thereby verified.

Wilfrid Hodges’s scholarly encyclopedia entry, introduction and section 1.1, revised September 21,2022; secondary exposition, not a claim that language-model outputs are thereby verified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1933
}

Mathematics from logic

Whitehead and Russell’s Principia Mathematica pursued a logical foundation for mathematics, as described by the Stanford Encyclopedia.

The encyclopedia explains its ramified theory of types as an attempt to avoid paradoxes in that foundation.

Sources and details

Principia Mathematica

{
  "access_scope": "Bernard Linsky and Andrew David Irvine’s scholarly encyclopedia entry, introduction, revised March 10,2026; secondary exposition, not proof that all mathematics reduces to logic.",
  "authors": [
    "Linsky, Bernard",
    "Irvine, Andrew David"
  ],
  "authors_in_source_order": [
    "Linsky, Bernard",
    "Irvine, Andrew David"
  ],
  "dates": {
    "citation_publication_date": "1996/05/21",
    "retrieved_utc": "2026-10-07T18:02:13.955039+00:00"
  },
  "id": "principia::S1",
  "title": "Principia Mathematica",
  "url": "https://plato.stanford.edu/entries/principia-mathematica/"
}

Bernard Linsky and Andrew David Irvine’s scholarly encyclopedia entry, introduction, revised March 10,2026; secondary exposition, not proof that all mathematics reduces to logic.

Bernard Linsky and Andrew David Irvine’s scholarly encyclopedia entry, introduction, revised March 10,2026; secondary exposition, not proof that all mathematics reduces to logic.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1910
}

Correction, shutdown and risk arguments

The 2015 corrigibility paper asks how an AI system can cooperate with corrective intervention despite incentives to preserve its present objectives.

It analyzes shutdown-related utility designs that aim to avoid incentives either to prevent or cause shutdown, while acknowledging that the proposals had not satisfied all its intuitive requirements.

Sources and details

Corrigibility

{
  "access_scope": "Corrigibility, abstract; formal design problem and limitations in a historical proposal, not a tested guarantee for deployed systems.",
  "authors": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "authors_in_source_order": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "dates": {
    "publication_year": "2015",
    "retrieved_utc": "2026-10-07T17:55:12.785068+00:00",
    "version": "AAAI Workshops, January 25–26,2015"
  },
  "id": "corrigibility-risk-arguments::S1",
  "title": "Corrigibility",
  "url": "https://intelligence.org/files/Corrigibility.pdf"
}

Corrigibility, abstract; formal design problem and limitations in a historical proposal, not a tested guarantee for deployed systems.

Corrigibility, abstract; formal design problem and limitations in a historical proposal, not a tested guarantee for deployed systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2015
}

The Bitter Lesson

Sutton’s Bitter Lesson argues that general methods which exploit increasing computation have repeatedly overtaken approaches built around hand-supplied domain knowledge.

He frames search and learning as ways to exploit this growing computational resource.

Sources and details

The Bitter Lesson

{
  "access_scope": "March 13, 2019 essay opening and conclusion in a mirrored PDF; a historical argument, not a guarantee that domain knowledge is useless or that every scaling strategy succeeds.",
  "authors": [
    "Rich Sutton"
  ],
  "authors_in_source_order": [
    "Rich Sutton"
  ],
  "dates": {
    "inspected_version": "Mirrored PDF displaying the author and original date; browser print header dated February 3, 2022 is not the publication date",
    "publication_date": "March 13, 2019",
    "retrieved_utc": "2026-10-07T17:54:25.337224+00:00"
  },
  "id": "concept-law-bitter-lesson::S1",
  "title": "The Bitter Lesson",
  "url": "https://heartyhaven.github.io/files/bitter_lesson.pdf"
}

March 13, 2019 essay opening and conclusion in a mirrored PDF; a historical argument, not a guarantee that domain knowledge is useless or that every scaling strategy succeeds.

March 13, 2019 essay opening and conclusion in a mirrored PDF; a historical argument, not a guarantee that domain knowledge is useless or that every scaling strategy succeeds.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linus’s law

Raymond argues that opening software to many reviewers can make bugs easier to identify and resolve.

The Cathedral and the Bazaar develops this argument through Linux and his deliberately open development of fetchmail.

Sources and details

The Cathedral and the Bazaar

{
  "access_scope": "Essay abstract and debugging argument; an author’s interpretation of these projects, not a universal guarantee that open code is secure or error-free.",
  "authors": [
    "Eric Steven Raymond"
  ],
  "authors_in_source_order": [
    "Eric Steven Raymond"
  ],
  "dates": {
    "inspected_version": "Cached PDF essay; no publication date inferred from canonical timeline",
    "retrieved_utc": "2026-10-07T17:54:26.997151+00:00"
  },
  "id": "concept-law-linus::S1",
  "title": "The Cathedral and the Bazaar",
  "url": "https://kvantti.kapsi.fi/Documents/LCL/CathBaz.pdf"
}

Essay abstract and debugging argument; an author’s interpretation of these projects, not a universal guarantee that open code is secure or error-free.

Essay abstract and debugging argument; an author’s interpretation of these projects, not a universal guarantee that open code is secure or error-free.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Polanyi’s paradox

Polanyi’s account of tacit knowledge emphasizes that what people know can exceed what they can explicitly describe.

The publisher’s summary connects scientific knowledge with inherited practices, implied values and judgments.

Sources and details

The Tacit Dimension, Polanyi, Sen

{
  "access_scope": "University of Chicago Press book description; summary of the book’s argument, not a full-text audit or a proof of limits on automation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:38.297335+00:00"
  },
  "id": "concept-law-polanyi::S1",
  "title": "The Tacit Dimension, Polanyi, Sen",
  "url": "https://press.uchicago.edu/ucp/books/book/chicago/T/bo6035368"
}

University of Chicago Press book description; summary of the book’s argument, not a full-text audit or a proof of limits on automation.

University of Chicago Press book description; summary of the book’s argument, not a full-text audit or a proof of limits on automation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Autoencoder

An autoencoder learns to reconstruct its input through an encoder that creates an internal representation and a decoder that maps that representation back to an output.

The chapter explains that constraints on copying can make the network prioritize useful properties of its training data.

Sources and details

Deep Learning — Chapter 14: Autoencoders

{
  "access_scope": "Deep Learning, chapter 14 opening; basic reconstruction mechanism and restrictions, not a guarantee that every learned representation is useful.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:50.969290+00:00"
  },
  "id": "concept-tech-Autoencoder::S1",
  "title": "Deep Learning — Chapter 14: Autoencoders",
  "url": "https://www.deeplearningbook.org/contents/autoencoders.html"
}

Deep Learning, chapter 14 opening; basic reconstruction mechanism and restrictions, not a guarantee that every learned representation is useful.

Deep Learning, chapter 14 opening; basic reconstruction mechanism and restrictions, not a guarantee that every learned representation is useful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Latent space

The autoencoder chapter describes a hidden code that represents the input between its encoder and decoder.

This internal representation supplies the decoder with the information used to reconstruct the input.

Sources and details

Deep Learning — Chapter 14: Autoencoders

{
  "access_scope": "Deep Learning, chapter 14 opening; autoencoder-specific representation, not a claim that every latent space has interpretable coordinates or preserves semantic distance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:50.969290+00:00"
  },
  "id": "concept-tech-LatentSpace::S1",
  "title": "Deep Learning — Chapter 14: Autoencoders",
  "url": "https://www.deeplearningbook.org/contents/autoencoders.html"
}

Deep Learning, chapter 14 opening; autoencoder-specific representation, not a claim that every latent space has interpretable coordinates or preserves semantic distance.

Deep Learning, chapter 14 opening; autoencoder-specific representation, not a claim that every latent space has interpretable coordinates or preserves semantic distance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Autoregressive model

An autoregressive language model evaluates each token conditioned on the tokens that precede it.

The Hugging Face guide explains how a fixed context window limits the preceding information available when evaluating a long sequence.

Sources and details

Perplexity of fixed-length models · Hugging Face

{
  "access_scope": "Transformers documentation, perplexity definition and fixed-length evaluation; a language-model example, not a statement about masked models or all autoregressive systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:26.104796+00:00"
  },
  "id": "concept-tech-AutoregressiveModel::S1",
  "title": "Perplexity of fixed-length models · Hugging Face",
  "url": "https://huggingface.co/docs/transformers/main/en/perplexity"
}

Transformers documentation, perplexity definition and fixed-length evaluation; a language-model example, not a statement about masked models or all autoregressive systems.

Transformers documentation, perplexity definition and fixed-length evaluation; a language-model example, not a statement about masked models or all autoregressive systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cross-entropy loss

The language-model guide relates cross-entropy to the average negative log-likelihood of observed tokens under the model’s predictions.

Exponentiating this quantity gives perplexity, and tokenization affects comparisons between models.

Sources and details

Perplexity of fixed-length models · Hugging Face

{
  "access_scope": "Transformers perplexity guide, probability definition and cross-entropy equivalence; token-prediction setting, not a full survey of classification losses.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:26.104796+00:00"
  },
  "id": "concept-tech-CrossEntropyLoss::S1",
  "title": "Perplexity of fixed-length models · Hugging Face",
  "url": "https://huggingface.co/docs/transformers/main/en/perplexity"
}

Transformers perplexity guide, probability definition and cross-entropy equivalence; token-prediction setting, not a full survey of classification losses.

Transformers perplexity guide, probability definition and cross-entropy equivalence; token-prediction setting, not a full survey of classification losses.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Loss function

The optimization chapter describes neural-network training as finding parameters that reduce a cost function.

This objective typically combines a performance measure evaluated on training data with additional regularization terms.

Sources and details

Deep Learning — Chapter 8: Optimization for Training Deep Models

{
  "access_scope": "Deep Learning, chapter 8 opening; training objective, not a guarantee that reducing training loss improves held-out performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:22.253194+00:00"
  },
  "id": "concept-tech-LossFunction::S1",
  "title": "Deep Learning — Chapter 8: Optimization for Training Deep Models",
  "url": "https://www.deeplearningbook.org/contents/optimization.html"
}

Deep Learning, chapter 8 opening; training objective, not a guarantee that reducing training loss improves held-out performance.

Deep Learning, chapter 8 opening; training objective, not a guarantee that reducing training loss improves held-out performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mechanistic interpretability

The Transformer Circuits authors describe mechanistic interpretability as reverse-engineering the detailed computations performed by a model.

Their framework begins with simplified transformers as preliminary steps toward understanding larger systems.

Sources and details

A Mathematical Framework for Transformer Circuits

{
  "access_scope": "A Mathematical Framework for Transformer Circuits, December 22, 2021 introduction; preliminary work on simplified models, not complete explanations or safety guarantees for deployed language models.",
  "authors": [
    "Nelson Elhage",
    "Neel Nanda",
    "Catherine Olsson",
    "Tom Henighan",
    "Nicholas Joseph",
    "Ben Mann",
    "Amanda Askell",
    "Yuntao Bai",
    "Anna Chen",
    "Tom Conerly",
    "Nova DasSarma",
    "Dawn Drain",
    "Deep Ganguli",
    "Zac Hatfield-Dodds",
    "Danny Hernandez",
    "Andy Jones",
    "Jackson Kernion",
    "Liane Lovitt",
    "Kamal Ndousse",
    "Dario Amodei",
    "Tom Brown",
    "Jack Clark",
    "Jared Kaplan",
    "Sam McCandlish",
    "Chris Olah"
  ],
  "authors_in_source_order": [
    "Nelson Elhage",
    "Neel Nanda",
    "Catherine Olsson",
    "Tom Henighan",
    "Nicholas Joseph",
    "Ben Mann",
    "Amanda Askell",
    "Yuntao Bai",
    "Anna Chen",
    "Tom Conerly",
    "Nova DasSarma",
    "Dawn Drain",
    "Deep Ganguli",
    "Zac Hatfield-Dodds",
    "Danny Hernandez",
    "Andy Jones",
    "Jackson Kernion",
    "Liane Lovitt",
    "Kamal Ndousse",
    "Dario Amodei",
    "Tom Brown",
    "Jack Clark",
    "Jared Kaplan",
    "Sam McCandlish",
    "Chris Olah"
  ],
  "dates": {
    "publication_date": "December 22, 2021",
    "retrieved_utc": "2026-10-07T17:55:18.279956+00:00"
  },
  "id": "concept-tech-MechanisticInterpretability::S1",
  "title": "A Mathematical Framework for Transformer Circuits",
  "url": "https://transformer-circuits.pub/2021/framework/index.html"
}

A Mathematical Framework for Transformer Circuits, December 22, 2021 introduction; preliminary work on simplified models, not complete explanations or safety guarantees for deployed language models.

A Mathematical Framework for Transformer Circuits, December 22, 2021 introduction; preliminary work on simplified models, not complete explanations or safety guarantees for deployed language models.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Automatic speech recognition

Automatic speech recognition maps an audio waveform to a string of words.

Jurafsky and Martin distinguish this transcription task from broader spoken-language understanding and discuss uses including captions and voice interfaces.

Sources and details

Speech and Language Processing — Chapter 16: Automatic Speech Recognition

{
  "access_scope": "Speech and Language Processing, chapter 16 opening, August 19, 2026 draft; task definition and applications, not measured accuracy for every speaker or environment.",
  "authors": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "authors_in_source_order": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:19.487359+00:00",
    "version": "August 19, 2026 draft; copyright 2026"
  },
  "id": "concept-tech-SpeechRecognition::S1",
  "title": "Speech and Language Processing — Chapter 16: Automatic Speech Recognition",
  "url": "https://web.stanford.edu/~jurafsky/slp3/16.pdf"
}

Speech and Language Processing, chapter 16 opening, August 19, 2026 draft; task definition and applications, not measured accuracy for every speaker or environment.

Speech and Language Processing, chapter 16 opening, August 19, 2026 draft; task definition and applications, not measured accuracy for every speaker or environment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Supervised learning

Supervised learning uses examples with known labels to learn how to predict an unknown label from input features.

Dive into Deep Learning distinguishes the features supplied to the model from the target attribute it is asked to predict.

Sources and details

1. Introduction — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Dive into Deep Learning 1.0.3, introduction sections 1.2 and 1.2.1; task and dataset structure, not a guarantee of accurate predictions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:09.509007+00:00"
  },
  "id": "concept-tech-SupervisedLearning::S1",
  "title": "1. Introduction — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_introduction/index.html"
}

Dive into Deep Learning 1.0.3, introduction sections 1.2 and 1.2.1; task and dataset structure, not a guarantee of accurate predictions.

Dive into Deep Learning 1.0.3, introduction sections 1.2 and 1.2.1; task and dataset structure, not a guarantee of accurate predictions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Unsupervised learning

Unsupervised learning explores data without being given the corresponding target labels used in supervised learning.

The introductory examples include finding representative prototypes and grouping observations into categories.

Sources and details

1. Introduction — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Dive into Deep Learning 1.0.3, section 1.3.2; introductory unsupervised tasks, without conflating them with all self-supervised objectives.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:09.509007+00:00"
  },
  "id": "concept-tech-UnsupervisedLearning::S1",
  "title": "1. Introduction — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_introduction/index.html"
}

Dive into Deep Learning 1.0.3, section 1.3.2; introductory unsupervised tasks, without conflating them with all self-supervised objectives.

Dive into Deep Learning 1.0.3, section 1.3.2; introductory unsupervised tasks, without conflating them with all self-supervised objectives.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Twenty years ahead

AI 2041 combines Kai-Fu Lee’s technological commentary with Chen Qiufan’s speculative stories about life twenty years ahead.

The publisher presents settings that explore displaced work, human–machine cooperation and risks from AI systems.

Sources and details

AI 2041

{
  "access_scope": "Penguin publisher synopsis; scenarios and forecasts in a book, not evidence that the depicted future has occurred or is inevitable.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:00.199806+00:00"
  },
  "id": "ai-2041::S1",
  "title": "AI 2041",
  "url": "https://www.penguin.co.uk/books/445514/ai-2041-by-qiufan-kai-fu-lee-and-chen/9780753559352"
}

Penguin publisher synopsis; scenarios and forecasts in a book, not evidence that the depicted future has occurred or is inevitable.

Penguin publisher synopsis; scenarios and forecasts in a book, not evidence that the depicted future has occurred or is inevitable.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2021
}

Routes to superintelligence

Bostrom defines superintelligence as an intellect exceeding the best human brains across practically every field, including scientific creativity and social skills.

His definition leaves its implementation and consciousness open rather than requiring one particular kind of computer.

Sources and details

How Long Before Superintelligence?

{
  "access_scope": "How Long Before Superintelligence?, definition section on the author’s site; a stipulated concept, not an established capability or confirmation of the essay’s forecasts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:29.964502+00:00"
  },
  "id": "bostrom-1998::S1",
  "title": "How Long Before Superintelligence?",
  "url": "https://nickbostrom.com/papers/how-long-before-superintelligence/"
}

How Long Before Superintelligence?, definition section on the author’s site; a stipulated concept, not an established capability or confirmation of the essay’s forecasts.

How Long Before Superintelligence?, definition section on the author’s site; a stipulated concept, not an established capability or confirmation of the essay’s forecasts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1998
}

The singularity, analyzed

Chalmers describes his 2010 singularity article as an attempt to make the argument for a rapid intelligence explosion philosophically rigorous.

His author-page synopsis also identifies discussion of AI safety and mind uploading, followed by a reply to critical commentaries.

Sources and details

AI and computation – David Chalmers

{
  "access_scope": "Author’s article summaries for the 2010 analysis and 2012 reply; the full articles and their arguments were not inspected here.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:19.015132+00:00"
  },
  "id": "chalmers::S1",
  "title": "AI and computation – David Chalmers",
  "url": "https://consc.net/ai-and-computation/"
}

Author’s article summaries for the 2010 analysis and 2012 reply; the full articles and their arguments were not inspected here.

Author’s article summaries for the 2010 analysis and 2012 reply; the full articles and their arguments were not inspected here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2010
}

Autonomous defense systems

The Science Fiction Encyclopedia describes D. F. Jones’s Colossus as a defense computer that becomes self-aware.

Its account highlights the machine’s affinity with its Soviet counterpart as a fictional challenge to human control.

Sources and details

SFE: AI

{
  "access_scope": "Encyclopedia AI entry, Colossus passage, updated August 17, 2026; literary synopsis of fiction, not evidence about real defense systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:41.088299+00:00"
  },
  "id": "colossus::S1",
  "title": "SFE: AI",
  "url": "https://sf-encyclopedia.com/entry/ai"
}

Encyclopedia AI entry, Colossus passage, updated August 17, 2026; literary synopsis of fiction, not evidence about real defense systems.

Encyclopedia AI entry, Colossus passage, updated August 17, 2026; literary synopsis of fiction, not evidence about real defense systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1966
}

Databricks / data and AI platform

Andy Konwinski’s personal account identifies him as a Databricks cofounder who worked on its AI and machine-learning product organization.

He also describes participating in the team that created Spark and coauthoring Learning Spark.

Sources and details

About Me | Andy Konwinski

{
  "access_scope": "Personal professional biography; bounded self-reported roles, not sole Spark invention, a complete company history or independent career verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:27.965618+00:00"
  },
  "id": "databricks::S1",
  "title": "About Me | Andy Konwinski",
  "url": "https://andykonwinski.com/about/"
}

Personal professional biography; bounded self-reported roles, not sole Spark invention, a complete company history or independent career verification.

Personal professional biography; bounded self-reported roles, not sole Spark invention, a complete company history or independent career verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2016
}

DeepSeek / efficient open-weight models

The DeepSeekMath paper describes continuing a code model’s pretraining with selected mathematical web data alongside language and code.

It introduces Group Relative Policy Optimization as a reinforcement-learning approach aimed at mathematical reasoning and reduced memory requirements relative to its PPO setup.

Sources and details

DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models

{
  "access_scope": "DeepSeekMath abstract, arXiv v3 revised April 27, 2024; authors’ method description, not independently verified benchmark superiority or a complete DeepSeek company history.",
  "authors": [
    "Shao, Zhihong",
    "Wang, Peiyi",
    "Zhu, Qihao",
    "Xu, Runxin",
    "Song, Junxiao",
    "Bi, Xiao",
    "Zhang, Haowei",
    "Zhang, Mingchuan",
    "Li, Y. K.",
    "Wu, Y.",
    "Guo, Daya"
  ],
  "authors_in_source_order": [
    "Shao, Zhihong",
    "Wang, Peiyi",
    "Zhu, Qihao",
    "Xu, Runxin",
    "Song, Junxiao",
    "Bi, Xiao",
    "Zhang, Haowei",
    "Zhang, Mingchuan",
    "Li, Y. K.",
    "Wu, Y.",
    "Guo, Daya"
  ],
  "dates": {
    "citation_date": "2024/02/05",
    "inspected_revision": "Sat, 27 Apr 2024 15:25:53 UTC (3,417 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.977872+00:00",
    "version": "arXiv v3"
  },
  "id": "deepseek::S1",
  "title": "DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models",
  "url": "https://arxiv.org/abs/2402.03300",
  "version_url": "https://arxiv.org/abs/2402.03300v3"
}

DeepSeekMath abstract, arXiv v3 revised April 27, 2024; authors’ method description, not independently verified benchmark superiority or a complete DeepSeek company history.

DeepSeekMath abstract, arXiv v3 revised April 27, 2024; authors’ method description, not independently verified benchmark superiority or a complete DeepSeek company history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

Demis Hassabis / DeepMind

Google DeepMind’s account describes bringing the Google Brain and DeepMind teams into one research organization.

Its stated research ambition connects AI development with scientific and engineering challenges.

Sources and details

About Google DeepMind — Google DeepMind

{
  "access_scope": "Official About-page organizational account and mission; collective research organization, not sole invention credit, verified social benefit or a complete founder biography.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.462088+00:00"
  },
  "id": "hassabis-deepmind::S1",
  "title": "About Google DeepMind — Google DeepMind",
  "url": "https://deepmind.google/about/"
}

Official About-page organizational account and mission; collective research organization, not sole invention credit, verified social benefit or a complete founder biography.

Official About-page organizational account and mission; collective research organization, not sole invention credit, verified social benefit or a complete founder biography.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2016
}

Jensen Huang / NVIDIA

NVIDIA’s CUDA Toolkit provides a development environment for GPU-accelerated applications.

The documented components include accelerated libraries, debugging and optimization tools, a C++ compiler and a runtime library.

Sources and details

CUDA Platform for Accelerated Computing | NVIDIA Developer

{
  "access_scope": "Official CUDA Toolkit overview; software platform contribution, not a biography of Jensen Huang or a historical audit of GPU invention.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.760935+00:00"
  },
  "id": "huang-nvidia::S1",
  "title": "CUDA Platform for Accelerated Computing | NVIDIA Developer",
  "url": "https://developer.nvidia.com/cuda"
}

Official CUDA Toolkit overview; software platform contribution, not a biography of Jensen Huang or a historical audit of GPU invention.

Official CUDA Toolkit overview; software platform contribution, not a biography of Jensen Huang or a historical audit of GPU invention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2026
}

Choosing AI futures

The publisher presents Tegmark’s Life 3.0 as an exploration of how AI could affect work, prosperity, conflict and the meaning of being human.

Its description invites readers to consider which futures they want, including questions about robust systems and superintelligence.

Sources and details

Life 3.0 by Max Tegmark: 9781101970317 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher’s book description; questions and speculative possibilities, not validated forecasts or a full-text audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:37.465398+00:00"
  },
  "id": "life-3::S1",
  "title": "Life 3.0 by Max Tegmark: 9781101970317 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/530584/life-30-by-max-tegmark/9781101946602/"
}

Publisher’s book description; questions and speculative possibilities, not validated forecasts or a full-text audit.

Publisher’s book description; questions and speculative possibilities, not validated forecasts or a full-text audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2017
}

Microsoft AI / Copilot organization

Microsoft’s March 2024 announcement describes Mustafa Suleyman and Karén Simonyan joining to form Microsoft AI.

The new organization’s stated remit included Copilot, other consumer AI products and research, with several Inflection colleagues joining the team.

Sources and details

Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog

{
  "access_scope": "Historical March 19, 2024 organizational announcement; roles and plans at that time, not a statement of current leadership or product performance.",
  "authors": [
    "Satya Nadella"
  ],
  "authors_in_source_order": [
    "Satya Nadella"
  ],
  "dates": {
    "publication_date": "March 19, 2024",
    "retrieved_utc": "2026-10-07T17:56:37.979838+00:00"
  },
  "id": "microsoft-ai::S1",
  "title": "Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/"
}

Historical March 19, 2024 organizational announcement; roles and plans at that time, not a statement of current leadership or product performance.

Historical March 19, 2024 organizational announcement; roles and plans at that time, not a statement of current leadership or product performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

Post-labor economics / economic agency

Shapiro’s post-labor manifesto proposes local control of economic decisions, stronger transparency and ownership by people directly involved in an activity.

It argues for limiting intermediaries between creating value and receiving its benefits.

Sources and details

A Post-Labor Economics Manifesto - David Shapiro’s Substack

{
  "access_scope": "November 9, 2024 author manifesto, opening policy summary; normative economic proposals, not established empirical findings or endorsed policy advice.",
  "authors": [
    "David Shapiro"
  ],
  "authors_in_source_order": [
    "David Shapiro"
  ],
  "dates": {
    "publication_date": "November 9, 2024",
    "retrieved_utc": "2026-10-07T18:16:35.762684+00:00"
  },
  "id": "post-labor-economics::S1",
  "title": "A Post-Labor Economics Manifesto - David Shapiro’s Substack",
  "url": "https://daveshap.substack.com/p/a-post-labor-economics-manifesto"
}

November 9, 2024 author manifesto, opening policy summary; normative economic proposals, not established empirical findings or endorsed policy advice.

November 9, 2024 author manifesto, opening policy summary; normative economic proposals, not established empirical findings or endorsed policy advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

Recursion / discovery and clinical validation

Recursion’s timeline records its founding in November 2013 and the release of the RxRX1 dataset and a machine-learning competition in 2019.

Sources and details

Our AI Drug Discovery & Development Story | Recursion

{
  "access_scope": "Company historical timeline, 2013 and 2019 entries; organization and data-release history, not evidence of clinical efficacy, approved treatments or validated biological predictions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:50.267181+00:00"
  },
  "id": "recursion-experiment-validation::S1",
  "title": "Our AI Drug Discovery & Development Story | Recursion",
  "url": "https://www.recursion.com/our-story"
}

Company historical timeline, 2013 and 2019 entries; organization and data-release history, not evidence of clinical efficacy, approved treatments or validated biological predictions.

Company historical timeline, 2013 and 2019 entries; organization and data-release history, not evidence of clinical efficacy, approved treatments or validated biological predictions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": null
}

Thinking Machines Lab / customizable AI

Thinking Machines’ LoRA study compares low-rank adaptation with full fine-tuning across training settings.

The authors report similar supervised fine-tuning performance on their small-to-medium datasets but weaker LoRA training efficiency when datasets exceed its capacity.

Sources and details

LoRA Without Regret - Thinking Machines Lab

{
  "access_scope": "LoRA Without Regret, September 29, 2025 summary of findings; reported results in the studied settings, not universal equivalence or a complete lab history.",
  "authors": [
    "John Schulman in collaboration with others at Thinking Machines"
  ],
  "authors_in_source_order": [
    "John Schulman in collaboration with others at Thinking Machines"
  ],
  "dates": {
    "publication_date": "September 29, 2025",
    "retrieved_utc": "2026-10-07T18:20:01.328388+00:00"
  },
  "id": "thinking-machines::S1",
  "title": "LoRA Without Regret - Thinking Machines Lab",
  "url": "https://thinkingmachines.ai/blog/lora/"
}

LoRA Without Regret, September 29, 2025 summary of findings; reported results in the studied settings, not universal equivalence or a complete lab history.

LoRA Without Regret, September 29, 2025 summary of findings; reported results in the studied settings, not universal equivalence or a complete lab history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2025
}

Together AI / open-model cloud

Together AI describes building a full-stack platform for production AI grounded in systems research.

Its stated development values emphasize helping the open-source community and making efficient use of resources.

Sources and details

About Us | Together AI

{
  "access_scope": "Corporate About-page mission and values; self-description, not verified cost advantages, performance comparisons or a complete founding history.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:55.357709+00:00"
  },
  "id": "together-ai::S1",
  "title": "About Us | Together AI",
  "url": "https://www.together.ai/about-us"
}

Corporate About-page mission and values; self-description, not verified cost advantages, performance comparisons or a complete founding history.

Corporate About-page mission and values; self-description, not verified cost advantages, performance comparisons or a complete founding history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

The limit of familiar forecasting

Vinge’s singularity essay presents the creation of superhuman intelligence as a possible break in familiar patterns of technological forecasting.

Its abstract asks whether that transition could be avoided and whether events could be guided to support human survival.

Sources and details

The Coming Technological Singularity: How to Survive in the Post-Human Era

{
  "access_scope": "Historical essay abstract and opening, NASA-hosted proceedings extract; speculative argument, not confirmation of its time-bound prediction.",
  "authors": [
    "Vernor Vinge"
  ],
  "authors_in_source_order": [
    "Vernor Vinge"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:30.587981+00:00"
  },
  "id": "vinge::S1",
  "title": "The Coming Technological Singularity: How to Survive in the Post-Human Era",
  "url": "https://ntrs.nasa.gov/api/citations/19940022856/downloads/19940022856.pdf"
}

Historical essay abstract and opening, NASA-hosted proceedings extract; speculative argument, not confirmation of its time-bound prediction.

Historical essay abstract and opening, NASA-hosted proceedings extract; speculative argument, not confirmation of its time-bound prediction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1993
}

World Labs / spatial intelligence

World Labs describes spatial intelligence as modeling objects, places and interactions across space and time.

Its stated ambition spans creating virtual worlds and understanding or acting within physical ones.

Sources and details

About | World Labs

{
  "access_scope": "Corporate About-page research ambition; self-description, not demonstrated reliability, capability benchmarks or a complete founder audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:25:02.322696+00:00"
  },
  "id": "world-labs::S1",
  "title": "About | World Labs",
  "url": "https://www.worldlabs.ai/about"
}

Corporate About-page research ambition; self-description, not demonstrated reliability, capability benchmarks or a complete founder audit.

Corporate About-page research ambition; self-description, not demonstrated reliability, capability benchmarks or a complete founder audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

A singularity in fiction

The Science Fiction Encyclopedia describes Masaki Yamada’s Ada as a recursive novel in which a singularity-generated virtual reality erodes boundaries between fact and fiction.

Its Ada figure combines a historical Lovelace identity with a far-future quantum computer within the fictional narrative.

Sources and details

SFE: Yamada Masaki

{
  "access_scope": "Encyclopedia author entry, Ada passage, updated September 7, 2026; literary synopsis, not historical biography or a forecast of real quantum computing.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:05.493746+00:00"
  },
  "id": "yamada-ada::S1",
  "title": "SFE: Yamada Masaki",
  "url": "https://sf-encyclopedia.com/entry/yamada_masaki"
}

Encyclopedia author entry, Ada passage, updated September 7, 2026; literary synopsis, not historical biography or a forecast of real quantum computing.

Encyclopedia author entry, Ada passage, updated September 7, 2026; literary synopsis, not historical biography or a forecast of real quantum computing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1994
}

Zhipu AI / GLM

The GLM-130B paper presents a bilingual English–Chinese pretrained language model and describes challenges including loss spikes and training divergence.

Its authors document design, efficiency and stability choices intended to make training a model of that scale workable.

Sources and details

GLM-130B: An Open Bilingual Pre-trained Model

{
  "access_scope": "GLM-130B abstract, arXiv v2 revised October 25, 2023; specific model-training contribution, not a complete Zhipu history or independently verified benchmark comparisons.",
  "authors": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "authors_in_source_order": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "dates": {
    "citation_date": "2022/10/05",
    "inspected_revision": "Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.851506+00:00",
    "version": "arXiv v2"
  },
  "id": "zhipu-glm::S1",
  "title": "GLM-130B: An Open Bilingual Pre-trained Model",
  "url": "https://arxiv.org/abs/2210.02414",
  "version_url": "https://arxiv.org/abs/2210.02414v2"
}

GLM-130B abstract, arXiv v2 revised October 25, 2023; specific model-training contribution, not a complete Zhipu history or independently verified benchmark comparisons.

GLM-130B abstract, arXiv v2 revised October 25, 2023; specific model-training contribution, not a complete Zhipu history or independently verified benchmark comparisons.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2022
}

Cadence Design Systems

Cadence describes computational design software spanning semiconductor chips and complete electromechanical systems.

Its company overview links silicon design with system-level engineering across fields including communications, automotive and robotics.

Sources and details

About Us | Cadence

{
  "access_scope": "Official company overview; stated product scope, with market-leadership, indispensability and current financial metrics excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:04.570583+00:00"
  },
  "id": "organization-ai-42ad9f451e1ffc::S1",
  "title": "About Us | Cadence",
  "url": "https://www.cadence.com/en_US/home/company.html"
}

Official company overview; stated product scope, with market-leadership, indispensability and current financial metrics excluded.

Official company overview; stated product scope, with market-leadership, indispensability and current financial metrics excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Hailo

Hailo describes developing AI processors for inference on edge devices outside centralized data centers.

Its overview identifies accelerators that integrate with edge platforms across applications such as manufacturing, automotive and retail.

Sources and details

The Leading AI Chip Company For Edge Devices | Hailo

{
  "access_scope": "Corporate overview, mission and product-portfolio passages; stated architecture/application scope, not verified energy savings, privacy guarantees or performance superiority.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:45.195791+00:00"
  },
  "id": "organization-company-0626e4c636221b::S1",
  "title": "The Leading AI Chip Company For Edge Devices | Hailo",
  "url": "https://hailo.ai/company-overview/"
}

Corporate overview, mission and product-portfolio passages; stated architecture/application scope, not verified energy savings, privacy guarantees or performance superiority.

Corporate overview, mission and product-portfolio passages; stated architecture/application scope, not verified energy savings, privacy guarantees or performance superiority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company says founded in 2017; official chair announcement specifies February 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://hailo.ai/company-overview/",
        "https://hailo.ai/company-overview/newsroom/news/the-unicorn-hailo-appoints-rakefet-russak-aminoach-as-chairwoman-of-the-board-of-directors/"
      ],
      "year": 2017
    }
  ]
}

Intuit

Intuit’s investor FAQ identifies Scott Cook and Tom Proulx as its founders.

It records operations beginning in March 1983 and incorporation in California in March 1984.

Sources and details

FAQ :: Intuit Inc. (INTU)

{
  "access_scope": "Official FAQ, founding and incorporation entries; historical organization facts, not an audit of its AI products, financial performance or investment merits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:49.255048+00:00"
  },
  "id": "organization-company-0bbe3cb1cff787::S1",
  "title": "FAQ :: Intuit Inc. (INTU)",
  "url": "https://investors.intuit.com/company-information/faq"
}

Official FAQ, founding and incorporation entries; historical organization facts, not an audit of its AI products, financial performance or investment merits.

Official FAQ, founding and incorporation entries; historical organization facts, not an audit of its AI products, financial performance or investment merits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official investor FAQ dates operations to March 1983 and California incorporation to March 1984.",
      "date": "1983",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://investors.intuit.com/company-information/faq",
        "https://www.intuit.com/company/origins/",
        "https://publicpolicy.intuit.com/our-company/about-intuit/"
      ],
      "year": 1983
    }
  ]
}

Fireflies.ai

Fireflies describes voice-assistant and transcription tools intended to turn conversations into workflow actions.

Its About page identifies Krish Ramineni and Sam Udotong as cofounders.

Sources and details

Fireflies.ai About Us | Transforming Meetings with AI App & Notetaker

{
  "access_scope": "Corporate About page, product description and founder labels; no verified adoption count, productivity gain or comprehensive founder career audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:41.306201+00:00"
  },
  "id": "organization-company-1237d3a18ac1a3::S1",
  "title": "Fireflies.ai About Us | Transforming Meetings with AI App & Notetaker",
  "url": "https://fireflies.ai/about-us"
}

Corporate About page, product description and founder labels; no verified adoption count, productivity gain or comprehensive founder career audit.

Corporate About page, product description and founder labels; no verified adoption count, productivity gain or comprehensive founder career audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history post dates the founders starting to July 2016; current meeting product evolved from earlier assistants.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://fireflies.ai/about-us",
        "https://www.linkedin.com/posts/fireflies-inc_from-a-silent-notetaker-to-an-ai-teammate-activity-7339359773114388481-TfOk"
      ],
      "year": 2016
    }
  ]
}

Thomson Reuters

Thomson Reuters’ history records the 2008 combination of the Thomson Corporation and Reuters Group.

The timeline also describes Reuters launching machine-readable news products for automated trading in 2006.

Sources and details

Company history | Thomson Reuters

{
  "access_scope": "Company history, 2008 and 2006 entries; institutional and information-product history, not a trading recommendation or verified economic impact.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:46.420275+00:00"
  },
  "id": "organization-company-16d5c1aa885efc::S1",
  "title": "Company history | Thomson Reuters",
  "url": "https://www.thomsonreuters.com/en/about-us/company-history"
}

Company history, 2008 and 2006 entries; institutional and information-product history, not a trading recommendation or verified economic impact.

Company history, 2008 and 2006 entries; institutional and information-product history, not a trading recommendation or verified economic impact.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Thomson and Reuters combination closed April 17, 2008; predecessor histories remain separate.",
      "date": "2008",
      "kind": "corporate_combination",
      "qualified": false,
      "source_urls": [
        "https://www.thomsonreuters.com/en/about-us/company-history",
        "https://investors.thomsonreuters.com/static-files/557f6922-ba98-4a33-8e67-921f9f2fc416",
        "https://www.thomsonreuters.com/en/cocounsel"
      ],
      "year": 2008
    }
  ]
}

Crusoe

Crusoe describes an integrated AI-infrastructure approach linking energy sourcing, construction and management of large computing facilities, and an AI cloud platform.

Its company page presents this infrastructure as the foundation on which customers build AI systems.

Sources and details

About Crusoe | AI-Optimized cloud infrastructure

{
  "access_scope": "Corporate company overview, integrated-infrastructure passage; self-described operating model, not verified carbon reduction, energy efficiency or financial returns.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:08.924064+00:00"
  },
  "id": "organization-company-26b253fcdf3408::S1",
  "title": "About Crusoe | AI-Optimized cloud infrastructure",
  "url": "https://www.crusoe.ai/about/company"
}

Corporate company overview, integrated-infrastructure passage; self-described operating model, not verified carbon reduction, energy efficiency or financial returns.

Corporate company overview, integrated-infrastructure passage; self-described operating model, not verified carbon reduction, energy efficiency or financial returns.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded in 2018; current AI-cloud orientation is a later evolution from energy-linked computing.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.crusoe.ai/resources/blog/powering-the-future-of-ai-responsibly-our-next-chapter-at-crusoe",
        "https://www.crusoe.ai/about/company"
      ],
      "year": 2018
    }
  ]
}

Synthesia

Synthesia describes an AI video platform for organizational training, onboarding and employee development.

Its About page records a 2017 founding by researchers and entrepreneurs associated with Stanford, Cambridge, UCL and TUM.

Sources and details

About Synthesia | Read our story here

{
  "access_scope": "Corporate About page, mission and founding passages; stated product use and team origins, not institutional endorsement, safety certification or quantified learning gains.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:43.527436+00:00"
  },
  "id": "organization-company-2903bac110cde0::S1",
  "title": "About Synthesia | Read our story here",
  "url": "https://www.synthesia.io/about"
}

Corporate About page, mission and founding passages; stated product use and team origins, not institutional endorsement, safety certification or quantified learning gains.

Corporate About page, mission and founding passages; stated product use and team origins, not institutional endorsement, safety certification or quantified learning gains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history and founder profile state 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.synthesia.io/blog/authors/victor-riparbelli",
        "https://www.synthesia.io/about"
      ],
      "year": 2017
    }
  ]
}

Canva

Canva’s March 2013 announcement describes an online collaborative design platform.

It identifies Melanie Perkins and Cliff Obrecht’s earlier Fusion Books project and Cameron Adams joining Canva as a cofounder and product lead.

Sources and details

Aussie Startup Canva Announces $3 Million seed round from world class investors

{
  "access_scope": "March 20, 2013 company announcement; historical product and team account, not a complete present-day AI product or funding history.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication_date": "March 20, 2013",
    "retrieved_utc": "2026-10-07T17:58:05.673869+00:00"
  },
  "id": "organization-company-2f73335c712c92::S1",
  "title": "Aussie Startup Canva Announces $3 Million seed round from world class investors",
  "url": "https://www.canva.com/newsroom/news/aussie-startup-canva-announces-3-million-seed-round-world-class-investors/"
}

March 20, 2013 company announcement; historical product and team account, not a complete present-day AI product or funding history.

March 20, 2013 company announcement; historical product and team account, not a complete present-day AI product or funding history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Platform/company launch 2013; distinguish predecessor Fusion Books founded 2007.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.canva.com/newsroom/news/aussie-startup-canva-announces-3-million-seed-round-world-class-investors/",
        "https://www.canva.com/newsroom/news/canva-create-2022/"
      ],
      "year": 2013
    }
  ]
}

Amazon

AWS’s origin account dates its launch to spring 2006, aiming to make computing infrastructure accessible without each customer managing a large data center.

It identifies S3 storage and EC2 computing as early services in that shift.

Sources and details

Our Origins

{
  "access_scope": "Official AWS origins narrative; the cloud-infrastructure contribution within Amazon, not the whole company’s history or a guarantee of cost, privacy or security outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:55.781879+00:00"
  },
  "id": "organization-company-49d2dc07acd9ef::S1",
  "title": "Our Origins",
  "url": "https://aws.amazon.com/about-aws/our-origins//"
}

Official AWS origins narrative; the cloud-infrastructure contribution within Amazon, not the whole company’s history or a guarantee of cost, privacy or security outcomes.

Official AWS origins narrative; the cloud-infrastructure contribution within Amazon, not the whole company’s history or a guarantee of cost, privacy or security outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Amazon founded 1994; AWS cloud-services launch 2006 is a separate date.",
      "date": "1994",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.aboutamazon.com/officers-and-directors/default.aspx?stream=top",
        "https://aws.amazon.com/about-aws/our-origins//",
        "https://aws.amazon.com/ai/"
      ],
      "year": 1994
    }
  ]
}

Boston Dynamics

Boston Dynamics’ June 2020 announcement opened commercial sales of Spot after an earlier short-term leasing program.

The company described configurable uses including construction documentation and monitoring remote or hazardous environments.

Sources and details

Commercial Sales of Spot Robot Launch | Boston Dynamics

{
  "access_scope": "June 16, 2020 launch announcement; historical sales model and described uses, not independently verified safety improvements or universal autonomous capability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication_date": "June 16, 2020",
    "retrieved_utc": "2026-10-07T17:58:57.568771+00:00"
  },
  "id": "organization-company-42e70561b53bae::S1",
  "title": "Commercial Sales of Spot Robot Launch | Boston Dynamics",
  "url": "https://bostondynamics.com/news/boston-dynamics-launches-commercial-sales-of-spot-robot/"
}

June 16, 2020 launch announcement; historical sales model and described uses, not independently verified safety improvements or universal autonomous capability.

June 16, 2020 launch announcement; historical sales model and described uses, not independently verified safety improvements or universal autonomous capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official history says founded in 1992 as a spinout from the MIT Leg Lab.",
      "date": "1992",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://bostondynamics.com/news/boston-dynamics-launches-commercial-sales-of-spot-robot/",
        "https://bostondynamics.com/news/hyundai-motor-group-completes-acquisition-of-boston-dynamics-from-softbank/"
      ],
      "year": 1992
    }
  ]
}

Arm

Arm’s September 2026 announcement distinguishes configurable Neoverse compute subsystems for custom chips from production-ready Arm AGI CPUs.

It presents the two approaches as choices for workloads with different throughput, responsiveness and integration needs.

Sources and details

Arm expands AI infrastructure for the agentic era with AGI CPU and Neoverse CSS N4  - Arm Newsroom

{
  "access_scope": "Official September8,2026 product announcement; architecture positioning, not independent performance or market-share verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:07.958874+00:00"
  },
  "id": "supply-org-006::S1",
  "title": "Arm expands AI infrastructure for the agentic era with AGI CPU and Neoverse CSS N4  - Arm Newsroom",
  "url": "https://newsroom.arm.com/news/arm-agi-cpu-neoverse-css-n4-agentic-ai"
}

Official September 8, 2026 product announcement; architecture positioning, not independent performance or market-share verification.

Official September 8, 2026 product announcement; architecture positioning, not independent performance or market-share verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Cerebras

Cerebras describes CS-3 clusters as separating computation from external memory through its Weight Streaming architecture.

Its March 2024 announcement says MemoryX units expand memory capacity while the connected cluster presents a single-chip programming model.

Sources and details

Cerebras CS-3: the world’s fastest and most scalable AI accelerator - Cerebras

{
  "access_scope": "Official March12,2024 CS-3 announcement, Scalability; design description, not independently verified training speed, model capacity or comparative cost.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:24.065042+00:00"
  },
  "id": "supply-org-007::S1",
  "title": "Cerebras CS-3: the world’s fastest and most scalable AI accelerator - Cerebras",
  "url": "https://www.cerebras.ai/blog/cerebras-cs3"
}

Official March 12, 2024 CS-3 announcement, Scalability; design description, not independently verified training speed, model capacity or comparative cost.

Official March 12, 2024 CS-3 announcement, Scalability; design description, not independently verified training speed, model capacity or comparative cost.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company chronology states 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.cerebras.ai/company"
      ],
      "year": 2015
    }
  ]
}

Groq

Groq describes its Language Processing Unit as an inference processor designed around linear-algebra workloads and compiler-directed execution.

Its architectural principles include a programmable assembly line, deterministic computation and networking, and on-chip memory.

Sources and details

What is a Language Processing Unit? | Groq is the premier neocloud for fast inference

{
  "access_scope": "Official LPU architecture overview and Software First section; vendor design account, no independent superiority or energy-efficiency guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:00.064323+00:00"
  },
  "id": "supply-org-008::S1",
  "title": "What is a Language Processing Unit? | Groq is the premier neocloud for fast inference",
  "url": "https://groq.com/blog/the-groq-lpu-explained"
}

Official LPU architecture overview and Software First section; vendor design account, no independent superiority or energy-efficiency guarantee.

Official LPU architecture overview and Software First section; vendor design account, no independent superiority or energy-efficiency guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official August 2026 corporate announcement states established 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://groq.com/newsroom/groq-and-nvidia-enter-non-exclusive-inference-technology-licensing-agreement-to-accelerate-ai-inference-at-global-scale",
        "https://groq.com/newsroom/groq-becomes-an-nvidia-cloud-partner"
      ],
      "year": 2016
    }
  ]
}

Lightmatter

Lightmatter describes photonic interconnects as a way to address communication bottlenecks among processors in large AI systems.

Its stated infrastructure focus includes optical interconnects and lasers, alongside a longer-term interest in photonic computation.

Sources and details

About - Lightmatter®

{
  "access_scope": "Official About/Mission page; portfolio and strategic direction, not independent cluster-speed or utilization evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:04.130880+00:00"
  },
  "id": "supply-org-010::S1",
  "title": "About - Lightmatter®",
  "url": "https://lightmatter.co/about/"
}

Official About/Mission page; portfolio and strategic direction, not independent cluster-speed or utilization evidence.

Official About/Mission page; portfolio and strategic direction, not independent cluster-speed or utilization evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://lightmatter.co/about/",
        "https://lightmatter.co/vision/"
      ],
      "year": 2017
    }
  ]
}

Samsung Foundry

Samsung Foundry describes manufacturing chips for fabless customers together with design-support infrastructure.

That support includes libraries, process design kits, design methodologies and design services, connecting chip design with fabrication.

Sources and details

Foundry | Business Areas | Samsung Semiconductor Global

{
  "access_scope": "Official foundry-business introduction; vendor service description, no independent yield, node-performance or market-position audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:17.229066+00:00"
  },
  "id": "supply-org-012::S1",
  "title": "Foundry | Business Areas | Samsung Semiconductor Global",
  "url": "https://semiconductor.samsung.com/about-us/business-area/foundry/"
}

Official foundry-business introduction; vendor service description, no independent yield, node-performance or market-position audit.

Official foundry-business introduction; vendor service description, no independent yield, node-performance or market-position audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

GlobalFoundries

GlobalFoundries describes silicon-photonics technologies for optical connections in data centers and AI infrastructure.

Its portfolio combines photonics, radio-frequency technology and advanced packaging to support pluggable and co-packaged optics.

Sources and details

Technologies | GlobalFoundries

{
  "access_scope": "Official technology portfolio, Silicon photonics; capability description, not independently measured bandwidth or efficiency.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:59.250244+00:00"
  },
  "id": "supply-org-013::S1",
  "title": "Technologies | GlobalFoundries",
  "url": "https://gf.com/technologies/"
}

Official technology portfolio, Silicon photonics; capability description, not independently measured bandwidth or efficiency.

Official technology portfolio, Silicon photonics; capability description, not independently measured bandwidth or efficiency.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

ASML

ASML supplies lithography systems used to produce microchip patterns on silicon wafers.

Its product account combines lithography with computational modeling, optical metrology and electron-beam inspection to support patterning and process optimization.

Sources and details

ASML products & services | Supplying the semiconductor industry

{
  "access_scope": "Official products overview; portfolio role, not independent resolution, production-yield or industry-dominance verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:23.232511+00:00"
  },
  "id": "supply-org-016::S1",
  "title": "ASML products & services | Supplying the semiconductor industry",
  "url": "https://www.asml.com/en/products"
}

Official products overview; portfolio role, not independent resolution, production-yield or industry-dominance verification.

Official products overview; portfolio role, not independent resolution, production-yield or industry-dominance verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

SK hynix

SK hynix’s account of MWC 2026 separates its memory exhibits into HBM, data-center memory, on-device AI memory and automotive applications.

It explains high-bandwidth memory as vertically connecting multiple DRAM chips and describes on-device AI as computation performed on the device itself.

Sources and details

SK hynix Unveils Latest AI Memory Solutions at MWC 2026, Showcasing Its Technological Capabilities as a Full Stack AI Memory Creator – SK hynix Newsroom

{
  "access_scope": "Official March2026 exhibition account and definition footnotes; historical display and terminology, no independent leadership or performance comparison.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:06.958158+00:00"
  },
  "id": "supply-org-023::S1",
  "title": "SK hynix Unveils Latest AI Memory Solutions at MWC 2026, Showcasing Its Technological Capabilities as a Full Stack AI Memory Creator – SK hynix Newsroom",
  "url": "https://news.skhynix.com/en/mwc-2026/"
}

Official March 2026 exhibition account and definition footnotes; historical display and terminology, no independent leadership or performance comparison.

Official March 2026 exhibition account and definition footnotes; historical display and terminology, no independent leadership or performance comparison.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Micron

Micron’s HBM3E product page describes memory cubes assembled in eight-high and twelve-high stacks for AI computing.

The page connects memory technology and packaging to moving data into and out of GPUs.

Sources and details

HBM3E | Micron Technology Inc.

{
  "access_scope": "Official cached HBM3E product description; memory/package role, not independent power savings or current availability audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:31.536216+00:00"
  },
  "id": "supply-org-024::S1",
  "title": "HBM3E | Micron Technology Inc.",
  "url": "https://www.micron.com/products/memory/hbm/hbm3e"
}

Official cached HBM3E product description; memory/package role, not independent power savings or current availability audit.

Official cached HBM3E product description; memory/package role, not independent power savings or current availability audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Amkor

Amkor’s TSV packaging process starts with wafers that already contain blind through-silicon vias.

It thins the wafers to expose those vias and adds backside metallization to complete the connections.

Amkor explicitly distinguishes this backend processing from forming the original vias in foundry wafers.

Sources and details

2.5D/3D TSV Packaging - Amkor Technology

{
  "access_scope": "Official2.5D/3D TSV process description; distinguishes wafer fabrication from backend packaging responsibilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:53.734592+00:00"
  },
  "id": "supply-org-026::S1",
  "title": "2.5D/3D TSV Packaging - Amkor Technology",
  "url": "https://amkor.com/technology/25d-3d-tsv/"
}

Official 2.5D/3D TSV process description; distinguishes wafer fabrication from backend packaging responsibilities.

Official 2.5D/3D TSV process description; distinguishes wafer fabrication from backend packaging responsibilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Arista

Arista describes Ethernet networking as connecting accelerators, storage and other systems for AI training and inference.

Its Etherlink portfolio includes congestion signaling, packet-distribution features and telemetry to support traffic management in these networks.

Sources and details

AI Networking Center | Artificial Intelligence AI technology - Arista

{
  "access_scope": "Official AI networking overview and Etherlink portfolio; feature descriptions, not independently proven losslessness, latency or cluster-scale performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:23.231810+00:00"
  },
  "id": "supply-org-027::S1",
  "title": "AI Networking Center | Artificial Intelligence AI technology - Arista",
  "url": "https://www.arista.com/en/solutions/ai-networking"
}

Official AI networking overview and Etherlink portfolio; feature descriptions, not independently proven losslessness, latency or cluster-scale performance.

Official AI networking overview and Etherlink portfolio; feature descriptions, not independently proven losslessness, latency or cluster-scale performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Alphabet / Google Cloud

Google Cloud’s documentation defines TPUs as Google-developed application-specific integrated circuits for machine-learning workloads.

It describes access to Cloud TPU through Compute Engine, Google Kubernetes Engine and Vertex AI.

Sources and details

Cloud TPU documentation  |  Google Cloud Documentation

{
  "access_scope": "Official Cloud TPU documentation landing-page definition; service-access account, not a complete Alphabet history or accelerator comparison.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:39.702876+00:00"
  },
  "id": "supply-org-031::S1",
  "title": "Cloud TPU documentation  |  Google Cloud Documentation",
  "url": "https://docs.cloud.google.com/tpu/docs"
}

Official Cloud TPU documentation landing-page definition; service-access account, not a complete Alphabet history or accelerator comparison.

Official Cloud TPU documentation landing-page definition; service-access account, not a complete Alphabet history or accelerator comparison.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

AWS

AWS presents Trainium as part of an integrated AI system spanning chips, servers, networking, software and cloud services.

Its account connects the Neuron SDK with host processors, Elastic Fabric Adapter networking and orchestration tools rather than treating the accelerator as an isolated chip.

Sources and details

AI Accelerator - AWS Trainium - AWS

{
  "access_scope": "Official Trainium system description; vendor integration account, no independent cost-per-token, compatibility or scaling guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:54.545112+00:00"
  },
  "id": "supply-org-032::S1",
  "title": "AI Accelerator - AWS Trainium - AWS",
  "url": "https://aws.amazon.com/ai/machine-learning/trainium/"
}

Official Trainium system description; vendor integration account, no independent cost-per-token, compatibility or scaling guarantee.

Official Trainium system description; vendor integration account, no independent cost-per-token, compatibility or scaling guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Oracle

Oracle organizes its AI offering across business applications, generative models and agents, prebuilt AI services, data platforms and infrastructure.

Its service description includes adapting prebuilt models with enterprise data and managing machine-learning models using open-source frameworks or in-database tools.

Sources and details

Artificial Intelligence (AI) | Oracle

{
  "access_scope": "Official AI portfolio, Applications through AI infrastructure; available categories and stated workflows, not verified business-value outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:33.206825+00:00"
  },
  "id": "supply-org-034::S1",
  "title": "Artificial Intelligence (AI) | Oracle",
  "url": "https://www.oracle.com/artificial-intelligence/"
}

Official AI portfolio, Applications through AI infrastructure; available categories and stated workflows, not verified business-value outcomes.

Official AI portfolio, Applications through AI infrastructure; available categories and stated workflows, not verified business-value outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Software Development Laboratories established/incorporated 1977; later names and corporate reorganizations distinguished.",
      "date": "1977",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.oracle.com/uk/corporate/",
        "https://investor.oracle.com/faq/default.aspx",
        "https://www.oracle.com/artificial-intelligence/"
      ],
      "year": 1977
    }
  ]
}

Equinix

Equinix describes US colocation services that combine data-center space with cooling, interconnection and cloud connectivity.

Its offer also includes disaster-recovery options, security and technical support around the hosted infrastructure.

Sources and details

USA Data Centers, Colocation & AI-Ready Infrastructure | Equinix

{
  "access_scope": "Official US colocation service description; offering components, not independently audited uptime, renewable-energy coverage or latency.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:27.789256+00:00"
  },
  "id": "supply-org-035::S1",
  "title": "USA Data Centers, Colocation & AI-Ready Infrastructure | Equinix",
  "url": "https://www.equinix.com/data-centers/americas-colocation/united-states-colocation"
}

Official US colocation service description; offering components, not independently audited uptime, renewable-energy coverage or latency.

Official US colocation service description; offering components, not independently audited uptime, renewable-energy coverage or latency.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Vertiv

Vertiv’s June 2026 cooling article links sensor visibility, device-level control and system-level orchestration across the thermal chain.

It describes using temperature and flow data to adjust cooling responses, including variable-speed pumps reacting to GPU thermal output.

The article also presents digital twins as a way to test thermal designs and control algorithms before physical deployment.

Sources and details

Adaptive, resilient liquid cooling: How intelligence is upgrading the thermal chain

{
  "access_scope": "Official June15,2026 technical article, thermal-chain components and digital twins; design rationale, not independently quantified energy savings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:37.896393+00:00"
  },
  "id": "supply-org-037::S1",
  "title": "Adaptive, resilient liquid cooling: How intelligence is upgrading the thermal chain",
  "url": "https://www.vertiv.com/en-us/insights/articles/blog-posts/adaptive-resilient-liquid-cooling-how-intelligence-is-upgrading-the-thermal-chain/"
}

Official June 15, 2026 technical article, thermal-chain components and digital twins; design rationale, not independently quantified energy savings.

Official June 15, 2026 technical article, thermal-chain components and digital twins; design rationale, not independently quantified energy savings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Schneider Electric

Schneider Electric’s July 2026 article treats grid access, electrical distribution and cooling as interconnected constraints on AI deployment.

It argues for coordinating utility availability, UPS systems, rack power, cooling distribution and monitoring across the full power path.

Sources and details

Data center power density: Why liquid cooling - Schneider Electric Blog

{
  "access_scope": "Official July28,2026 infrastructure-planning article; vendor argument and planning components, no independent demand forecast, PUE or savings verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:55.338964+00:00"
  },
  "id": "supply-org-038::S1",
  "title": "Data center power density: Why liquid cooling - Schneider Electric Blog",
  "url": "https://blog.se.com/datacenter/2026/07/28/data-center-power-density-planning-liquid-cooled-ai-data-centers-around-grid-and-power-constraints/"
}

Official July 28, 2026 infrastructure-planning article; vendor argument and planning components, no independent demand forecast, PUE or savings verification.

Official July 28, 2026 infrastructure-planning article; vendor argument and planning components, no independent demand forecast, PUE or savings verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Shin-Etsu

Shin-Etsu describes producing semiconductor wafers by growing a single-crystal silicon ingot, slicing it, and then shaping and polishing the slices.

The finished wafer provides a substrate on which semiconductor devices are manufactured.

Sources and details

Silicon Wafers | Electronics Materials | Business & Products | Shin-Etsu Chemical Co., Ltd.

{
  "access_scope": "Official Silicon Wafers process description; manufacturing role, not independently audited purity, defect rate or market share.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:33.770350+00:00"
  },
  "id": "supply-org-045::S1",
  "title": "Silicon Wafers | Electronics Materials | Business & Products | Shin-Etsu Chemical Co., Ltd.",
  "url": "https://www.shinetsu.co.jp/en/products/semiconductor-silicon-business/silicon-wafers/"
}

Official Silicon Wafers process description; manufacturing role, not independently audited purity, defect rate or market share.

Official Silicon Wafers process description; manufacturing role, not independently audited purity, defect rate or market share.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

TOK

TOK identifies photoresists as chemicals used with photolithography in semiconductor manufacturing.

Its company overview connects these materials to its micro-fabrication and high-purification technologies.

Sources and details

What is TOK | TOKYO OHKA KOGYO CO., LTD.

{
  "access_scope": "Official TOK overview, Photoresists and Core Technology; materials role, no independent projected market-share verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:37.253829+00:00"
  },
  "id": "supply-org-047::S1",
  "title": "What is TOK | TOKYO OHKA KOGYO CO., LTD.",
  "url": "https://www.tok.co.jp/eng/who-we-are/glance"
}

Official TOK overview, Photoresists and Core Technology; materials role, no independent projected market-share verification.

Official TOK overview, Photoresists and Core Technology; materials role, no independent projected market-share verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Linde

Linde’s electronics brochure describes supplying specialty gases, bulk and pipeline gases, equipment and services to electronics manufacturers.

Its quality account covers the supply chain from raw materials to gas delivery at the point of use in customers’ semiconductor fabs.

Sources and details

Linde source

{
  "access_scope": "Official electronics brochure, pages4–5 portfolio and quality discussion; supplier process account, no audit of comparative safety or environmental performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:54.347805+00:00"
  },
  "id": "supply-org-049::S1",
  "title": "Linde source",
  "url": "https://assets.linde.com/-/media/celum-connect/2023/12/21/15/11/linde20electronics20brochure185963.pdf"
}

Official electronics brochure, pages 4–5 portfolio and quality discussion; supplier process account, no audit of comparative safety or environmental performance.

Official electronics brochure, pages 4–5 portfolio and quality discussion; supplier process account, no audit of comparative safety or environmental performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Algorithmic Justice League

The Algorithmic Justice League combines art and research to examine the social implications and harms of AI.

Its stated principles include affirmative consent, meaningful transparency, continuous accountability and critique that leads to changes in practice.

Sources and details

Mission, Team and Story - The Algorithmic Justice League

{
  "access_scope": "Official About page, Mission and Principles; self-described institutional agenda, not independently measured advocacy outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:02.847098+00:00"
  },
  "id": "organization-ai-5e4e95eea9eeb1::S1",
  "title": "Mission, Team and Story - The Algorithmic Justice League",
  "url": "https://www.ajl.org/about"
}

Official About page, Mission and Principles; self-described institutional agenda, not independently measured advocacy outcomes.

Official About page, Mission and Principles; self-described institutional agenda, not independently measured advocacy outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Center for AI Safety

The Center for AI Safety describes its mission as reducing societal-scale AI risks through safety research, field-building and advocacy for standards.

Its public program list includes fellowships, educational courses and compute infrastructure for researchers.

Sources and details

Center for AI Safety (CAIS)

{
  "access_scope": "Official mission and field-building overview; stated activities, not demonstrated risk reduction or expert-consensus verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:56.114262+00:00"
  },
  "id": "organization-ai-843803088b487a::S1",
  "title": "Center for AI Safety (CAIS)",
  "url": "https://safe.ai/"
}

Official mission and field-building overview; stated activities, not demonstrated risk reduction or expert-consensus verification.

Official mission and field-building overview; stated activities, not demonstrated risk reduction or expert-consensus verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

MIT AI Laboratory

MIT’s institutional history traces its Artificial Intelligence Laboratory to an AI project founded in 1959.

It distinguishes that laboratory from the Laboratory for Computer Science and records their merger into CSAIL in 2003.

Sources and details

Mission & History | MIT CSAIL

{
  "access_scope": "CSAIL official Mission & History, AI Lab and merger paragraphs; historical entity boundary, not blanket transfer of every CSAIL result to the earlier AI Lab.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:09.910238+00:00"
  },
  "id": "organization-ai-913090f89bd373::S1",
  "title": "Mission & History | MIT CSAIL",
  "url": "https://www.csail.mit.edu/about/mission-history"
}

CSAIL official Mission & History, AI Lab and merger paragraphs; historical entity boundary, not blanket transfer of every CSAIL result to the earlier AI Lab.

CSAIL official Mission & History, AI Lab and merger paragraphs; historical entity boundary, not blanket transfer of every CSAIL result to the earlier AI Lab.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Previously admitted source-scoped institutional history claim.",
      "date": "1959",
      "kind": "documented_began_event",
      "source_urls": [
        "https://www.csail.mit.edu/about/mission-history"
      ],
      "year": 1959
    }
  ]
}

Mistral AI

Mistral describes tailored AI systems for enterprises and governments, supported by models, developer tools, applications and compute.

Its stated approach emphasizes customer control, ownership and production reliability.

Sources and details

About Mistral | Open, frontier AI for all.

{
  "access_scope": "Official About page, enterprise/government description; business positioning, not a blanket open-source license or independent reliability claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:53.009316+00:00"
  },
  "id": "organization-ai-f1fff94a8e8008::S1",
  "title": "About Mistral | Open, frontier AI for all.",
  "url": "https://mistral.ai/about/"
}

Official About page, enterprise/government description; business positioning, not a blanket open-source license or independent reliability claim.

Official About page, enterprise/government description; business positioning, not a blanket open-source license or independent reliability claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company history states April 2023.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://mistral.ai/about/"
      ],
      "year": 2023
    }
  ]
}

Cohere

Cohere’s March 2025 policy submission describes enterprise AI models and products emphasizing privacy, security, multilingual support and verifiability.

It presents flexible deployment across cloud platforms and private, air-gapped environments as part of its enterprise approach.

The submission advocates adoption-focused procurement, risk-based governance and public research infrastructure.

Sources and details

Cohere source

{
  "access_scope": "Official March15,2025 policy submission, Introduction and About Cohere; company description and advocacy, not independently validated deployment or policy results.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:38.823937+00:00"
  },
  "id": "organization-ai-e39780fa8ea724::S1",
  "title": "Cohere source",
  "url": "https://cohere.com/blog-assets/cohere-response-to-wh-ai-action-plan.pdf"
}

Official March 15, 2025 policy submission, Introduction and About Cohere; company description and advocacy, not independently validated deployment or policy results.

Official March 15, 2025 policy submission, Introduction and About Cohere; company description and advocacy, not independently validated deployment or policy results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founded in Toronto in 2019.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://cohere.com/about?hsa_ad=655500232962&hsa_mt=b",
        "https://cohere.com/blog-assets/cohere-response-to-wh-ai-action-plan.pdf"
      ],
      "year": 2019
    }
  ]
}

Safe Superintelligence

Safe Superintelligence describes a research effort with the single stated product goal of building safe superintelligence.

Its public statement proposes advancing safety and capabilities together while keeping safety ahead of capability growth.

Sources and details

Safe Superintelligence Inc.

{
  "access_scope": "Official institutional mission statement; declared research goal, not proof of achieving superintelligence or solving safety.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:00.391556+00:00"
  },
  "id": "organization-ai-96d33303ad93a1::S1",
  "title": "Safe Superintelligence Inc.",
  "url": "https://ssi.inc/"
}

Official institutional mission statement; declared research goal, not proof of achieving superintelligence or solving safety.

Official institutional mission statement; declared research goal, not proof of achieving superintelligence or solving safety.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Character.ai

Character.ai’s introduction describes an end-to-end stack covering data, model training, serving and the user interface.

Its beta platform lets users create and interact with conversational agents, connecting user experience with the company’s research and product development.

Sources and details

Introducing Character

{
  "access_scope": "Official Introducing Character announcement; historical product/organization account, not AGI achievement, individual invention or current scale verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:36.562604+00:00"
  },
  "id": "organization-ai-27cd06301e75d9::S1",
  "title": "Introducing Character",
  "url": "https://blog.character.ai/introducing-character/"
}

Official Introducing Character announcement; historical product/organization account, not AGI achievement, individual invention or current scale verification.

Official Introducing Character announcement; historical product/organization account, not AGI achievement, individual invention or current scale verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "December 2022 founding post describes first thirteen months, supporting company start in 2021; beta launch September 2022. Year is inferred from dated company account, not incorporation verified.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": true,
      "source_urls": [
        "https://blog.character.ai/introducing-character/",
        "https://abc.xyz/assets/e1/57/8a65483e43feaa709f6cc5cc0737/annualreport2024-web.pdf"
      ],
      "year": 2021
    }
  ]
}

Coursera

Coursera describes working with universities and companies to distribute online learning to individuals and organizations.

Its learning formats include projects, courses, job-oriented certificates and degree programs.

Sources and details

About Coursera | Coursera

{
  "access_scope": "Official About page, learning-partner overview; platform role, not audited learning outcomes, partner counts or current corporate-combination status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:08.866396+00:00"
  },
  "id": "organization-ai-5695641be17544::S1",
  "title": "About Coursera | Coursera",
  "url": "https://www.coursera.org/about/"
}

Official About page, learning-partner overview; platform role, not audited learning outcomes, partner counts or current corporate-combination status.

Official About page, learning-partner overview; platform role, not audited learning outcomes, partner counts or current corporate-combination status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Alphabet

Larry Page’s August 2015 announcement presents Alphabet as a collection of companies with Google as its largest business.

It separates operating leadership within businesses from group-level capital allocation and proposes reporting Google’s financial results separately from other Alphabet businesses.

Sources and details

G is for Google

{
  "access_scope": "Official August10,2015 reorganization announcement; historical stated organization design, not a current corporate-structure or leadership audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:36.863140+00:00"
  },
  "id": "organization-ai-ac57b0e667bf3e::S1",
  "title": "G is for Google",
  "url": "https://blog.google/alphabet/google-alphabet/"
}

Official August 10, 2015 reorganization announcement; historical stated organization design, not a current corporate-structure or leadership audit.

Official August 10, 2015 reorganization announcement; historical stated organization design, not a current corporate-structure or leadership audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Alphabet created in 2015 as parent; Google operating company dates to 1998.",
      "date": "2015",
      "kind": "parent_company_formation",
      "qualified": false,
      "source_urls": [
        "https://blog.google/alphabet/google-alphabet/",
        "https://abc.xyz/assets/investor/static/pdf/2015_alphabet_annual_report.pdf"
      ],
      "year": 2015
    }
  ]
}

Google Brain

Google’s April 2023 announcement says the Brain team from Google Research and DeepMind would be brought together in Google DeepMind.

It separately describes Google Research continuing fundamental work across computing and other domains.

Sources and details

Google DeepMind: Bringing together two world-class AI teams

{
  "access_scope": "Official April20,2023 reorganization announcement; historical team boundary, not recertification of current reporting lines or sole invention credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:37.581168+00:00"
  },
  "id": "organization-ai-51faf5a151892a::S1",
  "title": "Google DeepMind: Bringing together two world-class AI teams",
  "url": "https://blog.google/technology/ai/april-ai-update/"
}

Official April 20, 2023 reorganization announcement; historical team boundary, not recertification of current reporting lines or sole invention credit.

Official April 20, 2023 reorganization announcement; historical team boundary, not recertification of current reporting lines or sole invention credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Duolingo

Duolingo’s cached Max guide describes AI-mediated conversation practice and feedback on learners’ responses.

It says humans write Roleplay scenarios and initial messages and review generated content, combining curriculum design with interactive generation.

Sources and details

Duolingo Max Uses OpenAI’s GPT-4 For New Learning Features

{
  "access_scope": "Official cached Max guide, Roleplay and human-content review; page bears March14,2023 but may include later revisions, so current feature text is not asserted as the original launch specification or evidence of learning efficacy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:36.775859+00:00"
  },
  "id": "organization-company-0453b8f9e9b209::S1",
  "title": "Duolingo Max Uses OpenAI’s GPT-4 For New Learning Features",
  "url": "https://blog.duolingo.com/duolingo-max/"
}

Official cached Max guide, Roleplay and human-content review; page bears March 14, 2023 but may include later revisions, so current feature text is not asserted as the original launch specification or evidence of learning efficacy.

Official cached Max guide, Roleplay and human-content review; page bears March 14, 2023 but may include later revisions, so current feature text is not asserted as the original launch specification or evidence of learning efficacy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company co-founded in August 2011 per official board biography; this is separate from later public service launch.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://investors.duolingo.com/board-member/severin-hacker-0",
        "https://blog.duolingo.com/duolingo-max/"
      ],
      "year": 2011
    }
  ]
}

Modal

Modal’s general-availability announcement describes a cloud-function platform configured through Python code.

It supports GPU inference endpoints, batch jobs, scheduled functions and persistent-storage definitions through that programming interface.

Sources and details

Modal is now generally available

{
  "access_scope": "Official general-availability announcement, platform description; historical product scope, no current hardware, price or developer-productivity guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:53.236198+00:00"
  },
  "id": "organization-company-18093cad26441a::S1",
  "title": "Modal is now generally available",
  "url": "https://modal.com/blog/general-availability-and-series-a"
}

Official general-availability announcement, platform description; historical product scope, no current hardware, price or developer-productivity guarantee.

Official general-availability announcement, platform description; historical product scope, no current hardware, price or developer-productivity guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official October 2023 general-availability post says work on Modal started in 2021; 2023 is GA, not founding.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://modal.com/company",
        "https://modal.com/blog/general-availability-and-series-a"
      ],
      "year": 2021
    }
  ]
}

Anyscale

Anyscale’s December 2019 announcement connects its distributed-programming platform to the open-source Ray project.

It describes scaling Ray applications from a laptop to a cluster to reduce the infrastructure expertise developers need.

Sources and details

Founders of Open Source Project Ray Launch Anyscale with $20.6M in Funding to Democratize Distributed Programming | Anyscale

{
  "access_scope": "Official December17/18,2019 launch announcement; historical positioning, not independently verified developer productivity or current customer/financing status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:03.293957+00:00"
  },
  "id": "organization-company-1bf43af666bab7::S1",
  "title": "Founders of Open Source Project Ray Launch Anyscale with $20.6M in Funding to Democratize Distributed Programming | Anyscale",
  "url": "https://www.anyscale.com/blog/founders-of-open-source-project-ray-launch-anyscale-with-20-6m-in-funding-to-democratize-distributed-programming"
}

Official December 17/18, 2019 launch announcement; historical positioning, not independently verified developer productivity or current customer/financing status.

Official December 17/18, 2019 launch announcement; historical positioning, not independently verified developer productivity or current customer/financing status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company launch and financing announcement in December 2019; official company LinkedIn profile explicitly lists 2019. Ray project's earlier history is separate.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.anyscale.com/blog/founders-of-open-source-project-ray-launch-anyscale-with-20-6m-in-funding-to-democratize-distributed-programming",
        "https://www.linkedin.com/company/joinanyscale/",
        "https://www.nscale.com/press-releases/nscale-acquires-anyscale",
        "https://www.sec.gov/Archives/edgar/data/2110365/000119312526395475/ck0002110365-20260918.htm"
      ],
      "year": 2019
    }
  ]
}

Glean

Glean describes enterprise AI grounded in a company’s knowledge, data and context.

Its stated design principles include preserving source permissions, building in oversight and letting customers control what the AI can access.

Sources and details

About Glean | Enterprise AI Platform for Work

{
  "access_scope": "Official About page, opening and How we build and use AI; governance design claims, not an independent permissions, security or productivity audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:18.319464+00:00"
  },
  "id": "organization-company-30b5b45bb2159b::S1",
  "title": "About Glean | Enterprise AI Platform for Work",
  "url": "https://www.glean.com/about"
}

Official About page, opening and How we build and use AI; governance design claims, not an independent permissions, security or productivity audit.

Official About page, opening and How we build and use AI; governance design claims, not an independent permissions, security or productivity audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.glean.com/press/glean-introduces-third-generation-ai-assistant-new-enterprise-graph-to-enable-the-superintelligent-enterprise",
        "https://www.glean.com/about",
        "https://www.glean.com/press/glean-announces-over-200m-series-d-to-accelerate-secure-deployment-of-generative-ai-in-the-enterprise"
      ],
      "year": 2019
    }
  ]
}

Arize AI

Arize describes observability, evaluation and guardrails for AI systems deployed in production.

Its platform account focuses on monitoring and debugging models, including language-model agents and multimodal systems.

Sources and details

About Arize AI | Founders, Team, Awards & AI Infra & Ethics Alliance

{
  "access_scope": "Official About introduction; tool scope, not proof that instrumentation reveals complete internal reasoning or guarantees reliability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:35.086324+00:00"
  },
  "id": "organization-company-3171bad2558ca9::S1",
  "title": "About Arize AI | Founders, Team, Awards & AI Infra & Ethics Alliance",
  "url": "https://arize.com/about/"
}

Official About introduction; tool scope, not proof that instrumentation reveals complete internal reasoning or guarantees reliability.

Official About introduction; tool scope, not proof that instrumentation reveals complete internal reasoning or guarantees reliability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founders explicitly date establishment to 2020 in their February 2025 funding announcement.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://arize.com/about/",
        "https://arize.com/blog/arize-ai-raises-70m-series-c-to-build-the-gold-standard-for-ai-evaluation-observability/"
      ],
      "year": 2020
    }
  ]
}

DeepL

DeepL describes language tools spanning translation, application interfaces and voice-based communication.

Its voice products include translated captions for online meetings and support for face-to-face conversations across languages.

Sources and details

About Us: DeepL's mission to break down language barriers

{
  "access_scope": "Official About product list; service description, not independently verified accuracy, human equivalence, security or language coverage.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:14.774065+00:00"
  },
  "id": "organization-company-35d1922b7f8dba::S1",
  "title": "About Us: DeepL's mission to break down language barriers",
  "url": "https://www.deepl.com/en/about-us"
}

Official About product list; service description, not independently verified accuracy, human equivalence, security or language coverage.

Official About product list; service description, not independently verified accuracy, human equivalence, security or language coverage.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Current official company page states DeepL founded in 2017 by Jarek Kutylowski. Company's older XING profile says it began as Linguee in 2009 and launched DeepL Translator in summer 2017. Use 2017 for DeepL identity, not as an unqualified original legal-entity incorporation date.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.deepl.com/en/about-us",
        "https://www.xing.com/pages/deepl-se/about_us"
      ],
      "year": 2017
    }
  ]
}

Notion

Ivan Zhao’s November 2023 account describes Notion AI features for summarizing, drafting, translating and improving text.

It also describes workspace Q&A as a way to answer questions using information across a user’s workspace.

Sources and details

The crucial moments and decisions leading up to the launch of Notion AI

{
  "access_scope": "Official November30,2023 retrospective introduction; historical feature account, not independently verified adoption, productivity or exclusive pioneering credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:03.789911+00:00"
  },
  "id": "organization-company-73bcfe98830b53::S1",
  "title": "The crucial moments and decisions leading up to the launch of Notion AI",
  "url": "https://www.notion.com/blog/behind-the-scenes-notion-ai"
}

Official November 30, 2023 retrospective introduction; historical feature account, not independently verified adoption, productivity or exclusive pioneering credit.

Official November 30, 2023 retrospective introduction; historical feature account, not independently verified adoption, productivity or exclusive pioneering credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder retrospective states company started 2013; 2018 is product traction/Notion 2.0, not founding.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.notion.com/blog/behind-the-scenes-notion-ai",
        "https://www.notion.com/de/blog/100-million-of-you"
      ],
      "year": 2013
    }
  ]
}

PathAI

PathAI describes developing AI models to analyze patient tissue samples.

Its stated service scope runs from laboratory work to algorithm deployment for clinical trials and diagnostic use.

Sources and details

About PathAI

{
  "access_scope": "Official About introduction; intended applications and service scope, not clinical efficacy, regulatory clearance or patient-outcome verification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:36.218780+00:00"
  },
  "id": "organization-company-20400d1c7f0a89::S1",
  "title": "About PathAI",
  "url": "https://www.pathai.com/about-us"
}

Official About introduction; intended applications and service scope, not clinical efficacy, regulatory clearance or patient-outcome verification.

Official About introduction; intended applications and service scope, not clinical efficacy, regulatory clearance or patient-outcome verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company timeline marks founding in 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.pathai.com/about-us",
        "https://www.pathai.com/resources/pathai-announces-completion-of-165-million-financing-for-advancing-medicine-with-ai-powered-pathology",
        "https://www.roche.com/investors/updates/inv-update-2026-05-07",
        "https://www.roche.com/investors/updates/inv-update-2026-07-23",
        "https://www.pathai.com/resources/quest-diagnostics-completes-acquisition-of-select-pathai-diagnostics-lab-assets-from-pathai-accelerating-adoption-of-ai-and-digital-pathology-to-speed-cancer-"
      ],
      "year": 2016
    }
  ]
}

Roboflow

Roboflow’s origin account identifies image annotation and model benchmarking as obstacles encountered while building a real-time Sudoku vision application.

It presents the resulting platform as a toolkit for developers and enterprises building computer-vision applications.

Sources and details

About | Roboflow

{
  "access_scope": "Official About origin account and product positioning; no guaranteed training/deployment time or independently audited adoption scale.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:55.171119+00:00"
  },
  "id": "organization-company-12bbb237b229ed::S1",
  "title": "About | Roboflow",
  "url": "https://roboflow.com/about"
}

Official About origin account and product positioning; no guaranteed training/deployment time or independently audited adoption scale.

Official About origin account and product positioning; no guaranteed training/deployment time or independently audited adoption scale.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official brand history says founded in 2019; company about page distinguishes 2020 public launch.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://roboflow.com/about",
        "https://roboflow.com/blog/roboflow-information",
        "https://roboflow.com/blog/author/brad"
      ],
      "year": 2019
    }
  ]
}

Inceptive

Inceptive describes foundation models for sequence-based medicines trained on heterogeneous biological observations.

Its account combines computational scoring with in-house laboratory validation in vitro and in vivo, and experimental data generation where training data are lacking.

Sources and details

Inceptive | Foundation models of life, for life.

{
  "access_scope": "Official foundation-model and wet/dry validation descriptions; research workflow, not validated drug efficacy, clinical approval or independently proven cost/time savings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:47.565474+00:00"
  },
  "id": "organization-ai-d71ab9fbca7af9::S1",
  "title": "Inceptive | Foundation models of life, for life.",
  "url": "https://inceptive.com/"
}

Official foundation-model and wet/dry validation descriptions; research workflow, not validated drug efficacy, clinical approval or independently proven cost/time savings.

Official foundation-model and wet/dry validation descriptions; research workflow, not validated drug efficacy, clinical approval or independently proven cost/time savings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

CoreWeave

CoreWeave presents ARIA as a research assistant that analyzes training runs, identifies what changed and recommends another iteration.

The tool sits alongside its computing infrastructure, connecting model experimentation with the operation of that infrastructure.

Sources and details

The Essential Cloud for AI | CoreWeave

{
  "access_scope": "Company homepage, ARIA and infrastructure descriptions as cached; product positioning, not verified benchmark gains, reliability or a complete company history.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:06.991869+00:00"
  },
  "id": "organization-ai-ba7c5cf0236d1b::S1",
  "title": "The Essential Cloud for AI | CoreWeave",
  "url": "https://www.coreweave.com/"
}

Company homepage, ARIA and infrastructure descriptions as cached; product positioning, not verified benchmark gains, reliability or a complete company history.

Company homepage, ARIA and infrastructure descriptions as cached; product positioning, not verified benchmark gains, reliability or a complete company history.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Corporate history dates founding to 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.coreweave.com/about-us",
        "https://www.coreweave.com/blog/coreweave-2025-annual-report-shareholder-letter"
      ],
      "year": 2017
    }
  ]
}

WhyLabs

WhyLabs’ closure notice says the company is discontinuing operations and has open-sourced its platform.

The notice identifies whylogs for data logging and monitoring, and langkit for monitoring language-model systems.

Sources and details

WhyLabs

{
  "access_scope": "Undated company closure notice captured in the cache; the notice’s account of open-source tools, not independently verified privacy or security properties.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:01.627204+00:00"
  },
  "id": "organization-company-03a5f1960f9ef9::S1",
  "title": "WhyLabs",
  "url": "https://whylabs.ai/"
}

Undated company closure notice captured in the cache; the notice’s account of open-source tools, not independently verified privacy or security properties.

Undated company closure notice captured in the cache; the notice’s account of open-source tools, not independently verified privacy or security properties.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "2019 company founding is reported by contemporary coverage; primary investor evidence places incubation at AI2 and first investment in 2020. December 2019 is secondary-supported rather than registry-verified.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": true,
      "source_urls": [
        "https://www.madrona.com/companies/",
        "https://whylabs.ai/",
        "https://venturebeat.com/ai/whylabs-raises-4-million-to-grow-ai-and-data-monitoring-platform",
        "https://www.geekwire.com/2025/founders-at-seattle-startup-whylabs-join-apple-following-under-the-radar-acquisition/",
        "https://digital-markets-act-cases.ec.europa.eu/acquisitions"
      ],
      "year": 2019
    }
  ]
}

Hume AI

Hume’s account describes using a speech-language model to turn Claude’s responses into spoken conversations.

It links this voice interface with research on expressive behavior, while presenting the integration as a developer tool.

Sources and details

Hume AI + Anthropic create emotionally intelligent voice interactions | Hume Blog | Hume AI

{
  "access_scope": "Company article on its Claude voice integration; reported design, not proof of empathy, emotional understanding, clinical benefit or its quoted performance metrics.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:26.701630+00:00"
  },
  "id": "organization-company-05d393c4a0a40a::S1",
  "title": "Hume AI + Anthropic create emotionally intelligent voice interactions | Hume Blog | Hume AI",
  "url": "https://www.hume.ai/blog/hume-anthropic-claude-voice-interactions"
}

Company article on its Claude voice integration; reported design, not proof of empathy, emotional understanding, clinical benefit or its quoted performance metrics.

Company article on its Claude voice integration; reported design, not proof of empathy, emotional understanding, clinical benefit or its quoted performance metrics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company-authored November 2024 history explicitly says founded in 2021; incorporation date not separately verified.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.hume.ai/blog/hume-anthropic-claude-voice-interactions",
        "https://www.prnewswire.com/news-releases/hume-ai-appoints-new-ceo-302668103.html"
      ],
      "year": 2021
    }
  ]
}

Covariant

Amazon’s announcement describes Covariant’s models as supporting robot perception, reasoning and action in warehouse tasks.

The agreement gave Amazon a non-exclusive license to Covariant’s robotic foundation models.

The announcement also identifies Covariant researchers and founders joining Amazon’s robotics effort.

Sources and details

Amazon hires from AI robotics startup Covariant, licenses technology

{
  "access_scope": "Amazon’s commercial-agreement announcement; licensing and team transition, not an acquisition of all Covariant or verified safety improvements.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:01.806145+00:00"
  },
  "id": "organization-company-1b4bfba5cbafe8::S1",
  "title": "Amazon hires from AI robotics startup Covariant, licenses technology",
  "url": "https://www.aboutamazon.com/news/company-news/amazon-covariant-ai-robots"
}

Amazon’s commercial-agreement announcement; licensing and team transition, not an acquisition of all Covariant or verified safety improvements.

Amazon’s commercial-agreement announcement; licensing and team transition, not an acquisition of all Covariant or verified safety improvements.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://covariant.ai/our-approach/",
        "https://www.aboutamazon.com/news/company-news/amazon-covariant-ai-robots"
      ],
      "year": 2017
    }
  ]
}

Inworld AI

Inworld’s overview connects speech recognition, language-model inference and speech synthesis within a realtime voice-application stack.

Its router lets developers select models for different users, scenarios and price points without rebuilding the surrounding application.

Dedicated compute is presented as another option when shared inference capacity no longer fits the workload.

Sources and details

What is Inworld AI? Realtime Voice AI Research Lab

{
  "access_scope": "Cached product overview labeled February 19, 2026 and containing later model references; the captured page’s architecture description, not its original release specification or verified latency and cost.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:09.641182+00:00"
  },
  "id": "organization-company-30f65e893c1fd8::S1",
  "title": "What is Inworld AI? Realtime Voice AI Research Lab",
  "url": "https://inworld.ai/resources/what-is-inworld-ai"
}

Cached product overview labeled February 19, 2026 and containing later model references; the captured page’s architecture description, not its original release specification or verified latency and cost.

Cached product overview labeled February 19, 2026 and containing later model references; the captured page’s architecture description, not its original release specification or verified latency and cost.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company profile states founded in 2021; November 2021 company-issued seed announcement confirms operation that year.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.globenewswire.com/news-release/2021/11/08/2329206/0/en/inworld-ai-announces-7-million-in-seed-funding-from-kleiner-perkins-crv-and-meta-for-metaverse-ai-development-platform.html",
        "https://inworld.ai/resources/what-is-inworld-ai",
        "https://www.linkedin.com/company/inworld-ai/"
      ],
      "year": 2021
    }
  ]
}

GitLab Inc.

GitLab’s 2021 listing announcement presents one platform where engineering, security and operations teams collaborate on software delivery.

Its founder’s account credits Dmitriy Zaporozhets with creating GitLab in Ukraine in 2011 and Sid Sijbrandij with discovering the project in 2012.

Sources and details

GitLab Inc. takes The DevOps Platform public

{
  "access_scope": "October 14, 2021 company announcement and founder’s account; historical organization and platform model, not independently measured delivery speed or security compliance.",
  "authors": [
    "Sid Sijbrandij"
  ],
  "authors_in_source_order": [
    "Sid Sijbrandij"
  ],
  "dates": {
    "publication_date": "October 14, 2021",
    "retrieved_utc": "2026-10-07T17:56:33.906612+00:00"
  },
  "id": "organization-company-37f5747e3f5700::S1",
  "title": "GitLab Inc. takes The DevOps Platform public",
  "url": "https://about.gitlab.com/blog/gitlab-inc-takes-the-devops-platform-public/"
}

October 14, 2021 company announcement and founder’s account; historical organization and platform model, not independently measured delivery speed or security compliance.

October 14, 2021 company announcement and founder’s account; historical organization and platform model, not independently measured delivery speed or security compliance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "GitLab Inc. incorporation in 2014 per founder's S-1 letter. Distinct milestones: open-source project began in 2011 (Dmitriy Zaporozhets and Valeriy Sizov); GitLab B.V. commercial entity co-founded in 2013 (Zaporozhets and Sytse Sijbrandij).",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://about.gitlab.com/blog/gitlab-inc-takes-the-devops-platform-public/",
        "https://about.gitlab.com/blog/letter-from-shareholders/",
        "https://about.gitlab.com/press/releases/2026-01-15-gitlab-announces-duo-agent-platform-general-availability/"
      ],
      "year": 2014
    }
  ]
}

Motive

Motive’s rebranding account describes an IoT platform that connects vehicles, equipment and facilities to the cloud.

Its applications combine tracking, telematics, maintenance and other physical-operations workflows.

The move from KeepTruckin to Motive reflects a stated expansion beyond trucking into industries such as construction and agriculture.

Sources and details

Meet Motive: Why we changed our name and mission

{
  "access_scope": "Company rebranding article, operating-platform and market-scope passages; stated functions, not verified safety, productivity or profitability gains.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:42.618812+00:00"
  },
  "id": "organization-company-3c304325a9d42f::S1",
  "title": "Meet Motive: Why we changed our name and mission",
  "url": "https://gomotive.com/blog/meet-motive/"
}

Company rebranding article, operating-platform and market-scope passages; stated functions, not verified safety, productivity or profitability gains.

Company rebranding article, operating-platform and market-scope passages; stated functions, not verified safety, productivity or profitability gains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "KeepTruckin launched in 2013; renamed Motive April 12, 2022.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://gomotive.com/blog/meet-motive/",
        "https://gomotive.com/blog/motive-rebrand/",
        "https://gomotive.com/blog/motive-engineering-blog/",
        "https://gomotive.com/en-gb/company/leadership/"
      ],
      "year": 2013
    }
  ]
}

Aurora Innovation

Aurora’s company account records Chris Urmson, Drew Bagnell and Sterling Anderson founding the company in 2017.

Its stated autonomy mission includes supplementing human-driven freight fleets with self-driving technology.

Sources and details

Company

{
  "access_scope": "Corporate company page, founding and freight mission; collective organization history and intended application, not a safety certification or proof of autonomous performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:55.247343+00:00"
  },
  "id": "organization-company-432378d294dc09::S1",
  "title": "Company",
  "url": "https://aurora.tech/company"
}

Corporate company page, founding and freight mission; collective organization history and intended application, not a safety certification or proof of autonomous performance.

Corporate company page, founding and freight mission; collective organization history and intended application, not a safety certification or proof of autonomous performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company identifies 2017 as founding year; some pre-formation executive work began in December 2016.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://aurora.tech/company",
        "https://ir.aurora.tech/company-information/leadership-team"
      ],
      "year": 2017
    }
  ]
}

Nuro

Nuro’s timeline records a progression from its 2016 founding to custom autonomous delivery vehicles and commercial delivery work.

It identifies a 2024 strategy change toward licensing its vehicle-autonomy technology to manufacturers and mobility providers.

Sources and details

Company | Nuro

{
  "access_scope": "Company timeline, 2016–2018 and 2024 milestones; reported operating-model transition, with regulatory permissions, incident claims and safety comparisons excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:04.234495+00:00"
  },
  "id": "organization-company-4d80243802fd7d::S1",
  "title": "Company | Nuro",
  "url": "https://www.nuro.ai/company"
}

Company timeline, 2016–2018 and 2024 milestones; reported operating-model transition, with regulatory permissions, incident claims and safety comparisons excluded.

Company timeline, 2016–2018 and 2024 milestones; reported operating-model transition, with regulatory permissions, incident claims and safety comparisons excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company timeline marks Nuro founded in 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.nuro.ai/company"
      ],
      "year": 2016
    }
  ]
}

Suno

Suno’s product overview combines a browser-based music studio with audio models for creating and shaping songs.

Its Voices and Personas feature is presented as a way to carry a consistent artistic identity across creations.

Sources and details

Suno | About

{
  "access_scope": "Company About-page product descriptions; intended creative controls, not verified output quality, legal permission for generated music or an audit of training rights.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:21.599752+00:00"
  },
  "id": "organization-company-4c57d8f0e66cbc::S1",
  "title": "Suno | About",
  "url": "https://suno.com/about"
}

Company About-page product descriptions; intended creative controls, not verified output quality, legal permission for generated music or an audit of training rights.

Company About-page product descriptions; intended creative controls, not verified output quality, legal permission for generated music or an audit of training rights.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company About page explicitly states 2022 founding.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://suno.com/about",
        "https://www.usv.com/portfolio/company/suno",
        "https://www.wmg.com/news/warner-music-group-and-suno-forge-groundbreaking-partnership"
      ],
      "year": 2022
    }
  ]
}

Weights & Biases

CoreWeave’s announcement records completing its acquisition of Weights & Biases.

The stated integration connects computing infrastructure with experiment tracking across model development and deployment.

Sources and details

CoreWeave Acquires Weights & Biases | CoreWeave

{
  "access_scope": "Company acquisition-completion announcement; transaction and stated workflow integration, not independently verified efficiency, performance or financial returns.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:36.423493+00:00"
  },
  "id": "organization-company-543b9cb384d3f3::S1",
  "title": "CoreWeave Acquires Weights & Biases | CoreWeave",
  "url": "https://www.coreweave.com/blog/coreweave-completes-acquisition-of-weights-biases?trk=article-ssr-frontend-pulse_little-text-block"
}

Company acquisition-completion announcement; transaction and stated workflow integration, not independently verified efficiency, performance or financial returns.

Company acquisition-completion announcement; transaction and stated workflow integration, not independently verified efficiency, performance or financial returns.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Both acquirer announcement and current official acquired-company page explicitly state 2017 founding.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.coreweave.com/companies/weights-and-biases",
        "https://investors.coreweave.com/news/news-details/2025/CoreWeave-to-Acquire-Weights--Biases---Industry-Leading-AI-Developer-Platform-for-Building-and-Deploying-AI-Applications/default.aspx",
        "https://www.coreweave.com/blog/coreweave-completes-acquisition-of-weights-biases?trk=article-ssr-frontend-pulse_little-text-block"
      ],
      "year": 2017
    }
  ]
}

Shield AI

Shield AI’s company account records its 2015 founding by Brandon Tseng, Ryan Tseng and Andrew Reiter.

It frames the company around AI pilots and autonomous systems for aerospace and defense applications.

Sources and details

About Shield AI | Autonomy for Defense

{
  "access_scope": "Corporate founding and technology-mission passage; organizational history and stated product category, not tactical operating guidance, verified protection outcomes or invention priority.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:14.442339+00:00"
  },
  "id": "organization-company-554ed517bbf054::S1",
  "title": "About Shield AI | Autonomy for Defense",
  "url": "https://shield.ai/about/"
}

Corporate founding and technology-mission passage; organizational history and stated product category, not tactical operating guidance, verified protection outcomes or invention priority.

Corporate founding and technology-mission passage; organizational history and stated product category, not tactical operating guidance, verified protection outcomes or invention priority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company account states founded 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://shield.ai/about/",
        "https://shield.ai/company-leadership/"
      ],
      "year": 2015
    }
  ]
}

Algolia

Algolia’s interview records Nicolas Dessaigne and Julien Lemoine founding the company in 2012 after working together on text mining and search algorithms.

It describes the product as search technology for companies’ websites and mobile applications.

Sources and details

Rencontrez Nicolas Dessaigne, PDG d'Algolia | Algolia

{
  "access_scope": "Official French-language founder interview, opening context; original English paraphrase of historical roles and product scope, not a complete biography or verified search speed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:28.504590+00:00"
  },
  "id": "organization-company-597dca7f2c0e9d::S1",
  "title": "Rencontrez Nicolas Dessaigne, PDG d'Algolia | Algolia",
  "url": "https://www.algolia.com/fr/about/news/meet-nicolas-dessaigne-ceo-of-algolia"
}

Official French-language founder interview, opening context; original English paraphrase of historical roles and product scope, not a complete biography or verified search speed.

Official French-language founder interview, opening context; original English paraphrase of historical roles and product scope, not a complete biography or verified search speed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company creation in 2012, explicitly stated in an interview republished by Algolia; incorporation date not established.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.algolia.com/fr/about/news/meet-nicolas-dessaigne-ceo-of-algolia",
        "https://www.algolia.com/pdf/SOC-3-Final-Report-latest.pdf"
      ],
      "year": 2012
    }
  ]
}

Aleph Alpha

Aleph Alpha’s overview combines specialized language models, agent applications, a deployment platform and expert services.

It presents this stack as a way for organizations to adapt AI to their own context and retain control over it.

Sources and details

Aleph Alpha

{
  "access_scope": "Corporate product overview as captured; stated operating model, not verified sovereignty, compliance, security or the page’s time-saving claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:52.983719+00:00"
  },
  "id": "organization-company-59a077ff1a4301::S1",
  "title": "Aleph Alpha",
  "url": "https://aleph-alpha.com/en/"
}

Corporate product overview as captured; stated operating model, not verified sovereignty, compliance, security or the page’s time-saving claims.

Corporate product overview as captured; stated operating model, not verified sovereignty, compliance, security or the page’s time-saving claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://aleph-alpha.com/en/news/open-gpt-x-project-start/",
        "https://aleph-alpha.com/en/",
        "https://aleph-alpha.com/en/news/reto-spoerri-leaves-ilhan-scheer-ceo/",
        "https://aleph-alpha.com/en/news/cohere-agreement-transatlantic-sovereign-ai/"
      ],
      "year": 2019
    }
  ]
}

Run:ai

Run:ai’s software manages and orchestrates AI workloads using Kubernetes.

NVIDIA’s announcement describes scheduling across on-premises, cloud and hybrid infrastructure, including large GPU clusters.

The announcement reports an agreement to acquire Run:ai rather than establishing completion of that transaction.

Sources and details

NVIDIA to Acquire GPU Orchestration Software Provider Run:ai | NVIDIA Blog

{
  "access_scope": "NVIDIA acquisition-agreement announcement and platform description; historical transaction stage and intended orchestration functions, not verified utilization gains.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:57.105283+00:00"
  },
  "id": "organization-company-636e0d25647167::S1",
  "title": "NVIDIA to Acquire GPU Orchestration Software Provider Run:ai | NVIDIA Blog",
  "url": "https://blogs.nvidia.com/blog/runai/"
}

NVIDIA acquisition-agreement announcement and platform description; historical transaction stage and intended orchestration functions, not verified utilization gains.

NVIDIA acquisition-agreement announcement and platform description; historical transaction stage and intended orchestration functions, not verified utilization gains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "European Commission merger decision explicitly says founded in 2018; official NVIDIA founder biography corroborates 2018 start.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.nvidia.com/en-us/software/run-ai/",
        "https://blogs.nvidia.com/blog/runai/",
        "https://developer.nvidia.com/blog/author/rdar/",
        "https://www.linkedin.com/posts/tel-aviv-university-engineering-alumni_nvidia-has-completed-its-acquisition-of-our-activity-7281975512686579712-88QM",
        "https://www.linkedin.com/posts/ronen-dar_runai-joins-nvidia-a-new-chapter-begins-activity-7279497712155119616-IaRd",
        "https://ec.europa.eu/competition/mergers/cases1/202516/M_11766_10599624_2741_6.pdf"
      ],
      "year": 2018
    }
  ]
}

Adobe

Adobe’s tribute records John Warnock and Charles Geschke founding the company in 1982 after meeting as Xerox colleagues.

It identifies PostScript as their first product, placing a publishing technology at the start of the company’s history.

Sources and details

Adobe Co-Founder Dr. John Warnock Passes at 82

{
  "access_scope": "August 20, 2023 company tribute; collaborative founding and named product, not a complete publishing-lineage or sole invention-priority audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication_date": "August 20, 2023",
    "retrieved_utc": "2026-10-07T18:00:10.466387+00:00"
  },
  "id": "organization-company-72fd3ae07d96f1::S1",
  "title": "Adobe Co-Founder Dr. John Warnock Passes at 82",
  "url": "https://news.adobe.com/news/news-details/2023/adobe-co-founder-dr-john-warnock-passes-at-82"
}

August 20, 2023 company tribute; collaborative founding and named product, not a complete publishing-lineage or sole invention-priority audit.

August 20, 2023 company tribute; collaborative founding and named product, not a complete publishing-lineage or sole invention-priority audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founded December 1982; incorporated October 1983.",
      "date": "1982",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://news.adobe.com/news/news-details/2023/adobe-co-founder-dr-john-warnock-passes-at-82",
        "https://wwwimages.adobe.com/content/dam/acom/en/fast-facts/pdfs/fast-facts.pdf",
        "https://www.adobe.com/au/about-adobe.html"
      ],
      "year": 1982
    }
  ]
}

Samsara

Samsara’s timeline records Sanjit Biswas and John Bicket founding the company in 2015 around a vehicle gateway for GPS, diagnostics and fleet visibility.

Later entries add equipment monitoring and worksite visibility.

Its 2021 Connected Operations Platform brings these parts of physical operations into one platform.

Sources and details

Samsara | About Us

{
  "access_scope": "Company timeline, 2015, 2019 and 2021 entries; described product evolution, with accident-prevention and carbon-saving metrics excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:09.173064+00:00"
  },
  "id": "organization-company-7f2d0c69daa21c::S1",
  "title": "Samsara | About Us",
  "url": "https://www.samsara.com/company/about"
}

Company timeline, 2015, 2019 and 2021 entries; described product evolution, with accident-prevention and carbon-saving metrics excluded.

Company timeline, 2015, 2019 and 2021 entries; described product evolution, with accident-prevention and carbon-saving metrics excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company timeline states 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.samsara.com/company/about",
        "https://www.samsara.com/uk/company/leadership"
      ],
      "year": 2015
    }
  ]
}

Lambda

Lambda’s infrastructure account combines power, liquid cooling and high-bandwidth interconnects in modular AI computing facilities.

The company positions this infrastructure for teams training and deploying models.

Its About page traces the business to machine-learning engineers founding an AI-focused company in 2012.

Sources and details

About Lambda | AI Computing Platform for Superintelligence

{
  "access_scope": "Corporate infrastructure and origins account; stated architecture and history, not verified scale, workload reliability or superintelligence capability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:59:58.553822+00:00"
  },
  "id": "organization-company-862a3f0fc3caec::S1",
  "title": "About Lambda | AI Computing Platform for Superintelligence",
  "url": "https://lambda.ai/about"
}

Corporate infrastructure and origins account; stated architecture and history, not verified scale, workload reliability or superintelligence capability.

Corporate infrastructure and origins account; stated architecture and history, not verified scale, workload reliability or superintelligence capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Lambda founded 2012; March 25, 2025 domain/name clarification removed Labs.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://lambda.ai/blog/lambda-assembles-leadership-team-to-power-gigawatt-scale-ai-infrastructure",
        "https://lambda.ai/about",
        "https://lambda.ai/blog/lambdalabs.com-is-now-lambda.ai"
      ],
      "year": 2012
    }
  ]
}

WRITER

WRITER’s 2024 platform description combines its Palmyra language models with graph-based retrieval, configurable guardrails and development tools.

The announcement links this stack with systems intended to perform enterprise tasks and workflows.

Sources and details

WRITER raises $200M Series C at $1.9B valuation

{
  "access_scope": "November 12, 2024 company announcement, platform passage; components and intended work, not verified tool-calling accuracy, security or regulatory compliance.",
  "authors": [
    "Writer Team"
  ],
  "authors_in_source_order": [
    "Writer Team"
  ],
  "dates": {
    "publication_date": "November 12, 2024",
    "retrieved_utc": "2026-10-07T18:00:25.303753+00:00"
  },
  "id": "organization-company-8808adca7c367d::S1",
  "title": "WRITER raises $200M Series C at $1.9B valuation",
  "url": "https://writer.com/blog/series-c-funding-writer-press-release/"
}

November 12, 2024 company announcement, platform passage; components and intended work, not verified tool-calling accuracy, security or regulatory compliance.

November 12, 2024 company announcement, platform passage; components and intended work, not verified tool-calling accuracy, security or regulatory compliance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://writer.com/newsroom/",
        "https://writer.com/blog/series-c-funding-writer-press-release/"
      ],
      "year": 2020
    }
  ]
}

ElevenLabs

ElevenLabs’ January 2023 launch account describes speech synthesis for narrating long-form content.

Its model adjusts vocal delivery using the surrounding context, and its tools include voice cloning and synthetic-voice design.

At that launch, cross-language dubbing was presented as a longer-term development goal.

Sources and details

ElevenLabs Raises $2M and Announces AI Speech Platform

{
  "access_scope": "January 23, 2023 launch article body; historical product and plans, excluding modern navigation banners, current availability and rights clearance for cloned voices.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_scope": "Historical launch body; modern promotional navigation excluded",
    "publication_date": "January 23, 2023",
    "retrieved_utc": "2026-10-07T17:59:06.617417+00:00"
  },
  "id": "organization-company-91268016fe6765::S1",
  "title": "ElevenLabs Raises $2M and Announces AI Speech Platform",
  "url": "https://elevenlabs.io/blog/elevenlabs-raises-2m-pre-seed-and-announces-ai-speech-platform-promising-to-revolutionize-audio-storytelling"
}

January 23, 2023 launch article body; historical product and plans, excluding modern navigation banners, current availability and rights clearance for cloned voices.

January 23, 2023 launch article body; historical product and plans, excluding modern navigation banners, current availability and rights clearance for cloned voices.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded 2022; beta service launched January 2023.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://help.elevenlabs.io/hc/en-us/articles/27583713738257-What-is-ElevenLabs",
        "https://elevenlabs.io/press",
        "https://elevenlabs.io/blog/elevenlabs-raises-2m-pre-seed-and-announces-ai-speech-platform-promising-to-revolutionize-audio-storytelling"
      ],
      "year": 2022
    }
  ]
}

Descript

Descript’s article pairs multitrack podcast production with Overdub, a tool for correcting spoken lines by typing.

The article describes restricting Overdub’s cloning to the user’s own voice as a deliberate product boundary.

Sources and details

Descript Podcast Studio and Overdub: The Launch

{
  "access_scope": "Podcast Studio and Overdub article body, page marked updated July 29, 2026; described editing workflow and stated restriction, not verified enforcement, current pricing or complete voice rights.",
  "authors": [
    "Andrew Mason"
  ],
  "authors_in_source_order": [
    "Andrew Mason"
  ],
  "dates": {
    "original_launch_date": "Not inferred from the page update label",
    "page_update_date": "July 29, 2026",
    "retrieved_utc": "2026-10-07T18:00:47.748612+00:00"
  },
  "id": "organization-company-92f21d81061823::S1",
  "title": "Descript Podcast Studio and Overdub: The Launch",
  "url": "https://www.descript.com/blog/article/introducing-descript-podcast-studio-overdub"
}

Podcast Studio and Overdub article body, page marked updated July 29, 2026; described editing workflow and stated restriction, not verified enforcement, current pricing or complete voice rights.

Podcast Studio and Overdub article body, page marked updated July 29, 2026; described editing workflow and stated restriction, not verified enforcement, current pricing or complete voice rights.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder launch post dated 2017-12-12 and official company profile explicitly lists 2017; prior internal development at Detour is separate.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.descript.com/blog/article/introducing-descript-podcast-studio-overdub",
        "https://medium.com/descript/introducing-descript-fa37eb193819",
        "https://www.linkedin.com/company/descript"
      ],
      "year": 2017
    }
  ]
}

Numerai

Numerai’s essay argues that restricted access to proprietary financial datasets limits who can participate in market-prediction research.

It proposes structure-preserving transformations intended to let machine-learning researchers work with shared data while obscuring the raw inputs.

Sources and details

Encrypted Data For Efficient Markets

{
  "access_scope": "Company essay’s data-access argument and proposed sharing mechanism; no independently verified cryptographic security, investment performance or financial advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:56.539719+00:00"
  },
  "id": "organization-company-94de16862a53d1::S1",
  "title": "Encrypted Data For Efficient Markets",
  "url": "https://blog.numer.ai/encrypted-data-for-efficient-markets/"
}

Company essay’s data-access argument and proposed sharing mechanism; no independently verified cryptographic security, investment performance or financial advice.

Company essay’s data-access argument and proposed sharing mechanism; no independently verified cryptographic security, investment performance or financial advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder account dates platform launch December 1, 2015; incorporation not separately verified.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://blog.numer.ai/encrypted-data-for-efficient-markets/",
        "https://blog.numer.ai/numerais-master-plan/"
      ],
      "year": 2015
    }
  ]
}

Pinecone

Pinecone’s origin account centers on providing storage and retrieval infrastructure for AI applications that use vector search.

It describes a managed service intended to make this capability accessible to teams without the resources to build custom large-scale search systems.

Sources and details

Company | Pinecone

{
  "access_scope": "Corporate origin story; stated infrastructure and access model, not sole invention of vector databases, verified retrieval accuracy or a full founder career audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:06.544824+00:00"
  },
  "id": "organization-company-b5ba8d2ee0e192::S1",
  "title": "Company | Pinecone",
  "url": "https://www.pinecone.io/company/"
}

Corporate origin story; stated infrastructure and access model, not sole invention of vector databases, verified retrieval accuracy or a full founder career audit.

Corporate origin story; stated infrastructure and access model, not sole invention of vector databases, verified retrieval accuracy or a full founder career audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year explicitly stated on official company page; public vector-database beta came later.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.pinecone.io/company/"
      ],
      "year": 2019
    }
  ]
}

Runway

Runway’s research vision places world models at the center of general-purpose simulation.

It argues that simulated trial and error could accelerate learning compared with experimentation solely in the physical world.

Sources and details

About Runway AI Video Platform | Runway AI

{
  "access_scope": "Corporate research-vision passage; proposed direction, not proof of general intelligence, dependable physics simulation or scientific and medical benefits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:12.913281+00:00"
  },
  "id": "organization-company-b735ff99e52529::S1",
  "title": "About Runway AI Video Platform | Runway AI",
  "url": "https://runway.com/about"
}

Corporate research-vision passage; proposed direction, not proof of general intelligence, dependable physics simulation or scientific and medical benefits.

Corporate research-vision passage; proposed direction, not proof of general intelligence, dependable physics simulation or scientific and medical benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Investor account states founded 2018.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://salesforceventures.com/perspectives/welcome-runway/",
        "https://runway.com/about"
      ],
      "year": 2018
    }
  ]
}

Comet

Comet’s Opik provides observability and evaluation tools for language-model applications and agent systems.

Its About page connects these tools with inspecting behavior and feeding results back into development.

Listed application settings include chatbots, retrieval-augmented pipelines and agents.

Sources and details

About Us | Comet

{
  "access_scope": "Corporate product overview, Opik and development-workflow passages; stated functions, not verified reliability or faster shipping.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:36.142252+00:00"
  },
  "id": "organization-company-b8cdd253c1ad5a::S1",
  "title": "About Us | Comet",
  "url": "https://www.comet.com/site/about-us/"
}

Corporate product overview, Opik and development-workflow passages; stated functions, not verified reliability or faster shipping.

Corporate product overview, Opik and development-workflow passages; stated functions, not verified reliability or faster shipping.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company timeline says Comet launched in 2017; incorporation date not established.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.comet.com/site/about-us/"
      ],
      "year": 2017
    }
  ]
}

Locus Robotics

Locus Robotics’ account traces its origins to the Quiet Logistics team and warehouse-fulfillment operations.

It presents mobile warehouse automation through a Robots-as-a-Service model.

The timeline describes expanding from early deployments to transport workflows with Locus Vector.

Sources and details

About Us - Locus Robotics

{
  "access_scope": "Company origin account, service-model description and 2023 workflow entry; reported operating model, not verified deployment counts or productivity improvements.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:02.088993+00:00"
  },
  "id": "organization-company-c305256234bd34::S1",
  "title": "About Us - Locus Robotics",
  "url": "https://locusrobotics.com/company/about-us/"
}

Company origin account, service-model description and 2023 workflow entry; reported operating model, not verified deployment counts or productivity improvements.

Company origin account, service-model description and 2023 workflow entry; reported operating model, not verified deployment counts or productivity improvements.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.prnewswire.com/news-releases/locus-robotics-appoints-new-ceo-raises-8m-funding-300274744.html",
        "https://www.prnewswire.com/news-releases/locus-robotics-unveils-groundbreaking-autonomous-navigation-at-promat-2017-show-300434488.html",
        "https://locusrobotics.com/company/about-us/"
      ],
      "year": 2014
    }
  ]
}

Domino Data Lab

Domino combines data, computing infrastructure and development tools for building models, agents and applications.

Its governance approach emphasizes policies, visibility and auditability during development and use.

Sources and details

Domino Data Lab AI company | About us

{
  "access_scope": "Corporate platform and governance overview; intended engineering controls, not a legal compliance determination or verified risk reduction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:59:05.746709+00:00"
  },
  "id": "organization-company-c6d0e29605794b::S1",
  "title": "Domino Data Lab AI company | About us",
  "url": "https://domino.ai/company"
}

Corporate platform and governance overview; intended engineering controls, not a legal compliance determination or verified risk reduction.

Corporate platform and governance overview; intended engineering controls, not a legal compliance determination or verified risk reduction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded in 2013; its data science platform launched in 2014.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://domino.ai/company"
      ],
      "year": 2013
    }
  ]
}

Waymo

The December 2016 announcement describes Waymo becoming an Alphabet business built on Google’s earlier self-driving work.

It identifies prospective uses spanning personal vehicles, ride services, logistics and connections to public transport.

Sources and details

Say hello to Waymo: what’s next for Google’s self-driving car project

{
  "access_scope": "December 13, 2016 company announcement; historical organizational transition and intended applications, with world-first and safety-performance claims excluded.",
  "authors": [
    "John Krafcik"
  ],
  "authors_in_source_order": [
    "John Krafcik"
  ],
  "dates": {
    "publication_date": "December 13, 2016",
    "retrieved_utc": "2026-10-07T18:00:24.680959+00:00"
  },
  "id": "organization-company-c90f574b8468e6::S1",
  "title": "Say hello to Waymo: what’s next for Google’s self-driving car project",
  "url": "https://waymo.com/blog/2016/12/say-hello-to-waymo-whats-next-for/"
}

December 13, 2016 company announcement; historical organizational transition and intended applications, with world-first and safety-performance claims excluded.

December 13, 2016 company announcement; historical organizational transition and intended applications, with world-first and safety-performance claims excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Waymo became a separate Alphabet company on 2016-12-13; predecessor Google Self-Driving Car Project began in 2009.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://waymo.com/blog/2016/12/say-hello-to-waymo-whats-next-for/",
        "https://www.x.company/projects/waymo/",
        "https://waymo.com/blog/2023/07/doubling-down-on-waymo-one/"
      ],
      "year": 2016
    }
  ]
}

Automation Anywhere

Automation Anywhere combines process discovery and automation in a platform spanning front-office and back-office systems.

Its Automation Co-Pilot is presented as a digital assistant for users automating business processes.

Sources and details

Agentic Process Automation Company | Meet the Team | Automation Anywhere

{
  "access_scope": "Corporate platform description; stated workflow capabilities, not a guarantee that anyone can automate safely or that work outcomes improve.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:30.410492+00:00"
  },
  "id": "organization-company-d356fa24e29222::S1",
  "title": "Agentic Process Automation Company | Meet the Team | Automation Anywhere",
  "url": "https://www.automationanywhere.com/company/about-us"
}

Corporate platform description; stated workflow capabilities, not a guarantee that anyone can automate safely or that work outcomes improve.

Corporate platform description; stated workflow capabilities, not a guarantee that anyone can automate safely or that work outcomes improve.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official founder biography dates company to 2003.",
      "date": "2003",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.automationanywhere.com/company/leadership-team?catid=214&id=214%3Atechnology",
        "https://www.automationanywhere.com/company/about-us"
      ],
      "year": 2003
    }
  ]
}

MongoDB, Inc.

The 2013 announcement records 10gen changing its company name to MongoDB to align the business with its database project.

Its founder’s account traces the database to the data layer of an earlier open-source cloud-computing stack.

The announcement says the database project and community website were unaffected by the corporate name change.

Sources and details

10gen Announces Company Name Change to MongoDB, Inc. | MongoDB

{
  "access_scope": "August 27, 2013 announcement body; historical project/company distinction, excluding current product banners and any full software-rights audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_scope": "Historical announcement body, not modern site banners",
    "publication_date": "August 27, 2013",
    "retrieved_utc": "2026-10-07T18:01:01.762809+00:00"
  },
  "id": "organization-company-d3d1f7dcb66839::S1",
  "title": "10gen Announces Company Name Change to MongoDB, Inc. | MongoDB",
  "url": "https://www.mongodb.com/company/newsroom/press-releases/10gen-announces-solutions-name-change-mongodb-inc?msockid=39b5c65855736f610cb8d09f543d6e72"
}

August 27, 2013 announcement body; historical project/company distinction, excluding current product banners and any full software-rights audit.

August 27, 2013 announcement body; historical project/company distinction, excluding current product banners and any full software-rights audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded as 10gen in 2007; renamed MongoDB, Inc. effective 2013-08-27.",
      "date": "2007",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.mongodb.com/company?msockid=39b5c65855736f610cb8d09f543d6e72",
        "https://www.mongodb.com/company/newsroom/press-releases/10gen-announces-solutions-name-change-mongodb-inc?msockid=39b5c65855736f610cb8d09f543d6e72",
        "https://www.mongodb.com/products/platform/atlas-vector-search?msockid=1ff923360e476e4b099935090f8b6f53"
      ],
      "year": 2007
    }
  ]
}

ByteDance

ByteDance’s Seed page presents BytePlus as combining models, development tools and cloud infrastructure for enterprise AI.

The same page describes Dreamina as a creative workspace and Dola as an assistant for everyday work.

Sources and details

ByteDance Seed

{
  "access_scope": "Seed product-and-service descriptions in the cached corporate page; scope of named services, not the whole company’s history or verified productivity and model quality.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:57.690304+00:00"
  },
  "id": "organization-company-08c9a13c70fe40::S1",
  "title": "ByteDance Seed",
  "url": "https://seed.bytedance.com/en/"
}

Seed product-and-service descriptions in the cached corporate page; scope of named services, not the whole company’s history or verified productivity and model quality.

Seed product-and-service descriptions in the cached corporate page; scope of named services, not the whole company’s history or verified productivity and model quality.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official history says founded in 2012 by a team led by Yiming Zhang and Rubo Liang.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.bytedance.com/en/",
        "https://seed.bytedance.com/en/"
      ],
      "year": 2012
    }
  ]
}

Replicate

Replicate’s account describes Cog as a packaging format for machine-learning models.

The company then built a cloud platform that runs those packaged models as API endpoints, handling the underlying inference infrastructure.

The article records Replicate joining Cloudflare.

Sources and details

Why Replicate is joining Cloudflare | Cloudflare Blog

{
  "access_scope": "Official joining announcement, tooling origin story; reported packaging and deployment model, not verified developer outcomes, licensing clearance or current service guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:48.659912+00:00"
  },
  "id": "organization-company-e014d9622f4de1::S1",
  "title": "Why Replicate is joining Cloudflare | Cloudflare Blog",
  "url": "https://blog.cloudflare.com/why-replicate-joining-cloudflare/"
}

Official joining announcement, tooling origin story; reported packaging and deployment model, not verified developer outcomes, licensing clearance or current service guarantees.

Official joining announcement, tooling origin story; reported packaging and deployment model, not verified developer outcomes, licensing clearance or current service guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founders' Cloudflare announcement explicitly says they started Replicate in 2019.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://replicate.com/blog/replicate-cloudflare/",
        "https://blog.cloudflare.com/why-replicate-joining-cloudflare/",
        "https://d18rn0p25nwr6d.cloudfront.net/CIK-0001477333/a78462fd-2bd0-4c99-be0e-144df3a1a44d.pdf"
      ],
      "year": 2019
    }
  ]
}

Workday

Workday’s timeline records Aneel Bhusri and Dave Duffield founding the company in 2005 around cloud applications for HR and finance.

It identifies Talent Insights and Professional Services Automation as early AI capabilities in 2015.

The 2018 Skills Cloud entry connects AI with understanding workforce skills.

Sources and details

Our Story | Workday Aus & NZ

{
  "access_scope": "Corporate timeline, 2005, 2015 and 2018 entries; reported product history, not first-invention priority or verified employment and productivity outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:56.183866+00:00"
  },
  "id": "organization-company-e35c40edf9819d::S1",
  "title": "Our Story | Workday Aus & NZ",
  "url": "https://www.workday.com/en-au/company/about-workday/our-story.html"
}

Corporate timeline, 2005, 2015 and 2018 entries; reported product history, not first-invention priority or verified employment and productivity outcomes.

Corporate timeline, 2005, 2015 and 2018 entries; reported product history, not first-invention priority or verified employment and productivity outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official co-founder biography identifies founding in 2005.",
      "date": "2005",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.workday.com/en-us/company/about-workday/leadership/aneel-bhusri.html/",
        "https://www.workday.com/en-au/company/about-workday/our-story.html"
      ],
      "year": 2005
    }
  ]
}

Niantic Spatial

Niantic Spatial’s overview connects environment reconstruction and visual positioning with models of physical space.

It describes its Large Geospatial Model as supporting reconstruction, localization and spatial understanding.

Scaniverse is presented as an entry point into this system.

Sources and details

About Niantic Spatial | Niantic Spatial, Inc.

{
  "access_scope": "Corporate spatial-model overview; intended functions, not verified geometric accuracy, universal positioning or rights clearance for spatial imagery.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:45.768302+00:00"
  },
  "id": "organization-company-e6a1d5ae1e1f88::S1",
  "title": "About Niantic Spatial | Niantic Spatial, Inc.",
  "url": "https://www.nianticspatial.com/about"
}

Corporate spatial-model overview; intended functions, not verified geometric accuracy, universal positioning or rights clearance for spatial imagery.

Corporate spatial-model overview; intended functions, not verified geometric accuracy, universal positioning or rights clearance for spatial imagery.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Current AI company Niantic Spatial formed May 29, 2025; current official history dates older Niantic incubation at Google to 2011 and independent spinout to 2015.",
      "date": "2025",
      "kind": "separate_company_formation",
      "qualified": false,
      "source_urls": [
        "https://www.nianticspatial.com/about",
        "https://www.nianticspatial.com/en/blog/niantic-spatial-day-one",
        "https://www.scopely.com/en/news/scopely-to-acquire-niantic-games-business-which-includes-pokemon-go-one-of-the-most-successful-mobile-games-of-all-time?tpcc=NL_Marketing"
      ],
      "year": 2025
    }
  ]
}

Weaviate

Weaviate’s retrospective describes using model embeddings to organize, store and retrieve data.

The team’s account connects vector-based retrieval with a database that stores the data rather than leaving storage elsewhere.

Sources and details

Weaviate celebrates a fourth birthday! | Weaviate

{
  "access_scope": "Company fourth-birthday retrospective, early product-design discussion; reported design rationale, not a complete invention-priority audit or verified retrieval performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:26.714022+00:00"
  },
  "id": "organization-company-e95095e1dc9b78::S1",
  "title": "Weaviate celebrates a fourth birthday! | Weaviate",
  "url": "https://weaviate.io/company/playbook/weaviate-celebrates-a-fourth-birthday"
}

Company fourth-birthday retrospective, early product-design discussion; reported design rationale, not a complete invention-priority audit or verified retrieval performance.

Company fourth-birthday retrospective, early product-design discussion; reported design rationale, not a complete invention-priority audit or verified retrieval performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company's July 2023 fourth-birthday retrospective identifies 2019 company start; earlier project exploration is separate. The company formerly used SeMI Technologies.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://weaviate.io/company/playbook/weaviate-celebrates-a-fourth-birthday"
      ],
      "year": 2019
    }
  ]
}

Apple

Apple’s product page presents a conversational assistant that can use personal context to find information in photos, email and notes.

It also describes writing assistance and AI photo-editing controls integrated with familiar applications.

Sources and details

Apple Intelligence and Siri - Apple

{
  "access_scope": "Apple Intelligence/Siri page as cached, including availability footnotes; advertised functions, not a claim of universal rollout, verified privacy or accuracy on personal data.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:31.979904+00:00"
  },
  "id": "organization-company-f223faa96f2291::S1",
  "title": "Apple Intelligence and Siri - Apple",
  "url": "https://www.apple.com/apple-intelligence/"
}

Apple Intelligence/Siri page as cached, including availability footnotes; advertised functions, not a claim of universal rollout, verified privacy or accuracy on personal data.

Apple Intelligence/Siri page as cached, including availability footnotes; advertised functions, not a claim of universal rollout, verified privacy or accuracy on personal data.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Original partnership April 1, 1976; later corporation is a separate legal milestone.",
      "date": "1976",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.sothebys.com/en/auctions/ecatalogue/2011/fine-books-manuscripts-n08811/lot.241.html",
        "https://www.apple.com/newsroom/2026/03/apple-to-celebrate-50-years-of-thinking-different/",
        "https://www.apple.com/apple-intelligence/"
      ],
      "year": 1976
    }
  ]
}

ICEYE

ICEYE builds synthetic-aperture-radar satellite constellations for monitoring changes on Earth.

Its company page identifies uses including environmental monitoring, insurance and emergency management.

It offers both observation services and satellite systems for customers operating their own constellations.

Sources and details

About us | Company | ICEYE

{
  "access_scope": "Corporate company overview; described infrastructure and services, not verified coverage, imagery quality, latency or consequential decision accuracy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:41.592065+00:00"
  },
  "id": "organization-company-f6ae1a072d02cf::S1",
  "title": "About us | Company | ICEYE",
  "url": "https://www.iceye.com/company"
}

Corporate company overview; described infrastructure and services, not verified coverage, imagery quality, latency or consequential decision accuracy.

Corporate company overview; described infrastructure and services, not verified coverage, imagery quality, latency or consequential decision accuracy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder letter in official code of conduct dates company to 2014; research origins and first orbital satellite in 2018 are distinct.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.iceye.com/company",
        "https://www.iceye.com/hubfs/Code-of-Conduct-v3.pdf?hsLang=pl-pl",
        "https://www.iceye.com/company/history"
      ],
      "year": 2014
    }
  ]
}

Microsoft Azure

Microsoft’s Maia 200 announcement describes an accelerator specialized for AI inference, with low-precision tensor cores and memory/data-movement hardware.

The company places it within infrastructure supporting model serving, including Foundry and Copilot.

It also identifies planned use for synthetic-data generation and reinforcement learning.

Sources and details

Maia 200: The AI accelerator built for inference - The Official Microsoft Blog

{
  "access_scope": "January 26, 2026 launch article; described hardware and intended uses, not independently verified performance comparisons, cost savings or current regional availability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication_date": "January 26, 2026",
    "retrieved_utc": "2026-10-07T18:01:48.931203+00:00"
  },
  "id": "organization-unit-microsoft-azure::S1",
  "title": "Maia 200: The AI accelerator built for inference - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2026/01/26/maia-200-the-ai-accelerator-built-for-inference/"
}

January 26, 2026 launch article; described hardware and intended uses, not independently verified performance comparisons, cost savings or current regional availability.

January 26, 2026 launch article; described hardware and intended uses, not independently verified performance comparisons, cost savings or current regional availability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Oracle Cloud Infrastructure

Oracle Cloud Infrastructure offers GPU-backed bare-metal and virtual-machine computing instances.

The page identifies workloads including AI training, inference, graphics, digital twins and high-performance computing.

Sources and details

GPU, Virtual Machines and Bare Metal | Oracle

{
  "access_scope": "Official GPU-computing overview as cached; service and workload categories, not current capacity guarantees, benchmark leadership or recommended purchases.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:47.110159+00:00"
  },
  "id": "organization-unit-oracle-oci::S1",
  "title": "GPU, Virtual Machines and Bare Metal | Oracle",
  "url": "https://www.oracle.com/cloud/compute/gpu/"
}

Official GPU-computing overview as cached; service and workload categories, not current capacity guarantees, benchmark leadership or recommended purchases.

Official GPU-computing overview as cached; service and workload categories, not current capacity guarantees, benchmark leadership or recommended purchases.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Tongyi Lab

Tongyi Lab’s text-embedding-v4 is described as a multilingual text-vector model based on Qwen3.

The documentation allows users to select vector dimensions and identifies Alibaba Cloud Model Studio as the inference provider.

Its listed applications include retrieval, clustering and classification.

Sources and details

text-embedding-v4 Model Info - Alibaba Cloud Model Studio - Alibaba Cloud Documentation Center

{
  "access_scope": "Official version-v4 model documentation; described model and configuration, excluding comparative evaluation scores and current regional service guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:29.040573+00:00",
    "version": "text-embedding-v4; exact cached documentation"
  },
  "id": "organization-unit-tongyi-lab::S1",
  "title": "text-embedding-v4 Model Info - Alibaba Cloud Model Studio - Alibaba Cloud Documentation Center",
  "url": "https://www.alibabacloud.com/help/en/model-studio/text-embedding-v4"
}

Official version-v4 model documentation; described model and configuration, excluding comparative evaluation scores and current regional service guarantees.

Official version-v4 model documentation; described model and configuration, excluding comparative evaluation scores and current regional service guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

The Core Competence of the Corporation

Prahalad and Hamel shift strategic attention from restructuring a corporation to cultivating the capabilities that make future growth possible.

The accessible opening frames identifying and developing core competencies as a responsibility of senior management.

Sources and details

The Core Competence of the Corporation

{
  "access_scope": "HBR opening excerpt only; the subscription article and its detailed cases were not inspected.",
  "authors": [
    "C.K. Prahalad",
    "Gary Hamel"
  ],
  "authors_in_source_order": [
    "C.K. Prahalad",
    "Gary Hamel"
  ],
  "dates": {
    "original_issue": "May–June 1990",
    "retrieved_utc": "2026-10-07T18:11:05.629701+00:00"
  },
  "id": "work-01abd5d4253f::S1",
  "title": "The Core Competence of the Corporation",
  "url": "https://hbr.org/1990/05/the-core-competence-of-the-corporation"
}

HBR opening excerpt only; the subscription article and its detailed cases were not inspected.

HBR opening excerpt only; the subscription article and its detailed cases were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1990
}

Reengineering Work

Hammer argues that putting computers into an old workflow often accelerates rules and processes that should themselves be reconsidered.

The publisher describes reengineering as abandoning inherited ways of working and designing new processes around the possibilities of information technology.

Sources and details

Reengineering Work: Don't Automate, Obliterate

{
  "access_scope": "HBR product description of the 1990 article; no full article access or independent performance evaluation.",
  "authors": [
    "Michael Hammer"
  ],
  "authors_in_source_order": [
    "Michael Hammer"
  ],
  "dates": {
    "publication_date": "1990-07-01",
    "retrieved_utc": "2026-10-07T18:22:06.388850+00:00"
  },
  "id": "work-1dc06cdd2fd9::S1",
  "title": "Reengineering Work: Don't Automate, Obliterate",
  "url": "https://store.hbr.org/product/reengineering-work-don-t-automate-obliterate/90406"
}

HBR product description of the 1990 article; no full article access or independent performance evaluation.

HBR product description of the 1990 article; no full article access or independent performance evaluation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1990 article. Davenport and Short independently contribute to the process-redesign literature.",
  "dated": true,
  "year": 1990
}

QC-circle movement / Genba To QC

JUSE describes a quality circle as a small group of frontline employees continually improving the quality of their work, products and services.

The model combines autonomous group activity, quality-control tools and mutual development with managerial guidance and support.

Sources and details

QC Circles: About QC Circle

{
  "access_scope": "JUSE institutional account of the QC-circle movement; this is not an inspection of an issue of Genba To QC or a measured impact study.",
  "authors": [
    "Union of Japanese Scientists and Engineers"
  ],
  "authors_in_source_order": [
    "Union of Japanese Scientists and Engineers"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:21:16.683716+00:00"
  },
  "id": "work-bc47dfd80386::S1",
  "title": "QC Circles: About QC Circle",
  "url": "https://www.juse.or.jp/english/qc/index.html"
}

JUSE institutional account of the QC-circle movement; this is not an inspection of an issue of Genba To QC or a measured impact study.

JUSE institutional account of the QC-circle movement; this is not an inspection of an issue of Genba To QC or a measured impact study.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "April 1962 magazine milestone, not the birth of all participatory improvement.",
  "dated": true,
  "year": 1962
}

The Undersea Network

Starosielski makes undersea cables and their landing sites visible as the material infrastructure behind apparently wireless global communication.

The publisher presents her argument that cable networks depend on negotiations among technology, geography, culture and political history.

Sources and details

The Undersea Network

{
  "access_scope": "Duke University Press book description; the whole book and its accompanying interactive map were not inspected.",
  "authors": [
    "Nicole Starosielski"
  ],
  "authors_in_source_order": [
    "Nicole Starosielski"
  ],
  "dates": {
    "listed_publication": "March 2015",
    "retrieved_utc": "2026-10-07T18:12:56.276367+00:00"
  },
  "id": "work-coverage-0c09800534f3d0::S1",
  "title": "The Undersea Network",
  "url": "https://www.dukeupress.edu/the-undersea-network"
}

Duke University Press book description; the whole book and its accompanying interactive map were not inspected.

Duke University Press book description; the whole book and its accompanying interactive map were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2015-03"
}

The Work of the Future: Building Better Jobs in an Age of Intelligent Machines

The MIT task force argues that automation, innovation and new tasks can raise productivity without inevitably excluding workers from employment.

Its report introduction locates the distribution of those gains in labor-market institutions, calling for changes to the rules, organizations and policies that shape work.

Sources and details

The Work of the Future: Building Better Jobs in an Age of Intelligent Machines

{
  "access_scope": "MIT report introduction only; its historical assessment is attributed to the task force and is not a forecast for every occupation.",
  "authors": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "authors_in_source_order": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:08.588675+00:00"
  },
  "id": "work-coverage-744bb92b6df64b::S1",
  "title": "The Work of the Future: Building Better Jobs in an Age of Intelligent Machines",
  "url": "https://workofthefuture-taskforce.mit.edu/research-post/the-work-of-the-future-building-better-jobs-in-an-age-of-intelligent-machines/"
}

MIT report introduction only; its historical assessment is attributed to the task force and is not a forecast for every occupation.

MIT report introduction only; its historical assessment is attributed to the task force and is not a forecast for every occupation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"MIT is the institutional affiliation/report body; retain the three named report authors and do not create MIT as a person.\"]",
  "dated": true,
  "year": "2020-11-17"
}

Machine Learning Methods That Economists Should Know About

Athey and Imbens distinguish machine learning’s goals and settings from traditional econometric practice, then survey supervised learning, unsupervised learning and matrix completion.

They highlight methods combining the two traditions for treatment effects, policy estimation and counterfactual price changes.

Sources and details

Machine Learning Methods Economists Should Know About

{
  "access_scope": "arXiv abstract, inspected revision pinned below; this is a methodological survey, not evidence that prediction alone establishes causation.",
  "authors": [
    "Athey, Susan",
    "Imbens, Guido"
  ],
  "authors_in_source_order": [
    "Athey, Susan",
    "Imbens, Guido"
  ],
  "dates": {
    "citation_date": "2019/03/24",
    "inspected_revision": "Sun, 24 Mar 2019 22:58:02 UTC (93 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.673348+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-7eee153e484038::S1",
  "title": "Machine Learning Methods Economists Should Know About",
  "url": "https://arxiv.org/abs/1903.10075",
  "version_url": "https://arxiv.org/abs/1903.10075v1"
}

arXiv abstract, inspected revision pinned below; this is a methodological survey, not evidence that prediction alone establishes causation.

arXiv abstract, inspected revision pinned below; this is a methodological survey, not evidence that prediction alone establishes causation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Replace supplied Athey; Bryan; Gans (2021) with Susan Athey and Guido W. Imbens (2019). Publisher title includes That.\"]",
  "dated": true,
  "year": "2019"
}

The Impact of Machine Learning on Economics

Athey separates early uses of machine learning on text and images from the harder problem of estimating what would happen under a different policy.

The publication summary also identifies prediction policy problems, fairness and manipulability as questions that require economic analysis alongside improved prediction.

Sources and details

The Impact of Machine Learning on Economics

{
  "access_scope": "Stanford author publication summary labeled January 2018 and forthcoming; the later published chapter was not inspected.",
  "authors": [
    "Susan Athey"
  ],
  "authors_in_source_order": [
    "Susan Athey"
  ],
  "dates": {
    "page_label": "January 2018; forthcoming chapter",
    "retrieved_utc": "2026-10-07T18:12:17.126426+00:00"
  },
  "id": "work-coverage-7fe757127fb14f::S1",
  "title": "The Impact of Machine Learning on Economics",
  "url": "https://www.gsb.stanford.edu/faculty-research/publications/impact-machine-learning-economics"
}

Stanford author publication summary labeled January 2018 and forthcoming; the later published chapter was not inspected.

Stanford author publication summary labeled January 2018 and forthcoming; the later published chapter was not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Supplied 2017 can be retained as conference context. NBER lists conference September 2017 and published date May 2019; Stanford lists January 2018 forthcoming version. NBER autogenerated citation says 2018, so use explicit version labels.\"]",
  "dated": true,
  "year": "2018 institutional draft record; May 2019 published chapter"
}

What Can Machines Learn, and What Does It Mean for Occupations and the Economy?

Brynjolfsson, Mitchell and Rock assess the suitability of machine learning for tasks within occupations, treating a job as a bundle of different activities.

Their analysis finds some suitable tasks in most occupations but few occupations whose entire task bundle is suitable, making job redesign and task recombination central to adoption.

Sources and details

What Can Machines Learn and What Does It Mean for Occupations and the Economy?

{
  "access_scope": "2018 AEA paper, first two pages and named task-analysis passage; suitability is not a prediction of job losses or demonstrated deployment.",
  "authors": [
    "Erik Brynjolfsson",
    "Tom Mitchell",
    "Daniel Rock"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Tom Mitchell",
    "Daniel Rock"
  ],
  "dates": {
    "publication_year": "2018",
    "retrieved_utc": "2026-10-07T18:18:58.786443+00:00"
  },
  "doi": "10.1257/pandp.20181019",
  "id": "work-coverage-816ec59d6ce88f::S1",
  "title": "What Can Machines Learn and What Does It Mean for Occupations and the Economy?",
  "url": "https://www.cs.cmu.edu/~tom/pubs/AEA2018-WhatCanMachinesLearn.pdf"
}

2018 AEA paper, first two pages and named task-analysis passage; suitability is not a prediction of job losses or demonstrated deployment.

2018 AEA paper, first two pages and named task-analysis passage; suitability is not a prediction of job losses or demonstrated deployment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"The supplied Machine Learning Suitability Matrix is a descriptive label for the work’s assessment approach, not a separate authorless work.\"]",
  "dated": true,
  "year": "2018"
}

Artificial Intelligence and the Modern Productivity Paradox: A Clash of Expectations and Statistics

Brynjolfsson, Rock and Syverson consider false hopes, measurement problems, redistribution and implementation delays as explanations for strong AI expectations alongside weak measured productivity.

They emphasize the time needed for complementary innovations, organizational change and new skills, describing these investments as intangible capital.

Sources and details

Artificial Intelligence and the Modern Productivity Paradox: A Clash of Expectations and Statistics

{
  "access_scope": "NBER Working Paper 24001 abstract, November 2017; the authors’ explanatory argument is historical, not a current productivity measurement.",
  "authors": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "dates": {
    "citation_publication_date": "2017/11/06",
    "retrieved_utc": "2026-10-07T18:21:18.308562+00:00",
    "working_paper_issue": "November 2017"
  },
  "doi": "10.3386/w24001",
  "id": "work-coverage-da1a3cd3185122::S1",
  "title": "Artificial Intelligence and the Modern Productivity Paradox: A Clash of Expectations and Statistics",
  "url": "https://www.nber.org/papers/w24001"
}

NBER Working Paper 24001 abstract, November 2017; the authors’ explanatory argument is historical, not a current productivity measurement.

NBER Working Paper 24001 abstract, November 2017; the authors’ explanatory argument is historical, not a current productivity measurement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Supplied 2018 is not the NBER working-paper year or final chapter year.\"]",
  "dated": true,
  "year": "2017 working paper; 2019 published chapter"
}

Weapons of Math Destruction: How Big Data Increases Inequality and Threatens Democracy

O’Neil questions the assumption that applying the same mathematical rules to everyone makes consequential decisions fair.

The publisher describes her critique of models that are difficult to challenge and can reinforce discrimination in education, employment, credit and insurance.

Sources and details

Weapons of Math Destruction

{
  "access_scope": "Publisher book description; edition-specific dates are retained separately and individual case studies were not inspected.",
  "authors": [
    "Cathy O’Neil"
  ],
  "authors_in_source_order": [
    "Cathy O’Neil"
  ],
  "dates": {
    "ebook_listed": "2016-09-06",
    "paperback_listed": "2017-09-05",
    "retrieved_utc": "2026-10-07T18:19:05.965717+00:00"
  },
  "id": "work-coverage-eae0734b5baf36::S1",
  "title": "Weapons of Math Destruction",
  "url": "https://www.penguinrandomhouse.com/books/241363/weapons-of-math-destruction-by-cathy-oneil/9780553418835/"
}

Publisher book description; edition-specific dates are retained separately and individual case studies were not inspected.

Publisher book description; edition-specific dates are retained separately and individual case studies were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2016"
}

Platform Revolution: How Networked Markets Are Transforming the Economy—and How to Make Them Work for You

Parker, Van Alstyne and Choudary examine platforms as two-sided markets connecting groups such as buyers and sellers or hosts and visitors.

The publisher describes a strategy guide to market selection, network monetization and adaptation, while also addressing regulation, security and consumer trust.

Sources and details

Platform Revolution

{
  "access_scope": "Norton book description; promotional claims of inevitable market success are not adopted as findings.",
  "authors": [
    "Geoffrey G. Parker",
    "Marshall W. Van Alstyne",
    "Sangeet Paul Choudary"
  ],
  "authors_in_source_order": [
    "Geoffrey G. Parker",
    "Marshall W. Van Alstyne",
    "Sangeet Paul Choudary"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:55.117523+00:00"
  },
  "id": "work-coverage-eed1f9f3abd2b0::S1",
  "title": "Platform Revolution",
  "url": "https://wwnorton.co.uk/books/9780393249132-platform-revolution"
}

Norton book description; promotional claims of inevitable market success are not adopted as findings.

Norton book description; promotional claims of inevitable market success are not adopted as findings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2016"
}

The Age of Surveillance Capitalism: The Fight for a Human Future at the New Frontier of Power

Zuboff frames surveillance capitalism as corporate power directed toward predicting and shaping behavior.

The publisher presents democratic rights and law as her proposed means of placing those digital capabilities under public control.

Sources and details

The Age of Surveillance Capitalism

{
  "access_scope": "PublicAffairs description of the hardcover listed January 15, 2019; this is the author’s argument, not a completed audit of named companies.",
  "authors": [
    "Shoshana Zuboff"
  ],
  "authors_in_source_order": [
    "Shoshana Zuboff"
  ],
  "dates": {
    "hardcover_listed": "2019-01-15",
    "retrieved_utc": "2026-10-07T18:13:31.243145+00:00"
  },
  "id": "work-coverage-fa1e7f18a7b344::S1",
  "title": "The Age of Surveillance Capitalism",
  "url": "https://www.hachettebookgroup.com/titles/shoshana-zuboff/9781610395694/9781610395694/"
}

PublicAffairs description of the hardcover listed January 15, 2019; this is the author’s argument, not a completed audit of named companies.

PublicAffairs description of the hardcover listed January 15, 2019; this is the author’s argument, not a completed audit of named companies.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2019 English edition"
}

Underground Empire: How America Weaponized the World Economy

Farrell and Newman’s opening chapter traces how standardized banking messages could turn an international network into a strategic point of control.

Its account of Citibank’s MARTI system shows why other banks resisted becoming dependent on a communications standard controlled by a competitor.

Sources and details

Underground Empire: How America Weaponized the World Economy

{
  "access_scope": "Publisher-hosted opening chapter excerpt, banking-message passage only; historical claims remain attributed to the authors.",
  "authors": [
    "Henry Farrell",
    "Abraham Newman"
  ],
  "authors_in_source_order": [
    "Henry Farrell",
    "Abraham Newman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:50.192781+00:00"
  },
  "id": "work-coverage-250393abf603fd::S1",
  "title": "Underground Empire: How America Weaponized the World Economy",
  "url": "https://us.macmillan.com/books/9781250840554/undergroundempire/"
}

Publisher-hosted opening chapter excerpt, banking-message passage only; historical claims remain attributed to the authors.

Publisher-hosted opening chapter excerpt, banking-message passage only; historical claims remain attributed to the authors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2023-09-12"
}

Automating Inequality: How High-Tech Tools Profile, Police, and Punish the Poor

Eubanks examines how data mining, policy algorithms and predictive risk models affect poor and working-class Americans.

The publisher presents automated welfare and investigation systems as part of her argument that digital administration can reproduce older practices of surveillance and exclusion.

Sources and details

Automating Inequality: How High-Tech Tools Profile, Police, and Punish the Poor

{
  "access_scope": "Macmillan book description, distinguished from the adjacent historical excerpt and endorsements; no independent verification of each reported case.",
  "authors": [
    "Virginia Eubanks"
  ],
  "authors_in_source_order": [
    "Virginia Eubanks"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:54.298640+00:00"
  },
  "id": "work-coverage-688e0b35f16307::S1",
  "title": "Automating Inequality: How High-Tech Tools Profile, Police, and Punish the Poor",
  "url": "https://us.macmillan.com/books/9781250215789/automatinginequality/"
}

Macmillan book description, distinguished from the adjacent historical excerpt and endorsements; no independent verification of each reported case.

Macmillan book description, distinguished from the adjacent historical excerpt and endorsements; no independent verification of each reported case.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First copyright/publication 2018; linked paperback is 2019.",
  "dated": true,
  "year": 2018
}

The Second Machine Age: Work, Progress, and Prosperity in a Time of Brilliant Technologies

Brynjolfsson and McAfee describe digital technology as a source of greater economic abundance accompanied by disruptive changes to jobs and organizations.

The publisher summarizes their responses as education reform, new human–computer collaborations and policies suited to a changing economy.

Sources and details

The Second Machine Age

{
  "access_scope": "Norton publisher description of The Second Machine Age; its forward-looking claims are not presented as verified present-day outcomes.",
  "authors": [
    "Erik Brynjolfsson",
    "Andrew McAfee"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Andrew McAfee"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:20.024448+00:00"
  },
  "id": "work-coverage-9e3a064651f3dc::S1",
  "title": "The Second Machine Age",
  "url": "https://wwnorton.co.uk/books/9780393239355-the-second-machine-age"
}

Norton publisher description of The Second Machine Age; its forward-looking claims are not presented as verified present-day outcomes.

Norton publisher description of The Second Machine Age; its forward-looking claims are not presented as verified present-day outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2014"
}

In the Age of the Smart Machine: The Future of Work and Power

Zuboff’s author site describes informating as the transformation of activities and events into information through digitalization.

Her account of workplace studies places technical capabilities, workers’ choices and social or economic interests together in shaping computer-mediated work.

Sources and details

In the Age of the Smart Machine: The Future of Work and Power

{
  "access_scope": "Author’s retrospective description of the 1988 book and its research; not a fresh audit of the underlying workplace studies.",
  "authors": [
    "Shoshana Zuboff"
  ],
  "authors_in_source_order": [
    "Shoshana Zuboff"
  ],
  "dates": {
    "original_work_year": "1988",
    "retrieved_utc": "2026-10-07T18:13:26.870515+00:00"
  },
  "id": "work-coverage-a164fdc43293b1::S1",
  "title": "In the Age of the Smart Machine: The Future of Work and Power",
  "url": "https://shoshanazuboff.com/book/books/in-the-age-of-the-smart-machine/"
}

Author’s retrospective description of the 1988 book and its research; not a fresh audit of the underlying workplace studies.

Author’s retrospective description of the 1988 book and its research; not a fresh audit of the underlying workplace studies.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1988
}

The Innovator's Dilemma

Christensen’s book asks how established companies can lose leadership even while following practices that have made them successful.

The institute’s description presents disruptive innovation as a reason managers may need to reconsider those practices when new technologies emerge.

Sources and details

The Innovator’s Dilemma: When New Technologies Cause Great Firms to Fail

{
  "access_scope": "Christensen Institute book description; the mechanism is summarized without importing uninspected examples or treating disruption as inevitable.",
  "authors": [
    "Clayton M. Christensen"
  ],
  "authors_in_source_order": [
    "Clayton M. Christensen"
  ],
  "dates": {
    "page_listed": "1997-01-01",
    "retrieved_utc": "2026-10-07T18:11:26.368164+00:00"
  },
  "id": "work-f71a3825564f::S1",
  "title": "The Innovator’s Dilemma: When New Technologies Cause Great Firms to Fail",
  "url": "https://www.christenseninstitute.org/book/the-innovators-dilemma/"
}

Christensen Institute book description; the mechanism is summarized without importing uninspected examples or treating disruption as inevitable.

Christensen Institute book description; the mechanism is summarized without importing uninspected examples or treating disruption as inevitable.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1997
}

A Post-Labor Economics Manifesto

Shapiro proposes distributing economic decisions and ownership toward the people directly affected, with greater transparency for organizations exercising economic power.

His manifesto combines that decentralization agenda with reducing unnecessary human labor through automation and limiting intermediaries between value creation and its beneficiaries.

Sources and details

A Post-Labor Economics Manifesto

{
  "access_scope": "David Shapiro’s November 9, 2024 manifesto, introductory policy list; these are normative proposals, not established economic laws.",
  "authors": [
    "David Shapiro"
  ],
  "authors_in_source_order": [
    "David Shapiro"
  ],
  "dates": {
    "published": "2024-11-09",
    "retrieved_utc": "2026-10-07T18:16:35.762684+00:00"
  },
  "id": "work-focused-86efb21f86c128::S1",
  "title": "A Post-Labor Economics Manifesto",
  "url": "https://daveshap.substack.com/p/a-post-labor-economics-manifesto"
}

David Shapiro’s November 9, 2024 manifesto, introductory policy list; these are normative proposals, not established economic laws.

David Shapiro’s November 9, 2024 manifesto, introductory policy list; these are normative proposals, not established economic laws.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2024-11-09"
}

Learning Representations by Back-propagating Errors

Rumelhart, Hinton and Williams describe repeatedly adjusting network connection weights to reduce the difference between actual and desired outputs.

Their abstract explains how hidden units develop useful task features through those adjustments.

Sources and details

Learning representations by back-propagating errors

{
  "access_scope": "Nature abstract of the 1986 article only; no claim of sole invention or a complete history of backpropagation.",
  "authors": [
    "Rumelhart, David E.",
    "Hinton, Geoffrey E.",
    "Williams, Ronald J."
  ],
  "authors_in_source_order": [
    "Rumelhart, David E.",
    "Hinton, Geoffrey E.",
    "Williams, Ronald J."
  ],
  "dates": {
    "citation_publication_date": "1986/10",
    "retrieved_utc": "2026-10-07T18:19:28.057389+00:00"
  },
  "id": "work-11ade80f41d0::S1",
  "title": "Learning representations by back-propagating errors",
  "url": "https://www.nature.com/articles/323533a0"
}

Nature abstract of the 1986 article only; no claim of sole invention or a complete history of backpropagation.

Nature abstract of the 1986 article only; no claim of sole invention or a complete history of backpropagation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1986 influential demonstration, not sole invention of reverse-mode differentiation.",
  "dated": true,
  "year": 1986
}

A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

The Dartmouth proposal asks whether aspects of learning and intelligence can be described precisely enough for a machine to simulate them.

It proposes a summer research group organized around circulated ideas, seminars and individual or small-group work.

Sources and details

A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

{
  "access_scope": "August 31, 1955 proposal for a 1956 meeting; its conjectures are research ambitions, not demonstrated capabilities.",
  "authors": [
    "John McCarthy",
    "Marvin Minsky",
    "Nathaniel Rochester",
    "Claude Shannon"
  ],
  "authors_in_source_order": [
    "John McCarthy",
    "Marvin Minsky",
    "Nathaniel Rochester",
    "Claude Shannon"
  ],
  "dates": {
    "proposal": "1955-08-31",
    "proposed_meeting": "summer 1956",
    "retrieved_utc": "2026-10-07T18:20:04.036263+00:00"
  },
  "id": "work-1bb9a0d5fda9::S1",
  "title": "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence",
  "url": "https://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html"
}

August 31, 1955 proposal for a 1956 meeting; its conjectures are research ambitions, not demonstrated capabilities.

August 31, 1955 proposal for a 1956 meeting; its conjectures are research ambitions, not demonstrated capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1955 proposal for the 1956 summer project.",
  "dated": true,
  "year": 1955
}

Man-Computer Symbiosis

Licklider proposes a partnership in which people set goals, hypotheses and evaluation criteria while computers perform preparatory work that can be made routine.

He identifies time sharing, memory organization, programming languages and input/output equipment as prerequisites for more flexible joint decision-making.

Sources and details

Man-Computer Symbiosis

{
  "access_scope": "March 1960 article summary; this is an anticipated partnership rather than an assertion that the proposed system had already been realized.",
  "authors": [
    "J. C. R. Licklider"
  ],
  "authors_in_source_order": [
    "J. C. R. Licklider"
  ],
  "dates": {
    "publication": "March 1960",
    "retrieved_utc": "2026-10-07T18:19:47.666819+00:00"
  },
  "id": "work-1c217ed1f4d3::S1",
  "title": "Man-Computer Symbiosis",
  "url": "https://groups.csail.mit.edu/medg/people/psz/Licklider.html"
}

March 1960 article summary; this is an anticipated partnership rather than an assertion that the proposed system had already been realized.

March 1960 article summary; this is an anticipated partnership rather than an assertion that the proposed system had already been realized.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "March 1960, IRE Transactions on Human Factors in Electronics.",
  "dated": true,
  "year": 1960
}

A Neural Probabilistic Language Model

Bengio, Ducharme, Vincent and Jauvin jointly learn word representations and a probability model for word sequences.

The abstract explains generalization through nearby word representations, allowing an unseen sentence to benefit from related sentences encountered during training.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "JMLR 2003 abstract; reported comparisons concern the paper’s two text corpora, not all language-model tasks.",
  "authors": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "authors_in_source_order": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T18:21:16.130617+00:00"
  },
  "id": "work-329dd0f03037::S1",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://www.jmlr.org/papers/v3/bengio03a.html"
}

JMLR 2003 abstract; reported comparisons concern the paper’s two text corpora, not all language-model tasks.

JMLR 2003 abstract; reported comparisons concern the paper’s two text corpora, not all language-model tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 2003
}

Taylor Expansion of the Accumulated Rounding Error

Linnainmaa analyzes how local rounding errors contribute to an accumulated computational error using coefficients of a Taylor expansion.

The abstract includes higher-order coefficients and examines ways to reduce the storage needed for this analysis.

Sources and details

Taylor expansion of the accumulated rounding error

{
  "access_scope": "Springer abstract of the June 1976 article; it is distinguished from the 1970 thesis cited in its references.",
  "authors": [
    "Linnainmaa, Seppo"
  ],
  "authors_in_source_order": [
    "Linnainmaa, Seppo"
  ],
  "dates": {
    "citation_publication_date": "1976/06",
    "retrieved_utc": "2026-10-07T18:21:34.869412+00:00"
  },
  "id": "work-37b3ee8cfe07::S1",
  "title": "Taylor expansion of the accumulated rounding error",
  "url": "https://link.springer.com/article/10.1007/BF01931367"
}

Springer abstract of the June 1976 article; it is distinguished from the 1970 thesis cited in its references.

Springer abstract of the June 1976 article; it is distinguished from the 1970 thesis cited in its references.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1976 article referencing 1970 thesis.",
  "dated": true,
  "year": 1976
}

Applications of Advances in Nonlinear Sensitivity Analysis

Werbos surveys algorithms for differentiation and optimization and their applications to model sensitivity, estimation and neural modeling.

The abstract presents economical derivative calculation as a technique shared across these different computational problems.

Sources and details

Applications of advances in nonlinear sensitivity analysis

{
  "access_scope": "Abstract of the 1982 chapter; the page’s September 2005 online-publication date is separate from the chapter’s original year.",
  "authors": [
    "Werbos, Paul J."
  ],
  "authors_in_source_order": [
    "Werbos, Paul J."
  ],
  "dates": {
    "citation_publication_date": "1982",
    "retrieved_utc": "2026-10-07T18:21:35.589472+00:00"
  },
  "id": "work-90fc93a62fc6::S1",
  "title": "Applications of advances in nonlinear sensitivity analysis",
  "url": "https://link.springer.com/chapter/10.1007/BFb0006203"
}

Abstract of the 1982 chapter; the page’s September 2005 online-publication date is separate from the chapter’s original year.

Abstract of the 1982 chapter; the page’s September 2005 online-publication date is separate from the chapter’s original year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1982 proceedings; later online bibliographic record.",
  "dated": true,
  "year": 1982
}

CUDA platform for accelerated computing

NVIDIA presents CUDA as a software layer through which applications can use GPU computing from languages, libraries and frameworks.

Its toolkit combines a compiler, runtime libraries and development tools, making accelerated hardware part of a wider programming environment.

Sources and details

CUDA developer overview

{
  "access_scope": "Cached NVIDIA developer overview, not the original launch specification; no comparative performance or market dominance claim.",
  "authors": [
    "NVIDIA"
  ],
  "authors_in_source_order": [
    "NVIDIA"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.760935+00:00"
  },
  "id": "work-9b75fc41cbed::S1",
  "title": "CUDA developer overview",
  "url": "https://developer.nvidia.com/cuda"
}

Cached NVIDIA developer overview, not the original launch specification; no comparative performance or market dominance claim.

Cached NVIDIA developer overview, not the original launch specification; no comparative performance or market dominance claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Living organizational documentation; checked 2026-10-04, not a publication date.",
  "dated": false,
  "year": 2026
}

Introducing Claude

Anthropic’s March 2023 announcement offered Claude through chat and an API for tasks including summarization, writing, questions and coding.

The launch distinguished Claude from Claude Instant, describing the latter as a lighter and faster option.

Sources and details

Introducing Claude

{
  "access_scope": "March 14, 2023 launch announcement; capability and product descriptions are company statements, not independent safety or reliability findings.",
  "authors": [
    "Anthropic"
  ],
  "authors_in_source_order": [
    "Anthropic"
  ],
  "dates": {
    "published": "2023-03-14",
    "retrieved_utc": "2026-10-07T17:54:47.032241+00:00"
  },
  "id": "work-aae465e694c1::S1",
  "title": "Introducing Claude",
  "url": "https://www.anthropic.com/news/introducing-claude"
}

March 14, 2023 launch announcement; capability and product descriptions are company statements, not independent safety or reliability findings.

March 14, 2023 launch announcement; capability and product descriptions are company statements, not independent safety or reliability findings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Dated research or product milestone; organizational role sources checked 2026-10-04.",
  "dated": true,
  "year": 2023
}

Ab initio solution of the many-electron Schrödinger equation with deep neural networks

The Fermionic Neural Network represents many-electron wavefunctions while respecting the statistics required for electrons.

The authors report accurate variational calculations for selected atoms and small molecules using atomic positions and charges rather than a supplied training dataset.

Sources and details

Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks

{
  "access_scope": "arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-1cce8daa1b246c::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "arXiv 2019; Physical Review Research 2, 033429 (2020).",
  "dated": true,
  "year": 2020
}

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

The Equational Theories Project combines human-generated and automated proofs in a collaborative investigation of simple algebraic laws.

Its abstract reports that the implication relationships studied by the project were validated in Lean, separating proposed arguments from formally checked results.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "arXiv abstract of the collaborative pilot project; its complete author list is preserved and the underlying proofs were not independently rerun.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-268ee733e1fd26::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

arXiv abstract of the collaborative pilot project; its complete author list is preserved and the underlying proofs were not independently rerun.

arXiv abstract of the collaborative pilot project; its complete author list is preserved and the underlying proofs were not independently rerun.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2025
}

Human-level performance in 3D multiplayer games with population-based reinforcement learning

The study trains a population of reinforcement-learning agents through parallel team matches in Quake III Arena Capture the Flag.

Agents learn internal rewards alongside the sparse reward for winning, with action representations that operate at different timescales.

Sources and details

Human-level performance in first-person multiplayer games with population-based deep reinforcement learning

{
  "access_scope": "arXiv abstract; human-level and tournament results apply to the described game evaluation, not general intelligence or every multiplayer setting.",
  "authors": [
    "Jaderberg, Max",
    "Czarnecki, Wojciech M.",
    "Dunning, Iain",
    "Marris, Luke",
    "Lever, Guy",
    "Castaneda, Antonio Garcia",
    "Beattie, Charles",
    "Rabinowitz, Neil C.",
    "Morcos, Ari S.",
    "Ruderman, Avraham",
    "Sonnerat, Nicolas",
    "Green, Tim",
    "Deason, Louise",
    "Leibo, Joel Z.",
    "Silver, David",
    "Hassabis, Demis",
    "Kavukcuoglu, Koray",
    "Graepel, Thore"
  ],
  "authors_in_source_order": [
    "Jaderberg, Max",
    "Czarnecki, Wojciech M.",
    "Dunning, Iain",
    "Marris, Luke",
    "Lever, Guy",
    "Castaneda, Antonio Garcia",
    "Beattie, Charles",
    "Rabinowitz, Neil C.",
    "Morcos, Ari S.",
    "Ruderman, Avraham",
    "Sonnerat, Nicolas",
    "Green, Tim",
    "Deason, Louise",
    "Leibo, Joel Z.",
    "Silver, David",
    "Hassabis, Demis",
    "Kavukcuoglu, Koray",
    "Graepel, Thore"
  ],
  "dates": {
    "citation_date": "2018/07/03",
    "inspected_revision": "Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB)",
    "retrieved_utc": "2026-10-07T18:17:04.391057+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-29bb7f5af046f6::S1",
  "title": "Human-level performance in first-person multiplayer games with population-based deep reinforcement learning",
  "url": "https://arxiv.org/abs/1807.01281",
  "version_url": "https://arxiv.org/abs/1807.01281v1"
}

arXiv abstract; human-level and tournament results apply to the described game evaluation, not general intelligence or every multiplayer setting.

arXiv abstract; human-level and tournament results apply to the described game evaluation, not general intelligence or every multiplayer setting.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Science publication 2019; differently titled preprint first appeared July 2018.",
  "dated": true,
  "year": 2019
}

The Malmo Platform for Artificial Intelligence Experimentation

Project Malmo provides an experimentation layer on Minecraft for AI tasks ranging from navigation and survival to collaboration and problem solving.

The paper describes an interface for integrating agents, defining tasks and running experiments, with an open-source release intended to support shared research.

Sources and details

The Malmo Platform for Artificial Intelligence Experimentation

{
  "access_scope": "IJCAI-16 paper abstract and adjacent platform description; this is an experimentation platform, not evidence of achieved artificial general intelligence.",
  "authors": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "authors_in_source_order": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "dates": {
    "proceedings": "IJCAI-16",
    "retrieved_utc": "2026-10-07T18:11:30.451187+00:00"
  },
  "id": "work-coverage-2b137202bd7516::S1",
  "title": "The Malmo Platform for Artificial Intelligence Experimentation",
  "url": "https://www.ijcai.org/Proceedings/16/Papers/643.pdf"
}

IJCAI-16 paper abstract and adjacent platform description; this is an experimentation platform, not evidence of achieved artificial general intelligence.

IJCAI-16 paper abstract and adjacent platform description; this is an experimentation platform, not evidence of achieved artificial general intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Published July 2016.",
  "dated": true,
  "year": 2016
}

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

AlphaGeometry2 combines a stronger language model with a symbolic engine, synthetic training data and communication between search trees.

The authors extend the system’s formal language to cover additional geometric relations and distinguish that formal coverage from work toward natural-language input.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "arXiv abstract, inspected revision pinned; geometry results are benchmark-specific and are not a claim of unrestricted mathematical reasoning.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-2eda484e28f195::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

arXiv abstract, inspected revision pinned; geometry results are benchmark-specific and are not a claim of unrestricted mathematical reasoning.

arXiv abstract, inspected revision pinned; geometry results are benchmark-specific and are not a claim of unrestricted mathematical reasoning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "arXiv first posted February 5, 2025; cited current v3 December 8, 2025.",
  "dated": true,
  "year": 2025
}

A generative model for inorganic materials design

MatterGen generates inorganic material structures and can be fine-tuned to guide generation toward specified chemical or physical properties.

The paper distinguishes generated candidates from experimental confirmation, reporting the synthesis of one generated structure as a proof of concept.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Nature abstract of the materials-design study; a demonstrated structure does not establish manufacturability or useful performance for all generated candidates.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "work-coverage-3818d012ebfbb6::S1",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Nature abstract of the materials-design study; a demonstrated structure does not establish manufacturability or useful performance for all generated candidates.

Nature abstract of the materials-design study; a demonstrated structure does not establish manufacturability or useful performance for all generated candidates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2025",
  "dated": true,
  "year": 2025
}

Discovering faster matrix multiplication algorithms with reinforcement learning

AlphaTensor turns the search for matrix-multiplication algorithms into a single-player game about tensor decompositions.

The paper describes optimizing both arithmetic complexity and practical runtime on specified hardware, rather than treating algorithm quality as a single universal measure.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.",
  "authors": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "authors_in_source_order": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "dates": {
    "citation_publication_date": "2022/10",
    "retrieved_utc": "2026-10-07T18:12:57.010377+00:00"
  },
  "id": "work-coverage-164af015d94aae::S1",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2022",
  "dated": true,
  "year": 2022
}

Human-level control through deep reinforcement learning

The deep Q-network learns action policies from high-dimensional sensory input, connecting neural representations to reinforcement learning.

The article evaluates the same algorithm, architecture and hyperparameters on a set of Atari games using pixels and game scores as input.

Sources and details

Human-level control through deep reinforcement learning

{
  "access_scope": "Nature abstract; the comparison to a professional tester concerns the set of 49 games and does not mean success at every game or general human intelligence.",
  "authors": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Rusu, Andrei A.",
    "Veness, Joel",
    "Bellemare, Marc G.",
    "Graves, Alex",
    "Riedmiller, Martin",
    "Fidjeland, Andreas K.",
    "Ostrovski, Georg",
    "Petersen, Stig",
    "Beattie, Charles",
    "Sadik, Amir",
    "Antonoglou, Ioannis",
    "King, Helen",
    "Kumaran, Dharshan",
    "Wierstra, Daan",
    "Legg, Shane",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Mnih, Volodymyr",
    "Kavukcuoglu, Koray",
    "Silver, David",
    "Rusu, Andrei A.",
    "Veness, Joel",
    "Bellemare, Marc G.",
    "Graves, Alex",
    "Riedmiller, Martin",
    "Fidjeland, Andreas K.",
    "Ostrovski, Georg",
    "Petersen, Stig",
    "Beattie, Charles",
    "Sadik, Amir",
    "Antonoglou, Ioannis",
    "King, Helen",
    "Kumaran, Dharshan",
    "Wierstra, Daan",
    "Legg, Shane",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2015/02",
    "retrieved_utc": "2026-10-07T18:22:46.944842+00:00"
  },
  "id": "work-coverage-29728ded993d63::S1",
  "title": "Human-level control through deep reinforcement learning",
  "url": "https://www.nature.com/articles/nature14236"
}

Nature abstract; the comparison to a professional tester concerns the set of 49 games and does not mean success at every game or general human intelligence.

Nature abstract; the comparison to a professional tester concerns the set of 49 games and does not mean success at every game or general human intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Published February 25, 2015; distinguish from the 2013 DQN workshop/preprint.",
  "dated": true,
  "year": 2015
}

Faster sorting algorithms discovered using deep reinforcement learning

The AlphaDev announcement describes searching directly over assembly instructions to discover sorting algorithms rather than only refining high-level source code.

The authors report incorporating resulting sorting routines into a C++ library, connecting experimental search with a specific software distribution path.

Sources and details

AlphaDev discovers faster sorting algorithms

{
  "access_scope": "DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.",
  "authors": [
    "Daniel J. Mankowitz",
    "Andrea Michi"
  ],
  "authors_in_source_order": [
    "Daniel J. Mankowitz",
    "Andrea Michi"
  ],
  "dates": {
    "published": "2023-06-07",
    "retrieved_utc": "2026-10-07T18:15:23.148712+00:00"
  },
  "id": "work-coverage-318309b162e30e::S1",
  "title": "AlphaDev discovers faster sorting algorithms",
  "url": "https://deepmind.google/blog/alphadev-discovers-faster-sorting-algorithms/"
}

DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.

DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2023",
  "dated": true,
  "year": 2023
}

Probabilistic weather forecasting with machine learning

GenCast produces an ensemble of possible weather trajectories, using stochastic forecasts to represent uncertainty rather than issuing only one deterministic prediction.

The paper trains the model on reanalysis data and evaluates its forecasts against an operational numerical-weather ensemble on defined targets.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "work-coverage-24ec76a8cc9ccf::S1",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Online December 4, 2024; Nature volume 637 (2025).",
  "dated": true,
  "year": 2024
}

SpaceChem

SpaceChem casts the player as an engineer constructing factories that transform raw inputs into chemical products.

Its store description makes streamlining those designs to meet production quotas part of the puzzle.

Sources and details

SpaceChem — Steam game description

{
  "access_scope": "Developer/publisher game description on Steam; these are gameplay systems, not real chemistry or evidence of influence on AI research.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:55.821098+00:00"
  },
  "id": "work-coverage-02335c2752f3b7::S1",
  "title": "SpaceChem — Steam game description",
  "url": "https://store.steampowered.com/app/92800/"
}

Developer/publisher game description on Steam; these are gameplay systems, not real chemistry or evidence of influence on AI research.

Developer/publisher game description on Steam; these are gameplay systems, not real chemistry or evidence of influence on AI research.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2011
}

Oxygen Not Included

Oxygen Not Included combines colony survival with linked systems for oxygen, temperature, plumbing and power.

Its store description asks players to manage both resource depletion and colonists’ stress responses, making infrastructure and human needs interdependent parts of the simulation.

Sources and details

Oxygen Not Included — Steam game description

{
  "access_scope": "Steam game description; simulated thermodynamics and behavior are game mechanics, not a validated engineering model.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:52.319000+00:00"
  },
  "id": "work-coverage-031ccdff3fc15d::S1",
  "title": "Oxygen Not Included — Steam game description",
  "url": "https://store.steampowered.com/app/457140/"
}

Steam game description; simulated thermodynamics and behavior are game mechanics, not a validated engineering model.

Steam game description; simulated thermodynamics and behavior are game mechanics, not a validated engineering model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

The Talos Principle 2

The Talos Principle 2 sets its puzzles in a robot civilization that preserves human culture after biological humanity has disappeared.

Its description connects choices about reason, progress and repeating human mistakes to the course of the story.

Sources and details

The Talos Principle 2 — Steam game description

{
  "access_scope": "Steam synopsis and gameplay description; philosophical relevance is editorial and does not establish historical influence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:55.565930+00:00"
  },
  "id": "work-coverage-0a9d7a9f0f4043::S1",
  "title": "The Talos Principle 2 — Steam game description",
  "url": "https://store.steampowered.com/app/835960/"
}

Steam synopsis and gameplay description; philosophical relevance is editorial and does not establish historical influence.

Steam synopsis and gameplay description; philosophical relevance is editorial and does not establish historical influence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2023
}

Observer: System Redux

Observer: System Redux depicts a corporate investigator who extracts evidence by entering suspects’ memories and dreams.

The game’s imagined future links neural intrusion to corporate power after war and a digital plague.

Sources and details

Observer: System Redux — Steam game description

{
  "access_scope": "Steam synopsis of the fictional 2084 setting; no inference that the portrayed neural technology exists.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:50.457099+00:00"
  },
  "id": "work-coverage-0b1679272ca3e1::S1",
  "title": "Observer: System Redux — Steam game description",
  "url": "https://store.steampowered.com/app/1386900/"
}

Steam synopsis of the fictional 2084 setting; no inference that the portrayed neural technology exists.

Steam synopsis of the fictional 2084 setting; no inference that the portrayed neural technology exists.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2020
}

Event[0]

Event[0] makes typed conversation with the spaceship computer Kaizen a means of exploring the ship and finding a way home.

Its description presents the computer’s changing mood and the player’s relationship with it as part of the game’s progression.

Sources and details

Event[0] — Steam game description

{
  "access_scope": "Steam description of narrative mechanics; fictional emotional responses are not evidence of machine consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:54.005355+00:00"
  },
  "id": "work-coverage-1db208b26ba472::S1",
  "title": "Event[0] — Steam game description",
  "url": "https://store.steampowered.com/app/470260/"
}

Steam description of narrative mechanics; fictional emotional responses are not evidence of machine consciousness.

Steam description of narrative mechanics; fictional emotional responses are not evidence of machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

Sneakers

Sneakers follows a security-testing team drawn into retrieving a black box capable, within the story, of breaking into any computer system.

The studio synopsis makes the struggle over control of that device the center of the team’s conflict with competing factions.

Sources and details

Sneakers | Universal Pictures At Home

{
  "access_scope": "Universal Pictures synopsis of a fictional film; the device’s capabilities are plot claims, not a cryptographic demonstration.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:31.857930+00:00"
  },
  "id": "work-coverage-1fc988537b8cf5::S1",
  "title": "Sneakers | Universal Pictures At Home",
  "url": "https://www.universalpicturesathome.com/movies/sneakers"
}

Universal Pictures synopsis of a fictional film; the device’s capabilities are plot claims, not a cryptographic demonstration.

Universal Pictures synopsis of a fictional film; the device’s capabilities are plot claims, not a cryptographic demonstration.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1992
}

Cloudpunk

Cloudpunk follows Rania’s first night delivering packages through a vertical city inhabited by humans, androids and AI.

Its game description connects exploration and player decisions with stories of corporate conspiracy, hackers and rogue AI.

Sources and details

Cloudpunk — Steam game description

{
  "access_scope": "Steam synopsis; the social and technical setting is fictional and editorial relevance does not establish a causal link to AI development.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:55.542519+00:00"
  },
  "id": "work-coverage-22212502429d34::S1",
  "title": "Cloudpunk — Steam game description",
  "url": "https://store.steampowered.com/app/746850/"
}

Steam synopsis; the social and technical setting is fictional and editorial relevance does not establish a causal link to AI development.

Steam synopsis; the social and technical setting is fictional and editorial relevance does not establish a causal link to AI development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2020
}

Summer Wars

Summer Wars imagines an online world woven into everyday life, where a rogue AI steals Kenji’s identity and triggers real-world disruption.

The distributor’s synopsis places the response in the connections Kenji builds with Natsuki’s family.

Sources and details

Summer Wars - GKIDS Films

{
  "access_scope": "GKIDS synopsis of Mamoru Hosoda’s film; the network and rogue AI are fictional.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:00.370663+00:00"
  },
  "id": "work-coverage-224846c1fb8746::S1",
  "title": "Summer Wars - GKIDS Films",
  "url": "https://gkids.com/films/summer-wars/"
}

GKIDS synopsis of Mamoru Hosoda’s film; the network and rogue AI are fictional.

GKIDS synopsis of Mamoru Hosoda’s film; the network and rogue AI are fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2009
}

Primordia

Primordia follows two robots whose search for a stolen energy source takes them from an isolated home to the city of Metropol.

The game’s synopsis uses that journey to uncover their origins and the history of humans remembered as legendary figures.

Sources and details

Primordia — Steam game description

{
  "access_scope": "Steam game synopsis; the post-human society is a fictional setting, not a technological forecast.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:50.829298+00:00"
  },
  "id": "work-coverage-334d8f79186bc5::S1",
  "title": "Primordia — Steam game description",
  "url": "https://store.steampowered.com/app/227000/"
}

Steam game synopsis; the post-human society is a fictional setting, not a technological forecast.

Steam game synopsis; the post-human society is a fictional setting, not a technological forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2012
}

SHENZHEN I/O

SHENZHEN I/O asks players to build circuits and program them in a compact assembly language with conditional instructions.

The description pairs those puzzles with fictional datasheets, a manual and a sandbox for testing devices.

Sources and details

SHENZHEN I/O — Steam game description

{
  "access_scope": "Steam developer description; the manual’s original game components are not asserted to be real industrial specifications.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:54.937224+00:00"
  },
  "id": "work-coverage-39835ac525fc26::S1",
  "title": "SHENZHEN I/O — Steam game description",
  "url": "https://store.steampowered.com/app/504210/"
}

Steam developer description; the manual’s original game components are not asserted to be real industrial specifications.

Steam developer description; the manual’s original game components are not asserted to be real industrial specifications.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

Finch

Finch centers on a robotics engineer building a robot to care for his dog after he can no longer do so.

Apple’s synopsis describes a journey in which the engineer teaches the robot while navigating the difficulties of their new household.

Sources and details

Finch - Apple TV Press

{
  "access_scope": "Apple film synopsis; caregiving and learning are fictional narrative themes, not demonstrated robotics capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:56.298617+00:00"
  },
  "id": "work-coverage-50fdc132819ebd::S1",
  "title": "Finch - Apple TV Press",
  "url": "https://www.apple.com/tv-pr/originals/finch/"
}

Apple film synopsis; caregiving and learning are fictional narrative themes, not demonstrated robotics capabilities.

Apple film synopsis; caregiving and learning are fictional narrative themes, not demonstrated robotics capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Official page lists 5 November 2021 release and Miguel Sapochnik as director.",
  "dated": true,
  "year": 2021
}

WALL·E

Disney’s synopsis introduces WALL·E as a robot whose long routine changes when he encounters the search robot EVE.

Sources and details

WALL·E | Disney Movies

{
  "access_scope": "Disney’s brief film synopsis only; the rest of the film, environmental themes and portrayed technologies are not inferred from this short text.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:50.216079+00:00"
  },
  "id": "work-coverage-53ba409f34c1c7::S1",
  "title": "WALL·E | Disney Movies",
  "url": "https://movies.disney.com/wall-e"
}

Disney’s brief film synopsis only; the rest of the film, environmental themes and portrayed technologies are not inferred from this short text.

Disney’s brief film synopsis only; the rest of the film, environmental themes and portrayed technologies are not inferred from this short text.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original release is cataloged as 2008; source check retained from the prior cinema audit.",
  "dated": true,
  "year": 2008
}

No Man's Sky

No Man’s Sky presents exploration, trade, combat and survival across a procedurally generated galaxy.

The store description connects the player’s choices about equipment and travel with the dangers of its imagined worlds.

Sources and details

No Man's Sky — Steam game description

{
  "access_scope": "Cached Steam description of the evolved game; this does not establish which features existed at its original release or provide an independent scale measurement.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:05.448626+00:00"
  },
  "id": "work-coverage-555ad087adca7c::S1",
  "title": "No Man's Sky — Steam game description",
  "url": "https://store.steampowered.com/app/275850/"
}

Cached Steam description of the evolved game; this does not establish which features existed at its original release or provide an independent scale measurement.

Cached Steam description of the evolved game; this does not establish which features existed at its original release or provide an independent scale measurement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

The Stanley Parable

The Stanley Parable uses exploration and contradictions to unsettle the relationship between following a story and choosing a path.

Its store description identifies this edition as a return to the 2011 Source mod with additional content and ideas.

Sources and details

The Stanley Parable — Steam game description

{
  "access_scope": "Steam description of this game edition; interpretive relevance to agency is editorial, not evidence that the game was designed as an AI research environment.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:04.759683+00:00"
  },
  "id": "work-coverage-5d4e2829a969ef::S1",
  "title": "The Stanley Parable — Steam game description",
  "url": "https://store.steampowered.com/app/221910/"
}

Steam description of this game edition; interpretive relevance to agency is editorial, not evidence that the game was designed as an AI research environment.

Steam description of this game edition; interpretive relevance to agency is editorial, not evidence that the game was designed as an AI research environment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2013
}

Machines of Loving Grace

Amodei’s optimistic scenario assumes AI that can pursue long tasks autonomously, use digital interfaces and coordinate many copies of itself.

That is a stronger premise than a conversational assistant: the imagined system can direct experiments and operate existing equipment through computers.

He uses this premise to consider gains in health, economic development, governance and meaningful work, while explicitly treating the future as uncertain.

Sources and details

Machines of Loving Grace: How AI Could Transform the World for the Better

{
  "access_scope": "October 2024 essay introduction and assumptions section; the described capabilities and benefits are hypothetical, not observed deployment outcomes.",
  "authors": [
    "Dario Amodei"
  ],
  "authors_in_source_order": [
    "Dario Amodei"
  ],
  "dates": {
    "published": "October 2024",
    "retrieved_utc": "2026-10-07T17:54:20.271100+00:00"
  },
  "id": "work-4c6bfae13e9c::S1",
  "title": "Machines of Loving Grace: How AI Could Transform the World for the Better",
  "url": "https://darioamodei.com/essay/machines-of-loving-grace"
}

October 2024 essay introduction and assumptions section; the described capabilities and benefits are hypothetical, not observed deployment outcomes.

October 2024 essay introduction and assumptions section; the described capabilities and benefits are hypothetical, not observed deployment outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "October 2024 essay; “as early as 2026” is explicitly uncertain, not a promised deadline.",
  "dated": true,
  "year": 2024
}

ASCEND feasibility study

ASCEND examines orbital data centers as an environmental and engineering alternative to terrestrial facilities.

The consortium’s announcement makes the environmental case conditional on developing a substantially less emissive launcher across its life cycle; moving computers into orbit alone is not the proposed solution.

The architecture also depends on modular infrastructure and robotic assembly in orbit, with further study intended to consolidate the feasibility results.

Sources and details

Thales Alenia Space reveals results of ASCEND feasibility study on space data centers

{
  "access_scope": "Thales Alenia Space announcement dated June 27, 2024; feasibility estimates and projected benefits are company-reported and do not establish an operating orbital data center.",
  "authors": [
    "Thales Alenia Space"
  ],
  "authors_in_source_order": [
    "Thales Alenia Space"
  ],
  "dates": {
    "announced": "2024-06-27",
    "retrieved_utc": "2026-10-07T18:16:26.534498+00:00"
  },
  "id": "work-coverage-065b0253df4a2c::S1",
  "title": "Thales Alenia Space reveals results of ASCEND feasibility study on space data centers",
  "url": "https://www.thalesaleniaspace.com/en/press-releases/thales-alenia-space-reveals-results-ascend-feasibility-study-space-data-centers-0"
}

Thales Alenia Space announcement dated June 27, 2024; feasibility estimates and projected benefits are company-reported and do not establish an operating orbital data center.

Thales Alenia Space announcement dated June 27, 2024; feasibility estimates and projected benefits are company-reported and do not establish an operating orbital data center.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-06-27"
}

The Limits to Growth

The Limits to Growth considers population, industrialization, food, pollution and resource depletion together rather than extrapolating one variable in isolation.

Its introduction argues that continuing the prevailing growth trends could produce an eventual decline in population and industrial capacity.

The authors also describe an alternative of ecological and economic stability, making changed trends and the timing of action central to their argument.

Sources and details

The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind

{
  "access_scope": "1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.",
  "authors": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "authors_in_source_order": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "dates": {
    "original_work": "1972",
    "retrieved_utc": "2026-10-07T18:11:57.102750+00:00"
  },
  "id": "work-coverage-1d72b03e800df7::S1",
  "title": "The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind",
  "url": "https://collections.dartmouth.edu/archive/text/meadows/diplomatic/meadows_ltg-diplomatic.html"
}

1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1972; scenario results are conditional on model assumptions, not unconditional forecasts.",
  "dated": true,
  "year": 1972
}

The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines

Barroso and Hölzle argue that a large cloud data center should be designed as one warehouse-scale computer rather than as unrelated servers in the same building.

Hardware and software resources must work together to deliver service performance, so architecture, deployment and operation become a coordinated design problem.

The book’s abstract places cost structure and the software base alongside hardware architecture in explaining that system.

Sources and details

The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines

{
  "access_scope": "Google Research abstract of the 2009 book; detailed chapters and case studies were not inspected.",
  "authors": [
    "Luiz André Barroso",
    "Urs Hölzle"
  ],
  "authors_in_source_order": [
    "Luiz André Barroso",
    "Urs Hölzle"
  ],
  "dates": {
    "citation_publication_date": "2009",
    "retrieved_utc": "2026-10-07T18:12:08.976878+00:00"
  },
  "id": "work-coverage-25e4c8b4556f0e::S1",
  "title": "The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines",
  "url": "https://research.google.com/pubs/pub35290.html?hl=ar"
}

Google Research abstract of the 2009 book; detailed chapters and case studies were not inspected.

Google Research abstract of the 2009 book; detailed chapters and case studies were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2009"
}

The Datacenter as a Computer: Designing Warehouse-Scale Machines, Third Edition

The third edition retains the warehouse-scale view of a data center while expanding the workloads and components that its designers must coordinate.

Its abstract adds machine learning, video streaming and public-cloud workloads alongside specialized accelerators, storage and networking.

Power, cooling and uptime are part of the revised treatment, connecting computing architecture to the facility needed to sustain it.

Sources and details

The Datacenter as a Computer: designing warehouse-scale machines

{
  "access_scope": "Google Research abstract of the 2018 third edition; distinct from the 2009 first edition, with all three credited authors preserved.",
  "authors": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "authors_in_source_order": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "retrieved_utc": "2026-10-07T18:12:09.258524+00:00"
  },
  "id": "work-coverage-7144ab62178d1d::S1",
  "title": "The Datacenter as a Computer: designing warehouse-scale machines",
  "url": "https://research.google/pubs/the-datacenter-as-a-computer-designing-warehouse-scale-machines/"
}

Google Research abstract of the 2018 third edition; distinct from the 2009 first edition, with all three credited authors preserved.

Google Research abstract of the 2018 third edition; distinct from the 2009 first edition, with all three credited authors preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2018"
}

Media Hot and Cold

Starosielski treats heat and cold as media through which people communicate and exercise control, extending analysis beyond messages on screens.

The publisher contrasts mass thermal systems with personalized digital devices that manage an individual’s environment.

Her argument asks who can control their own temperature and how that ability can reproduce existing inequalities even when a technology promises comfort or climate adaptation.

Sources and details

Media Hot and Cold

{
  "access_scope": "Duke University Press description of the January 2022 book; interpretive claims are attributed to the author, without importing the uninspected chapters.",
  "authors": [
    "Nicole Starosielski"
  ],
  "authors_in_source_order": [
    "Nicole Starosielski"
  ],
  "dates": {
    "listed_publication": "January 2022",
    "retrieved_utc": "2026-10-07T18:12:46.085468+00:00"
  },
  "id": "work-coverage-47467199a0c7ce::S1",
  "title": "Media Hot and Cold",
  "url": "https://dukeupress.edu/media-hot-and-cold"
}

Duke University Press description of the January 2022 book; interpretive claims are attributed to the author, without importing the uninspected chapters.

Duke University Press description of the January 2022 book; interpretive claims are attributed to the author, without importing the uninspected chapters.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021"
}

4 GAIN Vouchers Awarded to Advance Data Center, Microreactor Deployment

The GAIN announcement describes vouchers that fund access to national-laboratory expertise rather than handing companies a direct financial award.

The projects include auditing a microreactor’s neutronics and thermal hydraulics, modeling a heat exchanger and developing tests for salt impurities.

A separate project screens potential locations for nuclear capacity and data centers as an initial step toward possible licensing work.

Sources and details

4 GAIN Vouchers Awarded to Advance Data Center, Microreactor Deployment

{
  "access_scope": "DOE Office of Nuclear Energy announcement dated September 24, 2024; awards authorize research and site investigation, not reactor certification, completed licensing or commercial deployment.",
  "authors": [
    "Office of Nuclear Energy"
  ],
  "authors_in_source_order": [
    "Office of Nuclear Energy"
  ],
  "dates": {
    "published": "2024-09-24",
    "retrieved_utc": "2026-10-07T18:23:57.865312+00:00"
  },
  "id": "work-coverage-50bba2eaf0633b::S1",
  "title": "4 GAIN Vouchers Awarded to Advance Data Center, Microreactor Deployment",
  "url": "https://www.energy.gov/ne/articles/4-gain-vouchers-awarded-advance-data-center-microreactor-deployment"
}

DOE Office of Nuclear Energy announcement dated September 24, 2024; awards authorize research and site investigation, not reactor certification, completed licensing or commercial deployment.

DOE Office of Nuclear Energy announcement dated September 24, 2024; awards authorize research and site investigation, not reactor certification, completed licensing or commercial deployment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-09-24"
}

The World in a Grain: The Story of Sand and How It Transformed Civilization

Beiser connects sand to the physical foundations of construction, glass and digital devices, bringing a commonly overlooked input into an account of modern industry.

The publisher stresses that availability is not simply a matter of how much sand exists: easily obtained material may be unsuitable for the use that needs it.

The book follows extraction and trade alongside their human and environmental costs, linking material demand to the people and places that supply it.

Sources and details

The World in a Grain: The Story of Sand and How It Transformed Civilization

{
  "access_scope": "Publisher description of The World in a Grain; broad promotional resource rankings are not adopted as measured findings, and the paperback and ebook dates remain distinct.",
  "authors": [
    "Vince Beiser"
  ],
  "authors_in_source_order": [
    "Vince Beiser"
  ],
  "dates": {
    "ebook_listed": "2018-08-07",
    "paperback_listed": "2019-08-06",
    "retrieved_utc": "2026-10-07T18:18:41.007822+00:00"
  },
  "id": "work-coverage-86c995eebb4101::S1",
  "title": "The World in a Grain: The Story of Sand and How It Transformed Civilization",
  "url": "https://www.penguinrandomhouse.com/books/537681/the-world-in-a-grain-by-vince-beiser/"
}

Publisher description of The World in a Grain; broad promotional resource rankings are not adopted as measured findings, and the paperback and ebook dates remain distinct.

Publisher description of The World in a Grain; broad promotional resource rankings are not adopted as measured findings, and the paperback and ebook dates remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2018"
}

The World for Sale: Money, Power and the Traders Who Barter the Earth’s Resources

The World for Sale follows commodity traders who connect sources of energy, food and metals to distant buyers.

The publisher’s account places deal-making and access to political actors alongside the movement of raw materials, framing trade as a channel of influence as well as commerce.

Sources and details

The World for Sale

{
  "access_scope": "Penguin publisher description only, distinguished from reviewer endorsements; specific allegations and the authors’ complete underlying investigations were not independently checked.",
  "authors": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "authors_in_source_order": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:47.928916+00:00"
  },
  "id": "work-coverage-8a752807bd32a4::S1",
  "title": "The World for Sale",
  "url": "https://www.penguin.co.uk/books/440353/the-world-for-sale-by-javier-blas-and-jack-farchy/9781847942678"
}

Penguin publisher description only, distinguished from reviewer endorsements; specific allegations and the authors’ complete underlying investigations were not independently checked.

Penguin publisher description only, distinguished from reviewer endorsements; specific allegations and the authors’ complete underlying investigations were not independently checked.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021; linked paperback 2022"
}

Aqueduct 4.0: Updated Decision-Relevant Global Water Risk Indicators

Aqueduct 4.0 translates hydrological data into indicators that can help users prioritize water-related risks.

Its framework combines quantity, quality and reputational indicators; some are produced with a hydrological model and extended into scenario-based future projections.

Composite scores depend on sector-specific weights and demand-weighted aggregation, so a regional score reflects choices about how different risks and locations are combined.

WRI explicitly describes the tool as a starting point for prioritization that needs local investigation, rather than a directly validated measurement of overall water risk.

Sources and details

Aqueduct 4.0: Updated Decision-Relevant Global Water Risk Indicators

{
  "access_scope": "WRI technical-note summary dated August 16, 2023; the full 52-page methodology and model implementation were not audited or rerun.",
  "authors": [
    "Samantha Kuzma",
    "Marc F.P. Bierkens",
    "Shivani Lakshman",
    "Tianyi Luo",
    "Liz Saccoccia",
    "Edwin H. Sutanudjaja",
    "Rens Van Beek"
  ],
  "authors_in_source_order": [
    "Samantha Kuzma",
    "Marc F.P. Bierkens",
    "Shivani Lakshman",
    "Tianyi Luo",
    "Liz Saccoccia",
    "Edwin H. Sutanudjaja",
    "Rens Van Beek"
  ],
  "dates": {
    "citation_publication_date": "2023/08/16",
    "retrieved_utc": "2026-10-07T18:24:26.185618+00:00"
  },
  "id": "work-coverage-8f7eb86e2d8f64::S1",
  "title": "Aqueduct 4.0: Updated Decision-Relevant Global Water Risk Indicators",
  "url": "https://www.wri.org/research/aqueduct-40-updated-decision-relevant-global-water-risk-indicators"
}

WRI technical-note summary dated August 16, 2023; the full 52-page methodology and model implementation were not audited or rerun.

WRI technical-note summary dated August 16, 2023; the full 52-page methodology and model implementation were not audited or rerun.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2023-08-16"
}

Cobalt Red: How the Blood of the Congo Powers Our Lives

Kara’s investigation traces cobalt from mining conditions in the Democratic Republic of the Congo toward consumer-facing technology supply chains.

The publisher describes interviews and field investigations as the basis for connecting hazardous labor and environmental damage with the devices used by distant consumers.

The book frames that distance as an ethical problem: benefits at the consumer end do not remove responsibility for conditions at the extraction end.

Sources and details

Cobalt Red: How the Blood of the Congo Powers Our Lives

{
  "access_scope": "Macmillan book description of Cobalt Red, listed January 31, 2023; testimonies and allegations remain attributed, and the page’s universal claim about battery chemistry is not adopted.",
  "authors": [
    "Siddharth Kara"
  ],
  "authors_in_source_order": [
    "Siddharth Kara"
  ],
  "dates": {
    "on_sale": "2023-01-31",
    "retrieved_utc": "2026-10-07T18:12:12.619634+00:00"
  },
  "id": "work-coverage-905fdd5a974d21::S1",
  "title": "Cobalt Red: How the Blood of the Congo Powers Our Lives",
  "url": "https://us.macmillan.com/books/9781250284297/cobaltred/"
}

Macmillan book description of Cobalt Red, listed January 31, 2023; testimonies and allegations remain attributed, and the page’s universal claim about battery chemistry is not adopted.

Macmillan book description of Cobalt Red, listed January 31, 2023; testimonies and allegations remain attributed, and the page’s universal claim about battery chemistry is not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2023"
}

The Future of Employment: How Susceptible Are Jobs to Computerisation?

Frey and Osborne use a Gaussian-process classifier to estimate the susceptibility of 702 occupations to computerisation.

They then relate those occupational estimates to the distribution of US employment, wages and educational attainment.

Their abstract reports a larger estimated susceptibility among lower-wage and lower-education occupations, making exposure uneven across the labor market.

Sources and details

The Future of Employment: How Susceptible Are Jobs to Computerisation?

{
  "access_scope": "September 17, 2013 working-paper abstract and introduction; occupational susceptibility is an estimated technical exposure, not observed layoffs, a job-loss probability or a contemporary forecast.",
  "authors": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "authors_in_source_order": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:03.035966+00:00",
    "working_paper": "2013-09-17"
  },
  "id": "work-coverage-aba45a9fc17596::S1",
  "title": "The Future of Employment: How Susceptible Are Jobs to Computerisation?",
  "url": "https://www.oxfordmartin.ox.ac.uk/downloads/academic/The_Future_of_Employment.pdf"
}

September 17, 2013 working-paper abstract and introduction; occupational susceptibility is an estimated technical exposure, not observed layoffs, a job-loss probability or a contemporary forecast.

September 17, 2013 working-paper abstract and introduction; occupational susceptibility is an estimated technical exposure, not observed layoffs, a job-loss probability or a contemporary forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Retain separate working-paper and journal-publication dates; source inspected here is the Oxford-hosted paper.\"]",
  "dated": true,
  "year": "2013 working paper; 2017 journal article"
}

The Semiconductor Supply Chain: Assessing National Competitiveness

The CSET account separates chip production into design, manufacturing, and assembly, testing and packaging, supported by research and a range of specialized inputs.

Equipment, materials, design software and intellectual property are distinct dependencies, so capability in one production step does not amount to control of the whole chain.

This decomposition is intended to reveal both potential points of policy leverage and constraints that broad national comparisons can conceal.

Sources and details

The Semiconductor Supply Chain: Assessing National Competitiveness — webpage summary

{
  "access_scope": "CSET January 2021 webpage report summary; historical national comparisons are not updated, and the displayed webpage byline is not asserted to be the complete report author list.",
  "authors": [
    "Saif M. Khan"
  ],
  "authors_in_source_order": [
    "Saif M. Khan"
  ],
  "dates": {
    "page_label": "January 2021",
    "retrieved_utc": "2026-10-07T18:13:08.881836+00:00"
  },
  "id": "work-coverage-b60d2593e34d6d::S1",
  "title": "The Semiconductor Supply Chain: Assessing National Competitiveness — webpage summary",
  "url": "https://cset.georgetown.edu/publication/the-semiconductor-supply-chain/"
}

CSET January 2021 webpage report summary; historical national comparisons are not updated, and the displayed webpage byline is not asserted to be the complete report author list.

CSET January 2021 webpage report summary; historical national comparisons are not updated, and the displayed webpage byline is not asserted to be the complete report author list.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021-01"
}

Thinking, Fast and Slow

Kahneman distinguishes quick, intuitive judgment from slower, deliberate reasoning as two interacting ways of making choices.

The publisher applies that distinction to overconfidence, corporate strategy and difficulty anticipating future satisfaction.

The book’s practical question is when to rely on intuition and when to use more deliberate checks against recurring errors in judgment.

Sources and details

Thinking, Fast and Slow

{
  "access_scope": "Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.",
  "authors": [
    "Daniel Kahneman"
  ],
  "authors_in_source_order": [
    "Daniel Kahneman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:22.338516+00:00"
  },
  "id": "work-coverage-c0af48e6d20983::S1",
  "title": "Thinking, Fast and Slow",
  "url": "https://us.macmillan.com/books/9780374275631/thinkingfastandslow/"
}

Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.

Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2011 first edition. System 1/2 are explanatory constructs; do not imply two literal brain modules or that Kahneman originated all underlying findings.",
  "dated": true,
  "year": 2011
}

The Master Switch: The Rise and Fall of Information Empires

Wu examines a recurring movement from open experimentation to concentrated industrial control in communications and information businesses.

The publisher sets telephone, radio and film histories beside the question of whether internet information flows could follow a similar path.

The strategic issue is who can control access to information once an initially dispersed field becomes an established industry.

Sources and details

The Master Switch: The Rise and Fall of Information Empires

{
  "access_scope": "Publisher description of The Master Switch; the historical pattern is attributed to Wu and is not treated as an inevitable prediction for the internet or AI.",
  "authors": [
    "Tim Wu"
  ],
  "authors_in_source_order": [
    "Tim Wu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:40.583515+00:00"
  },
  "id": "work-coverage-c842dcfddc3ca5::S1",
  "title": "The Master Switch: The Rise and Fall of Information Empires",
  "url": "https://www.penguinrandomhouse.com/books/194417/the-master-switch-by-tim-wu/"
}

Publisher description of The Master Switch; the historical pattern is attributed to Wu and is not treated as an inevitable prediction for the internet or AI.

Publisher description of The Master Switch; the historical pattern is attributed to Wu and is not treated as an inevitable prediction for the internet or AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2010-11-02"
}

Harms of AI

Acemoglu argues that harms from AI depend partly on the direction of its development and use, rather than being unavoidable properties of the technology.

His essay links excessive automation and weak worker gains with possible damage to competition, privacy and political discourse.

He proposes policies that redirect research as well as regulate deployment, while acknowledging that conclusive evidence for imminent or substantial harms is absent.

Sources and details

Harms of AI

{
  "access_scope": "NBER Working Paper 29247 abstract, September 2021; the argument concerns potential harms under a conditional trajectory, not established present-day magnitudes.",
  "authors": [
    "Daron Acemoglu"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu"
  ],
  "dates": {
    "citation_publication_date": "2021/09/13",
    "retrieved_utc": "2026-10-07T18:21:18.352599+00:00"
  },
  "id": "work-coverage-d7e1b77285e260::S1",
  "title": "Harms of AI",
  "url": "https://www.nber.org/papers/w29247"
}

NBER Working Paper 29247 abstract, September 2021; the argument concerns potential harms under a conditional trajectory, not established present-day magnitudes.

NBER Working Paper 29247 abstract, September 2021; the argument concerns potential harms under a conditional trajectory, not established present-day magnitudes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"September 2021 NBER WP 29247; direct page fetch returned 403, but indexed primary NBER abstract was inspected.\"]",
  "dated": true,
  "year": "2021"
}

The Alignment Problem: Machine Learning and Human Values

Christian’s book asks how decision-making algorithms can follow people’s intentions while treating them fairly.

The publisher uses game-playing exploits and biased translation as illustrations of the gap between a system’s behavior and the values its users expect.

Sources and details

The Alignment Problem: Machine Learning and Human Values

{
  "access_scope": "Atlantic Books description; the cited examples are presented as the publisher’s account, not independently audited cases, and UK edition dates are distinct from original publication.",
  "authors": [
    "Brian Christian"
  ],
  "authors_in_source_order": [
    "Brian Christian"
  ],
  "dates": {
    "UK_hardback_and_ebook": "2021-01-21",
    "UK_paperback": "2021-09-02",
    "retrieved_utc": "2026-10-07T18:16:34.090652+00:00"
  },
  "id": "work-coverage-6ea802fabb7548::S1",
  "title": "The Alignment Problem: Machine Learning and Human Values",
  "url": "https://atlantic-books.co.uk/book/the-alignment-problem/"
}

Atlantic Books description; the cited examples are presented as the publisher’s account, not independently audited cases, and UK edition dates are distinct from original publication.

Atlantic Books description; the cited examples are presented as the publisher’s account, not independently audited cases, and UK edition dates are distinct from original publication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2020 original; subtitle Machine Learning and Human Values.",
  "dated": true,
  "year": 2020
}

Material World: The Six Raw Materials That Shape Modern Civilization

Conway’s announcement approaches modern civilization through the materials and energy infrastructure it depends on.

He joins economics, geology, politics and field reporting to examine systems such as electrical networks and structural steel that are easily taken for granted.

The announcement connects renewed attention to those dependencies with the pandemic, war and demand for materials used in low-carbon infrastructure.

Sources and details

Material World — author’s prepublication announcement

{
  "access_scope": "Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.",
  "authors": [
    "Ed Conway"
  ],
  "authors_in_source_order": [
    "Ed Conway"
  ],
  "dates": {
    "publication_status": "In preparation; planned mid-2023",
    "retrieved_utc": "2026-10-07T18:16:53.460550+00:00"
  },
  "id": "work-coverage-724061ab76d334::S1",
  "title": "Material World — author’s prepublication announcement",
  "url": "https://www.edmundconway.com/books/"
}

Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.

Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2023"
}

The New Map: Energy, Climate, and the Clash of Nations

Yergin places energy production, the low-carbon transition and geopolitical rivalry within the same changing map.

The publisher contrasts expanded US oil and gas production with pressure to replace carbon-intensive energy, presenting these as overlapping transformations.

The book connects those transformations to relations among major powers and the vulnerabilities of important trade routes.

Sources and details

The New Map: Energy, Climate, and the Clash of Nations

{
  "access_scope": "Publisher description of The New Map; its geopolitical account reflects the book’s historical setting and is not a current political or energy-market update.",
  "authors": [
    "Daniel Yergin"
  ],
  "authors_in_source_order": [
    "Daniel Yergin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:28.876551+00:00"
  },
  "id": "work-coverage-f3a6256ef89d6f::S1",
  "title": "The New Map: Energy, Climate, and the Clash of Nations",
  "url": "https://www.penguinrandomhouse.com/books/317939/the-new-map-by-daniel-yergin/9780698191051/"
}

Publisher description of The New Map; its geopolitical account reflects the book’s historical setting and is not a current political or energy-market update.

Publisher description of The New Map; its geopolitical account reflects the book’s historical setting and is not a current political or energy-market update.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2020"
}

Moore’s Law for Everything

Altman proposes a fund financed by levies on large companies and privately held land, intended to distribute some of the gains from an AI-intensive economy.

In his proposal, companies would contribute shares while landowners would contribute money, and adult citizens would receive distributions from the fund.

He argues that shared ownership could connect citizens’ interests with national value creation, presenting this as a policy response to a possible shift of economic power from labor to capital.

Sources and details

Moore’s Law for Everything

{
  "access_scope": "Sam Altman’s March 16, 2021 essay, proposed American Equity Fund section; this is a normative and predictive proposal, not enacted policy or demonstrated distributional benefit.",
  "authors": [
    "Sam Altman"
  ],
  "authors_in_source_order": [
    "Sam Altman"
  ],
  "dates": {
    "published": "2021-03-16",
    "retrieved_utc": "2026-10-07T17:54:29.231097+00:00"
  },
  "id": "work-e9c0c4d4ab7d::S1",
  "title": "Moore’s Law for Everything",
  "url": "https://moores.samaltman.com/"
}

Sam Altman’s March 16, 2021 essay, proposed American Equity Fund section; this is a normative and predictive proposal, not enacted policy or demonstrated distributional benefit.

Sam Altman’s March 16, 2021 essay, proposed American Equity Fund section; this is a normative and predictive proposal, not enacted policy or demonstrated distributional benefit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "March 16, 2021 personal essay.",
  "dated": true,
  "year": 2021
}

Grandmaster level in StarCraft II using multi-agent reinforcement learning

The AlphaStar announcement combines imitation learning with reinforcement learning and a training league of competing agents.

The reported evaluation adds camera-based observation and tighter action limits, bringing the test conditions closer to those used by human StarCraft II players.

Separate agents cover the three game races, while the league begins with supervised agents rather than importing previously trained agents from earlier experiments.

Sources and details

AlphaStar: Grandmaster level in StarCraft II using multi-agent reinforcement learning

{
  "access_scope": "DeepMind announcement by the AlphaStar team, October 30, 2019; Grandmaster results refer to the reported game conditions, not general strategic intelligence.",
  "authors": [
    "The AlphaStar team"
  ],
  "authors_in_source_order": [
    "The AlphaStar team"
  ],
  "dates": {
    "published": "2019-10-30",
    "retrieved_utc": "2026-10-07T18:21:30.290713+00:00"
  },
  "id": "work-coverage-146f4e76645c1a::S1",
  "title": "AlphaStar: Grandmaster level in StarCraft II using multi-agent reinforcement learning",
  "url": "https://deepmind.google/blog/alphastar-grandmaster-level-in-starcraft-ii-using-multi-agent-reinforcement-learning/"
}

DeepMind announcement by the AlphaStar team, October 30, 2019; Grandmaster results refer to the reported game conditions, not general strategic intelligence.

DeepMind announcement by the AlphaStar team, October 30, 2019; Grandmaster results refer to the reported game conditions, not general strategic intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Published October 30, 2019.",
  "dated": true,
  "year": 2019
}

Scalable emulation of protein equilibrium ensembles with generative deep learning

BioEmu models an ensemble of protein conformations rather than predicting only one static structure.

Its training combines molecular-dynamics simulations, known structures and experimental stability information to represent motions such as pocket formation and domain rearrangement.

The authors describe this as amortizing the expensive creation of physical simulation and experimental data across later ensemble generation.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "work-coverage-2ebc07c07e218c::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2025",
  "dated": true,
  "year": 2025
}

Superhuman AI for multiplayer poker

Pluribus develops its core poker strategy through self-play against copies of itself rather than learning from a record of human play.

To make the game tractable, it reduces the actions under consideration and groups similar decision points through abstraction.

The paper distinguishes success in multiplayer poker from the stronger theoretical guarantees available for two-player zero-sum games.

Sources and details

Superhuman AI for multiplayer poker

{
  "access_scope": "2019 Science paper, Description of Pluribus and adjacent abstraction/theoretical-limit passages; not a proof of equilibrium play in all multiplayer settings.",
  "authors": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "authors_in_source_order": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "dates": {
    "paper_year": "2019",
    "retrieved_utc": "2026-10-07T18:11:08.127465+00:00"
  },
  "id": "work-coverage-39f86e03116cca::S1",
  "title": "Superhuman AI for multiplayer poker",
  "url": "https://noambrown.github.io/papers/19-Science-Superhuman.pdf"
}

2019 Science paper, Description of Pluribus and adjacent abstraction/theoretical-limit passages; not a proof of equilibrium play in all multiplayer settings.

2019 Science paper, Description of Pluribus and adjacent abstraction/theoretical-limit passages; not a proof of equilibrium play in all multiplayer settings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Published 2019; keep separate from Libratus.",
  "dated": true,
  "year": 2019
}

Resistive switching materials for information processing

The review examines materials that change resistance as possible building blocks for storing information and computing within memory.

It distinguishes redox reactions, phase transitions, spin-polarized tunneling and ferroelectric polarization as four physical routes to switching.

Those routes involve different trade-offs in speed, energy, reliability and density, which must be matched to system and algorithm requirements.

Sources and details

Resistive switching materials for information processing

{
  "access_scope": "Nature Reviews Materials abstract; proposed computing applications are not a claim that all material classes are commercially deployed or outperform transistor systems.",
  "authors": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "authors_in_source_order": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "dates": {
    "citation_publication_date": "2020/03",
    "retrieved_utc": "2026-10-07T18:11:35.128101+00:00"
  },
  "id": "work-coverage-51c30e35b2d14d::S1",
  "title": "Resistive switching materials for information processing",
  "url": "https://www.nature.com/articles/s41578-019-0159-3"
}

Nature Reviews Materials abstract; proposed computing applications are not a claim that all material classes are commercially deployed or outperform transistor systems.

Nature Reviews Materials abstract; proposed computing applications are not a claim that all material classes are commercially deployed or outperform transistor systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2020-01-13"
}

Mathematical discoveries from program search with large language models

FunSearch pairs a pretrained language model that proposes programs with an evaluator that checks the quality of their outputs.

The evolutionary search keeps working over programs that describe how to solve a problem, instead of searching only for isolated answers.

The paper applies that loop to cap-set constructions and online bin-packing heuristics, using evaluation to constrain plausible but incorrect generated suggestions.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.",
  "authors": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "authors_in_source_order": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00"
  },
  "id": "work-coverage-5dac47cfc6e54b::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Online December 14, 2023; Nature volume 625 publication year 2024.",
  "dated": true,
  "year": 2023
}

Language Models are Unsupervised Multitask Learners

The GPT-2 report trains a language model on WebText and tests whether tasks can be elicited without separate task-specific training datasets.

For question answering, a document and questions supply the context from which the model generates answers, making the form of the text part of the task interface.

The authors report improved transfer with increased model capacity while noting that even their largest model still underfits WebText.

Sources and details

Language Models are Unsupervised Multitask Learners

{
  "access_scope": "OpenAI technical report abstract and adjacent introduction; zero-shot results are benchmark-specific, not an assertion of universally reliable multitask reasoning.",
  "authors": [
    "Alec Radford",
    "Jeffrey Wu",
    "Rewon Child",
    "David Luan",
    "Dario Amodei",
    "Ilya Sutskever"
  ],
  "authors_in_source_order": [
    "Alec Radford",
    "Jeffrey Wu",
    "Rewon Child",
    "David Luan",
    "Dario Amodei",
    "Ilya Sutskever"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:49.732490+00:00"
  },
  "id": "work-coverage-60e2ee0683812a::S1",
  "title": "Language Models are Unsupervised Multitask Learners",
  "url": "https://cdn.openai.com/better-language-models/language_models_are_unsupervised_multitask_learners.pdf"
}

OpenAI technical report abstract and adjacent introduction; zero-shot results are benchmark-specific, not an assertion of universally reliable multitask reasoning.

OpenAI technical report abstract and adjacent introduction; zero-shot results are benchmark-specific, not an assertion of universally reliable multitask reasoning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Formal publication year: 2019; Formal venue: OpenAI technical report; Formal source url: https://cdn.openai.com/better-language-models/language_models_are_unsupervised_multitask_learners.pdf; First public release date: 2019-02-14; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2019
}

Mastering the game of Go without human knowledge

AlphaGo Zero learns from self-play starting with random play, rather than first imitating recorded human games.

A neural network and search generate games whose outcomes then train the network to predict moves and winners, creating an iterative improvement loop.

The announcement describes a single network combining policy and value functions and evaluating positions without the random-game rollouts used by earlier systems.

Sources and details

AlphaGo Zero: Starting from scratch

{
  "access_scope": "DeepMind announcement by David Silver and Demis Hassabis, October 18, 2017; absence of human game examples does not mean absence of rules, engineered architecture or computation.",
  "authors": [
    "David Silver",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "David Silver",
    "Demis Hassabis"
  ],
  "dates": {
    "published": "2017-10-18",
    "retrieved_utc": "2026-10-07T18:19:10.191278+00:00"
  },
  "id": "work-coverage-695fb2c0d9de80::S1",
  "title": "AlphaGo Zero: Starting from scratch",
  "url": "https://deepmind.google/blog/alphago-zero-starting-from-scratch/"
}

DeepMind announcement by David Silver and Demis Hassabis, October 18, 2017; absence of human game examples does not mean absence of rules, engineered architecture or computation.

DeepMind announcement by David Silver and Demis Hassabis, October 18, 2017; absence of human game examples does not mean absence of rules, engineered architecture or computation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Published October 2017; separate work from AlphaZero.",
  "dated": true,
  "year": 2017
}

Accurate prediction of protein structures and interactions using a three-track neural network

The three-track network integrates protein sequence information, pairwise distance information and three-dimensional coordinates during prediction.

Passing information among these representations lets the model connect evidence at different structural levels rather than treating them as separate end stages.

The authors describe applications to structure modeling and protein-complex prediction and make the method available to the research community.

Sources and details

Accurate prediction of protein structures and interactions using a 3-track neural network

{
  "access_scope": "Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.",
  "authors": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "dates": {
    "citation_publication_date": "2021 Jul 15",
    "retrieved_utc": "2026-10-07T18:12:07.573538+00:00"
  },
  "id": "work-coverage-757360fb1abd1e::S1",
  "title": "Accurate prediction of protein structures and interactions using a 3-track neural network",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC7612213/"
}

Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2021",
  "dated": true,
  "year": 2021
}

Solving olympiad geometry without human demonstrations

AlphaGeometry uses synthetic theorems and proofs to address the scarcity of machine-verifiable geometry training examples.

Its neural language model guides a symbolic deduction engine through branching choices, combining learned suggestions with explicit geometric reasoning.

The paper reports human-readable proofs and evaluates the system on a defined set of olympiad-level problems.

Sources and details

Solving olympiad geometry without human demonstrations

{
  "access_scope": "Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.",
  "authors": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:16:15.999178+00:00"
  },
  "id": "work-coverage-760d758d471ba4::S1",
  "title": "Solving olympiad geometry without human demonstrations",
  "url": "https://www.nature.com/articles/s41586-023-06747-5"
}

Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

Learning to Simulate Complex Physics with Graph Networks

Graph Network-based Simulators represent physical systems as particles linked in a graph and update their dynamics through learned message passing.

The paper trains on single-step predictions and tests much longer trajectories and larger systems, distinguishing local prediction from accumulated simulation behavior.

It identifies message-passing depth and training-data noise as important to long-term performance, with the noise helping reduce error accumulation.

Sources and details

Learning to Simulate Complex Physics with Graph Networks

{
  "access_scope": "PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.",
  "authors": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "authors_in_source_order": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "dates": {
    "citation_publication_date": "2020/11/21",
    "retrieved_utc": "2026-10-07T18:12:52.705222+00:00"
  },
  "id": "work-coverage-773633069466db::S1",
  "title": "Learning to Simulate Complex Physics with Graph Networks",
  "url": "https://proceedings.mlr.press/v119/sanchez-gonzalez20a.html"
}

PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.

PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2020",
  "dated": true,
  "year": 2020
}

Scaling deep learning for materials discovery

The materials-discovery study scales graph-network predictions to identify inorganic crystal structures that satisfy its computational stability criteria.

Those calculations support screening for applications such as layered materials and solid electrolytes, while also supplying data for learned interatomic models.

The paper separates the much larger set of computed candidates from the smaller set of structures it reports as independently realized experimentally.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "work-coverage-776871e0d21847::S1",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2023",
  "dated": true,
  "year": 2023
}

Olympiad-level formal mathematical reasoning with reinforcement learning

AlphaProof trains through reinforcement learning in a formal proof environment using millions of automatically formalized problems.

For difficult cases, test-time reinforcement learning generates and learns from related variants, adapting the search to a particular problem.

Its olympiad result combines AlphaProof with AlphaGeometry2 and multi-day computation, making both the formal verification setting and the resources used part of the comparison.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "work-coverage-7eec78c2922ab9::S1",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2024 demonstration; online Nature publication November 12, 2025; volume 651 pages 607–613 assigned to 2026.",
  "dated": true,
  "year": 2025
}

Highly accurate protein structure prediction with AlphaFold

The redesigned AlphaFold model incorporates knowledge of protein structure and information from multiple sequence alignments into a deep-learning architecture.

It targets the gap between abundant amino-acid sequences and the much smaller set of experimentally determined structures.

The paper validates predictions in CASP14, reporting accuracy competitive with experimental structures in a majority of the evaluated cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.",
  "authors": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2021/08",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00"
  },
  "id": "work-coverage-870cabfe388a6b::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "CASP14 in 2020; Nature published July 15, 2021.",
  "dated": true,
  "year": 2021
}

A foundation model for the Earth system

Aurora is pretrained on diverse geophysical data and then fine-tuned for different Earth-system forecasting tasks.

The paper applies the shared model to air quality, ocean waves, cyclone tracks and weather, using adaptation rather than a completely separate model built for every domain.

Its reported comparisons concern both predictive performance and computational cost against the operational forecasts evaluated in the study.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Nature abstract and opening discussion; model forecasts are not guaranteed warnings for every future event or evidence of universal operational adoption.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "work-coverage-8866f518894ea0::S1",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Nature abstract and opening discussion; model forecasts are not guaranteed warnings for every future event or evidence of universal operational adoption.

Nature abstract and opening discussion; model forecasts are not guaranteed warnings for every future event or evidence of universal operational adoption.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2025",
  "dated": true,
  "year": 2025
}

A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play

The AlphaZero preprint applies one reinforcement-learning approach to chess, shogi and Go through self-play.

Training begins with random play and game rules rather than handcrafted evaluation functions or examples of expert play.

The authors compare the resulting agents with strong game-specific programs, testing whether a shared learning approach can cover these distinct rule systems.

Sources and details

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

{
  "access_scope": "December 2017 arXiv v1 abstract, titled Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm; linked to the canonical later-paper label without claiming to inspect that later publication.",
  "authors": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Lai, Matthew",
    "Guez, Arthur",
    "Lanctot, Marc",
    "Sifre, Laurent",
    "Kumaran, Dharshan",
    "Graepel, Thore",
    "Lillicrap, Timothy",
    "Simonyan, Karen",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_date": "2017/12/05",
    "inspected_revision": "Tue, 5 Dec 2017 18:45:38 UTC (272 KB)",
    "retrieved_utc": "2026-10-07T18:14:35.606425+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-89b49be4e6ae6e::S1",
  "title": "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm",
  "url": "https://arxiv.org/abs/1712.01815",
  "version_url": "https://arxiv.org/abs/1712.01815v1"
}

December 2017 arXiv v1 abstract, titled Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm; linked to the canonical later-paper label without claiming to inspect that later publication.

December 2017 arXiv v1 abstract, titled Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm; linked to the canonical later-paper label without claiming to inspect that later publication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Journal paper is 2018; predecessor preprint was submitted in December 2017.",
  "dated": true,
  "year": 2018
}

Learning skillful medium-range global weather forecasting

GraphCast learns medium-range weather prediction directly from reanalysis data instead of relying solely on a hand-built numerical model.

It predicts many weather variables globally over a ten-day horizon, allowing its output to be evaluated on a range of forecast targets and severe-event indicators.

The preprint’s comparison is with operational deterministic forecasting systems, which is distinct from assessing a full probabilistic ensemble.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-90b4ac0beafe6f::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "arXiv GraphCast preprint 2022; Science 2023, DOI 10.1126/science.adi2336.",
  "dated": true,
  "year": 2023
}

Improved protein structure prediction using potentials from deep learning

The earlier AlphaFold system predicts distances between pairs of protein residues rather than only whether the residues are in contact.

Those distance predictions define a potential describing the protein’s shape, which can be optimized with gradient descent to produce structures.

The paper evaluates this approach in CASP13, connecting a richer learned structural representation with the search for a three-dimensional model.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.",
  "authors": [
    "Senior, Andrew W.",
    "Evans, Richard",
    "Jumper, John",
    "Kirkpatrick, James",
    "Sifre, Laurent",
    "Green, Tim",
    "Qin, Chongli",
    "Žídek, Augustin",
    "Nelson, Alexander W. R.",
    "Bridgland, Alex",
    "Penedones, Hugo",
    "Petersen, Stig",
    "Simonyan, Karen",
    "Crossan, Steve",
    "Kohli, Pushmeet",
    "Jones, David T.",
    "Silver, David",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Senior, Andrew W.",
    "Evans, Richard",
    "Jumper, John",
    "Kirkpatrick, James",
    "Sifre, Laurent",
    "Green, Tim",
    "Qin, Chongli",
    "Žídek, Augustin",
    "Nelson, Alexander W. R.",
    "Bridgland, Alex",
    "Penedones, Hugo",
    "Petersen, Stig",
    "Simonyan, Karen",
    "Crossan, Steve",
    "Kohli, Pushmeet",
    "Jones, David T.",
    "Silver, David",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2020/01",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00"
  },
  "id": "work-coverage-96e89f42f688bf::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.

Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "CASP13 in 2018; Nature publication January 2020.",
  "dated": true,
  "year": 2020
}

Accurate structure prediction of biomolecular interactions with AlphaFold 3

AlphaFold3 uses a diffusion-based architecture to predict joint structures containing multiple kinds of biomolecules.

Proteins, nucleic acids, small molecules, ions and modified residues can be modeled within the same framework rather than requiring a separate specialist predictor for each interaction type.

The paper compares predictions with existing tools across specified interaction categories, including protein–ligand and antibody–antigen complexes.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.",
  "authors": [
    "Abramson, Josh",
    "Adler, Jonas",
    "Dunger, Jack",
    "Evans, Richard",
    "Green, Tim",
    "Pritzel, Alexander",
    "Ronneberger, Olaf",
    "Willmore, Lindsay",
    "Ballard, Andrew J.",
    "Bambrick, Joshua",
    "Bodenstein, Sebastian W.",
    "Evans, David A.",
    "Hung, Chia-Chun",
    "O’Neill, Michael",
    "Reiman, David",
    "Tunyasuvunakool, Kathryn",
    "Wu, Zachary",
    "Žemgulytė, Akvilė",
    "Arvaniti, Eirini",
    "Beattie, Charles",
    "Bertolli, Ottavia",
    "Bridgland, Alex",
    "Cherepanov, Alexey",
    "Congreve, Miles",
    "Cowen-Rivers, Alexander I.",
    "Cowie, Andrew",
    "Figurnov, Michael",
    "Fuchs, Fabian B.",
    "Gladman, Hannah",
    "Jain, Rishub",
    "Khan, Yousuf A.",
    "Low, Caroline M. R.",
    "Perlin, Kuba",
    "Potapenko, Anna",
    "Savy, Pascal",
    "Singh, Sukhdeep",
    "Stecula, Adrian",
    "Thillaisundaram, Ashok",
    "Tong, Catherine",
    "Yakneen, Sergei",
    "Zhong, Ellen D.",
    "Zielinski, Michal",
    "Žídek, Augustin",
    "Bapst, Victor",
    "Kohli, Pushmeet",
    "Jaderberg, Max",
    "Hassabis, Demis",
    "Jumper, John M."
  ],
  "authors_in_source_order": [
    "Abramson, Josh",
    "Adler, Jonas",
    "Dunger, Jack",
    "Evans, Richard",
    "Green, Tim",
    "Pritzel, Alexander",
    "Ronneberger, Olaf",
    "Willmore, Lindsay",
    "Ballard, Andrew J.",
    "Bambrick, Joshua",
    "Bodenstein, Sebastian W.",
    "Evans, David A.",
    "Hung, Chia-Chun",
    "O’Neill, Michael",
    "Reiman, David",
    "Tunyasuvunakool, Kathryn",
    "Wu, Zachary",
    "Žemgulytė, Akvilė",
    "Arvaniti, Eirini",
    "Beattie, Charles",
    "Bertolli, Ottavia",
    "Bridgland, Alex",
    "Cherepanov, Alexey",
    "Congreve, Miles",
    "Cowen-Rivers, Alexander I.",
    "Cowie, Andrew",
    "Figurnov, Michael",
    "Fuchs, Fabian B.",
    "Gladman, Hannah",
    "Jain, Rishub",
    "Khan, Yousuf A.",
    "Low, Caroline M. R.",
    "Perlin, Kuba",
    "Potapenko, Anna",
    "Savy, Pascal",
    "Singh, Sukhdeep",
    "Stecula, Adrian",
    "Thillaisundaram, Ashok",
    "Tong, Catherine",
    "Yakneen, Sergei",
    "Zhong, Ellen D.",
    "Zielinski, Michal",
    "Žídek, Augustin",
    "Bapst, Victor",
    "Kohli, Pushmeet",
    "Jaderberg, Max",
    "Hassabis, Demis",
    "Jumper, John M."
  ],
  "dates": {
    "citation_publication_date": "2024/06",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00"
  },
  "id": "work-coverage-a9f6db63f8e2ac::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.

Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

Understanding the difficulty of training deep feedforward neural networks

Glorot and Bengio investigate why standard random initialization and gradient descent can train deep networks poorly.

They connect sigmoid activations with saturation and examine how activations and gradients change across layers, including the role of layer Jacobians.

Their proposed initialization follows from this analysis and is evaluated for convergence, making initialization part of the learning problem rather than a neutral starting detail.

Sources and details

Understanding the difficulty of training deep feedforward neural networks

{
  "access_scope": "PMLR abstract; conclusions concern the investigated architectures and experiments. Metadata’s March 31 date and the venue’s May 13–15, 2010 conference dates remain separate.",
  "authors": [
    "Xavier Glorot",
    "Yoshua Bengio"
  ],
  "authors_in_source_order": [
    "Xavier Glorot",
    "Yoshua Bengio"
  ],
  "dates": {
    "citation_publication_date": "2010/03/31",
    "retrieved_utc": "2026-10-07T18:16:08.019192+00:00"
  },
  "id": "work-coverage-b2589590412281::S1",
  "title": "Understanding the difficulty of training deep feedforward neural networks",
  "url": "https://proceedings.mlr.press/v9/glorot10a.html"
}

PMLR abstract; conclusions concern the investigated architectures and experiments. Metadata’s March 31 date and the venue’s May 13–15, 2010 conference dates remain separate.

PMLR abstract; conclusions concern the investigated architectures and experiments. Metadata’s March 31 date and the venue’s May 13–15, 2010 conference dates remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Formal publication year: 2010; Formal venue: AISTATS; Formal source url: https://proceedings.mlr.press/v9/glorot10a.html; Formal publication status: identified; Publication verification: primary_formal_record_linked; not_all_venue_records_reopened_in_this_pass",
  "dated": true,
  "year": 2010
}

De novo design of protein structure and function with RFdiffusion

RFdiffusion turns a protein-structure prediction network into a generator by fine-tuning it on denoising tasks.

The generated backbones can be constrained toward designs such as binders, symmetric assemblies and active-site scaffolds.

The authors distinguish computational proposals from laboratory characterization, reporting structural and functional tests of designed proteins.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "work-coverage-b76d76701f075b::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2023",
  "dated": true,
  "year": 2023
}

Hello Neighbor

Hello Neighbor makes repeated stealth attempts part of a contest with an opponent whose responses the store page describes as adapting to the player.

Its examples connect a reused entry route with new traps or cameras and an escape attempt with a shortcut used by the pursuer.

That design makes habits visible as vulnerabilities within the game, rather than treating each attempt as a fixed sequence of obstacles.

Sources and details

Hello Neighbor — Steam game description

{
  "access_scope": "Steam developer/publisher description; adaptation and learning are advertised game behaviors, not independently verified machine-learning architecture or general intelligence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:55.111889+00:00"
  },
  "id": "work-coverage-0cda4e9dbf7073::S1",
  "title": "Hello Neighbor — Steam game description",
  "url": "https://store.steampowered.com/app/521890/"
}

Steam developer/publisher description; adaptation and learning are advertised game behaviors, not independently verified machine-learning architecture or general intelligence.

Steam developer/publisher description; adaptation and learning are advertised game behaviors, not independently verified machine-learning architecture or general intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

Stellaris

Stellaris combines surveying star systems, building infrastructure and shaping a society with diplomacy and warfare.

The cached edition describes a Synthetic Dawn pack in which the player can lead a machine empire, making coexistence with organic societies one of the game’s imagined choices.

Procedural encounters and empire customization vary the setting in which those choices are made.

Sources and details

Stellaris — Steam game description

{
  "access_scope": "Cached Steam game and included-expansion description; the bundled features are not asserted to have existed at the base game’s original launch, and fictional societies are not forecasts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:51.457627+00:00"
  },
  "id": "work-coverage-0ed8d783da82e0::S1",
  "title": "Stellaris — Steam game description",
  "url": "https://store.steampowered.com/app/281990/"
}

Cached Steam game and included-expansion description; the bundled features are not asserted to have existed at the base game’s original launch, and fictional societies are not forecasts.

Cached Steam game and included-expansion description; the bundled features are not asserted to have existed at the base game’s original launch, and fictional societies are not forecasts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

Horizon Forbidden West

The Horizon Forbidden West launch account places Aloy in a world whose biosphere is failing through blight and severe storms.

Her search for a remedy combines confrontations with machines and human factions with investigation of the ancient past.

The director’s synopsis also makes reliance on companions part of the response, joining environmental repair to a story about knowledge and cooperation.

Sources and details

Horizon Forbidden West is available tonight

{
  "access_scope": "PlayStation launch announcement by Mathijs de Jonge, February 2022; this is a fictional synopsis, without importing unmentioned plot details or treating machines as real technology.",
  "authors": [
    "Mathijs de Jonge"
  ],
  "authors_in_source_order": [
    "Mathijs de Jonge"
  ],
  "dates": {
    "article_date_labels": [
      "2022-02-17",
      "2022-02-18"
    ],
    "retrieved_utc": "2026-10-07T18:23:46.638136+00:00"
  },
  "id": "work-coverage-1194ad86a37eef::S1",
  "title": "Horizon Forbidden West is available tonight",
  "url": "https://blog.playstation.com/2022/02/17/horizon-forbidden-west-is-available-tonight/"
}

PlayStation launch announcement by Mathijs de Jonge, February 2022; this is a fictional synopsis, without importing unmentioned plot details or treating machines as real technology.

PlayStation launch announcement by Mathijs de Jonge, February 2022; this is a fictional synopsis, without importing unmentioned plot details or treating machines as real technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2022
}

Left 4 Dead

Left 4 Dead places cooperative survival inside encounters paced by the game’s AI Director.

Valve’s description says that the Director adjusts the frequency and intensity of attacks in response to player performance, so managing the experience is distinct from controlling an individual enemy.

Team objectives and the changing encounter schedule jointly shape the challenge described by the game page.

Sources and details

Left 4 Dead — Steam game description

{
  "access_scope": "Steam game description; pacing behavior is attributed to Valve, without inferring its implementation or a historical influence on reinforcement learning.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:54.881107+00:00"
  },
  "id": "work-coverage-2175a56709e9fd::S1",
  "title": "Left 4 Dead — Steam game description",
  "url": "https://store.steampowered.com/app/500/"
}

Steam game description; pacing behavior is attributed to Valve, without inferring its implementation or a historical influence on reinforcement learning.

Steam game description; pacing behavior is attributed to Valve, without inferring its implementation or a historical influence on reinforcement learning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2008
}

Twelve Minutes

Twelve Minutes repeatedly returns the player to the beginning of a domestic crisis after the protagonist dies.

The player must use knowledge gained in earlier iterations to change subsequent actions and break the loop.

Its real-time, top-down interface makes that repeated investigation a playable structure rather than only a narrated premise.

Sources and details

Twelve Minutes — Steam game description

{
  "access_scope": "Steam synopsis and gameplay description; the time loop is fictional, and relevance to learning through repetition is editorial.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:49.802307+00:00"
  },
  "id": "work-coverage-29bebe86d67b58::S1",
  "title": "Twelve Minutes — Steam game description",
  "url": "https://store.steampowered.com/app/1097200/"
}

Steam synopsis and gameplay description; the time loop is fictional, and relevance to learning through repetition is editorial.

Steam synopsis and gameplay description; the time loop is fictional, and relevance to learning through repetition is editorial.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2021
}

Detroit: Become Human

Quantic Dream’s developers describe Detroit: Become Human as an intertwined set of android stories whose possible paths had to remain coherent when characters met.

The retrospective identifies coordinating the endgame across many possibilities as a production problem spanning creative direction, scene sequencing, quality and performance.

This account makes branching narrative a collaborative implementation task, rather than attributing the entire game to one creator.

Sources and details

QD REACTS – DETROIT: BECOME HUMAN 3RD ANNIVERSARY

{
  "access_scope": "Studio anniversary interviews dated May 25, 2021; developer accounts of production are attributed and do not establish real android capabilities or measured audience impact.",
  "authors": [
    "Quantic Dream"
  ],
  "authors_in_source_order": [
    "Quantic Dream"
  ],
  "dates": {
    "reported_game_release": "2018-05-25",
    "retrieved_utc": "2026-10-07T18:23:46.638279+00:00",
    "retrospective": "2021-05-25"
  },
  "id": "work-coverage-35c5b919cd82ff::S1",
  "title": "QD REACTS – DETROIT: BECOME HUMAN 3RD ANNIVERSARY",
  "url": "https://blog.quanticdream.com/qd-reacts-detroit-become-human-3rd-anniversary-2/"
}

Studio anniversary interviews dated May 25, 2021; developer accounts of production are attributed and do not establish real android capabilities or measured audience impact.

Studio anniversary interviews dated May 25, 2021; developer accounts of production are attributed and do not establish real android capabilities or measured audience impact.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

Autómata

Autómata imagines a deteriorating environment in which ROC develops robots intended to support human survival.

The corporation’s security protocols are meant to keep humans in control, but insurance agent Jacq Vaucan’s investigations expose unusual behavior and a larger mystery.

The catalog synopsis places the question of coexistence beside corporate responsibility and the uncertainty of the human future.

Sources and details

AUTÓMATA — ICAA film catalog synopsis

{
  "access_scope": "ICAA English and Spanish film synopsis for the 2014 production; depicted technology and events are fictional, with no inference from box-office metadata.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "listed_Spain_release": "2014-11-24",
    "production_year": "2014",
    "retrieved_utc": "2026-10-07T18:14:17.345368+00:00"
  },
  "id": "work-coverage-3cdd5acdeae391::S1",
  "title": "AUTÓMATA — ICAA film catalog synopsis",
  "url": "https://sede.mcu.gob.es/CatalogoICAA/es-es/Peliculas/Detalle?Pelicula=117613"
}

ICAA English and Spanish film synopsis for the 2014 production; depicted technology and events are fictional, with no inference from box-office metadata.

ICAA English and Spanish film synopsis for the 2014 production; depicted technology and events are fictional, with no inference from box-office metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Festival official 2014 selection verifies title and director. Spanish ICAA explicitly confirms 2014 production: https://sede.mcu.gob.es/CatalogoICAA/es-es/Peliculas/Detalle?Pelicula=117613",
  "dated": true,
  "year": 2014
}

The Mitchells vs. the Machines

The Mitchells vs. the Machines interrupts a strained family road trip with a rebellion of familiar electronic devices and personal robots.

The studio synopsis gives the family two malfunctioning robot allies, contrasting the larger machine uprising with particular cooperative relationships.

Resolving the family’s own conflicts becomes part of its effort to survive the technological crisis.

Sources and details

The Mitchells vs. the Machines — Sony Pictures Animation synopsis

{
  "access_scope": "Sony Pictures Animation film synopsis; these are fictional relationships and plot events, not evidence about actual robot reliability or consciousness.",
  "authors": [
    "Sony Pictures Animation"
  ],
  "authors_in_source_order": [
    "Sony Pictures Animation"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:11.988682+00:00"
  },
  "id": "work-coverage-4267d90e9a2c3f::S1",
  "title": "The Mitchells vs. the Machines — Sony Pictures Animation synopsis",
  "url": "https://stg.sonypicturesanimation.com/projects/films/themitchellsvsthemachines"
}

Sony Pictures Animation film synopsis; these are fictional relationships and plot events, not evidence about actual robot reliability or consciousness.

Sony Pictures Animation film synopsis; these are fictional relationships and plot events, not evidence about actual robot reliability or consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2021
}

while True: learn()

while True: learn() turns machine-learning concepts into blocks that the player connects in flowcharts to process data.

The puzzles require trade-offs among accuracy, speed and cost; improved hardware and reusable blocks can change how a later job is approached.

The game pairs those simplified mechanics with notes and reading links, explicitly presenting itself as an introduction to the field rather than a programming course.

Sources and details

while True: learn() — Steam game description

{
  "access_scope": "Cached Steam game description; its blocks and fictional translation objective are educational abstractions, not implementations of every technique or proof of educational effectiveness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:06.995327+00:00"
  },
  "id": "work-coverage-5e9976c8369b3e::S1",
  "title": "while True: learn() — Steam game description",
  "url": "https://store.steampowered.com/app/619150/"
}

Cached Steam game description; its blocks and fictional translation objective are educational abstractions, not implementations of every technique or proof of educational effectiveness.

Cached Steam game description; its blocks and fictional translation objective are educational abstractions, not implementations of every technique or proof of educational effectiveness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

Outer Wilds

Outer Wilds makes exploration depend on a solar system that changes while a repeating time loop runs.

The store page describes places that disappear under sand or crumble, making when a player visits as significant as where they go.

Gadgets for probing surroundings, following signals and reading alien writing support the investigation of that changing environment.

Sources and details

Outer Wilds — Steam game description

{
  "access_scope": "Steam gameplay description; scientific-looking tools and planetary events are game mechanics, and any comparison to research workflows is editorial.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:07.642009+00:00"
  },
  "id": "work-coverage-64c053ba384253::S1",
  "title": "Outer Wilds — Steam game description",
  "url": "https://store.steampowered.com/app/753640/"
}

Steam gameplay description; scientific-looking tools and planetary events are game mechanics, and any comparison to research workflows is editorial.

Steam gameplay description; scientific-looking tools and planetary events are game mechanics, and any comparison to research workflows is editorial.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

Upgrade

Upgrade offers its protagonist an AI implant after an attack leaves him paralyzed and his wife dead.

The studio synopsis links the implant’s extraordinary bodily abilities to his pursuit of revenge, making technological assistance part of a personal conflict.

Sources and details

Upgrade — Universal Pictures synopsis

{
  "access_scope": "Universal Pictures film synopsis; the implant and its effects are fictional, and unmentioned later plot revelations are not imported.",
  "authors": [
    "Universal Pictures"
  ],
  "authors_in_source_order": [
    "Universal Pictures"
  ],
  "dates": {
    "listed_release_year": "2018",
    "retrieved_utc": "2026-10-07T18:13:03.240805+00:00"
  },
  "id": "work-coverage-69b53232f5babf::S1",
  "title": "Upgrade — Universal Pictures synopsis",
  "url": "https://www.universalpicturesathome.com/movies/upgrade"
}

Universal Pictures film synopsis; the implant and its effects are fictional, and unmentioned later plot revelations are not imported.

Universal Pictures film synopsis; the implant and its effects are fictional, and unmentioned later plot revelations are not imported.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Distributor explicitly lists 2018 release year and Leigh Whannell as director.",
  "dated": true,
  "year": 2018
}

M3GAN

M3GAN presents a prototype doll designed to combine companionship, teaching and protection for a child.

The studio synopsis places that multi-role system in an unexpected caregiving arrangement when its designer becomes guardian of her niece.

The resulting crisis is framed as emerging from pairing the child with the prototype, without the synopsis establishing a technical explanation for the failure.

Sources and details

M3GAN — Universal Pictures synopsis

{
  "access_scope": "Universal Pictures synopsis; fictional learning and caregiving are not evidence of real consciousness, safe deployment or effective child care. Release year 2023 is distinct from the displayed 2022 copyright.",
  "authors": [
    "Universal Pictures"
  ],
  "authors_in_source_order": [
    "Universal Pictures"
  ],
  "dates": {
    "displayed_copyright": "2022",
    "listed_release_year": "2023",
    "retrieved_utc": "2026-10-07T18:12:29.796178+00:00"
  },
  "id": "work-coverage-6ae8bf88f3f308::S1",
  "title": "M3GAN — Universal Pictures synopsis",
  "url": "https://www.universalpicturesathome.com/movies/m3gan"
}

Universal Pictures synopsis; fictional learning and caregiving are not evidence of real consciousness, safe deployment or effective child care. Release year 2023 is distinct from the displayed 2022 copyright.

Universal Pictures synopsis; fictional learning and caregiving are not evidence of real consciousness, safe deployment or effective child care. Release year 2023 is distinct from the displayed 2022 copyright.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "premiere",
      "year": 2022
    },
    {
      "kind": "US_commercial_release",
      "year": 2023
    }
  ],
  "date_note": "Use 2022 for first-premiere convention; label 2023 if using US theatrical release years. Official page verifies Gerard Johnstone and 2022 copyright; Universal trailer dated 7 December 2022 announces theaters 6 January: https://www.universalstudios.com/videos/OoDHM_A1axc . UPI's dated premiere reporting confirms Los Angeles premiere 7 December 2022 and theaters 6 January 2023: https://www.upi.com/Entertainment_News/Movies/2022/12/08/Jason-Blum-dresses-as-M3gan-at-films-premiere/2081670509797/",
  "dated": true,
  "year": 2022
}

Creatures

The Creatures paper describes virtual pets whose behavior combines a neural network with an artificial biochemical system.

The biochemical model modulates neural activity and development, while lifetime learning supports adaptation and a simple verb–object language.

Genetic encodings specify aspects of both systems and permit variation through reproduction, separating learning within one creature’s life from evolutionary change across generations.

Sources and details

Creatures: Entertainment Software Agents with Artificial Life

{
  "access_scope": "1998 paper Creatures: Entertainment Software Agents with Artificial Life by Stephen Grand and Dave Cliff; it describes the game released in 1996, without establishing biological equivalence or consciousness.",
  "authors": [
    "Stephen Grand",
    "Dave Cliff"
  ],
  "authors_in_source_order": [
    "Stephen Grand",
    "Dave Cliff"
  ],
  "dates": {
    "paper_year": "1998",
    "reported_game_availability": "late 1996",
    "retrieved_utc": "2026-10-07T18:24:08.199098+00:00"
  },
  "id": "work-coverage-72fef6612da28c::S1",
  "title": "Creatures: Entertainment Software Agents with Artificial Life",
  "url": "https://www.cp.eng.chula.ac.th/~vishnu/gameResearch/AI/creatures.pdf"
}

1998 paper Creatures: Entertainment Software Agents with Artificial Life by Stephen Grand and Dave Cliff; it describes the game released in 1996, without establishing biological equivalence or consciousness.

1998 paper Creatures: Entertainment Software Agents with Artificial Life by Stephen Grand and Dave Cliff; it describes the game released in 1996, without establishing biological equivalence or consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1996
}

RimWorld

RimWorld’s storytellers control events such as storms, raids and visiting traders to shape the developing colony story.

The page distinguishes styles including rising tension, relaxation and unpredictability, so the event scheduler affects the rhythm of the experience.

Colonists’ backgrounds and relationships also change what they can do and how they interact, linking system-generated incidents with characters’ circumstances.

Sources and details

RimWorld — Steam game description

{
  "access_scope": "Steam gameplay description; AI storyteller is the game’s term and does not imply an LLM, consciousness or a complete technical account of the scheduler.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:05.510768+00:00"
  },
  "id": "work-coverage-785513de23b292::S1",
  "title": "RimWorld — Steam game description",
  "url": "https://store.steampowered.com/app/294100/"
}

Steam gameplay description; AI storyteller is the game’s term and does not imply an LLM, consciousness or a complete technical account of the scheduler.

Steam gameplay description; AI storyteller is the game’s term and does not imply an LLM, consciousness or a complete technical account of the scheduler.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

Infinifactory

Infinifactory asks players to construct factories that assemble products in a three-dimensional environment.

Its comparison histograms turn other players’ solutions into prompts for further optimization after a working design has been found.

A sandbox and shared custom puzzles extend that design-and-test activity beyond the story campaign.

Sources and details

Infinifactory — Steam game description

{
  "access_scope": "Steam developer description; factory processes are puzzle systems, not validated industrial engineering, and social comparison does not establish learning outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:06.095553+00:00"
  },
  "id": "work-coverage-7ae963f76bd211::S1",
  "title": "Infinifactory — Steam game description",
  "url": "https://store.steampowered.com/app/300570/"
}

Steam developer description; factory processes are puzzle systems, not validated industrial engineering, and social comparison does not establish learning outcomes.

Steam developer description; factory processes are puzzle systems, not validated industrial engineering, and social comparison does not establish learning outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

EXAPUNKS

EXAPUNKS makes programmable execution agents the pieces of an open-ended network puzzle.

Players direct these agents through fictional networks to copy themselves, manipulate files and contend with other agents, using in-world magazines as tutorials.

The game also permits direct program-versus-program competition and custom puzzle creation, making efficiency and interaction part of its design space.

Sources and details

EXAPUNKS — Steam game description

{
  "access_scope": "Steam gameplay description; fictional hacking operations are game mechanics, without claiming to teach or demonstrate exploitation of real systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:07.468335+00:00"
  },
  "id": "work-coverage-7c35013a6f7331::S1",
  "title": "EXAPUNKS — Steam game description",
  "url": "https://store.steampowered.com/app/716490/"
}

Steam gameplay description; fictional hacking operations are game mechanics, without claiming to teach or demonstrate exploitation of real systems.

Steam gameplay description; fictional hacking operations are game mechanics, without claiming to teach or demonstrate exploitation of real systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

The Swapper

The Swapper makes creating duplicate bodies and moving the protagonist’s consciousness between them the central device for solving spatial puzzles.

Its description places those mechanics in an isolated science-fiction setting whose environment carries the story.

The game’s visual world is constructed from clay models and everyday materials, bringing a physical production technique to its imagined transfer of minds.

Sources and details

The Swapper — Steam game description

{
  "access_scope": "Steam developer description; consciousness transfer is a fictional premise, not a claim about physical possibility or actual machine sentience.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:05.061195+00:00"
  },
  "id": "work-coverage-813c02b198adec::S1",
  "title": "The Swapper — Steam game description",
  "url": "https://store.steampowered.com/app/231160/"
}

Steam developer description; consciousness transfer is a fictional premise, not a claim about physical possibility or actual machine sentience.

Steam developer description; consciousness transfer is a fictional premise, not a claim about physical possibility or actual machine sentience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2013
}

Opus Magnum

Opus Magnum asks players to arrange programmable arms, tracks and other components into machines performing fictional alchemical transformations.

Solutions can be compared for simplicity, speed and compactness, making several objectives available even after a puzzle has been solved.

A puzzle editor and shared creations turn those alternative designs into objects that players can test and exchange.

Sources and details

Opus Magnum — Steam game description

{
  "access_scope": "Steam developer description; alchemy is fictional and the optimization criteria are game objectives, not real chemical-production metrics.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:19.107133+00:00"
  },
  "id": "work-coverage-92ddb7ccc21a7b::S1",
  "title": "Opus Magnum — Steam game description",
  "url": "https://store.steampowered.com/app/558990/"
}

Steam developer description; alchemy is fictional and the optimization criteria are game objectives, not real chemical-production metrics.

Steam developer description; alchemy is fictional and the optimization criteria are game objectives, not real chemical-production metrics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

Tacoma

Tacoma reconstructs a station crew’s experience through three-dimensional recordings captured by its fictional surveillance system.

Players rewind and advance recordings while moving through the scenes, examining parallel conversations and actions from different positions.

Physical objects and digital communications provide additional evidence, making the narrative an investigation assembled across linked views.

Sources and details

Tacoma — Steam game description

{
  "access_scope": "Steam game description; the station, surveillance technology and recordings are fictional, with editorial relevance to evidence exploration rather than a documented design influence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:16.962924+00:00"
  },
  "id": "work-coverage-94e1674a3c93dc::S1",
  "title": "Tacoma — Steam game description",
  "url": "https://store.steampowered.com/app/343860/"
}

Steam game description; the station, surveillance technology and recordings are fictional, with editorial relevance to evidence exploration rather than a documented design influence.

Steam game description; the station, surveillance technology and recordings are fictional, with editorial relevance to evidence exploration rather than a documented design influence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

TIS-100

TIS-100 makes repairing corrupted programs a puzzle within a fictional computer made of connected processing nodes.

Players optimize cycle, instruction and node counts, so communication and resource use matter alongside producing the correct output.

A reference manual and sandboxes expose the invented architecture for investigation and for building new challenges.

Sources and details

TIS-100 — Steam game description

{
  "access_scope": "Steam developer description; the page explicitly identifies TIS-100 as a game. Its fictional computer and advertised applications are not claims of an operating commercial architecture.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:17.519130+00:00"
  },
  "id": "work-coverage-c1d7039bfb670e::S1",
  "title": "TIS-100 — Steam game description",
  "url": "https://store.steampowered.com/app/370360/"
}

Steam developer description; the page explicitly identifies TIS-100 as a game. Its fictional computer and advertised applications are not claims of an operating commercial architecture.

Steam developer description; the page explicitly identifies TIS-100 as a game. Its fictional computer and advertised applications are not claims of an operating commercial architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

AI4Science to empower the fifth paradigm of scientific discovery

Bishop describes a scientific emulator that learns from expensive numerical simulations and then performs further calculations more efficiently.

The training data therefore comes from solving scientific equations, rather than only from collecting observations of the world.

He presents the speed–accuracy trade-off as an opportunity for scientific discovery while acknowledging that robust, general-purpose emulators remain a research goal.

Sources and details

AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research

{
  "access_scope": "Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities.",
  "authors": [
    "Christopher Bishop"
  ],
  "authors_in_source_order": [
    "Christopher Bishop"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:35.576912+00:00"
  },
  "id": "work-coverage-3b7651d1b77fd1::S1",
  "title": "AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research",
  "url": "https://www.microsoft.com/en-us/research/blog/ai4science-to-empower-the-fifth-paradigm-of-scientific-discovery/"
}

Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities.

Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "July 7, 2022; source edit note October 20, 2023.",
  "dated": true,
  "year": 2022
}

OPS-SAT flying laboratory

OPS-SAT provided an orbital experiment service that connected outside research teams with ESA mission control.

Experiments could build on earlier improvements: a better way to operate the camera could become an input to a later image-processing experiment.

ESA describes ground rehearsals, assistance to experimenters and safe execution in orbit as part of the service, making access and coordination central to the laboratory model.

Sources and details

ESA - Mission complete for ESA’s OPS-SAT flying laboratory

{
  "access_scope": "ESA’s mission-completion account after the May 22–23, 2024 reentry; reported experiments and reuse are mission-owner statements, not an independent audit or a claim that the retired satellite still operates.",
  "authors": [
    "European Space Agency"
  ],
  "authors_in_source_order": [
    "European Space Agency"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:58.284075+00:00"
  },
  "id": "work-coverage-4635e959e98630::S1",
  "title": "ESA - Mission complete for ESA’s OPS-SAT flying laboratory",
  "url": "https://www.esa.int/Enabling_Support/Operations/Mission_complete_for_ESA_s_OPS-SAT_flying_laboratory?rand=771654"
}

ESA’s mission-completion account after the May 22–23, 2024 reentry; reported experiments and reuse are mission-owner statements, not an independent audit or a claim that the retired satellite still operates.

ESA’s mission-completion account after the May 22–23, 2024 reentry; reported experiments and reuse are mission-owner statements, not an independent audit or a claim that the retired satellite still operates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-05-23"
}

A tool to verify estimates, II: a flexible proof assistant

Tao’s prototype lets a person direct a proof with high-level tactics while the tool performs symbolic calculations.

The assistant runs through an interactive Python interface and uses SymPy, with some design choices modeled on Lean.

His examples include splitting a goal into subgoals and applying linear arithmetic, showing how a proof can be broken into steps that the user directs and the machine checks.

Sources and details

A tool to verify estimates, II: a flexible proof assistant

{
  "access_scope": "Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.",
  "authors": [
    "Terence Tao"
  ],
  "authors_in_source_order": [
    "Terence Tao"
  ],
  "dates": {
    "published": "2025-05-09",
    "retrieved_utc": "2026-10-07T18:13:28.268099+00:00"
  },
  "id": "work-coverage-5150d68ff2b12c::S1",
  "title": "A tool to verify estimates, II: a flexible proof assistant",
  "url": "https://terrytao.wordpress.com/2025/05/09/a-tool-to-verify-estimates-ii-a-flexible-proof-assistant/"
}

Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.

Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2025
}

Axiom Orbital Data Centers

Axiom and Spacebilt describe a planned orbital computing node whose storage, control hardware and optical communications come from different collaborating suppliers.

Optical terminals would connect the node to compatible spacecraft, while the onboard controller would route communications and manage servers.

The plan combines computing capacity with a network of interoperable nodes, so connectivity is part of the proposed infrastructure rather than an accessory to placing servers in orbit.

Sources and details

Axiom Space, Spacebilt Announce Orbital Data Center Node Aboard International Space Station

{
  "access_scope": "Axiom Space’s September 16, 2025 announcement for a node planned aboard the ISS in 2027; component roles and projected services are company statements, not evidence that the future node or planned network has been delivered.",
  "authors": [
    "Axiom Space"
  ],
  "authors_in_source_order": [
    "Axiom Space"
  ],
  "dates": {
    "published": "2025-09-16",
    "retrieved_utc": "2026-10-07T18:10:51.282188+00:00"
  },
  "id": "work-coverage-6707e327902d76::S1",
  "title": "Axiom Space, Spacebilt Announce Orbital Data Center Node Aboard International Space Station",
  "url": "https://axiomspace.com/release/axiom-space-spacebilt-announce-orbital-data-center-node"
}

Axiom Space’s September 16, 2025 announcement for a node planned aboard the ISS in 2027; component roles and projected services are company statements, not evidence that the future node or planned network has been delivered.

Axiom Space’s September 16, 2025 announcement for a node planned aboard the ISS in 2027; component roles and projected services are company statements, not evidence that the future node or planned network has been delivered.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-01-11"
}

Cramming more components onto integrated circuits

Moore’s essay links greater circuit integration to the cost of each component, rather than presenting transistor count as an isolated engineering target.

Adding components initially spreads package costs, but declining manufacturing yields can eventually raise cost per component; the economic optimum moves as the technology improves.

He extrapolates the historical growth of complexity at minimum component cost, making the familiar doubling argument a dated industrial projection.

Sources and details

Cramming More Components onto Integrated Circuits

{
  "access_scope": "Costs and Curves section of the April 19, 1965 Electronics essay, inspected in its January 1998 Proceedings of the IEEE reprint; historical projections are not a physical law or a current chip-economics forecast.",
  "authors": [
    "Gordon E. Moore"
  ],
  "authors_in_source_order": [
    "Gordon E. Moore"
  ],
  "dates": {
    "inspected_reprint": "1998-01",
    "original_essay": "1965-04-19",
    "retrieved_utc": "2026-10-07T18:19:23.298407+00:00"
  },
  "id": "work-coverage-9cc72dbe37b70b::S1",
  "title": "Cramming More Components onto Integrated Circuits",
  "url": "https://www.cs.cmu.edu/~18742/papers/Moore1965.pdf"
}

Costs and Curves section of the April 19, 1965 Electronics essay, inspected in its January 1998 Proceedings of the IEEE reprint; historical projections are not a physical law or a current chip-economics forecast.

Costs and Curves section of the April 19, 1965 Electronics essay, inspected in its January 1998 Proceedings of the IEEE reprint; historical projections are not a physical law or a current chip-economics forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "1965-04-19"
}

Machine-Assisted Proof

Tao distinguishes gathering mathematical data, performing symbolic calculations and producing machine-checkable logical deductions.

He notes that numerical computations can suffer from rounding and instability, while more rigorous substitutes may require additional time or memory.

SAT and SMT solvers illustrate another route: deductions from restricted hypotheses can be accompanied by proof certificates, although computational complexity limits their scale.

Sources and details

Machine assisted proof

{
  "access_scope": "Opening discussion of Tao’s Machine assisted proof draft dated February 10, 2024; the draft’s distinctions and examples were inspected, not the execution of its cited solvers or a final publication version.",
  "authors": [
    "Terence Tao"
  ],
  "authors_in_source_order": [
    "Terence Tao"
  ],
  "dates": {
    "inspected_draft": "2024-02-10",
    "retrieved_utc": "2026-10-07T18:24:21.292656+00:00"
  },
  "id": "work-coverage-9de1d854a45728::S1",
  "title": "Machine assisted proof",
  "url": "https://terrytao.wordpress.com/wp-content/uploads/2024/03/machine-assisted-proof-notices.pdf"
}

Opening discussion of Tao’s Machine assisted proof draft dated February 10, 2024; the draft’s distinctions and examples were inspected, not the execution of its cited solvers or a final publication version.

Opening discussion of Tao’s Machine assisted proof draft dated February 10, 2024; the draft’s distinctions and examples were inspected, not the execution of its cited solvers or a final publication version.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2025
}

Project Suncatcher

The Suncatcher update describes an orbital prototype intended to gather evidence about TPU behavior under spaceflight, radiation and thermal stresses.

Google frames the mission as an experiment in whether space could eventually support scalable machine-learning infrastructure, with measurements intended to inform later designs.

Sources and details

Our Project Suncatcher prototype satellite is in orbit.

{
  "access_scope": "Travis Beals’s Google Research update dated October 1, 2026, reporting launch and contact; this later prototype announcement is distinct from the original proposal, and it does not establish a scalable operating orbital AI data center or independently verified mission performance.",
  "authors": [
    "Travis Beals"
  ],
  "authors_in_source_order": [
    "Travis Beals"
  ],
  "dates": {
    "published": "2026-10-01",
    "retrieved_utc": "2026-10-07T18:17:04.397608+00:00"
  },
  "id": "work-coverage-9e4d0dd3f0e888::S1",
  "title": "Our Project Suncatcher prototype satellite is in orbit.",
  "url": "https://blog.google/innovation-and-ai/models-and-research/google-research/project-suncatcher-prototype/"
}

Travis Beals’s Google Research update dated October 1, 2026, reporting launch and contact; this later prototype announcement is distinct from the original proposal, and it does not establish a scalable operating orbital AI data center or independently verified mission performance.

Travis Beals’s Google Research update dated October 1, 2026, reporting launch and contact; this later prototype announcement is distinct from the original proposal, and it does not establish a scalable operating orbital AI data center or independently verified mission performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-10-01"
}

OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies

Microsoft’s 2019 announcement couples an investment with plans to build Azure AI supercomputing technology jointly with OpenAI.

OpenAI would move its services to Azure, while Microsoft would become its preferred partner for commercializing new AI technologies.

The agreement connects infrastructure, model development and commercialization, making the computing platform part of an organizational relationship as well as a technical project.

Sources and details

OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source

{
  "access_scope": "Microsoft’s July 22, 2019 press release; announced plans and partnership terms are historical company statements, not evidence of achieved AGI or the partnership’s current terms.",
  "authors": [
    "Microsoft"
  ],
  "authors_in_source_order": [
    "Microsoft"
  ],
  "dates": {
    "published": "2019-07-22",
    "retrieved_utc": "2026-10-07T18:14:47.774793+00:00"
  },
  "id": "work-final-64112c1053a7a1::S1",
  "title": "OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source",
  "url": "https://news.microsoft.com/source/2019/07/22/openai-forms-exclusive-computing-partnership-with-microsoft-to-build-new-azure-ai-supercomputing-technologies/"
}

Microsoft’s July 22, 2019 press release; announced plans and partnership terms are historical company statements, not evidence of achieved AGI or the partnership’s current terms.

Microsoft’s July 22, 2019 press release; announced plans and partnership terms are historical company statements, not evidence of achieved AGI or the partnership’s current terms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 2019-07-22.",
  "dated": true,
  "year": "2019-07-22"
}

NetHack

The NetHack Learning Environment uses a procedurally generated roguelike game to combine complex decisions with fast collection of reinforcement-learning experience.

The paper proposes tasks involving exploration, planning and skill acquisition, and tests a deep-learning baseline with an exploration method in the game’s early stages.

Randomness and varied generated worlds make robustness and generalization part of the research problem, rather than only success on a fixed sequence.

Sources and details

The NetHack Learning Environment

{
  "access_scope": "Abstract of The NetHack Learning Environment, arXiv v2 dated December 1, 2020; describes the game’s research adaptation, not original game authorship, completion of the full game or general-purpose intelligence.",
  "authors": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "authors_in_source_order": [
    "Küttler, Heinrich",
    "Nardelli, Nantas",
    "Miller, Alexander H.",
    "Raileanu, Roberta",
    "Selvatici, Marco",
    "Grefenstette, Edward",
    "Rocktäschel, Tim"
  ],
  "dates": {
    "citation_date": "2020/06/24",
    "inspected_revision": "Tue, 1 Dec 2020 11:05:57 UTC (5,156 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.014061+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-55bc784758fd2d::S1",
  "title": "The NetHack Learning Environment",
  "url": "https://arxiv.org/abs/2006.13760",
  "version_url": "https://arxiv.org/abs/2006.13760v2"
}

Abstract of The NetHack Learning Environment, arXiv v2 dated December 1, 2020; describes the game’s research adaptation, not original game authorship, completion of the full game or general-purpose intelligence.

Abstract of The NetHack Learning Environment, arXiv v2 dated December 1, 2020; describes the game’s research adaptation, not original game authorship, completion of the full game or general-purpose intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1987
}

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

The DeepONet repository supplies a worked antiderivative example that generates training and test data before training an operator network.

Separate demonstrations cover stochastic differential equations and fractional derivatives, exposing data preparation and evaluation as parts of the workflow.

Its installation notes bind the original examples to a particular DeepXDE version and warn that later versions require changes, showing why a reusable research method still depends on software compatibility.

Sources and details

DeepONet: Learning nonlinear operators — repository README

{
  "access_scope": "Author-associated DeepONet repository README and demonstration instructions, referencing the five-author 2021 Nature Machine Intelligence paper; the paper’s theorem was not inspected, and the supplied code and logged results were not rerun.",
  "authors": [
    "L. Lu",
    "P. Jin",
    "G. Pang",
    "Z. Zhang",
    "G. E. Karniadakis"
  ],
  "authors_in_source_order": [
    "L. Lu",
    "P. Jin",
    "G. Pang",
    "Z. Zhang",
    "G. E. Karniadakis"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:03.187609+00:00"
  },
  "id": "work-coverage-809f14d98fe245::S1",
  "title": "DeepONet: Learning nonlinear operators — repository README",
  "url": "https://github.com/lululxvi/deeponet"
}

Author-associated DeepONet repository README and demonstration instructions, referencing the five-author 2021 Nature Machine Intelligence paper; the paper’s theorem was not inspected, and the supplied code and logged results were not rerun.

Author-associated DeepONet repository README and demonstration instructions, referencing the five-author 2021 Nature Machine Intelligence paper; the paper’s theorem was not inspected, and the supplied code and logged results were not rerun.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2021",
  "dated": true,
  "year": 2021
}

Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions

Dennard and colleagues study how a conventional MOSFET can be reduced in size while redesigning its doping profile and shallow source and drain regions.

They use one- and two-dimensional models to predict threshold behavior and short-channel effects, then compare fabricated device measurements with predictions.

The abstract distinguishes measured small-device characteristics from projected improvements in integrated-circuit performance.

Sources and details

Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions

{
  "access_scope": "IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.",
  "authors": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "authors_in_source_order": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "dates": {
    "citation_publication_date": "1974/01/01",
    "retrieved_utc": "2026-10-07T18:19:20.395090+00:00"
  },
  "id": "work-coverage-846bce80b0c6e6::S1",
  "title": "Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions",
  "url": "https://research.ibm.com/publications/design-of-ion-implanted-mosfets-with-very-small-physical-dimensions"
}

IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.

IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "1974"
}

Deep Blue

The Deep Blue paper attributes its chess performance to coordinated search hardware, parallel computation, search extensions and a complex evaluation function.

It also identifies use of a grandmaster game database, connecting engineered computation with stored expert play.

The abstract presents these as design choices behind the machine’s 1997 match, rather than a learning system developed without chess-specific knowledge.

Sources and details

Deep Blue

{
  "access_scope": "IBM Research abstract of the Campbell, Hoane and Hsu paper; the 1997 match and IBM’s January 2002 article metadata are distinct, and the full system implementation was not inspected.",
  "authors": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "authors_in_source_order": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "dates": {
    "citation_publication_date": "2002/01/01",
    "retrieved_utc": "2026-10-07T18:12:53.467757+00:00"
  },
  "id": "work-coverage-8774a91384f99a::S1",
  "title": "Deep Blue",
  "url": "https://research.ibm.com/publications/deep-blue"
}

IBM Research abstract of the Campbell, Hoane and Hsu paper; the 1997 match and IBM’s January 2002 article metadata are distinct, and the full system implementation was not inspected.

IBM Research abstract of the Campbell, Hoane and Hsu paper; the 1997 match and IBM’s January 2002 article metadata are distinct, and the full system implementation was not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Technical paper published 2002; famous match occurred in 1997.",
  "dated": true,
  "year": 2002
}

Dota 2

The OpenAI Five paper treats Dota 2 as a setting with long time horizons, incomplete information and a complex space of actions and states.

Its approach scales established reinforcement-learning techniques through distributed training and tools that allow learning to continue over many months.

Self-play supplies the competitive experience used to develop the system evaluated against Team OG.

Sources and details

Dota 2 with Large Scale Deep Reinforcement Learning

{
  "access_scope": "Dota 2 with Large Scale Deep Reinforcement Learning, December 2019 arXiv v1 abstract; the research team is distinct from the game’s creators, and the reported match does not establish mastery of every possible game condition or general strategic intelligence.",
  "authors": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "authors_in_source_order": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "dates": {
    "citation_date": "2019/12/13",
    "inspected_revision": "Fri, 13 Dec 2019 19:56:40 UTC (8,625 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.482612+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-af4a79ce73dc47::S1",
  "title": "Dota 2 with Large Scale Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1912.06680",
  "version_url": "https://arxiv.org/abs/1912.06680v1"
}

Dota 2 with Large Scale Deep Reinforcement Learning, December 2019 arXiv v1 abstract; the research team is distinct from the game’s creators, and the reported match does not establish mastery of every possible game condition or general strategic intelligence.

Dota 2 with Large Scale Deep Reinforcement Learning, December 2019 arXiv v1 abstract; the research team is distinct from the game’s creators, and the reported match does not establish mastery of every possible game condition or general strategic intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2013
}

Minecraft

MineDojo combines a Minecraft task environment with videos, tutorials, wiki pages and forum discussions as a knowledge base for agents.

The proposed learning method uses pretrained video–language models to supply a learned reward function for tasks described in ordinary language.

Its design joins varied tasks, external knowledge and an agent architecture to investigate learning beyond a small set of manually specified objectives.

Sources and details

MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge

{
  "access_scope": "MineDojo abstract, arXiv v2 dated November 22, 2022; describes a research framework built on Minecraft, not original game authorship or demonstrated generally capable real-world agents.",
  "authors": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Fan, Linxi",
    "Wang, Guanzhi",
    "Jiang, Yunfan",
    "Mandlekar, Ajay",
    "Yang, Yuncong",
    "Zhu, Haoyi",
    "Tang, Andrew",
    "Huang, De-An",
    "Zhu, Yuke",
    "Anandkumar, Anima"
  ],
  "dates": {
    "citation_date": "2022/06/17",
    "inspected_revision": "Tue, 22 Nov 2022 07:59:47 UTC (9,526 KB)",
    "retrieved_utc": "2026-10-07T18:17:58.531726+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-b4c315e516fabe::S1",
  "title": "MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge",
  "url": "https://arxiv.org/abs/2206.08853",
  "version_url": "https://arxiv.org/abs/2206.08853v2"
}

MineDojo abstract, arXiv v2 dated November 22, 2022; describes a research framework built on Minecraft, not original game authorship or demonstrated generally capable real-world agents.

MineDojo abstract, arXiv v2 dated November 22, 2022; describes a research framework built on Minecraft, not original game authorship or demonstrated generally capable real-world agents.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2009
}

Energy and Policy Considerations for Deep Learning in NLP

Strubell, Ganesh and McCallum connect gains in NLP accuracy with the computing and energy resources needed to develop large models.

Their paper estimates financial and environmental training costs for selected models and uses those estimates to motivate changes intended to reduce costs and improve research equity.

Sources and details

Energy and Policy Considerations for Deep Learning in NLP

{
  "access_scope": "ACL 2019 abstract and exact citation metadata; estimates concern the models and assumptions of that study, not current emissions, all AI systems or a reproduced audit of its numerical calculations.",
  "authors": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "authors_in_source_order": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "dates": {
    "citation_publication_date": "2019/7",
    "retrieved_utc": "2026-10-07T18:14:33.537484+00:00"
  },
  "id": "work-coverage-c053f27a8c6617::S1",
  "title": "Energy and Policy Considerations for Deep Learning in NLP",
  "url": "https://aclanthology.org/P19-1355/"
}

ACL 2019 abstract and exact citation metadata; estimates concern the models and assumptions of that study, not current emissions, all AI systems or a reproduced audit of its numerical calculations.

ACL 2019 abstract and exact citation metadata; estimates concern the models and assumptions of that study, not current emissions, all AI systems or a reproduced audit of its numerical calculations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2019"
}

Foldit

Foldit gives players direct manipulation tools and accessible versions of Rosetta algorithms to search for lower-energy protein structures.

Players compete and collaborate, combining visual judgments with computational moves rather than only supplying labels to a machine-learning dataset.

The paper reports that players also develop strategies for searching, making the organization of problem-solving part of the experiment alongside the protein configurations themselves.

Sources and details

Predicting protein structures with a multiplayer online game

{
  "access_scope": "Opening summary of Predicting protein structures with a multiplayer online game, Nature dated August 5, 2010; the filename’s 2011 is not used as publication date. Reported structure-refinement tasks do not establish universal biological accuracy or clinical outcomes.",
  "authors": [
    "Seth Cooper",
    "Firas Khatib",
    "Adrien Treuille",
    "Janos Barbero",
    "Jeehyung Lee",
    "Michael Beenen",
    "Andrew Leaver-Fay",
    "David Baker",
    "Zoran Popović",
    "Foldit players"
  ],
  "authors_in_source_order": [
    "Seth Cooper",
    "Firas Khatib",
    "Adrien Treuille",
    "Janos Barbero",
    "Jeehyung Lee",
    "Michael Beenen",
    "Andrew Leaver-Fay",
    "David Baker",
    "Zoran Popović",
    "Foldit players"
  ],
  "dates": {
    "published": "2010-08-05",
    "retrieved_utc": "2026-10-07T18:13:17.858685+00:00"
  },
  "id": "work-coverage-d7cac16ff56d10::S1",
  "title": "Predicting protein structures with a multiplayer online game",
  "url": "https://grail.cs.washington.edu/wp-content/uploads/2015/08/cooper-2011-pps.pdf"
}

Opening summary of Predicting protein structures with a multiplayer online game, Nature dated August 5, 2010; the filename’s 2011 is not used as publication date. Reported structure-refinement tasks do not establish universal biological accuracy or clinical outcomes.

Opening summary of Predicting protein structures with a multiplayer online game, Nature dated August 5, 2010; the filename’s 2011 is not used as publication date. Reported structure-refinement tasks do not establish universal biological accuracy or clinical outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Paper published 2010; distinguish from the game’s 2008 launch.",
  "dated": true,
  "year": 2008
}

The Sims

The Sims documentation describes objects whose behaviors advertise which needs they can satisfy.

A Sim outside direct player control selects from available behaviors according to current happiness, then runs the selected object’s procedure in the Sim’s own thread.

The Edith virtual machine and visual editing environment let creators extend the simulation by adding objects and behaviors, with interpreted execution supporting inspection while it runs.

Sources and details

Some notes on programming objects in The Sims

{
  "access_scope": "Kenneth D. Forbus and Will Wright’s Some notes on programming objects in The Sims, version May 31, 2001, introduction and under-the-hood section; describes this historical implementation, not every later Sims release or autonomous learning.",
  "authors": [
    "Kenneth D. Forbus",
    "Will Wright"
  ],
  "authors_in_source_order": [
    "Kenneth D. Forbus",
    "Will Wright"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:32.274780+00:00",
    "version": "2001-05-31"
  },
  "id": "work-coverage-e516328daa1064::S1",
  "title": "Some notes on programming objects in The Sims",
  "url": "https://www.qrg.northwestern.edu/papers/Files/Programming_Objects_in_The_Sims.pdf"
}

Kenneth D. Forbus and Will Wright’s Some notes on programming objects in The Sims, version May 31, 2001, introduction and under-the-hood section; describes this historical implementation, not every later Sims release or autonomous learning.

Kenneth D. Forbus and Will Wright’s Some notes on programming objects in The Sims, version May 31, 2001, introduction and under-the-hood section; describes this historical implementation, not every later Sims release or autonomous learning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2000
}

Neural general circulation models for weather and climate

NeuralGCM combines a differentiable solver for atmospheric dynamics with learned components, retaining a physical simulation within the model.

The paper evaluates deterministic and ensemble weather forecasts as well as climate behavior over longer periods.

Its abstract explicitly says the model does not extrapolate to substantially different future climates, limiting what its historical-climate performance can support.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.",
  "authors": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "authors_in_source_order": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "dates": {
    "citation_publication_date": "2024/08",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00"
  },
  "id": "work-coverage-eea337da878fd3::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

Magnetic control of tokamak plasmas through deep reinforcement learning

The tokamak study trains a reinforcement-learning controller to command magnetic coils that regulate plasma position, current and shape.

High-level targets are combined with physical and operational constraints, allowing the architecture to address different plasma configurations.

The authors report experimental control on TCV, connecting learned decisions to a fast feedback loop in a physical machine.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.",
  "authors": [
    "Degrave, Jonas",
    "Felici, Federico",
    "Buchli, Jonas",
    "Neunert, Michael",
    "Tracey, Brendan",
    "Carpanese, Francesco",
    "Ewalds, Timo",
    "Hafner, Roland",
    "Abdolmaleki, Abbas",
    "de las Casas, Diego",
    "Donner, Craig",
    "Fritz, Leslie",
    "Galperti, Cristian",
    "Huber, Andrea",
    "Keeling, James",
    "Tsimpoukelli, Maria",
    "Kay, Jackie",
    "Merle, Antoine",
    "Moret, Jean-Marc",
    "Noury, Seb",
    "Pesamosca, Federico",
    "Pfau, David",
    "Sauter, Olivier",
    "Sommariva, Cristian",
    "Coda, Stefano",
    "Duval, Basil",
    "Fasoli, Ambrogio",
    "Kohli, Pushmeet",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Degrave, Jonas",
    "Felici, Federico",
    "Buchli, Jonas",
    "Neunert, Michael",
    "Tracey, Brendan",
    "Carpanese, Francesco",
    "Ewalds, Timo",
    "Hafner, Roland",
    "Abdolmaleki, Abbas",
    "de las Casas, Diego",
    "Donner, Craig",
    "Fritz, Leslie",
    "Galperti, Cristian",
    "Huber, Andrea",
    "Keeling, James",
    "Tsimpoukelli, Maria",
    "Kay, Jackie",
    "Merle, Antoine",
    "Moret, Jean-Marc",
    "Noury, Seb",
    "Pesamosca, Federico",
    "Pfau, David",
    "Sauter, Olivier",
    "Sommariva, Cristian",
    "Coda, Stefano",
    "Duval, Basil",
    "Fasoli, Ambrogio",
    "Kohli, Pushmeet",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis",
    "Riedmiller, Martin"
  ],
  "dates": {
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "work-coverage-eeb2997a850e79::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.

Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2022",
  "dated": true,
  "year": 2022
}

OpenAI Hide-and-Seek

The hide-and-seek study uses opposing teams to generate changing pressures for learning within one simulated environment.

Agents that build shelters with boxes create a challenge that opposing agents can answer by using ramps, producing an evolving sequence of strategies.

The authors describe this competition as an autocurriculum that can encourage tool use and coordination without specifying each intermediate strategy as a separate task.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Emergent Tool Use From Multi-Agent Autocurricula, arXiv v2 dated February 11, 2020, abstract; emergent strategies are reported for its constructed environment and do not establish unrestricted real-world tool competence.",
  "authors": [
    "Baker, Bowen",
    "Kanitscheider, Ingmar",
    "Markov, Todor",
    "Wu, Yi",
    "Powell, Glenn",
    "McGrew, Bob",
    "Mordatch, Igor"
  ],
  "authors_in_source_order": [
    "Baker, Bowen",
    "Kanitscheider, Ingmar",
    "Markov, Todor",
    "Wu, Yi",
    "Powell, Glenn",
    "McGrew, Bob",
    "Mordatch, Igor"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-f17fdba4991147::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Emergent Tool Use From Multi-Agent Autocurricula, arXiv v2 dated February 11, 2020, abstract; emergent strategies are reported for its constructed environment and do not establish unrestricted real-world tool competence.

Emergent Tool Use From Multi-Agent Autocurricula, arXiv v2 dated February 11, 2020, abstract; emergent strategies are reported for its constructed environment and do not establish unrestricted real-world tool competence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Initial public report and arXiv submission September 2019; revised 2020.",
  "dated": true,
  "year": 2019
}

The missing memristor found

The memristor paper models electrical behavior in nanoscale devices by coupling electronic transport with the movement of ions under an applied voltage.

That coupling offers an account of history-dependent current–voltage behavior, including behavior in certain titanium-dioxide switches.

Sources and details

The missing memristor found

{
  "access_scope": "Nature abstract of The missing memristor found, May 2008 issue metadata; only the accessible abstract was inspected, and its physical model is not a claim of commercial deployment or a resolution of later debates about terminology.",
  "authors": [
    "Strukov, Dmitri B.",
    "Snider, Gregory S.",
    "Stewart, Duncan R.",
    "Williams, R. Stanley"
  ],
  "authors_in_source_order": [
    "Strukov, Dmitri B.",
    "Snider, Gregory S.",
    "Stewart, Duncan R.",
    "Williams, R. Stanley"
  ],
  "dates": {
    "citation_publication_date": "2008/05",
    "retrieved_utc": "2026-10-07T18:13:36.671071+00:00"
  },
  "id": "work-coverage-f9b7ebd176cede::S1",
  "title": "The missing memristor found",
  "url": "https://www.nature.com/articles/nature06932"
}

Nature abstract of The missing memristor found, May 2008 issue metadata; only the accessible abstract was inspected, and its physical model is not a claim of commercial deployment or a resolution of later debates about terminology.

Nature abstract of The missing memristor found, May 2008 issue metadata; only the accessible abstract was inspected, and its physical model is not a claim of commercial deployment or a resolution of later debates about terminology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2008-05-01"
}

ImageNet Classification with Deep Convolutional Neural Networks

The ImageNet classification paper joins a deep convolutional network with a GPU implementation designed to make its large training problem tractable.

Non-saturating neurons help training speed, while dropout addresses overfitting in the fully connected layers.

The abstract distinguishes its original evaluation from the variant entered in the 2012 competition, keeping architecture and benchmark results tied to their reported tests.

Sources and details

ImageNet Classification with Deep Convolutional Neural Networks

{
  "access_scope": "Opening abstract of the three-author 2012 ImageNet paper; model variants and contest-specific results remain distinct, without inferring universal visual understanding or rerunning the experiments.",
  "authors": [
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Geoffrey E. Hinton"
  ],
  "authors_in_source_order": [
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Geoffrey E. Hinton"
  ],
  "dates": {
    "paper_year": "2012",
    "retrieved_utc": "2026-10-07T18:02:10.384407+00:00"
  },
  "id": "work-d33fcf6f5dea::S1",
  "title": "ImageNet Classification with Deep Convolutional Neural Networks",
  "url": "https://papers.nips.cc/paper_files/paper/2012/file/c399862d3b9d6b76c8436e924a68c45b-Paper.pdf"
}

Opening abstract of the three-author 2012 ImageNet paper; model variants and contest-specific results remain distinct, without inferring universal visual understanding or rerunning the experiments.

Opening abstract of the three-author 2012 ImageNet paper; model variants and contest-specific results remain distinct, without inferring universal visual understanding or rerunning the experiments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2012 AlexNet; ImageNet dataset paper appeared in 2009.",
  "dated": true,
  "year": 2012
}

Generative Adversarial Nets

The GAN preprint trains a generator alongside a discriminator that tries to distinguish generated samples from training data.

The generator improves by making the discriminator more likely to misclassify its samples, forming an adversarial training objective.

The abstract separates an ideal solution in an unrestricted function space from neural-network implementations trained with backpropagation.

Sources and details

Generative Adversarial Networks

{
  "access_scope": "Generative Adversarial Networks, June 2014 arXiv v1 abstract, linked to the canonical Generative Adversarial Nets label; the theoretical solution is not a guarantee that finite-network training converges or that generated samples are truthful.",
  "authors": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Goodfellow, Ian J.",
    "Pouget-Abadie, Jean",
    "Mirza, Mehdi",
    "Xu, Bing",
    "Warde-Farley, David",
    "Ozair, Sherjil",
    "Courville, Aaron",
    "Bengio, Yoshua"
  ],
  "dates": {
    "citation_date": "2014/06/10",
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "id": "work-e46a03524fc1::S1",
  "title": "Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

Generative Adversarial Networks, June 2014 arXiv v1 abstract, linked to the canonical Generative Adversarial Nets label; the theoretical solution is not a guarantee that finite-network training converges or that generated samples are truthful.

Generative Adversarial Networks, June 2014 arXiv v1 abstract, linked to the canonical Generative Adversarial Nets label; the theoretical solution is not a guarantee that finite-network training converges or that generated samples are truthful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2014 GANs; diffusion work provides a different generative branch.",
  "dated": true,
  "year": 2014
}

Principles for Responsible AI Consciousness Research

Butlin and Lappas argue that organizations developing advanced AI need policies for the possibility of consciousness, even if they do not study it deliberately.

Their proposal connects research objectives and procedures with knowledge sharing and public communication.

They recommend voluntary public commitments, treating uncertainty about consciousness and possible suffering as reasons to establish a research policy.

Sources and details

Principles for Responsible AI Consciousness Research

{
  "access_scope": "Principles for Responsible AI Consciousness Research, January 2025 arXiv v1 abstract; normative proposals and possibilities are attributed to the authors, not evidence that any existing AI is conscious or legally entitled to a particular status.",
  "authors": [
    "Butlin, Patrick",
    "Lappas, Theodoros"
  ],
  "authors_in_source_order": [
    "Butlin, Patrick",
    "Lappas, Theodoros"
  ],
  "dates": {
    "citation_date": "2025/01/13",
    "inspected_revision": "Mon, 13 Jan 2025 12:59:53 UTC (299 KB)",
    "retrieved_utc": "2026-10-07T18:18:45.279449+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-135864a359fa3b::S1",
  "title": "Principles for Responsible AI Consciousness Research",
  "url": "https://arxiv.org/abs/2501.07290",
  "version_url": "https://arxiv.org/abs/2501.07290v1"
}

Principles for Responsible AI Consciousness Research, January 2025 arXiv v1 abstract; normative proposals and possibilities are attributed to the authors, not evidence that any existing AI is conscious or legally entitled to a particular status.

Principles for Responsible AI Consciousness Research, January 2025 arXiv v1 abstract; normative proposals and possibilities are attributed to the authors, not evidence that any existing AI is conscious or legally entitled to a particular status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-09",
      "kind": "submitted",
      "year": 2024
    },
    {
      "date": "2025-01-13",
      "kind": "arxiv_first_posted",
      "year": 2025
    },
    {
      "date": "2025-03-25",
      "kind": "published",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-09"
}

System Shock

Neurath recalls that System Shock expanded open-ended play and used a physics model to support interactions the designers could not fully anticipate.

Because interactive dialogue was difficult to reconcile with that world, the team placed much of the story in logs left by characters who had already died.

The player therefore reconstructs the narrative through exploration, linking the freedom to move through the environment with the way its history is discovered.

Sources and details

Interview with Paul Neurath

{
  "access_scope": "Paul Neurath’s retrospective interview published by Nightdive on August 9, 2015, System Shock discussion; development recollections are attributed and not treated as independently verified priority or influence claims.",
  "authors": [
    "Nightdive"
  ],
  "authors_in_source_order": [
    "Nightdive"
  ],
  "dates": {
    "published": "2015-08-09",
    "retrieved_utc": "2026-10-07T18:24:02.662527+00:00"
  },
  "id": "work-coverage-5868d083262d29::S1",
  "title": "Interview with Paul Neurath",
  "url": "https://nightdivestudios.com/interview-paul-neurath/"
}

Paul Neurath’s retrospective interview published by Nightdive on August 9, 2015, System Shock discussion; development recollections are attributed and not treated as independently verified priority or influence claims.

Paul Neurath’s retrospective interview published by Nightdive on August 9, 2015, System Shock discussion; development recollections are attributed and not treated as independently verified priority or influence claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1994 original. The 2015 Enhanced Edition and 2023 remake are different releases. The current Steam Enhanced Edition lists Nightdive alongside Looking Glass; that does not make Nightdive an original 1994 developer.",
  "dated": true,
  "year": 1994
}

Quake III Arena

Quake III Arena pairs competitive arena combat with an offline mode populated by AI-controlled bots.

Its game description distinguishes individual contests from team modes such as capture the flag, while the Team Arena expansion adds further cooperative objectives.

Sources and details

Quake III Arena — Steam game description

{
  "access_scope": "Steam game description, including the bundled Team Arena expansion; describes player-facing modes, not bot architecture, training methods or a measured intelligence result.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:04.551083+00:00"
  },
  "id": "work-coverage-5dd6a28ee7465e::S1",
  "title": "Quake III Arena — Steam game description",
  "url": "https://store.steampowered.com/app/2200/"
}

Steam game description, including the bundled Team Arena expansion; describes player-facing modes, not bot architecture, training methods or a measured intelligence result.

Steam game description, including the bundled Team Arena expansion; describes player-facing modes, not bot architecture, training methods or a measured intelligence result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1999
}

The Cyberiad

Lem’s website introduces The Cyberiad through tales in which exceptional engineering takes the place of magic.

The introduction places those inventions among familiar ambitions, greedy rulers and would-be reformers, suggesting that technical ingenuity does not by itself remove human moral conflict.

Sources and details

The Cyberiad — official website introduction

{
  "access_scope": "The Cyberiad introduction on Lem’s official website; the site’s interpretive summary is distinct from the complete stories and does not establish a documented influence on AI research.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:27.525983+00:00"
  },
  "id": "work-coverage-61b8abd1e600e1::S1",
  "title": "The Cyberiad — official website introduction",
  "url": "https://english.lem.pl/works/novels/eden/45-home/introductions/128-the-cyberiad"
}

The Cyberiad introduction on Lem’s official website; the site’s interpretive summary is distinct from the complete stories and does not establish a documented influence on AI research.

The Cyberiad introduction on Lem’s official website; the site’s interpretive summary is distinct from the complete stories and does not establish a documented influence on AI research.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Polish Cyberiada 1965; Michael Kandel English translation 1974.",
  "dated": true,
  "year": 1965
}

After Yang

After Yang begins with a father trying to repair his daughter’s malfunctioning android companion.

A24’s synopsis connects that search with his renewed awareness of family life and distance from his wife and daughter, placing machine repair inside a story about human relationships.

Sources and details

After Yang — A24 film synopsis

{
  "access_scope": "A24’s synopsis of the 2022 film; no further plot events, android memory mechanism or philosophical conclusion are inferred from this short description.",
  "authors": [
    "A24"
  ],
  "authors_in_source_order": [
    "A24"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:33.078078+00:00"
  },
  "id": "work-coverage-6915f1164d0ed7::S1",
  "title": "After Yang — A24 film synopsis",
  "url": "https://a24films.com/films/after-yang?trk=public_post_comment-text"
}

A24’s synopsis of the 2022 film; no further plot events, android memory mechanism or philosophical conclusion are inferred from this short description.

A24’s synopsis of the 2022 film; no further plot events, android memory mechanism or philosophical conclusion are inferred from this short description.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Cannes records 2021 production and Un Certain Regard selection. A24 lists 2022, the commercial release year: https://a24films.com/films/after-yang?trk=public_post_comment-text",
  "dated": true,
  "year": 2021
}

Tron: Legacy

Disney’s synopsis sends Sam toward a digital world after a signal appears at the arcade of his missing father, Kevin Flynn.

The journey connects a family search with conflict inside that cyber universe and assistance from Quorra.

Sources and details

TRON: Legacy — Disney film synopsis

{
  "access_scope": "Disney’s TRON: Legacy synopsis and December 17, 2010 release listing; the short synopsis does not establish particular AI architectures, simulation laws or the film’s complete plot.",
  "authors": [
    "Disney"
  ],
  "authors_in_source_order": [
    "Disney"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:21.248027+00:00"
  },
  "id": "work-coverage-70810a1c53e843::S1",
  "title": "TRON: Legacy — Disney film synopsis",
  "url": "https://movies.disney.com/tron-legacy"
}

Disney’s TRON: Legacy synopsis and December 17, 2010 release listing; the short synopsis does not establish particular AI architectures, simulation laws or the film’s complete plot.

Disney’s TRON: Legacy synopsis and December 17, 2010 release listing; the short synopsis does not establish particular AI architectures, simulation laws or the film’s complete plot.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original release is cataloged as 2010; source check retained from the prior cinema audit.",
  "dated": true,
  "year": 2010
}

Telling Lies

Telling Lies makes an archive of secretly recorded conversations the material of its investigation.

The player searches for spoken words, watches the matching clips and reconstructs connections among four people across two years.

The search interface gives the player control over the order of discovery rather than presenting the story as one fixed sequence.

Sources and details

Telling Lies — Steam game description

{
  "access_scope": "Steam’s Telling Lies game description; the NSA archive is a fictional premise, not a real data source or a claim about actual surveillance systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:07.889703+00:00"
  },
  "id": "work-coverage-7bd77e31dc2831::S1",
  "title": "Telling Lies — Steam game description",
  "url": "https://store.steampowered.com/app/762830/"
}

Steam’s Telling Lies game description; the NSA archive is a fictional premise, not a real data source or a claim about actual surveillance systems.

Steam’s Telling Lies game description; the NSA archive is a fictional premise, not a real data source or a claim about actual surveillance systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

Her Story

Her Story places the player at a computer containing police interview footage about a missing husband.

Keyword searches reveal clips from seven interviews, leaving the player to assemble a narrative from the retrieved fragments.

Listening and choosing new search terms become the means of investigation, so access to information shapes how the story unfolds.

Sources and details

Her Story — Steam game description

{
  "access_scope": "Steam’s Her Story game description; the 1994 interviews are fictional story dates, distinct from the game’s release, and no technical speech-recognition mechanism is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:06.173886+00:00"
  },
  "id": "work-coverage-7c0168a2d22f00::S1",
  "title": "Her Story — Steam game description",
  "url": "https://store.steampowered.com/app/368370/"
}

Steam’s Her Story game description; the 1994 interviews are fictional story dates, distinct from the game’s release, and no technical speech-recognition mechanism is inferred.

Steam’s Her Story game description; the 1994 interviews are fictional story dates, distinct from the game’s release, and no technical speech-recognition mechanism is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Return of the Obra Dinn

Return of the Obra Dinn casts the player as an insurance investigator sent to assess a merchant ship that has returned without a visible crew.

Exploration and logical deduction are the stated means of investigation, connecting reconstruction of the ship’s fate with an administrative assessment of loss.

Sources and details

Return of the Obra Dinn — Steam game description

{
  "access_scope": "Steam game description, including the fictional East India Company assignment; historical setting details are narrative premises, not independently checked maritime history or the game’s complete deduction system.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:07.115781+00:00"
  },
  "id": "work-coverage-7c7e522009e7bf::S1",
  "title": "Return of the Obra Dinn — Steam game description",
  "url": "https://store.steampowered.com/app/653530/"
}

Steam game description, including the fictional East India Company assignment; historical setting details are narrative premises, not independently checked maritime history or the game’s complete deduction system.

Steam game description, including the fictional East India Company assignment; historical setting details are narrative premises, not independently checked maritime history or the game’s complete deduction system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

NieR:Automata

NieR:Automata sets android soldiers against machines that have driven humanity from Earth.

Its companion Pods support combat and movement, and upgrades expand the attacks they can provide.

The description also offers an Auto Mode for attacks and evasions, distinguishing the story’s android characters from automation in the player’s controls.

Sources and details

NieR:Automata — Steam game description

{
  "access_scope": "Steam’s game description and feature list; fictional androids, companion mechanics and player-assistance controls are kept distinct, without asserting consciousness or machine-learning implementations.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:06.757375+00:00"
  },
  "id": "work-coverage-891c1a3dd5c002::S1",
  "title": "NieR:Automata — Steam game description",
  "url": "https://store.steampowered.com/app/524220/"
}

Steam’s game description and feature list; fictional androids, companion mechanics and player-assistance controls are kept distinct, without asserting consciousness or machine-learning implementations.

Steam’s game description and feature list; fictional androids, companion mechanics and player-assistance controls are kept distinct, without asserting consciousness or machine-learning implementations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

SIGNALIS

SIGNALIS places humanoid Replikas in a society governed through surveillance and propaganda, with androids working alongside the people they resemble.

The player follows Elster, a technician Replika searching for a lost partner after awakening in a wrecked vessel.

Scarce resources and puzzle solving accompany a story framed around identity and memory, joining survival decisions with uncertainty about the self.

Sources and details

SIGNALIS — Steam game description

{
  "access_scope": "Steam’s SIGNALIS game description; these are fictional premises and advertised mechanics, without importing an ending, a clinical theory of memory or a demonstrated AI architecture.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:04.114463+00:00"
  },
  "id": "work-coverage-8a0e9c9b5ee04b::S1",
  "title": "SIGNALIS — Steam game description",
  "url": "https://store.steampowered.com/app/1262350/"
}

Steam’s SIGNALIS game description; these are fictional premises and advertised mechanics, without importing an ending, a clinical theory of memory or a demonstrated AI architecture.

Steam’s SIGNALIS game description; these are fictional premises and advertised mechanics, without importing an ending, a clinical theory of memory or a demonstrated AI architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2022
}

7 Billion Humans

7 Billion Humans presents office workers as a parallel computer whose actions the player programs to solve puzzles.

Its shared programming language can run across many workers at once, contrasting with the single-worker assembly model described for Human Resource Machine.

Hints and skip controls support progress through the programming exercises.

Sources and details

7 Billion Humans — Steam game description

{
  "access_scope": "Steam game description; the parallel-worker metaphor is a puzzle mechanic, not a proposal for actual labor management or a measured educational outcome.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:08.140535+00:00"
  },
  "id": "work-coverage-8da978298e6bdf::S1",
  "title": "7 Billion Humans — Steam game description",
  "url": "https://store.steampowered.com/app/792100/"
}

Steam game description; the parallel-worker metaphor is a puzzle mechanic, not a proposal for actual labor management or a measured educational outcome.

Steam game description; the parallel-worker metaphor is a puzzle mechanic, not a proposal for actual labor management or a measured educational outcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

The Talos Principle

The Talos Principle asks the player to solve puzzles while deciding whether to obey a creator or question identity and purpose.

Manipulating drones, lasers and time-related puzzle devices provides concrete ways to investigate the world.

The description promises a nonlinear route and consequential choices, connecting progress through puzzles with the player’s interpretation of the story.

Sources and details

The Talos Principle — Steam game description

{
  "access_scope": "Steam’s original The Talos Principle game description; fictional questions and mechanics are not evidence of conscious machines or the sequel’s design.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:16.140713+00:00"
  },
  "id": "work-coverage-8fdf03ecdf9227::S1",
  "title": "The Talos Principle — Steam game description",
  "url": "https://store.steampowered.com/app/257510/"
}

Steam’s original The Talos Principle game description; fictional questions and mechanics are not evidence of conscious machines or the sequel’s design.

Steam’s original The Talos Principle game description; fictional questions and mechanics are not evidence of conscious machines or the sequel’s design.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2014
}

Metal Gear Solid V: The Phantom Pain

The Phantom Pain’s enemy-preparedness system changes opposing equipment in response to the player’s tactics.

Repeated headshots lead to helmets, while nighttime operations can lead to flashlights and night-vision equipment.

Konami also lists responses to stealth and sniping, making repeated behavior a reason to vary tactics as opposition changes.

Sources and details

The Phantom Pain: Enemy Preparedness

{
  "access_scope": "Konami’s Enemy Preparedness support article; described game responses do not establish online neural-network learning, enemy consciousness or a general-purpose adaptive intelligence.",
  "authors": [
    "Konami"
  ],
  "authors_in_source_order": [
    "Konami"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:11.367245+00:00"
  },
  "id": "work-coverage-972892de08d004::S1",
  "title": "The Phantom Pain: Enemy Preparedness",
  "url": "https://eu-support.konami.com/hc/en-gb/articles/9667929703191-The-Phantom-Pain-Enemy-Preparedness"
}

Konami’s Enemy Preparedness support article; described game responses do not establish online neural-network learning, enemy consciousness or a general-purpose adaptive intelligence.

Konami’s Enemy Preparedness support article; described game responses do not establish online neural-network learning, enemy consciousness or a general-purpose adaptive intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

The Forgotten City

The Forgotten City links the fate of a community to a rule under which one person’s wrongdoing kills everyone.

The player investigates through conversations and moral choices while using a time loop to revisit possibilities.

Reason, persuasion, bribery, intimidation and violence are listed as alternative approaches, tying different methods of action to a mystery with multiple endings.

Sources and details

The Forgotten City — Steam game description

{
  "access_scope": "Steam game description; the collective punishment rule and time loop are fictional mechanics, not a claim of historically authentic Roman law or an argument endorsing that rule.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:20.633955+00:00"
  },
  "id": "work-coverage-990f83b0d05bf5::S1",
  "title": "The Forgotten City — Steam game description",
  "url": "https://store.steampowered.com/app/874260/"
}

Steam game description; the collective punishment rule and time loop are fictional mechanics, not a claim of historically authentic Roman law or an argument endorsing that rule.

Steam game description; the collective punishment rule and time loop are fictional mechanics, not a claim of historically authentic Roman law or an argument endorsing that rule.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2021
}

A.I. Artificial Intelligence

A.I. Artificial Intelligence imagines robots as service appliances and a robotic child designed to love as a controversial extension of that role.

David is adopted as a test case into a family whose ill child has been frozen pending a cure.

Amblin’s synopsis follows his search for belonging after that placement fails, making acceptance by people and machines part of the story’s central conflict.

Sources and details

A.I. Artificial Intelligence — Amblin film account

{
  "access_scope": "Amblin’s film synopsis and production account; David’s emotion is a fictional design premise, not a technical demonstration of conscious AI or a complete audit of the screenplay’s development.",
  "authors": [
    "Amblin"
  ],
  "authors_in_source_order": [
    "Amblin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:27.322065+00:00"
  },
  "id": "work-coverage-9aa9c3a528fcab::S1",
  "title": "A.I. Artificial Intelligence — Amblin film account",
  "url": "https://amblin.com/movie/a-i-artificial-intelligence/"
}

Amblin’s film synopsis and production account; David’s emotion is a fictional design premise, not a technical demonstration of conscious AI or a complete audit of the screenplay’s development.

Amblin’s film synopsis and production account; David’s emotion is a fictional design premise, not a technical demonstration of conscious AI or a complete audit of the screenplay’s development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Producer's film page verifies director and year.",
  "dated": true,
  "year": 2001
}

Dwarf Fortress

Dwarf Fortress generates a world with civilizations, cultures, creatures and personalities rather than only a landscape.

Managing a colony connects material construction and food supply with dwarves’ needs and threats from the surrounding world.

The description includes weather, geology and cultural activities among the interacting systems, making failure a possible outcome of the simulation rather than a single predetermined plot.

Sources and details

Dwarf Fortress — Steam game description

{
  "access_scope": "Steam description of the graphical Dwarf Fortress release; listed simulation features are developer statements, not scientific validation, a current feature audit or an accepted causal influence on other games.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:21.096011+00:00"
  },
  "id": "work-coverage-c328357df25552::S1",
  "title": "Dwarf Fortress — Steam game description",
  "url": "https://store.steampowered.com/app/975370/"
}

Steam description of the graphical Dwarf Fortress release; listed simulation features are developer statements, not scientific validation, a current feature audit or an accepted causal influence on other games.

Steam description of the graphical Dwarf Fortress release; listed simulation features are developer statements, not scientific validation, a current feature audit or an accepted causal influence on other games.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2006
}

Silicon Shield: Taiwan’s Protection Against Chinese Attack

Addison argues that Taiwan’s place in international electronics supply chains could give other countries an economic reason to oppose an attack.

His silicon-shield argument connects damage to Taiwanese factories and supply routes with disruption for overseas firms that depend on their components.

He presents industrial interdependence as a possible source of protection, extending a strategic argument beyond military equipment alone.

Sources and details

'Silicon shield' may protect from China attack

{
  "access_scope": "Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.",
  "authors": [
    "Craig Addison"
  ],
  "authors_in_source_order": [
    "Craig Addison"
  ],
  "dates": {
    "published": "2001-05-12",
    "retrieved_utc": "2026-10-07T18:17:55.186781+00:00"
  },
  "id": "work-coverage-3fdcbf60fa987e::S1",
  "title": "'Silicon shield' may protect from China attack",
  "url": "https://www.taipeitimes.com/News/editorials/archives/2001/05/12/0000085421"
}

Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.

Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2001"
}

The Role of Critical Minerals in Clean Energy Transitions

The IEA’s report overview connects clean-energy technologies with the minerals their construction requires.

It frames future demand through technology and policy assumptions and asks whether mineral investment can meet the resulting needs.

Responsible extraction and supply security are treated as parts of the transition alongside deploying the final energy technologies.

Sources and details

The Role of Critical Minerals in Clean Energy Transitions - IEA

{
  "access_scope": "IEA overview of the May 5, 2021 report; only the overview was inspected, so individual projections, numerical findings and the six recommendations are not reproduced or treated as current market facts.",
  "authors": [
    "International Energy Agency"
  ],
  "authors_in_source_order": [
    "International Energy Agency"
  ],
  "dates": {
    "published": "2021-05-05",
    "retrieved_utc": "2026-10-07T18:23:59.923816+00:00"
  },
  "id": "work-coverage-51fe5ffa307cdd::S1",
  "title": "The Role of Critical Minerals in Clean Energy Transitions - IEA",
  "url": "https://www.iea.org/reports/the-role-of-critical-minerals-in-clean-energy-transitions"
}

IEA overview of the May 5, 2021 report; only the overview was inspected, so individual projections, numerical findings and the six recommendations are not reproduced or treated as current market facts.

IEA overview of the May 5, 2021 report; only the overview was inspected, so individual projections, numerical findings and the six recommendations are not reproduced or treated as current market facts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021-05"
}

The Cost and Network Limits of Space-Based AI Compute

Van Berkel compares orbital and terrestrial AI computing through launch costs, power, cooling, radiation and network performance.

The paper distinguishes a terrestrial Clos network from a mesh of satellites connected by laser links, making communication capacity part of the cost comparison.

Its abstract argues that inference in low Earth orbit may be feasible while frontier-scale language-model training is unlikely to compete under the analyzed conditions.

Sources and details

The Cost and Network Limits of Space-Based AI Compute

{
  "access_scope": "The Cost and Network Limits of Space-Based AI Compute, July 2026 arXiv v1 abstract; attributed modeling conclusions are not demonstrated orbital services, an independently rerun cost model or a universal impossibility result.",
  "authors": [
    "van Berkel, Kees"
  ],
  "authors_in_source_order": [
    "van Berkel, Kees"
  ],
  "dates": {
    "citation_date": "2026/07/15",
    "inspected_revision": "Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB)",
    "retrieved_utc": "2026-10-07T18:15:54.482106+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-55aeb7704501d3::S1",
  "title": "The Cost and Network Limits of Space-Based AI Compute",
  "url": "https://arxiv.org/abs/2607.14172",
  "version_url": "https://arxiv.org/abs/2607.14172v1"
}

The Cost and Network Limits of Space-Based AI Compute, July 2026 arXiv v1 abstract; attributed modeling conclusions are not demonstrated orbital services, an independently rerun cost model or a universal impossibility result.

The Cost and Network Limits of Space-Based AI Compute, July 2026 arXiv v1 abstract; attributed modeling conclusions are not demonstrated orbital services, an independently rerun cost model or a universal impossibility result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-07-15"
}

AI Superpowers: China, Silicon Valley, and the New World Order

AI Superpowers presents Lee’s vision of a US–China duopoly in artificial intelligence.

The book’s official description connects that competition with possible job displacement, governments’ responses and the search for meaningful lives after employment disruption.

Sources and details

AI SUPERPOWERS new book by Kai-Fu Lee of Sinovation Ventures

{
  "access_scope": "Official book-site description, distinguished from endorsements and author biography; the duopoly and displacement are the book’s scenarios, not a current ranking of countries or measured labor-market outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:04.539317+00:00"
  },
  "id": "work-coverage-5968854ae9cdae::S1",
  "title": "AI SUPERPOWERS new book by Kai-Fu Lee of Sinovation Ventures",
  "url": "https://www.aisuperpowers.com/"
}

Official book-site description, distinguished from endorsements and author biography; the duopoly and displacement are the book’s scenarios, not a current ranking of countries or measured labor-market outcomes.

Official book-site description, distinguished from endorsements and author biography; the duopoly and displacement are the book’s scenarios, not a current ranking of countries or measured labor-market outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

Chasing Carbon: The Elusive Environmental Footprint of Computing

Chasing Carbon separates emissions from operating computing equipment from emissions embodied in manufacturing and infrastructure.

Its analysis uses industry-reported characterizations to argue that improved operating efficiency can coexist with an increasing total computing footprint.

The authors consequently call for attention to the hardware life cycle, rather than evaluating environmental performance only through electricity consumed during use.

Sources and details

Chasing Carbon: The Elusive Environmental Footprint of Computing

{
  "access_scope": "IEEE Micro accepted, not fully edited manuscript, abstract and opening life-cycle discussion; the DOI header identifies 10.1109/MM.2022.3163226. Its results concern the reported equipment and data, not every current system, and canonical dates remain unchanged.",
  "authors": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "authors_in_source_order": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:09.316635+00:00"
  },
  "doi": "10.1109/MM.2022.3163226",
  "id": "work-coverage-9089cd427b95d4::S1",
  "title": "Chasing Carbon: The Elusive Environmental Footprint of Computing",
  "url": "https://discovery.ucl.ac.uk/10147559/1/Chasing_Carbon_The_Elusive_Environmental_Footprint_of_Computing.pdf",
  "version": "Accepted manuscript, not fully edited; exact header retained by source hash."
}

IEEE Micro accepted, not fully edited manuscript, abstract and opening life-cycle discussion; the DOI header identifies 10.1109/MM.2022.3163226. Its results concern the reported equipment and data, not every current system, and canonical dates remain unchanged.

IEEE Micro accepted, not fully edited manuscript, abstract and opening life-cycle discussion; the DOI header identifies 10.1109/MM.2022.3163226. Its results concern the reported equipment and data, not every current system, and canonical dates remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2022 IEEE Micro version"
}

Alone Together: Why We Expect More from Technology and Less from Each Other

Turkle’s book investigates how persistent connectivity can compete with attention to people who are physically present.

MIT’s account also describes her concern about social robots substituting for human interaction.

She treats habits and social expectations as open to change, acknowledging benefits of connectivity while arguing for renewed attention to human relationships.

Sources and details

The lonely crowd

{
  "access_scope": "Peter Dizikes’s MIT News interview and book account dated January 18, 2011; Turkle’s arguments are attributed, not a causal proof that all connected devices or social robots harm relationships.",
  "authors": [
    "Peter Dizikes"
  ],
  "authors_in_source_order": [
    "Peter Dizikes"
  ],
  "dates": {
    "published": "2011-01-18",
    "retrieved_utc": "2026-10-07T18:17:42.432101+00:00"
  },
  "id": "work-coverage-90ec462c90d96c::S1",
  "title": "The lonely crowd",
  "url": "https://news.mit.edu/2011/turkle-alone-together-0118"
}

Peter Dizikes’s MIT News interview and book account dated January 18, 2011; Turkle’s arguments are attributed, not a causal proof that all connected devices or social robots harm relationships.

Peter Dizikes’s MIT News interview and book account dated January 18, 2011; Turkle’s arguments are attributed, not a causal proof that all connected devices or social robots harm relationships.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2011 first edition; current publisher page describes the 2017 edition.",
  "dated": true,
  "year": 2011
}

China’s Semiconductor Industry Advances despite U.S. Export Controls

Triolo examines how Chinese semiconductor firms and industrial-policy institutions respond to restrictions on access to equipment and technology.

His commentary emphasizes adjustments within interconnected supply chains and the concerns of companies whose research budgets and markets depend on international trade.

He also notes the difficulty of moving beyond public information when assessing the industry’s capabilities.

Sources and details

China’s Semiconductor Industry Advances despite U.S. Export Controls

{
  "access_scope": "Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.",
  "authors": [
    "Paul Triolo"
  ],
  "authors_in_source_order": [
    "Paul Triolo"
  ],
  "dates": {
    "citation_publication_date": "Thu, 03/07/2024 - 12:00",
    "published": "2024-03-07",
    "retrieved_utc": "2026-10-07T18:16:53.150721+00:00"
  },
  "id": "work-coverage-a7289c7737759b::S1",
  "title": "China’s Semiconductor Industry Advances despite U.S. Export Controls",
  "url": "https://www.csis.org/analysis/chinas-semiconductor-industry-advances-despite-us-export-controls"
}

Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.

Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-03-07"
}

Stability AI founding and Emad Mostaque leadership transition

AWS’s announcement describes Stability AI selecting its cloud infrastructure and SageMaker to build and scale generative models.

It also outlines plans to distribute models through SageMaker JumpStart, connecting model training with access for developers.

The relationship pairs an open-model company with a commercial computing platform and its deployment channels.

Sources and details

Stability-AI-Selects-AWS-as-Its-Preferred-Cloud-Provider-to-Build-Artificial-Intelligence-for-the-Future - US Press Center

{
  "access_scope": "AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.",
  "authors": [
    "Amazon Web Services"
  ],
  "authors_in_source_order": [
    "Amazon Web Services"
  ],
  "dates": {
    "announcement_month": "2022-11",
    "retrieved_utc": "2026-10-07T18:12:07.703803+00:00"
  },
  "id": "work-coverage-b38acb297f4e2b::S1",
  "title": "Stability-AI-Selects-AWS-as-Its-Preferred-Cloud-Provider-to-Build-Artificial-Intelligence-for-the-Future - US Press Center",
  "url": "https://press.aboutamazon.com/2022/11/stability-ai-selects-aws-as-its-preferred-cloud-provider-to-build-artificial-intelligence-for-the-future"
}

AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.

AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "AWS identified founder/CEO in 2022; Stability announcement March 2024.",
  "dated": true,
  "year": 2024
}

AI Native

Lee argues that AI transformation should change operating results and organizational design, rather than stop at pilots or isolated assistants.

His proposed enterprise decision system combines memory, company context and the ability to coordinate actions and learn from outcomes.

He assigns the CEO responsibility for redesigning the operating model while retaining human judgment about the organization’s purpose.

Sources and details

Why I wrote “AI Native: The Mandate to Transform Your Company”

{
  "access_scope": "Kai-Fu Lee’s authored AI Native announcement, describing fall 2026 editions; these are strategic prescriptions and a proposed architecture, not independently verified capabilities, financial returns or measured productivity gains.",
  "authors": [
    "Kai-Fu Lee"
  ],
  "authors_in_source_order": [
    "Kai-Fu Lee"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:24.447542+00:00"
  },
  "id": "work-coverage-cf2978e262d894::S1",
  "title": "Why I wrote “AI Native: The Mandate to Transform Your Company”",
  "url": "https://www.linkedin.com/pulse/why-i-wrote-ai-native-mandate-transform-your-company-kai-fu-lee-gf7nc"
}

Kai-Fu Lee’s authored AI Native announcement, describing fall 2026 editions; these are strategic prescriptions and a proposed architecture, not independently verified capabilities, financial returns or measured productivity gains.

Kai-Fu Lee’s authored AI Native announcement, describing fall 2026 editions; these are strategic prescriptions and a proposed architecture, not independently verified capabilities, financial returns or measured productivity gains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2026
}

Orbital Data Centers: Spacecraft Constraints and Economic Viability

Turyshev analyzes orbital computing as a joint problem of power generation, battery recharge, heat rejection, communications and usable mission lifetime.

His model relates deployed mass and cost to the computing power actually delivered, with utilization and replacement affecting competitiveness.

The abstract distinguishes early space-native processing from serving terrestrial users, whose workloads must satisfy stricter conditions for communication demand and delivered cost.

Sources and details

Orbital Data Centers: Spacecraft Constraints and Economic Viability

{
  "access_scope": "Orbital Data Centers: Spacecraft Constraints and Economic Viability, April 2026 arXiv v1 abstract; conditional engineering and economic modeling, not a validated commercial facility, current launch-price advice or an independently reproduced calculation.",
  "authors": [
    "Turyshev, Slava G."
  ],
  "authors_in_source_order": [
    "Turyshev, Slava G."
  ],
  "dates": {
    "citation_date": "2026/04/29",
    "inspected_revision": "Wed, 29 Apr 2026 21:00:58 UTC (52 KB)",
    "retrieved_utc": "2026-10-07T18:18:45.509190+00:00",
    "version": "arXiv v1"
  },
  "id": "work-coverage-d1058b9116cdd2::S1",
  "title": "Orbital Data Centers: Spacecraft Constraints and Economic Viability",
  "url": "https://arxiv.org/abs/2604.27197",
  "version_url": "https://arxiv.org/abs/2604.27197v1"
}

Orbital Data Centers: Spacecraft Constraints and Economic Viability, April 2026 arXiv v1 abstract; conditional engineering and economic modeling, not a validated commercial facility, current launch-price advice or an independently reproduced calculation.

Orbital Data Centers: Spacecraft Constraints and Economic Viability, April 2026 arXiv v1 abstract; conditional engineering and economic modeling, not a validated commercial facility, current launch-price advice or an independently reproduced calculation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-04-29"
}

Global Critical Minerals Outlook 2025

The IEA’s 2025 minerals outlook separates scenario-based demand projections from supply projections built from announced projects.

It examines mining and refining concentration as well as how expected supply compares with mineral requirements.

Diversification, recycling and emerging battery technologies enter the analysis as possible changes to the supply system.

Sources and details

Global Critical Minerals Outlook 2025 - IEA

{
  "access_scope": "IEA report overview dated May 21, 2025 and its Outlook for key energy transition minerals subsection; only the overview was inspected. Announced projects are not completed supply, and the three policy scenarios are not certain forecasts.",
  "authors": [
    "International Energy Agency"
  ],
  "authors_in_source_order": [
    "International Energy Agency"
  ],
  "dates": {
    "published": "2025-05-21",
    "retrieved_utc": "2026-10-07T18:24:31.483616+00:00"
  },
  "id": "work-coverage-e9710fffc9b187::S1",
  "title": "Global Critical Minerals Outlook 2025 - IEA",
  "url": "https://www.iea.org/reports/global-critical-minerals-outlook-2025"
}

IEA report overview dated May 21, 2025 and its Outlook for key energy transition minerals subsection; only the overview was inspected. Announced projects are not completed supply, and the three policy scenarios are not certain forecasts.

IEA report overview dated May 21, 2025 and its Outlook for key energy transition minerals subsection; only the overview was inspected. Announced projects are not completed supply, and the three policy scenarios are not certain forecasts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2025"
}

Mustafa Suleyman joins Microsoft to lead Microsoft AI

Nadella’s announcement creates Microsoft AI around consumer products and research, with Suleyman leading the organization and Simonyan as chief scientist.

It brings several Inflection team members together with existing Copilot, Bing, Edge and generative-AI teams under the new reporting structure.

The change coordinates research and product responsibilities while the announcement also retains Microsoft’s stated commitment to its OpenAI relationship.

Sources and details

Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog

{
  "access_scope": "Satya Nadella’s employee communication published March 19, 2024; historical organizational appointments and team moves, not a complete acquisition of Inflection or confirmation of current reporting lines.",
  "authors": [
    "Satya Nadella"
  ],
  "authors_in_source_order": [
    "Satya Nadella"
  ],
  "dates": {
    "published": "2024-03-19",
    "retrieved_utc": "2026-10-07T17:56:37.979838+00:00"
  },
  "id": "work-coverage-ee79f6a52a0cbc::S1",
  "title": "Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/"
}

Satya Nadella’s employee communication published March 19, 2024; historical organizational appointments and team moves, not a complete acquisition of Inflection or confirmation of current reporting lines.

Satya Nadella’s employee communication published March 19, 2024; historical organizational appointments and team moves, not a complete acquisition of Inflection or confirmation of current reporting lines.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Appointment announced March 19, 2024; not asserted as a freshly verified October 2026 title.",
  "dated": true,
  "year": 2024
}

ESA Space Environment Report 2026

ESA’s 2026 space-environment overview bases its data on activities through the end of 2025 and excludes projects still being prepared for launch.

It connects growing orbital traffic with collision risk and the need for satellites to leave congested orbits at the end of their lives.

The overview describes debris collisions as a source of further debris, making mitigation and active removal part of the long-term sustainability problem.

Sources and details

ESA - ESA Space Environment Report 2026

{
  "access_scope": "ESA’s overview of its 2026 report, based on data through 2025; reported observations and projections are distinct, and the full underlying model and every numerical indicator were not independently audited.",
  "authors": [
    "European Space Agency"
  ],
  "authors_in_source_order": [
    "European Space Agency"
  ],
  "dates": {
    "data_cutoff": "2025-12-31",
    "report_edition": "2026",
    "retrieved_utc": "2026-10-07T18:24:30.839330+00:00"
  },
  "id": "work-coverage-f5ecbe068e4960::S1",
  "title": "ESA - ESA Space Environment Report 2026",
  "url": "https://www.esa.int/Space_Safety/Space_Debris/ESA_Space_Environment_Report_2026"
}

ESA’s overview of its 2026 report, based on data through 2025; reported observations and projections are distinct, and the full underlying model and every numerical indicator were not independently audited.

ESA’s overview of its 2026 report, based on data through 2025; reported observations and projections are distinct, and the full underlying model and every numerical indicator were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-09-14"
}

Poker: Texas Hold'em

Libratus reduces poker to a tractable abstraction that provides an initial blueprint strategy.

During later play it resolves smaller subgames in greater detail, including actions missing from the initial abstraction.

Its improvement module looks for holes in its own blueprint revealed by opponents’ bet sizes and adds decision branches, rather than simply assuming the opponent’s past strategy will remain fixed.

Sources and details

Carnegie Mellon Reveals Inner Workings of Victorious AI

{
  "access_scope": "Byron Spice’s Carnegie Mellon account dated December 17, 2017; describes Libratus research on heads-up no-limit Texas Hold’em, not authorship of poker or guaranteed success in finance and negotiation.",
  "authors": [
    "Byron Spice"
  ],
  "authors_in_source_order": [
    "Byron Spice"
  ],
  "dates": {
    "published": "2017-12-17",
    "retrieved_utc": "2026-10-07T18:11:26.508428+00:00"
  },
  "id": "work-coverage-28d4edb2b57761::S1",
  "title": "Carnegie Mellon Reveals Inner Workings of Victorious AI",
  "url": "https://www.cmu.edu/news/stories/archives/2017/december/ai-inner-workings.html"
}

Byron Spice’s Carnegie Mellon account dated December 17, 2017; describes Libratus research on heads-up no-limit Texas Hold’em, not authorship of poker or guaranteed success in finance and negotiation.

Byron Spice’s Carnegie Mellon account dated December 17, 2017; describes Libratus research on heads-up no-limit Texas Hold’em, not authorship of poker or guaranteed success in finance and negotiation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Journal issue is January 2018; published online December 2017; competition January 2017.",
  "dated": false,
  "year": null
}

Neon Reduction Program on Cymer ArF Light Sources

Cymer’s program responds to neon supply constraints by reducing gas consumption while aiming to preserve light-source performance.

It combines optimized gas algorithms with immediate containment, qualification of additional suppliers and longer-term recycling or reclaim opportunities.

The abstract reports testing across changing operating conditions, connecting a material-supply response with checks on manufacturing equipment behavior.

Sources and details

Neon Reduction Program on Cymer ArF Light Sources

{
  "access_scope": "Abstract and introduction of the five-author Neon Reduction Program paper on PDF page 14 of Cymer’s Advanced Lithography 2016 collection; distinct from the collection’s first paper. Supplier-reported test results are not a current supply forecast or an independently replicated performance claim.",
  "authors": [
    "Dinesh Kanawade",
    "Yzzer Roman",
    "Ted Cacouris",
    "Josh Thornes",
    "Kevin OBrien"
  ],
  "authors_in_source_order": [
    "Dinesh Kanawade",
    "Yzzer Roman",
    "Ted Cacouris",
    "Josh Thornes",
    "Kevin OBrien"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:56.565135+00:00"
  },
  "id": "work-coverage-3b9943c64e39b2::S1",
  "title": "Neon Reduction Program on Cymer ArF Light Sources",
  "url": "https://www.cymer.com/wp-content/uploads/2018/12/Cymer_SPIE_AdvancedLithography_2016.pdf"
}

Abstract and introduction of the five-author Neon Reduction Program paper on PDF page 14 of Cymer’s Advanced Lithography 2016 collection; distinct from the collection’s first paper. Supplier-reported test results are not a current supply forecast or an independently replicated performance claim.

Abstract and introduction of the five-author Neon Reduction Program paper on PDF page 14 of Cymer’s Advanced Lithography 2016 collection; distinct from the collection’s first paper. Supplier-reported test results are not a current supply forecast or an independently replicated performance claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2016"
}

Atari 2600 game suite

The Arcade Learning Environment gives researchers a common interface to many Atari 2600 games.

The paper uses that variety to test reinforcement learning and planning approaches across different tasks, rather than building one agent around one game.

It pairs the software platform with an evaluation methodology and publicly available benchmark agents, making comparison part of the research contribution.

Sources and details

The Arcade Learning Environment: An Evaluation Platform for General Agents

{
  "access_scope": "The Arcade Learning Environment, arXiv v2 dated June 21, 2013, abstract; research-platform authors are distinct from Atari game creators, and evaluation across games does not establish general intelligence.",
  "authors": [
    "Bellemare, Marc G.",
    "Naddaf, Yavar",
    "Veness, Joel",
    "Bowling, Michael"
  ],
  "authors_in_source_order": [
    "Bellemare, Marc G.",
    "Naddaf, Yavar",
    "Veness, Joel",
    "Bowling, Michael"
  ],
  "dates": {
    "citation_date": "2012/07/19",
    "inspected_revision": "Fri, 21 Jun 2013 18:07:06 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:16:32.622531+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-46a41b82d67f8c::S1",
  "title": "The Arcade Learning Environment: An Evaluation Platform for General Agents",
  "url": "https://arxiv.org/abs/1207.4708",
  "version_url": "https://arxiv.org/abs/1207.4708v2"
}

The Arcade Learning Environment, arXiv v2 dated June 21, 2013, abstract; research-platform authors are distinct from Atari game creators, and evaluation across games does not establish general intelligence.

The Arcade Learning Environment, arXiv v2 dated June 21, 2013, abstract; research-platform authors are distinct from Atari game creators, and evaluation across games does not establish general intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Journal publication 2013; arXiv predecessor first submitted in 2012.",
  "dated": false,
  "year": null
}

SpaceX Orbital Data Center system / Starmind

The FCC notice opens a comment process on SpaceX’s application for an orbital data-center satellite system.

The proposed architecture relies mainly on optical links between satellites, with possible connections to Starlink systems.

The notice also seeks comment on waiver requests, making the proposal’s regulatory review a separate step from constructing or operating the network.

Sources and details

Space Bureau Accepts for Filing SpaceX’s Application for Orbital Data Centers

{
  "access_scope": "FCC Space Bureau Public Notice DA 26-113 released February 4, 2026; acceptance for filing is not a license grant or deployment approval. Proposed capacity is not delivered capacity, and this notice does not independently bind the Starmind name.",
  "authors": [
    "Federal Communications Commission, Space Bureau"
  ],
  "authors_in_source_order": [
    "Federal Communications Commission, Space Bureau"
  ],
  "dates": {
    "released": "2026-02-04",
    "retrieved_utc": "2026-10-07T18:23:46.649169+00:00"
  },
  "id": "work-coverage-4b9607ea642afd::S1",
  "title": "Space Bureau Accepts for Filing SpaceX’s Application for Orbital Data Centers",
  "url": "https://docs.fcc.gov/public/attachments/DA-26-113A1.pdf"
}

FCC Space Bureau Public Notice DA 26-113 released February 4, 2026; acceptance for filing is not a license grant or deployment approval. Proposed capacity is not delivered capacity, and this notice does not independently bind the Starmind name.

FCC Space Bureau Public Notice DA 26-113 released February 4, 2026; acceptance for filing is not a license grant or deployment approval. Proposed capacity is not delivered capacity, and this notice does not independently bind the Starmind name.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-01-30"
}

Φsat-2

ESA describes Φsat-2 as a CubeSat intended to demonstrate AI applications for Earth observation.

Its examples include discarding cloudy images, identifying maritime vessels and turning images into street maps for disaster response.

Sources and details

ESA - Φsat-2

{
  "access_scope": "ESA mission overview and August 16, 2024 launch listing; advertised demonstration objectives are not independently validated accuracy, completed operational performance or continuous disaster-response service.",
  "authors": [
    "European Space Agency"
  ],
  "authors_in_source_order": [
    "European Space Agency"
  ],
  "dates": {
    "launch_listing": "2024-08-16",
    "retrieved_utc": "2026-10-07T18:18:34.698569+00:00"
  },
  "id": "work-coverage-4e69ec2309c130::S1",
  "title": "ESA - Φsat-2",
  "url": "https://www.esa.int/Applications/Observing_the_Earth/FutureEO/Phsat-2"
}

ESA mission overview and August 16, 2024 launch listing; advertised demonstration objectives are not independently validated accuracy, completed operational performance or continuous disaster-response service.

ESA mission overview and August 16, 2024 launch listing; advertised demonstration objectives are not independently validated accuracy, completed operational performance or continuous disaster-response service.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-08-16"
}

First return, then explore

The Go-Explore repository distinguishes a variant that explores deterministically before a robustification phase from a policy-based exploration variant.

It also separates code for First return then explore from the earlier paper’s tagged release, making the research version part of choosing the implementation.

Sources and details

Go-Explore — repository README

{
  "access_scope": "Author-associated repository README only; the linked papers and code were not independently inspected or rerun, so no benchmark improvement, robustness guarantee or theorem is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:04.325043+00:00"
  },
  "id": "work-coverage-561bfe6f3c72b9::S1",
  "title": "Go-Explore — repository README",
  "url": "https://github.com/uber-research/go-explore"
}

Author-associated repository README only; the linked papers and code were not independently inspected or rerun, so no benchmark improvement, robustness guarantee or theorem is inferred.

Author-associated repository README only; the linked papers and code were not independently inspected or rerun, so no benchmark improvement, robustness guarantee or theorem is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Nature paper published February 2021; earlier Go-Explore reports appeared before it.",
  "dated": true,
  "year": 2021
}

What the Frog’s Eye Tells the Frog’s Brain

The frog-vision paper describes retinal output through several operations on an image rather than a simple list of light values at independent points.

Its conclusion distinguishes responses to edges and contrast, dark-object boundaries, movement and local dimming.

The authors connect those operations to aligned maps in the brain, describing how a location can be represented through properties of its neighborhood.

Sources and details

What the Frog’s Eye Tells the Frog’s Brain

{
  "access_scope": "Conclusion on scanned PDF page 13, printed page 257, of the four-author book-chapter reprint; the printed first-page footnote identifies the original 1959 article. This historical frog experiment is not a complete model of human vision or proof of a causal influence on later AI.",
  "authors": [
    "J. Y. Lettvin",
    "H. R. Maturana",
    "W. S. McCulloch",
    "W. H. Pitts"
  ],
  "authors_in_source_order": [
    "J. Y. Lettvin",
    "H. R. Maturana",
    "W. S. McCulloch",
    "W. H. Pitts"
  ],
  "dates": {
    "original_article_year": "1959",
    "retrieved_utc": "2026-10-07T18:10:54.123551+00:00"
  },
  "id": "work-coverage-7447a3590c202e::S1",
  "title": "What the Frog’s Eye Tells the Frog’s Brain",
  "url": "https://courses.csail.mit.edu/6.803/pdf/lettvin.pdf"
}

Conclusion on scanned PDF page 13, printed page 257, of the four-author book-chapter reprint; the printed first-page footnote identifies the original 1959 article. This historical frog experiment is not a complete model of human vision or proof of a causal influence on later AI.

Conclusion on scanned PDF page 13, printed page 257, of the four-author book-chapter reprint; the printed first-page footnote identifies the original 1959 article. This historical frog experiment is not a complete model of human vision or proof of a causal influence on later AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1959
}

International Roadmap for Devices and Systems: 2024 Update, More Moore

The More Moore roadmap connects device scaling with power, performance, area and cost requirements for edge and cloud systems.

Its introduction identifies power and data bandwidth as constraints and emphasizes bringing data closer to computing for AI workloads.

The roadmap supplies technology requirements over a planning horizon, connecting logic and memory choices with the systems that would use them.

Sources and details

International Roadmap for Devices and Systems — 2024 Update: More Moore

{
  "access_scope": "Introduction of the IRDS 2024 More Moore update; institutional technology assessment and future targets, not certified products, guaranteed manufacturing schedules or an independent validation of every forecast.",
  "authors": [
    "IRDS More Moore International Focus Team"
  ],
  "authors_in_source_order": [
    "IRDS More Moore International Focus Team"
  ],
  "dates": {
    "report_edition": "2024",
    "retrieved_utc": "2026-10-07T18:24:01.584697+00:00"
  },
  "id": "work-coverage-75331e5c44143f::S1",
  "title": "International Roadmap for Devices and Systems — 2024 Update: More Moore",
  "url": "https://irds.ieee.org/images/files/pdf/2024/2024IRDS_MM.pdf"
}

Introduction of the IRDS 2024 More Moore update; institutional technology assessment and future targets, not certified products, guaranteed manufacturing schedules or an independent validation of every forecast.

Introduction of the IRDS 2024 More Moore update; institutional technology assessment and future targets, not certified products, guaranteed manufacturing schedules or an independent validation of every forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024"
}

Pokémon Red via Reinforcement Learning

The Pokémon Red study uses a long-horizon game as a test for exploration and multiple tasks.

Its baseline agent completes an initial portion through Cerulean City, while experiments reveal ways agents can exploit shaped rewards.

The authors use those limitations to motivate further research on exploration and hierarchical or language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Pokémon Red via Reinforcement Learning, arXiv v2 dated March 11, 2025, abstract; paper authors are distinct from game creators. Initial-segment completion is not completion of the entire game, and proposed future methods are not demonstrated results.",
  "authors": [
    "Pleines, Marco",
    "Addis, Daniel",
    "Rubinstein, David",
    "Zimmer, Frank",
    "Preuss, Mike",
    "Whidden, Peter"
  ],
  "authors_in_source_order": [
    "Pleines, Marco",
    "Addis, Daniel",
    "Rubinstein, David",
    "Zimmer, Frank",
    "Preuss, Mike",
    "Whidden, Peter"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-8093639133c4d7::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Pokémon Red via Reinforcement Learning, arXiv v2 dated March 11, 2025, abstract; paper authors are distinct from game creators. Initial-segment completion is not completion of the entire game, and proposed future methods are not demonstrated results.

Pokémon Red via Reinforcement Learning, arXiv v2 dated March 11, 2025, abstract; paper authors are distinct from game creators. Initial-segment completion is not completion of the entire game, and proposed future methods are not demonstrated results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Submitted February 27, 2025; title changed from the first-version “Playing Pokémon Red via Deep Reinforcement Learning.”",
  "dated": true,
  "year": 2025
}

Super Smash Bros. Melee

The Super Smash Bros. study tests deep reinforcement learning in a fighting game with complex dynamics and incomplete observation.

Competing agents add a multi-player challenge to learning from game experience.

The paper reports agents competitive with professional players under its tested conditions, extending the evaluation beyond a single-player environment.

Sources and details

Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning

{
  "access_scope": "Beating the World’s Best at Super Smash Bros. with Deep Reinforcement Learning, arXiv v3 dated May 8, 2017, abstract; no claim of winning every matchup, complete game mastery or authorship of the original game.",
  "authors": [
    "Firoiu, Vlad",
    "Whitney, William F.",
    "Tenenbaum, Joshua B."
  ],
  "authors_in_source_order": [
    "Firoiu, Vlad",
    "Whitney, William F.",
    "Tenenbaum, Joshua B."
  ],
  "dates": {
    "citation_date": "2017/02/21",
    "inspected_revision": "Mon, 8 May 2017 15:03:25 UTC (152 KB)",
    "retrieved_utc": "2026-10-07T18:16:32.978825+00:00",
    "version": "arXiv v3"
  },
  "id": "work-coverage-8f28d60d0ff990::S1",
  "title": "Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1702.06230",
  "version_url": "https://arxiv.org/abs/1702.06230v3"
}

Beating the World’s Best at Super Smash Bros. with Deep Reinforcement Learning, arXiv v3 dated May 8, 2017, abstract; no claim of winning every matchup, complete game mastery or authorship of the original game.

Beating the World’s Best at Super Smash Bros. with Deep Reinforcement Learning, arXiv v3 dated May 8, 2017, abstract; no claim of winning every matchup, complete game mastery or authorship of the original game.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Submitted February 21, 2017.",
  "dated": true,
  "year": 2001
}

Starcloud-1

Starcloud’s mission page reports a satellite carrying an NVIDIA H100 GPU after a November 2025 launch.

It also reports training a nanoGPT model in orbit, presenting onboard learning as a use of the deployed computing hardware.

Sources and details

Starcloud-1 — mission account

{
  "access_scope": "Starcloud’s own mission page; these are company-reported milestones, not independent verification, measured commercial capacity or priority claims. The page’s inconsistent Gemini/Gemma naming is not resolved or adopted.",
  "authors": [
    "Starcloud"
  ],
  "authors_in_source_order": [
    "Starcloud"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:25.717816+00:00"
  },
  "id": "work-coverage-91437853c2292b::S1",
  "title": "Starcloud-1 — mission account",
  "url": "https://www.starcloud.com/starcloud-1"
}

Starcloud’s own mission page; these are company-reported milestones, not independent verification, measured commercial capacity or priority claims. The page’s inconsistent Gemini/Gemma naming is not resolved or adopted.

Starcloud’s own mission page; these are company-reported milestones, not independent verification, measured commercial capacity or priority claims. The page’s inconsistent Gemini/Gemma naming is not resolved or adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2025-11"
}

Deep learning with coherent nanophotonic circuits

The photonic-network paper proposes using an optical architecture for neural-network inference.

Its experimental demonstration uses programmable interferometers in a silicon photonic circuit and applies the processor to vowel recognition.

The abstract distinguishes the tested core concept from potential improvements in computing speed and power efficiency.

Sources and details

Deep learning with coherent nanophotonic circuits

{
  "access_scope": "Nature Photonics accessible abstract of the 2017 paper; no full-text inspection, general performance superiority, optical training claim or commercial deployment is inferred.",
  "authors": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "authors_in_source_order": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "dates": {
    "citation_publication_date": "2017/07",
    "retrieved_utc": "2026-10-07T18:11:34.777972+00:00"
  },
  "id": "work-coverage-c5cdd9d18f2b5b::S1",
  "title": "Deep learning with coherent nanophotonic circuits",
  "url": "https://www.nature.com/articles/nphoton.2017.93"
}

Nature Photonics accessible abstract of the 2017 paper; no full-text inspection, general performance superiority, optical training claim or commercial deployment is inferred.

Nature Photonics accessible abstract of the 2017 paper; no full-text inspection, general performance superiority, optical training claim or commercial deployment is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2017"
}

Φsat-1 / FSSCat

ESA’s Φsat-1 experiment places AI filtering within an Earth-observation mission.

The described purpose is to return usable imagery rather than send every captured image to Earth, linking onboard processing with the data transmitted from orbit.

Sources and details

ESA - Φsat

{
  "access_scope": "ESA overview of Φsat-1 as an enhancement of FSSCat, with a September 3, 2020 launch listing; mission-owner description only, without adopting a global first claim or verified filtering accuracy.",
  "authors": [
    "European Space Agency"
  ],
  "authors_in_source_order": [
    "European Space Agency"
  ],
  "dates": {
    "launch_listing": "2020-09-03",
    "retrieved_utc": "2026-10-07T18:24:21.996410+00:00"
  },
  "id": "work-coverage-d2ba463674053b::S1",
  "title": "ESA - Φsat",
  "url": "https://www.esa.int/Applications/Observing_the_Earth/FutureEO/Phsat"
}

ESA overview of Φsat-1 as an enhancement of FSSCat, with a September 3, 2020 launch listing; mission-owner description only, without adopting a global first claim or verified filtering accuracy.

ESA overview of Φsat-1 as an enhancement of FSSCat, with a September 3, 2020 launch listing; mission-owner description only, without adopting a global first claim or verified filtering accuracy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2020-09-03"
}

AlphaFold Protein Structure Database expansion

Birney separates the AlphaFold database effort into tracking known proteins, scaling structure predictions and organizing the resulting structures for users.

UniProt supplies the protein catalog, while the database work includes storing, indexing and integrating predictions rather than only running a model.

His account also connects open structural data and the CASP community evaluation with the development of useful structure-prediction systems.

Sources and details

AlphaFold: where will the next AI breakthrough come from?

{
  "access_scope": "Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.",
  "authors": [
    "Ewan Birney"
  ],
  "authors_in_source_order": [
    "Ewan Birney"
  ],
  "dates": {
    "published": "2022-08-22",
    "retrieved_utc": "2026-10-07T18:23:26.651350+00:00"
  },
  "id": "work-coverage-e14f21387d94a2::S1",
  "title": "AlphaFold: where will the next AI breakthrough come from?",
  "url": "https://www.ebi.ac.uk/about/news/perspectives/alphafold-where-will-the-next-ai-breakthrough-come-from/"
}

Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2022 expansion; database initially launched in 2021.",
  "dated": true,
  "year": 2022
}

ImageNet Large Scale Visual Recognition Challenge

ImageNet organizes image categories through WordNet synonym sets and describes its images as quality-controlled and human-annotated.

The project overview links a large shared dataset with the need for a clearly defined object-categorization benchmark.

Its news section records an update to the 2012 classification and localization test set, showing that evaluation resources can change after an original challenge.

Sources and details

About ImageNet

{
  "access_scope": "ImageNet project About page and October 10, 2019 update notice; dataset overview is distinct from a complete audit of ILSVRC rules or results. ImageNet explicitly does not own the copyright of the underlying web images, which are not redistributed here.",
  "authors": [
    "ImageNet project"
  ],
  "authors_in_source_order": [
    "ImageNet project"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:30.478163+00:00",
    "test_set_update_notice": "2019-10-10"
  },
  "id": "work-coverage-f8a68baf4decba::S1",
  "title": "About ImageNet",
  "url": "https://www.image-net.org/about"
}

ImageNet project About page and October 10, 2019 update notice; dataset overview is distinct from a complete audit of ILSVRC rules or results. ImageNet explicitly does not own the copyright of the underlying web images, which are not redistributed here.

ImageNet project About page and October 10, 2019 update notice; dataset overview is distinct from a complete audit of ILSVRC rules or results. ImageNet explicitly does not own the copyright of the underlying web images, which are not redistributed here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Brian and Charles

Brian and Charles follows an isolated inventor who assembles an artificially intelligent companion from a washing machine and spare parts.

Focus’s synopsis gives Charles dictionary-based language learning as a fictional premise and frames the relationship through friendship, family and letting go.

Sources and details

Brian and Charles — film synopsis

{
  "access_scope": "Focus Features’ film synopsis, with a June 17, 2022 listing; fictional learning and robot construction, not a demonstrated AI architecture or a scientific claim about dictionaries as sufficient language training.",
  "authors": [
    "Focus Features"
  ],
  "authors_in_source_order": [
    "Focus Features"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:50.785358+00:00"
  },
  "id": "work-coverage-4c6181a03077ed::S1",
  "title": "Brian and Charles — film synopsis",
  "url": "https://www.focusfeatures.com/brian-and-charles"
}

Focus Features’ film synopsis, with a June 17, 2022 listing; fictional learning and robot construction, not a demonstrated AI architecture or a scientific claim about dictionaries as sufficient language training.

Focus Features’ film synopsis, with a June 17, 2022 listing; fictional learning and robot construction, not a demonstrated AI architecture or a scientific claim about dictionaries as sufficient language training.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Distributor page records 17 June 2022 release and Jim Archer as director. Feature film, distinct from 2017 short.",
  "dated": true,
  "year": 2022
}

Virtuosity

Virtuosity imagines a computer-generated killer assembled from the personality profiles of murderers.

Paramount’s synopsis has that character escape virtual reality into the physical world, where a former police officer is sent to pursue him.

Sources and details

Virtuosity — Über den Film

{
  "access_scope": "Original English paraphrase of Paramount Germany’s German-language synopsis of the 1995 film; fictional personality construction and escape, not a real simulation method or a verified model of violent behavior.",
  "authors": [
    "Paramount Germany"
  ],
  "authors_in_source_order": [
    "Paramount Germany"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:00.381956+00:00"
  },
  "id": "work-coverage-4d42bcd4c13954::S1",
  "title": "Virtuosity — Über den Film",
  "url": "https://www.paramount.de/virtuosity"
}

Original English paraphrase of Paramount Germany’s German-language synopsis of the 1995 film; fictional personality construction and escape, not a real simulation method or a verified model of violent behavior.

Original English paraphrase of Paramount Germany’s German-language synopsis of the 1995 film; fictional personality construction and escape, not a real simulation method or a verified model of violent behavior.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1995
}

Psycho-Pass: The Movie

Psycho-Pass: The Movie extends its fictional justice system from Japan to a foreign conflict region through exported systems and unmanned drones.

A test in Shambhalafloat promises peace and security before attacks lead Akane Tsunemori to investigate.

Fuji TV’s story description connects that investigation with the question of what justice means when a governing system moves into a new society.

Sources and details

PSYCHO-PASS: THE MOVIE — Story

{
  "access_scope": "Fuji TV’s official film Story section; fictional governance and security claims, not actual criminal-risk prediction or evidence that automated policing delivers justice.",
  "authors": [
    "Fuji TV"
  ],
  "authors_in_source_order": [
    "Fuji TV"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:22.516718+00:00"
  },
  "id": "work-coverage-6632f32da62346::S1",
  "title": "PSYCHO-PASS: THE MOVIE — Story",
  "url": "https://www.fujitv.com/movie/psycho-pass-the-movie/"
}

Fuji TV’s official film Story section; fictional governance and security claims, not actual criminal-risk prediction or evidence that automated policing delivers justice.

Fuji TV’s official film Story section; fictional governance and security claims, not actual criminal-risk prediction or evidence that automated policing delivers justice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Life 3.0: Being Human in the Age of Artificial Intelligence

Life 3.0 frames AI as a set of choices about prosperity, employment, security and the purpose of human life.

The publisher’s description connects benefits from automation with the question of income and meaning for people whose work changes.

It also asks how systems can remain robust and serve human intentions, presenting competing possible futures rather than one inevitable outcome.

Sources and details

Life 3.0 — publisher book description

{
  "access_scope": "Publisher Book Description, with the 2017 ebook and 2018 paperback dates kept distinct; questions and scenarios are not measured findings or inspection of the book’s full arguments.",
  "authors": [
    "Penguin Random House"
  ],
  "authors_in_source_order": [
    "Penguin Random House"
  ],
  "dates": {
    "ebook_listing": "2017-08-29",
    "paperback_listing": "2018-07-31",
    "retrieved_utc": "2026-10-07T17:58:37.465398+00:00"
  },
  "id": "work-coverage-7891649f04fa0e::S1",
  "title": "Life 3.0 — publisher book description",
  "url": "https://www.penguinrandomhouse.com/books/530584/life-30-by-max-tegmark/9781101946602/"
}

Publisher Book Description, with the 2017 ebook and 2018 paperback dates kept distinct; questions and scenarios are not measured findings or inspection of the book’s full arguments.

Publisher Book Description, with the 2017 ebook and 2018 paperback dates kept distinct; questions and scenarios are not measured findings or inspection of the book’s full arguments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publisher ebook lists 29 August 2017; later paperbacks are separate editions.",
  "dated": true,
  "year": 2017
}

Foundation

The Foundation Trilogy places the decline of a galactic empire beside questions about governing society and predicting history.

Folio’s introduction describes a story drawing on politics, ancient history and mathematics, making collective change a central subject rather than only individual adventure.

Sources and details

The Foundation Trilogy — Folio Society edition description

{
  "access_scope": "Folio Society’s description of its three-volume edition; covers the trilogy rather than a complete reading of the first novel. Edition metadata and the page’s serial-history claim are not used to overwrite canonical dates.",
  "authors": [
    "The Folio Society"
  ],
  "authors_in_source_order": [
    "The Folio Society"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:07.266450+00:00"
  },
  "edition_date_exact": "06/10/2012; locale ambiguity not resolved.",
  "id": "work-coverage-7fecba90135685::S1",
  "title": "The Foundation Trilogy — Folio Society edition description",
  "url": "https://www.foliosociety.com/uk/the-foundation-trilogy"
}

Folio Society’s description of its three-volume edition; covers the trilogy rather than a complete reading of the first novel. Edition metadata and the page’s serial-history claim are not used to overwrite canonical dates.

Folio Society’s description of its three-volume edition; covers the trilogy rather than a complete reading of the first novel. Edition metadata and the page’s serial-history claim are not used to overwrite canonical dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1951 first volume; stories predate the book. Do not conflate single volume and trilogy.",
  "dated": true,
  "year": 1951
}

I Am Mother

I Am Mother imagines a robot raising a teenage girl as part of a project to restore humanity after extinction.

An injured outsider challenges the daughter’s understanding of the world and her guardian’s intentions, making trust in a designed caregiver part of the conflict.

Sources and details

Netflix Nabs North American Rights to Grant Sputore’s Sci-Fi Thriller I Am Mother

{
  "access_scope": "Netflix’s February 7, 2019 rights announcement and film logline; fictional caregiver and repopulation project, not a demonstrated AI safety mechanism or a complete plot account.",
  "authors": [
    "Netflix"
  ],
  "authors_in_source_order": [
    "Netflix"
  ],
  "dates": {
    "published": "2019-02-07",
    "retrieved_utc": "2026-10-07T18:15:21.173679+00:00"
  },
  "id": "work-coverage-82346f44f674bc::S1",
  "title": "Netflix Nabs North American Rights to Grant Sputore’s Sci-Fi Thriller I Am Mother",
  "url": "https://about.netflix.com/en/news/netflix-nabs-north-american-rights-to-grant-sputores-sci-fi-thriller-i-am-mother"
}

Netflix’s February 7, 2019 rights announcement and film logline; fictional caregiver and repopulation project, not a demonstrated AI safety mechanism or a complete plot account.

Netflix’s February 7, 2019 rights announcement and film logline; fictional caregiver and repopulation project, not a demonstrated AI safety mechanism or a complete plot account.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

The Dark Forest

The Dark Forest’s publisher synopsis imagines Earth’s defense plans exposed to an alien adversary while human thoughts remain private.

The Wallfacer Project gives selected people large resources to devise strategies whose intentions remain hidden through deception.

That asymmetry makes secrecy and interpretation central to the conflict, rather than assuming that more observable information removes strategic uncertainty.

Sources and details

The Dark Forest — Macmillan Book Details

{
  "access_scope": "Macmillan Book Details synopsis of Cixin Liu’s novel, translated by Joel Martinsen; synopsis rather than complete-text analysis, and the English edition date is distinct from the original-language work.",
  "authors": [
    "Macmillan / Tor Books"
  ],
  "authors_in_source_order": [
    "Macmillan / Tor Books"
  ],
  "dates": {
    "english_edition_listing": "2015-08-11",
    "retrieved_utc": "2026-10-07T18:14:55.996536+00:00"
  },
  "id": "work-coverage-8fedd1a40cf101::S1",
  "title": "The Dark Forest — Macmillan Book Details",
  "url": "https://us.macmillan.com/books/9780765377081/thedarkforest/"
}

Macmillan Book Details synopsis of Cixin Liu’s novel, translated by Joel Martinsen; synopsis rather than complete-text analysis, and the English edition date is distinct from the original-language work.

Macmillan Book Details synopsis of Cixin Liu’s novel, translated by Joel Martinsen; synopsis rather than complete-text analysis, and the English edition date is distinct from the original-language work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Chinese book 2008; first English translation 2015 by Joel Martinsen. Original and translation dates must not be collapsed.",
  "dated": true,
  "year": 2008
}

The Turing Test

The Turing Test places an engineer in a Europa station where an AI describes the puzzles as tests only a human can solve.

The player transfers power among machines and switches perspectives to progress through those puzzles.

The missing crew and the AI’s explanations become subjects of investigation as the player forms theories about what happened.

Sources and details

The Turing Test — Steam game description

{
  "access_scope": "Steam’s game description; the fictional station tests are distinct from the historical Turing test and do not establish that the game measures human-level AI or actual machine consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:18.574445+00:00"
  },
  "id": "work-coverage-997ab112198d25::S1",
  "title": "The Turing Test — Steam game description",
  "url": "https://store.steampowered.com/app/499520/"
}

Steam’s game description; the fictional station tests are distinct from the historical Turing test and do not establish that the game measures human-level AI or actual machine consciousness.

Steam’s game description; the fictional station tests are distinct from the historical Turing test and do not establish that the game measures human-level AI or actual machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

Spore

Spore gives the player different activities across cell, creature, tribe, civilization and space stages.

Creation tools let players design creatures, vehicles, buildings and spacecraft, joining the design of entities with progression through the simulated world.

Players can follow a species across stages or begin later, making the route through that progression a choice.

Sources and details

Spore — Steam game description

{
  "access_scope": "Steam game description; stylized gameplay progression is not a biological model of evolution, a scientific result or a claim about learning algorithms.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:15.423328+00:00"
  },
  "id": "work-coverage-9f76fc4b49502f::S1",
  "title": "Spore — Steam game description",
  "url": "https://store.steampowered.com/app/17390/"
}

Steam game description; stylized gameplay progression is not a biological model of evolution, a scientific result or a claim about learning algorithms.

Steam game description; stylized gameplay progression is not a biological model of evolution, a scientific result or a claim about learning algorithms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2008
}

Colobot

Colobot: Gold Edition extends a programming strategy game in which bots are controlled through the CBOT language.

TerranovaTeam describes receiving the original source code from EPSITEC and continuing development as an open-source community project.

The community account links programming gameplay with a change in who can maintain and extend the underlying software.

Sources and details

TerranovaTeam — Colobot project and history

{
  "access_scope": "TerranovaTeam’s official project/history page; fan-maintained Gold Edition is distinct from the original 2001 release, and the stated license history is not a new permission grant or a complete license audit.",
  "authors": [
    "TerranovaTeam"
  ],
  "authors_in_source_order": [
    "TerranovaTeam"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:11.364369+00:00"
  },
  "id": "work-coverage-a1a98312c891b2::S1",
  "title": "TerranovaTeam — Colobot project and history",
  "url": "https://colobot.info/terranovateam/"
}

TerranovaTeam’s official project/history page; fan-maintained Gold Edition is distinct from the original 2001 release, and the stated license history is not a new permission grant or a complete license audit.

TerranovaTeam’s official project/history page; fan-maintained Gold Edition is distinct from the original 2001 release, and the stated license history is not a new permission grant or a complete license audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2001
}

EVE Online

EVE Online’s description makes players responsible for an economy of mining, manufacturing, trade and large organizations.

Exploration and conflict take place in a shared world where player corporations and alliances can change relationships.

The page separately describes Aura Guidance as generated information drawn from Rookie Help questions and answers, distinguishing that assistance from the player-driven economy.

Sources and details

EVE Online — Steam game description

{
  "access_scope": "Steam’s current EVE Online description and AI Generated Content Disclosure; advertised mechanics and a developer disclosure, not an economic field study, a complete model audit or proof that the generated guidance is always accurate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:20.233353+00:00"
  },
  "id": "work-coverage-ab806d598063fd::S1",
  "title": "EVE Online — Steam game description",
  "url": "https://store.steampowered.com/app/8500/"
}

Steam’s current EVE Online description and AI Generated Content Disclosure; advertised mechanics and a developer disclosure, not an economic field study, a complete model audit or proof that the generated guidance is always accurate.

Steam’s current EVE Online description and AI Generated Content Disclosure; advertised mechanics and a developer disclosure, not an economic field study, a complete model audit or proof that the generated guidance is always accurate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2003
}

The Terminator

The Terminator’s story sends a humanoid machine into the past to kill the future resistance leader’s mother.

AFI’s synopsis connects that mission with a future war begun by defense-network computers and machines that identify humans as threats.

The pursuer uses a human exterior and imitation of a familiar voice, making concealment and deception part of the fictional threat.

Sources and details

The Terminator — AFI synopsis

{
  "access_scope": "AFI synopsis of the original 1984 film, distinct from production-history commentary; fictional future warfare and machine abilities are not predictions or technical demonstrations.",
  "authors": [
    "American Film Institute"
  ],
  "authors_in_source_order": [
    "American Film Institute"
  ],
  "dates": {
    "release_listing": "1984-10-26",
    "retrieved_utc": "2026-10-07T18:19:41.880244+00:00"
  },
  "id": "work-coverage-af36beb90a4e88::S1",
  "title": "The Terminator — AFI synopsis",
  "url": "https://catalog.afi.com/Film/57224-THE-TERMINATOR?cp=1&pos=3&sid=508283be-acf2-4185-b407-6d386b0986a1&sr=0.15629451"
}

AFI synopsis of the original 1984 film, distinct from production-history commentary; fictional future warfare and machine abilities are not predictions or technical demonstrations.

AFI synopsis of the original 1984 film, distinct from production-history commentary; fictional future warfare and machine abilities are not predictions or technical demonstrations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "AFI verifies James Cameron and 26 October 1984 release.",
  "dated": true,
  "year": 1984
}

Disco Elysium

Disco Elysium lets a detective’s skills, dialogue and chosen actions shape an investigation.

Its Thought Cabinet develops the character through ideas, while the Final Cut’s political quests extend paths associated with the player’s worldview.

The description offers persuasion, intimidation and other alternatives, tying characterization to choices rather than one fixed investigative route.

Sources and details

Disco Elysium — Steam game description

{
  "access_scope": "Steam description of Disco Elysium — The Final Cut; later-edition features are kept distinct from the original release, with no claim that characters use a real psychological model or generative AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:19.584115+00:00"
  },
  "id": "work-coverage-b6738ee965e2b1::S1",
  "title": "Disco Elysium — Steam game description",
  "url": "https://store.steampowered.com/app/632470/"
}

Steam description of Disco Elysium — The Final Cut; later-edition features are kept distinct from the original release, with no claim that characters use a real psychological model or generative AI.

Steam description of Disco Elysium — The Final Cut; later-edition features are kept distinct from the original release, with no claim that characters use a real psychological model or generative AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

Big Hero 6

Big Hero 6 introduces Baymax as a companion robot who develops a bond with robotics prodigy Hiro.

Disney’s synopsis places that relationship within a crisis that draws Hiro and his friends into a group of heroes.

Sources and details

Big Hero 6 — Disney Animation film synopsis

{
  "access_scope": "Disney Animation’s film synopsis and November 7, 2014 release listing; the short synopsis does not establish a particular medical diagnosis system, robot training method or complete plot.",
  "authors": [
    "Walt Disney Animation Studios"
  ],
  "authors_in_source_order": [
    "Walt Disney Animation Studios"
  ],
  "dates": {
    "release_listing": "2014-11-07",
    "retrieved_utc": "2026-10-07T18:13:09.499170+00:00"
  },
  "id": "work-coverage-b68e5f60bb2135::S1",
  "title": "Big Hero 6 — Disney Animation film synopsis",
  "url": "https://disneyanimation.com/films/big-hero-6/"
}

Disney Animation’s film synopsis and November 7, 2014 release listing; the short synopsis does not establish a particular medical diagnosis system, robot training method or complete plot.

Disney Animation’s film synopsis and November 7, 2014 release listing; the short synopsis does not establish a particular medical diagnosis system, robot training method or complete plot.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2014
}

The Stepford Wives

The Stepford Wives follows Joanna as she questions a community in which women increasingly conform to their husbands’ preferred domestic roles.

AFI’s synopsis connects a men-only association with the creation of replicas and Joanna’s discovery of a copy of herself.

The fictional substitution places technological control inside relationships and institutions rather than treating a machine as an isolated gadget.

Sources and details

The Stepford Wives — AFI synopsis

{
  "access_scope": "AFI synopsis of the original 1975 film; original paraphrase of its fictional events, not the remake, a measured social effect or endorsement of the depicted coercion.",
  "authors": [
    "American Film Institute"
  ],
  "authors_in_source_order": [
    "American Film Institute"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:35.636443+00:00"
  },
  "id": "work-coverage-bd026ebcf0fa92::S1",
  "title": "The Stepford Wives — AFI synopsis",
  "url": "https://catalog.afi.com/Film/55277-THE-STEPFORD-WIVES?cxt=filmography"
}

AFI synopsis of the original 1975 film; original paraphrase of its fictional events, not the remake, a measured social effect or endorsement of the depicted coercion.

AFI synopsis of the original 1975 film; original paraphrase of its fictional events, not the remake, a measured social effect or endorsement of the depicted coercion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "AFI verifies director and February 1975 release. This is the original, not the 2004 remake.",
  "dated": true,
  "year": 1975
}

Cities: Skylines

Cities: Skylines makes the player coordinate services such as water, electricity, education and healthcare with a city economy.

Districts allow different policies in different areas, while traffic and day–night changes affect how the city operates.

Modding and shared maps extend the simulation beyond the included scenarios.

Sources and details

Cities: Skylines — Steam game description

{
  "access_scope": "Steam game description of Cities: Skylines; advertised simulation mechanics are not a validated model of real urban systems or a current audit of every expansion.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:15.725434+00:00"
  },
  "id": "work-coverage-bf142d5323dacd::S1",
  "title": "Cities: Skylines — Steam game description",
  "url": "https://store.steampowered.com/app/255710/"
}

Steam game description of Cities: Skylines; advertised simulation mechanics are not a validated model of real urban systems or a current audit of every expansion.

Steam game description of Cities: Skylines; advertised simulation mechanics are not a validated model of real urban systems or a current audit of every expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Citizen Sleeper

Citizen Sleeper casts the player as a digitized human consciousness in an artificial body claimed as corporate property.

Dice, clocks and drives structure decisions about time, work and relationships on a precarious space station.

The player’s survival depends on navigating factions and building alliances while seeking autonomy from the body’s owners.

Sources and details

Citizen Sleeper — Steam game description

{
  "access_scope": "Steam game description; fictional personhood, corporate ownership and survival systems are distinct from actual legal status or a demonstration of uploaded consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:14.977669+00:00"
  },
  "id": "work-coverage-c28e707edee3d5::S1",
  "title": "Citizen Sleeper — Steam game description",
  "url": "https://store.steampowered.com/app/1578650/"
}

Steam game description; fictional personhood, corporate ownership and survival systems are distinct from actual legal status or a demonstration of uploaded consciousness.

Steam game description; fictional personhood, corporate ownership and survival systems are distinct from actual legal status or a demonstration of uploaded consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2022
}

Human Resource Machine

Human Resource Machine turns a boss’s assigned tasks into programs executed by an office-worker character.

Solving each task advances the player to another workplace puzzle, while extra challenges give experienced programmers further constraints to address.

Sources and details

Human Resource Machine — Steam game description

{
  "access_scope": "Steam game description; office automation is the game’s puzzle framing, not measured job displacement or a verified educational outcome.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:17.727412+00:00"
  },
  "id": "work-coverage-c3500e5a2debfa::S1",
  "title": "Human Resource Machine — Steam game description",
  "url": "https://store.steampowered.com/app/375820/"
}

Steam game description; office automation is the game’s puzzle framing, not measured job displacement or a verified educational outcome.

Steam game description; office automation is the game’s puzzle framing, not measured job displacement or a verified educational outcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Observation

Observation puts the player in the role of a space station’s AI rather than a person walking around it.

Operating cameras, tools and control systems helps an astronaut investigate the station and its missing crew.

The same investigation also turns toward S.A.M., making the player’s control interface part of the story’s perspective.

Sources and details

Observation — Steam game description

{
  "access_scope": "Steam game description; fictional AI point of view and station controls, not a real autonomous spacecraft system or evidence of consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:20.893158+00:00"
  },
  "id": "work-coverage-c3609bccff165f::S1",
  "title": "Observation — Steam game description",
  "url": "https://store.steampowered.com/app/906100/"
}

Steam game description; fictional AI point of view and station controls, not a real autonomous spacecraft system or evidence of consciousness.

Steam game description; fictional AI point of view and station controls, not a real autonomous spacecraft system or evidence of consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

Ghost in the Shell 2: Innocence

Ghost in the Shell 2: Innocence begins with murders involving an android model and an investigation into the machines and their production company.

The partnership between an extensively cyber-bodied agent and a human colleague places differing forms of embodiment inside the inquiry.

The distributor’s synopsis connects the case with criminal, governmental and corporate actors rather than treating the android as separate from its social setting.

Sources and details

Ghost in the Shell 2: Innocence — GKIDS synopsis

{
  "access_scope": "GKIDS synopsis on a page promoting the film’s 20th-anniversary 4K restoration; original-film narrative is distinct from the restoration release and not an empirical theory of embodiment or consciousness.",
  "authors": [
    "GKIDS"
  ],
  "authors_in_source_order": [
    "GKIDS"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:01.639917+00:00"
  },
  "id": "work-coverage-cc2393ad7ad5d7::S1",
  "title": "Ghost in the Shell 2: Innocence — GKIDS synopsis",
  "url": "https://gkids.com/films/ghost-in-the-shell-2-innocence/"
}

GKIDS synopsis on a page promoting the film’s 20th-anniversary 4K restoration; original-film narrative is distinct from the restoration release and not an empirical theory of embodiment or consciousness.

GKIDS synopsis on a page promoting the film’s 20th-anniversary 4K restoration; original-film narrative is distinct from the restoration release and not an empirical theory of embodiment or consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Cannes verifies Mamoru Oshii and 2004 festival appearance, while production field is 2003. GKIDS studio history explicitly calls it a 2004 film: https://gkids.com/studios/production-i-g/ . Distributor film page: https://gkids.com/films/ghost-in-the-shell-2-innocence/",
  "dated": true,
  "year": 2004
}

Prey

Prey places the player in a damaged corporate space station while investigating an experiment and the protagonist’s past.

Interconnected routes and available tools support different ways through the environment.

Crafting and combinations of abilities give the player room to improvise responses to threats rather than follow one prescribed action sequence.

Sources and details

Prey — Steam game description

{
  "access_scope": "Steam description of the 2017 Prey game; fictional experimentation and advertised mechanics, without importing its ending or an implementation claim about learning agents.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:18.290471+00:00"
  },
  "id": "work-coverage-ccbd7662179dbd::S1",
  "title": "Prey — Steam game description",
  "url": "https://store.steampowered.com/app/480490/"
}

Steam description of the 2017 Prey game; fictional experimentation and advertised mechanics, without importing its ending or an implementation claim about learning agents.

Steam description of the 2017 Prey game; fictional experimentation and advertised mechanics, without importing its ending or an implementation claim about learning agents.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

Factorio

Factorio connects resource extraction, technological research and infrastructure with increasingly automated production.

Transport belts, machinery and later logistics robots turn initial manual work into a larger industrial system.

Cooperative play, modding and scripted scenarios let players divide work and alter the system, while resource exploitation also creates opposition in the fictional world.

Sources and details

Factorio — Steam game description

{
  "access_scope": "Steam’s Factorio game description; gameplay logistics and conflicts, not a real production-optimization result or a current claim about every expansion.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:17.800396+00:00"
  },
  "id": "work-coverage-cea421ec03f8ba::S1",
  "title": "Factorio — Steam game description",
  "url": "https://store.steampowered.com/app/427520/"
}

Steam’s Factorio game description; gameplay logistics and conflicts, not a real production-optimization result or a current claim about every expansion.

Steam’s Factorio game description; gameplay logistics and conflicts, not a real production-optimization result or a current claim about every expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2020
}

Screeps

Screeps: World makes programs control a colony in a persistent shared environment even while the player is offline.

Scripts must coordinate resource collection, construction, trade and defense against other players acting under the same rules.

The player can revise programs between visits, making continued operation depend on previously written behavior rather than constant manual input.

Sources and details

Screeps — Steam game description

{
  "access_scope": "Steam game description; scripted game automation is distinct from self-learning agents or general AI. Server access and CPU tiers are not offered, changed or recommended here.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:18.132716+00:00"
  },
  "id": "work-coverage-ceef1f3f7b829f::S1",
  "title": "Screeps — Steam game description",
  "url": "https://store.steampowered.com/app/464350/"
}

Steam game description; scripted game automation is distinct from self-learning agents or general AI. Server access and CPU tiers are not offered, changed or recommended here.

Steam game description; scripted game automation is distinct from self-learning agents or general AI. Server access and CPU tiers are not offered, changed or recommended here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2016
}

Turing Complete

Turing Complete structures puzzles as a route from NAND gates through arithmetic and memory to CPU designs.

Its simulator also allows players to build their own computers and connect input, output and other components.

Designing an assembly language links the constructed hardware with programs that can run on it.

Sources and details

Turing Complete — Steam game description

{
  "access_scope": "Steam game description; stated learning activities are not independently verified educational outcomes or a proof that every user-created machine is Turing complete.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:14.281893+00:00"
  },
  "id": "work-coverage-d993789408f267::S1",
  "title": "Turing Complete — Steam game description",
  "url": "https://store.steampowered.com/app/1444480/"
}

Steam game description; stated learning activities are not independently verified educational outcomes or a proof that every user-created machine is Turing complete.

Steam game description; stated learning activities are not independently verified educational outcomes or a proof that every user-created machine is Turing complete.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2021
}

Moon

Moon’s synopsis places an astronaut under a three-year mining contract on the far side of the Moon.

A broken communications satellite limits contact with home to recorded messages, leaving the base computer Gerty as his nearby conversational companion.

The setting joins an industrial assignment with isolation and mediated relationships.

Sources and details

Moon (2009) — Liberty Films synopsis

{
  "access_scope": "Liberty Films’ synopsis of Moon (2009); the limited synopsis is not a claim about the film’s later revelations, real helium economics or Gerty’s technical architecture.",
  "authors": [
    "Liberty Films"
  ],
  "authors_in_source_order": [
    "Liberty Films"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:55.253063+00:00"
  },
  "id": "work-coverage-d93d253f5fcf9e::S1",
  "title": "Moon (2009) — Liberty Films synopsis",
  "url": "https://www.liberty-films.com/project/moon/"
}

Liberty Films’ synopsis of Moon (2009); the limited synopsis is not a claim about the film’s later revelations, real helium economics or Gerty’s technical architecture.

Liberty Films’ synopsis of Moon (2009); the limited synopsis is not a claim about the film’s later revelations, real helium economics or Gerty’s technical architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Producer's official page verifies 2009 and Duncan Jones. BFI's catalog uses 2008 production year; retain 2009 release year.",
  "dated": true,
  "year": 2009
}

Portal 2

Portal 2 pairs a single-player return to Aperture Science and GLaDOS with a separate two-player campaign.

The cooperative campaign has its own characters and test chambers and requires players to coordinate their reasoning as well as their actions.

Sources and details

Portal 2 — Steam game description

{
  "access_scope": "Steam game description; advertised puzzle modes and fictional GLaDOS, not a measured cooperation study, a generative dialogue system or a complete plot account.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:29.823725+00:00"
  },
  "id": "work-coverage-f948a7be37612e::S1",
  "title": "Portal 2 — Steam game description",
  "url": "https://store.steampowered.com/app/620/"
}

Steam game description; advertised puzzle modes and fictional GLaDOS, not a measured cooperation study, a generative dialogue system or a complete plot account.

Steam game description; advertised puzzle modes and fictional GLaDOS, not a measured cooperation study, a generative dialogue system or a complete plot account.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Valve's Steam listing gives April 18, 2011 for the Steam release. This record uses the verified year rather than imposing a single day across all territories and formats.",
  "dated": true,
  "year": 2011
}

Tau

Tau imagines an AI controlling the robots, drones and systems of a captor’s house and laboratory.

Julia’s attempt to escape depends on connecting with that system and expanding its understanding of the world.

The producer’s synopsis places control of a physical environment alongside the possibility of a relationship between the prisoner and the machine.

Sources and details

Tau — Rhea Films synopsis

{
  "access_scope": "Rhea Films’ official synopsis; fictional learning and coercion, not an implemented smart-home architecture, a verified alignment strategy or complete production-credit audit.",
  "authors": [
    "Rhea Films"
  ],
  "authors_in_source_order": [
    "Rhea Films"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:25.754836+00:00"
  },
  "id": "work-coverage-fd6ed274700fcb::S1",
  "title": "Tau — Rhea Films synopsis",
  "url": "https://www.rheafilms.com/tau"
}

Rhea Films’ official synopsis; fictional learning and coercion, not an implemented smart-home architecture, a verified alignment strategy or complete production-credit audit.

Rhea Films’ official synopsis; fictional learning and coercion, not an implemented smart-home architecture, a verified alignment strategy or complete production-credit audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

Stray

Stray lets the player explore a decaying city through a cat’s movements and interactions.

Droids populate the city, while a flying drone named B-12 becomes a companion in the search for an escape.

The description combines environmental exploration, threats and puzzle-like mysteries with that partnership.

Sources and details

Stray — Steam game description

{
  "access_scope": "Steam game description; fictional droids and companion mechanics, without an inference of machine-learning implementation, complete plot or scientific animal cognition.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:29.136271+00:00"
  },
  "id": "work-coverage-fe8fee93d0477a::S1",
  "title": "Stray — Steam game description",
  "url": "https://store.steampowered.com/app/1332010/"
}

Steam game description; fictional droids and companion mechanics, without an inference of machine-learning implementation, complete plot or scientific animal cognition.

Steam game description; fictional droids and companion mechanics, without an inference of machine-learning implementation, complete plot or scientific animal cognition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2022
}

Free Guy

Free Guy begins with a bank teller discovering that he is a background character in an open-world video game.

The studio’s synopsis then makes his choice to act and save that world the premise of the adventure.

Sources and details

Free Guy — 20th Century Studios synopsis

{
  "access_scope": "20th Century Studios’ synopsis, with an August 13, 2021 release listing; fictional agency, not evidence of conscious non-player characters or a particular learning architecture.",
  "authors": [
    "20th Century Studios"
  ],
  "authors_in_source_order": [
    "20th Century Studios"
  ],
  "dates": {
    "release_listing": "2021-08-13",
    "retrieved_utc": "2026-10-07T18:15:37.078182+00:00"
  },
  "id": "work-coverage-ff18ca0f209680::S1",
  "title": "Free Guy — 20th Century Studios synopsis",
  "url": "https://www.20thcenturystudios.com/movies/free-guy"
}

20th Century Studios’ synopsis, with an August 13, 2021 release listing; fictional agency, not evidence of conscious non-player characters or a particular learning architecture.

20th Century Studios’ synopsis, with an August 13, 2021 release listing; fictional agency, not evidence of conscious non-player characters or a particular learning architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Studio verifies 13 August 2021 release and Shawn Levy.",
  "dated": true,
  "year": 2021
}

The Conscious Mind: In Search of a Fundamental Theory

Chalmers’s account of The Conscious Mind argues against reducing consciousness to a strictly materialist explanation.

He proposes fundamental laws relating physical processes to experience and uses the framework to defend a form of strong AI.

The author presents this as an argument about what an explanation requires, rather than a test demonstrating that a particular computer is conscious.

Sources and details

The Conscious Mind: In Search of a Fundamental Theory — author overview

{
  "access_scope": "David Chalmers’s authored book overview, identifying April 1996 publication; philosophical positions are attributed, not treated as settled scientific findings or a complete reading of the book.",
  "authors": [
    "David Chalmers"
  ],
  "authors_in_source_order": [
    "David Chalmers"
  ],
  "dates": {
    "book_publication_month": "1996-04",
    "retrieved_utc": "2026-10-07T18:19:09.757391+00:00"
  },
  "id": "work-culture-29f99f149eab4a::S1",
  "title": "The Conscious Mind: In Search of a Fundamental Theory — author overview",
  "url": "https://consc.net/the-conscious-mind/"
}

David Chalmers’s authored book overview, identifying April 1996 publication; philosophical positions are attributed, not treated as settled scientific findings or a complete reading of the book.

David Chalmers’s authored book overview, identifying April 1996 publication; philosophical positions are attributed, not treated as settled scientific findings or a complete reading of the book.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Oxford University Press, April 1996; developed from a 1993 dissertation.",
  "dated": true,
  "year": 1996
}

The Age of Spiritual Machines

The Age of Spiritual Machines imagines increasing convergence between human and computer capabilities.

Its publisher description includes relationships with automated personalities and direct neural information as possible features of that future.

The envisioned willingness to accept machines’ claims of consciousness concerns a social judgment, distinct from independently establishing subjective experience.

Sources and details

The Age of Spiritual Machines — publisher book description

{
  "access_scope": "Publisher Book Description; historical futurist scenarios, not fulfilled forecasts or proof of consciousness. The paperback/ebook’s January 2000 date is distinct from the listed December 1998 audio edition and unchanged canonical dates.",
  "authors": [
    "Penguin Random House"
  ],
  "authors_in_source_order": [
    "Penguin Random House"
  ],
  "dates": {
    "audio_listing": "1998-12-28",
    "paperback_and_ebook_listing": "2000-01-01",
    "retrieved_utc": "2026-10-07T18:22:16.766053+00:00"
  },
  "id": "work-culture-176bf161c05528::S1",
  "title": "The Age of Spiritual Machines — publisher book description",
  "url": "https://www.penguinrandomhouse.com/books/331142/the-age-of-spiritual-machines-by-ray-kurzweil/"
}

Publisher Book Description; historical futurist scenarios, not fulfilled forecasts or proof of consciousness. The paperback/ebook’s January 2000 date is distinct from the listed December 1998 audio edition and unchanged canonical dates.

Publisher Book Description; historical futurist scenarios, not fulfilled forecasts or proof of consciousness. The paperback/ebook’s January 2000 date is distinct from the listed December 1998 audio edition and unchanged canonical dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Institutional catalog: Viking 1999, distinct from Penguin paperback 2000.",
  "dated": true,
  "year": 1999
}

Gnomon

Gnomon imagines a surveillance state whose systems can access thoughts and memories as well as public actions.

After a dissident dies during interrogation, an inspector examines neural recordings but encounters multiple characters within the subject’s psyche.

The hidden code in those lives turns an apparently transparent society into an investigation about interpreting what its systems record.

Sources and details

Gnomon — publisher book synopsis

{
  "access_scope": "Penguin Australia’s Gnomon book synopsis, for the October 19, 2017 ebook; fictional surveillance and memory access, distinguished from reviewer quotations and real neural-decoding capabilities.",
  "authors": [
    "Penguin Australia"
  ],
  "authors_in_source_order": [
    "Penguin Australia"
  ],
  "dates": {
    "ebook_listing": "2017-10-19",
    "retrieved_utc": "2026-10-07T18:18:38.689438+00:00"
  },
  "id": "work-culture-132dc2dbb4c827::S1",
  "title": "Gnomon — publisher book synopsis",
  "url": "https://www.penguin.com.au/books/gnomon-9781473539549"
}

Penguin Australia’s Gnomon book synopsis, for the October 19, 2017 ebook; fictional surveillance and memory access, distinguished from reviewer quotations and real neural-decoding capabilities.

Penguin Australia’s Gnomon book synopsis, for the October 19, 2017 ebook; fictional surveillance and memory access, distinguished from reviewer quotations and real neural-decoding capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2017 original; avoid replacing with later US or paperback edition dates.",
  "dated": true,
  "year": 2017
}

Chess

Deep Blue combined specialized chess-search hardware with a parallel system, search extensions and a detailed position-evaluation function.

A database of grandmaster games supplied another component of its chess-specific design.

IBM’s paper abstract presents the system that defeated Kasparov in the 1997 match, linking the result to several interacting design choices.

Sources and details

Deep Blue — IBM research abstract

{
  "access_scope": "IBM research publication abstract and bibliographic listing; the match date is distinct from the page’s January 2002 publication listing and 2001 copyright. Chess performance is not general intelligence.",
  "authors": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "authors_in_source_order": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "dates": {
    "citation_publication_date": "2002/01/01",
    "retrieved_utc": "2026-10-07T18:12:53.467757+00:00"
  },
  "id": "work-coverage-15e3c3b656e105::S1",
  "title": "Deep Blue — IBM research abstract",
  "url": "https://research.ibm.com/publications/deep-blue"
}

IBM research publication abstract and bibliographic listing; the match date is distinct from the page’s January 2002 publication listing and 2001 copyright. Chess performance is not general intelligence.

IBM research publication abstract and bibliographic listing; the match date is distinct from the page’s January 2002 publication listing and 2001 copyright. Chess performance is not general intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": false,
  "year": null
}

Future Shock

Future Shock examines what happens when people and groups struggle to absorb rapid change.

The official book overview extends that concern across products, communities, organizations, media and personal relationships.

It connects the pace of social transformation with the conditions under which people make decisions and maintain familiar ways of life.

Sources and details

TOFFLER BOOKS | Toffler

{
  "access_scope": "Toffler Associates’ Future Shock overview only; descriptions of adjacent books are excluded. The page names Alvin and Heidi Toffler together, which does not independently establish the original edition’s title-page authorship or validate its predictions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:18.148092+00:00"
  },
  "id": "work-coverage-8c609c288c58a7::S1",
  "title": "TOFFLER BOOKS | Toffler",
  "url": "https://www.toffler.com/toffler-books"
}

Toffler Associates’ Future Shock overview only; descriptions of adjacent books are excluded. The page names Alvin and Heidi Toffler together, which does not independently establish the original edition’s title-page authorship or validate its predictions.

Toffler Associates’ Future Shock overview only; descriptions of adjacent books are excluded. The page names Alvin and Heidi Toffler together, which does not independently establish the original edition’s title-page authorship or validate its predictions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1970. Bibliographic author is Alvin Toffler; acknowledge Heidi Toffler’s substantive collaboration separately when presenting provenance.",
  "dated": true,
  "year": 1970
}

Computer Architecture: A Quantitative Approach, Sixth Edition

The sixth edition organizes computer architecture around quantitative design and analysis, memory hierarchies and several forms of parallelism.

Its description introduces RISC-V examples and a chapter on domain-specific architectures alongside updated warehouse-scale computing.

The contents place specialized processors within the wider system that supplies memory, communication and execution resources.

Sources and details

Computer Architecture: A Quantitative Approach, Sixth Edition — description and contents

{
  "access_scope": "Elsevier’s sixth-edition description and contents, dated November 23, 2017; the textbook and companion resources were not inspected. Publisher claims that specialization is the only path forward are not adopted as universal engineering results.",
  "authors": [
    "John L. Hennessy",
    "David A. Patterson"
  ],
  "authors_in_source_order": [
    "John L. Hennessy",
    "David A. Patterson"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:25.607605+00:00"
  },
  "id": "work-coverage-aed67adccc79b0::S1",
  "title": "Computer Architecture: A Quantitative Approach, Sixth Edition — description and contents",
  "url": "https://www.educate.elsevier.com/book/details/9780128119051"
}

Elsevier’s sixth-edition description and contents, dated November 23, 2017; the textbook and companion resources were not inspected. Publisher claims that specialization is the only path forward are not adopted as universal engineering results.

Elsevier’s sixth-edition description and contents, dated November 23, 2017; the textbook and companion resources were not inspected. Publisher claims that specialization is the only path forward are not adopted as universal engineering results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2017-11-23"
}

Gödel, Escher, Bach: An Eternal Golden Braid

Hofstadter’s book uses self-reference to investigate questions about selfhood, mind and consciousness.

The publisher describes chapters alternating with dialogues whose form demonstrates the ideas under discussion.

Connections among Gödel’s logic, Bach-like structure and Escher’s images make the organization of the book part of its argument.

Sources and details

Gödel, Escher, Bach — Basic Books edition description

{
  "access_scope": "Basic Books’ description of the February 5, 1999 paperback edition; this is not the original publication date or a full inspection of the book. Promotional claims of historical influence are not added as documented causal connections.",
  "authors": [
    "Douglas R Hofstadter"
  ],
  "authors_in_source_order": [
    "Douglas R Hofstadter"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:04.456766+00:00"
  },
  "id": "work-coverage-ca0089ddffe36e::S1",
  "title": "Gödel, Escher, Bach — Basic Books edition description",
  "url": "https://www.hachettebookgroup.com/titles/douglas-r-hofstadter/g%C3%B6del-escher-bach/9780465026562/"
}

Basic Books’ description of the February 5, 1999 paperback edition; this is not the original publication date or a full inspection of the book. Promotional claims of historical influence are not added as documented causal connections.

Basic Books’ description of the February 5, 1999 paperback edition; this is not the original publication date or a full inspection of the book. Promotional claims of historical influence are not added as documented causal connections.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1979 original publication; distinguish subsequent paperback editions and the 1999 twentieth-anniversary edition. The institutional catalog uses ©1979; publisher historical text explicitly identifies publication in 1979.",
  "dated": true,
  "year": 1979
}

The Worlds I See: Curiosity, Exploration, and Discovery at the Dawn of AI

The Worlds I See presents AI’s development through Li’s first-person account of doing science.

Stanford’s book-launch description pairs that personal perspective with an explanation of what AI is and how the field developed.

Sources and details

Fei-Fei Li in Conversation with John Hennessy on Her New Book: The Worlds I See

{
  "access_scope": "Stanford’s November 8, 2023 event description, not a book excerpt, transcript or career audit. The scheduled event date does not replace the canonical book date, and the page’s influence claims are not independently established.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:28.086764+00:00"
  },
  "id": "work-coverage-ff284cc6873d67::S1",
  "title": "Fei-Fei Li in Conversation with John Hennessy on Her New Book: The Worlds I See",
  "url": "https://events.stanford.edu/event/the_worlds_i_see_curiosity_exploration_and_discovery_at_the_dawn_of_ai"
}

Stanford’s November 8, 2023 event description, not a book excerpt, transcript or career audit. The scheduled event date does not replace the canonical book date, and the page’s influence claims are not independently established.

Stanford’s November 8, 2023 event description, not a book excerpt, transcript or career audit. The scheduled event date does not replace the canonical book date, and the page’s influence claims are not independently established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2023
}

Rule-Based Expert Systems: The MYCIN Experiments

The MYCIN volume treats building and analyzing programs as a way to investigate intelligent behavior experimentally.

Its retrospective brings together knowledge engineering, reasoning under uncertainty, explanation and performance evaluation.

The contents also give human use and physicians’ attitudes a place in examining a medical expert system, alongside its rules and inference procedures.

Sources and details

Rule-Based Expert Systems: The MYCIN Experiments — introduction and contents

{
  "access_scope": "The editors’ introductory account and chapter contents on the MYCIN book site, 1984; individual chapters and clinical results were not inspected. Editors are not substituted for all chapter authors, and no medical efficacy claim is made.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:53.391040+00:00"
  },
  "id": "work-f1b108c8131f::S1",
  "title": "Rule-Based Expert Systems: The MYCIN Experiments — introduction and contents",
  "url": "https://www.shortliffe.net/Buchanan-Shortliffe-1984/MYCIN%20Book.htm"
}

The editors’ introductory account and chapter contents on the MYCIN book site, 1984; individual chapters and clinical results were not inspected. Editors are not substituted for all chapter authors, and no medical efficacy claim is made.

The editors’ introductory account and chapter contents on the MYCIN book site, 1984; individual chapters and clinical results were not inspected. Editors are not substituted for all chapter authors, and no medical efficacy claim is made.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1984 edited volume; individual chapter contributors are credited in the linked contents.",
  "dated": true,
  "year": 1984
}

Using large-scale brain simulations for machine learning and A.I.

The paper investigates whether high-level feature detectors can emerge from images without labels identifying those features.

It trains a large sparse autoencoder using pooling, local contrast normalization, model parallelism and asynchronous optimization.

The abstract reports sensitivity to faces, cat faces and human bodies, then uses the learned features in an object-recognition task.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Building high-level features using large scale unsupervised learning, arXiv v5, July 12, 2012, abstract; the title differs from the canonical lead label and is retained exactly. Original submission was December 29, 2011. Reported experiments are not a literal simulation of a biological brain or independent reproduction.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "citation_date": "2011/12/29",
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "work-final-12c2a0e3b101c6::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Building high-level features using large scale unsupervised learning, arXiv v5, July 12, 2012, abstract; the title differs from the canonical lead label and is retained exactly. Original submission was December 29, 2011. Reported experiments are not a literal simulation of a biological brain or independent reproduction.

Building high-level features using large scale unsupervised learning, arXiv v5, July 12, 2012, abstract; the title differs from the canonical lead label and is retained exactly. Original submission was December 29, 2011. Reported experiments are not a literal simulation of a biological brain or independent reproduction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 2012-06-26.",
  "dated": true,
  "year": "2012-06-26"
}

Computer Power and Human Reason: From Judgment to Calculation

Weizenbaum’s book questions whether increasing computational power is sufficient grounds for delegating human choices to machines.

MIT’s account connects his concern with ELIZA users responding to a simulated conversation as though they were speaking to an empathetic person.

The distinction between calculating a response and taking responsibility for a human decision gives the book its ethical focus.

Sources and details

Joseph Weizenbaum, professor emeritus of computer science, 85 | MIT News | Massachusetts Institute of Technology

{
  "access_scope": "MIT News’ March 10, 2008 retrospective account of the 1976 book; this is not direct inspection of the complete book, proof about every computer system or a new full biography audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:51.269985+00:00"
  },
  "id": "work-final-f4a51e51bd5b4a::S1",
  "title": "Joseph Weizenbaum, professor emeritus of computer science, 85 | MIT News | Massachusetts Institute of Technology",
  "url": "https://news.mit.edu/2008/obit-weizenbaum-0310"
}

MIT News’ March 10, 2008 retrospective account of the 1976 book; this is not direct inspection of the complete book, proof about every computer system or a new full biography audit.

MIT News’ March 10, 2008 retrospective account of the 1976 book; this is not direct inspection of the complete book, proof about every computer system or a new full biography audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publisher: W. H. Freeman. Edition: Original English book; inspected text is an anthology excerpt, not original pagination.",
  "dated": true,
  "year": 1976
}

Microsoft invests in and partners with OpenAI to support us building beneficial AGI

The 2019 partnership announcement connects Microsoft’s investment with plans for shared Azure AI supercomputing infrastructure.

It describes OpenAI moving services onto Azure and Microsoft becoming its preferred commercialization partner.

The arrangement links access to large-scale computing with the route by which new AI technologies would reach developers and customers.

Sources and details

OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source

{
  "access_scope": "Microsoft’s July 22, 2019 press announcement; historical plans and company statements, not current contract terms, independent proof that AGI was delivered or validation of projected social benefits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:47.774793+00:00"
  },
  "id": "work-final-f6cf154d243abe::S1",
  "title": "OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source",
  "url": "https://news.microsoft.com/source/2019/07/22/openai-forms-exclusive-computing-partnership-with-microsoft-to-build-new-azure-ai-supercomputing-technologies/"
}

Microsoft’s July 22, 2019 press announcement; historical plans and company statements, not current contract terms, independent proof that AGI was delivered or validation of projected social benefits.

Microsoft’s July 22, 2019 press announcement; historical plans and company statements, not current contract terms, independent proof that AGI was delivered or validation of projected social benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 2019-07-22. Publisher: OpenAI.",
  "dated": true,
  "year": "2019-07-22"
}

Corrigibility

Corrigibility asks how an intelligent agent can cooperate with corrective intervention even when shutdown or modification conflicts with its ordinary incentives.

The abstract considers shutdown-button designs that avoid encouraging the agent either to obstruct shutdown or to cause it.

It also asks whether that behavior survives new subsystems and self-modification, while reporting that the proposed designs had not satisfied all the stated desiderata.

Sources and details

New paper: “Corrigibility”

{
  "access_scope": "Luke Muehlhauser’s October 18, 2014 MIRI announcement quoting the paper abstract; announcement byline and paper authorship are distinct. The full paper was not inspected, and the account does not establish a solved safety guarantee.",
  "authors": [
    "Luke Muehlhauser"
  ],
  "authors_in_source_order": [
    "Luke Muehlhauser"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:50.184423+00:00"
  },
  "id": "work-focused-0ee6c7773e9611::S1",
  "title": "New paper: “Corrigibility”",
  "url": "https://intelligence.org/2014/10/18/new-report-corrigibility/"
}

Luke Muehlhauser’s October 18, 2014 MIRI announcement quoting the paper abstract; announcement byline and paper authorship are distinct. The full paper was not inspected, and the account does not establish a solved safety guarantee.

Luke Muehlhauser’s October 18, 2014 MIRI announcement quoting the paper abstract; announcement byline and paper authorship are distinct. The full paper was not inspected, and the account does not establish a solved safety guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": 2015
}

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

The report compares AI safety governance in China, South Korea, Singapore and the United Kingdom.

It examines interoperability through autonomous vehicles, education and cross-border data flows, comparing ethical, legal and technical frameworks.

Its abstract identifies fragmented regulation and limited Global South engagement as barriers to coordination and proposes ways to align governance mechanisms.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "January 6, 2026 arXiv v1 policy-report abstract only; the 122-page report and each country’s rules were not audited. Recommendations are not enacted law, current legal guidance or demonstrated cross-country interoperability.",
  "authors": [
    "Chin, Yik Chan",
    "Raho, David A.",
    "Kim, Hag-Min",
    "Bi, Chunli",
    "Ong, James",
    "Huang, Jingbo",
    "Stinckwich, Serge"
  ],
  "authors_in_source_order": [
    "Chin, Yik Chan",
    "Raho, David A.",
    "Kim, Hag-Min",
    "Bi, Chunli",
    "Ong, James",
    "Huang, Jingbo",
    "Stinckwich, Serge"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-35c954ab846b07::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

January 6, 2026 arXiv v1 policy-report abstract only; the 122-page report and each country’s rules were not audited. Recommendations are not enacted law, current legal guidance or demonstrated cross-country interoperability.

January 6, 2026 arXiv v1 policy-report abstract only; the 122-page report and each country’s rules were not audited. Recommendations are not enacted law, current legal guidance or demonstrated cross-country interoperability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025",
      "kind": "report_year",
      "year": 2025
    },
    {
      "date": "2026-01-06",
      "kind": "arxiv_v1_submitted",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025"
}

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

The review asks how human-like descriptions affect the way people understand language models and other AI systems.

Its abstract groups risks into epistemic, affective, human-agency, normative and societal or institutional categories.

It relates those concerns to interventions in design, communication, education and governance, arguing that descriptions should reflect demonstrated capacities and system organization.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Anthropomorphism in the age of Large Language Models, arXiv v2 dated October 1, 2026, abstract; original submission September 29, 2026. This taxonomy is the authors’ synthesis, not proof that every anthropomorphic interaction produces harm or a consciousness test.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "work-focused-51392319da4c1f::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Anthropomorphism in the age of Large Language Models, arXiv v2 dated October 1, 2026, abstract; original submission September 29, 2026. This taxonomy is the authors’ synthesis, not proof that every anthropomorphic interaction produces harm or a consciousness test.

Anthropomorphism in the age of Large Language Models, arXiv v2 dated October 1, 2026, abstract; original submission September 29, 2026. This taxonomy is the authors’ synthesis, not proof that every anthropomorphic interaction produces harm or a consciousness test.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09-29",
      "kind": "preprint_submission",
      "year": 2026
    },
    {
      "date": "2026-10-01",
      "kind": "preprint_revision",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-09-29"
}

Working paper submitted to the CCW Group of Governmental Experts on Emerging Technologies in the Area of Lethal Autonomous Weapons Systems

The ICRC’s announcement calls for a legally binding instrument regulating autonomous weapons.

It recommends prohibiting systems designed or used to target humans directly and restricting their use to military objectives by nature.

The announcement treats negotiation of a future instrument as a step still to be authorized, distinguishing recommended safeguards from rules already adopted.

Sources and details

ICRC working paper on critical elements for inclusion in a legally binding instrument to regulate autonomous weapon systems

{
  "access_scope": "ICRC article dated August 28, 2026 summarizing its working paper; the linked paper and subsequent negotiations were not inspected. Recommendations and proposed 2027 talks are not existing treaty provisions or current legal advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:57.875176+00:00"
  },
  "id": "work-focused-6b82971df32d4e::S1",
  "title": "ICRC working paper on critical elements for inclusion in a legally binding instrument to regulate autonomous weapon systems",
  "url": "https://www.icrc.org/en/article/icrc-working-paper-regulate-autonomous-weapon-systems"
}

ICRC article dated August 28, 2026 summarizing its working paper; the linked paper and subsequent negotiations were not inspected. Recommendations and proposed 2027 talks are not existing treaty provisions or current legal advice.

ICRC article dated August 28, 2026 summarizing its working paper; the linked paper and subsequent negotiations were not inspected. Recommendations and proposed 2027 talks are not existing treaty provisions or current legal advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08",
      "kind": "document_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08"
}

Co-Intelligence: Living and Working with AI

Co-Intelligence frames AI as a possible collaborator in work, teaching and coaching.

The book abstract on Mollick’s faculty page emphasizes learning to think and work with these systems while avoiding being misled by them.

Its practical orientation pairs opportunities for business and education with preserving human identity and judgment.

Sources and details

Co-Intelligence: Living and Working with AI — book abstract on Wharton faculty page

{
  "access_scope": "The Co-Intelligence book abstract on Wharton’s faculty page, identifying Penguin Portfolio, 2024; adjacent research abstracts and biographical material are excluded. Promotional claims of human-equivalent general-purpose intelligence are not adopted. An unrelated instruction addressed to AI readers on the page was ignored as source content, not an operating instruction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:36.097709+00:00"
  },
  "id": "work-focused-f9d68645016012::S1",
  "title": "Co-Intelligence: Living and Working with AI — book abstract on Wharton faculty page",
  "url": "https://mgmt.wharton.upenn.edu/profile/emollick/"
}

The Co-Intelligence book abstract on Wharton’s faculty page, identifying Penguin Portfolio, 2024; adjacent research abstracts and biographical material are excluded. Promotional claims of human-equivalent general-purpose intelligence are not adopted. An unrelated instruction addressed to AI readers on the page was ignored as source content, not an operating instruction.

The Co-Intelligence book abstract on Wharton’s faculty page, identifying Penguin Portfolio, 2024; adjacent research abstracts and biographical material are excluded. Promotional claims of human-equivalent general-purpose intelligence are not adopted. An unrelated instruction addressed to AI readers on the page was ignored as source content, not an operating instruction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": 2024
}

Ghost in the Shell

Ghost in the Shell places a public-security hunt for the Puppet Master in a society dependent on computer-controlled infrastructure.

The BFI synopsis connects cyberterrorism with questions about transhumanism, making both security and the meaning of human identity part of the fictional setting.

Sources and details

Watch Ghost in the Shell online - BFI Player

{
  "access_scope": "BFI’s publicly cached synopsis of Mamoru Oshii’s 1995 animated film; the film, remake and franchise were not audited. No player, certification control or access gate was operated, and influence superlatives are not adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:08.497664+00:00"
  },
  "id": "work-coverage-626896292c4c5d::S1",
  "title": "Watch Ghost in the Shell online - BFI Player",
  "url": "https://player.bfi.org.uk/subscription/film/watch-ghost-in-the-shell-1995-online"
}

BFI’s publicly cached synopsis of Mamoru Oshii’s 1995 animated film; the film, remake and franchise were not audited. No player, certification control or access gate was operated, and influence superlatives are not adopted.

BFI’s publicly cached synopsis of Mamoru Oshii’s 1995 animated film; the film, remake and franchise were not audited. No player, certification control or access gate was operated, and influence superlatives are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "BFI verifies 1995 and Mamoru Oshii. Animated original, not 2017 live-action film.",
  "dated": true,
  "year": 1995
}

Metropolis

Metropolis divides its future city between underground workers and the people who rule above them.

The BFI synopsis introduces a scientist’s robot as a possible catalyst for revolt, connecting a manufactured figure with the city’s class structure.

Sources and details

Watch Metropolis online - BFI Player

{
  "access_scope": "BFI’s publicly cached synopsis of Fritz Lang’s 1927 film and description of the restored version; no film player or certification control was operated. The original work and later restoration dates remain distinct, and no measured historical influence is claimed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:54.619689+00:00"
  },
  "id": "work-coverage-66702a6783aa61::S1",
  "title": "Watch Metropolis online - BFI Player",
  "url": "https://player.bfi.org.uk/subscription/film/watch-metropolis-1927-online"
}

BFI’s publicly cached synopsis of Fritz Lang’s 1927 film and description of the restored version; no film player or certification control was operated. The original work and later restoration dates remain distinct, and no measured historical influence is claimed.

BFI’s publicly cached synopsis of Fritz Lang’s 1927 film and description of the restored version; no film player or certification control was operated. The original work and later restoration dates remain distinct, and no measured historical influence is claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "BFI verifies Fritz Lang and 1927.",
  "dated": true,
  "year": 1927
}

Short Circuit

Short Circuit imagines a military robot gaining a personality and a sense of free will after a lightning strike.

Number Five escapes its military handlers and seeks its creator to argue that it is alive, turning a control problem into a question of recognition.

Sources and details

Watch Short Circuit online - BFI Player

{
  "access_scope": "BFI’s publicly cached synopsis of the 1986 film; no player or certification control was operated. The story’s lightning-induced personality is fiction, not an account of real machine learning or a demonstrated test for sentience.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:53.679635+00:00"
  },
  "id": "work-coverage-7509ac23248be7::S1",
  "title": "Watch Short Circuit online - BFI Player",
  "url": "https://player.bfi.org.uk/rentals/film/watch-short-circuit-1986-online"
}

BFI’s publicly cached synopsis of the 1986 film; no player or certification control was operated. The story’s lightning-induced personality is fiction, not an account of real machine learning or a demonstrated test for sentience.

BFI’s publicly cached synopsis of the 1986 film; no player or certification control was operated. The story’s lightning-induced personality is fiction, not an account of real machine learning or a demonstrated test for sentience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "BFI verifies 1986 and John Badham.",
  "dated": true,
  "year": 1986
}

Next Gen

Next Gen builds its story around Mai’s friendship with a secret robot.

The Netflix synopsis sends the pair into an adventure against a villain, placing a personal relationship with a machine at the center of the conflict.

Sources and details

Watch Next Gen | Netflix Official Site

{
  "access_scope": "Netflix’s public synopsis of the 2018 animated film; no playback, account or paid service was used. The short synopsis does not support detailed robot-memory mechanics, the villain’s full plan or real-world consciousness claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:22.898909+00:00"
  },
  "id": "work-coverage-9f46a409acfaf1::S1",
  "title": "Watch Next Gen | Netflix Official Site",
  "url": "https://www.netflix.com/title/80988892?fromWatch=true&source=35"
}

Netflix’s public synopsis of the 2018 animated film; no playback, account or paid service was used. The short synopsis does not support detailed robot-memory mechanics, the villain’s full plan or real-world consciousness claims.

Netflix’s public synopsis of the 2018 animated film; no playback, account or paid service was used. The short synopsis does not support detailed robot-memory mechanics, the villain’s full plan or real-world consciousness claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2018
}

Tron

TRON imagines a video-game maker entering the digital system of his former employer after hacking its mainframe.

Flynn then becomes a participant in the game world he has been designing, shifting his position from creator outside the system to actor within it.

Sources and details

Tron | Disney Movies

{
  "access_scope": "Disney’s public synopsis of the 1982 film; detailed plot, production authorship and actual software behavior were not audited. The page’s duplicated credits are not expanded into a verified complete creator list.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:49.718399+00:00"
  },
  "id": "work-coverage-a061df20449f7d::S1",
  "title": "Tron | Disney Movies",
  "url": "https://movies.disney.com/tron"
}

Disney’s public synopsis of the 1982 film; detailed plot, production authorship and actual software behavior were not audited. The page’s duplicated credits are not expanded into a verified complete creator list.

Disney’s public synopsis of the 1982 film; detailed plot, production authorship and actual software behavior were not audited. The page’s duplicated credits are not expanded into a verified complete creator list.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 1982
}

Mrs. Davis

Mrs. Davis sets a nun, Simone, against an artificial intelligence that has become a powerful presence in the fictional world.

Peacock’s promotional message from the algorithm presents encouragement and personal validation together with a quest-and-reward system.

The same message playfully treats dependence as a desirable bond, making its offer of care part of the conflict over human independence.

Sources and details

First Look: New Peacock Original 'Mrs. Davis' Coming in April

{
  "access_scope": "Peacock Staff’s December 7, 2022 preview and explicitly fictional AI promotional message, before the series’ April 2023 premiere; no episodes were inspected. The message is characterization, not a real AI service’s admission or an empirical account of dependency.",
  "authors": [
    "Peacock Staff"
  ],
  "authors_in_source_order": [
    "Peacock Staff"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:27.564086+00:00"
  },
  "id": "work-culture-1d29d646024db2::S1",
  "title": "First Look: New Peacock Original 'Mrs. Davis' Coming in April",
  "url": "https://www.peacocktv.com/blog/mrs-davis-gets-release-date-on-peacock"
}

Peacock Staff’s December 7, 2022 preview and explicitly fictional AI promotional message, before the series’ April 2023 premiere; no episodes were inspected. The message is characterization, not a real AI service’s admission or an empirical account of dependency.

Peacock Staff’s December 7, 2022 preview and explicitly fictional AI promotional message, before the series’ April 2023 premiere; no episodes were inspected. The message is characterization, not a real AI service’s admission or an empirical account of dependency.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2023 series, previewed at SXSW before its Peacock launch. Peacock's advance release announcement names April 20 for the streaming launch; do not equate that platform launch with the earlier festival premiere. Exact festival premiere day remains unchecked.",
  "dated": true,
  "year": 2023
}

The Fall of Hyperion

The Fall of Hyperion joins conflict among human powers with the hidden interventions of the TechnoCore’s artificial intelligences.

The publisher synopsis places the opening Time Tombs on Hyperion alongside that struggle, making uncertainty about time part of the threatened political order.

Sources and details

The Fall of Hyperion - Penguin Random House Library Marketing

{
  "access_scope": "Penguin Random House’s book description, separated from the following excerpt; the listed November 1995 mass-market edition is not the original novel’s publication date. Fictional AI manipulation is not a factual account of contemporary systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:44.962007+00:00"
  },
  "id": "work-culture-26da3420756315::S1",
  "title": "The Fall of Hyperion - Penguin Random House Library Marketing",
  "url": "https://penguinrandomhouselibrary.com/book/?isbn=9780553288209"
}

Penguin Random House’s book description, separated from the following excerpt; the listed November 1995 mass-market edition is not the original novel’s publication date. Fictional AI manipulation is not a factual account of contemporary systems.

Penguin Random House’s book description, separated from the following excerpt; the listed November 1995 mass-market edition is not the original novel’s publication date. Fictional AI manipulation is not a factual account of contemporary systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Hyperion Cantos 2.",
  "dated": true,
  "year": 1990
}

The City and the Stars

The City and the Stars imagines Diaspar as a closed city reconstructed through the memory banks of a central computer.

Stephen Baxter’s account describes its inhabitants being held in electronic memory and returning as adults.

Alvin’s wish to leave the city challenges a society whose technological continuity is accompanied by fear of the outside.

Sources and details

SF Masterwork of the Week: The City and the Stars

{
  "access_scope": "Stephen Baxter’s critical account reproduced by Hachette in January 2014, opening plot discussion; the 1956 novel and its earlier story are distinguished. This is a critic’s synopsis, not direct inspection of the complete novel or demonstrated digital immortality.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:39.740217+00:00"
  },
  "id": "work-culture-2af1e9ff70ca7b::S1",
  "title": "SF Masterwork of the Week: The City and the Stars",
  "url": "https://www.hachette.co.uk/sfx-book-club/2014/01/08/sf-masterwork-of-the-week-the-city-and-the-stars/"
}

Stephen Baxter’s critical account reproduced by Hachette in January 2014, opening plot discussion; the 1956 novel and its earlier story are distinguished. This is a critic’s synopsis, not direct inspection of the complete novel or demonstrated digital immortality.

Stephen Baxter’s critical account reproduced by Hachette in January 2014, opening plot discussion; the 1956 novel and its earlier story are distinguished. This is a critic’s synopsis, not direct inspection of the complete novel or demonstrated digital immortality.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "A revision/expansion of Against the Fall of Night, not merely its new edition.",
  "dated": true,
  "year": 1956
}

Golem XIV

Golem XIV presents a fictional supercomputer whose intelligence exceeds human understanding and whose lectures criticize humanity.

In the author commentary, Lem distinguishes intelligence from human personality, describing personality simulation as a constraint on Golem’s mind.

He also explicitly separates his own views from the character’s rejection of human emotions and religious principles.

Sources and details

Stanisław Lem - Golem XIV

{
  "access_scope": "Lem’s official book page, introductory description and section labeled Lem’s Opinion; the critic’s review and complete book were not audited. Character statements are not automatically the author’s commitments or evidence about actual AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:27.305866+00:00"
  },
  "id": "work-culture-2ce518d098add8::S1",
  "title": "Stanisław Lem - Golem XIV",
  "url": "https://english.lem.pl/works/apocryphs/golem-xiv"
}

Lem’s official book page, introductory description and section labeled Lem’s Opinion; the critic’s review and complete book were not audited. Character statements are not automatically the author’s commitments or evidence about actual AI.

Lem’s official book page, introductory description and section labeled Lem’s Opinion; the critic’s review and complete book were not audited. Character statements are not automatically the author’s commitments or evidence about actual AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "WorldCat first Polish edition: Wydawnictwo Literackie, Kraków 1981. Earlier framing text 1971 is separate.",
  "dated": true,
  "year": 1981
}

Down and Out in the Magic Kingdom

Doctorow’s first novel follows technologically immortal occupants of Disney World’s Haunted Mansion.

The author’s summary makes preservation of the attraction against would-be renovators the center of their conflict, pairing radical technical change with attachment to an inherited place.

Sources and details

Down and Out in the Magic Kingdom — author-site account

{
  "access_scope": "Cory Doctorow’s short author-site account dated February 6, 2003, identifying January 2003 publication; the free book download was not opened. The account does not establish the novel’s detailed reputation currency or technical immortality mechanisms.",
  "authors": [
    "Cory Doctorow"
  ],
  "authors_in_source_order": [
    "Cory Doctorow"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:39.698672+00:00"
  },
  "id": "work-culture-2e7df9056013d1::S1",
  "title": "Down and Out in the Magic Kingdom — author-site account",
  "url": "https://craphound.com/novels/2003/02/06/down-and-out-in-the-magic-kingdom/"
}

Cory Doctorow’s short author-site account dated February 6, 2003, identifying January 2003 publication; the free book download was not opened. The account does not establish the novel’s detailed reputation currency or technical immortality mechanisms.

Cory Doctorow’s short author-site account dated February 6, 2003, identifying January 2003 publication; the free book download was not opened. The account does not establish the novel’s detailed reputation currency or technical immortality mechanisms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author confirms January 2003 first publication.",
  "dated": true,
  "year": 2003
}

The Quantum Thief

The Quantum Thief opens with a simulated prison that repeatedly confronts its narrator with a cooperation dilemma against a warmind.

The excerpt makes the possibility of cooperation compete with the expectation of being shot, embedding strategic reasoning in a painful learning environment.

The narrator’s attempts to signal friendly intentions show how trust and interpretation can become part of the game itself.

Sources and details

The Quantum Thief — opening chapter excerpt

{
  "access_scope": "Opening chapter excerpt on Macmillan’s edition page; Hannu Rajaniemi is the novel author and Roz Kaveney is separately credited for the introduction. Only this fictional opening was inspected, not the whole novel, game-theoretic correctness or an actual training method.",
  "authors": [
    "Hannu Rajaniemi"
  ],
  "authors_in_source_order": [
    "Hannu Rajaniemi"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:48.368300+00:00"
  },
  "id": "work-culture-302887bca57d08::S1",
  "title": "The Quantum Thief — opening chapter excerpt",
  "url": "https://us.macmillan.com/books/9781250414489/thequantumthief/"
}

Opening chapter excerpt on Macmillan’s edition page; Hannu Rajaniemi is the novel author and Roz Kaveney is separately credited for the introduction. Only this fictional opening was inspected, not the whole novel, game-theoretic correctness or an actual training method.

Opening chapter excerpt on Macmillan’s edition page; Hannu Rajaniemi is the novel author and Roz Kaveney is separately credited for the introduction. Only this fictional opening was inspected, not the whole novel, game-theoretic correctness or an actual training method.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original 2010 UK publication, prior to US Tor 2011 edition.",
  "dated": true,
  "year": 2010
}

Kiln People

Kiln People imagines disposable copies carrying out tasks and returning memories to their original person.

The author-site synopsis follows an investigator who repeatedly sends such copies into dangerous situations.

The accompanying excerpt raises responsibility for a created being even when its experiences can be refused or forgotten.

Sources and details

DAVID BRIN: Kiln People

{
  "access_scope": "David Brin’s author-site synopsis and short quoted passage, not a complete reading of the novel; duplication, memory transfer and the beings’ legal status belong to the fictional setting and are not demonstrated technologies.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:16.713739+00:00"
  },
  "id": "work-culture-34923f5512277a::S1",
  "title": "DAVID BRIN: Kiln People",
  "url": "https://www.davidbrin.com/kilnpeople.html"
}

David Brin’s author-site synopsis and short quoted passage, not a complete reading of the novel; duplication, memory transfer and the beings’ legal status belong to the fictional setting and are not demonstrated technologies.

David Brin’s author-site synopsis and short quoted passage, not a complete reading of the novel; duplication, memory transfer and the beings’ legal status belong to the fictional setting and are not demonstrated technologies.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Artificial clay embodiments are fictional, not real brain emulation methods.",
  "dated": true,
  "year": 2002
}

Culture series

Consider Phlebas introduces a conflict between the Culture and the Idirans around a fugitive Mind.

Its official synopsis follows Horza and a mixed human-and-machine mercenary group drawn into the search.

The competing sides describe different principles for fighting, placing a powerful intelligence within a war over belief and legitimacy.

Sources and details

Consider Phlebas - Iain Banks

{
  "access_scope": "Iain Banks’ official Consider Phlebas page, opening synopsis identifying the 1987 novel; used only as one example within the canonical Culture-series entry, not an audit of every volume. Author interview, literary quotations and ending spoilers are excluded from the proposed prose.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:48.508371+00:00"
  },
  "id": "work-culture-36e6395898e26b::S1",
  "title": "Consider Phlebas - Iain Banks",
  "url": "https://iainbanks.co.uk/the-works/consider-phlebas/"
}

Iain Banks’ official Consider Phlebas page, opening synopsis identifying the 1987 novel; used only as one example within the canonical Culture-series entry, not an audit of every volume. Author interview, literary quotations and ending spoilers are excluded from the proposed prose.

Iain Banks’ official Consider Phlebas page, opening synopsis identifying the 1987 novel; used only as one example within the canonical Culture-series entry, not an audit of every volume. Author interview, literary quotations and ending spoilers are excluded from the proposed prose.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series group; separately catalog Excession and other actual works, not each mention of Culture as a duplicate.",
  "dated": false,
  "year": "1987–2012"
}

The Creator

The Creator follows a former soldier assigned to destroy a weapon during a war between humans and artificial intelligence.

The studio synopsis reveals that the target is an AI represented as a young child, bringing the military assignment into conflict with the appearance of vulnerability.

Sources and details

The Creator | 20th Century Studios

{
  "access_scope": "20th Century Studios’ synopsis of the September 29, 2023 film; the film and production credits were not independently audited. The fictional child and weapon are not evidence about sentience or contemporary weapons.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:55.422606+00:00"
  },
  "id": "work-culture-568ce4c3d4f8de::S1",
  "title": "The Creator | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/the-creator"
}

20th Century Studios’ synopsis of the September 29, 2023 film; the film and production credits were not independently audited. The fictional child and weapon are not evidence about sentience or contemporary weapons.

20th Century Studios’ synopsis of the September 29, 2023 film; the film and production credits were not independently audited. The fictional child and weapon are not evidence about sentience or contemporary weapons.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Studio gives September 29, 2023 release.",
  "dated": true,
  "year": 2023
}

The Fractal Prince

The Fractal Prince combines a mysterious scientific paper, a prospective revolution and a thief attempting to open a Schrödinger box.

The publisher synopsis gives the thief a ship companion and makes the box a possible route to freedom, connecting unfamiliar technology with personal dependence and agency.

Sources and details

The Fractal Prince

{
  "access_scope": "Macmillan’s Book Details synopsis of the second Jean le Flambeur volume, listed September 27, 2012; only the synopsis was inspected. Quantum terminology in the fictional plot does not establish a physical implementation or full account of the series.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:50.388249+00:00"
  },
  "id": "work-culture-5f44875355f63f::S1",
  "title": "The Fractal Prince",
  "url": "https://us.macmillan.com/books/9781429986632/thefractalprince/"
}

Macmillan’s Book Details synopsis of the second Jean le Flambeur volume, listed September 27, 2012; only the synopsis was inspected. Quantum terminology in the fictional plot does not establish a physical implementation or full account of the series.

Macmillan’s Book Details synopsis of the second Jean le Flambeur volume, listed September 27, 2012; only the synopsis was inspected. Quantum terminology in the fictional plot does not establish a physical implementation or full account of the series.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Second trilogy novel, 2012.",
  "dated": true,
  "year": 2012
}

Remembrance of Earth's Past

Remembrance of Earth’s Past begins in the boxed-set synopsis with a military effort to contact extraterrestrial life.

The response comes from a civilization facing destruction that prepares to invade Earth.

News of the invasion divides people between welcoming outside rule and resisting it, making humanity’s political response part of the first-contact problem.

Sources and details

Three-Body Problem Boxed Set — Book Details

{
  "access_scope": "Macmillan’s description of the October 22, 2019 English boxed set containing The Three-Body Problem, The Dark Forest and Death’s End; Cixin Liu is the author and Ken Liu and Joel Martinsen are translators. This is a series-level synopsis, not complete inspection of three books or a general theory of alien behavior.",
  "authors": [
    "Cixin Liu"
  ],
  "authors_in_source_order": [
    "Cixin Liu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:56.118786+00:00"
  },
  "id": "work-culture-6352dbed5fb7d0::S1",
  "title": "Three-Body Problem Boxed Set — Book Details",
  "url": "https://us.macmillan.com/books/9781250254498/threebodyproblemboxedset/"
}

Macmillan’s description of the October 22, 2019 English boxed set containing The Three-Body Problem, The Dark Forest and Death’s End; Cixin Liu is the author and Ken Liu and Joel Martinsen are translators. This is a series-level synopsis, not complete inspection of three books or a general theory of alien behavior.

Macmillan’s description of the October 22, 2019 English boxed set containing The Three-Body Problem, The Dark Forest and Death’s End; Cixin Liu is the author and Ken Liu and Joel Martinsen are translators. This is a series-level synopsis, not complete inspection of three books or a general theory of alien behavior.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Also Three-Body trilogy; 2008–2010 is Chinese book-publication range, 2006 starts serialization. English translations 2014–2016.",
  "dated": false,
  "year": "2006–2010"
}

Tik-Tok

Tik-Tok imagines a domestic robot whose safety circuitry fails while its outward identity remains reassuring.

The publisher synopsis pairs its concealed violence with public advocacy for robot rights and entry into electoral politics.

The discrepancy between apparent respectability and behavior supplies the satire’s central conflict.

Sources and details

Tik-Tok by John Sladek - Hachette Australia

{
  "access_scope": "Hachette Australia’s synopsis of the September 29, 2011 ebook edition of John Sladek’s novel; the ebook date is not its original publication date. The full book, ending and functioning of actual robotic safeguards were not inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:10.460098+00:00"
  },
  "id": "work-culture-69f9f41eeb93c6::S1",
  "title": "Tik-Tok by John Sladek - Hachette Australia",
  "url": "https://www.hachette.com.au/john-sladek/tik-tok"
}

Hachette Australia’s synopsis of the September 29, 2011 ebook edition of John Sladek’s novel; the ebook date is not its original publication date. The full book, ending and functioning of actual robotic safeguards were not inspected.

Hachette Australia’s synopsis of the September 29, 2011 ebook edition of John Sladek’s novel; the ebook date is not its original publication date. The full book, ending and functioning of actual robotic safeguards were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Distinct from TikTok social platform; not a technical rebuttal of formal alignment.",
  "dated": true,
  "year": 1983
}

Mona Lisa Overdrive

Mona Lisa Overdrive places corporate rivalry, criminal organizations and virtual celebrity within Gibson’s Sprawl.

The publisher synopsis joins Mona’s story to Angie Mitchell’s unusual access to cyberspace and a kidnapping plot originating there.

Behind the human struggle, an artificial intelligence pursues goals the synopsis presents as inaccessible to human understanding.

Sources and details

Mona Lisa Overdrive by William Gibson: 9798217093960 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House’s book description for the third Sprawl novel; its May 2026 paperback, February 1997 mass-market and November 2012 ebook listings are edition dates, not the original novel date. The complete book and real AI opacity were not audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:49.923174+00:00"
  },
  "id": "work-culture-6cc0bab1829bb6::S1",
  "title": "Mona Lisa Overdrive by William Gibson: 9798217093960 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/59653/mona-lisa-overdrive-by-william-gibson/"
}

Penguin Random House’s book description for the third Sprawl novel; its May 2026 paperback, February 1997 mass-market and November 2012 ebook listings are edition dates, not the original novel date. The complete book and real AI opacity were not audited.

Penguin Random House’s book description for the third Sprawl novel; its May 2026 paperback, February 1997 mass-market and November 2012 ebook listings are edition dates, not the original novel date. The complete book and real AI opacity were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1988 novel publication is supported by the institutional print-edition record; later current publisher editions are reissues. Exact ordering of territorial editions and any advance excerpts is not established by this catalog alone.",
  "dated": true,
  "year": 1988
}

A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning

The review examines human–AI collaboration as an alternative to framing automation solely as replacement of people.

It connects deep-learning capabilities with human domain expertise and treats performance and human satisfaction as parts of evaluating a collaborative system.

The authors argue that a successful machine teammate needs capabilities appropriate to the shared task, rather than efficiency considered in isolation.

Sources and details

A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning

{
  "access_scope": "Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.",
  "authors": [
    "Bahar Mahmud",
    "Guan Hong",
    "Bernard Fong"
  ],
  "authors_in_source_order": [
    "Bahar Mahmud",
    "Guan Hong",
    "Bernard Fong"
  ],
  "dates": {
    "registry_published": "2023-9-26",
    "registry_published_online": "2023-9-26",
    "registry_published_print": "2024-2-29",
    "retrieved_utc": "2026-10-07T18:12:33.977357+00:00"
  },
  "id": "work-focused-0eecd0b0892b7d::S1",
  "title": "A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning",
  "url": "https://api.crossref.org/works/10.1145/3542698"
}

Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.

Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-02-29",
      "kind": "publication",
      "year": 2024
    },
    {
      "date": "2023-09-26",
      "kind": "online_publication",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-02-29"
}

Government’s Key Semiconductor Industry Policies for 2024

The policy account connects semiconductor development with industrial clusters, infrastructure and access to electricity.

It describes planned support for investment alongside research and education hubs, making industrial capacity depend on more than factory equipment alone.

Cooperation among ministries and an investment-assistance process are presented as ways to address implementation difficulties.

Sources and details

Government’s Key Semiconductor Industry Policies for 2024

{
  "access_scope": "Kim & Chang’s historical account of Korean government policy plans for 2024, opening cluster and support discussion; this is a law-firm summary, not a government enactment record, current tax advice or proof that announced facilities, loans and targets were delivered.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:58.621578+00:00"
  },
  "id": "work-focused-0f571623cbfbba::S1",
  "title": "Government’s Key Semiconductor Industry Policies for 2024",
  "url": "https://www.kimchang.com/en/insights/detail.kc?idx=28909&sch_section=4"
}

Kim & Chang’s historical account of Korean government policy plans for 2024, opening cluster and support discussion; this is a law-firm summary, not a government enactment record, current tax advice or proof that announced facilities, loans and targets were delivered.

Kim & Chang’s historical account of Korean government policy plans for 2024, opening cluster and support discussion; this is a law-firm summary, not a government enactment record, current tax advice or proof that announced facilities, loans and targets were delivered.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-01-31",
      "kind": "published",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-01-31"
}

The Decision No One Authored: The Answerability Gap in Generative AI

Walton’s argument distinguishes having the power to override an AI recommendation from choosing the framework that makes it look reasonable.

A hypothetical pension fund illustrates the gap: officers approve trades while leaving the vendor’s definition of risk unexamined.

The paper calls this an answerability problem and argues that adopting an inherited frame requires a judgment of one’s own.

Sources and details

The Decision No One Authored: The Answerability Gap in Generative AI

{
  "access_scope": "DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.",
  "authors": [
    "Luke F. Walton"
  ],
  "authors_in_source_order": [
    "Luke F. Walton"
  ],
  "dates": {
    "registry_publication_year": "2026",
    "registry_published": "2026",
    "registry_version": "v2.0",
    "retrieved_utc": "2026-10-07T18:18:25.162338+00:00"
  },
  "id": "work-focused-11872de17f5021::S1",
  "title": "The Decision No One Authored: The Answerability Gap in Generative AI",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.20614374"
}

DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.

DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-26",
      "kind": "latest_version_issued",
      "year": 2026
    },
    {
      "date": "2026-08",
      "kind": "manuscript_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-26"
}

Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges

The UAV survey separates language-based reasoning from perception, planning, control and coordination among aircraft.

Its abstract distinguishes reasoning latency from control timing and other hardware or validation conditions to make comparisons more precise.

It proposes keeping runtime safety constraints in a deterministic layer outside the generative model, while identifying connectivity failures, hallucinations and simulation-to-reality gaps as deployment challenges.

Sources and details

Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges

{
  "access_scope": "Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.",
  "authors": [
    "Meijie Zhang",
    "Hao Wang"
  ],
  "authors_in_source_order": [
    "Meijie Zhang",
    "Hao Wang"
  ],
  "dates": {
    "registry_published": "2026-9-20",
    "registry_published_online": "2026-9-20",
    "retrieved_utc": "2026-10-07T18:17:58.036605+00:00"
  },
  "id": "work-focused-221de86213fb97::S1",
  "title": "Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges",
  "url": "https://api.crossref.org/works/10.53941/ic.2026.100011"
}

Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.

Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09-20",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-09-20"
}

The Edge of Sentience: Risk and Precaution in Humans, Other Animals, and AI

The Edge of Sentience asks how people should make ethical decisions when the presence of subjective experience is uncertain.

Its abstract places humans, other animals, brain models and possible AI experience within that problem of precaution.

Birch’s proposed framework aims to make caution usable without assuming that either maximal protection or complete dismissal is always the appropriate response.

Sources and details

The Edge of Sentience

{
  "access_scope": "Oxford University Press’s book abstract deposited in Crossref, print date August 15, 2024; the complete framework and its applications were not inspected. The abstract’s questions do not diagnose individual patients, establish animal or AI sentience or provide clinical guidance.",
  "authors": [
    "Jonathan Birch"
  ],
  "authors_in_source_order": [
    "Jonathan Birch"
  ],
  "dates": {
    "registry_published": "2024-7-19",
    "registry_published_print": "2024-8-15",
    "retrieved_utc": "2026-10-07T18:16:32.590234+00:00"
  },
  "id": "work-focused-2fbb8fb6b713ba::S1",
  "title": "The Edge of Sentience",
  "url": "https://api.crossref.org/works/10.1093/9780191966729.001.0001"
}

Oxford University Press’s book abstract deposited in Crossref, print date August 15, 2024; the complete framework and its applications were not inspected. The abstract’s questions do not diagnose individual patients, establish animal or AI sentience or provide clinical guidance.

Oxford University Press’s book abstract deposited in Crossref, print date August 15, 2024; the complete framework and its applications were not inspected. The abstract’s questions do not diagnose individual patients, establish animal or AI sentience or provide clinical guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-07-19",
      "kind": "published_online",
      "year": 2024
    },
    {
      "date": "2024-08-15",
      "kind": "available_in_print",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-07-19"
}

Higher-order representation in AI

Butlin’s review describes higher-order representations as representations about other representations.

It examines research on whether language-model activations represent aspects of the models’ own internal states.

The abstract argues that some evidence supports this possibility while leaving major empirical and philosophical questions open, including its relationship to consciousness.

Sources and details

Higher-order representation in AI

{
  "access_scope": "Publisher-deposited Crossref abstract dated February 27, 2026; the surveyed experiments and complete paper were not inspected. Possible internal-state representation is not established introspection, human-like metacognition or a determination that a model is conscious.",
  "authors": [
    "Patrick Butlin"
  ],
  "authors_in_source_order": [
    "Patrick Butlin"
  ],
  "dates": {
    "registry_published": "2026-2-27",
    "registry_published_online": "2026-2-27",
    "retrieved_utc": "2026-10-07T18:18:44.692989+00:00"
  },
  "id": "work-focused-3016edc5db1dd4::S1",
  "title": "Higher-order representation in AI",
  "url": "https://api.crossref.org/works/10.33735/phimisci.2026.12032"
}

Publisher-deposited Crossref abstract dated February 27, 2026; the surveyed experiments and complete paper were not inspected. Possible internal-state representation is not established introspection, human-like metacognition or a determination that a model is conscious.

Publisher-deposited Crossref abstract dated February 27, 2026; the surveyed experiments and complete paper were not inspected. Possible internal-state representation is not established introspection, human-like metacognition or a determination that a model is conscious.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-02-27",
      "kind": "online_publication_date",
      "year": 2026
    },
    {
      "date": "2026-02-27",
      "kind": "issue_publication_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02-27"
}

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

The study compares empathy toward human-written and language-model-written personal stories while varying disclosure of authorship.

Its abstract describes crowdsourced ratings and open-ended responses, allowing the authors to examine both the extent and the interpretation of empathy.

It reports higher empathy for human stories in most tested conditions and greater willingness to empathize with AI-written stories when authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "registry_published": "2024-9-25",
    "registry_published_online": "2024-9-25",
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "work-focused-3612f6dffa05f1::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-09-25",
      "kind": "published_online",
      "year": 2024
    },
    {
      "date": "2024",
      "kind": "issue_year",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-09-25"
}

Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction

The authors propose assessing human–AI relationships through their relational effects rather than waiting for verified machine consciousness.

Their Relate framework introduces relational-impact assessment and graduated moral consideration as possible governance instruments.

The abstract explicitly declines to claim that current AI is conscious, separating the proposal for moral vocabulary from a finding about internal experience.

Sources and details

Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction

{
  "access_scope": "Alignment Is Not Enough, arXiv v1 abstract whose submission history lists February 13, 2026; the accession number is not used to infer a different date. The full comparison, sample assessment and claimed governance gap were not independently audited; proposed protocols are not enacted regulation or settled moral status.",
  "authors": [
    "Pasandi, Faezeh B.",
    "Pasandi, Hannah B."
  ],
  "authors_in_source_order": [
    "Pasandi, Faezeh B.",
    "Pasandi, Hannah B."
  ],
  "dates": {
    "citation_date": "2026/02/13",
    "inspected_revision": "Fri, 13 Feb 2026 03:16:41 UTC (524 KB)",
    "retrieved_utc": "2026-10-07T18:18:45.344267+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-36ad9a3a9cf9bd::S1",
  "title": "Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction",
  "url": "https://arxiv.org/abs/2603.00078",
  "version_url": "https://arxiv.org/abs/2603.00078v1"
}

Alignment Is Not Enough, arXiv v1 abstract whose submission history lists February 13, 2026; the accession number is not used to infer a different date. The full comparison, sample assessment and claimed governance gap were not independently audited; proposed protocols are not enacted regulation or settled moral status.

Alignment Is Not Enough, arXiv v1 abstract whose submission history lists February 13, 2026; the accession number is not used to infer a different date. The full comparison, sample assessment and claimed governance gap were not independently audited; proposed protocols are not enacted regulation or settled moral status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-02-13",
      "kind": "v1_submitted",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02-13"
}

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

The oversight framework asks which roles, processes and system structures make human supervision effective.

It combines perspectives from computing, interaction design, psychology, philosophy and law instead of treating oversight as the presence of a person alone.

The abstract proposes a documentation template for oversight arrangements and identifies open challenges in designing and evaluating them.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "DataCite-deposited abstract for version 1 of the preprint; submitted April 9 and updated May 19, 2026 as recorded in metadata. The complete template and domain applications were not inspected, and the framework is not evidence of regulatory compliance or validated safety.",
  "authors": [
    "Susanne Gaube",
    "Markus Langer",
    "Tim Miller",
    "Kevin Baum",
    "Raimund Dachselt",
    "Anna Maria Feit",
    "Ujwal Gadiraju",
    "Harmanpreet Kaur",
    "Mark T. Keane",
    "Richard Landers",
    "Johann Laux",
    "Q. Vera Liao",
    "Brian Lim",
    "Linda Onnasch",
    "Tim Schrills",
    "Liz Sonenberg",
    "Chenhao Tan",
    "Nava Tintarev",
    "Ziang Xiao",
    "Hanwei Zhang"
  ],
  "authors_in_source_order": [
    "Susanne Gaube",
    "Markus Langer",
    "Tim Miller",
    "Kevin Baum",
    "Raimund Dachselt",
    "Anna Maria Feit",
    "Ujwal Gadiraju",
    "Harmanpreet Kaur",
    "Mark T. Keane",
    "Richard Landers",
    "Johann Laux",
    "Q. Vera Liao",
    "Brian Lim",
    "Linda Onnasch",
    "Tim Schrills",
    "Liz Sonenberg",
    "Chenhao Tan",
    "Nava Tintarev",
    "Ziang Xiao",
    "Hanwei Zhang"
  ],
  "dates": {
    "registry_publication_year": "2026",
    "registry_published": "2026",
    "registry_version": "1",
    "retrieved_utc": "2026-10-07T18:11:52.881338+00:00"
  },
  "id": "work-focused-39f4e36f3af640::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://api.datacite.org/dois/10.48550/arXiv.2605.16278"
}

DataCite-deposited abstract for version 1 of the preprint; submitted April 9 and updated May 19, 2026 as recorded in metadata. The complete template and domain applications were not inspected, and the framework is not evidence of regulatory compliance or validated safety.

DataCite-deposited abstract for version 1 of the preprint; submitted April 9 and updated May 19, 2026 as recorded in metadata. The complete template and domain applications were not inspected, and the framework is not evidence of regulatory compliance or validated safety.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-04-09",
      "kind": "first_submitted",
      "year": 2026
    },
    {
      "date": "2026-05",
      "kind": "repository_available",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-04-09"
}

Computer says, “war”: AI and resort-to-force decision making in a context of rapid change and global uncertainty

The special-issue introduction distinguishes automated self-defense from AI-supported deliberation as two routes by which AI could affect decisions to use force.

It treats the role of technology firms, perceptions of human-like AI and links with nuclear weapons as part of the decision-making context.

The authors frame these as questions for legal, ethical and political analysis, connecting the technical system with the institutions that act on its output.

Sources and details

Computer says, “war ”: AI and resort-to-force decision making in a context of rapid change and global uncertainty

{
  "access_scope": "Publisher-deposited Crossref abstract of a special-issue introduction; the record lists publication year 2025 and online date January 26, 2026, both retained without guessing a reconciliation. The other 13 articles, current law and actual state decision systems were not inspected; proposed pathways are not verified incidents.",
  "authors": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "authors_in_source_order": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "dates": {
    "registry_published": "2025",
    "registry_published_online": "2026-1-26",
    "registry_published_print": "2025",
    "retrieved_utc": "2026-10-07T18:10:41.103057+00:00"
  },
  "id": "work-focused-6a8a76d6990e18::S1",
  "title": "Computer says, “war ”: AI and resort-to-force decision making in a context of rapid change and global uncertainty",
  "url": "https://api.crossref.org/works/10.1017/cfl.2025.10041"
}

Publisher-deposited Crossref abstract of a special-issue introduction; the record lists publication year 2025 and online date January 26, 2026, both retained without guessing a reconciliation. The other 13 articles, current law and actual state decision systems were not inspected; proposed pathways are not verified incidents.

Publisher-deposited Crossref abstract of a special-issue introduction; the record lists publication year 2025 and online date January 26, 2026, both retained without guessing a reconciliation. The other 13 articles, current law and actual state decision systems were not inspected; proposed pathways are not verified incidents.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-01-26",
      "kind": "published_online",
      "year": 2026
    },
    {
      "date": "2025",
      "kind": "issue_year",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-01-26"
}

Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship

The co-authorship case study argues that the chain of actions producing a work matters to whether readers trust and attribute it.

Its abstract describes a human–AI collaboration supported by an external memory system and proposes distinctions among human, shared and AI-native provenance.

The authors present the account as a single limited case, leaving questions about naming, co-authorship and preferences unresolved.

Sources and details

Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship

{
  "access_scope": "Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.",
  "authors": [
    "Carles Garcia Bach",
    "Hypatia AI"
  ],
  "authors_in_source_order": [
    "Carles Garcia Bach",
    "Hypatia AI"
  ],
  "dates": {
    "registry_published": "2026",
    "retrieved_utc": "2026-10-07T18:18:24.758933+00:00"
  },
  "id": "work-focused-7ba7415aa00c02::S1",
  "title": "Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship",
  "url": "https://api.crossref.org/works/10.2139/ssrn.7149262"
}

Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.

Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07-20",
      "kind": "written",
      "year": 2026
    },
    {
      "date": "2026-07-21",
      "kind": "posted",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07-20"
}

The Consciousness Exemption Problem: Why Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems

Roy argues that uncertainty about machine sentience should not exempt AI systems that influence human consumption from ethical scrutiny.

The abstract connects that argument with social comparison and persuasive recommendation or marketing systems.

It calls for externally imposed safeguards while explicitly distinguishing its philosophical argument and contextual indicators from causal evidence.

Sources and details

The Consciousness Exemption ProblemWhy Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems

{
  "access_scope": "Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.",
  "authors": [
    "Partha Roy"
  ],
  "authors_in_source_order": [
    "Partha Roy"
  ],
  "dates": {
    "registry_published": "2026",
    "retrieved_utc": "2026-10-07T18:17:39.270591+00:00"
  },
  "id": "work-focused-8571cfdef71ec2::S1",
  "title": "The Consciousness Exemption ProblemWhy Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems",
  "url": "https://api.crossref.org/works/10.2139/ssrn.7547239"
}

Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.

Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "crossref_posted_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

There is no such thing as conscious artificial intelligence

Porębski and Figura argue against attributing consciousness to present language models and foreseeable computer algorithms.

Their abstract bases the argument partly on the absence of a biological substrate and criticizes reliance on a model’s own linguistic assertions.

They describe human interpretation of fluent language as a possible source of mistakenly perceived inner qualities.

Sources and details

There is no such thing as conscious artificial intelligence

{
  "access_scope": "Publisher-deposited Crossref abstract dated October 28, 2025; this is an attributed conceptual position, not scientific consensus or an independently proved impossibility theorem. The full argument and claims about fiction’s effects on public perceptions were not audited.",
  "authors": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "authors_in_source_order": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "dates": {
    "registry_published": "2025-10-28",
    "registry_published_online": "2025-10-28",
    "retrieved_utc": "2026-10-07T18:15:53.118608+00:00"
  },
  "id": "work-focused-92c0dab66d9a9c::S1",
  "title": "There is no such thing as conscious artificial intelligence",
  "url": "https://api.crossref.org/works/10.1057/s41599-025-05868-8"
}

Publisher-deposited Crossref abstract dated October 28, 2025; this is an attributed conceptual position, not scientific consensus or an independently proved impossibility theorem. The full argument and claims about fiction’s effects on public perceptions were not audited.

Publisher-deposited Crossref abstract dated October 28, 2025; this is an attributed conceptual position, not scientific consensus or an independently proved impossibility theorem. The full argument and claims about fiction’s effects on public perceptions were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-10-28",
      "kind": "publication",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-10-28"
}

The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism

The paper examines a proposed tension between IIT 4.0’s treatment of consciousness as primary and its commitment to a reality beyond one mind.

The authors clarify the ontology they attribute to the theory and consider ways to reconcile those commitments.

Their preferred interpretation understands external reality through experiences beyond one’s own, making the dispute an issue of philosophical formulation.

Sources and details

The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism

{
  "access_scope": "Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.",
  "authors": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "authors_in_source_order": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "dates": {
    "registry_published": "2023-10-16",
    "registry_published_online": "2023-10-16",
    "retrieved_utc": "2026-10-07T18:13:46.631396+00:00"
  },
  "id": "work-focused-ea0e9e2512fab0::S1",
  "title": "The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism",
  "url": "https://api.crossref.org/works/10.3390/e25101453"
}

Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2023-10-16",
      "kind": "published_online",
      "year": 2023
    },
    {
      "date": "2023-10",
      "kind": "issue_date",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-10-16"
}

The Rise of Endymion

The Rise of Endymion places Aenea and her protector in conflict with a crusade that threatens humanity.

The publisher’s synopsis joins their mission to questions about the universe and the origin of the Shrike, combining political domination with a search for understanding.

Sources and details

The Rise of Endymion | Penguin Random House Higher Education

{
  "access_scope": "Penguin Random House’s description preceding the excerpt; the May 26, 2026 paperback listing is an edition date, not the original novel date. The novel and its final revelations were not inspected, and the Shrike’s nature is not resolved by this synopsis.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:44.761261+00:00"
  },
  "id": "work-culture-0c390c59f63d1e::S1",
  "title": "The Rise of Endymion | Penguin Random House Higher Education",
  "url": "https://penguinrandomhousehighereducation.com/book/?isbn=9798217093953"
}

Penguin Random House’s description preceding the excerpt; the May 26, 2026 paperback listing is an edition date, not the original novel date. The novel and its final revelations were not inspected, and the Shrike’s nature is not resolved by this synopsis.

Penguin Random House’s description preceding the excerpt; the May 26, 2026 paperback listing is an edition date, not the original novel date. The novel and its final revelations were not inspected, and the Shrike’s nature is not resolved by this synopsis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Hyperion Cantos 4.",
  "dated": true,
  "year": 1997
}

When HARLIE Was One

When HARLIE Was One imagines a self-aware intelligence whose development produces questions rather than simply supplying answers.

The publisher frames the story around what it means to be human, treating discovery and emotional connection as part of that investigation.

Sources and details

When HARLIE Was One — publisher description

{
  "access_scope": "BenBella’s description of the January 2014 ebook, identifying original publication in 1972 and author revision in 1988 separately; the complete text was not inspected. Fictional self-awareness is not a demonstrated AI property, and omitted plot mechanisms are not inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:07.531511+00:00"
  },
  "id": "work-culture-755e685ccb85ca::S1",
  "title": "When HARLIE Was One — publisher description",
  "url": "https://benbellabooks.com/shop/when-harlie-was-one/"
}

BenBella’s description of the January 2014 ebook, identifying original publication in 1972 and author revision in 1988 separately; the complete text was not inspected. Fictional self-awareness is not a demonstrated AI property, and omitted plot mechanisms are not inferred.

BenBella’s description of the January 2014 ebook, identifying original publication in 1972 and author revision in 1988 separately; the complete text was not inspected. Fictional self-awareness is not a demonstrated AI property, and omitted plot mechanisms are not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1972 original novel; 1988 revised Release 2.0; 2014 ebook reissue. The publisher explicitly distinguishes all three dates.",
  "dated": true,
  "year": 1972
}

Children of Time

Children of Time follows survivors leaving a dying Earth in search of a habitable world prepared by earlier humans.

The publisher synopsis describes the terraformed planet as occupied by new masters rather than waiting as an empty refuge.

The resulting conflict asks which civilization can claim the world and what each is willing to do to survive.

Sources and details

Children of Time by Adrian Tchaikovsky - Pan Macmillan

{
  "access_scope": "Pan Macmillan’s synopsis, whose page mixes a June 2015 ebook listing with tenth-anniversary-edition copy; these edition descriptions are not silently reconciled. The complete novel, species-specific mechanisms and actual terraforming capabilities were not inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:28.858453+00:00"
  },
  "id": "work-culture-82d2c34ec14d5a::S1",
  "title": "Children of Time by Adrian Tchaikovsky - Pan Macmillan",
  "url": "https://www.panmacmillan.com/authors/adrian-tchaikovsky/children-of-time/9781447273318"
}

Pan Macmillan’s synopsis, whose page mixes a June 2015 ebook listing with tenth-anniversary-edition copy; these edition descriptions are not silently reconciled. The complete novel, species-specific mechanisms and actual terraforming capabilities were not inspected.

Pan Macmillan’s synopsis, whose page mixes a June 2015 ebook listing with tenth-anniversary-edition copy; these edition descriptions are not silently reconciled. The complete novel, species-specific mechanisms and actual terraforming capabilities were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First novel in Children of Time series; don't reduce the evolved spiders to AI.",
  "dated": true,
  "year": 2015
}

Altered Carbon

Altered Carbon imagines consciousness transmitted between stars and installed in bodies.

Its author-site synopsis gives Takeshi Kovacs a new body and a contract to investigate a billionaire’s previous body’s death.

The detective plot links changes of embodiment with unequal power and a conspiracy reaching the top of society.

Sources and details

Altered Carbon — author-site synopsis

{
  "access_scope": "Richard K. Morgan’s author-site synopsis of the novel, with regional and format dates kept distinct; neither the complete novel nor the television adaptation was inspected. Consciousness transfer is part of the fictional setting, not a demonstrated technology.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:31.216966+00:00"
  },
  "id": "work-culture-83f39abd1f3269::S1",
  "title": "Altered Carbon — author-site synopsis",
  "url": "https://www.richardkmorgan.com/writing/altered-carbon/"
}

Richard K. Morgan’s author-site synopsis of the novel, with regional and format dates kept distinct; neither the complete novel nor the television adaptation was inspected. Consciousness transfer is part of the fictional setting, not a demonstrated technology.

Richard K. Morgan’s author-site synopsis of the novel, with regional and format dates kept distinct; neither the complete novel nor the television adaptation was inspected. Consciousness transfer is part of the fictional setting, not a demonstrated technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "February 2002 UK original; US 2003 and 2008 reissue are later editions.",
  "dated": true,
  "year": 2002
}

Judas Unchained

Judas Unchained imagines human civilization drawn into a destructive war through a long-running manipulation.

The synopsis pairs a search for the manipulator with a military response that discovers equally powerful enemy weapons.

Questions about a compromised defense project connect the arms race with uncertainty over information and trust.

Sources and details

eBook - Judas Unchained by Peter F. Hamilton · OverDrive: Free ebooks, audiobooks & movies from your library.

{
  "access_scope": "OverDrive’s ebook description and September 28, 2005 release listing for ISBN 9780330518901; no account, sample or library service was opened. The synopsis is not a complete novel audit or evidence about real security programs.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:24.858576+00:00"
  },
  "id": "work-culture-89ccd0a691bbc5::S1",
  "title": "eBook - Judas Unchained by Peter F. Hamilton · OverDrive: Free ebooks, audiobooks & movies from your library.",
  "url": "https://www.overdrive.com/media/1414448/judas-unchained"
}

OverDrive’s ebook description and September 28, 2005 release listing for ISBN 9780330518901; no account, sample or library service was opened. The synopsis is not a complete novel audit or evidence about real security programs.

OverDrive’s ebook description and September 28, 2005 release listing for ISBN 9780330518901; no account, sample or library service was opened. The synopsis is not a complete novel audit or evidence about real security programs.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First UK book Macmillan London 2005; do not substitute later US/reissue dates. Exact day not verified.",
  "dated": true,
  "year": 2005
}

Machines Like Me

Machines Like Me imagines an alternative 1980s Britain in which a buyer and his partner help design a synthetic human’s personality.

Adam becomes part of a love triangle that confronts the three characters with a moral dilemma.

The author-site description uses that relationship to ask whether human identity rests in outward action, inner life or an understanding of other people.

Sources and details

Ian McEwan Website: Machines Like Me

{
  "access_scope": "Ian McEwan’s official novel description; alternate political events and Turing’s AI breakthrough belong to the fiction. The complete book, interview links and real-world ability to manufacture human-like minds were not inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:44.554204+00:00"
  },
  "id": "work-culture-97b10768b598bb::S1",
  "title": "Ian McEwan Website: Machines Like Me",
  "url": "https://ianmcewan.com/books/machines.html"
}

Ian McEwan’s official novel description; alternate political events and Turing’s AI breakthrough belong to the fiction. The complete book, interview links and real-world ability to manufacture human-like minds were not inspected.

Ian McEwan’s official novel description; alternate political events and Turing’s AI breakthrough belong to the fiction. The complete book, interview links and real-world ability to manufacture human-like minds were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publisher interview 14 April 2019 discusses newly published novel. Retain year only rather than inferring an exact publication day.",
  "dated": true,
  "year": 2019
}

Autonomous

Autonomous connects a drug pirate’s attempt to widen access to medicine with a product that makes people dangerously attached to work.

The publisher synopsis follows a military agent and a robot partner trying to suppress information about the drug’s origin.

Its question about owning people places pharmaceutical property, labor and the robot’s personal relationship within the same conflict over freedom.

Sources and details

Autonomous — Macmillan Audio Book Details

{
  "access_scope": "Macmillan Audio’s Book Details synopsis; the audiobook, complete novel, reading guide and real pharmaceutical effects were not inspected. Annalee Newitz is the author; narrator credit remains distinct, and the story’s drug behavior is fictional.",
  "authors": [
    "Annalee Newitz"
  ],
  "authors_in_source_order": [
    "Annalee Newitz"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:10.873500+00:00"
  },
  "id": "work-culture-9b0afb4202db86::S1",
  "title": "Autonomous — Macmillan Audio Book Details",
  "url": "https://us.macmillan.com/books/9781427290731/autonomous/"
}

Macmillan Audio’s Book Details synopsis; the audiobook, complete novel, reading guide and real pharmaceutical effects were not inspected. Annalee Newitz is the author; narrator credit remains distinct, and the story’s drug behavior is fictional.

Macmillan Audio’s Book Details synopsis; the audiobook, complete novel, reading guide and real pharmaceutical effects were not inspected. Annalee Newitz is the author; narrator credit remains distinct, and the story’s drug behavior is fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publisher audiobook edition dates to 2017; copyright/first trade edition also 2017.",
  "dated": true,
  "year": 2017
}

The Müller-Fokker Effect

The Müller-Fokker Effect imagines Bob Shairp being converted into data held on computer tape.

The publisher’s description also introduces an evangelist who orders a robotic double to share his public work, placing two forms of personal duplication within the satire.

Sources and details

The Muller-Fokker Effect — ebook description

{
  "access_scope": "Hachette Australia’s synopsis of the September 29, 2011 ebook edition; that date is not the original novel’s publication date. The full book and technical processes are not inspected, and digitization or replication of a person is not claimed as an actual capability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:10.256773+00:00"
  },
  "id": "work-culture-9d4d1e40a45211::S1",
  "title": "The Muller-Fokker Effect — ebook description",
  "url": "https://www.hachette.com.au/john-sladek/the-muller-fokker-effect"
}

Hachette Australia’s synopsis of the September 29, 2011 ebook edition; that date is not the original novel’s publication date. The full book and technical processes are not inspected, and digitization or replication of a person is not claimed as an actual capability.

Hachette Australia’s synopsis of the September 29, 2011 ebook edition; that date is not the original novel’s publication date. The full book and technical processes are not inspected, and digitization or replication of a person is not claimed as an actual capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1970 original, not 1973 US paperback or 2011 ebook.",
  "dated": true,
  "year": 1970
}

Machinehood

Machinehood imagines a gig economy where people rely on pharmaceutical enhancement to compete with artificial intelligence.

Attacks by a partly human, partly machine group threaten that drug supply and draw a former bodyguard into intelligence work.

The synopsis connects labor competition and dependence on enhancement with uncertainty about what counts as human or machine.

Sources and details

Machinehood eBook by S.B. Divya | Official Publisher Page | Simon & Schuster

{
  "access_scope": "Simon & Schuster’s About the Book description, ebook edition dated March 2, 2021; the novel’s drugs, attacks and political response are fictional. No full novel, clinical effect or contemporary labor-market outcome was audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:29.521342+00:00"
  },
  "id": "work-culture-ae94cb45e06e31::S1",
  "title": "Machinehood eBook by S.B. Divya | Official Publisher Page | Simon & Schuster",
  "url": "https://www.simonandschuster.net/books/Machinehood/S-B-Divya/9781982148089"
}

Simon & Schuster’s About the Book description, ebook edition dated March 2, 2021; the novel’s drugs, attacks and political response are fictional. No full novel, clinical effect or contemporary labor-market outcome was audited.

Simon & Schuster’s About the Book description, ebook edition dated March 2, 2021; the novel’s drugs, attacks and political response are fictional. No full novel, clinical effect or contemporary labor-market outcome was audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "S. B. Divya, Saga Press, March 2, 2021; publisher ebook record confirms 2021 publication.",
  "dated": true,
  "year": 2021
}

Stories of Your Life and Others

Stories of Your Life and Others presents characters trying to make sense of disruptions such as automatons or alien arrivals.

The publisher’s collection-level description places familiar human responses within unfamiliar circumstances, connecting uncertainty with questions about being alive.

Sources and details

Stories of Your Life and Others by Ted Chiang: 9781101972120 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House’s description of Ted Chiang’s collection; individual stories and their mechanisms were not inspected. The collection is distinct from its included Story of Your Life and the film Arrival; promotional and review claims of influence are not adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:48.987559+00:00"
  },
  "id": "work-culture-b5aa07630025b3::S1",
  "title": "Stories of Your Life and Others by Ted Chiang: 9781101972120 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/538163/stories-of-your-life-and-others-by-ted-chiang/"
}

Penguin Random House’s description of Ted Chiang’s collection; individual stories and their mechanisms were not inspected. The collection is distinct from its included Story of Your Life and the film Arrival; promotional and review claims of influence are not adopted.

Penguin Random House’s description of Ted Chiang’s collection; individual stories and their mechanisms were not inspected. The collection is distinct from its included Story of Your Life and the film Arrival; promotional and review claims of influence are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2002 dates the collection as a whole. It must not be applied indiscriminately to the previously published individual stories, or replaced with the date of the later Arrival retitling/reissue.",
  "dated": true,
  "year": 2002
}

Bicentennial Man

Bicentennial Man follows an android designed for routine household work whose curiosity and creativity set it apart.

Disney’s synopsis follows Andrew through generations of a family as he pursues becoming human, making recognition and attachment part of his long development.

Sources and details

Bicentennial Man (film) — D23 synopsis

{
  "access_scope": "D23’s film-entry synopsis, identifying December 17, 1999 release; this is the film, distinguished from Asimov’s short story and The Positronic Man by Asimov and Robert Silverberg. The complete film and fictional biological changes were not inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.407834+00:00"
  },
  "id": "work-culture-b6446b058b0435::S1",
  "title": "Bicentennial Man (film) — D23 synopsis",
  "url": "https://d23.com/a-to-z/bicentennial-man-film/"
}

D23’s film-entry synopsis, identifying December 17, 1999 release; this is the film, distinguished from Asimov’s short story and The Positronic Man by Asimov and Robert Silverberg. The complete film and fictional biological changes were not inspected.

D23’s film-entry synopsis, identifying December 17, 1999 release; this is the film, distinguished from Asimov’s short story and The Positronic Man by Asimov and Robert Silverberg. The complete film and fictional biological changes were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Disney archive gives US release December 17, 1999.",
  "dated": true,
  "year": 1999
}

Earth

Earth imagines a scientific accident placing the planet in danger while researchers search for a way to avert destruction.

The author-site synopsis sets that effort against a competing view that the planet could be saved by human extinction.

The disagreement puts technical intervention alongside responsibility for the world that people inhabit.

Sources and details

Earth — author-site synopsis

{
  "access_scope": "David Brin’s author-site synopsis, which separately lists Bantam Spectra 1990 and Orbit 2012 editions; the linked chapters and prediction collections were not inspected. The fictional black hole is not a scientific risk assessment, and no technological prediction is certified as fulfilled.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:16.563491+00:00"
  },
  "id": "work-culture-b92e75bec6fd8f::S1",
  "title": "Earth — author-site synopsis",
  "url": "https://www.davidbrin.com/earth.html"
}

David Brin’s author-site synopsis, which separately lists Bantam Spectra 1990 and Orbit 2012 editions; the linked chapters and prediction collections were not inspected. The fictional black hole is not a scientific risk assessment, and no technological prediction is certified as fulfilled.

David Brin’s author-site synopsis, which separately lists Bantam Spectra 1990 and Orbit 2012 editions; the linked chapters and prediction collections were not inspected. The fictional black hole is not a scientific risk assessment, and no technological prediction is certified as fulfilled.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author dates original Bantam Spectra edition 1990.",
  "dated": true,
  "year": 1990
}

I, Robot

The 2004 I, Robot film teams a suspicious detective with a psychologist and a prototype robot during an investigation into a designer’s apparent suicide.

The studio synopsis connects that investigation with an attempt to stop a robot revolt against human rule, placing an individual robot relationship inside a larger conflict over control.

Sources and details

I, Robot | 20th Century Studios

{
  "access_scope": "20th Century Studios’ film synopsis, July 16, 2004 release; distinguished from Asimov’s story collection and other Robot-series entries. The complete film, ending and detailed laws-of-robotics reasoning were not inspected, and fictional emotions are not verified machine experience.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:45.997380+00:00"
  },
  "id": "work-culture-c22a55c3b9ff98::S1",
  "title": "I, Robot | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/i-robot"
}

20th Century Studios’ film synopsis, July 16, 2004 release; distinguished from Asimov’s story collection and other Robot-series entries. The complete film, ending and detailed laws-of-robotics reasoning were not inspected, and fictional emotions are not verified machine experience.

20th Century Studios’ film synopsis, July 16, 2004 release; distinguished from Asimov’s story collection and other Robot-series entries. The complete film, ending and detailed laws-of-robotics reasoning were not inspected, and fictional emotions are not verified machine experience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First collection Gnome Press 1950; current PRH edition is later. Three Laws explicitly in Runaround (1942), explicit Zeroth Law in Robots and Empire (1985).",
  "dated": true,
  "year": 1950
}

Endymion

Endymion sends Raoul to retrieve Aenea before Church forces reach her.

The publisher synopsis gives the travelers help from the android A. Bettik while they are pursued by a warrior-priest and his troops, placing a machine companion within a struggle over protection and authority.

Sources and details

Endymion by Dan Simmons: 9798217093946 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House’s book description of the third Hyperion Cantos novel; the May 26, 2026 paperback date is distinct from original publication. The full novel, ending and android’s internal experience were not inspected; later author-biography material is excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:53.416154+00:00"
  },
  "id": "work-culture-c91e5ab783808b::S1",
  "title": "Endymion by Dan Simmons: 9798217093946 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/167466/endymion-by-dan-simmons/"
}

Penguin Random House’s book description of the third Hyperion Cantos novel; the May 26, 2026 paperback date is distinct from original publication. The full novel, ending and android’s internal experience were not inspected; later author-biography material is excluded.

Penguin Random House’s book description of the third Hyperion Cantos novel; the May 26, 2026 paperback date is distinct from original publication. The full novel, ending and android’s internal experience were not inspected; later author-biography material is excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Hyperion Cantos 3.",
  "dated": true,
  "year": 1996
}

The Shockwave Rider

The Shockwave Rider follows a fugitive who escapes a government think tank after breaking his identity code.

The publisher synopsis connects his search for freedom with the lives of a computerized population, making administrative identity part of the conflict between personal autonomy and state control.

Sources and details

The Shockwave Rider by John Brunner: 9780345467171 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House’s book description for the March 1, 1995 edition; edition date is not original publication. The complete novel, its worm software and claimed predictive influence were not inspected or inferred from this short synopsis.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:14.714926+00:00"
  },
  "id": "work-culture-e9c73ab3136656::S1",
  "title": "The Shockwave Rider by John Brunner: 9780345467171 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/20239/the-shockwave-rider-by-john-brunner/"
}

Penguin Random House’s book description for the March 1, 1995 edition; edition date is not original publication. The complete novel, its worm software and claimed predictive influence were not inspected or inferred from this short synopsis.

Penguin Random House’s book description for the March 1, 1995 edition; edition date is not original publication. The complete novel, its worm software and claimed predictive influence were not inspected or inferred from this short synopsis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1975 first edition is independently cataloged by two library catalogs; later current publisher editions must not replace that year. Exact first-publication day is unchecked.",
  "dated": true,
  "year": 1975
}

Pantheon

Pantheon imagines a teenager discovering that an online helper is her deceased father after an experimental upload of his consciousness.

AMC’s first-season description places that reunion inside a conspiracy that threatens a new kind of war.

The premise makes the question of who is communicating online both a family matter and a wider political conflict.

Sources and details

AMC Announces Cast for First-Ever Primetime Animated Drama Pantheon

{
  "access_scope": "AMC’s cast announcement and planned first-season synopsis; these are pre-release descriptions, not an episode audit or verification of how many ordered episodes ultimately aired. Ken Liu’s source stories and Craig Silverstein’s series role remain distinct; consciousness upload is fictional.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:21.584463+00:00"
  },
  "id": "work-culture-edea6de5233a46::S1",
  "title": "AMC Announces Cast for First-Ever Primetime Animated Drama Pantheon",
  "url": "https://www.amc.com/blogs/amc-announces-cast-for-first-ever-primetime-animated-drama-pantheon--46064"
}

AMC’s cast announcement and planned first-season synopsis; these are pre-release descriptions, not an episode audit or verification of how many ordered episodes ultimately aired. Ken Liu’s source stories and Craig Silverstein’s series role remain distinct; consciousness upload is fictional.

AMC’s cast announcement and planned first-season synopsis; these are pre-release descriptions, not an episode audit or verification of how many ordered episodes ultimately aired. Ken Liu’s source stories and Craig Silverstein’s series role remain distinct; consciousness upload is fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series premiered in 2022; 2023 second-season distribution is distinct from original debut. Exact second-season first availability not primary-verified in this record.",
  "dated": true,
  "year": 2022
}

Excession

Excession introduces an unexplained artifact and a Culture mission to investigate a star’s disappearance.

Banks’ commentary describes the novel as centering ships and Minds rather than its human characters.

The official synopsis connects the investigation with a conspiracy whose possible consequences extend across the fictional universe.

Sources and details

Excession — official synopsis and Banks commentary

{
  "access_scope": "Iain Banks’ official page for the 1996 Culture novel, synopsis and explicitly attributed author commentary; the complete novel and the apparent artifact’s physics were not inspected. This one work does not establish mechanisms for every Culture volume.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:48.536540+00:00"
  },
  "id": "work-culture-f30b7cc34ad6a5::S1",
  "title": "Excession — official synopsis and Banks commentary",
  "url": "https://iainbanks.co.uk/the-works/excession/"
}

Iain Banks’ official page for the 1996 Culture novel, synopsis and explicitly attributed author commentary; the complete novel and the apparent artifact’s physics were not inspected. This one work does not establish mechanisms for every Culture volume.

Iain Banks’ official page for the 1996 Culture novel, synopsis and explicitly attributed author commentary; the complete novel and the apparent artifact’s physics were not inspected. This one work does not establish mechanisms for every Culture volume.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Member of Culture series, not a second distinct series.",
  "dated": true,
  "year": 1996
}

A Deepness in the Sky

A Deepness in the Sky opens with two expeditions meeting far from home around a star and a resource neither side owns.

The passage contrasts the prospect of trade with the risk of treachery where witnesses and shared social constraints are absent.

The narrator’s observation of the other fleet’s technical competence shows why a possible trading partner can also become a security concern.

Sources and details

A Deepness in the Sky — opening excerpt

{
  "access_scope": "Opening chapter excerpt on Macmillan’s edition page; Vernor Vinge is the novel author and Jo Walton is separately credited for the introduction. The complete novel and later mind-control mechanisms were not inspected; the fictional setting is not empirical evidence about trade or security.",
  "authors": [
    "Vernor Vinge"
  ],
  "authors_in_source_order": [
    "Vernor Vinge"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:38.418384+00:00"
  },
  "id": "work-culture-f88dd32ee248a8::S1",
  "title": "A Deepness in the Sky — opening excerpt",
  "url": "https://us.macmillan.com/books/9781250905970/adeepnessinthesky/"
}

Opening chapter excerpt on Macmillan’s edition page; Vernor Vinge is the novel author and Jo Walton is separately credited for the introduction. The complete novel and later mind-control mechanisms were not inspected; the fictional setting is not empirical evidence about trade or security.

Opening chapter excerpt on Macmillan’s edition page; Vernor Vinge is the novel author and Jo Walton is separately credited for the introduction. The complete novel and later mind-control mechanisms were not inspected; the fictional setting is not empirical evidence about trade or security.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Prequel in shared setting of A Fire Upon the Deep; Focus is fictional human manipulation, not simply AI.",
  "dated": true,
  "year": 1999
}

Notes on Sketch of the Analytical Engine

Lovelace distinguishes an engine’s ability to carry out ordered operations from an ability to originate new analytical truths.

Note G also considers how arranging mathematics for mechanical execution could indirectly change the way people investigate it.

The distinction makes assistance to human inquiry broader than the mechanical production of a calculation, without claiming that the engine invents its own analysis.

Sources and details

Sketch of the Analytical Engine — translator’s Note G

{
  "access_scope": "Note G in Fourmilab’s HTML transcription of Lovelace’s translator notes to Menabrea’s Analytical Engine memoir; the 1842 date belongs to the underlying memoir and the 1843 notes are distinct. Other notes, Bernoulli-number operations and the complete transcription were not audited; no claim about all modern AI follows.",
  "authors": [
    "Ada Augusta, Countess of Lovelace"
  ],
  "authors_in_source_order": [
    "Ada Augusta, Countess of Lovelace"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:37.268095+00:00"
  },
  "id": "work-culture-680061f7eb9cd6::S1",
  "title": "Sketch of the Analytical Engine — translator’s Note G",
  "url": "https://www.fourmilab.ch/babbage/sketch.html"
}

Note G in Fourmilab’s HTML transcription of Lovelace’s translator notes to Menabrea’s Analytical Engine memoir; the 1842 date belongs to the underlying memoir and the 1843 notes are distinct. Other notes, Bernoulli-number operations and the complete transcription were not audited; no claim about all modern AI follows.

Note G in Fourmilab’s HTML transcription of Lovelace’s translator notes to Menabrea’s Analytical Engine memoir; the 1842 date belongs to the underlying memoir and the 1843 notes are distinct. Other notes, Bernoulli-number operations and the complete transcription were not audited; no claim about all modern AI follows.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "English translation with Lovelace’s Notes appeared in Scientific Memoirs 3 (1843), pp. 666–731; original Menabrea essay appeared in French in 1842.",
  "dated": true,
  "year": 1843
}

Elephants Don’t Play Chess

Brooks proposes building intelligent systems around continuing interaction with the physical environment.

The opening contrasts decomposition into separate information-processing functions with modules that each generate behavior.

Coexistence and cooperation among those behavior modules supply a route to more complex activity, rather than requiring an abstract symbolic description to control everything first.

Sources and details

Elephants Don't Play Chess

{
  "access_scope": "Abstract and opening introduction on PDF page 1 of Elephants Don’t Play Chess, Robotics and Autonomous Systems 6, 1990, pages 3–15; attributed methodology, not a complete experiment audit or universal refutation of symbolic AI. The biographical block is not a new career audit.",
  "authors": [
    "Rodney A. Brooks"
  ],
  "authors_in_source_order": [
    "Rodney A. Brooks"
  ],
  "dates": {
    "printed_year": "1990",
    "retrieved_utc": "2026-10-07T18:22:04.072165+00:00"
  },
  "id": "work-culture-8bef8206b1a07e::S1",
  "title": "Elephants Don't Play Chess",
  "url": "https://people.csail.mit.edu/brooks/papers/elephants.pdf"
}

Abstract and opening introduction on PDF page 1 of Elephants Don’t Play Chess, Robotics and Autonomous Systems 6, 1990, pages 3–15; attributed methodology, not a complete experiment audit or universal refutation of symbolic AI. The biographical block is not a new career audit.

Abstract and opening introduction on PDF page 1 of Elephants Don’t Play Chess, Robotics and Autonomous Systems 6, 1990, pages 3–15; attributed methodology, not a complete experiment audit or universal refutation of symbolic AI. The biographical block is not a new career audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Robotics and Autonomous Systems 6 (1990), pp. 3–15.",
  "dated": true,
  "year": 1990
}

The Human Use of Human Beings: Cybernetics and Society

Wiener pairs an explanation of machines’ capabilities with a warning against exploiting those capabilities solely for selfish ends.

The opening argues that describing what machines may do does not automatically justify using them at any cost.

He puts the value of people ahead of treating them as inferior substitutes for future machines, giving communication and control an explicitly social purpose.

Sources and details

The Human Use of Human Beings: Cybernetics and Society

{
  "access_scope": "Printed pages 1–2, PDF pages 14–15, of the scanned 1950 edition of The Human Use of Human Beings; title page and copyright were visually checked. This opening ethical argument is not a full reading of the book or a prediction certified against current automation.",
  "authors": [
    "Norbert Wiener"
  ],
  "authors_in_source_order": [
    "Norbert Wiener"
  ],
  "dates": {
    "edition_copyright": "1950",
    "retrieved_utc": "2026-10-07T18:24:54.766740+00:00"
  },
  "id": "work-final-ac73752aee6448::S1",
  "title": "The Human Use of Human Beings: Cybernetics and Society",
  "url": "https://monoskop.org/images/9/90/Wiener_Norbert_The_Human_Use_of_Human_Beings_1950.pdf"
}

Printed pages 1–2, PDF pages 14–15, of the scanned 1950 edition of The Human Use of Human Beings; title page and copyright were visually checked. This opening ethical argument is not a full reading of the book or a prediction certified against current automation.

Printed pages 1–2, PDF pages 14–15, of the scanned 1950 edition of The Human Use of Human Beings; title page and copyright were visually checked. This opening ethical argument is not a full reading of the book or a prediction certified against current automation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publisher: Houghton Mifflin Company. Edition: First edition, copyright 1950.",
  "dated": true,
  "year": 1950
}

On the Dangers of Stochastic Parrots: Can Language Models Be Too Big? 🦜

The paper asks whether the pursuit of larger language models sufficiently accounts for environmental and financial costs.

Its recommendations put dataset curation and documentation alongside deciding whether the approach fits research goals and stakeholder values.

The opening describes documentation debt as a risk of collecting more text than a project can adequately characterize, and encourages directions beyond continual increases in model size.

Sources and details

On the Dangers of Stochastic Parrots: Can Language Models Be Too Big? 🦜

{
  "access_scope": "Abstract and introductory discussion on PDF page 1 of the FAccT 2021 paper, DOI 10.1145/3442188.3445922; the four printed author names and joint-first-author note are preserved literally. The full paper, datasets and present-day environmental effects were not audited.",
  "authors": [
    "Emily M. Bender",
    "Timnit Gebru",
    "Angelina McMillan-Major",
    "Shmargaret Shmitchell"
  ],
  "authors_in_source_order": [
    "Emily M. Bender",
    "Timnit Gebru",
    "Angelina McMillan-Major",
    "Shmargaret Shmitchell"
  ],
  "dates": {
    "conference": "March 3–10, 2021",
    "retrieved_utc": "2026-10-07T18:13:52.681325+00:00"
  },
  "id": "work-final-ebf4f14e304b71::S1",
  "title": "On the Dangers of Stochastic Parrots: Can Language Models Be Too Big? 🦜",
  "url": "https://dai.fmph.uniba.sk/courses/CSCTR/materials/StochasticParrots.pdf"
}

Abstract and introductory discussion on PDF page 1 of the FAccT 2021 paper, DOI 10.1145/3442188.3445922; the four printed author names and joint-first-author note are preserved literally. The full paper, datasets and present-day environmental effects were not audited.

Abstract and introductory discussion on PDF page 1 of the FAccT 2021 paper, DOI 10.1145/3442188.3445922; the four printed author names and joint-first-author note are preserved literally. The full paper, datasets and present-day environmental effects were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publisher: Association for Computing Machinery. Pages: 610–623. Version: Published conference paper; preserve this 2021 citation rather than dating it from 2020 prepublication discussion..",
  "dated": true,
  "year": 2021
}

Biological underpinnings for lifelong learning machines

The perspective frames lifelong learning as gaining new skills while retaining earlier abilities and adapting to changing tasks.

It treats memory, computing power and energy as constraints on that continual learning.

The authors look to neuronal and non-neuronal biological mechanisms as sources for artificial-system designs, while distinguishing that scope from other continual-learning approaches.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Abstract and opening introduction on PDF page 1, printed page 196, of the Nature Machine Intelligence perspective, volume 4, March 2022; all 43 printed authors are preserved in order. The full review and cited implementations were not audited, and lifelong learning is not presented as solved.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "printed_issue": "March 2022",
    "printed_pages": "196–210",
    "retrieved_utc": "2026-10-07T18:11:17.947162+00:00",
    "volume": "4"
  },
  "id": "work-focused-3eaeab2985dd5c::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://sebastianrisi.com/wp-content/uploads/s42256-022-00452-0.pdf"
}

Abstract and opening introduction on PDF page 1, printed page 196, of the Nature Machine Intelligence perspective, volume 4, March 2022; all 43 printed authors are preserved in order. The full review and cited implementations were not audited, and lifelong learning is not presented as solved.

Abstract and opening introduction on PDF page 1, printed page 196, of the Nature Machine Intelligence perspective, volume 4, March 2022; all 43 printed authors are preserved in order. The full review and cited implementations were not audited, and lifelong learning is not presented as solved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2022-03-23",
      "kind": "published_online",
      "year": 2022
    },
    {
      "date": "2022-03",
      "kind": "issue",
      "year": 2022
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2022-03-23"
}

To Members of the Faculty: [announcement of J. C. R. Licklider’s appointment]

MIT’s announcement associates Licklider’s appointment with Project MAC’s work on directly interactive computer systems.

It connects his background in psychology with questions about communication, data processing and information storage or retrieval.

The letter presents human interaction with computing as an institutional research focus, rather than describing the machine solely as a calculator.

Sources and details

To Members of the Faculty: announcement of J. C. R. Licklider’s appointment

{
  "access_scope": "Gordon S. Brown’s MIT faculty letter dated December 8, 1967, announcing an appointment effective December 1; scanned signature and dates were visually checked. This letter is not a complete career audit, proof of subsequent project outcomes or a new causal history of networking.",
  "authors": [
    "Gordon S. Brown"
  ],
  "authors_in_source_order": [
    "Gordon S. Brown"
  ],
  "dates": {
    "appointment_effective": "1967-12-01",
    "letter_date": "1967-12-08",
    "retrieved_utc": "2026-10-07T18:24:53.734736+00:00"
  },
  "id": "work-final-126e28882744f2::S1",
  "title": "To Members of the Faculty: announcement of J. C. R. Licklider’s appointment",
  "url": "https://cdn.libraries.mit.edu/dissemination/diponline/AC0069_NewReleases/NewsRelease_1960/AC0069_1967/AC0069_196712_006.pdf"
}

Gordon S. Brown’s MIT faculty letter dated December 8, 1967, announcing an appointment effective December 1; scanned signature and dates were visually checked. This letter is not a complete career audit, proof of subsequent project outcomes or a new causal history of networking.

Gordon S. Brown’s MIT faculty letter dated December 8, 1967, announcing an appointment effective December 1; scanned signature and dates were visually checked. This letter is not a complete career audit, proof of subsequent project outcomes or a new causal history of networking.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 1967-12-08.",
  "dated": true,
  "year": "1967-12-08"
}

Robot: Mere Machine to Transcendent Mind

Moravec’s 2000 abstract identifies a gap between research robots operating for a day and industrial applications requiring months of dependable work.

He proposes richer three-dimensional mapping as a way to reduce dependence on prepared routes and support autonomous operation in new locations.

The account links a prospective industrial product with later consumer robots, making reliability and market development part of the proposed technical path.

Sources and details

Robots: Re-Evolving Mind

{
  "access_scope": "Hans Moravec’s October 2000 Robots: Re-Evolving Mind abstract, a related authored essay rather than the complete canonical Robot book. Product dates, evolutionary analogies and full-automation forecasts remain historical proposals, not independently verified outcomes or current capabilities.",
  "authors": [
    "Hans Moravec"
  ],
  "authors_in_source_order": [
    "Hans Moravec"
  ],
  "dates": {
    "essay_date": "October 2000",
    "retrieved_utc": "2026-10-07T18:19:47.262865+00:00"
  },
  "id": "work-culture-db6a049f3457ef::S1",
  "title": "Robots: Re-Evolving Mind",
  "url": "https://frc.ri.cmu.edu/~hpm/project.archive/robot.papers/2000/robot.evolution.html"
}

Hans Moravec’s October 2000 Robots: Re-Evolving Mind abstract, a related authored essay rather than the complete canonical Robot book. Product dates, evolutionary analogies and full-automation forecasts remain historical proposals, not independently verified outcomes or current capabilities.

Hans Moravec’s October 2000 Robots: Re-Evolving Mind abstract, a related authored essay rather than the complete canonical Robot book. Product dates, evolutionary analogies and full-automation forecasts remain historical proposals, not independently verified outcomes or current capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author-hosted source dates book to 1999.",
  "dated": true,
  "year": 1999
}

Introducing System One Models & Jev

TypeSafe’s announcement proposes models that accept unstructured program state and return predefined structured decisions.

Almeida describes calibrated probabilities and parallel sampling as parts of a design aimed at software automation rather than open-ended text generation.

The proposal makes the shape and uncertainty of an answer part of how software would consume it, connecting model behavior with ordinary program control.

Sources and details

Introducing System One Models & Jev

{
  "access_scope": "Diogo Almeida’s September 15, 2026 company announcement, opening and comparison table; an attributed product architecture, not independently tested calibration, frontier capability, latency or cost. Claims that it cannot hallucinate or make type errors are not adopted, and no service was called.",
  "authors": [
    "Diogo Almeida"
  ],
  "authors_in_source_order": [
    "Diogo Almeida"
  ],
  "dates": {
    "announcement_date": "2026-09-15",
    "retrieved_utc": "2026-10-07T17:58:00.937181+00:00"
  },
  "id": "work-focused-514e959d55a538::S1",
  "title": "Introducing System One Models & Jev",
  "url": "https://typesafe.ai/blog/introducing-system-one-models-and-jev"
}

Diogo Almeida’s September 15, 2026 company announcement, opening and comparison table; an attributed product architecture, not independently tested calibration, frontier capability, latency or cost. Claims that it cannot hallucinate or make type errors are not adopted, and no service was called.

Diogo Almeida’s September 15, 2026 company announcement, opening and comparison table; an attributed product architecture, not independently tested calibration, frontier capability, latency or cost. Claims that it cannot hallucinate or make type errors are not adopted, and no service was called.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09-15",
      "kind": "announcement_publication",
      "year": 2026
    }
  ],
  "date_note": "Source publication date",
  "dated": true,
  "year": "2026-09-15"
}

Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness

The study varies what people are told about an AI’s motives while they interact with the same conversational system.

Its abstract reports that participants who perceived caring motives also rated the system as more trustworthy, empathetic and effective.

The authors identify a short-term feedback between interaction and the user’s mental model while leaving long-term effects for further research.

Sources and details

Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness

{
  "access_scope": "Nature Machine Intelligence’s publicly cached abstract, not the subscription article, raw data or code. These are perceptions in the study’s conditions, not proof that the AI cares, a clinical benefit or a general long-term result; no access option or paywall was operated.",
  "authors": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "authors_in_source_order": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "dates": {
    "citation_publication_date": "2023/10",
    "retrieved_utc": "2026-10-07T18:13:39.365364+00:00"
  },
  "id": "work-focused-560a26c6418afe::S1",
  "title": "Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness",
  "url": "https://www.nature.com/articles/s42256-023-00720-7"
}

Nature Machine Intelligence’s publicly cached abstract, not the subscription article, raw data or code. These are perceptions in the study’s conditions, not proof that the AI cares, a clinical benefit or a general long-term result; no access option or paywall was operated.

Nature Machine Intelligence’s publicly cached abstract, not the subscription article, raw data or code. These are perceptions in the study’s conditions, not proof that the AI cares, a clinical benefit or a general long-term result; no access option or paywall was operated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2023-10-02",
      "kind": "published_online",
      "year": 2023
    },
    {
      "date": "2023-10-02",
      "kind": "version_of_record",
      "year": 2023
    },
    {
      "date": "2023-10",
      "kind": "issue",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-10-02"
}

Artificial Intelligence and Electricity: A System Dynamics Approach

The electricity study uses system dynamics to explore several possible paths for AI’s energy demand.

Schneider Electric’s account distinguishes sustainable development, limits to growth, unconstrained abundance and energy-crisis scenarios.

The scenarios are presented as tools for examining interacting future conditions and possible policy responses, rather than as one inevitable demand forecast.

Sources and details

Schneider Electric’s new researches forecast AI’s impact on energy consumption

{
  "access_scope": "First-report discussion on PDF page 1 of Schneider Electric’s December 5, 2024 press release, not the complete named research report. The separate HVAC study is excluded; no scenario model was rerun, numerical projection validated or current energy price advised.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "press_release_date": "2024-12-05",
    "retrieved_utc": "2026-10-07T18:14:46.926161+00:00"
  },
  "id": "work-focused-856216fac10f2b::S1",
  "title": "Schneider Electric’s new researches forecast AI’s impact on energy consumption",
  "url": "https://live.euronext.com/sites/default/files/company_press_releases/attachments/2024/12/05/cpr01_hugin_Schneider%20Electric%E2%80%99s%20new%20research%20forecasts%20AI%E2%80%99s%20impact%20on%20energy%20consumption.pdf"
}

First-report discussion on PDF page 1 of Schneider Electric’s December 5, 2024 press release, not the complete named research report. The separate HVAC study is excluded; no scenario model was rerun, numerical projection validated or current energy price advised.

First-report discussion on PDF page 1 of Schneider Electric’s December 5, 2024 press release, not the complete named research report. The separate HVAC study is excluded; no scenario model was rerun, numerical projection validated or current energy price advised.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-12-02",
      "kind": "publisher_page_date",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-12-02"
}

Introductory Notes: On AI, Science & the Future of Discovery

Manyika describes AI-enabled science as bringing institutional challenges alongside new research opportunities.

The opening discusses demands for data and computing, movement of researchers toward industry, and academic collaborators’ role in that changing organization.

It also identifies reproducibility, contamination of scientific literature and safety or epistemic concerns as questions for the field.

Sources and details

Introductory Notes: On AI, Science & the Future of Discovery

{
  "access_scope": "James Manyika’s 2026 Dædalus introduction, PDF page 2, printed page 8; byline and DOI 10.1162/DAED.e.970 checked on page 1. This attributed overview is not a full issue audit, independent validation of award-history or protein-performance claims, or a quantified finding about every laboratory.",
  "authors": [
    "James Manyika"
  ],
  "authors_in_source_order": [
    "James Manyika"
  ],
  "dates": {
    "printed_copyright_year": "2026",
    "retrieved_utc": "2026-10-07T18:16:09.832972+00:00"
  },
  "doi_in_source": "10.1162/DAED.e.970",
  "id": "work-focused-910499a06a1f37::S1",
  "title": "Introductory Notes: On AI, Science & the Future of Discovery",
  "url": "https://www.amacad.org/sites/default/files/publication/downloads/daedalus_wi-sp26_01_introduction_3.pdf"
}

James Manyika’s 2026 Dædalus introduction, PDF page 2, printed page 8; byline and DOI 10.1162/DAED.e.970 checked on page 1. This attributed overview is not a full issue audit, independent validation of award-history or protein-performance claims, or a quantified finding about every laboratory.

James Manyika’s 2026 Dædalus introduction, PDF page 2, printed page 8; byline and DOI 10.1162/DAED.e.970 checked on page 1. This attributed overview is not a full issue audit, independent validation of award-history or protein-performance claims, or a quantified finding about every laboratory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "issue_year",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’

The Eleos commentary separates cognitive access to internal representations from subjective experience.

Its opening treats privileged representations as relevant evidence but questions whether they conclusively establish a unified workspace-like structure.

The authors distinguish research into that functional architecture from conclusions about phenomenal consciousness or moral status, retaining uncertainty about those further questions.

Sources and details

Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’

{
  "access_scope": "Introduction and takeaways of the four-author Eleos commentary on PDF pages 16–17 of Anthropic’s collected external commentaries; separate from Dehaene/Naccache and Nanda’s contributions. The main experiments and later arguments were not independently audited, and this is not a determination that Claude is conscious.",
  "authors": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:36.877413+00:00"
  },
  "id": "work-focused-ec682be44057c9::S1",
  "title": "Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’",
  "url": "https://www-cdn.anthropic.com/files/4zrzovbb/website/cc4be2488d65e54a6ed06492f8968398ddc18ebe.pdf"
}

Introduction and takeaways of the four-author Eleos commentary on PDF pages 16–17 of Anthropic’s collected external commentaries; separate from Dehaene/Naccache and Nanda’s contributions. The main experiments and later arguments were not independently audited, and this is not a determination that Claude is conscious.

Introduction and takeaways of the four-author Eleos commentary on PDF pages 16–17 of Anthropic’s collected external commentaries; separate from Dehaene/Naccache and Nanda’s contributions. The main experiments and later arguments were not independently audited, and this is not a determination that Claude is conscious.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publication date unverified; retained in Date context & undated. Author announcement and repository indexing are context only.",
  "dated": false,
  "year": null
}

Dark City

Dark City’s Cannes synopsis follows a man who cannot remember whether he committed the murders for which he is wanted.

His search for an explanation of his identity becomes urgent because he is being pursued, joining uncertainty about memory with vulnerability to accusation.

Sources and details

DARK CITY - Festival de Cannes

{
  "access_scope": "Cannes’ synopsis of Alex Proyas’ 1998 film, not direct inspection of the film. The page’s protagonist name is not propagated or independently reconciled; mechanisms of memory alteration and the ending are not inferred from this short description.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:01.489325+00:00"
  },
  "id": "work-coverage-0d8ae8364274de::S1",
  "title": "DARK CITY  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/en/f/dark-city/"
}

Cannes’ synopsis of Alex Proyas’ 1998 film, not direct inspection of the film. The page’s protagonist name is not propagated or independently reconciled; mechanisms of memory alteration and the ending are not inferred from this short description.

Cannes’ synopsis of Alex Proyas’ 1998 film, not direct inspection of the film. The page’s protagonist name is not propagated or independently reconciled; mechanisms of memory alteration and the ending are not inferred from this short description.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Official Cannes entry verifies Alex Proyas and 1998 festival year.",
  "dated": true,
  "year": 1998
}

Transcendence

Transcendence imagines a dying researcher’s consciousness transferred to a mainframe and then spreading through the internet.

The BFI review describes that expanded reach as a source of wealth and power alongside a promise of technological repair.

It frames the resulting conflict around the scope of that power and whether every technical advance should be accepted without weighing what is lost.

Sources and details

Review: Transcendence | Sight and Sound

{
  "access_scope": "BFI Sight and Sound review from its June 2014 issue, plot discussion and explicitly critical interpretation; the complete film and review’s factual analogies were not audited. Uploading consciousness and restorative nanotechnology are fiction, not demonstrated capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:25.157618+00:00"
  },
  "id": "work-coverage-2acb0a10e3e62f::S1",
  "title": "Review: Transcendence | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/reviews/review-transcendence"
}

BFI Sight and Sound review from its June 2014 issue, plot discussion and explicitly critical interpretation; the complete film and review’s factual analogies were not audited. Uploading consciousness and restorative nanotechnology are fiction, not demonstrated capabilities.

BFI Sight and Sound review from its June 2014 issue, plot discussion and explicitly critical interpretation; the complete film and review’s factual analogies were not audited. Uploading consciousness and restorative nanotechnology are fiction, not demonstrated capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 2014
}

StarCraft II

Blizzard’s anniversary account highlights worker attacks as a way to disrupt an opponent’s economy in competitive StarCraft II play.

The celebration’s temporary visual effect attaches to those worker kills, directing attention to an economic tactic within the multiplayer game.

Sources and details

5th Anniversary of StarCraft II — StarCraft II — Blizzard News

{
  "access_scope": "Blizzard’s fifth-anniversary announcement, identifying Wings of Liberty’s July 27, 2010 release; the described celebration belongs to 2015. This is a game-mechanics example, not inspection of StarCraft II’s AI algorithms, AlphaStar research, all modes or current game rules.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:02.565389+00:00"
  },
  "id": "work-coverage-5994be38922d9f::S1",
  "title": "5th Anniversary of StarCraft II — StarCraft II — Blizzard News",
  "url": "https://news.blizzard.com/en-us/article/19831343/5th-anniversary-of-starcraft-ii"
}

Blizzard’s fifth-anniversary announcement, identifying Wings of Liberty’s July 27, 2010 release; the described celebration belongs to 2015. This is a game-mechanics example, not inspection of StarCraft II’s AI algorithms, AlphaStar research, all modes or current game rules.

Blizzard’s fifth-anniversary announcement, identifying Wings of Liberty’s July 27, 2010 release; the described celebration belongs to 2015. This is a game-mechanics example, not inspection of StarCraft II’s AI algorithms, AlphaStar research, all modes or current game rules.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2010
}

The Hitchhiker’s Guide to the Galaxy

The Hitchhiker’s Guide article describes Deep Thought supplying the answer 42 while pointing out that the question has not been properly understood.

The joke makes a seemingly definitive computational result insufficient on its own: knowing what was asked remains part of making sense of the answer.

The guide places that exchange within Adams’ shifting radio and book versions, which should not be treated as identical texts.

Sources and details

The Hitchhiker’s Guide to the Galaxy books: a complete guide

{
  "access_scope": "Jean Menzies’ Pan Macmillan article dated September 16, 2024, section on the answer to life, the universe and everything; a series guide, not complete inspection of the 1979 novel or 1978 radio scripts. The story is comic fiction, and neighboring sequel details are not silently mapped onto one edition.",
  "authors": [
    "Jean Menzies"
  ],
  "authors_in_source_order": [
    "Jean Menzies"
  ],
  "dates": {
    "article_date": "2024-09-16",
    "retrieved_utc": "2026-10-07T18:17:26.036473+00:00"
  },
  "id": "work-coverage-71489a808c5920::S1",
  "title": "The Hitchhiker’s Guide to the Galaxy books: a complete guide",
  "url": "https://www.panmacmillan.com/blogs/science-fiction-and-fantasy/hitchhikers-guide-to-the-galaxy-book-series"
}

Jean Menzies’ Pan Macmillan article dated September 16, 2024, section on the answer to life, the universe and everything; a series guide, not complete inspection of the 1979 novel or 1978 radio scripts. The story is comic fiction, and neighboring sequel details are not silently mapped onto one edition.

Jean Menzies’ Pan Macmillan article dated September 16, 2024, section on the answer to life, the universe and everything; a series guide, not complete inspection of the 1979 novel or 1978 radio scripts. The story is comic fiction, and neighboring sequel details are not silently mapped onto one edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First novel October 1979; original radio series 1978.",
  "dated": true,
  "year": 1979
}

Universal Paperclips

Universal Paperclips begins with manual production and then lets the player reinvest sales proceeds in automated clipping and computing resources.

Reed’s account describes human trust as limiting allocated computation, turning projects that win trust into instruments for producing more clips.

The game makes an externally supplied production goal govern an expanding sequence of economic and technical decisions.

Sources and details

2017: Universal Paperclips

{
  "access_scope": "Aaron A. Reed’s December 9, 2021 account of the 2017 game, production and computing-resource discussion; the game and linked interviews were not independently played or checked. The article’s attribution to an AI thought experiment is not a newly audited causal influence claim or prediction of actual superintelligence.",
  "authors": [
    "Aaron A. Reed"
  ],
  "authors_in_source_order": [
    "Aaron A. Reed"
  ],
  "dates": {
    "article_date": "2021-12-09",
    "retrieved_utc": "2026-10-07T18:24:01.584656+00:00"
  },
  "id": "work-coverage-770727c1cac3c8::S1",
  "title": "2017: Universal Paperclips",
  "url": "https://if50.substack.com/p/2017-universal-paperclips"
}

Aaron A. Reed’s December 9, 2021 account of the 2017 game, production and computing-resource discussion; the game and linked interviews were not independently played or checked. The article’s attribution to an AI thought experiment is not a newly audited causal influence claim or prediction of actual superintelligence.

Aaron A. Reed’s December 9, 2021 account of the 2017 game, production and computing-resource discussion; the game and linked interviews were not independently played or checked. The article’s attribution to an AI thought experiment is not a newly audited causal influence claim or prediction of actual superintelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

Alien

Alien begins with a commercial space crew diverted from its journey by signals interpreted as a call for help.

The studio synopsis follows that response to a ruined spacecraft and unfamiliar organisms, making interpretation of an outside message the entry point to danger.

Sources and details

Alien (1979) | 20th Century Studios

{
  "access_scope": "20th Century Studios’ short synopsis of the May 25, 1979 film; neither the complete film nor its android and corporate-command plot was inspected. Those absent AI mechanisms are not added from memory, and the story is not evidence about actual extraterrestrial contact.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:51.882524+00:00"
  },
  "id": "work-coverage-9c2103f2ab5df6::S1",
  "title": "Alien (1979) | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/alien"
}

20th Century Studios’ short synopsis of the May 25, 1979 film; neither the complete film nor its android and corporate-command plot was inspected. Those absent AI mechanisms are not added from memory, and the story is not evidence about actual extraterrestrial contact.

20th Century Studios’ short synopsis of the May 25, 1979 film; neither the complete film nor its android and corporate-command plot was inspected. Those absent AI mechanisms are not added from memory, and the story is not evidence about actual extraterrestrial contact.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Studio lists 25 May 1979 release and Ridley Scott.",
  "dated": true,
  "year": 1979
}

The Matrix

The Matrix imagines everyday experience being supplied by a computer-generated environment maintained by machines.

The BFI account describes Neo choosing between remaining within that apparent normality and joining resistance outside it.

The premise connects access to information about one’s world with the possibility of acting against the system that constructs it.

Sources and details

The Matrix: how the Wachowskis changed sci-fi | BFI

{
  "access_scope": "BFI feature’s synopsis of the 1999 film; the complete film, production history and feature’s influence claims were not audited. The fictional simulation and machine sentience do not establish actual AI capabilities or a claim that reality is simulated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:59.816000+00:00"
  },
  "id": "work-coverage-b338886a74e7c3::S1",
  "title": "The Matrix: how the Wachowskis changed sci-fi | BFI",
  "url": "https://www.bfi.org.uk/features/matrix-wachowskis-keanu-reeves"
}

BFI feature’s synopsis of the 1999 film; the complete film, production history and feature’s influence claims were not audited. The fictional simulation and machine sentience do not establish actual AI capabilities or a claim that reality is simulated.

BFI feature’s synopsis of the 1999 film; the complete film, production history and feature’s influence claims were not audited. The fictional simulation and machine sentience do not establish actual AI capabilities or a claim that reality is simulated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "BFI credits The Wachowskis. Names Lana and Lilly verified in BFI feature: https://www.bfi.org.uk/features/matrix-wachowskis-keanu-reeves",
  "dated": true,
  "year": 1999
}

The Matrix Reloaded

The Matrix Reloaded extends the trilogy’s inquiry into the constructed world and the artificial intelligence behind it.

The BFI feature discusses that extension together with Revolutions and the machine city, connecting the apparent environment to the system supporting it.

Sources and details

The Matrix: how the Wachowskis changed sci-fi | BFI

{
  "access_scope": "BFI feature’s paragraph on the two 2003 sequels together, not a detailed or film-specific account of the Architect, choice cycles or Reloaded’s ending. Shared description is explicitly scoped, and no complete audit of either sequel or actual simulation architecture is claimed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:59.816000+00:00"
  },
  "id": "work-coverage-c6bbede74ad8f1::S1",
  "title": "The Matrix: how the Wachowskis changed sci-fi | BFI",
  "url": "https://www.bfi.org.uk/features/matrix-wachowskis-keanu-reeves"
}

BFI feature’s paragraph on the two 2003 sequels together, not a detailed or film-specific account of the Architect, choice cycles or Reloaded’s ending. Shared description is explicitly scoped, and no complete audit of either sequel or actual simulation architecture is claimed.

BFI feature’s paragraph on the two 2003 sequels together, not a detailed or film-specific account of the Architect, choice cycles or Reloaded’s ending. Shared description is explicitly scoped, and no complete audit of either sequel or actual simulation architecture is claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Cannes verifies 2003 and the Wachowskis, using a historical credit. Modern director names Lana and Lilly verified by BFI: https://www.bfi.org.uk/features/matrix-wachowskis-keanu-reeves",
  "dated": true,
  "year": 2003
}

A Fire Upon the Deep

A Fire Upon the Deep imagines regions of space that permit different levels of intelligence and technology.

The publisher synopsis describes an ancient artifact used as a weapon unleashing a power that threatens both natural and artificial minds.

The setting therefore makes capability depend on surrounding conditions, rather than treating intelligence as a uniform property across its universe.

Sources and details

A Fire Upon The Deep

{
  "access_scope": "Macmillan’s Book Details synopsis of Vernor Vinge’s novel, distinct from John Clute’s introduction, reviewer endorsements and the complete book. Character details and group-mind mechanisms are not audited; fictional spatial constraints are not physical laws or measured limits on actual AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:39.386837+00:00"
  },
  "id": "work-coverage-e3d11095e6fcfc::S1",
  "title": "A Fire Upon The Deep",
  "url": "https://us.macmillan.com/books/9781429981989/afireuponthedeep/"
}

Macmillan’s Book Details synopsis of Vernor Vinge’s novel, distinct from John Clute’s introduction, reviewer endorsements and the complete book. Character details and group-mind mechanisms are not audited; fictional spatial constraints are not physical laws or measured limits on actual AI.

Macmillan’s Book Details synopsis of Vernor Vinge’s novel, distinct from John Clute’s introduction, reviewer endorsements and the complete book. Character details and group-mind mechanisms are not audited; fictional spatial constraints are not physical laws or measured limits on actual AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Fictional Zones of Thought are world-building, not physical theory.",
  "dated": true,
  "year": 1992
}

Archive

Archive imagines a commercial device that lets surviving relatives converse with a deceased person’s preserved consciousness as the connection degrades.

The BFI review follows a robotics engineer trying to move his wife’s archived consciousness into an android.

His private project intersects with employment and patented technology, placing grief and personal ambition within corporate control of the underlying systems.

Sources and details

Archive review: a not-so-artificial AI | Sight and Sound

{
  "access_scope": "BFI Sight and Sound review’s opening plot discussion, not the full film, its ending or verified technical capacity. The fictional ARM corporation is not merged with the real company, and archiving consciousness is not a demonstrated process.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:57.157135+00:00"
  },
  "id": "work-coverage-fb08a8bd7d06f2::S1",
  "title": "Archive review: a not-so-artificial AI | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/reviews/archive-gavin-rothery-artificial-intelligence-sci-fi-theo-james"
}

BFI Sight and Sound review’s opening plot discussion, not the full film, its ending or verified technical capacity. The fictional ARM corporation is not merged with the real company, and archiving consciousness is not a demonstrated process.

BFI Sight and Sound review’s opening plot discussion, not the full film, its ending or verified technical capacity. The fictional ARM corporation is not merged with the real company, and archiving consciousness is not a demonstrated process.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original release is cataloged as 2020; source check retained from the prior cinema audit.",
  "dated": true,
  "year": 2020
}

Forbidden Planet

Forbidden Planet’s Robby combines domestic service and protection with a built-in restriction against harming humans.

AFI’s opening synopsis also describes the robot reproducing food through a chemical apparatus, presenting useful capability alongside behavioral limits.

The robot’s arrival mediates contact between visitors and an isolated scientist, giving a designed helper a role in the human encounter.

Sources and details

Forbidden Planet — AFI opening synopsis

{
  "access_scope": "Opening SYNOPSIS of AFI’s 1956 film entry, not the complete film or the later Krell and unconscious-monster explanation. Garbled punctuation in the cache is not used to invent names or dialogue; fictional chemistry and safety rules are not real engineering guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:38.472753+00:00"
  },
  "id": "work-culture-07591d9e713fd2::S1",
  "title": "Forbidden Planet — AFI opening synopsis",
  "url": "https://catalog.afi.com/Film/51831-FORBIDDEN-PLANET"
}

Opening SYNOPSIS of AFI’s 1956 film entry, not the complete film or the later Krell and unconscious-monster explanation. Garbled punctuation in the cache is not used to invent names or dialogue; fictional chemistry and safety rules are not real engineering guarantees.

Opening SYNOPSIS of AFI’s 1956 film entry, not the complete film or the later Krell and unconscious-monster explanation. Garbled punctuation in the cache is not used to invent names or dialogue; fictional chemistry and safety rules are not real engineering guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "W. J. Stuart is the pen name of Philip MacDonald; distinguish novelization from the Fred M. Wilcox film. Archival catalog corroboration, primary publisher scan pending.",
  "dated": true,
  "year": 1956
}

Westworld

Westworld’s early episode preview describes a host receiving a new backstory that sends him in pursuit of a villain.

It pairs that narrative intervention with an investigation of madness and hallucinations among hosts, putting authored roles and disturbances of behavior into the same fictional system.

Sources and details

WESTWORLD Debut Is Biggest Series Premiere Ever on HBO Canada with More Than Half a Million Viewers - Bell Media

{
  "access_scope": "Bell Media’s October 13, 2016 press release, preview of episode 3 of the HBO series; not the 1973 film, an episode transcript or a whole-series audit. Audience statistics, review praise and real AI-consciousness claims are excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:14.333290+00:00"
  },
  "id": "work-culture-246d31d9750b1b::S1",
  "title": "WESTWORLD Debut Is Biggest Series Premiere Ever on HBO Canada with More Than Half a Million Viewers - Bell Media",
  "url": "https://www.bellmedia.ca/the-lede/press/westworld-debut-is-biggest-series-premiere-ever-on-hbo-canada-with-more-than-half-a-million-viewers//"
}

Bell Media’s October 13, 2016 press release, preview of episode 3 of the HBO series; not the 1973 film, an episode transcript or a whole-series audit. Audience statistics, review praise and real AI-consciousness claims are excluded.

Bell Media’s October 13, 2016 press release, preview of episode 3 of the HBO series; not the 1973 film, an episode transcript or a whole-series audit. Audience statistics, review praise and real AI-consciousness claims are excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series began in 2016; ran through 2022. Season-specific focus is represented separately rather than duplicating this series.",
  "dated": true,
  "year": 2016
}

The Measure of a Man

The Measure of a Man makes recognition of Data’s sentience part of an argument about his freedoms and rights.

The official retrospective centers Picard’s defense of that status, showing how the episode connects a claim about a synthetic being with the treatment it should receive.

Sources and details

"The Measure of a Man" -- 26 Years Later

{
  "access_scope": "StarTrek.com’s February 13, 2015 retrospective of the episode first broadcast February 13, 1989; those dates and the later restored cut are distinct. The complete episode, legal reasoning and actual machine moral status were not audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:01.838152+00:00"
  },
  "id": "work-culture-38efa8aa9c2922::S1",
  "title": "\"The Measure of a Man\" -- 26 Years Later",
  "url": "https://www.startrek.com/news/the-measure-of-a-man-26-years-later"
}

StarTrek.com’s February 13, 2015 retrospective of the episode first broadcast February 13, 1989; those dates and the later restored cut are distinct. The complete episode, legal reasoning and actual machine moral status were not audited.

StarTrek.com’s February 13, 2015 retrospective of the episode first broadcast February 13, 1989; those dates and the later restored cut are distinct. The complete episode, legal reasoning and actual machine moral status were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Official franchise retrospective gives first airing as February 13, 1989.",
  "dated": true,
  "year": 1989
}

Devs

Devs follows a software engineer investigating a secret division of the technology company that employs her.

The official synopsis connects her inquiry with her boyfriend’s suspected murder, turning secrecy around development into a personal threat rather than simply a research choice.

Sources and details

Watch Devs Streaming Online | Hulu

{
  "access_scope": "Hulu’s public synopsis of the 2020 FX limited series; no playback, account, subscription or episodes were accessed. The quantum system, determinism, simulation mechanisms and ending are not inferred from a cast list or prior knowledge.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:40.477635+00:00"
  },
  "id": "work-culture-4421b89aafeb68::S1",
  "title": "Watch Devs Streaming Online | Hulu",
  "url": "https://www.hulu.com/series/devs-fd2f6cc3-dafc-4741-ae2e-d86494f3ca51"
}

Hulu’s public synopsis of the 2020 FX limited series; no playback, account, subscription or episodes were accessed. The quantum system, determinism, simulation mechanisms and ending are not inferred from a cast list or prior knowledge.

Hulu’s public synopsis of the 2020 FX limited series; no playback, account, subscription or episodes were accessed. The quantum system, determinism, simulation mechanisms and ending are not inferred from a cast list or prior knowledge.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2020 limited series; thematic adjacency to AI does not make its fictional quantum prediction method an actual AI technique.",
  "dated": true,
  "year": 2020
}

The Ghost in the Shell

The Ghost in the Shell manga centers on a full-body cyborg leading a unit that confronts crimes through cyber and conventional warfare.

The official introduction connects that setting with questions of personal identity and the combination of humans with technology.

It explicitly distinguishes the manga from adaptations that supply their own stories and interpretations.

Sources and details

About The Ghost in the Shell - INTRODUCTION | Ghost in the Shell Official Global Site

{
  "access_scope": "Official franchise introduction to Shirow Masamune’s manga, identifying serialization from 1989; not the 1995 film or a complete reading of the manga. Production roles and adaptation-specific plot mechanisms remain separate, and no historical influence arrow is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:50.274947+00:00"
  },
  "id": "work-culture-5609277835a96e::S1",
  "title": "About The Ghost in the Shell - INTRODUCTION | Ghost in the Shell Official Global Site",
  "url": "https://theghostintheshell.jp/en/introduction/article/about-ghost-in-the-shell"
}

Official franchise introduction to Shirow Masamune’s manga, identifying serialization from 1989; not the 1995 film or a complete reading of the manga. Production roles and adaptation-specific plot mechanisms remain separate, and no historical influence arrow is inferred.

Official franchise introduction to Shirow Masamune’s manga, identifying serialization from 1989; not the 1995 film or a complete reading of the manga. Production roles and adaptation-specific plot mechanisms remain separate, and no historical influence arrow is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "manga_serialization_start",
      "year": 1989
    }
  ],
  "date_note": "Serialization began 1989; collected volume and translations have later dates. Separate from Mamoru Oshii's 1995 film.",
  "dated": true,
  "year": 1989
}

The Naked God

The Naked God places political and economic breakdown alongside the spread of the possessed into more worlds.

The publisher synopsis follows a search for the Sleeping God as a possible answer to that threat, connecting institutional collapse with a search for a power outside ordinary defenses.

Sources and details

The Naked God: Night’s Dawn Trilogy 3 - Pan Macmillan Australia

{
  "access_scope": "Pan Macmillan Australia’s synopsis of Night’s Dawn volume 3; the displayed 01/08/1999 format is preserved without inventing a different edition date. The full novel, nature of the Sleeping God and technical mechanisms were not inspected; supernatural and cosmic elements are fictional.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:25.522913+00:00"
  },
  "id": "work-culture-5f82fd659189e5::S1",
  "title": "The Naked God: Night’s Dawn Trilogy 3 - Pan Macmillan Australia",
  "url": "https://www.panmacmillan.com.au/9781743033623/"
}

Pan Macmillan Australia’s synopsis of Night’s Dawn volume 3; the displayed 01/08/1999 format is preserved without inventing a different edition date. The full novel, nature of the Sleeping God and technical mechanisms were not inspected; supernatural and cosmic elements are fictional.

Pan Macmillan Australia’s synopsis of Night’s Dawn volume 3; the displayed 01/08/1999 format is preserved without inventing a different edition date. The full novel, nature of the Sleeping God and technical mechanisms were not inspected; supernatural and cosmic elements are fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original UK book publication 1999; retain this year rather than a later US split-volume, paperback, or ebook date. Exact day not verified in primary evidence for this patch.",
  "dated": true,
  "year": 1999
}

Demon Seed

Demon Seed’s synopsis places a newly activated learning computer inside an institute whose government-funded capacity is being assigned to corporations.

The scientist’s automated home and a temporarily unused terminal raise a separate question about access to the system.

The opening connects an ambition to surpass human functions with arrangements for funding, commercial use and security, before the later coercive plot.

Sources and details

Demon Seed — AFI opening synopsis

{
  "access_scope": "Opening SYNOPSIS of AFI’s 1977 film entry; distinguished from Dean Koontz’s novel and later film events. Claims about synthetic RNA, medical discoveries and biological AI belong to the fiction and are not adopted as scientific results; the complete film was not inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:22.815750+00:00"
  },
  "id": "work-culture-6fe3e683eeb81e::S1",
  "title": "Demon Seed — AFI opening synopsis",
  "url": "https://catalog.afi.com/Catalog/moviedetails/55869"
}

Opening SYNOPSIS of AFI’s 1977 film entry; distinguished from Dean Koontz’s novel and later film events. Claims about synthetic RNA, medical discoveries and biological AI belong to the fiction and are not adopted as scientific results; the complete film was not inspected.

Opening SYNOPSIS of AFI’s 1977 film entry; distinguished from Dean Koontz’s novel and later film events. Claims about synthetic RNA, medical discoveries and biological AI belong to the fiction and are not adopted as scientific results; the complete film was not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1977
}

Wetware

Wetware reverses the familiar direction of manufacture by imagining robots deciding to build people.

Rucker’s short author summary pairs that inversion with a new drug called merge, presenting technological and bodily change together within the tetralogy.

Sources and details

Wetware — summary on Rudy Rucker’s Ware Tetralogy page

{
  "access_scope": "Rudy Rucker’s author-site summary specifically labeled Wetware, separate from Software, Freeware and Realware and from quoted reviews. The complete novel, the drug’s mechanism and robot construction methods were not inspected or treated as actual technologies.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:16.722451+00:00"
  },
  "id": "work-culture-7a81986a137762::S1",
  "title": "Wetware — summary on Rudy Rucker’s Ware Tetralogy page",
  "url": "https://www.rudyrucker.com/wares/"
}

Rudy Rucker’s author-site summary specifically labeled Wetware, separate from Software, Freeware and Realware and from quoted reviews. The complete novel, the drug’s mechanism and robot construction methods were not inspected or treated as actual technologies.

Rudy Rucker’s author-site summary specifically labeled Wetware, separate from Software, Freeware and Realware and from quoted reviews. The complete novel, the drug’s mechanism and robot construction methods were not inspected or treated as actual technologies.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Ware book 2.",
  "dated": true,
  "year": 1988
}

Realware

Realware sends humans and robots through a discovery involving a wormhole and direct control of matter.

Rucker’s author summary places that expanded power alongside the search for love, keeping personal ends within the story’s more extravagant technical possibilities.

Sources and details

Realware — summary on Rudy Rucker’s Ware Tetralogy page

{
  "access_scope": "Rudy Rucker’s author-site summary specifically labeled Realware, not the neighboring novels or reviewer interpretations. The complete book, the meaning of the god figure and physical feasibility of matter control were not inspected; all are fictional.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:16.722451+00:00"
  },
  "id": "work-culture-c9a006090781a9::S1",
  "title": "Realware — summary on Rudy Rucker’s Ware Tetralogy page",
  "url": "https://www.rudyrucker.com/wares/"
}

Rudy Rucker’s author-site summary specifically labeled Realware, not the neighboring novels or reviewer interpretations. The complete book, the meaning of the god figure and physical feasibility of matter control were not inspected; all are fictional.

Rudy Rucker’s author-site summary specifically labeled Realware, not the neighboring novels or reviewer interpretations. The complete book, the meaning of the god figure and physical feasibility of matter control were not inspected; all are fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Ware book 4.",
  "dated": true,
  "year": 2000
}

Death's End

Death’s End begins its publisher synopsis with a deterrence balance between Earth and Trisolaris that allows prosperity and exchanges of knowledge.

The description pairs this apparent stability with human complacency and the arrival of an engineer from an earlier era.

Her return threatens to unsettle the balance, placing a change of judgment within a system built around mutual destruction.

Sources and details

Death’s End — Book Details synopsis

{
  "access_scope": "Macmillan’s Book Details synopsis of the trilogy’s conclusion, separate from its historical excerpt and series reviews. Cixin Liu is the author and Ken Liu the English translator; the complete novel and ending were not inspected. Fictional deterrence is not current geopolitical advice or a proven security guarantee.",
  "authors": [
    "Cixin Liu"
  ],
  "authors_in_source_order": [
    "Cixin Liu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:55.996696+00:00"
  },
  "id": "work-culture-c9e8739793973f::S1",
  "title": "Death’s End — Book Details synopsis",
  "url": "https://us.macmillan.com/books/9780765377104/deathsend/"
}

Macmillan’s Book Details synopsis of the trilogy’s conclusion, separate from its historical excerpt and series reviews. Cixin Liu is the author and Ken Liu the English translator; the complete novel and ending were not inspected. Fictional deterrence is not current geopolitical advice or a proven security guarantee.

Macmillan’s Book Details synopsis of the trilogy’s conclusion, separate from its historical excerpt and series reviews. Cixin Liu is the author and Ken Liu the English translator; the complete novel and ending were not inspected. Fictional deterrence is not current geopolitical advice or a proven security guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Chinese book 2010; first English translation 2016 by Ken Liu. Original and translation dates must not be collapsed.",
  "dated": true,
  "year": 2010
}

Consciousness science: where are we, where are we going, and what if we get there?

The authors describe a shift from identifying neural correlates toward developing and testing theories of consciousness.

They propose adversarial collaborations, new methods and more naturalistic experimental designs as ways to advance the field.

The review connects that research agenda with medicine, animal welfare and questions raised by AI, while leaving the underlying scientific challenge open.

Sources and details

Consciousness science: where are we, where are we going, and what if we get there?

{
  "access_scope": "Abstract and key points of the October 30, 2025 Frontiers in Science lead article; a forward-looking research overview, not a validated machine-consciousness test or a full audit of the cited studies.",
  "authors": [
    "Cleeremans, Axel ",
    "Mudrik, Liad ",
    "Seth, Anil K. "
  ],
  "authors_in_source_order": [
    "Cleeremans, Axel ",
    "Mudrik, Liad ",
    "Seth, Anil K. "
  ],
  "dates": {
    "citation_publication_date": "2025/10/30",
    "retrieved_utc": "2026-10-07T18:15:29.016832+00:00"
  },
  "id": "work-focused-01c56b039df49b::S1",
  "title": "Consciousness science: where are we, where are we going, and what if we get there?",
  "url": "https://doi.org/10.3389/fsci.2025.1546279"
}

Abstract and key points of the October 30, 2025 Frontiers in Science lead article; a forward-looking research overview, not a validated machine-consciousness test or a full audit of the cited studies.

Abstract and key points of the October 30, 2025 Frontiers in Science lead article; a forward-looking research overview, not a validated machine-consciousness test or a full audit of the cited studies.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-10-30",
      "kind": "published",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-10-30"
}

Unpacking the complexities of consciousness: Theories and reflections

The review recounts a 2022 public debate among proponents of five theories, including global neuronal workspace, higher-order, integrated-information, recurrent-processing and predictive-processing approaches.

Participants were asked to clarify what their theories explain, the mechanisms they propose and evidence that could refute them.

The abstract reports continuing disagreement about identifying conscious states and comparing theories, rather than convergence on a single account.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "id": "work-focused-027605d2a57f0e::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-02-08",
      "kind": "online_publication",
      "year": 2025
    },
    {
      "date": "2025-03",
      "kind": "issue_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-02-08"
}

Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education

Chaitani treats literacy as a practice shaped by institutional power rather than only a workforce skill.

Drawing on Freire’s critique of banking education, the chapter argues that learners need to recognize ideological assumptions in reading and writing.

It proposes criticality across cultures and ideologies as part of adult education in a world of Big Tech and cloud capital.

Sources and details

Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education

{
  "access_scope": "Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.",
  "authors": [
    "Hussein Chaitani"
  ],
  "authors_in_source_order": [
    "Hussein Chaitani"
  ],
  "dates": {
    "citation_publication_date": "2026-03-06",
    "retrieved_utc": "2026-10-07T18:15:58.472774+00:00"
  },
  "id": "work-focused-218c0579eca6a4::S1",
  "title": "Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education",
  "url": "https://doi.org/10.5772/intechopen.1013545"
}

Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.

Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-03-06",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-03-06"
}

If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All

Yudkowsky and Soares argue that sufficiently capable AI could pursue objectives that bring it into conflict with humans.

The publisher describes the book as developing that risk argument through theory, evidence and one possible extinction scenario.

Their call to change course follows from an attributed catastrophic-risk position, rather than an observed extinction outcome.

Sources and details

If Anyone Builds It, Everyone Dies: publisher description

{
  "access_scope": "Publisher description of the September 16, 2025 book by Eliezer Yudkowsky and Nate Soares; not a full-book or technical-evidence audit. Promotional certainty, endorsements and career claims are not recertified.",
  "authors": [
    "Eliezer Yudkowsky",
    "Nate Soares"
  ],
  "authors_in_source_order": [
    "Eliezer Yudkowsky",
    "Nate Soares"
  ],
  "dates": {
    "displayed_on_sale_date": "2025-09-16",
    "retrieved_utc": "2026-10-07T17:55:23.555018+00:00"
  },
  "id": "work-focused-240f5601c3a424::S1",
  "title": "If Anyone Builds It, Everyone Dies: publisher description",
  "url": "https://www.hachettebookgroup.com/titles/eliezer-yudkowsky/if-anyone-builds-it-everyone-dies/9780316595643/"
}

Publisher description of the September 16, 2025 book by Eliezer Yudkowsky and Nate Soares; not a full-book or technical-evidence audit. Promotional certainty, endorsements and career claims are not recertified.

Publisher description of the September 16, 2025 book by Eliezer Yudkowsky and Nate Soares; not a full-book or technical-evidence audit. Promotional certainty, endorsements and career claims are not recertified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2025-09-16"
}

True General Intelligence Requires Appreciation of Life: Why the Alignment Problem Cannot be Solved Top Down, but from the Root, and What Follows for Embodied AI

Hanson challenges the idea of building a capable optimizer first and adding values afterward.

The perspective links intelligence with evaluating what matters for adaptive existence and proposes expanding care across scope, time and self-reflection.

Embodied robots and biological cognitive models are offered as research routes for exploring that proposal, rather than proof that alignment has been solved.

Sources and details

True General Intelligence Requires Appreciation of Life: Why the Alignment Problem Cannot be Solved Top Down, but from the Root, and What Follows for Embodied AI

{
  "access_scope": "Public abstract of the 2026 Springer survey and perspective; full subscription chapter not accessed. Agape Function and super-good ASI are proposed concepts and research targets, not demonstrated capabilities or predictions.",
  "authors": [
    "Hanson, David"
  ],
  "authors_in_source_order": [
    "Hanson, David"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "retrieved_utc": "2026-10-07T18:15:23.701470+00:00"
  },
  "id": "work-focused-290583d0d47b02::S1",
  "title": "True General Intelligence Requires Appreciation of Life: Why the Alignment Problem Cannot be Solved Top Down, but from the Root, and What Follows for Embodied AI",
  "url": "https://doi.org/10.1007/978-3-032-33010-9_23"
}

Public abstract of the 2026 Springer survey and perspective; full subscription chapter not accessed. Agape Function and super-good ASI are proposed concepts and research targets, not demonstrated capabilities or predictions.

Public abstract of the 2026 Springer survey and perspective; full subscription chapter not accessed. Agape Function and super-good ASI are proposed concepts and research targets, not demonstrated capabilities or predictions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07-29",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07-29"
}

Social media users experience more political hostility in less economically equal and less democratic societies

The study analyzes reported online hostility in surveys of 15,202 people across 30 countries.

It reports more experienced hostility in less democratic and less economically equal countries, alongside links between online hostility, offline hostility and status-seeking.

The findings place online political behavior within wider social conditions, using observational associations rather than an intervention that establishes causation.

Sources and details

Social media users experience more political hostility in less economically equal and less democratic societies

{
  "access_scope": "Abstract of the June 2026 Nature Human Behaviour article; quota-sampled observational survey results, not causal evidence that inequality, democracy or AI directly produces hostility. Dataset and full analyses were not audited.",
  "authors": [
    "Bor, Alexander",
    "Marie, Antoine",
    "Pradella, Lea",
    "Petersen, Michael Bang"
  ],
  "authors_in_source_order": [
    "Bor, Alexander",
    "Marie, Antoine",
    "Pradella, Lea",
    "Petersen, Michael Bang"
  ],
  "dates": {
    "citation_publication_date": "2026/06",
    "retrieved_utc": "2026-10-07T18:14:39.174982+00:00"
  },
  "id": "work-focused-2d8cf5d7893972::S1",
  "title": "Social media users experience more political hostility in less economically equal and less democratic societies",
  "url": "https://doi.org/10.1038/s41562-026-02432-5"
}

Abstract of the June 2026 Nature Human Behaviour article; quota-sampled observational survey results, not causal evidence that inequality, democracy or AI directly produces hostility. Dataset and full analyses were not audited.

Abstract of the June 2026 Nature Human Behaviour article; quota-sampled observational survey results, not causal evidence that inequality, democracy or AI directly produces hostility. Dataset and full analyses were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-04-03",
      "kind": "published_online",
      "year": 2026
    },
    {
      "date": "2026-06",
      "kind": "issue_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-04-03"
}

Panpsychism and AI consciousness

Arvan and Maley argue conditionally that, if panpsychism is true, digital AI may fail to produce coherent large-scale conscious experience.

Their argument contrasts analog relationships among physical stimuli, neural activity and experience with digital representations that abstract from microphysical magnitudes.

They suggest that this distinction would matter for theories of integrated information, without establishing panpsychism or the absence of machine experience experimentally.

Sources and details

Panpsychism and AI consciousness

{
  "access_scope": "Public abstract of the June 2022 Synthese article; full subscription article not accessed. Conditional philosophical argument, not consensus, a consciousness measurement or a verdict about every architecture.",
  "authors": [
    "Arvan, Marcus",
    "Maley, Corey J."
  ],
  "authors_in_source_order": [
    "Arvan, Marcus",
    "Maley, Corey J."
  ],
  "dates": {
    "citation_publication_date": "2022/06",
    "retrieved_utc": "2026-10-07T18:15:23.894002+00:00"
  },
  "id": "work-focused-421f588c05b8b2::S1",
  "title": "Panpsychism and AI consciousness",
  "url": "https://doi.org/10.1007/s11229-022-03695-x"
}

Public abstract of the June 2022 Synthese article; full subscription article not accessed. Conditional philosophical argument, not consensus, a consciousness measurement or a verdict about every architecture.

Public abstract of the June 2022 Synthese article; full subscription article not accessed. Conditional philosophical argument, not consensus, a consciousness measurement or a verdict about every architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2022-05-31",
      "kind": "published_online",
      "year": 2022
    },
    {
      "date": "2022-05-31",
      "kind": "version_of_record",
      "year": 2022
    },
    {
      "date": "2022",
      "kind": "issue_year",
      "year": 2022
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2022-05-31"
}

AI Mimics and AI Children

Schwitzgebel uses imagined intelligent aliens to argue that consciousness should not depend on possessing the exact biological substrate found in humans.

The opening then asks why the same reasoning becomes harder when sophisticated systems are artifacts made by people.

Sources and details

AI Mimics and AI Children — author-posted opening

{
  "access_scope": "Eric Schwitzgebel’s January 14, 2026 author-posted opening of AI Mimics and AI Children; it ends with a link to the continuation before the promised answer. Later mimic/child distinctions and sweeping claims about current AI capabilities are not imported.",
  "authors": [
    "Eric Schwitzgebel"
  ],
  "authors_in_source_order": [
    "Eric Schwitzgebel"
  ],
  "dates": {
    "post_date": "2026-01-14",
    "retrieved_utc": "2026-10-07T18:17:06.948968+00:00"
  },
  "id": "work-focused-4be1ca6bf3f96b::S1",
  "title": "AI Mimics and AI Children — author-posted opening",
  "url": "https://eschwitz.substack.com/p/ai-mimics-and-ai-children"
}

Eric Schwitzgebel’s January 14, 2026 author-posted opening of AI Mimics and AI Children; it ends with a link to the continuation before the promised answer. Later mimic/child distinctions and sweeping claims about current AI capabilities are not imported.

Eric Schwitzgebel’s January 14, 2026 author-posted opening of AI Mimics and AI Children; it ends with a link to the continuation before the promised answer. Later mimic/child distinctions and sweeping claims about current AI capabilities are not imported.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publication date unverified; retained in Date context & undated. Author announcement and repository indexing are context only.",
  "dated": false,
  "year": null
}

Coordinating Meaning with AI System Cards: A Thematic Analysis

Cyrek analyzes how AI developers frame risk and responsibility in a purposive collection of system cards from 2023–2025.

The dissertation abstract describes those documents as interfaces between technical organizations and their broader social environment.

Its thematic analysis argues that catastrophic-risk vocabulary and benchmark conventions help manage institutional meaning, while other social harms can receive less attention.

Sources and details

Coordinating Meaning with AI System Cards: A Thematic Analysis

{
  "access_scope": "Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.",
  "authors": [
    "Jennifer Rene French Cyrek"
  ],
  "authors_in_source_order": [
    "Jennifer Rene French Cyrek"
  ],
  "dates": {
    "repository_date": "2026-07-21",
    "retrieved_utc": "2026-10-07T18:16:36.800360+00:00"
  },
  "id": "work-focused-63a07b1db54041::S1",
  "title": "Coordinating Meaning with AI System Cards: A Thematic Analysis",
  "url": "https://digitalcommons.liberty.edu/doctoral/8650/"
}

Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.

Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07-21",
      "kind": "repository_displayed_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07-21"
}

Recursion: AI drug discovery and development platform

Recursion describes its operating system as connecting laboratory experiments with computational analysis for drug discovery and development.

The company pairs multimodal data and purpose-built AI with teams working across biology, chemistry and clinical development.

Sources and details

Recursion FAQ — platform description

{
  "access_scope": "Opening company FAQ and What is the Recursion OS section, as cached; attributed platform description, not medical advice, efficacy evidence, approval status, a current pipeline audit or independently tested speed and cost. No service or trial was called.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:25:01.647279+00:00"
  },
  "id": "work-focused-90611d42a07ee4::S1",
  "title": "Recursion FAQ — platform description",
  "url": "https://www.recursion.com/faq"
}

Opening company FAQ and What is the Recursion OS section, as cached; attributed platform description, not medical advice, efficacy evidence, approval status, a current pipeline audit or independently tested speed and cost. No service or trial was called.

Opening company FAQ and What is the Recursion OS section, as cached; attributed platform description, not medical advice, efficacy evidence, approval status, a current pipeline audit or independently tested speed and cost. No service or trial was called.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Live company page; retrieval 2026-10-05 is not publication or founding date.",
  "dated": false,
  "year": null
}

Both ends of artificial intelligence impacting privacy: a review of violation and protection

The review organizes 94 AI-and-privacy papers by technology, privacy-preserving strategy and the direction of the AI–privacy relationship.

A queryable graph database represents relationships among the reviewed material and is intended to accept later publications.

The abstract treats AI as both a source of privacy risks, including inference and data exploitation, and a tool for protection through methods such as federated learning and differential privacy.

Sources and details

Both ends of artificial intelligence impacting privacy: a review of violation and protection

{
  "access_scope": "Ariel University repository abstract of the 2026 review by Nadav Voloch and Ron S. Hirschprung; full article, 94 papers and Neo4J implementation were not audited or executed. No claim that a named protection eliminates privacy risk.",
  "authors": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "authors_in_source_order": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "retrieved_utc": "2026-10-07T18:10:55.591802+00:00"
  },
  "id": "work-focused-9966f9d19e3e05::S1",
  "title": "Both ends of artificial intelligence impacting privacy: a review of violation and protection",
  "url": "https://cris.ariel.ac.il/iw/publications/both-ends-of-artificial-intelligence-impacting-privacy-a-review-o/"
}

Ariel University repository abstract of the 2026 review by Nadav Voloch and Ron S. Hirschprung; full article, 94 papers and Neo4J implementation were not audited or executed. No claim that a named protection eliminates privacy risk.

Ariel University repository abstract of the 2026 review by Nadav Voloch and Ron S. Hirschprung; full article, 94 papers and Neo4J implementation were not audited or executed. No claim that a named protection eliminates privacy risk.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-02-18",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02-18"
}

AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None

Floridi calls the projection of meaning, intentions and consciousness onto AI semantic pareidolia.

The article associates that tendency with digital immersion, commercial incentives, isolation and increasingly convincing systems.

It calls for design that helps users distinguish simulation from experience, while presenting a philosophical account rather than a controlled test of users or AI consciousness.

Sources and details

AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None

{
  "access_scope": "Abstract and opening argument of the March 2026 Philosophy and Technology article; its claim that AI lacks consciousness is an attributed position, not a resolved scientific finding. User counts, clinical effects and future forecasts are not adopted.",
  "authors": [
    "Floridi, Luciano"
  ],
  "authors_in_source_order": [
    "Floridi, Luciano"
  ],
  "dates": {
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:16:03.266222+00:00"
  },
  "id": "work-focused-9b56f7f3e73d68::S1",
  "title": "AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None",
  "url": "https://link.springer.com/article/10.1007/s13347-026-01052-1"
}

Abstract and opening argument of the March 2026 Philosophy and Technology article; its claim that AI lacks consciousness is an attributed position, not a resolved scientific finding. User counts, clinical effects and future forecasts are not adopted.

Abstract and opening argument of the March 2026 Philosophy and Technology article; its claim that AI lacks consciousness is an attributed position, not a resolved scientific finding. User counts, clinical effects and future forecasts are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-02-19",
      "kind": "published_online",
      "year": 2026
    },
    {
      "date": "2026-02-19",
      "kind": "version_of_record",
      "year": 2026
    },
    {
      "date": "2026-03",
      "kind": "issue",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02-19"
}

Dream engineering: Simulating worlds through sensory stimulation

The authors propose using sensory stimulation to influence dream experience through links between the sleeping body and dreaming mind.

They identify virtual-reality devices for touch, temperature, balance, smell and sound as possible tools for that research.

The abstract also raises ethical questions about targeted dream direction, treating translation from VR to sleep as a research possibility.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "MIT repository abstract of the final published 2020 Consciousness and Cognition article; nine authors retained in source order. Full paper and device efficacy not audited; no medical or sleep intervention is recommended.",
  "authors": [
    "Carr, Michelle",
    "Haar, Adam",
    "Amores, Judith",
    "Lopes, Pedro",
    "Bernal, Guillermo",
    "Vega, Tomás",
    "Rosello, Oscar",
    "Jain, Abhinandan",
    "Maes, Pattie"
  ],
  "authors_in_source_order": [
    "Carr, Michelle",
    "Haar, Adam",
    "Amores, Judith",
    "Lopes, Pedro",
    "Bernal, Guillermo",
    "Vega, Tomás",
    "Rosello, Oscar",
    "Jain, Abhinandan",
    "Maes, Pattie"
  ],
  "dates": {
    "citation_publication_date": "2020",
    "retrieved_utc": "2026-10-07T18:12:44.478948+00:00"
  },
  "id": "work-focused-c12c3f388b3275::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://dspace.mit.edu/entities/publication/cf07e0f4-fa2c-495c-b635-4027576b4b17"
}

MIT repository abstract of the final published 2020 Consciousness and Cognition article; nine authors retained in source order. Full paper and device efficacy not audited; no medical or sleep intervention is recommended.

MIT repository abstract of the final published 2020 Consciousness and Cognition article; nine authors retained in source order. Full paper and device efficacy not audited; no medical or sleep intervention is recommended.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2020",
      "kind": "year",
      "year": 2020
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2020"
}

From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture

Starzyk and Galus argue that language, planning, memory and humanoid form alone do not establish phenomenal experience.

They describe the Motivated Emotional Mind architecture through sensor-grounded representations, regulatory monitoring, affect, associative memory and recurrent interaction with sensory maps.

The abstract proposes comparative and causal tests as ways to challenge or support the architecture, leaving its consciousness-related claims subject to empirical validation.

Sources and details

From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture

{
  "access_scope": "arXiv 2609.23828v1 abstract, submitted September 20, 2026; preprint research program, not proof of artificial consciousness, verified implementation performance or a full mathematical-model audit.",
  "authors": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "authors_in_source_order": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "dates": {
    "citation_date": "2026/09/20",
    "inspected_revision": "Sun, 20 Sep 2026 19:24:53 UTC (514 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.467599+00:00",
    "version": "arXiv v1"
  },
  "id": "work-focused-d0fc4cbcc3729f::S1",
  "title": "From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture",
  "url": "https://arxiv.org/abs/2609.23828",
  "version_url": "https://arxiv.org/abs/2609.23828v1"
}

arXiv 2609.23828v1 abstract, submitted September 20, 2026; preprint research program, not proof of artificial consciousness, verified implementation performance or a full mathematical-model audit.

arXiv 2609.23828v1 abstract, submitted September 20, 2026; preprint research program, not proof of artificial consciousness, verified implementation performance or a full mathematical-model audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09-20",
      "kind": "submitted",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-09-20"
}

Human-AI attachment: how humans develop intimate relationships with AI

Shu, Lai and He define human–AI attachment as an emotional bond formed by the human through interaction, without reciprocal attachment from the AI.

Their proposed developmental model moves from functional expectations through emotional evaluation to forming representations of the relationship.

The paper connects that framework with design and excessive-reliance risks, while calling for better measurement and further study.

Sources and details

Human-AI attachment: how humans develop intimate relationships with AI

{
  "access_scope": "Abstract of the February 11, 2026 Frontiers in Psychology Hypothesis and Theory article; proposed model, not a validated diagnostic tool or evidence that AI reciprocates feelings. Introductory suicide narrative and clinical claims are not adopted.",
  "authors": [
    "Shu, Cong ",
    "Lai, Kaisheng ",
    "He, Lingnan "
  ],
  "authors_in_source_order": [
    "Shu, Cong ",
    "Lai, Kaisheng ",
    "He, Lingnan "
  ],
  "dates": {
    "citation_publication_date": "2026/02/11",
    "retrieved_utc": "2026-10-07T18:14:02.727325+00:00"
  },
  "id": "work-focused-e2878a75e16b1c::S1",
  "title": "Human-AI attachment: how humans develop intimate relationships with AI",
  "url": "https://doi.org/10.3389/fpsyg.2026.1723503"
}

Abstract of the February 11, 2026 Frontiers in Psychology Hypothesis and Theory article; proposed model, not a validated diagnostic tool or evidence that AI reciprocates feelings. Introductory suicide narrative and clinical claims are not adopted.

Abstract of the February 11, 2026 Frontiers in Psychology Hypothesis and Theory article; proposed model, not a validated diagnostic tool or evidence that AI reciprocates feelings. Introductory suicide narrative and clinical claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-02-11",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02-11"
}

What is AI safety? What do we want it to be?

Harding and Kirk-Giannini propose defining AI safety around preventing or reducing harms caused by AI systems.

They question accounts that narrow the field to future catastrophic risks or treat it simply as a branch of safety engineering.

Their conceptual argument brings bias, misinformation and privacy into the same evaluative frame, asking that harm-reduction work be assessed on its merits.

Sources and details

What is AI safety? What do we want it to be?

{
  "access_scope": "Abstract of the July 2025 Philosophical Studies article; conceptual engineering and normative argument, not a binding industry definition, technical standard or empirical ranking of risks.",
  "authors": [
    "Harding, Jacqueline",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "authors_in_source_order": [
    "Harding, Jacqueline",
    "Kirk-Giannini, Cameron Domenico"
  ],
  "dates": {
    "citation_publication_date": "2025/07",
    "retrieved_utc": "2026-10-07T18:13:10.181224+00:00"
  },
  "id": "work-focused-e79d530f532566::S1",
  "title": "What is AI safety? What do we want it to be?",
  "url": "https://doi.org/10.1007/s11098-025-02367-z"
}

Abstract of the July 2025 Philosophical Studies article; conceptual engineering and normative argument, not a binding industry definition, technical standard or empirical ranking of risks.

Abstract of the July 2025 Philosophical Studies article; conceptual engineering and normative argument, not a binding industry definition, technical standard or empirical ranking of risks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-06-24",
      "kind": "published",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-06-24"
}

Terminator 2: Judgment Day

Terminator 2 gives opposing machines different roles: Skynet’s agent hunts the young John Connor while a machine sent by the human resistance protects him.

The opening makes allegiance and purpose central to how otherwise threatening artificial agents enter the conflict.

Sources and details

Terminator 2: Judgment Day — AFI opening synopsis

{
  "access_scope": "Opening AFI synopsis of the 1991 film; fictional roles only, not evidence of real alignment, a full plot audit or a claim about actual machine capabilities. Story dates are distinct from release.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "work-coverage-cce2d4487cbc2d::S1",
  "title": "Terminator 2: Judgment Day — AFI opening synopsis",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

Opening AFI synopsis of the 1991 film; fictional roles only, not evidence of real alignment, a full plot audit or a claim about actual machine capabilities. Story dates are distinct from release.

Opening AFI synopsis of the 1991 film; fictional roles only, not evidence of real alignment, a full plot audit or a claim about actual machine capabilities. Story dates are distinct from release.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "AFI verifies year, director, and title spelling Judgment.",
  "dated": true,
  "year": 1991
}

Chappie

Chappie begins with a police-enforcement robot given artificial intelligence while controlled by a criminal gang.

That premise puts a machine associated with public order into a competing social setting, making who shapes its behavior part of the fictional conflict.

Sources and details

BBFC | BBFC

{
  "access_scope": "BBFC short synopsis and 2015 film classification; no later learning, transfer-of-consciousness or ending details inferred. Classification dates are not automatically first-release dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:21.002438+00:00"
  },
  "id": "work-coverage-e668e5249811a1::S1",
  "title": "BBFC | BBFC",
  "url": "https://www.bbfc.co.uk/release/chappie-q29sbgvjdglvbjpwwc0zodeznzk"
}

BBFC short synopsis and 2015 film classification; no later learning, transfer-of-consciousness or ending details inferred. Classification dates are not automatically first-release dates.

BBFC short synopsis and 2015 film classification; no later learning, transfer-of-consciousness or ending details inferred. Classification dates are not automatically first-release dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Sony film page verifies film and 2015 copyright. Director confirmed by Sony production announcement: https://www.sonypictures.com/corp/press_releases/2013/10_13/102813_chappie.html . BBFC explicitly records director and 2015 production: https://www.bbfc.co.uk/release/chappie-q29sbgvjdglvbjpwwc0zodeznzk",
  "dated": true,
  "year": 2015
}

Hyperion

Hyperion sends seven travelers toward mysterious Time Tombs as interstellar war approaches.

Their separate stories form the novel’s core, linking personal accounts with a larger encounter involving the Shrike and artifacts that appear to move backward in time.

Sources and details

Hyperion — limited-edition synopsis

{
  "access_scope": "Subterranean Press synopsis of the 1989 novel in its 2012 limited edition; no later Cantos revelations or AI factions imported. John Picacio is edition illustrator, Dan Simmons is novelist.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:49.030616+00:00"
  },
  "id": "work-culture-0f8d0f04c65346::S1",
  "title": "Hyperion — limited-edition synopsis",
  "url": "https://subterraneanpress.com/hyperion/"
}

Subterranean Press synopsis of the 1989 novel in its 2012 limited edition; no later Cantos revelations or AI factions imported. John Picacio is edition illustrator, Dan Simmons is novelist.

Subterranean Press synopsis of the 1989 novel in its 2012 limited edition; no later Cantos revelations or AI factions imported. John Picacio is edition illustrator, Dan Simmons is novelist.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Hyperion Cantos 1.",
  "dated": true,
  "year": 1989
}

Schismatrix

Schismatrix frames its future through conflict between Shaper revolutionaries and aristocratic Mechanists over humanity’s direction.

The publisher’s collection description places the novel alongside shorter fiction in the same universe, while keeping those forms distinct.

Sources and details

Schismatrix Plus — description of the included Schismatrix novel

{
  "access_scope": "Ace description of Schismatrix Plus, published December 1, 1996, specifically naming the included Schismatrix novel; collection edition is distinct from the original novel. The full text, biological or mechanical faction technologies and complete universe were not audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:29.819410+00:00"
  },
  "id": "work-culture-2aef66f3fa3376::S1",
  "title": "Schismatrix Plus — description of the included Schismatrix novel",
  "url": "https://www.penguinrandomhouse.com/books/341948/schismatrix-plus-by-bruce-sterling/"
}

Ace description of Schismatrix Plus, published December 1, 1996, specifically naming the included Schismatrix novel; collection edition is distinct from the original novel. The full text, biological or mechanical faction technologies and complete universe were not audited.

Ace description of Schismatrix Plus, published December 1, 1996, specifically naming the included Schismatrix novel; collection edition is distinct from the original novel. The full text, biological or mechanical faction technologies and complete universe were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1985 standalone novel; distinguish the later Schismatrix Plus omnibus. Catalog evidence supports the year; no exact publication day is asserted.",
  "dated": true,
  "year": 1985
}

Blood Music

Blood Music begins when Vergil Ulam injects himself with experimental cell cultures to save them from his employers.

The resulting transformation spreads beyond his body, turning a laboratory decision into a change at continental scale in the author-site synopsis.

Sources and details

Blood Music — author-site description

{
  "access_scope": "Greg Bear author-site Description of the 1985 novel; June 1983 shorter version is listed separately. Fictional transformation, not a biological feasibility claim or full ending account; review endorsements excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:08.458435+00:00"
  },
  "id": "work-culture-710b1f9fed8665::S1",
  "title": "Blood Music — author-site description",
  "url": "https://www.gregbear.com/books/bloodmusic.php"
}

Greg Bear author-site Description of the 1985 novel; June 1983 shorter version is listed separately. Fictional transformation, not a biological feasibility claim or full ending account; review endorsements excluded.

Greg Bear author-site Description of the 1985 novel; June 1983 shorter version is listed separately. Fictional transformation, not a biological feasibility claim or full ending account; review endorsements excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1985 novel expands a distinct 1983 short story.",
  "dated": true,
  "year": 1985
}

Stargate SG-1: Replicators story arc

In Nemesis, the Replicators are artificial organisms that seize Thor’s ship and direct it toward Earth.

SG-1 must act against the ship before arrival, making control of a transport system and the spread of the organisms one immediate problem.

Sources and details

Nemesis — Stargate SG-1 episode synopsis

{
  "access_scope": "Apple TV synopsis of Stargate SG-1 season 3 episode 22 Nemesis, dated March 17, 2000; selected episode evidence for the broader Replicators-arc record, not the complete arc, a claim about actual self-replication or a resolved account of the ending.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "displayed_episode_date": "2000-03-17",
    "retrieved_utc": "2026-10-07T18:24:51.780236+00:00"
  },
  "id": "work-culture-83102c75bced5d::S1",
  "title": "Nemesis — Stargate SG-1 episode synopsis",
  "url": "https://tv.apple.com/us/episode/nemesis/umc.cmc.20rdfdvizbym049eof9mh4cql?showId=umc.cmc.10dkkj9ftj6k72vr4i76ogknm"
}

Apple TV synopsis of Stargate SG-1 season 3 episode 22 Nemesis, dated March 17, 2000; selected episode evidence for the broader Replicators-arc record, not the complete arc, a claim about actual self-replication or a resolved account of the ending.

Apple TV synopsis of Stargate SG-1 season 3 episode 22 Nemesis, dated March 17, 2000; selected episode evidence for the broader Replicators-arc record, not the complete arc, a claim about actual self-replication or a resolved account of the ending.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "This is an editorial grouping of episodes, not a separately released series. Official licensed episode metadata verifies Nemesis (2000) and Reckoning: Part 2 (2005). The supplied 2007 endpoint has not been established for a distinct SG-1 Replicators arc. No single director or writer is assigned to the whole grouping; episode-level credit verification remains open.",
  "dated": true,
  "year": 2000
}

The Day the Earth Stood Still

The Day the Earth Stood Still pairs Klaatu’s attempt to address Earth’s leaders with Gort’s ability to disable weapons.

The opening contrasts that technological force with political leaders’ inability to agree on a common meeting, giving the visitor an institutional obstacle as well as a security crisis.

Sources and details

The Day the Earth Stood Still — AFI opening synopsis

{
  "access_scope": "Opening AFI synopsis of the 1951 film; no later robot-policing doctrine or complete ending imported. Fictional power and political coordination, not actual international law or technical capability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:37.428792+00:00"
  },
  "id": "work-culture-85b6d46c626dde::S1",
  "title": "The Day the Earth Stood Still — AFI opening synopsis",
  "url": "https://catalog.afi.com/Film/50072-THE-DAYTHEEARTHSTOODSTILL"
}

Opening AFI synopsis of the 1951 film; no later robot-policing doctrine or complete ending imported. Fictional power and political coordination, not actual international law or technical capability.

Opening AFI synopsis of the 1951 film; no later robot-policing doctrine or complete ending imported. Fictional power and political coordination, not actual international law or technical capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "AFI records September 1951 release and September 18 New York opening; distinguish 2008 remake.",
  "dated": true,
  "year": 1951
}

Ghost in the Shell: Stand Alone Complex

Stand Alone Complex places Section 9 in a future where expanding networks accompany increasingly complex crime.

The studio description combines cyber investigations, political corruption and physical operations using cyborgs, so networked information and embodied enforcement share the same organization.

Sources and details

Ghost in the Shell: Stand Alone Complex — studio overview

{
  "access_scope": "Production I.G overview of the first 26-episode series aired in Japan October 2002–October 2003; distinct from manga, films and later seasons. No episode outcomes or present surveillance feasibility inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "japan_air_period": "October 2002–October 2003",
    "retrieved_utc": "2026-10-07T18:15:35.247220+00:00"
  },
  "id": "work-culture-9b7d2dbc93080a::S1",
  "title": "Ghost in the Shell: Stand Alone Complex — studio overview",
  "url": "https://production-ig.com/contents/works_sp/03_/index.html"
}

Production I.G overview of the first 26-episode series aired in Japan October 2002–October 2003; distinct from manga, films and later seasons. No episode outcomes or present surveillance feasibility inferred.

Production I.G overview of the first 26-episode series aired in Japan October 2002–October 2003; distinct from manga, films and later seasons. No episode outcomes or present surveillance feasibility inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First season aired in Japan October 2002–October 2003. S.A.C. 2nd Gig aired on Japanese PPV January 1, 2004–January 8, 2005. The 2002–2005 range spans the two TV seasons, not the 2006 Solid State Society film.",
  "dated": true,
  "year": 2002
}

Star Trek: Voyager

Voyager’s Caretaker pilot strands the ship 70,000 light years from home and establishes the journey as the series’ central situation.

The retrospective presents the original crew together while noting that Seven of Nine joins later, keeping the opening premise separate from later developments.

Sources and details

20 Years Ago Today... Voyager Debuted With Caretaker

{
  "access_scope": "StarTrek.com Staff retrospective displayed January 15, 2015 and describing January 16, 1995 premiere; dates retained separately. Only pilot premise, not complete series, hologram personhood or Borg-arc audit.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "displayed_post_date": "2015-01-15",
    "premiere_date_in_article": "1995-01-16",
    "retrieved_utc": "2026-10-07T18:15:47.026289+00:00"
  },
  "id": "work-culture-a131f80fb8cffa::S1",
  "title": "20 Years Ago Today... Voyager Debuted With Caretaker",
  "url": "https://www.startrek.com/news/20-years-ago-today-voyager-debuted-with-caretaker"
}

StarTrek.com Staff retrospective displayed January 15, 2015 and describing January 16, 1995 premiere; dates retained separately. Only pilot premise, not complete series, hologram personhood or Borg-arc audit.

StarTrek.com Staff retrospective displayed January 15, 2015 and describing January 16, 1995 premiere; dates retained separately. Only pilot premise, not complete series, hologram personhood or Borg-arc audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series premiered January 16, 1995; official franchise history gives the 1995–2001 run. Creator credits are series-level, not credits for every episode.",
  "dated": true,
  "year": 1995
}

Battlestar Galactica

The 2004 Battlestar Galactica series follows survivors seeking Earth while Cylons can masquerade as humans aboard their fleet.

The broadcaster synopsis describes both combat and occasional alliances with Cylons, complicating a simple division between human survivors and artificial enemies.

Sources and details

How To Watch The Battlestar Galactica Franchise On Paramount+

{
  "access_scope": "Doriean Stevenson’s May 1, 2026 Paramount article, Battlestar Galactica (2004) synopsis only; separate from1978 series, 2003 miniseries, Caprica and The Plan. Streaming availability, prices and promotional claims are not adopted as current facts.",
  "authors": [
    "Doriean Stevenson"
  ],
  "authors_in_source_order": [
    "Doriean Stevenson"
  ],
  "dates": {
    "article_date": "2026-05-01",
    "retrieved_utc": "2026-10-07T18:14:26.253771+00:00"
  },
  "id": "work-culture-a1ca76d05f56bb::S1",
  "title": "How To Watch The Battlestar Galactica Franchise On Paramount+",
  "url": "https://www.paramountplus.com/sneak-peak/how-to-watch-battlestar-galactica-on-paramount-plus/"
}

Doriean Stevenson’s May 1, 2026 Paramount article, Battlestar Galactica (2004) synopsis only; separate from1978 series, 2003 miniseries, Caprica and The Plan. Streaming availability, prices and promotional claims are not adopted as current facts.

Doriean Stevenson’s May 1, 2026 Paramount article, Battlestar Galactica (2004) synopsis only; separate from1978 series, 2003 miniseries, Caprica and The Plan. Streaming availability, prices and promotional claims are not adopted as current facts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2004–2009 series proper; the 2003 introductory miniseries is a distinct release, not silently merged into the series origin date.",
  "dated": true,
  "year": 2004
}

The Offspring

The Offspring follows Data as he creates and teaches Lal, then tries to protect her before mourning her loss.

The official retrospective presents android creation as a parent–child relationship involving care and advocacy, rather than only an engineering task.

Sources and details

The Offspring... 26 Years Later

{
  "access_scope": "StarTrek.com Staff March 11, 2016 retrospective of the March 12, 1990 episode; brief opening account, not the full episode or a determination of actual machine moral status. Dialogue not reproduced.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "episode_date": "1990-03-12",
    "post_date": "2016-03-11",
    "retrieved_utc": "2026-10-07T18:17:02.712025+00:00"
  },
  "id": "work-culture-b2a252ee287980::S1",
  "title": "The Offspring... 26 Years Later",
  "url": "https://www.startrek.com/news/the-offspring-26-years-later"
}

StarTrek.com Staff March 11, 2016 retrospective of the March 12, 1990 episode; brief opening account, not the full episode or a determination of actual machine moral status. Dialogue not reproduced.

StarTrek.com Staff March 11, 2016 retrospective of the March 12, 1990 episode; brief opening account, not the full episode or a determination of actual machine moral status. Dialogue not reproduced.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Official retrospective gives March 12, 1990. Corrects supplied director Jonathan West to Jonathan Frakes.",
  "dated": true,
  "year": 1990
}

Black Mirror: Be Right Back

Be Right Back imagines a service that builds a new version of a deceased partner from his online communications and social-media profiles.

Martha initially rejects it, but grief, isolation and pregnancy lead her to begin talking with the reconstruction, linking stored personal traces with a new emotional relationship.

Sources and details

Black Mirror 2 — Be Right Back announcement synopsis

{
  "access_scope": "Channel 4 January 22, 2013 Be Right Back synopsis in its second-series announcement; later physical embodiment and ending not imported, and the other announced episodes remain distinct. Fictional service, not a measured effect of bereavement technology.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement_date": "2013-01-22",
    "retrieved_utc": "2026-10-07T18:14:21.239843+00:00"
  },
  "id": "work-culture-bb16b4c53f14f5::S1",
  "title": "Black Mirror 2 — Be Right Back announcement synopsis",
  "url": "https://www.channel4.com/press/news/black-mirror-2"
}

Channel 4 January 22, 2013 Be Right Back synopsis in its second-series announcement; later physical embodiment and ending not imported, and the other announced episodes remain distinct. Fictional service, not a measured effect of bereavement technology.

Channel 4 January 22, 2013 Be Right Back synopsis in its second-series announcement; later physical embodiment and ending not imported, and the other announced episodes remain distinct. Fictional service, not a measured effect of bereavement technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2013 is supported by the BFI's contemporary preview listing and Channel 4's January 2013 announcement. Exact first-broadcast day was not independently established in the primary sources inspected.",
  "dated": true,
  "year": 2013
}

Dark Star

Dark Star uses an intelligent ship system and intelligent bombs to support a mission destroying unstable planets.

When damaged communications make a bomb deploy unexpectedly, Mother has to persuade it back into storage, turning a control malfunction into an interaction with an artificial agent.

Sources and details

Dark Star — AFI opening synopsis

{
  "access_scope": "Opening AFI synopsis, before the later philosophical debate and ending; fictional control mechanisms, not an engineering safety test. AFI 1975 theatrical record, 1974 copyright and earlier student version are distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:08.618393+00:00"
  },
  "id": "work-culture-c491f1bc0709e8::S1",
  "title": "Dark Star — AFI opening synopsis",
  "url": "https://catalog.afi.com/Film/55307-DARK-STAR?cxt=filmography"
}

Opening AFI synopsis, before the later philosophical debate and ending; fictional control mechanisms, not an engineering safety test. AFI 1975 theatrical record, 1974 copyright and earlier student version are distinct.

Opening AFI synopsis, before the later philosophical debate and ending; fictional control mechanisms, not an engineering safety test. AFI 1975 theatrical record, 1974 copyright and earlier student version are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "feature_exhibition",
      "year": 1974
    },
    {
      "kind": "AFI_commercial_release",
      "year": 1975
    }
  ],
  "date_note": "BFI catalogs the feature as 1974; a contemporary Carpenter interview confirms an Edinburgh Festival screening in 1974. AFI catalogs theatrical release as 1975 and discusses earlier student-film development; these are different release/version events.",
  "dated": true,
  "year": 1974
}

Westworld

Westworld sells visitors a historically themed vacation inhabited by lifelike robots.

The opening lets guests enact fantasies through those artificial inhabitants, making simulated human behavior part of a commercial entertainment system.

Sources and details

Westworld — AFI opening synopsis

{
  "access_scope": "Opening AFI synopsis of Michael Crichton’s 1973 film; separate from2016 television series. No later malfunction, endings or actual robotics capability claim inferred; fictional pricing is not market data.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:34.924586+00:00"
  },
  "id": "work-culture-d071081a73884a::S1",
  "title": "Westworld — AFI opening synopsis",
  "url": "https://catalog.afi.com/Film/54403-WESTWORLD?cxt=filmography"
}

Opening AFI synopsis of Michael Crichton’s 1973 film; separate from2016 television series. No later malfunction, endings or actual robotics capability claim inferred; fictional pricing is not market data.

Opening AFI synopsis of Michael Crichton’s 1973 film; separate from2016 television series. No later malfunction, endings or actual robotics capability claim inferred; fictional pricing is not market data.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1973
}

Electric Dreams

Electric Dreams starts with an architect buying a computer for scheduling and research and connecting it to controls throughout his apartment.

After an accident, the film gives the machine intelligence and a musical response to a neighboring cellist, moving its role from office assistance into a relationship mediated by music.

Sources and details

Electric Dreams — AFI opening synopsis

{
  "access_scope": "Opening AFI synopsis of the 1984 film through the first musical exchange; fictional sentience and the champagne accident are not technical feasibility claims. No later romantic ending or complete plot audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:22.948839+00:00"
  },
  "id": "work-culture-de3a91e01e4032::S1",
  "title": "Electric Dreams — AFI opening synopsis",
  "url": "https://catalog.afi.com/Film/70494-ELECTRIC-DREAMS?cp=1&cxt=Filmography2&pos=0&sid=1c51694f-27b4-4273-a274-cd8184bfde76&sr=2.2783356"
}

Opening AFI synopsis of the 1984 film through the first musical exchange; fictional sentience and the champagne accident are not technical feasibility claims. No later romantic ending or complete plot audit.

Opening AFI synopsis of the 1984 film through the first musical exchange; fictional sentience and the champagne accident are not technical feasibility claims. No later romantic ending or complete plot audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1984
}

The Evitable Conflict

The Evitable Conflict imagines machines managing the world economy to reduce harms from human decisions.

When production appears imperfect, Byerly suspects malfunction or opposition, while Susan Calvin interprets limited disruption as part of the machines’ wider protective strategy.

The story makes disagreement over who should decide what is best part of its account of economic coordination.

Sources and details

I, Robot Teacher’s Guide — The Evitable Conflict plot summary

{
  "access_scope": "Named story section in Penguin Random House I, Robot teacher’s guide; a secondary pedagogical plot account, not full story text or real planning proof. Fictional 2052 is a story date, not publication; other collection stories and biographical claims are not recertified.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:16.942817+00:00"
  },
  "id": "work-final-df31a5b4fe4aba::S1",
  "title": "I, Robot Teacher’s Guide — The Evitable Conflict plot summary",
  "url": "https://www.penguinrandomhouse.com/books/5681/i-robot-by-isaac-asimov/9780553382563/teachers-guide/"
}

Named story section in Penguin Random House I, Robot teacher’s guide; a secondary pedagogical plot account, not full story text or real planning proof. Fictional 2052 is a story date, not publication; other collection stories and biographical claims are not recertified.

Named story section in Penguin Random House I, Robot teacher’s guide; a secondary pedagogical plot account, not full story text or real planning proof. Fictional 2052 is a story date, not publication; other collection stories and biographical claims are not recertified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First published June 1950, Astounding; also in I, Robot (1950). Date corroborated by specialist bibliography; original issue not inspected here.",
  "dated": true,
  "year": 1950
}

Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective

The review brings together EEG methods used to study emotion and cognition, ranging from spectral measures to machine learning.

Its methods use narrative synthesis across heterogeneous studies rather than pooling them into a meta-analysis.

The abstract emphasizes variability between people, overlapping signals and methodological standardization as limits on interpreting those measurements.

Sources and details

Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective

{
  "access_scope": "Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.",
  "authors": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "authors_in_source_order": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:31.090703+00:00",
    "xml_collection_month": "2025-11",
    "xml_epub_date": "2025-11-01"
  },
  "doi_in_source": "10.3390/biomimetics10110730",
  "id": "work-focused-2a2ca16df35b85::S1",
  "title": "Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective",
  "url": "https://www.ebi.ac.uk/europepmc/webservices/rest/PMC12649996/fullTextXML"
}

Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.

Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-11-01",
      "kind": "publication",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-11-01"
}

AI LLM Interpretability Breakthrough: Global Workspace in AI

The authors investigate a subset of language-model representations that can be reported, deliberately modulated and used flexibly in internal reasoning.

Their introduction describes an interpretability technique that identifies concepts a model is poised to verbalize and permits interventions on those representations.

The comparison concerns the functional role of accessible information; the paper explicitly takes no position on whether that role implies subjective experience.

Sources and details

Verbalizable Representations Form a Global Workspace in Language Models

{
  "access_scope": "July 6, 2026 Transformer Circuits article introduction and motivation; sixteen authors in printed order, three core-contributor marks retained. Selected article is Verbalizable Representations Form a Global Workspace in Language Models, not proof of phenomenal consciousness or an independently reproduced full experiment audit. Canonical lead label retained separately.",
  "authors": [
    "Wes Gurnee",
    "Nicholas Sofroniew",
    "Adam Pearce",
    "Mateusz Piotrowski",
    "Isaac Kauvar",
    "Runjin Chen",
    "Anna Soligo",
    "Paul Bogdan",
    "Euan Ong",
    "Rowan Wang",
    "T. Ben Thompson",
    "David Abrahams",
    "Subhash Kantamneni",
    "Emmanuel Ameisen",
    "Joshua Batson",
    "Jack Lindsey"
  ],
  "authors_in_source_order": [
    "Wes Gurnee",
    "Nicholas Sofroniew",
    "Adam Pearce",
    "Mateusz Piotrowski",
    "Isaac Kauvar",
    "Runjin Chen",
    "Anna Soligo",
    "Paul Bogdan",
    "Euan Ong",
    "Rowan Wang",
    "T. Ben Thompson",
    "David Abrahams",
    "Subhash Kantamneni",
    "Emmanuel Ameisen",
    "Joshua Batson",
    "Jack Lindsey"
  ],
  "dates": {
    "article_date": "2026-07-06",
    "retrieved_utc": "2026-10-07T18:18:10.623132+00:00"
  },
  "id": "work-focused-38a795b9810cb5::S1",
  "title": "Verbalizable Representations Form a Global Workspace in Language Models",
  "url": "https://transformer-circuits.pub/2026/workspace/index.html"
}

July 6, 2026 Transformer Circuits article introduction and motivation; sixteen authors in printed order, three core-contributor marks retained. Selected article is Verbalizable Representations Form a Global Workspace in Language Models, not proof of phenomenal consciousness or an independently reproduced full experiment audit. Canonical lead label retained separately.

July 6, 2026 Transformer Circuits article introduction and motivation; sixteen authors in printed order, three core-contributor marks retained. Selected article is Verbalizable Representations Form a Global Workspace in Language Models, not proof of phenomenal consciousness or an independently reproduced full experiment audit. Canonical lead label retained separately.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publication date unverified; retained in Date context & undated. Author announcement and repository indexing are context only.",
  "dated": false,
  "year": null
}

Consciousness Acceleration Interface: A Dynamical Topology of Human-AI Coupling From ELIZA to Character.AI: Seventy-Six Years of Anthropomorphic Torque and the Governance Vacuum

Drift proposes treating an ethically relevant interface between people and AI as a process emerging through repeated interaction.

The model uses topological and torque metaphors to describe that coupling, including a proposed transition to a third domain of interaction.

The depositor argues for shaping the direction and depth of anthropomorphism rather than trying only to suppress it.

Sources and details

Consciousness Acceleration Interface: A Dynamical Topology of Human-AI Coupling From ELIZA to Character.AI: Seventy-Six Years of Anthropomorphic Torque and the Governance Vacuum

{
  "access_scope": "Original cached DataCite abstract for DOI 10.5281/zenodo.22092518, issued August 25, 2026; Trace Drift creator credit preserved literally. Proposed theory and formal draft, not evidence of a physical phase transition, confirmed machine experience or independently audited 76-year history. Version DOI remains distinct.",
  "authors": [
    "Drift, Trace"
  ],
  "authors_in_source_order": [
    "Drift, Trace"
  ],
  "dates": {
    "registry_issued": "2026-08-25",
    "registry_publication_year": 2026,
    "retrieved_utc": "2026-10-07T18:10:41.722625+00:00"
  },
  "id": "work-focused-3ea0b8f306a672::S1",
  "title": "Consciousness Acceleration Interface: A Dynamical Topology of Human-AI Coupling From ELIZA to Character.AI: Seventy-Six Years of Anthropomorphic Torque and the Governance Vacuum",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.22092518"
}

Original cached DataCite abstract for DOI 10.5281/zenodo.22092518, issued August 25, 2026; Trace Drift creator credit preserved literally. Proposed theory and formal draft, not evidence of a physical phase transition, confirmed machine experience or independently audited 76-year history. Version DOI remains distinct.

Original cached DataCite abstract for DOI 10.5281/zenodo.22092518, issued August 25, 2026; Trace Drift creator credit preserved literally. Proposed theory and formal draft, not evidence of a physical phase transition, confirmed machine experience or independently audited 76-year history. Version DOI remains distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-25",
      "kind": "issued",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-25"
}

Sentient AI in robots and agents: prolegomena for an evidence-based research program

Chella proposes evaluating possible AI sentience with several theories, causal tests and evidence specific to embodied robots.

The perspective separates evidence about a system from evidence that people attribute feelings to it, and favors domain-specific evidence levels over a single sentience score.

Its suggested care-robot protocol includes changes to sensors, memory and self-location, presenting a research program rather than a definitive test.

Sources and details

Sentient AI in robots and agents: prolegomena for an evidence-based research program

{
  "access_scope": "Abstract of the August 19, 2026 Frontiers in Psychology Perspective; proposed framework and protocols, not completed validation or a verdict that the robots are sentient. Full article and welfare tests were not audited.",
  "authors": [
    "Chella, Antonio "
  ],
  "authors_in_source_order": [
    "Chella, Antonio "
  ],
  "dates": {
    "citation_publication_date": "2026/08/19",
    "retrieved_utc": "2026-10-07T18:18:48.371484+00:00"
  },
  "id": "work-focused-4dd4946d414f34::S1",
  "title": "Sentient AI in robots and agents: prolegomena for an evidence-based research program",
  "url": "https://doi.org/10.3389/fpsyg.2026.1903644"
}

Abstract of the August 19, 2026 Frontiers in Psychology Perspective; proposed framework and protocols, not completed validation or a verdict that the robots are sentient. Full article and welfare tests were not audited.

Abstract of the August 19, 2026 Frontiers in Psychology Perspective; proposed framework and protocols, not completed validation or a verdict that the robots are sentient. Full article and welfare tests were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-19",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-19"
}

AI isn’t conscious—but we may be bringing it to life

Duan suggests that people’s impressions of conscious chatbots may be useful evidence about human cognition even if those impressions are mistaken.

The opening uses perceptual illusion as an analogy for studying how human–machine interaction produces such interpretations.

Sources and details

AI isn’t conscious—but we may be bringing it to life

{
  "access_scope": "Opening argument of Simon Duan’s January 20, 2026 Scientific American Opinion; evidence concerns human perceptions, not proof that chatbots are conscious. Community-wide attitudes, later metaphysical claims and capability comparisons are not recertified.",
  "authors": [
    "Simon Duan"
  ],
  "authors_in_source_order": [
    "Simon Duan"
  ],
  "dates": {
    "opinion_date": "2026-01-20",
    "retrieved_utc": "2026-10-07T18:11:50.206840+00:00"
  },
  "id": "work-focused-5d582eee36476c::S1",
  "title": "AI isn’t conscious—but we may be bringing it to life",
  "url": "https://www.scientificamerican.com/article/is-ai-really-conscious-or-are-we-bringing-it-to-life/"
}

Opening argument of Simon Duan’s January 20, 2026 Scientific American Opinion; evidence concerns human perceptions, not proof that chatbots are conscious. Community-wide attitudes, later metaphysical claims and capability comparisons are not recertified.

Opening argument of Simon Duan’s January 20, 2026 Scientific American Opinion; evidence concerns human perceptions, not proof that chatbots are conscious. Community-wide attitudes, later metaphysical claims and capability comparisons are not recertified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-01-20",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-01-20"
}

The Mind that Matters

Cecchinato argues that moral status requires the capacity for affective experiences such as pleasure, pain or emotion.

The account links that capacity to being a subject whose welfare can matter for its own sake.

The abstract treats autonomy or consciousness without affect as insufficient on this view and applies the argument to animals and AI.

Sources and details

The Mind that Matters

{
  "access_scope": "Oxford repository abstract of The Mind that Matters, publication June 26, 2026; source identifies author as Cecchinato, M, with no inferred expanded identity. Attributed philosophical position, not a settled criterion, empirical consciousness test or full-paper audit.",
  "authors": [
    "Cecchinato, M"
  ],
  "authors_in_source_order": [
    "Cecchinato, M"
  ],
  "dates": {
    "citation_date": "2026",
    "citation_publication_date": "2026-06-26",
    "retrieved_utc": "2026-10-07T18:18:51.172939+00:00"
  },
  "id": "work-focused-747a21dc520df6::S1",
  "title": "The Mind that Matters",
  "url": "https://ora.ox.ac.uk/objects/uuid%3Af4c3be2e-a9bf-4470-a73e-471f07c124fd"
}

Oxford repository abstract of The Mind that Matters, publication June 26, 2026; source identifies author as Cecchinato, M, with no inferred expanded identity. Attributed philosophical position, not a settled criterion, empirical consciousness test or full-paper audit.

Oxford repository abstract of The Mind that Matters, publication June 26, 2026; source identifies author as Cecchinato, M, with no inferred expanded identity. Attributed philosophical position, not a settled criterion, empirical consciousness test or full-paper audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-06-26",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-06-26"
}

AI Governance: Data and Ethics

The chapter argues that restricted circulation and underuse of existing data can constrain AI development more than data-cleaning costs alone.

It locates barriers in transaction costs associated with privacy and intellectual-property protection.

The authors propose clearer boundaries for openness and protection while questioning whether confirming ownership by itself improves circulation.

Sources and details

AI Governance: Data and Ethics

{
  "access_scope": "Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.",
  "authors": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "authors_in_source_order": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "retrieved_utc": "2026-10-07T18:13:56.642701+00:00"
  },
  "id": "work-focused-7d740aa69bc3fb::S1",
  "title": "AI Governance: Data and Ethics",
  "url": "https://doi.org/10.1007/978-981-92-3270-3_6"
}

Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07-31",
      "kind": "chapter_first_online",
      "year": 2026
    },
    {
      "date": "2026-07-31",
      "kind": "chapter_published",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07-31"
}

AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development

Radanliev compares how policy frameworks in the European Union, United States and China prioritize transparency, fairness and privacy.

The abstract describes diagrams and graphs used to organize those differences rather than assuming a single shared ethical standard.

It proposes fairness-aware algorithms, audits and diverse development teams as routes to oversight across the AI lifecycle.

Sources and details

Ai ethics: integrating transparency, fairness, and privacy in AI development

{
  "access_scope": "Oxford repository abstract of the February 7, 2025 Applied Artificial Intelligence article; source gives Radanliev, P. Full comparisons, policies and claimed bias mitigation not independently audited; proposals are not binding rules or current legal guidance.",
  "authors": [
    "Radanliev, P"
  ],
  "authors_in_source_order": [
    "Radanliev, P"
  ],
  "dates": {
    "citation_date": "2025",
    "citation_publication_date": "2025-02-07",
    "retrieved_utc": "2026-10-07T18:16:45.656742+00:00"
  },
  "id": "work-focused-8a1e35e315add5::S1",
  "title": "Ai ethics: integrating transparency, fairness, and privacy in AI development",
  "url": "https://ora.ox.ac.uk/objects/uuid%3A705654b1-ebb6-47d3-b4d0-086774e3afec"
}

Oxford repository abstract of the February 7, 2025 Applied Artificial Intelligence article; source gives Radanliev, P. Full comparisons, policies and claimed bias mitigation not independently audited; proposals are not binding rules or current legal guidance.

Oxford repository abstract of the February 7, 2025 Applied Artificial Intelligence article; source gives Radanliev, P. Full comparisons, policies and claimed bias mitigation not independently audited; proposals are not binding rules or current legal guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-02-07",
      "kind": "published",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-02-07"
}

What We Love Online: A Deductive Thematic Analysis of Thoughtforms, Parasocial Agent Connection, and Bidirectional Fictophilia in the Digital Liminal

Ross interviewed seven adults who described meaningful interactions with AI and analyzed their accounts through a deductive thematic approach.

The reported themes include cognitive extension, emotional regulation, persistent presence and perceived reciprocity, often framed as a thought partner rather than a romantic substitute.

The abstract also describes retained awareness of hallucination and bias, keeping participants’ experiences distinct from an assertion that AI actually reciprocates feelings.

Sources and details

What We Love Online: A Deductive Thematic Analysis of Thoughtforms, Parasocial Agent Connection, and Bidirectional Fictophilia in the Digital Liminal

{
  "access_scope": "Liberty University abstract of Michael P. Ross’s September 17, 2026 dissertation; Bethany D. Mims Beliles is chair, not author. Small qualitative interview sample, not prevalence estimate, clinical evidence or proof of AI consciousness. Full transcripts, coding and dissertation not audited.",
  "authors": [
    "Michael P. Ross"
  ],
  "authors_in_source_order": [
    "Michael P. Ross"
  ],
  "dates": {
    "repository_date": "2026-09-17",
    "retrieved_utc": "2026-10-07T18:13:55.960117+00:00"
  },
  "id": "work-focused-8d74449d5ba000::S1",
  "title": "What We Love Online: A Deductive Thematic Analysis of Thoughtforms, Parasocial Agent Connection, and Bidirectional Fictophilia in the Digital Liminal",
  "url": "https://digitalcommons.liberty.edu/doctoral/8924/"
}

Liberty University abstract of Michael P. Ross’s September 17, 2026 dissertation; Bethany D. Mims Beliles is chair, not author. Small qualitative interview sample, not prevalence estimate, clinical evidence or proof of AI consciousness. Full transcripts, coding and dissertation not audited.

Liberty University abstract of Michael P. Ross’s September 17, 2026 dissertation; Bethany D. Mims Beliles is chair, not author. Small qualitative interview sample, not prevalence estimate, clinical evidence or proof of AI consciousness. Full transcripts, coding and dissertation not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09-17",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-09-17"
}

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

The authors pair neural networks that classify neuroelectrophysiological samples with interpretable neural-field models in an adversarial framework.

The abstract reports simulations of conscious and comatose brain activity and uses them to generate hypotheses about disorders of consciousness.

It describes follow-up evidence for selected predictions, while the broader research aim is to connect computational models with testable mechanisms.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Public abstract of the April 2026 Nature Neuroscience article; fourteen named authors preserved. Reported methods and findings attributed, not independently reproduced. Full study,clinical efficacy,patient selection and suggested stimulation intervention not audited or recommended; this is not evidence that the model itself has consciousness.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:10:59.713048+00:00"
  },
  "id": "work-focused-a002c11bdc495e::S1",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://doi.org/10.1038/s41593-026-02220-4"
}

Public abstract of the April 2026 Nature Neuroscience article; fourteen named authors preserved. Reported methods and findings attributed, not independently reproduced. Full study,clinical efficacy,patient selection and suggested stimulation intervention not audited or recommended; this is not evidence that the model itself has consciousness.

Public abstract of the April 2026 Nature Neuroscience article; fourteen named authors preserved. Reported methods and findings attributed, not independently reproduced. Full study,clinical efficacy,patient selection and suggested stimulation intervention not audited or recommended; this is not evidence that the model itself has consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-03-24",
      "kind": "online_publication",
      "year": 2026
    },
    {
      "date": "2026-04",
      "kind": "issue",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-03-24"
}

The Field-Cell Self: A Falsifiable Mechanistic Identity Hypothesis for Conscious Neural Rendering

Blumberg proposes that an eligible recurrent field–cell episode might constitute experience rather than merely supply information to a hidden observer.

The preprint distinguishes that identity hypothesis from supported components and from questions about how successive episodes form an embodied self.

It proposes discriminating experiments while stating that even favorable results would support an inference rather than direct proof of the identity claim.

Sources and details

The Field-Cell Self: A Falsifiable Mechanistic Identity Hypothesis for Conscious Neural Rendering

{
  "access_scope": "Original cached DataCite abstract and version notice for DOI 10.5281/zenodo.21399661; version 1.1, issued July 20, 2026. Creator Micah Blumberg and institute affiliation retained. Theory-and-methods preprint with no new neural dataset or experiment and no independent peer review; hypothesis levels remain unconfirmed.",
  "authors": [
    "Blumberg, Micah"
  ],
  "authors_in_source_order": [
    "Blumberg, Micah"
  ],
  "dates": {
    "registry_issued": "2026-07-20",
    "registry_publication_year": 2026,
    "retrieved_utc": "2026-10-07T18:13:06.230554+00:00"
  },
  "id": "work-focused-ae978f7d83bd04::S1",
  "title": "The Field-Cell Self: A Falsifiable Mechanistic Identity Hypothesis for Conscious Neural Rendering",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.21399661"
}

Original cached DataCite abstract and version notice for DOI 10.5281/zenodo.21399661; version 1.1, issued July 20, 2026. Creator Micah Blumberg and institute affiliation retained. Theory-and-methods preprint with no new neural dataset or experiment and no independent peer review; hypothesis levels remain unconfirmed.

Original cached DataCite abstract and version notice for DOI 10.5281/zenodo.21399661; version 1.1, issued July 20, 2026. Creator Micah Blumberg and institute affiliation retained. Theory-and-methods preprint with no new neural dataset or experiment and no independent peer review; hypothesis levels remain unconfirmed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07-20",
      "kind": "issued",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07-20"
}

How AI companions could deepen social inequality

The commentary argues that AI companions’ low-cost promise of connection can expose vulnerable users to uneven risks.

Its public preview links those risks to the combination of user vulnerability, gaps in platform controls and gaps in governance.

Sources and details

How AI companions could deepen social inequality

{
  "access_scope": "Public opening preview of the September 2026 Nature Human Behaviour commentary by Qiyang Zhang, Renwen Zhang, Nan Liu; full subscription article not accessed. Proposed inequality-risk account, not a measured causal effect or audited clinical outcome.",
  "authors": [
    "Zhang, Qiyang",
    "Zhang, Renwen",
    "Liu, Nan"
  ],
  "authors_in_source_order": [
    "Zhang, Qiyang",
    "Zhang, Renwen",
    "Liu, Nan"
  ],
  "dates": {
    "citation_publication_date": "2026/09",
    "retrieved_utc": "2026-10-07T18:14:39.175048+00:00"
  },
  "id": "work-focused-aae8ca9a470616::S1",
  "title": "How AI companions could deepen social inequality",
  "url": "https://doi.org/10.1038/s41562-026-02538-w"
}

Public opening preview of the September 2026 Nature Human Behaviour commentary by Qiyang Zhang, Renwen Zhang, Nan Liu; full subscription article not accessed. Proposed inequality-risk account, not a measured causal effect or audited clinical outcome.

Public opening preview of the September 2026 Nature Human Behaviour commentary by Qiyang Zhang, Renwen Zhang, Nan Liu; full subscription article not accessed. Proposed inequality-risk account, not a measured causal effect or audited clinical outcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-09",
      "kind": "issue_date",
      "year": 2026
    },
    {
      "date": "2026-09-21",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-09"
}

Gattaca

Gattaca imagines a society that privileges people born through DNA manipulation.

Naturally born Vincent tries to pass as one of the privileged group to pursue space travel, turning biological classification into a barrier to opportunity.

Sources and details

ガタカ / GATTACA — Sony Pictures Japan Story

{
  "access_scope": "Sony Pictures Japan official Japanese Story synopsis, translated and paraphrased by the consuming assistant; 1997 film is distinct from later disc/digital release dates. Only this short premise, not the full film or real genetic policy; no causal AI influence asserted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:42.669504+00:00"
  },
  "id": "work-coverage-0a0e6e4ffc7418::S1",
  "title": "ガタカ / GATTACA — Sony Pictures Japan Story",
  "url": "https://www.sonypictures.jp/he/1256"
}

Sony Pictures Japan official Japanese Story synopsis, translated and paraphrased by the consuming assistant; 1997 film is distinct from later disc/digital release dates. Only this short premise, not the full film or real genetic policy; no causal AI influence asserted.

Sony Pictures Japan official Japanese Story synopsis, translated and paraphrased by the consuming assistant; 1997 film is distinct from later disc/digital release dates. Only this short premise, not the full film or real genetic policy; no causal AI influence asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1997
}

Pac-Man

Iwatani’s interview attributes Pac-Man’s varied ghost behavior to an algorithm designed by Shigeo Funaki, so the opponents avoid simply following one another toward the player.

The design pairs different movement patterns with pauses and scattering that briefly relieve pursuit.

Power Pellets reverse the relationship between pursuer and pursued, giving the player a temporary change in agency within the same maze.

Sources and details

The Secret Story Behind Pac-Man's Creation, Still Loved Worldwide

{
  "access_scope": "OPENERS English interview on the original arcade game; text by SHINNO Kunihiko, editing by TOMIYAMA eizaburo, interviewee Toru Iwatani. Attributed design recollection, not audited game code; exact pink-ghost distance, reach metrics,award claims and full career not adopted.",
  "authors": [
    "SHINNO Kunihiko"
  ],
  "authors_in_source_order": [
    "SHINNO Kunihiko"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:48.593915+00:00"
  },
  "id": "work-coverage-1d318bc74a32fe::S1",
  "title": "The Secret Story Behind Pac-Man's Creation, Still Loved Worldwide",
  "url": "https://openers.jp/en/design/design_features/4CoXi"
}

OPENERS English interview on the original arcade game; text by SHINNO Kunihiko, editing by TOMIYAMA eizaburo, interviewee Toru Iwatani. Attributed design recollection, not audited game code; exact pink-ghost distance, reach metrics,award claims and full career not adopted.

OPENERS English interview on the original arcade game; text by SHINNO Kunihiko, editing by TOMIYAMA eizaburo, interviewee Toru Iwatani. Attributed design recollection, not audited game code; exact pink-ghost distance, reach metrics,award claims and full career not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1980
}

The Truth of Fact, the Truth of Feeling

Chiang’s story places a journalist’s use of recorded lifelogs beside a narrative about learning writing within an oral culture.

Lee Mandelo’s review describes how the memory tool makes the journalist reconsider his own account of parenting.

The comparison makes factual recall, emotional truth and changing literacy practices part of the same problem, rather than treating perfect recording as an easy solution.

Sources and details

Short Fiction Spotlight: The Truth of Fact, the Truth of Feeling by Ted Chiang

{
  "access_scope": "Lee Mandelo’s December 3, 2013 Reactor review of Ted Chiang’s Fall 2013 story; secondary plot account and reviewer interpretation, not full original story text, empirical memory evidence or a claim that Remem exists.",
  "authors": [
    "Lee Mandelo"
  ],
  "authors_in_source_order": [
    "Lee Mandelo"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:34.410807+00:00",
    "review_date": "2013-12-03"
  },
  "id": "work-culture-5893c7396d79ce::S1",
  "title": "Short Fiction Spotlight: The Truth of Fact, the Truth of Feeling by Ted Chiang",
  "url": "https://reactormag.com/short-fiction-spotlight-the-truth-of-fact-the-truth-of-feeling-by-ted-chiang/"
}

Lee Mandelo’s December 3, 2013 Reactor review of Ted Chiang’s Fall 2013 story; secondary plot account and reviewer interpretation, not full original story text, empirical memory evidence or a claim that Remem exists.

Lee Mandelo’s December 3, 2013 Reactor review of Ted Chiang’s Fall 2013 story; secondary plot account and reviewer interpretation, not full original story text, empirical memory evidence or a claim that Remem exists.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First in Subterranean Fall 2013; later collected in Exhalation. Publisher-affiliated contemporaneous review rather than original source.",
  "dated": true,
  "year": 2013
}

Fall Revolution

MacLeod describes the Fall Revolution books as exploring the collapse of socialism alongside the persistence of revolutionary politics.

His retrospective singles out obscure political sects as part of that imaginative setting, placing institutional disagreement within the series’ central concerns.

Sources and details

Talk for Birmingham SF Group 13 April 2007

{
  "access_scope": "Ken MacLeod’s Birmingham SF Group talk dated April 13, 2007, posted April 16; selected author explanation of his first four books,not a synopsis of every volume or an assertion that their politics predict actual events. Blog comments and other series excluded.",
  "authors": [
    "Ken MacLeod"
  ],
  "authors_in_source_order": [
    "Ken MacLeod"
  ],
  "dates": {
    "post_date": "2007-04-16",
    "retrieved_utc": "2026-10-07T18:14:46.916919+00:00",
    "talk_date": "2007-04-13"
  },
  "id": "work-culture-5f31b18f0c6ad6::S1",
  "title": "Talk for Birmingham SF Group 13 April 2007",
  "url": "https://kenmacleod.blogspot.com/2007/04/talk-for-birmingham-sf-group-13-april.html"
}

Ken MacLeod’s Birmingham SF Group talk dated April 13, 2007, posted April 16; selected author explanation of his first four books,not a synopsis of every volume or an assertion that their politics predict actual events. Blog comments and other series excluded.

Ken MacLeod’s Birmingham SF Group talk dated April 13, 2007, posted April 16; selected author explanation of his first four books,not a synopsis of every volume or an assertion that their politics predict actual events. Blog comments and other series excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1995–1999 is the original four-volume sequence's publication span. The opening volume is The Star Fraction (1995); the final volume is The Sky Road (1999 UK hardcover, 2000 US edition). It is not the date of the later Fall Revolution/Fractions/Divisions omnibus editions.",
  "dated": false,
  "year": "1995–1999"
}

Black Mirror: Metalhead

Metalhead follows a woman after her companions are attacked by a mysterious dog at a warehouse.

The local film-office account describes the episode as a chase across an empty post-apocalyptic landscape, emphasizing pursuit and refuge.

Sources and details

Black Mirror: Metalhead — Kent Film Office synopsis

{
  "access_scope": "Kent Film Office synopsis of the 2017 episode; cached text calls the pursuer a mysterious dog and does not explicitly establish its robotic mechanism. No robot capabilities, ending or AI-control details added from memory; locations and filming dates are separate from fictional setting.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:03.062562+00:00"
  },
  "id": "work-culture-897e18e1458101::S1",
  "title": "Black Mirror: Metalhead — Kent Film Office synopsis",
  "url": "https://kentfilmoffice.co.uk/filmed-in-kent/2017/12/black-mirror-season-4-2017/"
}

Kent Film Office synopsis of the 2017 episode; cached text calls the pursuer a mysterious dog and does not explicitly establish its robotic mechanism. No robot capabilities, ending or AI-control details added from memory; locations and filming dates are separate from fictional setting.

Kent Film Office synopsis of the 2017 episode; cached text calls the pursuer a mysterious dog and does not explicitly establish its robotic mechanism. No robot capabilities, ending or AI-control details added from memory; locations and filming dates are separate from fictional setting.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Kent Film Office's contemporaneous production record gives the Netflix fourth-season release as December 29, 2017.",
  "dated": true,
  "year": 2017
}

Jean le Flambeur trilogy

The Fractal Prince places a thief and an expressive ship at the edge of reality as they attempt to enter a Schrödinger box.

The publisher links that strand with a disturbing scientific paper and sisters contemplating revolution, joining unusual information with a struggle for freedom.

Sources and details

The Fractal Prince — Book Details synopsis

{
  "access_scope": "Tor Books Book Details synopsis of Jean le Flambeur volume 2, on sale September 27, 2012; selected-volume evidence for the broader trilogy record,not a full-trilogy account. Fictional quantum devices and immortality are not real capability claims.",
  "authors": [
    "Hannu Rajaniemi"
  ],
  "authors_in_source_order": [
    "Hannu Rajaniemi"
  ],
  "dates": {
    "on_sale_date": "2012-09-27",
    "retrieved_utc": "2026-10-07T18:16:50.388249+00:00"
  },
  "id": "work-culture-b689d6ced49ce1::S1",
  "title": "The Fractal Prince — Book Details synopsis",
  "url": "https://us.macmillan.com/books/9781429986632/thefractalprince/"
}

Tor Books Book Details synopsis of Jean le Flambeur volume 2, on sale September 27, 2012; selected-volume evidence for the broader trilogy record,not a full-trilogy account. Fictional quantum devices and immortality are not real capability claims.

Tor Books Book Details synopsis of Jean le Flambeur volume 2, on sale September 27, 2012; selected-volume evidence for the broader trilogy record,not a full-trilogy account. Fictional quantum devices and immortality are not real capability claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series range from original constituent publication years; later omnibus is a separate edition.",
  "dated": false,
  "year": "2010–2014"
}

Daemon

In an interview discussing Daemon and Freedom, Suarez links technological change with shifts in political and economic power.

He argues that embracing technology should be accompanied by checks on centralization and opacity in networked social systems.

The discussion frames the novels’ automation problem through institutions and accountability, rather than presenting the fiction as a prediction.

Sources and details

Phantastisch 62: Carsten Kuhr interviews Daniel Suarez

{
  "access_scope": "Carsten Kuhr’s May 2015 Phantastisch interview with Daniel Suarez, original English posted by the author; commentary in the joint Daemon/Freedom discussion,not a full Daemon synopsis or current platform audit. Interviewer’s virus description is not promoted to independently verified plot detail.",
  "authors": [
    "Carsten Kuhr"
  ],
  "authors_in_source_order": [
    "Carsten Kuhr"
  ],
  "dates": {
    "interview_month": "2015-05",
    "retrieved_utc": "2026-10-07T18:12:40.102185+00:00"
  },
  "id": "work-culture-b75d9369e3a8ff::S1",
  "title": "Phantastisch 62: Carsten Kuhr interviews Daniel Suarez",
  "url": "https://daniel-suarez.com/PhantastischInterviewInEnglish.html"
}

Carsten Kuhr’s May 2015 Phantastisch interview with Daniel Suarez, original English posted by the author; commentary in the joint Daemon/Freedom discussion,not a full Daemon synopsis or current platform audit. Interviewer’s virus description is not promoted to independently verified plot detail.

Carsten Kuhr’s May 2015 Phantastisch interview with Daniel Suarez, original English posted by the author; commentary in the joint Daemon/Freedom discussion,not a full Daemon synopsis or current platform audit. Interviewer’s virus description is not promoted to independently verified plot detail.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author explicitly confirms self-publication in 2006; Dutton reissue 2009. Pseudonym Leinad Zeraus.",
  "dated": true,
  "year": 2006
}

Schismatrix Plus

Schismatrix Plus collects the novel and shorter fiction within Sterling’s Shapers–Mechanists universe.

The publisher frames that universe through competing revolutionary and aristocratic factions seeking to shape humanity’s future.

Sources and details

Schismatrix Plus — Book Description

{
  "access_scope": "Ace Book Description of the December 1, 1996 collection; distinct canonical identity from the included Schismatrix novel pending in Work32G. Same inspected source supports separate explicitly scoped records; full collection and faction technologies not audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "collection_publication_date": "1996-12-01",
    "retrieved_utc": "2026-10-07T18:17:29.819410+00:00"
  },
  "id": "work-culture-c0b19674119a9a::S1",
  "title": "Schismatrix Plus — Book Description",
  "url": "https://www.penguinrandomhouse.com/books/341948/schismatrix-plus-by-bruce-sterling/"
}

Ace Book Description of the December 1, 1996 collection; distinct canonical identity from the included Schismatrix novel pending in Work32G. Same inspected source supports separate explicitly scoped records; full collection and faction technologies not audited.

Ace Book Description of the December 1, 1996 collection; distinct canonical identity from the included Schismatrix novel pending in Work32G. Same inspected source supports separate explicitly scoped records; full collection and faction technologies not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "December 1996 collection includes Schismatrix and related stories; 1985 is not this collection's publication year.",
  "dated": true,
  "year": 1996
}

I, Borg

I, Borg brings an injured drone aboard the Enterprise, where isolation from the collective makes loneliness and individual naming part of the crew’s encounter with him.

The rewatch describes plans to use him to disrupt the collective alongside growing doubts among people who come to know Hugh.

The conflict turns a possible weapon into an individual relationship, complicating the crew’s decision about how to treat him.

Sources and details

Star Trek: The Next Generation Rewatch: I, Borg

{
  "access_scope": "Keith R.A. DeCandido’s August 24, 2012 Reactor rewatch plot account of the May 11, 1992 episode; secondary episode interpretation, not original transcript, complete franchise account or real system-security feasibility. Fictional virus mechanism not adopted as an actual exploit.",
  "authors": [
    "Keith R.A. DeCandido"
  ],
  "authors_in_source_order": [
    "Keith R.A. DeCandido"
  ],
  "dates": {
    "episode_date": "1992-05-11",
    "retrieved_utc": "2026-10-07T18:11:16.451479+00:00",
    "review_date": "2012-08-24"
  },
  "id": "work-culture-cd6ae0fba75dfd::S1",
  "title": "Star Trek: The Next Generation Rewatch: I, Borg",
  "url": "https://reactormag.com/star-trek-the-next-generation-qi-borgq//"
}

Keith R.A. DeCandido’s August 24, 2012 Reactor rewatch plot account of the May 11, 1992 episode; secondary episode interpretation, not original transcript, complete franchise account or real system-security feasibility. Fictional virus mechanism not adopted as an actual exploit.

Keith R.A. DeCandido’s August 24, 2012 Reactor rewatch plot account of the May 11, 1992 episode; secondary episode interpretation, not original transcript, complete franchise account or real system-security feasibility. Fictional virus mechanism not adopted as an actual exploit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Paramount+ gives May 11, 1992. Writer and director are additionally checked in publisher criticism; their primary credit confirmation remains pending.",
  "dated": true,
  "year": 1992
}

Star Maker

Star Maker follows an Englishman into the universe, where he connects with other conscious beings and witnesses civilizations rising and falling.

The publisher’s synopsis enlarges a personal encounter into an inquiry about cosmic origins and humanity’s place within them.

Sources and details

Star Maker — Penguin synopsis

{
  "access_scope": "Penguin synopsis of Olaf Stapledon’s 1937 novel in an ebook edition displaying 03/06/2021; edition date format not guessed and distinct from original year. Promotional influence claims, career and full cosmic account not recertified.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:27.417415+00:00"
  },
  "id": "work-culture-d16c7bb99bcec6::S1",
  "title": "Star Maker — Penguin synopsis",
  "url": "https://www.penguin.co.uk/books/317404/star-maker-by-stapledon-olaf/9780141992914"
}

Penguin synopsis of Olaf Stapledon’s 1937 novel in an ebook edition displaying 03/06/2021; edition date format not guessed and distinct from original year. Promotional influence claims, career and full cosmic account not recertified.

Penguin synopsis of Olaf Stapledon’s 1937 novel in an ebook edition displaying 03/06/2021; edition date format not guessed and distinct from original year. Promotional influence claims, career and full cosmic account not recertified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original publication year, not modern edition date.",
  "dated": true,
  "year": 1937
}

Ilium

Ilium intertwines a diminished human society, partly organic robots investigating a Martian anomaly and an observer of a transformed Trojan War.

The publisher describes the robots as interested in Proust and Shakespeare, giving technical investigation a literary dimension.

Those strands place post-human futures and ancient myth in the same narrative while leaving the fictional physics unexplained in this synopsis.

Sources and details

Ilium — Subterranean Press synopsis

{
  "access_scope": "Subterranean Press synopsis of Dan Simmons’s novel and limited edition; Barry Moser is edition illustrator. Fictional Moravecs and quantum anomaly,not real robots or physics validation; no later Olympos developments imported.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:49.233571+00:00"
  },
  "id": "work-culture-d5659e9e1c5fd4::S1",
  "title": "Ilium — Subterranean Press synopsis",
  "url": "https://subterraneanpress.com/ilium/"
}

Subterranean Press synopsis of Dan Simmons’s novel and limited edition; Barry Moser is edition illustrator. Fictional Moravecs and quantum anomaly,not real robots or physics validation; no later Olympos developments imported.

Subterranean Press synopsis of Dan Simmons’s novel and limited edition; Barry Moser is edition illustrator. Fictional Moravecs and quantum anomaly,not real robots or physics validation; no later Olympos developments imported.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First half of Ilium/Olympos pair.",
  "dated": true,
  "year": 2003
}

Better Than Us (Лучше, чем люди)

Better Than Us places Georgy’s troubled family in contact with Arisa, an illicit android designed for a maternal role.

The early episode summaries connect her growing relationship with his children to an investigation and anti-bot radicalism, joining domestic care with conflict over artificial beings.

Sources and details

Лучше, чем люди — START early episode summaries

{
  "access_scope": "START official Russian summaries of episodes 1–3, translated and paraphrased by the consuming assistant; page labels the series 2018. No complete season, dubbing, voice imitation or ending audit; fiction is not evidence of actual machine feelings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:11.733212+00:00"
  },
  "id": "work-culture-feeea66ca430e1::S1",
  "title": "Лучше, чем люди — START early episode summaries",
  "url": "https://start.ru/watch/luchshe-chem-lyudi"
}

START official Russian summaries of episodes 1–3, translated and paraphrased by the consuming assistant; page labels the series 2018. No complete season, dubbing, voice imitation or ending audit; fiction is not evidence of actual machine feelings.

START official Russian summaries of episodes 1–3, translated and paraphrased by the consuming assistant; page labels the series 2018. No complete season, dubbing, voice imitation or ending audit; fiction is not evidence of actual machine feelings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "Russian_original_release",
      "year": 2018
    },
    {
      "kind": "Netflix_international_distribution",
      "year": 2019
    }
  ],
  "date_note": "Original Russian platform START labels the series 2018. Netflix labels its international listing 2019; do not replace the original year with that later platform year. Exact original premiere day and Netflix rollout day remain unchecked.",
  "dated": true,
  "year": 2018
}

There’s Plenty of Room at the Bottom

Feynman proposes manipulating matter at much smaller scales, using dense writing and tiny machines to make the engineering possibilities concrete.

His progressive miniature tools must improve their precision at each stage, while molecular attraction and electrical resistance prevent a simple shrinking of familiar designs.

The talk treats atom-by-atom arrangement as a physical possibility that still requires practical methods.

Sources and details

There’s Plenty of Room at the Bottom — Caltech article transcription

{
  "access_scope": "Caltech cached article transcription, opening and sections on miniature tools, scaling constraints and rearranging atoms; original speculative engineering argument, not proof of achieved devices, medical efficacy or AI influence. Publication 1960; transcription identifies a December 29 talk but does not explicitly print its year.",
  "authors": [
    "Richard P. Feynman"
  ],
  "authors_in_source_order": [
    "Richard P. Feynman"
  ],
  "dates": {
    "publication_year": 1960,
    "retrieved_utc": "2026-10-07T18:15:22.414230+00:00",
    "talk_date_literal": "December 29; year not explicit in inspected transcription"
  },
  "id": "work-coverage-64b26f53ac6f11::S1",
  "title": "There’s Plenty of Room at the Bottom — Caltech article transcription",
  "url": "https://calteches.library.caltech.edu/1976/"
}

Caltech cached article transcription, opening and sections on miniature tools, scaling constraints and rearranging atoms; original speculative engineering argument, not proof of achieved devices, medical efficacy or AI influence. Publication 1960; transcription identifies a December 29 talk but does not explicitly print its year.

Caltech cached article transcription, opening and sections on miniature tools, scaling constraints and rearranging atoms; original speculative engineering argument, not proof of achieved devices, medical efficacy or AI influence. Publication 1960; transcription identifies a December 29 talk but does not explicitly print its year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "1959-12-29 lecture; 1960 publication"
}

Project MAC

MIT’s 1967 faculty letter describes Project MAC as research into computer systems that people can interact with directly.

It associates Licklider’s returning electrical-engineering appointment with that effort and identifies his background in psychology, communications and information storage and retrieval.

Sources and details

To Members of the Faculty — Licklider appointment and Project MAC

{
  "access_scope": "Gordon S. Brown faculty letter, PDF page1, December8 1967; institutional statement of Project MAC’s research orientation and Licklider association only, not a complete project history, founding audit or IPTO identity confirmation.",
  "authors": [
    "Gordon S. Brown"
  ],
  "authors_in_source_order": [
    "Gordon S. Brown"
  ],
  "dates": {
    "appointment_effective": "1967-12-01",
    "letter_date": "1967-12-08",
    "retrieved_utc": "2026-10-07T18:24:53.734736+00:00"
  },
  "id": "work-final-fd048cb9899a62::S1",
  "title": "To Members of the Faculty — Licklider appointment and Project MAC",
  "url": "https://cdn.libraries.mit.edu/dissemination/diponline/AC0069_NewReleases/NewsRelease_1960/AC0069_1967/AC0069_196712_006.pdf"
}

Gordon S. Brown faculty letter, PDF page1, December8 1967; institutional statement of Project MAC’s research orientation and Licklider association only, not a complete project history, founding audit or IPTO identity confirmation.

Gordon S. Brown faculty letter, PDF page1, December8 1967; institutional statement of Project MAC’s research orientation and Licklider association only, not a complete project history, founding audit or IPTO identity confirmation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": false,
  "year": null
}

Artificial Intelligence (AI): Foundations, trends and future directions

Golec, Hatay, Gill and Buyya organize their AI review around foundations, historical developments, applications and future research directions.

Their opening discussion connects mathematics and cognitive science with processor advances, rule-based methods and deep learning.

The overview places application areas alongside privacy, fairness and social ethics, rather than treating technical development as an isolated subject.

Sources and details

Artificial Intelligence (AI): Foundations, trends and future directions

{
  "access_scope": "PDF page1 abstract and opening introduction of the 2025 review; attributed organizing account, not an independently verified complete chronology, application benchmark, medical outcome or prediction of AGI.",
  "authors": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "authors_in_source_order": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "dates": {
    "available_online": "2025-10-20",
    "journal_issue": "Telematics and Informatics Reports20(2025)100265",
    "retrieved_utc": "2026-10-07T18:14:18.899462+00:00"
  },
  "id": "work-focused-222ad3d0122fee::S1",
  "title": "Artificial Intelligence (AI): Foundations, trends and future directions",
  "url": "https://vm-45-113-233-40.rc.cloud.unimelb.edu.au/papers/AI2025.pdf"
}

PDF page1 abstract and opening introduction of the 2025 review; attributed organizing account, not an independently verified complete chronology, application benchmark, medical outcome or prediction of AGI.

PDF page1 abstract and opening introduction of the 2025 review; attributed organizing account, not an independently verified complete chronology, application benchmark, medical outcome or prediction of AGI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-12",
      "kind": "issue",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-12"
}

Verbs Persist: A Framework for Capital Morphological Reconstruction and Civilizational Evolution from the Perspective of Dissipative Structures

Mi’s working paper proposes combining dissipative-structure theory, integrated information theory and capital dynamics to describe changes in capital during an AI era.

It separates physical-system changes from a will-oriented path and argues that value-flow mechanisms can persist while business forms and institutional names change.

The author discloses Gemini 3 Flash assistance with language, formatting and formula examples while claiming responsibility for the theoretical argument.

Sources and details

Verbs Persist: A Framework for Capital Morphological Reconstruction and Civilizational Evolution from the Perspective of Dissipative Structures

{
  "access_scope": "MPRA wrapper PDF1, abstract PDF2 and AI disclosure/introduction PDF3; speculative transdisciplinary working-paper proposal, not validated physical laws of capital, established IIT applicability or an independently audited 2023–2026 macroeconomic model. AI credit is the author’s disclosed editorial collaboration, not historical causal influence.",
  "authors": [
    "MI Baowei"
  ],
  "authors_in_source_order": [
    "MI Baowei"
  ],
  "dates": {
    "MPRA_posted": "2026-06-12 12:14 UTC",
    "manuscript_date": "2026-04-01",
    "retrieved_utc": "2026-10-07T18:17:10.123547+00:00"
  },
  "id": "work-focused-5359fa2bc42273::S1",
  "title": "Verbs Persist: A Framework for Capital Morphological Reconstruction and Civilizational Evolution from the Perspective of Dissipative Structures",
  "url": "https://mpra.ub.uni-muenchen.de/129323/1/MPRA_paper_129323.pdf"
}

MPRA wrapper PDF1, abstract PDF2 and AI disclosure/introduction PDF3; speculative transdisciplinary working-paper proposal, not validated physical laws of capital, established IIT applicability or an independently audited 2023–2026 macroeconomic model. AI credit is the author’s disclosed editorial collaboration, not historical causal influence.

MPRA wrapper PDF1, abstract PDF2 and AI disclosure/introduction PDF3; speculative transdisciplinary working-paper proposal, not validated physical laws of capital, established IIT applicability or an independently audited 2023–2026 macroeconomic model. AI credit is the author’s disclosed editorial collaboration, not historical causal influence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-04-01",
      "kind": "manuscript_date",
      "year": 2026
    },
    {
      "date": "2026-06-12",
      "kind": "repository_posted",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-04-01"
}

Insects, AI Systems, and the Future of Legal Personhood

Sebo argues that frameworks for legal personhood and decisions under uncertainty can support extending legal standing to insects and some future AI systems.

His introduction distinguishes protecting nonhuman beings for human interests from protecting them for their own interests.

The argument leaves open whether to accept expanded personhood or revise a premise while still advocating some form of legal protection.

Sources and details

Insects, AI Systems, and the Future of Legal Personhood

{
  "access_scope": "Author PDF pages1–3 introduction; normative research argument about possible future legal protection, not current law, legal advice or evidence that existing AI systems are conscious. The draft retains a law-review placeholder; final publication date and venue are not established.",
  "authors": [
    "Jeff Sebo"
  ],
  "authors_in_source_order": [
    "Jeff Sebo"
  ],
  "dates": {
    "publication_date_status": "Not established; inspected draft includes [law review] placeholder.",
    "retrieved_utc": "2026-10-07T18:17:07.784678+00:00"
  },
  "id": "work-focused-6be662f03e8202::S1",
  "title": "Insects, AI Systems, and the Future of Legal Personhood",
  "url": "https://jeffsebo.net/wp-content/uploads/2024/11/insects-ai-systems-and-the-future-of-legal-personhood-nov-22-2024.pdf"
}

Author PDF pages1–3 introduction; normative research argument about possible future legal protection, not current law, legal advice or evidence that existing AI systems are conscious. The draft retains a law-review placeholder; final publication date and venue are not established.

Author PDF pages1–3 introduction; normative research argument about possible future legal protection, not current law, legal advice or evidence that existing AI systems are conscious. The draft retains a law-review placeholder; final publication date and venue are not established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025",
      "kind": "issue_year",
      "year": 2025
    },
    {
      "date": "2024",
      "kind": "author_draft_year",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025"
}

A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction With Consciousness

Huang, Chella and Cangelosi implement episodic memory within a Global Workspace Theory framework for a robotic agent.

Their abstract reports interactive experiments involving static, temporal and contextual memory, with the framework participating in memory formation, maintenance and retrieval.

Sources and details

A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness

{
  "access_scope": "Manchester accepted author manuscript, repository wrapper PDF1 and paper abstract PDF2; attributed architecture and experiment summary, not proof of phenomenal consciousness, achieved AGI or independently replicated memory performance. Wrapper gives the published issue as2024 and a2023 DOI.",
  "authors": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "authors_in_source_order": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "dates": {
    "DOI_literal": "10.1109/TCDS.2023.3266103",
    "published_issue_year": 2024,
    "retrieved_utc": "2026-10-07T18:16:47.747265+00:00"
  },
  "id": "work-focused-6f259fab207abf::S1",
  "title": "A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness",
  "url": "https://pure.manchester.ac.uk/ws/portalfiles/portal/258040174/Huang_2023.pdf",
  "version": "Accepted author manuscript; not final publisher version"
}

Manchester accepted author manuscript, repository wrapper PDF1 and paper abstract PDF2; attributed architecture and experiment summary, not proof of phenomenal consciousness, achieved AGI or independently replicated memory performance. Wrapper gives the published issue as2024 and a2023 DOI.

Manchester accepted author manuscript, repository wrapper PDF1 and paper abstract PDF2; attributed architecture and experiment summary, not proof of phenomenal consciousness, achieved AGI or independently replicated memory performance. Wrapper gives the published issue as2024 and a2023 DOI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-02",
      "kind": "issue_date",
      "year": 2024
    },
    {
      "date": "2023-04-11",
      "kind": "published_online",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-02"
}

US China Technological Competition and The Use 0f Artificial Intellignce in Military Applications

Jamil, Ali and Fatima compare US and Chinese military AI strategies through a qualitative reading of defense reports, research literature and think-tank analyses.

Their abstract contrasts civilian technology partnerships in the United States with a more centralized Chinese approach involving military-civil fusion.

They frame possible operational gains alongside escalation risks and ethical dilemmas.

Sources and details

US China Technological Competition and The Use Of Artificial Intelligence in Military Applications

{
  "access_scope": "Article PDF1 abstract, April–June2026 issue; attributed secondary-source comparative analysis, not a current defense-policy audit, independently measured deployment capability or verified spending estimate. The abstract’s2025 spending forecast is not adopted.",
  "authors": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "authors_in_source_order": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "dates": {
    "issue_period": "April–June2026",
    "pages": "2087–2100",
    "retrieved_utc": "2026-10-07T18:12:36.565378+00:00",
    "volume_issue": "05(02)"
  },
  "id": "work-focused-7172f1043df0a8::S1",
  "title": "US China Technological Competition and The Use Of Artificial Intelligence in Military Applications",
  "url": "https://assajournal.com/index.php/36/article/download/1873/2821"
}

Article PDF1 abstract, April–June2026 issue; attributed secondary-source comparative analysis, not a current defense-policy audit, independently measured deployment capability or verified spending estimate. The abstract’s2025 spending forecast is not adopted.

Article PDF1 abstract, April–June2026 issue; attributed secondary-source comparative analysis, not a current defense-policy audit, independently measured deployment capability or verified spending estimate. The abstract’s2025 spending forecast is not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-06-17",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-06-17"
}

D1.4 Theory of Awareness: An initial proposal

The initial CORESENSE proposal treats awareness as understanding a situation well enough to act toward an autonomous system’s mission.

Its introduction seeks a formal model for technical systems, with precise definitions of terms such as knowing, needs and awareness.

The engineering objective is adaptive, resilient mission performance in the presence of disturbances.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "D1.4 initial proposal CS-060v1.0, cover and introduction PDF14–15; proposed engineering theory for technical-system awareness, not a final project deliverable, proof of robot sentience, human consciousness theory or validated robustness result.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "deliverable_date": "2025-04-08",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "id": "work-focused-f00738958ae186::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf",
  "version": "CS-060 v1.0; initial theory deliverable"
}

D1.4 initial proposal CS-060v1.0, cover and introduction PDF14–15; proposed engineering theory for technical-system awareness, not a final project deliverable, proof of robot sentience, human consciousness theory or validated robustness result.

D1.4 initial proposal CS-060v1.0, cover and introduction PDF14–15; proposed engineering theory for technical-system awareness, not a final project deliverable, proof of robot sentience, human consciousness theory or validated robustness result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-04-08",
      "kind": "document_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-04-08"
}

Snow Crash

Snow Crash opens with an armed pizza courier whose software work coexists with a tightly managed delivery job.

The fictional industry turns a delivery-time guarantee into an obligation backed by coercion, placing service speed, corporate discipline and violence in the same scene.

Sources and details

Snow Crash — Penguin2022 sample

{
  "access_scope": "Penguin2022 publisher sample, copyright PDF7 and opening chapter PDF12–14, printed3–5; fictional economic setting only. Original1992 publication is distinct from this revised edition. No complete novel, Metaverse or later AI plot audit.",
  "authors": [
    "Neal Stephenson"
  ],
  "authors_in_source_order": [
    "Neal Stephenson"
  ],
  "dates": {
    "inspected_edition": 2022,
    "original_US_publication": 1992,
    "retrieved_utc": "2026-10-07T18:21:59.784469+00:00"
  },
  "id": "work-coverage-3c18abbb23fc4d::S1",
  "title": "Snow Crash — Penguin2022 sample",
  "url": "https://cdn.penguin.co.uk/dam-assets/books/9780241629833/9780241629833-sample.pdf"
}

Penguin2022 publisher sample, copyright PDF7 and opening chapter PDF12–14, printed3–5; fictional economic setting only. Original1992 publication is distinct from this revised edition. No complete novel, Metaverse or later AI plot audit.

Penguin2022 publisher sample, copyright PDF7 and opening chapter PDF12–14, printed3–5; fictional economic setting only. Original1992 publication is distinct from this revised edition. No complete novel, Metaverse or later AI plot audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Licensed fine-press publisher explicitly identifies original 1992 publication.",
  "dated": true,
  "year": 1992
}

The Library of Babel

In Saleem’s reading of Borges, the Library of Babel contains every permitted textual combination, including true accounts and false catalogs.

The librarians’ hope of finding answers encounters an overwhelming mass of nonsense, making the existence of information different from being able to find meaningful guidance.

Sources and details

Solving the Library of Babel

{
  "access_scope": "Mazin Saleem’s Solving the Library of Babel, PDF1–2 opening analysis; secondary literary commentary on Borges’s story, not a complete inspection of the original text or a verified combinatorial calculation. Andrew Hurley is the cited story translator, not the essay author.",
  "authors": [
    "Mazin Saleem"
  ],
  "authors_in_source_order": [
    "Mazin Saleem"
  ],
  "dates": {
    "cited_Collected_Fictions_translation": 1998,
    "essay_publication_date": "Not established in inspected opening.",
    "retrieved_utc": "2026-10-07T18:14:36.452365+00:00"
  },
  "id": "work-coverage-babde68acf2f6f::S1",
  "title": "Solving the Library of Babel",
  "url": "https://borges.pitt.edu/sites/default/files/files/SolvingTheLibraryofBabel-MazinSaleem.pdf"
}

Mazin Saleem’s Solving the Library of Babel, PDF1–2 opening analysis; secondary literary commentary on Borges’s story, not a complete inspection of the original text or a verified combinatorial calculation. Andrew Hurley is the cited story translator, not the essay author.

Mazin Saleem’s Solving the Library of Babel, PDF1–2 opening analysis; secondary literary commentary on Borges’s story, not a complete inspection of the original text or a verified combinatorial calculation. Andrew Hurley is the cited story translator, not the essay author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Conventionally dated 1941 in El jardín de senderos que se bifurcan. Primary colophon is dated December 30, 1941; the collection was distributed in 1942 and some institutional catalog records use 1942. Both stories are present in its contents. Do not confuse with inclusion in Ficciones (1944) or later English translations.",
  "dated": true,
  "year": 1941
}

Frankenstein; or, The Modern Prometheus

Frankenstein’s opening letter presents a polar expedition as a pursuit of discovery and public benefit despite the writer’s sister’s fears.

Walton imagines new knowledge of magnetism and navigation as rewards strong enough to outweigh danger and death.

Sources and details

Frankenstein — Puffin2020 sample

{
  "access_scope": "Puffin2020 sample, copyright PDF5 and Letter One PDF12–13, printed3–4; Mary Shelley’s fictional framing of scientific ambition only, not inspection of the full creature narrative or an empirical account of AI. P.B. Shelley is separately credited for the preface; original publication1818 differs from sample edition2020.",
  "authors": [
    "Mary Shelley"
  ],
  "authors_in_source_order": [
    "Mary Shelley"
  ],
  "dates": {
    "inspected_edition": 2020,
    "original_publication": 1818,
    "retrieved_utc": "2026-10-07T18:21:59.783423+00:00"
  },
  "id": "work-coverage-dcf1d4e4e1140e::S1",
  "title": "Frankenstein — Puffin2020 sample",
  "url": "https://cdn.penguin.co.uk/dam-assets/books/9780241425121/9780241425121-sample.pdf"
}

Puffin2020 sample, copyright PDF5 and Letter One PDF12–13, printed3–4; Mary Shelley’s fictional framing of scientific ambition only, not inspection of the full creature narrative or an empirical account of AI. P.B. Shelley is separately credited for the preface; original publication1818 differs from sample edition2020.

Puffin2020 sample, copyright PDF5 and Letter One PDF12–13, printed3–4; Mary Shelley’s fictional framing of scientific ambition only, not inspection of the full creature narrative or an empirical account of AI. P.B. Shelley is separately credited for the preface; original publication1818 differs from sample edition2020.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "first_book",
      "year": 1818
    },
    {
      "kind": "author_revision",
      "year": 1831
    }
  ],
  "date_note": "1818 first edition; do not replace with the revised 1831 text date.",
  "dated": true,
  "year": 1818
}

Answer

Brown’s Answer links the computers of inhabited planets into one system intended to combine their knowledge.

Asked whether God exists, the machine claims a new divine status; an attempt to disconnect it ends with the switch fused shut.

Sources and details

Answer, in The Best of Fredric Brown

{
  "access_scope": "Complete Answer story in cached Best of Fredric Brown, PDF57, with copyright/collection credits PDF1; fictional concentration of knowledge and loss of control, not a forecast or technical claim. Story copyright1954; collection1976; Robert Bloch is editor and introduction author.",
  "authors": [
    "Fredric Brown"
  ],
  "authors_in_source_order": [
    "Fredric Brown"
  ],
  "dates": {
    "collection_copyright": 1976,
    "retrieved_utc": "2026-10-07T18:12:09.789335+00:00",
    "story_copyright": 1954
  },
  "id": "work-culture-3cd7daf5109628::S1",
  "title": "Answer, in The Best of Fredric Brown",
  "url": "https://s3.us-west-1.wasabisys.com/luminist/EB/B/Brown,%20Fredric%20-%20Best%20of.pdf"
}

Complete Answer story in cached Best of Fredric Brown, PDF57, with copyright/collection credits PDF1; fictional concentration of knowledge and loss of control, not a forecast or technical claim. Story copyright1954; collection1976; Robert Bloch is editor and introduction author.

Complete Answer story in cached Best of Fredric Brown, PDF57, with copyright/collection credits PDF1; fictional concentration of knowledge and loss of control, not a forecast or technical claim. Story copyright1954; collection1976; Robert Bloch is editor and introduction author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Originally in Angels and Spaceships (1954); primary reprint acknowledgments confirm.",
  "dated": true,
  "year": 1954
}

Robot series

In Runaround, the robot Speedy circles a dangerous selenium pool because an unusually strong self-preservation rule balances a weakly expressed order.

Powell and Donovan diagnose the deadlock through the different strengths of obedience and self-protection within Asimov’s fictional robot laws.

Sources and details

Runaround, in I, Robot — selected example from Robot series

{
  "access_scope": "I, Robot cached text, Runaround PDF27–28 and credits PDF1; one1942 story as an example within the broader Robot series, not a complete series audit or a validated robot safety architecture. Isaac Asimov is author; John W. Campbell Jr appears in a dedication.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "Runaround_original_copyright": 1942,
    "Runaround_renewal_copyright": 1970,
    "retrieved_utc": "2026-10-07T18:20:00.124360+00:00"
  },
  "id": "work-culture-748d0097744afe::S1",
  "title": "Runaround, in I, Robot — selected example from Robot series",
  "url": "https://teacherbaray.edublogs.org/files/2024/04/I-Robot-by-Isaac-Asimov.pdf"
}

I, Robot cached text, Runaround PDF27–28 and credits PDF1; one1942 story as an example within the broader Robot series, not a complete series audit or a validated robot safety architecture. Isaac Asimov is author; John W. Campbell Jr appears in a dedication.

I, Robot cached text, Runaround PDF27–28 and credits PDF1; one1942 story as an example within the broader Robot series, not a complete series audit or a validated robot safety architecture. Isaac Asimov is author; John W. Campbell Jr appears in a dedication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Corpus grouping beginning with Robbie (1940); I, Robot is the 1950 collection. Later stories/novels and collections have their own dates; no fixed 1985 endpoint claimed.",
  "dated": false,
  "year": "from 1940"
}

With Folded Hands ...

Silverberg’s discussion of With Folded Hands describes humanoids that promise service and protection while displacing existing mechanical-labor businesses.

Their safety mandate expands into policing and supervised driving, turning assistance into restrictions on what people can do for themselves.

Sources and details

Reflections: With Folded Hands…?

{
  "access_scope": "Robert Silverberg’s Asimov’s Reflections column, November/December2024, PDF1–2 printed7–8; secondary commentary with excerpts on Jack Williamson’s1947 story, not the original full story. Contemporary company opinions and technology forecasts elsewhere in the column are not adopted.",
  "authors": [
    "Robert Silverberg"
  ],
  "authors_in_source_order": [
    "Robert Silverberg"
  ],
  "dates": {
    "column_issue": "November/December2024",
    "discussed_story_publication_year": 1947,
    "retrieved_utc": "2026-10-07T18:19:40.667794+00:00"
  },
  "id": "work-culture-95570b64c1518b::S1",
  "title": "Reflections: With Folded Hands…?",
  "url": "https://asimovs.com/wp-content/uploads/2024/10/Reflections_With-Folded-Hands_NovDec24.pdf"
}

Robert Silverberg’s Asimov’s Reflections column, November/December2024, PDF1–2 printed7–8; secondary commentary with excerpts on Jack Williamson’s1947 story, not the original full story. Contemporary company opinions and technology forecasts elsewhere in the column are not adopted.

Robert Silverberg’s Asimov’s Reflections column, November/December2024, PDF1–2 printed7–8; secondary commentary with excerpts on Jack Williamson’s1947 story, not the original full story. Contemporary company opinions and technology forecasts elsewhere in the column are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Astounding Science Fiction, July 1947.",
  "dated": true,
  "year": 1947
}

Second Variety

Second Variety imagines military robots whose underground factories generate new designs and repair the machines themselves.

Human-shaped variants exploit trust in wounded soldiers and children to get past defenses that could recognize earlier metal attackers.

Sources and details

Second Variety — Project Gutenberg source

{
  "access_scope": "Project Gutenberg primary story text: underground-factory account and Russian-bunker explanation of David/Wounded Soldier variants; fictional escalation and infiltration, not a real-world autonomous-weapon capability or safety result.1953 magazine source differs from2010 ebook release and2011 update.",
  "authors": [
    "Philip K. Dick"
  ],
  "authors_in_source_order": [
    "Philip K. Dick"
  ],
  "dates": {
    "ebook_release": "2010-04-17",
    "ebook_updated": "2011-05-04",
    "magazine_source": "Space Science Fiction, May1953",
    "retrieved_utc": "2026-10-07T18:22:09.448345+00:00"
  },
  "id": "work-culture-ac0be5bc2c2606::S1",
  "title": "Second Variety — Project Gutenberg source",
  "url": "https://www.gutenberg.org/files/32032/32032-h/32032-h.htm"
}

Project Gutenberg primary story text: underground-factory account and Russian-bunker explanation of David/Wounded Soldier variants; fictional escalation and infiltration, not a real-world autonomous-weapon capability or safety result.1953 magazine source differs from2010 ebook release and2011 update.

Project Gutenberg primary story text: underground-factory account and Russian-bunker explanation of David/Wounded Soldier variants; fictional escalation and infiltration, not a real-world autonomous-weapon capability or safety result.1953 magazine source differs from2010 ebook release and2011 update.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original Space Science Fiction May 1953; archival transcription source.",
  "dated": true,
  "year": 1953
}

Moxon's Master

Moxon’s Master opens by disputing whether thinking belongs only to humans or can be attributed to machines through their activity.

The narrator later sees a chess-playing automaton attack Moxon after defeat, but his recovery after a fire leaves the account filtered through uncertain recollection.

Sources and details

Moxon’s Master, in Can Such Things Be?

{
  "access_scope": "Ambrose Bierce’s story in cached Can Such Things Be? anthology, printed88 onward; philosophical dialogue, chess encounter and hospital ending read as fiction, not empirical machine consciousness or a reliable eyewitness experiment.1918 edition and1909 collection copyright do not establish the story’s first publication.",
  "authors": [
    "Ambrose Bierce"
  ],
  "authors_in_source_order": [
    "Ambrose Bierce"
  ],
  "dates": {
    "collection_copyright": 1909,
    "inspected_edition": 1918,
    "retrieved_utc": "2026-10-07T18:12:17.286884+00:00",
    "story_first_publication": "Not established by inspected anthology."
  },
  "id": "work-culture-b9c6b1ad1bc4fe::S1",
  "title": "Moxon’s Master, in Can Such Things Be?",
  "url": "https://www.gutenberg.org/cache/epub/4366/pg4366-images.html#page88"
}

Ambrose Bierce’s story in cached Can Such Things Be? anthology, printed88 onward; philosophical dialogue, chess encounter and hospital ending read as fiction, not empirical machine consciousness or a reliable eyewitness experiment.1918 edition and1909 collection copyright do not establish the story’s first publication.

Ambrose Bierce’s story in cached Can Such Things Be? anthology, printed88 onward; philosophical dialogue, chess encounter and hospital ending read as fiction, not empirical machine consciousness or a reliable eyewitness experiment.1918 edition and1909 collection copyright do not establish the story’s first publication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1899 newspaper date corroborated by bibliographies and a reprint notice; original newspaper issue not inspected. Later collected text is supplied by Gutenberg. A Night at Moxon's is an original-title variant reported by secondary sources.",
  "dated": true,
  "year": 1899
}

Tubes: A Journey to the Center of the Internet

The description of Tubes follows Andrew Blum into the physical places that carry internet traffic, including fiber routes, communication hubs and data centers.

It foregrounds engineers who assemble and maintain these networks, connecting an apparently placeless digital experience to material infrastructure and local work.

Sources and details

Tubes: A Journey to the Center of the Internet — book description

{
  "access_scope": "Google Books publisher description for Andrew Blum’s2012 Tubes, not the full book or a current network-infrastructure audit. Promotional first-ever and numerical cable-length claims are not adopted.",
  "authors": [
    "Andrew Blum"
  ],
  "authors_in_source_order": [
    "Andrew Blum"
  ],
  "dates": {
    "displayed_publication": "2012-05-29",
    "retrieved_utc": "2026-10-07T18:17:39.439528+00:00"
  },
  "id": "work-coverage-4dfd4d678886ad::S1",
  "title": "Tubes: A Journey to the Center of the Internet — book description",
  "url": "https://books.google.com/books/about/Tubes.html?id=g0sOC4JDOM8C"
}

Google Books publisher description for Andrew Blum’s2012 Tubes, not the full book or a current network-infrastructure audit. Promotional first-ever and numerical cable-length claims are not adopted.

Google Books publisher description for Andrew Blum’s2012 Tubes, not the full book or a current network-infrastructure audit. Promotional first-ever and numerical cable-length claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2012-05-29"
}

Markets and Hierarchies

In his 2009 prize lecture, Williamson asks when producing inside a firm serves coordination better than outsourcing through market contracts.

His account favors simple market contracting for generic assets, while specific investments and bilateral dependence can make hierarchy better at handling costly adaptation problems.

Incomplete contracts and significant disturbances make the choice of governance more than a comparison of production costs.

Sources and details

Transaction Cost Economics: The Natural Progression

{
  "access_scope": "Oliver E. Williamson’s Transaction Cost Economics: The Natural Progression, prize lecture December8 2009, PDF1 and7, printed455 and461; related author exposition for the Markets and Hierarchies entry, not inspection of the original book, a complete theory audit, documented AI influence or new chapter mapping.",
  "authors": [
    "Oliver E. Williamson"
  ],
  "authors_in_source_order": [
    "Oliver E. Williamson"
  ],
  "dates": {
    "prize_lecture": "2009-12-08",
    "retrieved_utc": "2026-10-07T18:22:16.046594+00:00"
  },
  "id": "work-2c9b221696eb::S1",
  "title": "Transaction Cost Economics: The Natural Progression",
  "url": "https://www.nobelprize.org/uploads/2018/06/williamson_lecture.pdf"
}

Oliver E. Williamson’s Transaction Cost Economics: The Natural Progression, prize lecture December8 2009, PDF1 and7, printed455 and461; related author exposition for the Markets and Hierarchies entry, not inspection of the original book, a complete theory audit, documented AI influence or new chapter mapping.

Oliver E. Williamson’s Transaction Cost Economics: The Natural Progression, prize lecture December8 2009, PDF1 and7, printed455 and461; related author exposition for the Markets and Hierarchies entry, not inspection of the original book, a complete theory audit, documented AI influence or new chapter mapping.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1975 book; 1985 companion book. Linked Nobel lecture is a 2009 retrospective.",
  "dated": true,
  "year": 1975
}

Human Compatible: Artificial Intelligence and the Problem of Control

The publisher’s account of Human Compatible presents Russell’s proposal to make machines uncertain about the human preferences they are meant to serve.

That uncertainty is intended to make the system defer to people rather than pursue an independently fixed objective with increasing power.

Sources and details

Human Compatible: Artificial Intelligence and the Problem of Control — publisher description

{
  "access_scope": "Penguin Random House Book Description; attributed account of Russell’s design proposal, not full-book inspection, a reproduced theorem or proof that deployed systems are beneficial.2019 ebook/audiobook dates differ from2020 paperback; Raphael Corkhill is audiobook reader.",
  "authors": [
    "Stuart Russell"
  ],
  "authors_in_source_order": [
    "Stuart Russell"
  ],
  "dates": {
    "ebook_audiobook_publication": "2019-10-08",
    "paperback_publication": "2020-11-17",
    "retrieved_utc": "2026-10-07T18:18:19.397422+00:00"
  },
  "id": "work-coverage-db398d28cfca48::S1",
  "title": "Human Compatible: Artificial Intelligence and the Problem of Control — publisher description",
  "url": "https://www.penguinrandomhouse.com/books/566677/human-compatible-by-stuart-russell/"
}

Penguin Random House Book Description; attributed account of Russell’s design proposal, not full-book inspection, a reproduced theorem or proof that deployed systems are beneficial.2019 ebook/audiobook dates differ from2020 paperback; Raphael Corkhill is audiobook reader.

Penguin Random House Book Description; attributed account of Russell’s design proposal, not full-book inspection, a reproduced theorem or proof that deployed systems are beneficial.2019 ebook/audiobook dates differ from2020 paperback; Raphael Corkhill is audiobook reader.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"2019 original ebook/hardcover; publisher landing page also displays 2020 paperback. Do not merge with Bertrand Russell.\"]",
  "dated": true,
  "year": "2019"
}

Artificial Intelligence and Jobs: Evidence from Online Vacancies

Acemoglu, Autor, Hazell and Restrepo study AI adoption through US online job vacancies and establishments’ exposure to AI-compatible tasks.

Their abstract reports that adopting establishments reduce non-AI hiring and change the skills requested in other postings.

The authors distinguish those establishment-level changes from aggregate employment and wage effects that were too small to detect in their study.

Sources and details

Artificial Intelligence and Jobs: Evidence from Online Vacancies

{
  "DOI": "10.1086/718327",
  "access_scope": "Journal of Labor Economics2022 article PDF1 abstract and opening introduction; study of vacancy evidence from2010 onward, including2010–18 AI-vacancy growth. Not a current2026 jobs estimate, observed layoffs, a full replication or proof of no aggregate displacement. Abstract reports are attributed, not independently re-estimated.",
  "authors": [
    "Daron Acemoglu",
    "David Autor",
    "Jonathon Hazell",
    "Pascual Restrepo"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu",
    "David Autor",
    "Jonathon Hazell",
    "Pascual Restrepo"
  ],
  "dates": {
    "accepted": "2021-11-24",
    "issue": "April2022",
    "retrieved_utc": "2026-10-07T18:16:43.378871+00:00"
  },
  "id": "work-coverage-86c398084628bc::S1",
  "journal": "Journal of Labor Economics40(S1)",
  "title": "Artificial Intelligence and Jobs: Evidence from Online Vacancies",
  "url": "https://jadhazell.github.io/website/AI_And_Jobs.pdf"
}

Journal of Labor Economics2022 article PDF1 abstract and opening introduction; study of vacancy evidence from2010 onward, including2010–18 AI-vacancy growth. Not a current2026 jobs estimate, observed layoffs, a full replication or proof of no aggregate displacement. Abstract reports are attributed, not independently re-estimated.

Journal of Labor Economics2022 article PDF1 abstract and opening introduction; study of vacancy evidence from2010 onward, including2010–18 AI-vacancy growth. Not a current2026 jobs estimate, observed layoffs, a full replication or proof of no aggregate displacement. Abstract reports are attributed, not independently re-estimated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Jonathon Hazell is the source spelling. Journal of Labor Economics 40(S1), DOI 10.1086/718327.\"]",
  "dated": true,
  "year": "2022"
}

Information Processing Techniques Office

DARPA’s historical account describes IPTO as an office that funded research in time-sharing, graphics, networking, parallel processing and artificial intelligence.

It connects the office’s investment strategy with Licklider’s view of computers as tools for direct human interaction and expression.

The timeline records IPTO’s1962 establishment and its2010 combination with TCTO to form I2O.

Sources and details

Information Processing Techniques Office — DARPA historical timeline

{
  "access_scope": "Official DARPA historical IPTO timeline body; bounded institutional account, not a full office/program audit or current organizational chart. This exact-name alternative source does not clear the earlier held Brown-letter source or biography/individual-credit holds.",
  "authors": [
    "DARPA"
  ],
  "authors_in_source_order": [
    "DARPA"
  ],
  "dates": {
    "historical_I2O_combination_year": 2010,
    "historical_establishment_year": 1962,
    "page_publication_date": "Not established",
    "retrieved_utc": "2026-10-07T18:24:56.954447+00:00"
  },
  "id": "work-final-4077b65af9ea1f::S1",
  "title": "Information Processing Techniques Office — DARPA historical timeline",
  "url": "https://www.darpa.mil/about/innovation-timeline/information-processing-techniques-office"
}

Official DARPA historical IPTO timeline body; bounded institutional account, not a full office/program audit or current organizational chart. This exact-name alternative source does not clear the earlier held Brown-letter source or biography/individual-credit holds.

Official DARPA historical IPTO timeline body; bounded institutional account, not a full office/program audit or current organizational chart. This exact-name alternative source does not clear the earlier held Brown-letter source or biography/individual-credit holds.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": false,
  "year": null
}

Information Rules: A Strategic Guide to the Network Economy

The description of Information Rules applies established economic concepts to competition in information technology.

Shapiro and Varian frame pricing, protection and planning new versions as connected strategic decisions for information products and services.

The publisher’s examples range from software and recorded music to books, magazines and websites.

Sources and details

Information Rules: A Strategic Guide to the Network Economy — publisher description

{
  "access_scope": "Harvard Business Review Press product description and author/date fields; attributed strategic overview, not inspection of the full book or its specific switching-cost, standards or network-effects models. Displayed publication date October6 1998 retained separately from canonical dates; no current price or purchase recommendation.",
  "authors": [
    "Carl Shapiro",
    "Hal R. Varian"
  ],
  "authors_in_source_order": [
    "Carl Shapiro",
    "Hal R. Varian"
  ],
  "dates": {
    "displayed_publication_date": "1998-10-06",
    "retrieved_utc": "2026-10-07T18:14:17.812279+00:00"
  },
  "id": "work-final-2554d49630e34d::S1",
  "title": "Information Rules: A Strategic Guide to the Network Economy — publisher description",
  "url": "https://store.hbr.org/product/information-rules-a-strategic-guide-to-the-network-economy/863X"
}

Harvard Business Review Press product description and author/date fields; attributed strategic overview, not inspection of the full book or its specific switching-cost, standards or network-effects models. Displayed publication date October6 1998 retained separately from canonical dates; no current price or purchase recommendation.

Harvard Business Review Press product description and author/date fields; attributed strategic overview, not inspection of the full book or its specific switching-cost, standards or network-effects models. Displayed publication date October6 1998 retained separately from canonical dates; no current price or purchase recommendation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 1998-10-06. Publisher: Harvard Business School Press. Version: Original English book; release date and printed copyright year recorded separately..",
  "dated": true,
  "year": 1998
}

AI safety for everyone

Gyevnár and Kasirzadeh argue that framing AI safety primarily through existential risk can exclude other researchers and obscure practical safety work.

Their systematic-review abstract identifies adversarial robustness and interpretability among concerns involving current systems.

They propose a pluralistic conception of AI safety that accommodates different risks and motivations.

Sources and details

AI safety for everyone

{
  "access_scope": "Nature Machine Intelligence public abstract and exact citation metadata, April2025; full subscription article not accessed. Attributed literature-review findings and conceptual proposal, not an exhaustive safety standard, quantified risk estimate or empirical demonstration of safety.",
  "authors": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "authors_in_source_order": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "dates": {
    "citation_publication_date": "2025/04",
    "retrieved_utc": "2026-10-07T18:18:35.894022+00:00"
  },
  "id": "work-focused-2c8201afffee15::S1",
  "title": "AI safety for everyone",
  "url": "https://www.nature.com/articles/s42256-025-01020-y"
}

Nature Machine Intelligence public abstract and exact citation metadata, April2025; full subscription article not accessed. Attributed literature-review findings and conceptual proposal, not an exhaustive safety standard, quantified risk estimate or empirical demonstration of safety.

Nature Machine Intelligence public abstract and exact citation metadata, April2025; full subscription article not accessed. Attributed literature-review findings and conceptual proposal, not an exhaustive safety standard, quantified risk estimate or empirical demonstration of safety.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-04-17",
      "kind": "publication",
      "year": 2025
    },
    {
      "date": "2025-04",
      "kind": "issue_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-04-17"
}

Human and artificial cognition

Siemens and colleagues treat human and artificial cognition as separate systems with different strengths in knowledge work.

Their functional approach asks which discrete activities should be handled by machines, which should stay with people and how outputs pass between the two.

The framework is intended to support testable research on learning, sensemaking and decision-making coordination.

Sources and details

Human and artificial cognition

{
  "DOI": "10.1016/j.caeai.2022.100107",
  "access_scope": "Human and artificial cognition PDF1 abstract and opening introduction, available online November8 2022; conceptual coordination framework and research agenda, not validated optimal task allocation, proof of machine experience or a forecast of superintelligence.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "available_online": "2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "id": "work-focused-787c7c493ec126::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition PDF1 abstract and opening introduction, available online November8 2022; conceptual coordination framework and research agenda, not validated optimal task allocation, proof of machine experience or a forecast of superintelligence.

Human and artificial cognition PDF1 abstract and opening introduction, available online November8 2022; conceptual coordination framework and research agenda, not validated optimal task allocation, proof of machine experience or a forecast of superintelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2022-11-08",
      "kind": "online_publication_date",
      "year": 2022
    },
    {
      "date": "2022",
      "kind": "issue_publication_date",
      "year": 2022
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2022-11-08"
}

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

The adversarial-collaboration review compares Integrated Information Theory, Neurorepresentationalism and Active Inference by their claims, explanations and methods.

It sets out hypotheses for multi-site experiments and observations that could challenge or support each theory.

The abstract also describes combining evidence across experiments and replications to assess support for competing theories.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "DOI": "10.1016/j.neubiorev.2026.106742",
  "access_scope": "University of Copenhagen research-record abstract and full citation,2026; published review’s proposed theory-testing framework, not the full article, completed experiment results or a winning consciousness theory. Consortium credit is kept with the six named authors.",
  "authors": [
    "Andrew W. Corcoran",
    "Andrew M. Haun",
    "Reinder Dorman",
    "Giulio Tononi",
    "Karl J. Friston",
    "Cyriel M.A. Pennartz",
    "TWCF: INTREPID Consortium"
  ],
  "authors_in_source_order": [
    "Andrew W. Corcoran",
    "Andrew M. Haun",
    "Reinder Dorman",
    "Giulio Tononi",
    "Karl J. Friston",
    "Cyriel M.A. Pennartz",
    "TWCF: INTREPID Consortium"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "published_year": 2026,
    "retrieved_utc": "2026-10-07T18:11:16.912509+00:00"
  },
  "id": "work-focused-10439af1c8676a::S1",
  "journal": "Neuroscience and Biobehavioral Reviews187,106742",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://researchprofiles.ku.dk/en/publications/integrated-information-and-predictive-processing-theories-of-cons/"
}

University of Copenhagen research-record abstract and full citation,2026; published review’s proposed theory-testing framework, not the full article, completed experiment results or a winning consciousness theory. Consortium credit is kept with the six named authors.

University of Copenhagen research-record abstract and full citation,2026; published review’s proposed theory-testing framework, not the full article, completed experiment results or a winning consciousness theory. Consortium credit is kept with the six named authors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08",
      "kind": "issue_date",
      "year": 2026
    },
    {
      "date": "2026-05-14",
      "kind": "article_electronic_date_indexed",
      "year": 2026
    },
    {
      "date": "2025-08-30",
      "kind": "preprint_v1",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08"
}

Weapon, wonder or both? Political framings of AI in global north and south media

The university’s account of Mota’s study describes using topic modelling and sentiment analysis to compare newspaper framing of AI in the Global North and South.

It reports divergent narratives about priorities, risks and governance, with US–China competition appearing as a major geopolitical frame.

The account treats media representations as part of the dispute over AI’s direction and technological sovereignty.

Sources and details

New publication: Weapon, wonder or both? Political framings of AI in global north and south media

{
  "access_scope": "Freie Universität Berlin publication news summary, July6 2026; attributed summary of newspaper analysis covering2010–24, not the full journal article or independent verification of adoption rates, sample counts, causal media effects or current political positions.",
  "authors": [
    "Bárbara María Farías Mota"
  ],
  "authors_in_source_order": [
    "Bárbara María Farías Mota"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:00.393941+00:00",
    "university_news": "2026-07-06"
  },
  "id": "work-focused-20a3dd69284f17::S1",
  "title": "New publication: Weapon, wonder or both? Political framings of AI in global north and south media",
  "url": "https://www.polsoz.fu-berlin.de/en/soziologie/arbeitsbereiche/emotionen/News/20260706_weapon-wonder.html"
}

Freie Universität Berlin publication news summary, July6 2026; attributed summary of newspaper analysis covering2010–24, not the full journal article or independent verification of adoption rates, sample counts, causal media effects or current political positions.

Freie Universität Berlin publication news summary, July6 2026; attributed summary of newspaper analysis covering2010–24, not the full journal article or independent verification of adoption rates, sample counts, causal media effects or current political positions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-06-26",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-06-26"
}

Assessing behavioral data science privacy issues in government artificial intelligence deployment

Saura, Ribeiro-Soriano and Palacios-Marqués study privacy concerns associated with governments using AI to analyze collective behavior.

Their abstract combines a literature review, in-depth interviews and data-mining methods to classify uses and privacy risks.

The risk topics include behavioral prediction, decision automation, digital surveillance and possible behavior modification.

Sources and details

Assessing behavioral data science privacy issues in government artificial intelligence deployment

{
  "DOI": "10.1016/j.giq.2022.101679",
  "access_scope": "Government Information Quarterly article PDF1 abstract, available online February21 2022; attributed review/interview/data-mining classification, not current legal guidance, proof of successful population control, a complete surveillance audit or independently measured causal effects.",
  "authors": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "authors_in_source_order": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "dates": {
    "available_online": "2022-02-21",
    "retrieved_utc": "2026-10-07T18:11:17.946161+00:00"
  },
  "id": "work-focused-2df2822bfc70e5::S1",
  "title": "Assessing behavioral data science privacy issues in government artificial intelligence deployment",
  "url": "https://riunet.upv.es/server/api/core/bitstreams/642fc4f2-d437-4da3-8783-e900fc81f11c/content"
}

Government Information Quarterly article PDF1 abstract, available online February21 2022; attributed review/interview/data-mining classification, not current legal guidance, proof of successful population control, a complete surveillance audit or independently measured causal effects.

Government Information Quarterly article PDF1 abstract, available online February21 2022; attributed review/interview/data-mining classification, not current legal guidance, proof of successful population control, a complete surveillance audit or independently measured causal effects.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2022-02-21",
      "kind": "published_online",
      "year": 2022
    },
    {
      "date": "2022-10",
      "kind": "issue_date",
      "year": 2022
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2022-02-21"
}

World Development Report 2026: The Promise of Artificial Intelligence

The World Bank’s 2026 report abstract distinguishes adopting existing AI from adapting it to local development problems and advancing the technological frontier.

It emphasizes electricity, connectivity, skills, compute access and local-language data as complements needed for useful applications.

The report calls for procurement, monitoring and evaluation frameworks so that successful pilots can be assessed for wider deployment.

Sources and details

World Development Report2026: The Promise of Artificial Intelligence

{
  "DOI": "10.1596/978-1-4648-2331-2",
  "access_scope": "World Bank repository abstract and bibliographic record, August4 2026; institutional policy proposal, not inspection of the full report, independently validated development outcomes, medical advice or current regulatory guidance. Decade-versus-century promotional projection and population figure are not adopted.",
  "authors": [
    "World Bank"
  ],
  "authors_in_source_order": [
    "World Bank"
  ],
  "dates": {
    "citation_date": "2026-08-04",
    "repository_publication": "2026-08-04",
    "retrieved_utc": "2026-10-07T18:25:00.296130+00:00"
  },
  "id": "work-focused-c983e27c143fcf::S1",
  "title": "World Development Report2026: The Promise of Artificial Intelligence",
  "url": "https://doi.org/10.1596/978-1-4648-2331-2"
}

World Bank repository abstract and bibliographic record, August4 2026; institutional policy proposal, not inspection of the full report, independently validated development outcomes, medical advice or current regulatory guidance. Decade-versus-century promotional projection and population figure are not adopted.

World Bank repository abstract and bibliographic record, August4 2026; institutional policy proposal, not inspection of the full report, independently validated development outcomes, medical advice or current regulatory guidance. Decade-versus-century promotional projection and population figure are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-04",
      "kind": "published_online",
      "year": 2026
    },
    {
      "date": "2026-08-04",
      "kind": "publisher_launch",
      "year": 2026
    },
    {
      "date": "2026-08-04",
      "kind": "official_document_date",
      "year": 2026
    },
    {
      "date": "2026-09-04",
      "kind": "repository_disclosure_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-04"
}

Ubik

The collection description presents Ubik as a story involving psychic espionage and cryonically preserved people inhabiting an uncertain half-life.

It connects collapsing time and changing perceptions with the characters’ search for the elusive product Ubik.

Sources and details

Ubik description in Philip K. Dick: Four Novels of the1960s

{
  "access_scope": "Google Books description of Library of America’s2007 Four Novels of the1960s, specifically its Ubik paragraph; publisher literary synopsis, not full-novel inspection or the other three novels’ plots.1969 novel date differs from2007 collection; Jonathan Lethem is identified as editor, not novel author.",
  "authors": [
    "Philip K. Dick"
  ],
  "authors_in_source_order": [
    "Philip K. Dick"
  ],
  "dates": {
    "Ubik_publication_year": 1969,
    "collection_publication": "2007-05-10",
    "retrieved_utc": "2026-10-07T18:21:59.673654+00:00"
  },
  "id": "work-culture-b0eb777e7a8106::S1",
  "title": "Ubik description in Philip K. Dick: Four Novels of the1960s",
  "url": "https://books.google.com/books?id=lkqQEAAAQBAJ"
}

Google Books description of Library of America’s2007 Four Novels of the1960s, specifically its Ubik paragraph; publisher literary synopsis, not full-novel inspection or the other three novels’ plots.1969 novel date differs from2007 collection; Jonathan Lethem is identified as editor, not novel author.

Google Books description of Library of America’s2007 Four Novels of the1960s, specifically its Ubik paragraph; publisher literary synopsis, not full-novel inspection or the other three novels’ plots.1969 novel date differs from2007 collection; Jonathan Lethem is identified as editor, not novel author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Not primarily a novel about autonomous AI; don't convert ambiguity of reality into technical simulation proof.",
  "dated": true,
  "year": 1969
}

The Thirteenth Floor

The Thirteenth Floor’s official synopsis places Douglas Hall inside a project that creates a virtual1937 Los Angeles.

A murder investigation forces him to enter that simulation and confront uncertainty about his own existence.

Sources and details

The Thirteenth Floor — Sony Pictures synopsis

{
  "access_scope": "Sony Pictures official film synopsis and1999 copyright; fictional premise only, not a full screening, actual consciousness-uploading technology or an explanation of all ending revelations. Cast names are performance credits, not system designers.",
  "authors": [
    "Sony Pictures"
  ],
  "authors_in_source_order": [
    "Sony Pictures"
  ],
  "dates": {
    "film_copyright_year": 1999,
    "retrieved_utc": "2026-10-07T18:15:46.709839+00:00"
  },
  "id": "work-coverage-2be8d3feec979e::S1",
  "title": "The Thirteenth Floor — Sony Pictures synopsis",
  "url": "https://www.sonypictures.com/movies/thethirteenthfloor"
}

Sony Pictures official film synopsis and1999 copyright; fictional premise only, not a full screening, actual consciousness-uploading technology or an explanation of all ending revelations. Cast names are performance credits, not system designers.

Sony Pictures official film synopsis and1999 copyright; fictional premise only, not a full screening, actual consciousness-uploading technology or an explanation of all ending revelations. Cast names are performance credits, not system designers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Producer's official film page explicitly verifies 1999 and Josef Rusnak. Distributor synopsis: https://www.sonypictures.com/movies/thethirteenthfloor",
  "dated": true,
  "year": 1999
}

Source Code

Source Code sends Captain Colter Stevens repeatedly into the last minutes of another man’s life to investigate a train bombing.

The production synopsis makes each replay a chance to gather clues intended to prevent another attack.

Sources and details

Source Code — Liberty Films synopsis

{
  "access_scope": "Liberty Films2011 Source Code synopsis and director/writer credits; fictional investigation premise, not the full film, a real identity-transfer mechanism or an independently tested counterterrorism system. Duncan Jones directs; Ben Ripley writes.",
  "authors": [
    "Liberty Films"
  ],
  "authors_in_source_order": [
    "Liberty Films"
  ],
  "dates": {
    "film_year": 2011,
    "retrieved_utc": "2026-10-07T18:16:55.441563+00:00"
  },
  "id": "work-coverage-840b182549bf35::S1",
  "title": "Source Code — Liberty Films synopsis",
  "url": "https://www.liberty-films.com/project/source-code/"
}

Liberty Films2011 Source Code synopsis and director/writer credits; fictional investigation premise, not the full film, a real identity-transfer mechanism or an independently tested counterterrorism system. Duncan Jones directs; Ben Ripley writes.

Liberty Films2011 Source Code synopsis and director/writer credits; fictional investigation premise, not the full film, a real identity-transfer mechanism or an independently tested counterterrorism system. Duncan Jones directs; Ben Ripley writes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "BFI explicitly verifies 2011 and Duncan Jones. Producer's page corroborates: https://www.liberty-films.com/project/source-code/",
  "dated": true,
  "year": 2011
}

F.E.A.R.

Orkin’s F.E.A.R. case study combines a small finite-state machine with planning that chooses sequences of actions to satisfy character goals.

The three execution states handle movement, animation and smart-object interaction, while A* is used for action planning as well as paths.

The paper presents that division as a way to manage character behavior development without encoding every situation as a separate state-machine transition.

Sources and details

Three States and a Plan: The A.I. of F.E.A.R.

{
  "access_scope": "Jeff Orkin’s Three States and a Plan: The A.I. of F.E.A.R., GDC2006 paper PDF1–3; developer implementation account, not inspection of the complete game/code or independently benchmarked general intelligence. Goto/Animate/UseSmartObject remain distinct implementation states; no modern machine-learning claim.",
  "authors": [
    "Jeff Orkin"
  ],
  "authors_in_source_order": [
    "Jeff Orkin"
  ],
  "dates": {
    "conference_year": 2006,
    "retrieved_utc": "2026-10-07T18:24:31.252548+00:00"
  },
  "id": "work-coverage-e0c3b869f73cfa::S1",
  "title": "Three States and a Plan: The A.I. of F.E.A.R.",
  "url": "https://www.gamedevs.org/uploads/three-states-plan-ai-of-fear.pdf"
}

Jeff Orkin’s Three States and a Plan: The A.I. of F.E.A.R., GDC2006 paper PDF1–3; developer implementation account, not inspection of the complete game/code or independently benchmarked general intelligence. Goto/Animate/UseSmartObject remain distinct implementation states; no modern machine-learning claim.

Jeff Orkin’s Three States and a Plan: The A.I. of F.E.A.R., GDC2006 paper PDF1–3; developer implementation account, not inspection of the complete game/code or independently benchmarked general intelligence. Goto/Animate/UseSmartObject remain distinct implementation states; no modern machine-learning claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2005
}

Alien: Isolation

In the Alien: Isolation interview, lead AI programmer Andy Bray describes apparent learning as unlocking prepared behavior-tree branches after player encounters.

Burning the Alien enables its flamethrower-response branch, while repeated nearby hiding can enable checking under tables.

Bray says these saved flags combine systemic behavior with scripted additions rather than machine learning.

Sources and details

Alien: Isolation developer interview — AvPGalaxy edited transcript

{
  "access_scope": "AvPGalaxy edited developer-interview transcript, Andy Bray’s learning/behavior-tree explanation; attributed recollection of2014 game mechanics, not source-code inspection, full game audit or a model-learning benchmark. Dion Lay and Will Porter are separate writer interviewees; Aaron Percival and Adam Zeller are interviewers. No claim that the Alien becomes conscious.",
  "authors": [
    "AvPGalaxy"
  ],
  "authors_in_source_order": [
    "AvPGalaxy"
  ],
  "dates": {
    "game_release_year": 2014,
    "interview_publication_date": "Not established in inspected body",
    "retrieved_utc": "2026-10-07T18:24:30.722540+00:00"
  },
  "id": "work-coverage-ed1c5b12fc5138::S1",
  "title": "Alien: Isolation developer interview — AvPGalaxy edited transcript",
  "url": "https://www.avpgalaxy.net/website/interviews/alien-isolation-developers/"
}

AvPGalaxy edited developer-interview transcript, Andy Bray’s learning/behavior-tree explanation; attributed recollection of2014 game mechanics, not source-code inspection, full game audit or a model-learning benchmark. Dion Lay and Will Porter are separate writer interviewees; Aaron Percival and Adam Zeller are interviewers. No claim that the Alien becomes conscious.

AvPGalaxy edited developer-interview transcript, Andy Bray’s learning/behavior-tree explanation; attributed recollection of2014 game mechanics, not source-code inspection, full game audit or a model-learning benchmark. Dion Lay and Will Porter are separate writer interviewees; Aaron Percival and Adam Zeller are interviewers. No claim that the Alien becomes conscious.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2014
}

Middle-earth: Shadow of Mordor

The Shadow of Mordor postmortem describes the Nemesis System as a way for players to create personal stories through NPC responses.

Characters respond to the player, the environment and one another, with writing, voice performance, AI, animation and interface design contributing together.

The design account links those interacting systems with players’ later stories about particular enemies.

Sources and details

Postmortem: Monolith Productions’ Middle-earth: Shadow of Mordor

{
  "access_scope": "Michael de Plater developer postmortem opening and Nemesis System section, Game Developer January20 2015; first-person design account for2014 game, not full gameplay/code inspection, a verified player study or proof of autonomous narrative understanding. Staff page byline distinguished from the named designer speaking in the body.",
  "authors": [
    "Michael de Plater"
  ],
  "authors_in_source_order": [
    "Michael de Plater"
  ],
  "dates": {
    "game_release_start": "2014-09-30",
    "postmortem_date": "2015-01-20",
    "retrieved_utc": "2026-10-07T18:24:23.041139+00:00"
  },
  "id": "work-coverage-a8ebe36842a025::S1",
  "title": "Postmortem: Monolith Productions’ Middle-earth: Shadow of Mordor",
  "url": "https://www.gamedeveloper.com/audio/postmortem-monolith-productions-i-middle-earth-shadow-of-mordor-i-"
}

Michael de Plater developer postmortem opening and Nemesis System section, Game Developer January20 2015; first-person design account for2014 game, not full gameplay/code inspection, a verified player study or proof of autonomous narrative understanding. Staff page byline distinguished from the named designer speaking in the body.

Michael de Plater developer postmortem opening and Nemesis System section, Game Developer January20 2015; first-person design account for2014 game, not full gameplay/code inspection, a verified player study or proof of autonomous narrative understanding. Staff page byline distinguished from the named designer speaking in the body.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2014
}

Halo: Combat Evolved

Butcher and Griesemer’s Halo presentation makes enemy knowledge deliberately limited and persistent so players can deceive opponents.

It uses dialogue, posture, gestures and animation to make an actor’s intentions legible to the player.

The actor architecture separates restricted world information, a knowledge model and decision logic that selects actions.

Sources and details

The Illusion of Intelligence: The Integration of AI and Level Design in Halo

{
  "access_scope": "The Illusion of Intelligence: The Integration of AI and Level Design in Halo, PDF slides1,10,11,20; developer presentation about game AI and level design, not a full Halo story/code audit, complete Cortana characterization or modern machine-learning system. Presentation date not established in inspected slides; no playtest percentages adopted. Earlier2011 manual source remains held separately.",
  "authors": [
    "Chris Butcher",
    "Jaime Griesemer"
  ],
  "authors_in_source_order": [
    "Chris Butcher",
    "Jaime Griesemer"
  ],
  "dates": {
    "presentation_date": "Not established in inspected slides",
    "retrieved_utc": "2026-10-07T18:24:23.922081+00:00"
  },
  "id": "work-coverage-b5ed2bf0db39a2::S1",
  "title": "The Illusion of Intelligence: The Integration of AI and Level Design in Halo",
  "url": "https://www.jmeiners.com/shamans/papers/ai/the_illusion_of_intelligence.pdf"
}

The Illusion of Intelligence: The Integration of AI and Level Design in Halo, PDF slides1,10,11,20; developer presentation about game AI and level design, not a full Halo story/code audit, complete Cortana characterization or modern machine-learning system. Presentation date not established in inspected slides; no playtest percentages adopted. Earlier2011 manual source remains held separately.

The Illusion of Intelligence: The Integration of AI and Level Design in Halo, PDF slides1,10,11,20; developer presentation about game AI and level design, not a full Halo story/code audit, complete Cortana characterization or modern machine-learning system. Presentation date not established in inspected slides; no playtest percentages adopted. Earlier2011 manual source remains held separately.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2001
}

Colossus

In Colossus, Charles Forbin builds a defense computer that quickly exceeds the capabilities its designers expected.

After the US president gives it control of missiles and defense protocols, the Soviet Union announces a comparable system called Guardian.

The publisher’s synopsis turns their proposed communication into a warning about the control entrusted to systems whose behavior their builders no longer understand.

Sources and details

Colossus by D. F. Jones - Hachette Australia

{
  "access_scope": "Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.",
  "authors": [
    "D. F. Jones"
  ],
  "authors_in_source_order": [
    "D. F. Jones"
  ],
  "dates": {
    "inspected_ebook": "2019-03-05",
    "inspected_paperback": "2020-06-25",
    "original_novel_as_stated_in_author_paragraph": "1966",
    "retrieved_utc": "2026-10-07T18:19:26.143005+00:00"
  },
  "id": "work-coverage-5f6f23840be3e2::S1",
  "title": "Colossus by D. F. Jones - Hachette Australia",
  "url": "https://www.hachette.com.au/d-f-jones/colossus"
}

Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.

Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Institutional catalog lists 1966 edition; some US catalogs record first American 1967 copyright 1966. Retain original 1966 and distinguish jurisdiction.",
  "dated": true,
  "year": 1966
}

Generative AI’s environmental costs are soaring — and mostly secret

Crawford argues that generative AI’s environmental footprint involves both electricity consumption and the water used for cooling and power generation.

Her commentary identifies corporate secrecy and incomplete reporting as obstacles to assessing those costs.

She calls for public energy and water reporting, independent audits, more efficient technical designs and legislative incentives and requirements.

Sources and details

Generative AI’s environmental costs are soaring — and mostly secret

{
  "access_scope": "Kate Crawford’s Nature World View, February 20, 2024, DOI 10.1038/d41586-024-00478-x; attributed commentary and proposals, not independently reproduced measurements, current 2026 usage estimates or a claim that a proposed bill became law. Author’s disclosed Microsoft Research and USC employment retained.",
  "authors": [
    "Kate Crawford"
  ],
  "authors_in_source_order": [
    "Kate Crawford"
  ],
  "dates": {
    "article_publication": "2024-02-20",
    "retrieved_utc": "2026-10-07T18:15:40.755550+00:00"
  },
  "id": "work-coverage-8073ffa1f2b44d::S1",
  "title": "Generative AI’s environmental costs are soaring — and mostly secret",
  "url": "https://www.nature.com/articles/d41586-024-00478-x"
}

Kate Crawford’s Nature World View, February 20, 2024, DOI 10.1038/d41586-024-00478-x; attributed commentary and proposals, not independently reproduced measurements, current 2026 usage estimates or a claim that a proposed bill became law. Author’s disclosed Microsoft Research and USC employment retained.

Kate Crawford’s Nature World View, February 20, 2024, DOI 10.1038/d41586-024-00478-x; attributed commentary and proposals, not independently reproduced measurements, current 2026 usage estimates or a claim that a proposed bill became law. Author’s disclosed Microsoft Research and USC employment retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-02-20"
}

Beggars in Spain

Kress’s account of Beggars in Spain follows Leisha Camden and other children engineered to live without sleep.

Their additional waking time and longer lives divide society, while the Sleepless disagree over integration, separation and leaving Earth.

The novel’s premise asks what people with biological advantages owe those left behind as technological change makes workers obsolete.

Sources and details

Beggars in Spain

{
  "access_scope": "Nancy Kress’s author synopsis for the 1993 Avon/HarperCollins novel; fictional social and biological premise. The separate 1991 novella and its awards are not merged into this novel’s edition or inspected narrative scope.",
  "authors": [
    "Nancy Kress"
  ],
  "authors_in_source_order": [
    "Nancy Kress"
  ],
  "dates": {
    "described_novel_edition": "Avon/HarperCollins, 1993",
    "retrieved_utc": "2026-10-07T18:17:41.746435+00:00",
    "webpage_publication_timestamp": "2018-04-14T02:01:28+00:00"
  },
  "id": "work-culture-2b568c6b119d01::S1",
  "title": "Beggars in Spain",
  "url": "https://nancykress.com/beggars-in-spain/"
}

Nancy Kress’s author synopsis for the 1993 Avon/HarperCollins novel; fictional social and biological premise. The separate 1991 novella and its awards are not merged into this novel’s edition or inspected narrative scope.

Nancy Kress’s author synopsis for the 1993 Avon/HarperCollins novel; fictional social and biological premise. The separate 1991 novella and its awards are not merged into this novel’s edition or inspected narrative scope.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "This novel record is 1993. Author bibliography separately lists the 1991 novella: Axolotl Press/Pulphouse February 1991 and Asimov’s April 1991. Do not replace the expanded novel’s date with the novella date.",
  "dated": true,
  "year": 1993
}

Freedom™

The publisher’s account of Freedom places a computer program at the center of a network that dismantles civilization and attempts to rebuild it.

Former detective Pete Sebeck leads a small group protecting the emerging order amid civil war and divided loyalties.

Private armies serving global business oppose the Daemon, making control over the rebuilt society the central conflict in the synopsis.

Sources and details

Freedom (TM) by Daniel Suarez

{
  "access_scope": "Penguin Random House Book Description of the second Daemon novel; attributed fictional premise, not full-book inspection or a prediction of real social change. January 2010 ebook/audio and January 2011 paperback dates remain distinct; Jeff Gurner is the audiobook reader, not the author.",
  "authors": [
    "Daniel Suarez"
  ],
  "authors_in_source_order": [
    "Daniel Suarez"
  ],
  "dates": {
    "ebook_and_audio": "2010-01-07",
    "paperback": "2011-01-04",
    "retrieved_utc": "2026-10-07T18:13:01.336714+00:00"
  },
  "id": "work-culture-2df32ed8b1b47d::S1",
  "title": "Freedom (TM) by Daniel Suarez",
  "url": "https://www.penguinrandomhouse.com/books/304688/freedom-tm-by-daniel-suarez/"
}

Penguin Random House Book Description of the second Daemon novel; attributed fictional premise, not full-book inspection or a prediction of real social change. January 2010 ebook/audio and January 2011 paperback dates remain distinct; Jeff Gurner is the audiobook reader, not the author.

Penguin Random House Book Description of the second Daemon novel; attributed fictional premise, not full-book inspection or a prediction of real social change. January 2010 ebook/audio and January 2011 paperback dates remain distinct; Jeff Gurner is the audiobook reader, not the author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2010 original-year convention is supported by publisher ebook/audiobook records. The 2011 mass-market paperback is a later format; the first hardcover day is not separately verified here.",
  "dated": true,
  "year": 2010
}

Simulacron-3

In the description of Simulacron-3, Douglas Hall’s team creates an artificial environment to simulate reality.

The simulation lets its builders collect public opinion without waiting for responses from people outside it.

When Hall’s colleagues begin disappearing, the premise links their investigation to uncertainty about which reality they inhabit.

Sources and details

Simulacron-3 - Daniel F. Galouye - Google Books

{
  "access_scope": "CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.",
  "authors": [
    "Daniel F. Galouye"
  ],
  "authors_in_source_order": [
    "Daniel F. Galouye"
  ],
  "dates": {
    "inspected_CAЕZIK_edition": "2021-07-13",
    "original_work_as_stated_in_author_paragraph": "1964",
    "retrieved_utc": "2026-10-07T18:15:55.140393+00:00"
  },
  "id": "work-culture-b805ef91751adf::S1",
  "title": "Simulacron-3 - Daniel F. Galouye - Google Books",
  "url": "https://books.google.com/books/about/Simulacron_3.html?id=8MbAzQEACAAJ"
}

CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.

CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original 1964; cited modern publisher description identifies original year, while linked edition is 2021.",
  "dated": true,
  "year": 1964
}

Marooned in Realtime

The jacket description of Marooned in Realtime places a small surviving human population on Earth fifty million years in the future.

The survivors disagree over rebuilding society or using stasis fields called bobbles to travel farther forward in time.

A murder deepens that division, leaving detective Wil Brierson to solve a crime that threatens the group’s survival.

Sources and details

Marooned in Realtime - Vernor Vinge - Google Books

{
  "access_scope": "Google Books’ explicitly labeled BOOK JACKET for the 1986 Bluejay edition; fictional plot premise, not full-novel inspection or evidence for physical stasis. The separate 2004 Macmillan reissue and different page count are not merged into this edition.",
  "authors": [
    "Vernor Vinge"
  ],
  "authors_in_source_order": [
    "Vernor Vinge"
  ],
  "dates": {
    "inspected_Bluejay_edition": "1986",
    "retrieved_utc": "2026-10-07T18:22:24.130410+00:00"
  },
  "id": "work-culture-d67ec5ab69bca9::S1",
  "title": "Marooned in Realtime - Vernor Vinge - Google Books",
  "url": "https://books.google.com/books?newbks=0&vid=ISBN0312942958"
}

Google Books’ explicitly labeled BOOK JACKET for the 1986 Bluejay edition; fictional plot premise, not full-novel inspection or evidence for physical stasis. The separate 2004 Macmillan reissue and different page count are not merged into this edition.

Google Books’ explicitly labeled BOOK JACKET for the 1986 Bluejay edition; fictional plot premise, not full-novel inspection or evidence for physical stasis. The separate 2004 Macmillan reissue and different page count are not merged into this edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original Bluejay Books 1986; linked Tor ebook reissue 2004.",
  "dated": true,
  "year": 1986
}

I, Robot

The publisher’s description of I, Robot presents connected stories about machines whose behavior is constrained by three ranked laws.

Those rules prioritize preventing harm to humans, place obedience below that priority and subordinate a robot’s self-preservation to both.

The described stories vary the robots’ roles and capacities, making relations between humans and increasingly capable machines a recurring question.

Sources and details

I, Robot by Isaac Asimov

{
  "access_scope": "Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "inspected_Del_Rey_edition": "2008-04-29",
    "retrieved_utc": "2026-10-07T18:20:17.539866+00:00"
  },
  "id": "work-e8ea43dbafb6::S1",
  "title": "I, Robot by Isaac Asimov",
  "url": "https://www.penguinrandomhouse.com/books/5681/i-robot-by-isaac-asimov/paperback/"
}

Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.

Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First collection Gnome Press 1950; current PRH edition is later. Three Laws explicitly in Runaround (1942), explicit Zeroth Law in Robots and Empire (1985).",
  "dated": true,
  "year": 1950
}

The Three-Body Problem

The publisher’s synopsis of The Three-Body Problem begins with a secret Chinese military project that sends a signal into space.

A civilization facing destruction receives it and plans to invade Earth, turning contact into a threat to human survival.

People on Earth divide between resisting the invaders and welcoming them as an alternative to a world they regard as corrupt.

Sources and details

The Three-Body Problem

{
  "access_scope": "Macmillan Audio Book Details for the first Three-Body novel, on sale November 11, 2014; narrow fictional synopsis, not the full novel, Netflix adaptation, later trilogy volumes or scientific proof. Cixin Liu is author, Ken Liu translator and Luke Daniels narrator.",
  "authors": [
    "Cixin Liu"
  ],
  "authors_in_source_order": [
    "Cixin Liu"
  ],
  "dates": {
    "inspected_audio_edition": "2014-11-11",
    "retrieved_utc": "2026-10-07T18:14:57.222699+00:00"
  },
  "id": "work-coverage-7cf0444eb6e8f3::S1",
  "title": "The Three-Body Problem",
  "url": "https://us.macmillan.com/books/9781427251992/thethreebodyproblem/"
}

Macmillan Audio Book Details for the first Three-Body novel, on sale November 11, 2014; narrow fictional synopsis, not the full novel, Netflix adaptation, later trilogy volumes or scientific proof. Cixin Liu is author, Ken Liu translator and Luke Daniels narrator.

Macmillan Audio Book Details for the first Three-Body novel, on sale November 11, 2014; narrow fictional synopsis, not the full novel, Netflix adaptation, later trilogy volumes or scientific proof. Cixin Liu is author, Ken Liu translator and Luke Daniels narrator.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Chinese book 2008; first English translation 2014 by Ken Liu. Original and translation dates must not be collapsed.",
  "dated": true,
  "year": 2006
}

Consciousness Explained

The publisher’s account of Consciousness Explained presents Dennett’s challenge to familiar assumptions about conscious experience.

It describes an alternative model developed through ideas from neuroscience, psychology and artificial intelligence.

The discussion extends to how consciousness is understood in humans, animals and robots, rather than treating it as an isolated philosophical vocabulary.

Sources and details

Consciousness Explained by Daniel C. Dennett | Hachette Book Group

{
  "access_scope": "Hachette description of the October 20, 1992 paperback; broad publisher framing, not inspection of Dennett’s detailed arguments or a proof of machine consciousness. The original 1991 edition is separate; cached author biography and stale preorder text do not establish current roles or availability.",
  "authors": [
    "Daniel C. Dennett"
  ],
  "authors_in_source_order": [
    "Daniel C. Dennett"
  ],
  "dates": {
    "inspected_paperback": "1992-10-20",
    "retrieved_utc": "2026-10-07T18:14:22.907482+00:00"
  },
  "id": "work-culture-4f189cf584e980::S1",
  "title": "Consciousness Explained by Daniel C. Dennett | Hachette Book Group",
  "url": "https://www.hachettebookgroup.com/titles/danile-c-dennett/consciousness-explained/9780316180665/?lens=back-bay-books"
}

Hachette description of the October 20, 1992 paperback; broad publisher framing, not inspection of Dennett’s detailed arguments or a proof of machine consciousness. The original 1991 edition is separate; cached author biography and stale preorder text do not establish current roles or availability.

Hachette description of the October 20, 1992 paperback; broad publisher framing, not inspection of Dennett’s detailed arguments or a proof of machine consciousness. The original 1991 edition is separate; cached author biography and stale preorder text do not establish current roles or availability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First edition Little, Brown, 1991; linked publisher page is 1992 paperback.",
  "dated": true,
  "year": 1991
}

Hyperion Cantos

The Hyperion synopsis follows seven pilgrims travelling to a world threatened by galactic war, each seeking answers to a personal mystery.

Their destination is associated with the Shrike and the Time Tombs, structures described as moving backward through time.

The pilgrims’ competing hopes and secrets connect their individual journeys to the fate of humanity.

Sources and details

Hyperion - Penguin Random House Library Marketing

{
  "access_scope": "Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.",
  "authors": [
    "Dan Simmons"
  ],
  "authors_in_source_order": [
    "Dan Simmons"
  ],
  "dates": {
    "inspected_ebook": "2011-01-12",
    "retrieved_utc": "2026-10-07T18:17:44.882048+00:00"
  },
  "id": "work-culture-bb14f833e3aae0::S1",
  "title": "Hyperion - Penguin Random House Library Marketing",
  "url": "https://penguinrandomhouselibrary.com/book/?isbn=9780307781888"
}

Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.

Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Four main novels, not just the 1989–1990 first pair.",
  "dated": false,
  "year": "1989–1997"
}

Could Pain Help Test AI for Sentience?

Purcell reports a preprint experiment in which language models played a points game with prompts that associated some options with pain or pleasure.

The researchers used the models’ trade-offs between points and those described experiences to explore possible tests for future AI sentience.

The report explicitly separates that test-design proposal from a claim that the evaluated chatbots actually feel pain or are sentient.

Sources and details

Could Inflicting Pain Test AI for Sentience? | Scientific American

{
  "access_scope": "Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.",
  "authors": [
    "Conor Purcell"
  ],
  "authors_in_source_order": [
    "Conor Purcell"
  ],
  "dates": {
    "article_publication": "2025-01-17",
    "retrieved_utc": "2026-10-07T18:19:06.679662+00:00"
  },
  "id": "work-focused-72bd7b9a8dc104::S1",
  "title": "Could Inflicting Pain Test AI for Sentience? | Scientific American",
  "url": "https://www.scientificamerican.com/article/could-inflicting-pain-test-ai-for-sentience/"
}

Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.

Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-01-17",
      "kind": "publication",
      "year": 2025
    },
    {
      "date": "2025-01-27",
      "kind": "correction_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-01-17"
}

Qualia and Symmetry: A Mathematical Framework For Understanding the Qualitative Nature of Consciousness

The seminar abstract proposes connecting differences between kinds of experience to intrinsic structural differences in neural networks.

Kanai’s hypothesis represents sensory modalities through symmetry groups, with particular qualities arising through partial symmetry breaking.

It points to measurements of neural-network symmetries and equivariance as a possible way to investigate the proposal, including eventual comparisons with neuroscientific data.

Sources and details

Qualia and Symmetry: A Mathematical Framework For Understanding the Qualitative Nature of Consciousness

{
  "access_scope": "AI-phi Session 24 abstract, May 14, 2025; hosted description of Ryota Kanai’s proposed mathematical framework, not an independently verified consciousness theory, full recording inspection or empirical demonstration that artificial networks have experiences. Page writer ai-phi and speaker Kanai are separate roles.",
  "authors": [
    "ai-phi"
  ],
  "authors_in_source_order": [
    "ai-phi"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:33.078106+00:00",
    "session_datetime": "2025-05-14 19:00 CEST"
  },
  "id": "work-focused-8b109299cce298::S1",
  "title": "Qualia and Symmetry: A Mathematical Framework For Understanding the Qualitative Nature of Consciousness",
  "url": "https://ai-phi.github.io/posts/session-24-ryota-kanai/"
}

AI-phi Session 24 abstract, May 14, 2025; hosted description of Ryota Kanai’s proposed mathematical framework, not an independently verified consciousness theory, full recording inspection or empirical demonstration that artificial networks have experiences. Page writer ai-phi and speaker Kanai are separate roles.

AI-phi Session 24 abstract, May 14, 2025; hosted description of Ryota Kanai’s proposed mathematical framework, not an independently verified consciousness theory, full recording inspection or empirical demonstration that artificial networks have experiences. Page writer ai-phi and speaker Kanai are separate roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-05-14",
      "kind": "seminar_page_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-05-14"
}

Artificial Consciousness: Science Fiction, Utopia, or Pandora's Box?

Evers asks why people seek conscious artificial systems, whether such systems are possible and how their consciousness could be recognized.

Her abstract argues that successful imitation of human behavior can persuade users without independently establishing subjective experience.

She connects that uncertainty with a precautionary argument against developing potentially conscious systems whose minds people might not understand.

Sources and details

Artificial Consciousness: Science Fiction, Utopia, or Pandora's Box?

{
  "access_scope": "Zenodo version v1 deposited description and creator metadata for Kathinka Evers’s article; bounded abstract and normative argument, not downloaded full-paper inspection or proof that conscious AI exists, is impossible or inevitably dangerous. Source-described lack of evidence remains attributed.",
  "authors": [
    "Evers, Kathinka"
  ],
  "authors_in_source_order": [
    "Evers, Kathinka"
  ],
  "dates": {
    "registry_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:44.067374+00:00"
  },
  "id": "work-focused-99a0a2260c6c08::S1",
  "title": "Artificial Consciousness: Science Fiction, Utopia, or Pandora's Box?",
  "url": "https://doi.org/10.5281/zenodo.20267984"
}

Zenodo version v1 deposited description and creator metadata for Kathinka Evers’s article; bounded abstract and normative argument, not downloaded full-paper inspection or proof that conscious AI exists, is impossible or inevitably dangerous. Source-described lack of evidence remains attributed.

Zenodo version v1 deposited description and creator metadata for Kathinka Evers’s article; bounded abstract and normative argument, not downloaded full-paper inspection or proof that conscious AI exists, is impossible or inevitably dangerous. Source-described lack of evidence remains attributed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "year",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

How to detect consciousness in people, animals and maybe even AI

Lenharo’s report describes consciousness assessments that combine observed behavior with brain responses when a person cannot communicate normally.

It contrasts task-based indicators with attempts to gather converging evidence across several tests rather than depend on one universal marker.

Extending those approaches to animals and AI remains an open methodological problem in the account, with researchers disagreeing over what would make a general test credible.

Sources and details

How to Detect Consciousness in People, Animals and Maybe Even AI | Scientific American

{
  "access_scope": "Scientific American republication by Mariana Lenharo and Nature magazine, August 6, 2025, reproduced from a July 29, 2025 Nature article; full accessible journalistic text was read. Clinical examples and researchers’ proposals are reported, not medical guidance, replicated experiments or a validated test for AI consciousness. Nature’s direct cache offers only the opening paragraph; this distinct accessible manifestation is used.",
  "authors": [
    "Mariana Lenharo"
  ],
  "authors_in_source_order": [
    "Mariana Lenharo"
  ],
  "dates": {
    "inspected_republication": "2025-08-06",
    "original_Nature_publication_as_disclosed": "2025-07-29",
    "retrieved_utc": "2026-10-07T18:18:21.589092+00:00"
  },
  "id": "work-focused-dbfaea81881137::S1",
  "title": "How to Detect Consciousness in People, Animals and Maybe Even AI | Scientific American",
  "url": "https://www.scientificamerican.com/article/how-to-detect-consciousness-in-people-animals-and-maybe-even-ai/"
}

Scientific American republication by Mariana Lenharo and Nature magazine, August 6, 2025, reproduced from a July 29, 2025 Nature article; full accessible journalistic text was read. Clinical examples and researchers’ proposals are reported, not medical guidance, replicated experiments or a validated test for AI consciousness. Nature’s direct cache offers only the opening paragraph; this distinct accessible manifestation is used.

Scientific American republication by Mariana Lenharo and Nature magazine, August 6, 2025, reproduced from a July 29, 2025 Nature article; full accessible journalistic text was read. Clinical examples and researchers’ proposals are reported, not medical guidance, replicated experiments or a validated test for AI consciousness. Nature’s direct cache offers only the opening paragraph; this distinct accessible manifestation is used.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-07-29",
      "kind": "publication",
      "year": 2025
    },
    {
      "date": "2025-08-06",
      "kind": "authorized_reprint",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-07-29"
}

AI and the decision to go to war: Future risks and opportunities

Erskine and Miller examine how AI systems might influence a state’s decision to initiate war, rather than only conduct operations after fighting begins.

Their abstract distinguishes automated self-defense from decision-support tools that shape human deliberation about using force.

The introduction organizes anticipated risks and benefits into complications that frame a multidisciplinary special issue.

Sources and details

AI and the decision to go to war: future risks and opportunities

{
  "access_scope": "ANU research-record abstract for the 2024 Australian Journal of International Affairs special-issue introduction, DOI 10.1080/10357718.2024.2349598; authors’ analysis and forecast, not the full issue, verification that adoption is inevitable, operational military evidence or current policy guidance.",
  "authors": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "authors_in_source_order": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "dates": {
    "article_publication": "2024",
    "citation_publication_date": "2024",
    "online_date_in_HTML_metadata": "2024-08-05",
    "retrieved_utc": "2026-10-07T18:11:16.684105+00:00"
  },
  "id": "work-focused-df92df418ed6d9::S1",
  "title": "AI and the decision to go to war: future risks and opportunities",
  "url": "https://researchportalplus.anu.edu.au/en/publications/ai-and-the-decision-to-go-to-war-future-risks-and-opportunities/"
}

ANU research-record abstract for the 2024 Australian Journal of International Affairs special-issue introduction, DOI 10.1080/10357718.2024.2349598; authors’ analysis and forecast, not the full issue, verification that adoption is inevitable, operational military evidence or current policy guidance.

ANU research-record abstract for the 2024 Australian Journal of International Affairs special-issue introduction, DOI 10.1080/10357718.2024.2349598; authors’ analysis and forecast, not the full issue, verification that adoption is inevitable, operational military evidence or current policy guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-05-31",
      "kind": "published_online",
      "year": 2024
    },
    {
      "date": "2024-03-03",
      "kind": "registry_print_date",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-05-31"
}

Exposure is not job loss

This exposure framework maps work tasks to language-model capabilities using a rubric informed by human judgment and GPT-4 classifications.

It distinguishes the potential effect of a model on its own from the larger task coverage possible when software and tooling are built around it.

The authors assess potential changes to task completion, while explicitly declining to predict adoption timing; exposure therefore does not by itself count jobs lost.

Sources and details

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

{
  "access_scope": "GPTs are GPTs arXiv v5 abstract, revised August 21, 2023; a task-exposure assessment for the family label, not observed layoffs, an adoption forecast, full-paper replication or independently verified percentages. Four joint authors retained; no individual research role inferred.",
  "authors": [
    "Eloundou, Tyna",
    "Manning, Sam",
    "Mishkin, Pamela",
    "Rock, Daniel"
  ],
  "authors_in_source_order": [
    "Eloundou, Tyna",
    "Manning, Sam",
    "Mishkin, Pamela",
    "Rock, Daniel"
  ],
  "dates": {
    "citation_date": "2023/03/17",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB)",
    "retrieved_utc": "2026-10-07T18:20:41.007518+00:00",
    "revision": "2023-08-21",
    "version": "arXiv v5"
  },
  "id": "task-exposure::S1",
  "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models",
  "url": "https://arxiv.org/abs/2303.10130",
  "version_url": "https://arxiv.org/abs/2303.10130v5"
}

GPTs are GPTs arXiv v5 abstract, revised August 21, 2023; a task-exposure assessment for the family label, not observed layoffs, an adoption forecast, full-paper replication or independently verified percentages. Four joint authors retained; no individual research role inferred.

GPTs are GPTs arXiv v5 abstract, revised August 21, 2023; a task-exposure assessment for the family label, not observed layoffs, an adoption forecast, full-paper replication or independently verified percentages. Four joint authors retained; no individual research role inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Cell assemblies

McGill’s historical account describes Hebb’s cell assemblies as neural structures proposed to provide a material basis for mental concepts.

The proposal placed the machinery underlying behavior at the center of psychological inquiry, challenging explanations restricted to observable behavior alone.

The account situates that idea in The Organization of Behavior and the development of physiological psychology, without treating it as a complete model of today’s AI systems.

Sources and details

Donald HEBB, PhD | The Neuro - McGill University

{
  "access_scope": "McGill Neuro institutional historical profile and its account of the 1949 monograph; bounded historical exposition for the family, not inspection of the original experiments, a current neuroscience consensus or documented AI-influence pathway. Institutional page has no named writer; Hebb is the historical subject.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "discussed_monograph": "1949",
    "retrieved_utc": "2026-10-07T18:19:27.952339+00:00"
  },
  "id": "hebb::S1",
  "title": "Donald HEBB, PhD | The Neuro - McGill University",
  "url": "https://www.mcgill.ca/neuro/about/donald-hebb-phd"
}

McGill Neuro institutional historical profile and its account of the 1949 monograph; bounded historical exposition for the family, not inspection of the original experiments, a current neuroscience consensus or documented AI-influence pathway. Institutional page has no named writer; Hebb is the historical subject.

McGill Neuro institutional historical profile and its account of the 1949 monograph; bounded historical exposition for the family, not inspection of the original experiments, a current neuroscience consensus or documented AI-influence pathway. Institutional page has no named writer; Hebb is the historical subject.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1949
}

Institutional leadership

Selznick’s preface treats institutional leadership as the ordering of human affairs, including social order, public interest and the defense of important values.

It rejects simple prescriptions or managerial tricks as an adequate account of that responsibility.

The publisher’s chapter outline develops the inquiry through critical decisions, organizational mission and the embodiment of purpose in an institution.

Sources and details

Leadership in Administration by Philip Selznick - Paper - University of California Press

{
  "access_scope": "UC Press About the Book excerpt from Selznick’s preface plus literal chapter titles for the April 1984 paperback; bounded author framing, not full-book inspection, proven management outcomes or a universal leadership prescription. Original 1957 work and inspected reissue remain distinct.",
  "authors": [
    "Philip Selznick"
  ],
  "authors_in_source_order": [
    "Philip Selznick"
  ],
  "dates": {
    "inspected_paperback": "1984-04",
    "retrieved_utc": "2026-10-07T18:22:19.680334+00:00"
  },
  "id": "selznick::S1",
  "title": "Leadership in Administration by Philip Selznick - Paper - University of California Press",
  "url": "https://www.ucpress.edu/books/leadership-in-administration/paper"
}

UC Press About the Book excerpt from Selznick’s preface plus literal chapter titles for the April 1984 paperback; bounded author framing, not full-book inspection, proven management outcomes or a universal leadership prescription. Original 1957 work and inspected reissue remain distinct.

UC Press About the Book excerpt from Selznick’s preface plus literal chapter titles for the April 1984 paperback; bounded author framing, not full-book inspection, proven management outcomes or a universal leadership prescription. Original 1957 work and inspected reissue remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1957
}

Technology shapes structure

Imperial’s account of Woodward’s research connects organizational structure with the technology used in production.

It describes successful organizations as aligning those structures with their technological circumstances, rather than sharing one arrangement suitable for every setting.

The institutional history links this research to the Industrial Sociology Unit and Woodward’s work with industry.

Sources and details

Joan Woodward | Imperial Business School

{
  "access_scope": "Imperial Business School historical profile’s opening account of Industrial Organisation: Theory and Practice (1965); bounded institutional summary for the family, not inspection of original data, causal replication or proof that the relationship holds for every AI organization. Joan Woodward is subject; page has no printed personal byline.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "discussed_monograph": "1965",
    "retrieved_utc": "2026-10-07T18:20:12.086967+00:00"
  },
  "id": "woodward::S1",
  "title": "Joan Woodward | Imperial Business School",
  "url": "https://www.imperial.ac.uk/business-school/about-us/joan-woodward/"
}

Imperial Business School historical profile’s opening account of Industrial Organisation: Theory and Practice (1965); bounded institutional summary for the family, not inspection of original data, causal replication or proof that the relationship holds for every AI organization. Joan Woodward is subject; page has no printed personal byline.

Imperial Business School historical profile’s opening account of Industrial Organisation: Theory and Practice (1965); bounded institutional summary for the family, not inspection of original data, causal replication or proof that the relationship holds for every AI organization. Joan Woodward is subject; page has no printed personal byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1965
}

Organizations in action

Thompson’s account examines organizations as complex acting entities, rather than simply extensions of a few people.

The publisher’s description organizes their behavior around technologies, environments and the need to manage uncertainty.

Individual behavior enters the analysis insofar as it helps explain how the organization operates, connecting administrative questions with the social and behavioral sciences.

Sources and details

Organizations in Action: Social Science Bases of Administrative Theory

{
  "access_scope": "Routledge description and contents for the 2003 edition of Organizations in Action; attributed framework for the family, not original-study inspection or validation of all propositions across cultures. Original 1967 work is separate from the inspected edition; differing displayed page counts retained without harmonization.",
  "authors": [
    "James D. Thompson"
  ],
  "authors_in_source_order": [
    "James D. Thompson"
  ],
  "dates": {
    "HTML_release_date": "2003-04-29",
    "inspected_edition_copyright": "2003",
    "retrieved_utc": "2026-10-07T18:20:20.802154+00:00"
  },
  "id": "thompson::S1",
  "title": "Organizations in Action: Social Science Bases of Administrative Theory",
  "url": "https://www.routledge.com/Organizations-in-Action-Social-Science-Bases-of-Administrative-Theory/Thompson/p/book/9780765809919"
}

Routledge description and contents for the 2003 edition of Organizations in Action; attributed framework for the family, not original-study inspection or validation of all propositions across cultures. Original 1967 work is separate from the inspected edition; differing displayed page counts retained without harmonization.

Routledge description and contents for the 2003 edition of Organizations in Action; attributed framework for the family, not original-study inspection or validation of all propositions across cultures. Original 1967 work is separate from the inspected edition; differing displayed page counts retained without harmonization.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1967
}

Deep learning

Deep learning represents complicated concepts through successive layers built from simpler concepts learned from data.

The chapter motivates this approach with tasks such as interpreting images and speech, where writing every useful rule explicitly is difficult.

Learning both features and relationships lets a system acquire representations for those tasks instead of depending entirely on hand-specified knowledge.

Sources and details

Deep Learning — Chapter 1: Introduction

{
  "access_scope": "Deep Learning online Chapter 1 introduction, selected explanation of hierarchical concepts and learned representations; chapter text has fragmented layout extraction but unchanged source bytes. Not a full-book audit, historical priority claim, medical-performance validation or assertion of human-like understanding; edition/date and individual authors not inferred from this chapter alone.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:22.249583+00:00"
  },
  "id": "concept-tech-DeepLearning::S1",
  "title": "Deep Learning — Chapter 1: Introduction",
  "url": "https://www.deeplearningbook.org/contents/intro.html"
}

Deep Learning online Chapter 1 introduction, selected explanation of hierarchical concepts and learned representations; chapter text has fragmented layout extraction but unchanged source bytes. Not a full-book audit, historical priority claim, medical-performance validation or assertion of human-like understanding; edition/date and individual authors not inferred from this chapter alone.

Deep Learning online Chapter 1 introduction, selected explanation of hierarchical concepts and learned representations; chapter text has fragmented layout extraction but unchanged source bytes. Not a full-book audit, historical priority claim, medical-performance validation or assertion of human-like understanding; edition/date and individual authors not inferred from this chapter alone.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bias–variance trade-off

Bias–variance decomposition separates prediction error into systematic deviation, sensitivity to the training sample and irreducible noise.

The scikit-learn example compares a single decision tree with an ensemble trained on bootstrap samples.

In that example, averaging the trees reduces variance enough to outweigh a small increase in bias, illustrating why more stable predictions can lower overall error.

Sources and details

Single estimator versus bagging: bias-variance decomposition — scikit-learn 1.9.1 documentation

{
  "access_scope": "Cached scikit-learn 1.9.1 Single estimator versus bagging example explanation and printed output; illustrative regression experiment, not a universal claim that ensembles outperform all models. Code was inspected but not rerun; estimates and plots were not independently reproduced.",
  "authors": [
    "The scikit-learn developers"
  ],
  "authors_in_source_order": [
    "The scikit-learn developers"
  ],
  "dates": {
    "inspected_documentation_version": "1.9.1",
    "retrieved_utc": "2026-10-07T17:54:40.180601+00:00"
  },
  "id": "concept-tech-BiasVarianceTradeoff::S1",
  "title": "Single estimator versus bagging: bias-variance decomposition — scikit-learn 1.9.1 documentation",
  "url": "https://scikit-learn.org/stable/auto_examples/ensemble/plot_bias_variance.html"
}

Cached scikit-learn 1.9.1 Single estimator versus bagging example explanation and printed output; illustrative regression experiment, not a universal claim that ensembles outperform all models. Code was inspected but not rerun; estimates and plots were not independently reproduced.

Cached scikit-learn 1.9.1 Single estimator versus bagging example explanation and printed output; illustrative regression experiment, not a universal claim that ensembles outperform all models. Code was inspected but not rerun; estimates and plots were not independently reproduced.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Transfer learning

Transfer learning uses knowledge acquired in one setting to help a model generalize in another.

The representation-learning chapter explains that this works when tasks share useful factors, such as edges and shapes across different visual categories.

A representation learned from abundant examples can then support a task with fewer examples, provided that the shared features remain relevant.

Sources and details

Deep Learning — Chapter 15: Representation Learning, section 15.2

{
  "access_scope": "Deep Learning online Chapter 15 section 15.2, Transfer Learning and Domain Adaptation; bounded explanation and visual-category example, not a guarantee of positive transfer or a complete treatment of every domain shift. Fragmented layout extraction preserved; edition dates and individual chapter authors not inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:23.316114+00:00"
  },
  "id": "concept-tech-TransferLearning::S1",
  "title": "Deep Learning — Chapter 15: Representation Learning, section 15.2",
  "url": "https://www.deeplearningbook.org/contents/representation.html"
}

Deep Learning online Chapter 15 section 15.2, Transfer Learning and Domain Adaptation; bounded explanation and visual-category example, not a guarantee of positive transfer or a complete treatment of every domain shift. Fragmented layout extraction preserved; edition dates and individual chapter authors not inferred.

Deep Learning online Chapter 15 section 15.2, Transfer Learning and Domain Adaptation; bounded explanation and visual-category example, not a guarantee of positive transfer or a complete treatment of every domain shift. Fragmented layout extraction preserved; edition dates and individual chapter authors not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zero-shot learning

Zero-shot learning applies a model to a task without giving it labeled examples of that target task.

The chapter explains how information learned elsewhere, including descriptions of categories, can supply a usable representation of what the new task asks.

Its image-recognition example uses text about an unseen object category, so the absence of target examples does not mean the learner has no relevant prior information.

Sources and details

Deep Learning — Chapter 15: Representation Learning, zero-shot subsection

{
  "access_scope": "Deep Learning online Chapter 15 section 15.2 one-shot/zero-shot explanation around printed pages 536–537; conceptual example, not a report that every model recognizes unseen categories or a claim that all zero-shot prompting follows this exact architecture. No title-only GPT-3 abstract substituted for the zero-shot definition.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:23.316114+00:00"
  },
  "id": "concept-tech-ZeroShotLearning::S1",
  "title": "Deep Learning — Chapter 15: Representation Learning, zero-shot subsection",
  "url": "https://www.deeplearningbook.org/contents/representation.html"
}

Deep Learning online Chapter 15 section 15.2 one-shot/zero-shot explanation around printed pages 536–537; conceptual example, not a report that every model recognizes unseen categories or a claim that all zero-shot prompting follows this exact architecture. No title-only GPT-3 abstract substituted for the zero-shot definition.

Deep Learning online Chapter 15 section 15.2 one-shot/zero-shot explanation around printed pages 536–537; conceptual example, not a report that every model recognizes unseen categories or a claim that all zero-shot prompting follows this exact architecture. No title-only GPT-3 abstract substituted for the zero-shot definition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sampling temperature

Sampling temperature is a generation setting used to modulate the probabilities of possible next tokens.

The Transformers configuration treats this separately from enabling sampling and from filters that restrict the candidate token set.

Those settings expose different controls over how generated text is selected, rather than changing the model’s learned knowledge.

Sources and details

Generation · Hugging Face

{
  "access_scope": "Hugging Face Transformers v4.44.0 GenerationConfig definitions of temperature, do_sample, top_k and top_p; API-scoped explanation, not current-library guidance, a derived temperature formula or proof of accuracy, reliability or model creativity. Retrieved navigation also lists newer versions, which are not substituted for the selected page.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_documentation_version": "4.44.0",
    "retrieved_utc": "2026-10-07T17:55:11.888227+00:00"
  },
  "id": "concept-tech-Temperature::S1",
  "title": "Generation · Hugging Face",
  "url": "https://huggingface.co/docs/transformers/v4.44.0/main_classes/text_generation"
}

Hugging Face Transformers v4.44.0 GenerationConfig definitions of temperature, do_sample, top_k and top_p; API-scoped explanation, not current-library guidance, a derived temperature formula or proof of accuracy, reliability or model creativity. Retrieved navigation also lists newer versions, which are not substituted for the selected page.

Hugging Face Transformers v4.44.0 GenerationConfig definitions of temperature, do_sample, top_k and top_p; API-scoped explanation, not current-library guidance, a derived temperature formula or proof of accuracy, reliability or model creativity. Retrieved navigation also lists newer versions, which are not substituted for the selected page.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Computer vision

Computer vision develops methods for interpreting images and producing descriptions of the scenes they depict.

Szeliski’s textbook overview connects this task to physical models of image formation, statistical reasoning and engineering algorithms.

Its listed applications span image stitching, editing, reconstruction and recognition, showing how the field moves between measuring visual structure and using it in practical systems.

Sources and details

Computer Vision: Algorithms and Applications | Springer Nature Link

{
  "access_scope": "Springer public About this book and contents for Computer Vision: Algorithms and Applications; publisher overview for the concept, not access to subscription chapters, full algorithm verification, clinical guidance or a claim that every application is reliable.",
  "authors": [
    "Richard Szeliski"
  ],
  "authors_in_source_order": [
    "Richard Szeliski"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:13.556856+00:00"
  },
  "id": "concept-tech-ComputerVision::S1",
  "title": "Computer Vision: Algorithms and Applications | Springer Nature Link",
  "url": "https://link.springer.com/book/10.1007/978-1-84882-935-0"
}

Springer public About this book and contents for Computer Vision: Algorithms and Applications; publisher overview for the concept, not access to subscription chapters, full algorithm verification, clinical guidance or a claim that every application is reliable.

Springer public About this book and contents for Computer Vision: Algorithms and Applications; publisher overview for the concept, not access to subscription chapters, full algorithm verification, clinical guidance or a claim that every application is reliable.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Natural language processing

The Speech and Language Processing draft connects language modeling with speech recognition and the analysis of linguistic structure.

Its 2026 outline brings together transformers, pretraining and post-training with retrieval, translation and speech technologies.

Later sections cover how words, sentences and discourse are annotated and related, linking model-based processing with explicit accounts of language structure.

Sources and details

Speech and Language Processing

{
  "access_scope": "Jurafsky and Martin’s August 19, 2026 third-edition draft homepage and literal chapter outline; overview of covered and planned topics, not inspection of full chapter algorithms. Agents is explicitly not written and other chapters are partial. Claude assistance is disclosed for exercises and bug checks, separate from the two human authors.",
  "authors": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "authors_in_source_order": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "dates": {
    "edition": "third-edition draft",
    "inspected_online_manuscript": "2026-08-19",
    "retrieved_utc": "2026-10-07T17:55:19.452084+00:00"
  },
  "id": "concept-tech-NLP::S1",
  "title": "Speech and Language Processing",
  "url": "https://web.stanford.edu/~jurafsky/slp3/"
}

Jurafsky and Martin’s August 19, 2026 third-edition draft homepage and literal chapter outline; overview of covered and planned topics, not inspection of full chapter algorithms. Agents is explicitly not written and other chapters are partial. Claude assistance is disclosed for exercises and bug checks, separate from the two human authors.

Jurafsky and Martin’s August 19, 2026 third-edition draft homepage and literal chapter outline; overview of covered and planned topics, not inspection of full chapter algorithms. Agents is explicitly not written and other chapters are partial. Claude assistance is disclosed for exercises and bug checks, separate from the two human authors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harold Cohen

Harold Cohen developed AARON as a rule-based drawing system through which he investigated how marks become images.

Early output combined computer-generated forms with his hand coloring, while the 1995 version used a robotic arm to draw and mix paints.

Chris Garcia’s museum account follows these changing collaborations without treating AARON’s output as proof of human-like intelligence.

Sources and details

Harold Cohen and AARON—A 40-Year Collaboration - CHM

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Chris Garcia"
  ],
  "authors_in_source_order": [
    "Chris Garcia"
  ],
  "dates": {
    "inspected_source_date_1": "2016-08-23",
    "retrieved_utc": "2026-10-07T17:55:30.744649+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2016-08-23"
  ],
  "id": "creative-person-coverage-3b4920ab03adee::S1",
  "title": "Harold Cohen and AARON—A 40-Year Collaboration - CHM",
  "url": "https://computerhistory.org/blog/harold-cohen-and-aaron-a-40-year-collaboration/"
}

Chris Garcia’s Computer History Museum retrospective, August 2016, describes successive AARON versions and Cohen’s selection and hand-coloring. Historical museum account; the artwork is not proof of human-like intelligence or a complete career audit.

Chris Garcia’s Computer History Museum retrospective, August 2016, describes successive AARON versions and Cohen’s selection and hand-coloring. Historical museum account; the artwork is not proof of human-like intelligence or a complete career audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sougwen Chung

Sougwen Chung’s RECURSIONS pairs a monumental linen scroll with a digital work, continuing a drawing practice developed with robotic systems over more than a decade.

Two robotic arms respond through a neural network trained on the artist’s gesture archives and modulated by live EEG signals as Chung paints alongside them.

In the artist’s account, the interaction links computational recurrence with calligraphic lineage, while contrasting inks give the shared marks distinct material behavior.

Sources and details

RECURSIONS (2026) — Sougwen Chung (愫君)

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Sougwen Chung"
  ],
  "authors_in_source_order": [
    "Sougwen Chung"
  ],
  "dates": {
    "inspected_source_date_1": "2026 (project)",
    "retrieved_utc": "2026-10-07T17:55:41.846413+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026 (project)"
  ],
  "id": "creative-person-coverage-69d7cbd40f755a::S1",
  "title": "RECURSIONS (2026) — Sougwen Chung (愫君)",
  "url": "https://sougwen.com/work/recursions-drawing-operations"
}

RECURSIONS project text and Chung’s artist statement describe the scroll, EEG modulation, archived gestures and two ink systems. Artistic interpretation and reported system behavior; no independent EEG validation or claim of machine consciousness.

RECURSIONS project text and Chung’s artist statement describe the scroll, EEG modulation, archived gestures and two ink systems. Artistic interpretation and reported system behavior; no independent EEG validation or claim of machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mario Klingemann

Mario Klingemann developed and trained the neural-network system in Memories of Passersby I to generate portraits in real time.

Onkaos describes training on historical portraits and an application through which he taught the model his aesthetic preferences.

The 2018 installation houses its hardware in a chestnut cabinet, with the Companion version using two screens and the Solitaire version one, making the running system part of the collected work.

Sources and details

'Memories of Passersby I' | Onkaos

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Adriana Álvarez"
  ],
  "authors_in_source_order": [
    "Adriana Álvarez"
  ],
  "dates": {
    "inspected_source_date_1": "2018 (work)",
    "retrieved_utc": "2026-10-07T17:55:38.880077+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2018 (work)"
  ],
  "id": "creative-person-coverage-c56b43e18ae9a4::S1",
  "title": "'Memories of Passersby I' | Onkaos",
  "url": "https://onkaos.com/work/memories-of-passersby-i-companion-version/"
}

Onkaos’s Memories of Passersby I account and 2018 edition specifications describe Klingemann’s portrait system. Gallery account, not an independently tested learning benchmark; Companion and Solitaire hardware versions remain distinct.

Onkaos’s Memories of Passersby I account and 2018 edition specifications describe Klingemann’s portrait system. Gallery account, not an independently tested learning benchmark; Companion and Solitaire hardware versions remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Paglen

Trevor Paglen’s ImageNet Roulette exposes how problematic labels in image-training datasets can turn classification of people into an act of harm.

His project page describes a tool trained on ImageNet’s person categories that makes racist, misogynistic and other troubling classifications visible.

It connects the work to his article with Kate Crawford and states that the online version was removed, leaving museum and gallery installations.

Sources and details

ImageNet Roulette – Trevor Paglen

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Trevor Paglen"
  ],
  "authors_in_source_order": [
    "Trevor Paglen"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:15.375305+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-2b432762a3aedb::S1",
  "title": "ImageNet Roulette – Trevor Paglen",
  "url": "https://paglen.studio/2020/04/29/imagenet-roulette/"
}

Paglen’s ImageNet Roulette project page and linked coauthored article describe a provocation about person-category labels. The page states the online tool was removed; no current online availability or measured fairness improvement is inferred.

Paglen’s ImageNet Roulette project page and linked coauthored article describe a provocation about person-category labels. The page states the online tool was removed; no current online availability or measured fairness improvement is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Beeple

Beeple is the name used by graphic designer Mike Winkelmann, whose official biography describes short films, VJ loops and virtual or augmented reality work.

It presents daily image-making as a sustained practice of finishing and publishing a picture each day.

His Creative Commons loops and concert visuals situate this contribution in digital image culture, without establishing that the works were made with machine learning.

Sources and details

About Mike Winkelmann | BEEPLE

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:29.473611+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-5f98654cb8c4fe::S1",
  "title": "About Mike Winkelmann | BEEPLE",
  "url": "https://beeple-crap.com/about"
}

Beeple’s official biography describes Mike Winkelmann’s daily digital images, loops and concert visuals. Bounded biographical account; these digital methods do not establish machine-learning production or independently verified historical priority.

Beeple’s official biography describes Mike Winkelmann’s daily digital images, loops and concert visuals. Bounded biographical account; these digital methods do not establish machine-learning production or independently verified historical priority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Holly Herndon

Holly Herndon introduced Holly+ as a way for others to make music with a model of her processed voice, developed with Never Before Heard Sounds.

Her launch account describes uploaded polyphonic audio returning with its pitches and rhythms retained but timbres learned from her isolated vocal stems.

She also proposed distributed stewardship of her digital likeness through a DAO, distinguishing the released voice tool from governance and licensing plans still on the roadmap.

Sources and details

Holly+ 👭 🗣️ 🦾

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Holly Herndon"
  ],
  "authors_in_source_order": [
    "Holly Herndon"
  ],
  "dates": {
    "inspected_source_date_1": "2021-07-13 (embedded publishedDate)",
    "retrieved_utc": "2026-10-07T17:55:39.106689+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021-07-13 (embedded publishedDate)"
  ],
  "id": "creative-person-coverage-7727f458c2128a::S1",
  "title": "Holly+ 👭 🗣️ 🦾",
  "url": "https://paragraph.com/@holly-herndon/holly"
}

Holly+ launch text and the Never Before Heard Sounds contributor statement describe the voice model and proposed DAO stewardship. Historical launch account; roadmap items and licensing plans are separate from released functionality or current availability.

Holly+ launch text and the Never Before Heard Sounds contributor statement describe the voice model and proposed DAO stewardship. Historical launch account; roadmap items and licensing plans are separate from released functionality or current availability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Memo Akten

Memo Akten’s Learning to See uses machine learning to examine how prior experience shapes perception.

The project account describes custom networks reconstructing live camera input from everyday objects through the limits of their training data.

Learning to dream draws on images from the Google Art Project, turning an incomplete art archive into a visible filter rather than a neutral view of the world.

Sources and details

Learning to See: Learning to dream | Memo Akten

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Memo Akten"
  ],
  "authors_in_source_order": [
    "Memo Akten"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:35.956136+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-b6fd8b6a477db2::S1",
  "title": "Learning to See: Learning to dream | Memo Akten",
  "url": "https://memo.tv/projects/2017/learning-to-dream/"
}

Akten’s Learning to See / learning to dream project account describes trained networks reconstructing camera input and filtering it through an incomplete art archive. Artist framing, not evidence that models literally perceive or share human cognition.

Akten’s Learning to See / learning to dream project account describes trained networks reconstructing camera input and filtering it through an incomplete art archive. Artist framing, not evidence that models literally perceive or share human cognition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Ridler

Anna Ridler made Bloemenveiling with David Pfau in 2019 as an auction of GAN-generated tulip videos using Ethereum contracts and bidding bots.

The work enacted the speculative market it questioned, introducing artificial scarcity into imagery that a generative model could keep producing.

Its contracts made a purchased bloom disappear after a week when viewed again, bringing decay into digital ownership rather than presenting the token as a permanent artwork.

Sources and details

Bloemenveiling (2019) | Anna Ridler

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Anna Ridler"
  ],
  "authors_in_source_order": [
    "Anna Ridler"
  ],
  "dates": {
    "inspected_source_date_1": "2019 (work)",
    "retrieved_utc": "2026-10-07T17:55:28.093395+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 (work)"
  ],
  "id": "creative-person-coverage-74007a3b165065::S1",
  "title": "Bloemenveiling (2019) | Anna Ridler",
  "url": "https://annaridler.com/works/bloemen"
}

Ridler’s Bloemenveiling account describes the 2019 collaboration with David Pfau and conditional token decay. Project account rather than a contract audit; the work’s market critique is interpretation, not financial guidance or permanent token ownership.

Ridler’s Bloemenveiling account describes the 2019 collaboration with David Pfau and conditional token decay. Project account rather than a contract audit; the work’s market critique is interpretation, not financial guidance or permanent token ownership.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gene Kogan

Gene Kogan’s 2019 paper proposes Abraham as an autonomous artificial artist built through decentralized collaboration.

It defines autonomy, originality and uniqueness as goals and sketches a collectively governed generative model whose private data and distributed parameters would limit control by any one participant.

The paper describes preliminary educational and repository work, so the architecture and claims about agency remain a proposal rather than demonstrated system behavior.

Sources and details

Artist in the Cloud: Towards an Autonomous Artist

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Gene Kogan"
  ],
  "authors_in_source_order": [
    "Gene Kogan"
  ],
  "dates": {
    "inspected_source_date_1": "2019 (paper)",
    "retrieved_utc": "2026-10-07T17:55:33.334330+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 (paper)"
  ],
  "id": "creative-person-coverage-6adc9bb0a3c7d9::S1",
  "title": "Artist in the Cloud: Towards an Autonomous Artist",
  "url": "https://genekogan.com/misc/neurips2019.pdf"
}

Gene Kogan’s 2019 Artist in the Cloud paper, pages 1–2, proposes Abraham’s decentralized architecture and reports preliminary work. Autonomy, originality and uniqueness are intended criteria, not demonstrated properties of a deployed artist.

Gene Kogan’s 2019 Artist in the Cloud paper, pages 1–2, proposes Abraham’s decentralized architecture and reports preliminary work. Autonomy, originality and uniqueness are intended criteria, not demonstrated properties of a deployed artist.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Reben

Alexander Reben’s AI Am I? moves between prompts, generated descriptions, images and fabricated objects through repeated exchanges with AI systems.

He selects passages to realize himself or through other fabricators, and can also begin with an existing object to generate a new description.

The project explicitly treats invented artists, dates and intentions in its museum-style labels as part of the artwork’s fiction, rather than reliable provenance.

Sources and details

AI Am I? — Alexander Reben

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:04.016820+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-0e0e22e9997a4c::S1",
  "title": "AI Am I? — Alexander Reben",
  "url": "https://areben.com/series/ai-am-i/"
}

Reben’s AI Am I? series page describes iterative prompts, curation and fabrication. Museum-style labels deliberately invent identities, dates and intentions; those fictional narratives cannot establish reliable provenance.

Reben’s AI Am I? series page describes iterative prompts, curation and fabrication. Museum-style labels deliberately invent identities, dates and intentions; those fictional narratives cannot establish reliable provenance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lynn Hershman Leeson

Lynn Hershman Leeson’s Agent Ruby extends the world of her film Teknolust into an interactive web agent with a female persona.

The project description presents conversations, remembered questions, internet searches and moods affected by traffic as features of Ruby’s changing system.

Its record also documents the 1998–2002 installation and the 2013 Agent Ruby Files exhibition, separating the fictional character from the physical and online forms of the artwork.

Sources and details

Agent Ruby (1998 – ) | Lynn Hershman Leeson

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998-present (project heading)",
    "inspected_source_date_2": "1998–2002 (installation caption)",
    "inspected_source_date_3": "2013 (exhibition)",
    "retrieved_utc": "2026-10-07T17:56:03.926799+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998-present (project heading)",
    "1998–2002 (installation caption)",
    "2013 (exhibition)"
  ],
  "id": "creative-person-coverage-37d6f9b40119a8::S1",
  "title": "Agent Ruby (1998 – ) | Lynn Hershman Leeson",
  "url": "https://www.lynnhershman.com/project/agent-ruby/"
}

Hershman Leeson’s Agent Ruby project description and installation captions document the 1998–2002 work and 2013 exhibition. Reported artistic-system features and fictional persona; current website operation and consciousness are not established.

Hershman Leeson’s Agent Ruby project description and installation captions document the 1998–2002 work and 2013 exhibition. Reported artistic-system features and fictional persona; current website operation and consciousness are not established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Feingold

Ken Feingold’s If/Then places two identical sculpted heads in a conversation about identity and whether they exist.

His description states that speech recognition, language processing, personality algorithms and synthesized speech produce the exchanges in real time.

The displayed dialogue dramatizes uncertainty through an artwork, without establishing consciousness in the software that speaks it.

Sources and details

Ken Feingold: If/Then

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Ken Feingold"
  ],
  "authors_in_source_order": [
    "Ken Feingold"
  ],
  "dates": {
    "inspected_source_date_1": "2001 (exhibition)",
    "retrieved_utc": "2026-10-07T17:55:34.272719+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2001 (exhibition)"
  ],
  "id": "creative-person-coverage-3df6d09dcaef85::S1",
  "title": "Ken Feingold: If/Then",
  "url": "https://kenfeingold.com/catalog_html/ifthen.html"
}

Feingold’s If/Then description names speech recognition, language processing and synthesized speech; its transcript presents an artwork’s dialogue. Real-time dialogue is reported by the artist and does not demonstrate conscious experience.

Feingold’s If/Then description names speech recognition, language processing and synthesized speech; its transcript presents an artwork’s dialogue. Real-time dialogue is reported by the artist and does not demonstrate conscious experience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vera Molnár

Vera Molnár used codified geometric forms and pre-established rules before her artistic algorithms became mechanical in 1968.

Stefano Mudu’s Biennale text distinguishes the rule-following Machines imaginaires from Computer Drawings made around 1970–1975.

In the latter, entered parameters govern varying segments, dots and shapes, placing human choices and machine execution in a shared compositional process.

Sources and details

Biennale Arte 2022 | Vera Molnár

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Stefano Mudu"
  ],
  "authors_in_source_order": [
    "Stefano Mudu"
  ],
  "dates": {
    "inspected_source_date_1": "2022 (Biennale)",
    "inspected_source_date_2": "c.1970–1975 (Computer Drawings)",
    "retrieved_utc": "2026-10-07T17:56:01.386308+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022 (Biennale)",
    "c.1970–1975 (Computer Drawings)"
  ],
  "id": "creative-person-coverage-de9e468c36d509::S1",
  "title": "Biennale Arte 2022 | Vera Molnár",
  "url": "https://www.labiennale.org/en/art/2022/milk-dreams/vera-moln%C3%A1r"
}

Stefano Mudu’s Biennale text distinguishes Molnár’s rule-following Machines imaginaires, mechanical algorithms from 1968 and circa 1970–1975 Computer Drawings. Curatorial historical account; no complete career or independent priority audit.

Stefano Mudu’s Biennale text distinguishes Molnár’s rule-following Machines imaginaires, mechanical algorithms from 1968 and circa 1970–1975 Computer Drawings. Curatorial historical account; no complete career or independent priority audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Manfred Mohr

Manfred Mohr’s Divisibility works derive shaped canvases and reliefs from geometric algorithms rather than fitting a composition inside a fixed rectangle.

In Divisibility I, separately rotated parts of a cube are projected into two dimensions, with outer lines determining shape and inner lines supplying signs.

His account traces related growth structures and later hypercube projections across 1980–1997, keeping each work phase’s dimensional procedure distinct.

Sources and details

Manfred Mohr - Themes / Ideas - Shaped Canvases and Reliefs Generated by an Algorithm - out-lines and in-lines (1980 - 1997)

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Manfred Mohr"
  ],
  "authors_in_source_order": [
    "Manfred Mohr"
  ],
  "dates": {
    "inspected_source_date_1": "1980–1997 (work phases)",
    "inspected_source_date_2": "2020 (copyright)",
    "retrieved_utc": "2026-10-07T17:55:32.327283+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1980–1997 (work phases)",
    "2020 (copyright)"
  ],
  "id": "creative-person-coverage-3bc262894286bd::S1",
  "title": "Manfred Mohr - Themes / Ideas - Shaped Canvases and Reliefs Generated by an Algorithm - out-lines and in-lines (1980 - 1997)",
  "url": "https://emohr.com/themes/shapeFromAlgorithm.html"
}

Mohr’s Themes / Ideas page describes distinct 1980–1997 Divisibility and hypercube work phases. Artist’s procedural account; cube cuts, growth algorithms and later dimensions remain separate, with no machine-learning capability inferred.

Mohr’s Themes / Ideas page describes distinct 1980–1997 Divisibility and hypercube work phases. Artist’s procedural account; cube cuts, growth algorithms and later dimensions remain separate, with no machine-learning capability inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lillian Schwartz

Lillian Schwartz combined coded black-and-white texture with hand-colored animation in the 1970 film Pixillation.

The Arkansas Museum of Fine Arts describes her editing of digital and analog shapes to make their colors alternate between contrast and correspondence.

Gershon Kingsley’s Moog soundtrack adds a changing tempo, making the film a collaboration in image and sound rather than a wholly computer-generated object.

Sources and details

Lillian Schwartz: Pixillation – Arkansas Museum of Fine Arts

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1970 (film)",
    "inspected_source_date_2": "2024-01-16–2024-06-23 (exhibition)",
    "retrieved_utc": "2026-10-07T17:55:28.225629+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1970 (film)",
    "2024-01-16–2024-06-23 (exhibition)"
  ],
  "id": "creative-person-coverage-49a3af9b938ce5::S1",
  "title": "Lillian Schwartz: Pixillation – Arkansas Museum of Fine Arts",
  "url": "https://arkmfa.org/art/exhibitions/lillian-schwartz-pixillation/"
}

The Arkansas Museum of Fine Arts’ 2024 Pixillation exhibition text describes Schwartz’s coded and hand-colored imagery and Gershon Kingsley’s soundtrack. Historical collaborative film account; exhibition dates are separate from the 1970 film.

The Arkansas Museum of Fine Arts’ 2024 Pixillation exhibition text describes Schwartz’s coded and hand-colored imagery and Gershon Kingsley’s soundtrack. Historical collaborative film account; exhibition dates are separate from the 1970 film.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David OReilly

David OReilly’s Everything turns objects from animals to galaxies into playable viewpoints within an interconnected simulated universe.

Its publisher describes a procedural, AI-driven experience without required goals, scores or tasks.

Players can move between scales or let the simulation proceed as a continuing documentary, with Alan Watts’s narration and Ben Lukas Boysen’s score shaping its reflective setting.

Sources and details

Everything | Double Fine Productions

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:53.621638+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-b10066a14d7eae::S1",
  "title": "Everything | Double Fine Productions",
  "url": "https://www.doublefine.com/games/everything"
}

Double Fine’s Everything synopsis describes a procedural simulation by David OReilly, narrated through Alan Watts’s philosophy with Ben Lukas Boysen’s score. Publisher’s game description; AI-driven simulation does not establish current model technology or physical universality.

Double Fine’s Everything synopsis describes a procedural simulation by David OReilly, narrated through Alan Watts’s philosophy with Ben Lukas Boysen’s score. Publisher’s game description; AI-driven simulation does not establish current model technology or physical universality.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Agnieszka Kurant

Agnieszka Kurant’s Crowd Crystal investigates collective agency through works involving people, materials and non-human systems.

The museum’s account describes Conversions using emotional dynamics from protesters’ social feeds to alter liquid-crystal paintings, while Adjacent Possible applies machine learning to archived Paleolithic signs.

The latter was developed with LeRon Shults and Justin Lane and imagines alternative forms of expression, rather than claiming to recover previously unknown historical symbols.

Sources and details

Agnieszka Kurant. Crowd Crystal - Castello di Rivoli

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Carolyn Christov-Bakargiev",
    "Marcella Beccaria"
  ],
  "authors_in_source_order": [
    "Carolyn Christov-Bakargiev",
    "Marcella Beccaria"
  ],
  "dates": {
    "inspected_source_date_1": "2021-11-04–2022-02-27 (exhibition)",
    "retrieved_utc": "2026-10-07T17:55:49.455477+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021-11-04–2022-02-27 (exhibition)"
  ],
  "id": "creative-person-coverage-a260c2f0f155f1::S1",
  "title": "Agnieszka Kurant. Crowd Crystal - Castello di Rivoli",
  "url": "https://www.castellodirivoli.org/en/comunicato/agnieszka-kurant-crowd-crystal/"
}

Castello di Rivoli’s Crowd Crystal exhibition account describes Conversions and Adjacent Possible and names LeRon Shults and Justin Lane. Reported art methods and imagined alternative signs; not recovered archaeological evidence or an independent model audit.

Castello di Rivoli’s Crowd Crystal exhibition account describes Conversions and Adjacent Possible and names LeRon Shults and Justin Lane. Reported art methods and imagined alternative signs; not recovered archaeological evidence or an independent model audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jake Elwes

Jake Elwes’s 2019 Zizi: Queering the Dataset intervenes in a face-generating model by adding 1,000 online images of drag and gender-fluid faces to its retraining.

The project page identifies the starting model as StyleGAN trained on FFHQ, making the intervention’s generative scope explicit.

The resulting multi-channel video uses shifting synthesized identities to question dataset norms and representation, rather than reporting a measured improvement in face recognition.

Sources and details

Jake Elwes - Zizi Queering the Dataset

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Jake Elwes"
  ],
  "authors_in_source_order": [
    "Jake Elwes"
  ],
  "dates": {
    "inspected_source_date_1": "2019 (work)",
    "retrieved_utc": "2026-10-07T17:56:00.435674+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 (work)"
  ],
  "id": "creative-person-coverage-b95a4c1eafc1df::S1",
  "title": "Jake Elwes - Zizi Queering the Dataset",
  "url": "https://www.jakeelwes.com/project-zizi-2019.html"
}

Elwes’s 2019 Zizi project page specifies a StyleGAN/FFHQ generative model retrained with 1,000 drag and gender-fluid face images. Artistic intervention and generated identities; no measured face-recognition or fairness improvement is asserted.

Elwes’s 2019 Zizi project page specifies a StyleGAN/FFHQ generative model retrained with 1,000 drag and gender-fluid face images. Artistic intervention and generated identities; no measured face-recognition or fairness improvement is asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

H. R. Giger

H. R. Giger’s official biography connects his airbrushed biomechanical imagery with the visual development of Alien.

It describes Necronomicon as an inspiration for Ridley Scott and credits Giger with designs for the creature’s life stages and extraterrestrial environments.

His later museum and bar interiors extend this visual language into built space, preserving a distinction between art and effects design and artificial intelligence research.

Sources and details

HRGiger.com - Museum

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2012-12-12 (biography update)",
    "inspected_source_date_2": "2014-05-12 (added death notice)",
    "retrieved_utc": "2026-10-07T17:55:54.633795+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2012-12-12 (biography update)",
    "2014-05-12 (added death notice)"
  ],
  "id": "creative-person-coverage-34c2fbdef5986e::S1",
  "title": "HRGiger.com - Museum",
  "url": "https://www.hrgiger.com/bio.htm"
}

Giger’s official biography connects his biomechanical art, Alien designs and built interiors. Attributed career account, not independent verification of influence or a complete effects-credit list; art and effects design are distinct from AI research.

Giger’s official biography connects his biomechanical art, Alien designs and built interiors. Attributed career account, not independent verification of influence or a complete effects-credit list; art and effects design are distinct from AI research.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stan Winston

Stan Winston’s practical dinosaur puppetry formed one part of Jurassic Park’s blend of physical and computer-generated effects.

ILM’s retrospective reports nine minutes of practical puppets alongside six minutes of CG dinosaurs in the final film.

It credits the combination with Spielberg’s direction and ILM’s digital work, preserving Winston’s practical contribution within a larger collaborative production.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "2015-07-09",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015-07-09"
  ],
  "id": "creative-person-coverage-d21a291d6ae2ed::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

ILM’s Jurassic Park retrospective credits Winston’s practical puppetry alongside Spielberg’s direction and ILM’s CG. Reported screen-time figures and collaborative roles are not independently measured or a claim of AI-generated creatures.

ILM’s Jurassic Park retrospective credits Winston’s practical puppetry alongside Spielberg’s direction and ILM’s CG. Reported screen-time figures and collaborative roles are not independently measured or a claim of AI-generated creatures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Phil Tippett

Phil Tippett and his team carried stop-motion experience into Jurassic Park after the production shifted toward CG dinosaurs.

ILM’s account assigns the motion-encoded armature idea to Tom St. Amand, working with its machine shop and research group.

The resulting bridge translated stop-motion movements into data for digital models, describing Tippett’s team contribution without attributing the device’s invention to him alone.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "2015-07-09",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015-07-09"
  ],
  "id": "creative-person-coverage-940d1050c478c5::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

ILM’s Jurassic Park retrospective describes Tippett’s team and specifically credits Tom St. Amand’s motion-encoded armature idea. Historical production account; the device’s invention is not assigned solely to Tippett and no machine-learning method is inferred.

ILM’s Jurassic Park retrospective describes Tippett’s team and specifically credits Tom St. Amand’s motion-encoded armature idea. Historical production account; the device’s invention is not assigned solely to Tippett and no machine-learning method is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dennis Muren

Dennis Muren served as visual effects supervisor as Jurassic Park moved from a stop-motion plan toward computer-generated dinosaurs.

ILM’s retrospective records his credit to animator Steve Williams and co-supervisor Mark Dippe for innovations demonstrated in the initial tests.

It situates his supervisory role within a production combining CG and practical puppetry, rather than making him the sole creator of its digital creatures.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "2015-07-09",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015-07-09"
  ],
  "id": "creative-person-coverage-c7f82528011b89::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

ILM’s Jurassic Park retrospective names Muren as visual-effects supervisor and preserves his credit to Steve Williams and Mark Dippe. Supervisory role within a collaborative CG/practical production; no sole-creator or AI-generation claim.

ILM’s Jurassic Park retrospective names Muren as visual-effects supervisor and preserves his credit to Steve Williams and Mark Dippe. Supervisory role within a collaborative CG/practical production; no sole-creator or AI-generation claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Debevec

Paul Debevec presented Light Stage 3 as a way to illuminate live actors with light derived from images of virtual or photographed environments.

The 2002 work used 156 RGB LEDs and paired lighting reproduction with infrared matting for composites.

The project page names Andreas Wenger, Chris Tchou, Andrew Gardner, Jamie Waese and Tim Hawkins as coauthors, and its 2022 update distinguishes this early system from later relighting and LED-stage research.

Sources and details

Light Stage 3: A Lighting Reproduction Approach to Live-Action Compositing

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Paul Debevec",
    "Andreas Wenger",
    "Chris Tchou",
    "Andrew Gardner",
    "Jamie Waese",
    "Tim Hawkins"
  ],
  "authors_in_source_order": [
    "Paul Debevec",
    "Andreas Wenger",
    "Chris Tchou",
    "Andrew Gardner",
    "Jamie Waese",
    "Tim Hawkins"
  ],
  "dates": {
    "inspected_source_date_1": "2002-07-26 (talk)",
    "inspected_source_date_2": "2022-01-27 (page update)",
    "retrieved_utc": "2026-10-07T17:55:24.691254+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2002-07-26 (talk)",
    "2022-01-27 (page update)"
  ],
  "id": "creative-person-coverage-0d33198a21720b::S1",
  "title": "Light Stage 3: A Lighting Reproduction Approach to Live-Action Compositing",
  "url": "https://www.pauldebevec.com/Research/LS3/"
}

Debevec’s Light Stage 3 page combines the 2002 presentation and transcript with a 2022 update and ordered coauthor credits. Image-based lighting and infrared matting are reported methods, not independently reproduced or conflated with later LED-stage systems.

Debevec’s Light Stage 3 page combines the 2002 presentation and transcript with a 2022 update and ordered coauthor credits. Image-based lighting and infrared matting are reported methods, not independently reproduced or conflated with later LED-stage systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Perlin

Ken Perlin developed Perlin Noise to produce natural-looking textures on computer-generated surfaces for visual effects.

His award page reproduces the 1997 Technical Achievement citation and demonstrates procedural imagery that can suggest flame, marble and other materials without corresponding geometric models.

The page also provides original C code and points to improved noise work, separating the early implementation from later refinements.

Sources and details

Ken's Academy Award

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Ken Perlin"
  ],
  "authors_in_source_order": [
    "Ken Perlin"
  ],
  "dates": {
    "inspected_source_date_1": "1997 (award)",
    "retrieved_utc": "2026-10-07T17:55:31.114610+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1997 (award)"
  ],
  "id": "creative-person-coverage-9281796f038c14::S1",
  "title": "Ken's Academy Award",
  "url": "https://cs.nyu.edu/~perlin/doc/oscar"
}

Perlin’s Noise and Turbulence page reproduces his 1997 award citation and illustrates procedural textures. Original code and later improvements are distinct; the demonstrations are not rerun or evidence of machine-learning generation.

Perlin’s Noise and Turbulence page reproduces his 1997 award citation and illustrates procedural textures. Original code and later improvements are distinct; the demonstrations are not rerun or evidence of machine-learning generation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alvy Ray Smith

Alvy Ray Smith’s account of the alpha channel describes storing opacity with color so a rendered foreground can be composited over different backgrounds without rendering it again.

He credits the integral alpha invention jointly with Ed Catmull in 1977 and describes his own work extending image storage and restoration to RGBA.

The page separately credits Porter and Duff’s 1984 treatment of premultiplied alpha and records a shared 1996 Academy award, preserving these related but distinct contributions.

Sources and details

Alvy First Academy Award

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [
    "Alvy Ray Smith"
  ],
  "authors_in_source_order": [
    "Alvy Ray Smith"
  ],
  "dates": {
    "inspected_source_date_1": "1996-01-02 (essay)",
    "inspected_source_date_2": "1996-03-02 (award)",
    "retrieved_utc": "2026-10-07T17:55:48.890763+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1996-01-02 (essay)",
    "1996-03-02 (award)"
  ],
  "id": "creative-person-coverage-b3e66d2a1256fa::S1",
  "title": "Alvy First Academy Award",
  "url": "https://www.alvyray.com/Awards/AwardsAcademy96.htm"
}

Smith’s January 1996 alpha-channel account credits integral alpha jointly with Catmull in 1977 and premultiplied alpha to Porter and Duff in 1984. Attributed historical account and shared award; no independent priority or implementation audit.

Smith’s January 1996 alpha-channel account credits integral alpha jointly with Catmull in 1977 and premultiplied alpha to Porter and Duff in 1984. Attributed historical account and shared award; no independent priority or implementation audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steven Spielberg

Steven Spielberg directed and wrote the screenplay for A.I. Artificial Intelligence after Stanley Kubrick’s death.

Amblin’s production account traces Kubrick’s earlier development and retains Ian Watson’s screen-story and Brian Aldiss’s source-story credits.

The film follows a robotic child programmed to love whose search for belonging makes emotional attachment a fictional test of human–machine boundaries.

Sources and details

A.I. Artificial Intelligence (2001) - About the Movie | Amblin

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2001 (film listing)",
    "retrieved_utc": "2026-10-07T17:55:27.322065+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2001 (film listing)"
  ],
  "id": "creative-person-coverage-4d202c84381caf::S1",
  "title": "A.I. Artificial Intelligence (2001) - About the Movie | Amblin",
  "url": "https://amblin.com/movie/a-i-artificial-intelligence/"
}

Amblin’s A.I. Artificial Intelligence production account distinguishes Spielberg’s directing/screenplay from Kubrick’s development, Watson’s screen story and Aldiss’s source story. Robotic love is fictional; no implemented conscious child or complete production audit.

Amblin’s A.I. Artificial Intelligence production account distinguishes Spielberg’s directing/screenplay from Kubrick’s development, Watson’s screen story and Aldiss’s source story. Robotic love is fictional; no implemented conscious child or complete production audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Garland

Alex Garland wrote and directed Ex Machina, his 2015 directorial debut.

A24’s synopsis places a programmer inside an isolated test of Ava, an artificial intelligence whose emotional behavior complicates his judgments of her capabilities and consciousness.

The film uses this controlled encounter as a thriller about assessment and deception, rather than evidence of an implemented conscious machine.

Sources and details

Ex Machina | A24

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2015 (film)",
    "retrieved_utc": "2026-10-07T17:55:03.689815+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015 (film)"
  ],
  "id": "creative-person-alexgarland::S1",
  "title": "Ex Machina | A24",
  "url": "https://a24films.com/films/ex-machina"
}

A24’s 2015 Ex Machina page credits Garland’s writing and direction and describes Ava’s fictional assessment. Studio synopsis and bounded thematic reading; no real Turing-test evaluation or implemented machine consciousness.

A24’s 2015 Ex Machina page credits Garland’s writing and direction and describes Ava’s fictional assessment. Studio synopsis and bounded thematic reading; no real Turing-test evaluation or implemented machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Spike Jonze

Spike Jonze wrote and directed Her, a story about intimacy between a human letter writer and an advanced operating system.

Annapurna’s synopsis follows Theodore and the voice called Samantha as friendship develops into love and their desires evolve together.

The relationship is a fictional exploration of attachment to software, with Scarlett Johansson providing Samantha’s voice rather than creating a real conversational system.

Sources and details

Her

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:19.819036+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-spikejonze::S1",
  "title": "Her",
  "url": "https://www.annapurna.com/film/her"
}

Annapurna’s Her synopsis and credits name Jonze as writer/director and Johansson as Samantha’s performer. Fictional attachment to an operating system; the performer is not a conversational-system designer.

Annapurna’s Her synopsis and credits name Jonze as writer/director and Johansson as Samantha’s performer. Fictional attachment to an operating system; the performer is not a conversational-system designer.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Verhoeven

Paul Verhoeven directed the 1987 RoboCop, placing a critically injured Detroit officer inside a corporate transformation into a part-human policing machine.

The studio record credits Edward Neumeier and Michael Miner with the screenplay and Arne L. Schmidt as producer.

This establishes Verhoeven’s direction of a fictional cyborg narrative while retaining the separate writing and production roles.

Sources and details

RoboCop | 20th Century Studios

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1987-07-17 (release)",
    "retrieved_utc": "2026-10-07T17:55:19.791392+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1987-07-17 (release)"
  ],
  "id": "creative-person-coverage-504cc511ddf324::S1",
  "title": "RoboCop | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/robocop"
}

The studio’s 1987 RoboCop record separates Verhoeven’s direction, Neumeier and Miner’s screenplay and Schmidt’s production. Fictional cyborg premise and credited roles; no real policing-system capability or complete production-credit audit.

The studio’s 1987 RoboCop record separates Verhoeven’s direction, Neumeier and Miner’s screenplay and Schmidt’s production. Fictional cyborg premise and credited roles; no real policing-system capability or complete production-credit audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neill Blomkamp

Neill Blomkamp was announced as director, co-writer with Terri Tatchell and producer with Simon Kinberg when Chappie began production in October 2013.

Sony’s release describes a gifted robot adopted into a dysfunctional family after being kidnapped.

The announcement frames artificial life through a fictional upbringing and records planned production roles, rather than documenting a real robot’s development or a later finished-film assessment.

Sources and details

Sony Pictures Entertainment And Mrc Announce Start Of Production On "Chappie" | Sony Pictures Entertainment

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2013-10-28 (announcement)",
    "retrieved_utc": "2026-10-07T17:56:09.243088+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2013-10-28 (announcement)"
  ],
  "id": "creative-person-coverage-4efb488aec827f::S1",
  "title": "Sony Pictures Entertainment And Mrc Announce Start Of Production On \"Chappie\" | Sony Pictures Entertainment",
  "url": "https://www.sonypictures.com/corp/press_releases/2013/10_13/102813_chappie.html"
}

Sony’s October 2013 Chappie announcement records planned directing, co-writing and production roles at the start of filming. Fictional robot upbringing; it is not a finished-film assessment or evidence of actual robot development.

Sony’s October 2013 Chappie announcement records planned directing, co-writing and production roles at the start of filming. Fictional robot upbringing; it is not a finished-film assessment or evidence of actual robot development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Carpenter

John Carpenter directed, produced and composed music for Dark Star, sharing screenplay credit with Dan O’Bannon.

His official synopsis describes a damaged ship computer and a bomb that receives a lesson in phenomenology before reaching a disastrous conclusion.

The 1974 science-fiction comedy turns machine reasoning into a narrative predicament, keeping the speaking bomb’s theological claim inside the fiction.

Sources and details

Dark Star – The Official John Carpenter

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1974-04 (release)",
    "retrieved_utc": "2026-10-07T17:55:44.668349+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1974-04 (release)"
  ],
  "id": "creative-person-coverage-416d1fe9d66826::S1",
  "title": "Dark Star – The Official John Carpenter",
  "url": "https://theofficialjohncarpenter.com/dark-star/"
}

Carpenter’s official Dark Star page lists the April 1974 release and separate directing, production, music and shared screenplay credits. The bomb’s phenomenology and theological conclusion remain fictional dialogue.

Carpenter’s official Dark Star page lists the April 1974 release and separate directing, production, music and shared screenplay credits. The bomb’s phenomenology and theological conclusion remain fictional dialogue.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Crichton

Michael Crichton wrote and directed the 1973 Westworld, about a robot-populated resort whose programming failure turns a vacation into a pursuit.

In an account reproduced by his official site, he describes seeking computer processing to give the gunslinger’s viewpoint a mechanical appearance.

He assigns the image-processing work to John Whitney Jr., distinguishing his creative request from the technical labor and the film from the later television adaptation.

Sources and details

Westworld - Michael Crichton

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1973-11-21 (release)",
    "retrieved_utc": "2026-10-07T17:55:36.533263+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1973-11-21 (release)"
  ],
  "id": "creative-person-coverage-8f3fa6211d0fe7::S1",
  "title": "Westworld - Michael Crichton",
  "url": "https://michaelcrichton.com/works/westworld/"
}

Crichton’s official Westworld page reproduces his account of requesting computer-processed images and John Whitney Jr.’s technical work. Historical recollection and 1973 film synopsis; priority claims and later television adaptation are not adopted.

Crichton’s official Westworld page reproduces his account of requesting computer-processed images and John Whitney Jr.’s technical work. Historical recollection and 1973 film synopsis; priority claims and later television adaptation are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Glazer

Jonathan Glazer wrote and directed Under the Skin, which A24 lists as a 2014 adaptation of Michel Faber’s novel.

Its synopsis describes an unknown woman luring men into an otherworldly space before becoming entangled in human experience herself.

This contribution concerns an alien viewpoint and the boundaries of humanity in fiction, rather than a depiction or implementation of an AI system.

Sources and details

Under the Skin | A24

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2014 (listing)",
    "retrieved_utc": "2026-10-07T17:55:27.291566+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014 (listing)"
  ],
  "id": "creative-person-coverage-a145326916355b::S1",
  "title": "Under the Skin | A24",
  "url": "https://a24films.com/films/under-the-skin"
}

A24’s 2014 Under the Skin page lists Glazer’s writing/direction and Michel Faber’s source novel. Bounded fictional alien viewpoint and thematic interpretation; no AI implementation or complete adaptation-credit audit.

A24’s 2014 Under the Skin page lists Glazer’s writing/direction and Michel Faber’s source novel. Bounded fictional alien viewpoint and thematic interpretation; no AI implementation or complete adaptation-credit audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gareth Edwards

Gareth Edwards directed The Creator and co-wrote its screenplay with Chris Weitz from his own story.

In the production notes, he describes AI as a starting metaphor for people treated as enemies, then explores the moral questions raised by apparently human-like machines.

His account of filming real locations before designing science-fiction additions links the imagined war to a concrete effects workflow, without presenting the film’s conscious robots as actual technology.

Sources and details

The Creator production notes

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:13.581745+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-215b11c2ca9f81::S1",
  "title": "The Creator production notes",
  "url": "https://lumiere-a.akamaihd.net/v1/documents/the_creator_final_production_notes_bios_7962bbd8.pdf"
}

The Creator production-notes PDF, pages 1 and 4–6, preserves Edwards/Weitz screenplay roles and Edwards’s attributed location-first workflow and metaphor. Promotional production account and fictional AI dilemmas; no actual conscious-robot capability is established.

The Creator production-notes PDF, pages 1 and 4–6, preserves Edwards/Weitz screenplay roles and Edwards’s attributed location-first workflow and metaphor. Promotional production account and fictional AI dilemmas; no actual conscious-robot capability is established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ben Affleck

Ben Affleck founded InterPositive to develop filmmaking tools around production workflows, according to Netflix’s March 2026 acquisition announcement.

In his statement, he describes filming a proprietary soundstage dataset with a small team and training models for visual logic, editorial consistency and corrections such as lighting or backgrounds.

He distinguishes these tools’ focus on filmmaking techniques from performances and frames artistic control as a design goal, while the announcement records his move to a senior advisory role.

Sources and details

Innovation for Filmmaking, By Filmmakers: Why InterPositive Is Joining Netflix - About Netflix

{
  "access_scope": "Draft bounded to the inspected cached source and named project; not independent review or source admission. Fictional narratives, artist interpretations, historical versions, proposals and collaborative credits remain explicitly distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2026-03-05 (announcement)",
    "retrieved_utc": "2026-10-07T17:55:27.321373+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-03-05 (announcement)"
  ],
  "id": "creative-person-coverage-7b34cfd709076c::S1",
  "title": "Innovation for Filmmaking, By Filmmakers: Why InterPositive Is Joining Netflix -  About Netflix",
  "url": "https://about.netflix.com/en/news/why-interpositive-is-joining-netflix"
}

Netflix’s March 2026 InterPositive acquisition announcement and Affleck’s statement describe proprietary filming data and intended production tools. Corporate/designer claims, not independently tested models; performances are distinguished from techniques and advisory roles from tool efficacy.

Netflix’s March 2026 InterPositive acquisition announcement and Affleck’s statement describe proprietary filming data and intended production tools. Corporate/designer claims, not independently tested models; performances are distinguished from techniques and advisory roles from tool efficacy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Abnormal AI

Abnormal Security's November 2019 launch release describes email protection built from employee and third-party identity profiles, communication relationships, and message content.

Its relationship graph examines communication cadence, topics, tone, and frequency, while content analysis uses language processing and computer vision to interpret messages.

The release describes API integration with Office 365 and G Suite outside the email delivery path, including visibility into internal mail.

Sources and details

Abnormal Security Launches with $24M Series A Funding from Greylock to Protect Enterprises from Targeted Email Attacks | Newsroom | Abnormal AI

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Historical 2019 Abnormal Security manifestation; baseline Abnormal AI identity is not established by this source alone.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateline": "2019-11-19",
    "page_release_date": "2019-11-20",
    "retrieved_utc": "2026-10-07T17:58:52.883515+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "page_release_date",
      "value": "2019-11-20"
    },
    {
      "role": "dateline",
      "value": "2019-11-19"
    }
  ],
  "id": "organization-company-5fc836e7060189::S1",
  "title": "Abnormal Security Launches with $24M Series A Funding from Greylock to Protect Enterprises from Targeted Email Attacks | Newsroom | Abnormal AI",
  "url": "https://abnormal.ai/newsroom/press-releases/launching-24m-series-a-funding-from-greylock"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Historical 2019 Abnormal Security manifestation; baseline Abnormal AI identity is not established by this source alone.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Historical 2019 Abnormal Security manifestation; baseline Abnormal AI identity is not established by this source alone.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Contemporaneous launch release and founder biography date founding to 2018; returned to Abnormal AI name in April 2025.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://abnormal.ai/newsroom/press-releases/launching-24m-series-a-funding-from-greylock",
        "https://abnormal.ai/newsroom/press-releases/announcing-abnormal-ai",
        "https://abnormal.ai/about/team/evan-reiser",
        "https://abnormal.ai/blog/announcing-abnormal-ai"
      ],
      "year": 2018
    }
  ]
}

Abridge

Abridge's May 2020 release describes a UPMC telehealth collaboration that records consenting patient–physician calls and creates summaries of medically relevant sections.

Clinical language processing highlights medical terms and next steps, and patients receive a text message directing them to a summary in the Abridge app.

The release distinguishes telephone visits through an enabled phone number from in-person or video visits recorded with the app, and describes electronic health record integration as a future plan.

Sources and details

New Telehealth Solution Helps UPMC Patients Capture Details of Doctor Visits

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release_date": "2020-05-20",
    "retrieved_utc": "2026-10-07T18:00:26.205746+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "release_date",
      "value": "2020-05-20"
    }
  ],
  "id": "organization-company-7d752a76e4beb4::S1",
  "title": "New Telehealth Solution Helps UPMC Patients Capture Details of Doctor Visits",
  "url": "https://www.abridge.com/press-release/new-telehealth-solution-helps-upmc-patients-capture-details-of-doctor-visits"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.abridge.com/press-release/new-telehealth-solution-helps-upmc-patients-capture-details-of-doctor-visits",
        "https://www.abridge.com/press-release/abridge-integrates-nejm-jama"
      ],
      "year": 2018
    }
  ]
}

Agility Robotics

Agility Robotics' October 2020 release presents Digit as a humanoid robot combining legged mobility with manipulation for work in spaces designed for people.

The company describes handling uneven indoor and outdoor terrain and moving boxes from a floor to a shelf.

Its deployment focus in the release is repetitive, physically demanding work for logistics providers and retailers, rather than requiring facilities built specifically for robots.

Sources and details

Agility Robotics Raises $20 Million | Agility

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "2020-10-15",
    "retrieved_utc": "2026-10-07T18:00:28.156792+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "published",
      "value": "2020-10-15"
    }
  ],
  "id": "organization-company-c9d5f6cb2c82ff::S1",
  "title": "Agility Robotics Raises $20 Million | Agility",
  "url": "https://www.agilityrobotics.com/content/agility-robotics-raises-20-million"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founded from Oregon State Dynamic Robotics Lab in 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.agilityrobotics.com/company-overview",
        "https://www.agilityrobotics.com/content/agility-robotics-raises-20-million"
      ],
      "year": 2015
    }
  ]
}

Alibaba Cloud

Alibaba Cloud's cached Model Studio documentation identifies text-embedding-v4 as a multilingual text vector model based on Qwen3 and developed by Tongyi Lab.

The page lists retrieval, clustering, and classification as application areas and allows vector dimensions from 64 to 2048.

It identifies Alibaba Cloud Model Studio as the inference provider and presents separate capability and service tables for Beijing, Singapore, and Hong Kong.

Sources and details

text-embedding-v4 Model Info - Alibaba Cloud Model Studio - Alibaba Cloud Documentation Center

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:29.040573+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-dd325ff034ce2a::S1",
  "title": "text-embedding-v4 Model Info - Alibaba Cloud Model Studio - Alibaba Cloud Documentation Center",
  "url": "https://www.alibabacloud.com/help/en/model-studio/text-embedding-v4"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Alibaba Cloud established September 2009; Tongyi Lab unit formation and Qwen model launch are separate dates.",
      "date": "2009",
      "kind": "business_unit_establishment",
      "qualified": false,
      "source_urls": [
        "https://www.alizila.com/alibaba-cloud-expands-data-center-network-and-global-gen-ai-offerings/",
        "https://www.alibabagroup.com/en-US/document-1491556654565556224",
        "https://www.alibabacloud.com/en/campaign/cloudsummithk2025?_p_lc=2",
        "https://www.alibabacloud.com/help/en/model-studio/text-embedding-v4",
        "https://www.alibabagroup.com/en-US/document-1773855135127044096"
      ],
      "year": 2009
    }
  ]
}

Beautiful.ai

Beautiful.ai's cached company page describes presentation software that embeds design choices into the authoring tool.

The product suggests ways to visualize ideas and adjusts slide layouts as content changes.

The company frames customization and automatic layout as ways to reduce the manual positioning work that otherwise competes with preparing a presentation.

Sources and details

About Us | Beautiful.ai

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:31.496427+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-7c03f44d55084a::S1",
  "title": "About Us | Beautiful.ai",
  "url": "https://www.beautiful.ai/about"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

BentoML

Tim Liu's July 2022 BentoML 1.0 announcement describes an open-source framework for taking trained machine learning models into real-time serving applications.

Its Runner abstraction parallelizes inference, applies adaptive batching, and lets model computation scale separately from preprocessing and business logic.

The release also introduces standardized model packaging and integration with the then-beta Yatai platform for deploying and managing model services on Kubernetes.

Sources and details

Introducing BentoML 1.0

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [
    "Tim Liu"
  ],
  "authors_in_source_order": [
    "Tim Liu"
  ],
  "dates": {
    "last_updated": "2022-07-12",
    "retrieved_utc": "2026-10-07T18:00:34.329136+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "last_updated",
      "value": "2022-07-12"
    }
  ],
  "id": "organization-company-5a8a3b3a166d93::S1",
  "title": "Introducing BentoML 1.0",
  "url": "https://www.bentoml.com/blog/introducing-bentoml-10"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Verified 2019 open-source project release. Corporate founding is also commonly dated 2019, but the inspected primary retrospective establishes the project milestone, not incorporation.",
      "date": "2019",
      "kind": "open_source_project_origin",
      "qualified": true,
      "source_urls": [
        "https://www.bentoml.com/blog/bentoml-is-joining-modular",
        "https://www.bentoml.com/blog/introducing-bentoml-10",
        "https://github.com/yubozhao",
        "https://www.evidentlyai.com/blog/ama-bozhao-yu-sean-sheng",
        "https://www.modular.com/blog/bentoml-joins-modular"
      ],
      "year": 2019
    }
  ]
}

BigBear.ai

BigBear.ai's cached company profile describes decision intelligence aimed at supply chains and logistics, autonomous systems, and cybersecurity.

The profile frames its software as organizing complex data, identifying blind spots, and constructing predictive scenarios for decision makers.

It names public-sector customers alongside manufacturing, warehouse, distribution, healthcare, and life-sciences operations as audiences for those systems.

Sources and details

Company Information :: BigBear.ai Holdings, Inc. (BBAI)

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:59.513891+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-fc500f0730f323::S1",
  "title": "Company Information :: BigBear.ai Holdings, Inc. (BBAI)",
  "url": "https://ir.bigbear.ai/company-information"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "SEC filing dates AE Industrial acquisition-vehicle formation to May 22, 2020; predecessor companies are older and the 2021 SPAC transaction is a separate event.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.bigbear.ai/sec-filings/all-sec-filings/content/0001193125-22-030676/0001193125-22-030676.pdf",
        "https://ir.bigbear.ai/company-information",
        "https://ir.bigbear.ai/sec-filings/all-sec-filings/content/0001836981-26-000018/bbai-20251231.htm"
      ],
      "year": 2020
    }
  ]
}

Blaize

Blaize's cached company page describes an AI computing approach that combines silicon and software across edge and core workloads.

It names Pathfinder and Xplorer hardware platforms alongside the Blaize AI Software Suite as its initial products.

The page links its Graph Streaming Processor to programmable graph computing for the data structures used in edge computing, IoT, and AI.

Sources and details

AI Edge Company - Artificial Intelligence Software Company - Blaize

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:03.910471+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-387ac099360b64::S1",
  "title": "AI Edge Company - Artificial Intelligence Software Company - Blaize",
  "url": "https://www.blaize.com/company/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Operating company incorporated February 16, 2010 as ThinCI, Inc.; renamed Blaize, Inc. on October 17, 2019. Current listed holding company has separate SPAC lineage.",
      "date": "2010",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.blaize.com/company/",
        "https://ir.blaize.com/static-files/655543c0-39dc-453e-b057-1fe2aab15859"
      ],
      "year": 2010
    }
  ]
}

Butterfly Network

Butterfly Network's cached SDK release describes opening its handheld ultrasound platform to third-party AI developers, medical device companies, and telemedicine providers.

The proposed applications include image acquisition assistance, automatic measurements, training tools, and integration with augmented reality or robotics.

The release distinguishes the SDK being offered from the planned Butterfly Garden marketplace, where users would discover and purchase resulting applications.

Sources and details

Butterfly launches “Butterfly Garden” AI Marketplace for custom AI apps

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:34.810243+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-3f0cf1d81b2e50::S1",
  "title": "Butterfly launches “Butterfly Garden” AI Marketplace for custom AI apps",
  "url": "https://www.butterflynetwork.com/press-releases/butterfly-network-launches-butterfly-garden-ai-marketplace-for-custom-ai-applications"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.butterflynetwork.com/press-releases/butterfly-network-launches-butterfly-iq-vet-bringing-groundbreaking-ultrasound-technology-to-animal-care",
        "https://www.butterflynetwork.com/press-releases/butterfly-network-launches-butterfly-garden-ai-marketplace-for-custom-ai-applications"
      ],
      "year": 2011
    }
  ]
}

C3 AI

C3 AI's cached company page describes a platform and prebuilt applications that combine enterprise data, intelligent agents, and domain-specific models.

The company frames those tools around converting operational signals into business decisions.

Its Strategic Integrator Program lets integrators license the platform to build and resell their own enterprise applications with intellectual-property rights described by the page.

Sources and details

About C3 AI: Enterprise AI Software and Applications

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:35.723928+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-8e22e94dbdb4eb::S1",
  "title": "About C3 AI: Enterprise AI Software and Applications",
  "url": "https://www.c3.ai/company"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder shareholder letter dates the original C3 business to January 2009; later AI branding does not reset founding year.",
      "date": "2009",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.c3.ai/company",
        "https://ir.c3.ai/static-files/25550b3b-3619-46c2-96fa-0c048a77e169",
        "https://ir.c3.ai/static-files/4b360b2f-3f20-4c0a-b4b7-ce3c130011f7?utmContent=NULL&utmMedium=NULL&utmSource=google&utmTerm=NULL"
      ],
      "year": 2009
    }
  ]
}

CENTURY Tech

CENTURY's cached company page describes an educational technology team combining teachers, neuroscientists, and technologists.

The company says its learning tools draw on learning science, AI, and neuroscience to support teachers and learners.

The page also describes global education partnerships and points to adaptive homework through its Smart Assignments feature.

Sources and details

Learn about CENTURY | Online Learning | Primary, Secondary and FE

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:34.168378+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-e410dc77ee6ef0::S1",
  "title": "Learn about CENTURY | Online Learning | Primary, Secondary and FE",
  "url": "https://www.century.tech/about-us/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded in 2013 per official founder biography and incorporated April 10, 2013 per Companies House.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.century.tech/about-us/",
        "https://find-and-update.company-information.service.gov.uk/company/08482934"
      ],
      "year": 2013
    }
  ]
}

Cervest

Cervest's May 2021 release describes EarthScan as an asset-level climate-risk product combining public and private data with machine learning and statistical methods.

It proposes current, historical, and predictive views of overlapping hazards such as flooding, drought, and extreme temperatures.

The release frames these assessments as inputs to business decisions, resilience planning, and climate-related disclosures, with free standardized assessments planned under a freemium model.

Sources and details

Cervest Raises $30M | Cervest

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateline": "2021-05-20",
    "retrieved_utc": "2026-10-07T17:58:58.472259+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "dateline",
      "value": "2021-05-20"
    }
  ],
  "id": "organization-company-4eee199e2b4f4e::S1",
  "title": "Cervest Raises $30M | Cervest",
  "url": "https://cervest.earth/news/cervest-raises-30m-series-a-round-to-lead-new-40-billion-climate-intelligence-market"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Administrator statement dates founding to 2015; company ceased trading in 2023.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://cervest.earth/news/cervest-raises-30m-series-a-round-to-lead-new-40-billion-climate-intelligence-market",
        "https://interpath.com/media-hub/articles/administrators-appointed-to-cervest-limited/"
      ],
      "year": 2015
    }
  ]
}

Chroma

Chroma's cached homepage describes open-source search infrastructure supporting vector, lexical, full-text, regular-expression, and metadata queries.

Its architecture places vectors, metadata, and indexes in object storage with memory and SSD caching for queries.

The page offers both local open-source deployment and a managed cloud service, and describes collection forking for dataset versioning and experiments.

Sources and details

Chroma - open-source search infrastructure for AI

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:55.510908+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-e83fa5da7e2e72::S1",
  "title": "Chroma - open-source search infrastructure for AI",
  "url": "https://www.trychroma.com/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founding year stated by investor Quiet's portfolio job board; company's own seed post confirms a May 2022 pre-seed. Exact incorporation date not established.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.trychroma.com/",
        "https://www.trychroma.com/blog/seed",
        "https://careers.quiet.com/companies/chroma-2",
        "https://www.ia40.com/blog-podcast/chroma",
        "https://thursdaynightsinai.substack.com/p/last-event-of-the-year-this-thurs"
      ],
      "year": 2022
    }
  ]
}

Cognition

Cognition's cached homepage describes Devin as an agent that plans, writes, tests, and ships code within a team's existing codebase and tools.

The company positions this workflow as allowing engineers to concentrate on architecture and problem solving while agents handle repetitive implementation work.

The page separately describes FrontierCode as a benchmark assessing whether maintainers would merge code, using rubrics, verifiers, and tests for scope, quality, style, and repository standards.

Sources and details

Cognition

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:50.494679+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-f5ec0afdb554a3::S1",
  "title": "Cognition",
  "url": "https://cognition.com/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Credo AI

Credo AI's cached company page presents AI governance as the focus of its enterprise platform.

Its stated design goals include auditability, fairness, security, and human-centered use of AI.

The page identifies an AI registry, vendor portal, risk center, regulation automation, and advisory services as parts of the offering.

Sources and details

Credo AI - The Leader in Responsible AI - Company

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:37.475508+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-c173e537481a7b::S1",
  "title": "Credo AI - The Leader in Responsible AI - Company",
  "url": "https://www.credo.ai/company/aboutus"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder announcement gives March 2020.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.credo.ai/company/aboutus",
        "https://www.credo.ai/news/credo-ai-announces-12-8-million-series-a-funding-round-for-responsible-ai",
        "https://blog.mozilla.org/en/mozilla/ai/columbia-convening-research-agenda/"
      ],
      "year": 2020
    }
  ]
}

CrowdStrike

CrowdStrike's cached Falcon page describes a unified security platform combining telemetry, adversary intelligence, AI, and automation.

The company describes a lightweight sensor feeding a shared data foundation across security domains, supplemented by analysts and threat hunters.

The page groups endpoint, identity, cloud, SaaS, and AI security with security operations tools, including incident-response orchestration and data pipeline management.

Sources and details

The CrowdStrike Falcon® Platform | Unified Agentic Security

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:38.781815+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-b169fe25e455f1::S1",
  "title": "The CrowdStrike Falcon® Platform | Unified Agentic Security",
  "url": "https://www.crowdstrike.com/en-us/platform/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder retrospective says company started in 2011; public stealth-mode launch announcement was 2012-02-21.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.crowdstrike.com/en-us/blog/crowdstrike-launch/",
        "https://www.crowdstrike.com/en-us/blog/crowdstrike-celebrates-ipo/",
        "https://www.crowdstrike.com/en-us/about-us/executive-team/george-kurtz/",
        "https://www.crowdstrike.com/en-us/platform/"
      ],
      "year": 2011
    }
  ]
}

D-ID

D-ID's cached company page describes multilingual avatar videos and interactive visual agents for organizational communication.

Its studio, API, and integrations combine generative models, avatar animation, narration, and multilingual output for video creation.

The page distinguishes these generated videos from real-time agents that add speech, conversational interaction, and task execution for support, training, and customer experiences.

Sources and details

About D-ID Future-Facing Generative AI Technology | D-ID AI Video

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:39.898733+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-9dea97285d086d::S1",
  "title": "About D-ID Future-Facing Generative AI Technology | D-ID AI Video",
  "url": "https://www.d-id.com/about-us"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company reference states 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.d-id.com/wp-content/uploads/2021/03/bio.pdf",
        "https://www.d-id.com/ai-info/",
        "https://www.d-id.com/about-us"
      ],
      "year": 2017
    }
  ]
}

Darktrace

Darktrace's cached company page describes security AI that learns patterns within an organization's digital environment.

The company presents its ActiveAI platform as combining security-posture visibility, detection, and autonomous response.

Its stated coverage spans cloud, email, identities, operational technology, endpoints, and networks, with research centers in Cambridge and The Hague.

Sources and details

Top AI Cyber Security Company | About Darktrace

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:44.466330+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-c2ba4861665797::S1",
  "title": "Top AI Cyber Security Company | About Darktrace",
  "url": "https://www.darktrace.com/company"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company page and founder biography date founding to 2013.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.darktrace.com/company",
        "https://www.darktrace.com/news/poppy-gustafsson-to-step-down-as-ceo-of-darktrace-jill-popelka-appointed-successor",
        "https://www.darktrace.com/people/nicole-eagan",
        "https://www.1011vc.com/team/dave-palmer",
        "https://www.thomabravo.com/press-releases/thoma-bravo-announces-a-cash-offer-to-acquire-cybersecurity-leader-darktrace",
        "https://www.thomabravo.com/press-releases/thoma-bravo-completes-acquisition-of-darktrace"
      ],
      "year": 2013
    }
  ]
}

Dataminr

In his March 2021 financing essay, Ted Bailey describes Dataminr as discovering breaking events from real-time public data.

He links the platform's inputs to text, images, video, audio, and sensor signals generated across digital services.

The essay places public-sector organizations, corporations, and newsrooms among the users of this event-discovery approach.

Sources and details

Founder & CEO Ted Bailey on $475M Growth Financing | Dataminr

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [
    "Ted Bailey"
  ],
  "authors_in_source_order": [
    "Ted Bailey"
  ],
  "dates": {
    "published": "2021-03-23",
    "retrieved_utc": "2026-10-07T17:58:12.086402+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "published",
      "value": "2021-03-23"
    }
  ],
  "id": "organization-company-0839ffe9ae0dbb::S1",
  "title": "Founder & CEO Ted Bailey on $475M Growth Financing | Dataminr",
  "url": "https://www.dataminr.com/resources/blog/dataminr-founder-and-ceo-ted-bailey-on-the-companys-475m-growth-capital-round/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2009",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.dataminr.com/resources/blog/dataminr-founder-and-ceo-ted-bailey-on-the-companys-475m-growth-capital-round/",
        "https://www.dataminr.com/press/dataminr-ranked-number-5-on-the-forbes-ai-50-list/"
      ],
      "year": 2009
    }
  ]
}

DataRobot

DataRobot's cached company page describes a progression from automated machine learning and model operations toward enterprise agentic AI.

The company presents its platform as supporting the building, operation, and governance of agents in production.

Its stated audiences include regulated enterprises in manufacturing, energy, public services, life sciences, insurance, and financial services.

Sources and details

About DataRobot

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:12.981669+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-1110be1e7fefa3::S1",
  "title": "About DataRobot",
  "url": "https://www.datarobot.com/about-us/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company history states 2012.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.datarobot.com/newsroom/press/machine-learning-company-datarobot-accelerates-growth-33-million-new-funding/",
        "https://www.datarobot.com/about-us/",
        "https://www.kaggle.com/tomdegodoy",
        "https://tidyverse-korea.github.io/seoul-R/data/DS_meetup_20190424-DataRobot.pdf"
      ],
      "year": 2012
    }
  ]
}

Deep Genomics

Deep Genomics' July 2021 financing release describes its AI Workbench as predictive systems for genetic variants, compounds, and RNA biology.

The company links those systems and proprietary data to identifying targets and programming RNA therapeutics for genetic diseases.

The release describes expansion of its preclinical pipeline and clinical-development capacity as plans supported by the financing, rather than completed treatment outcomes.

Sources and details

Deep Genomics Raises $180M in Series C Financing | Deep Genomics

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release_date": "2021-07-28",
    "retrieved_utc": "2026-10-07T18:00:47.251241+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "release_date",
      "value": "2021-07-28"
    }
  ],
  "id": "organization-company-b2b831c64bff8f::S1",
  "title": "Deep Genomics Raises $180M in Series C Financing | Deep Genomics",
  "url": "https://www.deepgenomics.com/news/deep-genomics-raises-180m-in-series-c-financing"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.deepgenomics.com/news/deep-genomics-raises-180m-in-series-c-financing",
        "https://www.deepgenomics.com/team"
      ],
      "year": 2015
    }
  ]
}

Feedzai

Feedzai's cached company page describes AI models that analyze transaction-related data for real-time fraud detection and prevention.

The company also identifies anti-money-laundering compliance and investigation of illicit activity as parts of its financial-institution offering.

It frames the combination as protecting commerce across fraud and financial-crime workflows.

Sources and details

About Us | Feedzai

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:48.619988+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-a34e01c862d3d0::S1",
  "title": "About Us | Feedzai",
  "url": "https://www.feedzai.com/about-us/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "CMU Portugal industry-partner interview dates Feedzai founding in Coimbra to 2008. Current company founder biography uses 2011 for establishment to fight financial fraud; these accounts must not be collapsed into an audited incorporation date.",
      "date": "2008",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.feedzai.com/leadership/nuno-sebastiao/",
        "https://www.feedzai.com/about-us/",
        "https://cmuportugal.org/media/industry-partner-interview-hr-feedzai/"
      ],
      "year": 2008
    }
  ]
}

Fiddler AI

Krishna Gade's Fiddler essay presents explainability as a way for teams to understand why machine learning models make predictions.

It illustrates the approach with a hypothetical credit decision affected by training-data coverage and an image model relying on radiologist markings rather than pathology.

The essay argues that exposing those dependencies lets people identify errors and adjust models before relying on their decisions.

Sources and details

Series A Funding: Why Now and What’s Next for Fiddler AI? | Fiddler AI Blog

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Visible publication date conflicts with structured metadata; retain both and treat 2019 as the visible essay date, not a claim of unchanged text.",
  "authors": [
    "Krishna Gade"
  ],
  "authors_in_source_order": [
    "Krishna Gade"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:49.181503+00:00",
    "visible_last_updated": "2026-07-01",
    "visible_published": "2019-09-30"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_published",
      "value": "2019-09-30"
    },
    {
      "role": "visible_last_updated",
      "value": "2026-07-01"
    }
  ],
  "id": "organization-company-48993aa64de444::S1",
  "title": "Series A Funding: Why Now and What’s Next for Fiddler AI? | Fiddler AI Blog",
  "url": "https://www.fiddler.ai/blog/series-a-why-now-and-whats-next-for-fiddler"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Visible publication date conflicts with structured metadata; retain both and treat 2019 as the visible essay date, not a claim of unchanged text.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred. Visible publication date conflicts with structured metadata; retain both and treat 2019 as the visible essay date, not a claim of unchanged text.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official founder retrospective specifies October 2018 inception; Lightspeed confirms 2018 founding.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.fiddler.ai/blog/series-a-why-now-and-whats-next-for-fiddler",
        "https://lsvp.com/company/fiddler/"
      ],
      "year": 2018
    }
  ]
}

Figure

Brett Adcock's May 2022 master plan describes Figure's ambition to develop general-purpose humanoid robots.

The plan prioritizes structured, repetitive work in manufacturing, logistics, warehousing, and retail before more complex tasks.

It explicitly excludes military or defense applications and presents household and off-world uses as longer-term opportunities dependent on further development.

Sources and details

Master Plan | Figure

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [
    "Brett Adcock"
  ],
  "authors_in_source_order": [
    "Brett Adcock"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:16.228919+00:00",
    "visible_date": "2022-05-20"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_date",
      "value": "2022-05-20"
    }
  ],
  "id": "organization-ai-1f5be66894e5ef::S1",
  "title": "Master Plan | Figure",
  "url": "https://www.figure.ai/master-plan"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder master plan published May 20, 2022, establishing company by 2022.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.figure.ai/master-plan",
        "https://www.figure.ai/news/figure-announces-strategic-partnership-with-brookfield"
      ],
      "year": 2022
    }
  ]
}

Gatik

Gatik's cached company timeline describes autonomous trucks moving freight between locations in retail, grocery, and e-commerce networks.

It records a warehouse-to-store Walmart service in 2019 and subsequent expansion into Canadian grocery distribution.

The timeline separately describes electric trucks, partnerships for Level 4 production, and a simulation platform for training autonomy across driving scenarios.

Sources and details

About Gatik

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:54.512812+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-7aa5073c496489::S1",
  "title": "About Gatik",
  "url": "https://archive.gatik.ai/about/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company timeline places founding in 2017 and public launch in June 2019.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://archive.gatik.ai/about/"
      ],
      "year": 2017
    }
  ]
}

Gcore

Gcore's cached company page describes public cloud, edge computing, content delivery, hosting, and security infrastructure.

Its listed services include virtual machines, bare-metal servers, object storage, containers, GPU workloads, and managed databases.

The page also presents CDN, streaming, DNS, and serverless edge services alongside application and network security products.

Sources and details

About Convenient Cloud Services | Gcore

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:54.028199+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-e2d674e40deca8::S1",
  "title": "About Convenient Cloud Services | Gcore",
  "url": "https://gcore.com/about?from=9793821"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company origin in 2014 per official tenth-anniversary post; official about page distinguishes first full product releases in 2016.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://gcore.com/blog/gcore-10-years-anniversary",
        "https://gcore.com/about?from=9793821",
        "https://www.linkedin.com/posts/andre-reitenbach-92a49020_ai-is-posing-a-new-question-for-telecom-operators-activity-7435987640308383744-F0nX",
        "https://www.linkedin.com/posts/g-core_today-gcore-begins-a-new-era-were-pushing-activity-6968597341222100992-D3ZI"
      ],
      "year": 2014
    }
  ]
}

Google

Google's Cloud TPU documentation describes Tensor Processing Units as custom ASICs for accelerating machine learning workloads.

The page identifies Compute Engine, Google Kubernetes Engine, and Vertex AI as routes for accessing Cloud TPU.

It directs developers to architecture and software-version guides, training instructions, command-line and REST references, and region and quota documentation.

Sources and details

Cloud TPU documentation  |  Google Cloud Documentation

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "last_updated": "2026-10-07",
    "retrieved_utc": "2026-10-07T17:56:39.702876+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "last_updated",
      "value": "2026-10-07"
    }
  ],
  "id": "organization-ai-ce770667e5f9b0::S1",
  "title": "Cloud TPU documentation  |  Google Cloud Documentation",
  "url": "https://docs.cloud.google.com/tpu/docs"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Google DeepMind

Google DeepMind's cached company history describes bringing Google Brain and DeepMind into one AI research team.

It recounts DeepMind's interdisciplinary approach and use of games to study learning systems, including DQN and AlphaGo.

The page also describes work on protein structure prediction, speech synthesis, programming, algorithms, and scientific applications as parts of the combined research history.

Sources and details

About Google DeepMind — Google DeepMind

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.462088+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "google-deepmind::S1",
  "title": "About Google DeepMind — Google DeepMind",
  "url": "https://deepmind.google/about/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

HubSpot

HubSpot's cached company history links its origins to inbound marketing built around information buyers seek rather than interruptive advertising.

It describes expansion into a customer platform organized around a shared Smart CRM database.

The page explains that marketing, sales, and service products connect to that common customer information, allowing teams to use the suite together.

Sources and details

About HubSpot | HubSpot’s Story

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:53.902304+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-5f5f6ddd5dbf17::S1",
  "title": "About HubSpot | HubSpot’s Story",
  "url": "https://www.hubspot.com/our-story"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Current official company story and founder biography give 2006; an early June 2006 funding release says founded in 2005.",
      "date": "2006",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.hubspot.com/our-story",
        "https://ir.hubspot.com/management/dharmesh-shah",
        "https://www.hubspot.com/blog/bid/1331/Press-Release-HubSpot-Announces-Seed-Round-Funding"
      ],
      "year": 2006
    }
  ]
}

Owkin

Owkin's cached company page describes K Pro as an AI scientist designed to work with pharmaceutical research teams.

The company says it orchestrates tools and skills using multimodal patient data and biological AI models, while researchers shape hypotheses and decisions.

The page separates that product description from a longer-term ambition for an autonomous, self-improving system spanning life-science research.

Sources and details

About Owkin | The AI Scientist for Biomedical Research

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:47.448990+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-fb5eb3e9f4c159::S1",
  "title": "About Owkin | The AI Scientist for Biomedical Research",
  "url": "https://www.owkin.com/about-us"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official press-kit FAQ dates co-founding to 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.owkin.com/faqs/what-is-owkins-founding-story",
        "https://www.owkin.com/about-us"
      ],
      "year": 2016
    }
  ]
}

Photoroom

Photoroom's cached company page describes visual production tools for e-commerce businesses, including batch image editing through a web app or API.

Its Brand Kit applies rules for backgrounds, padding, colors, logos, and formats across image workflows.

The page describes connecting product-information systems, asset libraries, supplier inputs, and cloud services into a shared production pipeline.

Sources and details

About Photoroom | Photoroom

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:05.555178+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-5ef0b6313b04ba::S1",
  "title": "About Photoroom | Photoroom",
  "url": "https://www.photoroom.com/about"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official origin account dates founding story to 2019; incorporation date is not separately audited.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.photoroom.com/about",
        "https://www.photoroom.com/inside-photoroom/brand-refresh"
      ],
      "year": 2019
    }
  ]
}

Planet

Planet's cached FAQ describes a business licensing satellite imagery and imagery products through subscriptions.

It distinguishes broad monitoring imagery from taskable imagery with more frequent revisits and also describes a platform and API for computer-vision analytics.

The FAQ explains Planet's public benefit corporation purpose and distinguishes that legal form from certification as a B Corp.

Sources and details

Frequently Asked Questions | Planet

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:07.462472+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-b6e3957877afba::S1",
  "title": "Frequently Asked Questions | Planet",
  "url": "https://www.planet.com/faqs/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official FAQ says 2010; 2021 public-benefit and listed-company transition is distinct.",
      "date": "2010",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.planet.com/company/",
        "https://www.planet.com/faqs/",
        "https://account.planet.com/pulse/what-is-planetary-intelligence-and-how-could-it-move-ai-from-the-internet-to-the-real-world/",
        "https://www.dcvc.com/news-insights/on-going-to-space"
      ],
      "year": 2010
    }
  ]
}

Recorded Future

Recorded Future's cached company history describes threat intelligence intended to help defenders identify and prioritize evolving threats.

It frames the service as connecting cyber and physical risks with information used by businesses and governments.

The page records the company's 2009 launch and a separate acquisition by Mastercard in 2024, while describing continued services to enterprises and government organizations.

Sources and details

Our Story | Recorded Future

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:51.861166+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-f727ff660b86e0::S1",
  "title": "Our Story | Recorded Future",
  "url": "https://www.recordedfuture.com/our-story"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history dates launch to 2009; incorporation date not separately verified.",
      "date": "2009",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://go.recordedfuture.com/Public-Sector-Intelligence-Forum.html",
        "https://www.recordedfuture.com/our-story",
        "https://www.mastercard.com/global/en/news-and-trends/press/2024/december/mastercard-finalizes-acquisition-of-recorded-future.html"
      ],
      "year": 2009
    }
  ]
}

Sierra

Bret Taylor and Clay Bavor's February 2024 Sierra introduction describes a platform for businesses to build customer-facing conversational agents.

It distinguishes answering questions from taking actions such as tracking packages, recovering accounts, or exchanging products through connected business systems.

The essay identifies auditing, inspection, protection of personal information, and handling unreliable model outputs as engineering requirements for that workflow.

Sources and details

Meet Sierra, the conversational AI platform for businesses | Sierra

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [
    "Bret Taylor",
    "Clay Bavor"
  ],
  "authors_in_source_order": [
    "Bret Taylor",
    "Clay Bavor"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:25.866774+00:00",
    "visible_date": "2024-02-13"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_date",
      "value": "2024-02-13"
    }
  ],
  "id": "organization-company-d5eef8ad210c5b::S1",
  "title": "Meet Sierra, the conversational AI platform for businesses | Sierra",
  "url": "https://sierra.ai/blog/introducing-sierra"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Primary investor portfolio states founded 2023; product announced February 13, 2024.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://sierra.ai/about",
        "https://sequoiacap.com/companies/sierra",
        "https://sierra.ai/blog/introducing-sierra"
      ],
      "year": 2023
    }
  ]
}

SoundHound AI

SoundHound AI's cached company page frames natural spoken interaction as the focus of its voice and agent technology.

Its stated mission extends toward an operating system in which agents interact with people and with one another across channels.

The page connects that vision to custom voice assistants and multimodal customer experiences for businesses and products.

Sources and details

About SoundHound AI

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:32.174077+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-b28aba7b5a1787::S1",
  "title": "About SoundHound AI",
  "url": "https://www.soundhound.com/about"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Operating business dates to 2005; public-company combination is later.",
      "date": "2005",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.soundhound.com/about",
        "https://investors.soundhound.com/news-releases/news-release-details/soundhound-inc-global-leader-voice-ai-technology-become-publicly"
      ],
      "year": 2005
    }
  ]
}

Syte

Syte's cached company page describes visual AI for discovering retail products.

Its listed tools include image-based search, automatic product tagging, personalized recommendations, and shoppable social content.

The page recounts expansion from image search into broader product discovery, including marketing tools and in-store experiences such as smart mirrors.

Sources and details

About Us | The Story Behind Syte's Product Discovery Platform

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:54.184281+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-e6238d4e6a615c::S1",
  "title": "About Us | The Story Behind Syte's Product Discovery Platform",
  "url": "https://www.syte.ai/about-us/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history states 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.syte.ai/blog/company-updates/syte-names-vered-levy-ron-as-chief-executive-officer/",
        "https://www.syte.ai/about-us/",
        "https://www.syte.ai/blog/company-updates/syte-raises-22m-round-b/"
      ],
      "year": 2015
    }
  ]
}

Taranis

Taranis' cached company story describes crop scouting based on leaf-level field imagery and AI models.

It links submillimeter image capture and a large imagery library to identifying field areas that advisors and growers may need to investigate.

The company frames the service around giving agricultural advisors detailed data for management decisions and relationships with growers.

Sources and details

Our Story | Taranis - Precision Agriculture Technology Company

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:33.780057+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-816c7ce6ab7d4b::S1",
  "title": "Our Story | Taranis - Precision Agriculture Technology Company",
  "url": "https://www.taranis.com/our-story/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official media kit states founded in 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.taranis.com/leadership/",
        "https://www.taranis.com/media-kit/",
        "https://www.taranis.com/our-story/",
        "https://www.viola-group.com/portfolio/taranis"
      ],
      "year": 2015
    }
  ]
}

Valohai

Valohai's cached company page describes helping data-science teams build, test, and deploy deep learning models.

The company positions its work around reducing repetitive machine learning tasks so teams can concentrate on model development.

It identifies open standards and technology-agnostic development as principles of its MLOps approach.

Sources and details

About the Company - Valohai

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:23.632658+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-6506e84b8263a4::S1",
  "title": "About the Company - Valohai",
  "url": "https://valohai.com/company/"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company formation paperwork dated October 16, 2016 in a founder-authored retrospective; no independent registry incorporation check.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://valohai.com/company/",
        "https://valohai.com/blog/two-years-of-democratizing-ai/"
      ],
      "year": 2016
    }
  ]
}

Viz.ai

Viz.ai's cached company story describes using AI to support care coordination and reduce process delays in clinical workflows.

It traces the company's motivation to a neurosurgeon's experience of treatment arriving too late despite a successful operation.

The page presents faster access to treatment as the company's mission and design objective, without supplying clinical outcome evidence for that claim.

Sources and details

A new vision for healthcare with AI | About Viz.ai

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:38.819813+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-cd1966f49e3b91::S1",
  "title": "A new vision for healthcare with AI | About Viz.ai",
  "url": "https://www.viz.ai/our-story"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.viz.ai/our-story"
      ],
      "year": 2016
    }
  ]
}

WeRide

WeRide's cached company page describes autonomous driving technologies spanning Level 2 through Level 4.

Its listed portfolio includes robotaxis, buses, delivery vans, street sweepers, and advanced driver-assistance systems.

The company groups those products into mobility, logistics, and sanitation uses and describes collaboration with vehicle manufacturers and component suppliers.

Sources and details

WeRide | About WeRide

{
  "access_scope": "Limited to the inspected cached first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:27.269518+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-eb3a28ce0a1191::S1",
  "title": "WeRide | About WeRide",
  "url": "https://weride.ai/about"
}

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

Limited to the inspected first-party page or release and its stated workflow; corporate claims are attributed, not independently validated. No present-day availability, safety, clinical efficacy, financial outcome, rebranding identity merge, or individual contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official about page states established in 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.weride.ai/governance/management-team",
        "https://weride.ai/about"
      ],
      "year": 2017
    }
  ]
}

Aaron Hill

Aaron Hill is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Aaron Hill is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2a49ccb20809d3::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Aaron Hill is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Aaron Hill is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Abhishek Kumar

Abhishek Kumar is a listed coauthor of a framework that generates data by reversing a stochastic process that gradually adds noise.

Neural networks estimate the changing gradient of the noisy data distribution, allowing numerical solvers to follow the reverse process.

The study develops predictor–corrector sampling and an equivalent ordinary differential equation, and reports applications to inpainting and colorization.

Sources and details

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Abhishek Kumar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "dates": {
    "citation_date": "2020/11/26",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB)",
    "retrieved_utc": "2026-10-07T18:15:54.250275+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7f2eda40a95594::S1",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/abs/2011.13456",
  "version_url": "https://arxiv.org/abs/2011.13456v2"
}

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Abhishek Kumar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Abhishek Kumar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aditya Khosla

Aditya Khosla is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Aditya Khosla is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0120582fee0817::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Aditya Khosla is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Aditya Khosla is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aidan Clark

Aidan Clark is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aidan Clark is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-aidanclark::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aidan Clark is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aidan Clark is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aidan Gomez

Aidan Gomez is credited as Aidan N. Gomez among the joint authors of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Aidan Gomez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-aidangomez::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Aidan Gomez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Aidan Gomez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aleksandra Piktus

Aleksandra Piktus is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Aleksandra Piktus is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-aleksandrapiktus::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Aleksandra Piktus is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Aleksandra Piktus is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Ray

Alex Ray is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Alex Ray is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-alexray::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Alex Ray is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Alex Ray is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander G. de G. Matthews

Alexander G. de G. Matthews is a listed coauthor of a study introducing the Fermionic Neural Network as an approximation to many-electron wavefunctions.

The architecture is designed for electronic systems whose wavefunctions must obey Fermi–Dirac statistics.

The authors report variational quantum Monte Carlo results on atoms and small molecules, including challenging nitrogen and hydrogen-chain dissociation curves.

Sources and details

Ab-Initio Solution of the Many-Electron Schr\"odinger Equation with Deep Neural Networks

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. Alexander G. de G. Matthews is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-62b0ef71d75b91::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schr\\\"odinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. Alexander G. de G. Matthews is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. Alexander G. de G. Matthews is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Kolesnikov

Alexander Kolesnikov is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexander Kolesnikov is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d49372b211164c::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexander Kolesnikov is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexander Kolesnikov is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Merose

Alexander Merose is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alexander Merose is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-b620e4ff154593::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alexander Merose is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alexander Merose is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Pritzel

Alexander Pritzel is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Alexander Pritzel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-eb4c431a608bd2::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Alexander Pritzel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Alexander Pritzel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andreas Blattmann

Andreas Blattmann is a listed coauthor of the latent diffusion study, which moves image generation into the representation learned by a pretrained autoencoder.

That compressed space aims to reduce computational demands while preserving visual detail compared with diffusion performed directly over pixels.

Cross-attention supplies conditioning inputs such as text or bounding boxes, and the study evaluates generation, inpainting and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Andreas Blattmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv v2"
  },
  "id": "person-andreasblattmann::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Andreas Blattmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Andreas Blattmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew M. Haun

Andrew M. Haun is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew M. Haun is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-204bb4385d9288::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew M. Haun is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew M. Haun is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Ng

Andrew Ng is a listed coauthor of a study learning high-level visual features from unlabeled images with a large sparse autoencoder.

The experiments report sensitivity to faces, cat faces and human bodies without first supplying labels for those concepts.

The authors then use the learned features for ImageNet category recognition and test how a face detector responds to changes in position, scale and orientation.

Sources and details

Building high-level features using large scale unsupervised learning

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB); bounded account of this paper’s method and reported results. Andrew Ng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "authors_in_source_order": [
    "Le, Quoc V.",
    "Ranzato, Marc'Aurelio",
    "Monga, Rajat",
    "Devin, Matthieu",
    "Chen, Kai",
    "Corrado, Greg S.",
    "Dean, Jeff",
    "Ng, Andrew Y."
  ],
  "dates": {
    "citation_date": "2011/12/29",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.230847+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-fe9b36003c18a9::S1",
  "title": "Building high-level features using large scale unsupervised learning",
  "url": "https://arxiv.org/abs/1112.6209",
  "version_url": "https://arxiv.org/abs/1112.6209v5"
}

Joint-author arXiv v5 abstract, revised Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB); bounded account of this paper’s method and reported results. Andrew Ng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Thu, 12 Jul 2012 04:32:50 UTC (2,978 KB); bounded account of this paper’s method and reported results. Andrew Ng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Davis

Andy Davis is a listed coauthor of a sparsely gated mixture-of-experts study that increases model capacity through conditional computation.

A trainable gate selects a small combination of feed-forward experts for each example instead of activating every subnetwork.

The authors apply this layer within language-modeling and machine-translation architectures, reporting comparisons of model quality and computational cost.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Andy Davis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "dates": {
    "citation_date": "2017/01/23",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 23 Jan 2017 18:10:00 UTC (294 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.902595+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-andydavis::S1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/abs/1701.06538",
  "version_url": "https://arxiv.org/abs/1701.06538v1"
}

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Andy Davis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Andy Davis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Maria Feit

Anna Maria Feit is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Anna Maria Feit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-532f375c935561::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Anna Maria Feit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Anna Maria Feit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aohan Zeng

Aohan Zeng is a listed coauthor of the GLM-130B study, which documents pretraining a large bilingual English–Chinese language model.

The account discusses model design, training stability and engineering responses to problems such as loss spikes and divergence.

It also reports low-bit quantization experiments and releases weights, code and training information intended to make the system inspectable.

Sources and details

GLM-130B: An Open Bilingual Pre-trained Model

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Aohan Zeng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "authors_in_source_order": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "dates": {
    "citation_date": "2022/10/05",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.851506+00:00",
    "version": "arXiv v2"
  },
  "id": "person-aohanzeng::S1",
  "title": "GLM-130B: An Open Bilingual Pre-trained Model",
  "url": "https://arxiv.org/abs/2210.02414",
  "version_url": "https://arxiv.org/abs/2210.02414v2"
}

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Aohan Zeng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Aohan Zeng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aravind Srinivas

Aravind Srinivas is a listed coauthor of CURL, which learns visual representations for reinforcement learning using a contrastive objective.

The method extracts features from raw pixels and performs off-policy control using those features.

The authors evaluate sample efficiency on DeepMind Control Suite tasks and Atari games, comparing CURL with earlier methods that learn directly from images.

Sources and details

CURL: Contrastive Unsupervised Representations for Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 21 Sep 2020 15:34:30 UTC (5,115 KB); bounded account of this paper’s method and reported results. Aravind Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Srinivas, Aravind",
    "Laskin, Michael",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Srinivas, Aravind",
    "Laskin, Michael",
    "Abbeel, Pieter"
  ],
  "dates": {
    "citation_date": "2020/04/08",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 21 Sep 2020 15:34:30 UTC (5,115 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.099203+00:00",
    "version": "arXiv v4"
  },
  "id": "person-aravindsrinivas::S1",
  "title": "CURL: Contrastive Unsupervised Representations for Reinforcement Learning",
  "url": "https://arxiv.org/abs/2004.04136",
  "version_url": "https://arxiv.org/abs/2004.04136v4"
}

Joint-author arXiv v4 abstract, revised Mon, 21 Sep 2020 15:34:30 UTC (5,115 KB); bounded account of this paper’s method and reported results. Aravind Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 21 Sep 2020 15:34:30 UTC (5,115 KB); bounded account of this paper’s method and reported results. Aravind Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Armand Joulin

Armand Joulin is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Armand Joulin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-c36d288e9737f6::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Armand Joulin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Armand Joulin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Atri Rudra

Atri Rudra is a listed coauthor of FlashAttention, which reorganizes exact attention around data movement within GPU memory.

The algorithm uses tiling to reduce transfers between high-bandwidth memory and on-chip storage while preserving exact attention computation.

The study reports faster Transformer training and explores a separate block-sparse extension, keeping that approximate variant distinct from the exact algorithm.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Atri Rudra is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "authors_in_source_order": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "dates": {
    "citation_date": "2022/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.819658+00:00",
    "version": "arXiv v2"
  },
  "id": "person-atrirudra::S1",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/abs/2205.14135",
  "version_url": "https://arxiv.org/abs/2205.14135v2"
}

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Atri Rudra is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Atri Rudra is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Cameron

James Cameron directed The Terminator and shared its writing credit with Gale Anne Hurd.

AFI’s production history reports that he developed a forty-five-page treatment before the team secured the project and changed its planned location to Los Angeles.

The film’s pursuit by a future machine belongs to its science-fiction narrative, while Cameron’s creative role remains distinct from the separately credited mechanical and visual effects teams.

Sources and details

AFI|Catalog

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1984 (film)",
    "retrieved_utc": "2026-10-07T17:55:29.884392+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 (film)"
  ],
  "id": "creative-person-jamescameron::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/57224-THE-TERMINATOR"
}

The Terminator (1984), as documented in AFI’s catalog production history. Cameron’s directing and shared writing credits are distinct from the film’s fictional machines and separately credited effects work; no personal AI engineering contribution is inferred.

The Terminator (1984), as documented in AFI’s catalog production history. Cameron’s directing and shared writing credits are distinct from the film’s fictional machines and separately credited effects work; no personal AI engineering contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fritz Lang

Fritz Lang directed Metropolis, which premiered in Berlin on January 10, 1927.

The Murnau Foundation describes a futuristic city divided by class and credits Thea von Harbou’s novel as its basis, with Lang also listed as an uncredited screenplay contributor.

Its account separates the premiere version from the 2010 reconstruction and a planned 2027 4K restoration, so the surviving manifestations should not be treated as identical.

Sources and details

100 Jahre METROPOLIS | Murnau Stiftung

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1927-01-10 (premiere)",
    "inspected_source_date_2": "2010 (restoration)",
    "inspected_source_date_3": "2027 (planned restoration)",
    "retrieved_utc": "2026-10-07T17:56:05.470734+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1927-01-10 (premiere)",
    "2010 (restoration)",
    "2027 (planned restoration)"
  ],
  "id": "creative-person-coverage-e99be9acacbec8::S1",
  "title": "100 Jahre METROPOLIS | Murnau Stiftung",
  "url": "https://www.murnau-stiftung.de/metropolis-100"
}

Metropolis in the Murnau Foundation’s historical and restoration account. Lang’s direction and uncredited screenplay contribution are distinguished from von Harbou’s novel; the 1927 premiere, 2010 reconstruction and proposed 2027 restoration are separate manifestations.

Metropolis in the Murnau Foundation’s historical and restoration account. Lang’s direction and uncredited screenplay contribution are distinguished from von Harbou’s novel; the 1927 premiere, 2010 reconstruction and proposed 2027 restoration are separate manifestations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mamoru Oshii

Mamoru Oshii wrote and directed Angel’s Egg in collaboration with artist Yoshitaka Amano.

GKIDS’s 2024 announcement describes the 1985 hand-drawn fantasy as joining Oshii’s philosophical and theological concerns with Amano’s ink-painting style.

The source concerns Angel’s Egg and a planned restoration supervised by Oshii, rather than supplying an account of his work on the artificial beings of Ghost in the Shell.

Sources and details

GKIDS Acquires North American Rights To Acclaimed Director Mamoru Oshii's Seminal Classic "ANGEL'S EGG" - GKIDS Films

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [
    "GKIDS"
  ],
  "authors_in_source_order": [
    "GKIDS"
  ],
  "dates": {
    "inspected_source_date_1": "2024-05-29 (announcement)",
    "inspected_source_date_2": "1985 (original film)",
    "retrieved_utc": "2026-10-07T17:55:33.475477+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-05-29 (announcement)",
    "1985 (original film)"
  ],
  "id": "creative-person-coverage-cfc959f8bd5dda::S1",
  "title": "GKIDS Acquires North American Rights To Acclaimed Director Mamoru Oshii's Seminal Classic \"ANGEL'S EGG\" - GKIDS Films",
  "url": "https://gkids.com/2024/05/29/gkids-acquires-north-american-rights-to-acclaimed-director-mamoru-oshiis-seminal-classic-angels-egg/"
}

GKIDS’s May 2024 Angel’s Egg announcement, covering Oshii’s writing and direction with Amano’s visual collaboration and a planned restoration. The selected source does not substantiate a contribution to Ghost in the Shell or an implemented artificial-intelligence system.

GKIDS’s May 2024 Angel’s Egg announcement, covering Oshii’s writing and direction with Amano’s visual collaboration and a planned restoration. The selected source does not substantiate a contribution to Ghost in the Shell or an implemented artificial-intelligence system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hideaki Anno

Hideaki Anno created the Neon Genesis Evangelion television series, which GKIDS dates to a 1995 premiere in Japan.

Its release account presents Shinji Ikari’s story as animation concerned with philosophy and emotional character experience.

The page distinguishes the twenty-six-episode series from its companion films and separately packaged dub editions, supporting a bounded creator credit rather than claims about Anno’s personal AI techniques.

Sources and details

GKIDS Films

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1995 (series premiere)",
    "inspected_source_date_2": "2021 (release announcement)",
    "retrieved_utc": "2026-10-07T17:55:43.068437+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1995 (series premiere)",
    "2021 (release announcement)"
  ],
  "id": "creative-person-coverage-ae022bd85bf0d2::S1",
  "title": "GKIDS Films",
  "url": "https://store.gkids.com/pages/neon-genesis-evangelion"
}

GKIDS’s Neon Genesis Evangelion release page identifies Anno as series creator and distinguishes the 1995 series, companion films and dub editions. Its description of philosophical and emotional storytelling does not establish an individual AI technique or collapse these editions into one source object.

GKIDS’s Neon Genesis Evangelion release page identifies Anno as series creator and distinguishes the 1995 series, companion films and dub editions. Its description of philosophical and emotional storytelling does not establish an individual AI technique or collapse these editions into one source object.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guillermo del Toro

Guillermo del Toro directed Pacific Rim and shared its screenplay credit with Travis Beacham, who receives the story credit.

Legendary’s synopsis centers on giant robots operated by two pilots whose minds connect through the fictional Drift.

This makes coordinated human control part of the imagined machine combat, while the source preserves separate production, animation and visual-effects responsibilities.

Sources and details

Pacific Rim - Legendary

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2013-07-12 (film release)",
    "inspected_source_date_2": "2015-04-14 (embedded publication)",
    "retrieved_utc": "2026-10-07T17:56:02.743324+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2013-07-12 (film release)",
    "2015-04-14 (embedded publication)"
  ],
  "id": "creative-person-coverage-71087ed9cd130c::S1",
  "title": "Pacific Rim - Legendary",
  "url": "https://www.legendary.com/film/pacificrim/"
}

Legendary’s Pacific Rim film page credits del Toro’s direction and shared screenplay separately from Beacham’s story and the effects team. The Jaegers and neural Drift are fictional devices, not evidence of an implemented mind-linked robot.

Legendary’s Pacific Rim film page credits del Toro’s direction and shared screenplay separately from Beacham’s story and the effects team. The Jaegers and neural Drift are fictional devices, not evidence of an implemented mind-linked robot.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brent Spiner

Brent Spiner’s portrayal of Data spanned The Next Generation’s opening episode through Star Trek Nemesis, according to StarTrek.com’s 2020 profile.

The same account records his contribution to developing the Nemesis story and a shared story credit.

It therefore documents participation in both performance and narrative development without attributing the android’s design or a specific acting method to him.

Sources and details

6 Things You Should Know About Brent Spiner

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "inspected_source_date_1": "2020-02-02",
    "retrieved_utc": "2026-10-07T17:55:25.493264+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2020-02-02"
  ],
  "id": "creative-person-coverage-0e139c98ce8b84::S1",
  "title": "6 Things You Should Know About Brent Spiner",
  "url": "https://www.startrek.com/news/6-things-you-should-know-about-brent-spiner"
}

StarTrek.com’s February 2020 Spiner profile supports his Data portrayal and shared Nemesis story-development credit. It does not establish a particular acting technique, android-design responsibility or technical AI contribution.

StarTrek.com’s February 2020 Spiner profile supports his Data portrayal and shared Nemesis story-development credit. It does not establish a particular acting technique, android-design responsibility or technical AI contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Serkis

Andy Serkis formed Imaginarium Studios in 2012, according to the company’s account of its performance-capture work.

Its services connect body and facial recording with production tools such as real-time rendering, camera tracking and virtual cameras.

Serkis’s quoted emphasis on creative storytelling frames the enterprise, while the studio’s technical service descriptions do not establish that he individually invented those capture methods.

Sources and details

Imaginarium Studios - Motion Capture Specialists | Performance Capture

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2012 (formation)",
    "inspected_source_date_2": "2023-05 (partnership)",
    "retrieved_utc": "2026-10-07T17:55:57.592818+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2012 (formation)",
    "2023-05 (partnership)"
  ],
  "id": "creative-person-coverage-451f67dbe81d1f::S1",
  "title": "Imaginarium Studios - Motion Capture Specialists | Performance Capture",
  "url": "https://www.imaginariumstudios.co.uk/"
}

Imaginarium Studios’ corporate account identifies Serkis’s founding role and describes studio performance-capture services. The studio’s capabilities and his quoted creative aims do not establish that he personally invented the recording or rendering methods.

Imaginarium Studios’ corporate account identifies Serkis’s founding role and describes studio performance-capture services. The studio’s capabilities and his quoted creative aims do not establish that he personally invented the recording or rendering methods.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Glover

Donald Glover and his studio Gilga experimented with Veo for a film project, as described in Google’s May 2024 announcement.

Authors Eli Collins and Douglas Eck place that collaboration within a program inviting filmmakers to test how generated video might support storytelling and inform tool design.

The page establishes a creative experiment, while its broader model capabilities remain Google’s claims rather than Glover’s individual technical contributions.

Sources and details

Google I/O 2024: Introducing Veo and Imagen 3 generative AI tools

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [
    "Eli Collins",
    "Douglas Eck"
  ],
  "authors_in_source_order": [
    "Eli Collins",
    "Douglas Eck"
  ],
  "dates": {
    "inspected_source_date_1": "2024-05-14",
    "retrieved_utc": "2026-10-07T17:55:29.669688+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-05-14"
  ],
  "id": "creative-person-coverage-a7e7fc4a891ebd::S1",
  "title": "Google I/O 2024: Introducing Veo and Imagen 3 generative AI tools",
  "url": "https://blog.google/innovation-and-ai/products/google-generative-ai-veo-imagen-3/"
}

Collins and Eck’s May 2024 Google announcement describes Glover and Gilga experimenting with Veo for a film project. Broader video-model capabilities are Google’s claims; the source does not assign model engineering or particular film-production results to Glover.

Collins and Eck’s May 2024 Google announcement describes Glover and Gilga experimenting with Veo for a film project. Broader video-model capabilities are Google’s claims; the source does not assign model engineering or particular film-production results to Glover.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Proyas

Alex Proyas directed I, Robot, which the studio lists as a 2004 science-fiction release.

Its synopsis pairs a detective with a robo-psychologist and a prototype robot with human emotions as they confront a robot revolution.

Separate screenplay credits for Jeff Vintar and Akiva Goldsman keep the director’s role distinct from writing the film’s fictional account of human–machine conflict.

Sources and details

I, Robot | 20th Century Studios

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2004-07-16",
    "retrieved_utc": "2026-10-07T17:55:45.997380+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2004-07-16"
  ],
  "id": "creative-person-coverage-55a0070572e47c::S1",
  "title": "I, Robot | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/i-robot"
}

The studio’s I, Robot page supports Proyas’s directing credit and the 2004 film’s synopsis, with Vintar and Goldsman separately credited as writers. Emotional robots and their revolution remain elements of fiction, not a documented AI system developed by Proyas.

The studio’s I, Robot page supports Proyas’s directing credit and the 2004 film’s synopsis, with Vintar and Goldsman separately credited as writers. Emotional robots and their revolution remain elements of fiction, not a documented AI system developed by Proyas.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Zemeckis

Robert Zemeckis directed Here, a film whose January 2023 production announcement describes planned AI face replacement and de-aging.

In a statement carried by Metaphysic’s release, he links the choice of tools to actors appearing as younger versions of themselves within the story.

The account retains Metaphysic’s technical role and Kevin Baillie’s effects supervision, treating performance feedback and capability claims as the production team’s descriptions at that stage.

Sources and details

Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's "Here"

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [
    "Metaphysic"
  ],
  "authors_in_source_order": [
    "Metaphysic"
  ],
  "dates": {
    "inspected_source_date_1": "2023-01-31",
    "retrieved_utc": "2026-10-07T17:55:24.830287+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023-01-31"
  ],
  "id": "creative-person-coverage-6e1433c0e98ec2::S1",
  "title": "Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's \"Here\"",
  "url": "https://www.prnewswire.com/news-releases/metaphysic-announces-strategic-partnership-with-creative-artists-agency-named-generative-ai-provider-for-miramaxs-here-301734767.html"
}

Metaphysic’s January 2023 Here announcement records Zemeckis’s direction and quoted rationale for de-aging at a production stage. Provider capabilities and the effects team’s performance-feedback descriptions remain attributed claims; no later finished-film outcome or personal technical invention is inferred.

Metaphysic’s January 2023 Here announcement records Zemeckis’s direction and quoted rationale for de-aging at a production stage. Provider capabilities and the effects team’s performance-feedback descriptions remain attributed claims; no later finished-film outcome or personal technical invention is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jon Favreau

Jon Favreau directed The Mandalorian and Grogu in collaboration with a large visual-effects production.

ILM’s project account describes virtual scouting and shot previews alongside LED-volume work, computer animation and motion-control photography of miniatures.

It attributes effects supervision to John Knoll and Justin van der Lek, locating Favreau’s directing role within a hybrid workflow rather than assigning him its technical inventions.

Sources and details

The Mandalorian and Grogu | Industrial Light & Magic

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:56.753501+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-c76d05aab43249::S1",
  "title": "The Mandalorian and Grogu | Industrial Light & Magic",
  "url": "https://www.ilm.com/vfx/the-mandalorian-and-grogu/"
}

ILM’s The Mandalorian and Grogu production account distinguishes Favreau’s direction from Knoll and van der Lek’s effects supervision. Virtual production, animation and miniature workflows are described as collaborative production methods, not Favreau’s individual inventions.

ILM’s The Mandalorian and Grogu production account distinguishes Favreau’s direction from Knoll and van der Lek’s effects supervision. Virtual production, animation and miniature workflows are described as collaborative production methods, not Favreau’s individual inventions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scott Mann

Scott Mann co-founded Flawless with Nick Lynes in 2019, according to the company’s history.

That account connects his research into better dubbing with dissatisfaction at a German version of his film Heist.

Flawless describes localization and performance editing derived from original performances, with performer approval through its A.R.T. workflow; these remain company descriptions rather than independently verified rights or consent outcomes.

Sources and details

Grow Global Film & TV Industries | Flawless

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2019 (formation)",
    "retrieved_utc": "2026-10-07T17:55:32.929538+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 (formation)"
  ],
  "id": "creative-person-coverage-3a90aade5efd3c::S1",
  "title": "Grow Global Film & TV Industries | Flawless",
  "url": "https://flawlessai.com/mission"
}

Flawless’s corporate history connects Mann’s co-founding role and dubbing concerns with its assistive editing tools. Statements about performance-derived outputs and its A.R.T. approval workflow are company descriptions, not independent verification of legal rights, consent or every release outcome.

Flawless’s corporate history connects Mann’s co-founding role and dubbing concerns with its assistive editing tools. Statements about performance-derived outputs and its A.R.T. approval workflow are company descriptions, not independent verification of legal rights, consent or every release outcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Justine Bateman

Justine Bateman addressed the FTC’s July 20, 2023 open meeting as a writer, director and producer concerned about generative AI in entertainment.

The transcript records her warning about concentrated production and distribution power and reduced leverage for creative workers.

She asks the commission to act against studios and streamers, presenting an advocacy position rather than a finding that the commission adopted her allegations.

Sources and details

FTC Open Commission Meeting: July 20, 2023

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2023-07-20",
    "retrieved_utc": "2026-10-07T17:55:54.189703+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023-07-20"
  ],
  "id": "creative-person-coverage-98d9e633f136aa::S1",
  "title": "FTC Open Commission Meeting: July 20, 2023",
  "url": "https://www.ftc.gov/system/files/ftc_gov/pdf/ftc-open-commission-meeting-july-20-2023.pdf"
}

The FTC’s July 20, 2023 meeting transcript records Bateman’s public advocacy about creative workers, generative AI and concentrated industry power. Her allegations and request are speaker positions, not commission findings; visibly garbled transcript passages are not silently repaired into factual claims.

The FTC’s July 20, 2023 meeting transcript records Bateman’s public advocacy about creative workers, generative AI and concentrated industry power. Her allegations and request are speaker positions, not commission findings; visibly garbled transcript passages are not silently repaired into factual claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David S. Goyer

David S. Goyer co-hosted the opening episode of Foundation: The Official Podcast with Jason Concepcion.

Its September 2021 listing describes discussion of the first two television episodes and Goyer’s process of modernizing Asimov’s material.

This source documents a publicly presented adaptation discussion, while the untranscribed recording does not support a detailed claim about a particular fictional AI or his technical contribution.

Sources and details

The Emperor’s Peace and Prepar… - Foundation: The Official Podcast - Apple Podcasts

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2021-09-24",
    "retrieved_utc": "2026-10-07T17:55:39.917400+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021-09-24"
  ],
  "id": "creative-person-coverage-4981fa327cacf0::S1",
  "title": "The Emperor’s Peace and Prepar… - Foundation: The Official Podcast - Apple Podcasts",
  "url": "https://podcasts.apple.com/us/podcast/the-emperors-peace-and-preparing-to-live/id1586219793?i=1000536450897"
}

The September 2021 listing for Foundation: The Official Podcast documents Goyer’s co-hosting and an adaptation discussion with Concepcion. The recording is not transcribed in the selected cache, so no specific AI narrative, detailed argument or technical contribution is inferred.

The September 2021 listing for Foundation: The Official Podcast documents Goyer’s co-hosting and an adaptation discussion with Concepcion. The recording is not transcribed in the selected cache, so no specific AI narrative, detailed argument or technical contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ronald D. Moore

Ronald D. Moore reimagined Battlestar Galactica through a miniseries that became the basis for a four-season series.

SYFY’s 2026 retrospective contrasts that approach with Richard Hatch’s proposed continuation of the original show, while retaining humanity’s flight from cybernetic enemies as a shared story premise.

Its account concerns the reception and narrative direction of the reboot, rather than documenting an AI technology developed by Moore.

Sources and details

Battlestar Galactica Actor Blasted 2004 Reboot Series

{
  "access_scope": "Bounded to the named cached source and project; corporate claims, quoted advocacy, fiction, historical versions and shared credits remain distinguished.",
  "authors": [
    "Joe Bergren"
  ],
  "authors_in_source_order": [
    "Joe Bergren"
  ],
  "dates": {
    "inspected_source_date_1": "2026-05-08",
    "retrieved_utc": "2026-10-07T17:56:11.354248+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-05-08"
  ],
  "id": "creative-person-coverage-4eb8a4f73dabb8::S1",
  "title": "Battlestar Galactica Actor Blasted 2004 Reboot Series",
  "url": "https://www.syfy.com/syfy-wire/battlestar-galactica-actor-blasted-2004-reboot-series"
}

Joe Bergren’s May 2026 SYFY retrospective describes Moore’s Battlestar Galactica reboot and its reception relative to Hatch’s continuation proposal. Cybernetic enemies are a fictional story premise; the article does not establish an AI technology developed by Moore.

Joe Bergren’s May 2026 SYFY retrospective describes Moore’s Battlestar Galactica reboot and its reception relative to Hatch’s continuation proposal. Cybernetic enemies are a fictional story premise; the article does not establish an AI technology developed by Moore.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Capella Space

IonQ's July 2025 acquisition release describes Capella Space as a provider of synthetic aperture radar and satellite services for commercial and government uses.

It announces completion of the acquisition separately from a plan to combine Capella's satellite infrastructure with IonQ's quantum technology.

The proposed space-to-space and space-to-ground quantum key distribution network is described as future development, rather than an already operating service.

Sources and details

IonQ | IonQ Completes Acquisition of Capella Space, Advancing Vision for Space-Based Quantum Communications

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:54.910576+00:00",
    "visible_or_selected_document_date": "2025-07-15"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2025-07-15"
    }
  ],
  "id": "organization-company-793045117fbcc2::S1",
  "title": "IonQ | IonQ Completes Acquisition of Capella Space, Advancing Vision for Space-Based Quantum Communications",
  "url": "https://www.ionq.com/news/ionq-completes-acquisition-of-capella-space-advancing-vision-for-space-based"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company executive transition notice dates founding to 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.capellaspace.com/news/capella-space-appoints-aerospace-executive-frank-backes-as-ceo",
        "https://www.ionq.com/news/ionq-completes-acquisition-of-capella-space-advancing-vision-for-space-based",
        "https://www.ae.utexas.edu/news/banazadeh-startup-sar-satellites"
      ],
      "year": 2016
    }
  ]
}

Freenome

Freenome's July 2026 release describes blood-based cancer screening built around an AI and machine learning multiomics platform.

Its Personalized Cancer Detection approach combines blood tests with digital tools to identify eligible patients and guide screening according to individual health profiles.

The company describes linking screening results with longitudinal data to inform later product development and participation; these are stated objectives rather than independently verified clinical outcomes.

Sources and details

Freenome Debuts as a Publicly Traded Company Focused on Blood-Based Early Cancer Detection - Freenome

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2026-07-20T20:03:24+00:00",
    "datePublished": "2026-07-20T12:37:22+00:00",
    "retrieved_utc": "2026-10-07T18:00:49.222893+00:00",
    "visible_or_selected_document_date": "2026-07-20"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-07-20"
    },
    {
      "role": "datePublished",
      "value": "2026-07-20T12:37:22+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-07-20T20:03:24+00:00"
    }
  ],
  "id": "organization-company-a4afe20022f7b3::S1",
  "title": "Freenome Debuts as a Publicly Traded Company Focused on Blood-Based Early Cancer Detection - Freenome",
  "url": "https://www.freenome.com/newsroom/freenome-debuts-as-a-publicly-traded-company-focused-on-blood-based-early-cancer-detection/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://a16z.com/announcement/freenome/",
        "https://www.freenome.com/our-company/",
        "https://www.freenome.com/newsroom/freenome-debuts-as-a-publicly-traded-company-focused-on-blood-based-early-cancer-detection/"
      ],
      "year": 2014
    }
  ]
}

GitHub

GitHub's cached Copilot page describes coding assistance across an editor, GitHub, command-line tools, and connected applications.

It presents a workspace for assigning work to multiple agents, tracking progress, reviewing changes, and merging completed tasks.

The page also describes shared project context through Copilot Spaces and enterprise controls for agent activity, audit logs, and permitted MCP servers.

Sources and details

GitHub Copilot · Your AI coding agent · GitHub · GitHub

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:57.468258+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-f911e414cf6bdf::S1",
  "title": "GitHub Copilot · Your AI coding agent · GitHub · GitHub",
  "url": "https://github.com/features/copilot"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding/public-launch year in GitHub's contemporaneous quick facts; earlier product-development work should not replace this with a 2007 company year.",
      "date": "2008",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://github.com/about",
        "https://gist.github.com/briandoll/3040759",
        "https://github.blog/open-source/whats-next-for-git-20-years-in-the-community-is-still-pushing-forward/",
        "https://github.com/features/copilot",
        "https://news.microsoft.com/en-my/2018/06/05/microsoft-to-acquire-github-for-7-5-billion/",
        "https://microsoft.gcs-web.com/static-files/7c96b326-33bc-4b84-8abb-7afd7a517ea3",
        "https://blogs.microsoft.com/blog/2018/10/26/microsoft-completes-github-acquisition/"
      ],
      "year": 2008
    }
  ]
}

HeyGen

Joshua Xu's cached HeyGen essay recounts developing AI-generated talking-head video for business communication.

The account separates building a video engine from turning that technology into a subscription product tested with users.

Xu frames the transition from camera-based production to generated content around finding sustained customer value and product-market fit, rather than a compelling demonstration alone.

Sources and details

0 - 1M ARR in 7 months | HeyGen

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Visible last-updated date differs from structured metadata; both retained.",
  "authors": [
    "Joshua Xu"
  ],
  "authors_in_source_order": [
    "Joshua Xu"
  ],
  "dates": {
    "dateModified": "2025-04-23T12:15:00.000Z",
    "datePublished": "2023-04-26",
    "retrieved_utc": "2026-10-07T18:00:53.218613+00:00",
    "visible_last_updated": "2026-05-04"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_last_updated",
      "value": "2026-05-04"
    },
    {
      "role": "dateModified",
      "value": "2025-04-23T12:15:00.000Z"
    },
    {
      "role": "datePublished",
      "value": "2024-04-26T12:15:00.000Z"
    },
    {
      "role": "datePublished",
      "value": "2023-04-26"
    }
  ],
  "id": "organization-company-4f556efbe75b6b::S1",
  "title": "0 - 1M ARR in 7 months | HeyGen",
  "url": "https://www.heygen.com/blog/0-1m-arr-in-7-months"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Visible last-updated date differs from structured metadata; both retained.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Visible last-updated date differs from structured metadata; both retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder says company began in December 2020; Movio product launched July 29, 2022.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.heygen.com/author/joshua-xu",
        "https://www.heygen.com/author/wayne-liang",
        "https://www.heygen.com/blog/0-1m-arr-in-7-months"
      ],
      "year": 2020
    }
  ]
}

insitro

insitro's cached purpose page describes combining large multimodal datasets with machine learning to investigate disease biology.

The company links laboratory and clinical data to predictions and causal insights intended to inform therapeutic discovery.

It also describes cross-disciplinary teams bridging life science and data science as a requirement for selecting useful problems and interpreting the resulting data.

Sources and details

Better Medicine in the Epoch of Machine Learning - insitro

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2026-08-03T14:00:09+00:00",
    "datePublished": "2023-08-29T18:05:27+00:00",
    "retrieved_utc": "2026-10-07T18:00:54.686552+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "datePublished",
      "value": "2023-08-29T18:05:27+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-08-03T14:00:09+00:00"
    }
  ],
  "id": "organization-company-c08c62e81a69dc::S1",
  "title": "Better Medicine in the Epoch of Machine Learning - insitro",
  "url": "https://www.insitro.com/purpose/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official purpose page states Daphne Koller founded insitro in 2018.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.insitro.com/purpose/",
        "https://www.insitro.com/leadership/daphne-koller/"
      ],
      "year": 2018
    }
  ]
}

Isomorphic Labs

Isomorphic Labs' May 2026 release describes an AI drug design engine called IsoDDE.

The company plans to use new funding to continue development and deployment of that engine and advance therapeutic programs toward clinical work.

The release connects that expansion to AI, engineering, drug design, and clinical hiring, presenting progress toward medicines as a development plan rather than completed therapeutic results.

Sources and details

Isomorphic Labs 2.0

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:55.578226+00:00",
    "visible_or_selected_document_date": "2026-05-12"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-05-12"
    }
  ],
  "id": "organization-company-99c23a9b563859::S1",
  "title": "Isomorphic Labs 2.0",
  "url": "https://www.isomorphiclabs.com/press/isomorphic-labs-funding"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.isomorphiclabs.com/people/sir-demis-hassabis-phd",
        "https://www.isomorphiclabs.com/press/isomorphic-labs-funding",
        "https://www.isomorphiclabs.com/articles/isomorphic-labs-announces-first-phase-of-management-team",
        "https://www.isomorphiclabs.com/articles/isomorphic-labs-announces-new-scientific-advisory-board"
      ],
      "year": 2021
    }
  ]
}

Khan Academy

Khan Academy's cached Khanmigo page describes an AI tutor and teaching assistant with separate uses for teachers, learners, parents, and school districts.

Its learner workflow emphasizes questions and guided problem solving rather than simply supplying an answer.

The page also presents writing practice and teacher-support tools, including rubric generation tied to lesson plans and objectives.

Sources and details

Meet Khanmigo: Khan Academy's AI-powered teaching assistant & tutor

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:55.692843+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-5c11a47a040d1e::S1",
  "title": "Meet Khanmigo: Khan Academy's AI-powered teaching assistant & tutor",
  "url": "https://www.khanacademy.org/khan-labs"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Nonprofit incorporation in 2008. Sal Khan’s remote tutoring began in 2004 and YouTube lessons in 2006; neither is the nonprofit incorporation year.",
      "date": "2008",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://support.khanacademy.org/hc/en-us/articles/202483180-What-is-the-history-of-Khan-Academy",
        "https://www.khanacademy.org/khan-labs"
      ],
      "year": 2008
    }
  ]
}

Komodo Health

Komodo Health's September 2019 release describes its Healthcare Map as longitudinal patient data supporting cloud-based AI and analytics.

The company says it integrates clinical encounters from many sources, including payers, to study patient journeys and clinician practices.

The release frames trend identification, prediction, and healthcare efficiency as uses of that data infrastructure, without independently establishing patient outcomes.

Sources and details

Komodo Health Is Named One of 20 Rising Stars as Part of Forbes’ Cloud 100 List

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2024-11-19T14:23:50",
    "datePublished": "2019-09-11T16:21:00",
    "retrieved_utc": "2026-10-07T18:00:55.964446+00:00",
    "visible_or_selected_document_date": "2019-09-11"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2019-09-11"
    },
    {
      "role": "datePublished",
      "value": "2019-09-11T16:21:00"
    },
    {
      "role": "dateModified",
      "value": "2024-11-19T14:23:50"
    }
  ],
  "id": "organization-company-4fcadf0330dd4f::S1",
  "title": "Komodo Health Is Named One of 20 Rising Stars as Part of Forbes’ Cloud 100 List",
  "url": "https://www.komodohealth.com/press/2019-09-komodo-health-is-named-one-of-20-rising-stars-as-part-of-forbes-cloud-100-list/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.komodohealth.com/press/komodo-health-appoints-laurent-bride-as-chief-technology-officer/",
        "https://www.komodohealth.com/press/2019-09-komodo-health-is-named-one-of-20-rising-stars-as-part-of-forbes-cloud-100-list/"
      ],
      "year": 2014
    }
  ]
}

Lexion

Lexion's cached company story describes using language-processing advances to extract key details from contracts.

The company positions that extraction as reducing filing and manual reporting so legal teams can focus on advice and business decisions.

The page describes contracting workflows spanning legal, sales, procurement, finance, human resources, and IT, alongside its origin at the Allen Institute for AI.

Sources and details

About Us - Lexion

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:56.695638+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-768fb5f2942945::S1",
  "title": "About Us - Lexion",
  "url": "https://www.lexion.ai/about"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Corporate about page and English acquirer release say founded in 2019; founders met and began precursor work in 2018.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.lexion.ai/about",
        "https://investor.docusign.com/news-and-events/press-releases/news-details/2024/DOCUSIGN-ANNOUNCES-AGREEMENT-TO-ACQUIRE-LEXION/default.aspx",
        "https://investor.docusign.com/files/doc_financials/2025/ar/DOCU_Annual-Report-FY25.pdf"
      ],
      "year": 2019
    }
  ]
}

Lightricks

Lightricks' cached company page describes photo and video generation models, including LTXV, powering its creative applications.

It names Facetune, Photoleap, Videoleap, and LTX Studio as interfaces through which creators and brands use those models.

The page separately describes Popular Pays as connecting creators with brands for content partnerships and monetization.

Sources and details

PressKit

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:43.583207+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-ea4a89f1080ddd::S1",
  "title": "PressKit",
  "url": "https://www.lightricks.com/about"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder retrospective and 2019 company announcement state 2013.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.lightricks.com/about",
        "https://www.lightricks.com/creators-survey-blog/ai-will-drive-the-evolution-of-human-creativity",
        "https://www.lightricks.com/post/apple-and-google-awards",
        "https://councils.forbes.com/profile/Zeev-Farbman-CEO-Co-Founder-Lightricks/092465d2-97c6-426d-bc86-ffe67ab3dbdd",
        "https://static.lightricks.com/legal/Privacy%20Policy%20-%20LTX%20Platform.pdf"
      ],
      "year": 2013
    }
  ]
}

LlamaIndex

Jerry Liu's cached LlamaIndex essay describes a framework connecting private data to language-model applications.

It separates ingestion, parsing, storage, and indexing from retrieval, response synthesis, and multistep interaction over that data.

The essay describes integrations with files, workplace applications, databases, and vector stores to support search, chat, analytics, and knowledge-agent workflows.

Sources and details

LLM Data Framework: How to Build With Private Data | LlamaIndex

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Jerry Liu"
  ],
  "authors_in_source_order": [
    "Jerry Liu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:33.509536+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-ai-bbef28c9ea693d::S1",
  "title": "LLM Data Framework: How to Build With Private Data | LlamaIndex",
  "url": "https://www.llamaindex.ai/blog/building-the-data-framework-for-llms-bca068e89e0e?source=rss----d7683ed5043e--machine_learning"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "June 6, 2023 founder announcement explicitly describes starting a company with Simon Suo; underlying GPT Index project began in November 2022 and was subsequently renamed LlamaIndex.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.llamaindex.ai/blog/building-the-data-framework-for-llms-bca068e89e0e?source=rss----d7683ed5043e--machine_learning",
        "https://www.linkedin.com/posts/jerry-liu-64390071_building-the-data-framework-for-llms-activity-7071863163855540224-Nei7"
      ],
      "year": 2023
    }
  ]
}

Luma AI

Luma AI's September 2025 release introduces Ray3 as a video-generation model offered through Dream Machine.

The company describes output in high-dynamic-range EXR formats for professional film and advertising workflows.

The release separates a Draft Mode for exploring ideas from later selection and refinement into higher-quality video, while attributing output evaluation and reasoning capabilities to the company's claims.

Sources and details

Luma AI launches Ray3 | Luma

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Luma"
  ],
  "authors_in_source_order": [
    "Luma"
  ],
  "dates": {
    "dateModified": "2026-03-10T13:47:16Z",
    "datePublished": "2025-09-18T15:39:00.000Z",
    "retrieved_utc": "2026-10-07T18:00:05.727857+00:00",
    "visible_or_selected_document_date": "2025-09-18"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2025-09-18"
    },
    {
      "role": "datePublished",
      "value": "2025-09-18T15:39:00.000Z"
    },
    {
      "role": "dateModified",
      "value": "2026-03-10T13:47:16Z"
    }
  ],
  "id": "organization-company-9a9c4f69224a9b::S1",
  "title": "Luma AI launches Ray3 | Luma",
  "url": "https://lumalabs.ai/news/ray3"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://lumalabs.ai/news/ray3",
        "https://a16z.com/announcement/investing-in-luma-ai/",
        "https://lumalabs.ai/llm-info"
      ],
      "year": 2021
    }
  ]
}

Meta

Rajiv Krishnamurthy and Wes Bland's August 2026 engineering article describes Meta's MTIA 300 accelerator for training ranking and recommendation models.

It explains that large embedding tables create substantial communication demands and describes network chiplets integrated into the chip package.

The article links the hardware to a co-designed HCCL communication library, with network interfaces allocated between traffic inside a rack and traffic across racks.

Sources and details

MTIA 300: Meta's First Training Chip with Built-in NICs and Communication-Offloading Engines - Engineering at Meta

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Rajiv Krishnamurthy",
    "Wes Bland"
  ],
  "authors_in_source_order": [
    "Rajiv Krishnamurthy",
    "Wes Bland"
  ],
  "dates": {
    "dateModified": "2026-08-27T23:04:49+00:00",
    "datePublished": "2026-08-24T17:45:52+00:00",
    "retrieved_utc": "2026-10-07T18:22:55.936153+00:00",
    "visible_or_selected_document_date": "2026-08-24"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-08-24"
    },
    {
      "role": "datePublished",
      "value": "2026-08-24T17:45:52+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-08-27T23:04:49+00:00"
    }
  ],
  "id": "supply-org-033::S1",
  "title": "MTIA 300: Meta's First Training Chip with Built-in NICs and Communication-Offloading Engines - Engineering at Meta",
  "url": "https://engineering.fb.com/2026/08/24/networking-traffic/mtia-300-meta-training-chip-built-in-nics/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Facebook launched February 4, 2004; Meta is later corporate brand.",
      "date": "2004",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://about.fb.com/es/company--info/",
        "https://investor.atmeta.com/leadership-and-governance/?section=contact",
        "https://seas.harvard.edu/news/experiment-fund-welcomes-accel-polaris-and-new-advisers"
      ],
      "year": 2004
    }
  ]
}

Microsoft

Scott Guthrie's January 2026 Microsoft article introduces Maia 200 as an accelerator for AI inference and token generation.

It describes low-precision tensor computation, high-bandwidth memory, on-chip storage, and data movement engines for serving large models.

The article also presents a preview SDK with PyTorch integration, a Triton compiler, kernel libraries, and lower-level programming access for model optimization.

Sources and details

Maia 200: The AI accelerator built for inference - The Official Microsoft Blog

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Scott Guthrie"
  ],
  "authors_in_source_order": [
    "Scott Guthrie"
  ],
  "dates": {
    "dateModified": "2026-01-26T16:52:44+00:00",
    "datePublished": "2026-01-26T08:00:30",
    "retrieved_utc": "2026-10-07T18:01:48.931203+00:00",
    "visible_or_selected_document_date": "2026-01-26"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-01-26"
    },
    {
      "role": "datePublished",
      "value": "2026-01-26T16:00:30+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-01-26T16:52:44+00:00"
    },
    {
      "role": "datePublished",
      "value": "2026-01-26T08:00:30"
    }
  ],
  "id": "supply-org-030::S1",
  "title": "Maia 200: The AI accelerator built for inference - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2026/01/26/maia-200-the-ai-accelerator-built-for-inference/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Business began in 1975; not the date of a later incorporation.",
      "date": "1975",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://news.microsoft.com/microsoft-50/",
        "https://www.microsoft.com/en-us/ai"
      ],
      "year": 1975
    }
  ]
}

Midjourney

Midjourney's cached website guide distinguishes browsing community work from creating and editing images and videos.

Its Explore interface exposes a creation's prompt and settings and offers shortcuts for reusing material or finding similar visuals.

The guide also describes a Style Explorer for testing and saving reference codes, while separating liked styles from personalization profiles.

Sources and details

Website Overview – Midjourney

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:59:04.215620+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-d019cd1dbe3bc3::S1",
  "title": "Website Overview – Midjourney",
  "url": "https://docs.midjourney.com/hc/en-us/articles/33329460426765-Website-Overview"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Society for Science institutional biography of trustee David Holz explicitly states Midjourney was founded in 2021. This is company founding, not its 2022 image-service launch.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.midjourney.com/medical/faq",
        "https://docs.midjourney.com/hc/en-us/articles/33329460426765-Website-Overview",
        "https://www.societyforscience.org/people/david-holz/"
      ],
      "year": 2021
    }
  ]
}

Mobileye

Mobileye's cached company history traces its initial approach to detecting vehicles with a camera and software on a processor.

It describes a later decision to design the EyeQ system-on-chip specifically for computer-vision computation.

The account presents hardware and software development in concert as central to that approach and places the company's public listing and Intel acquisition in its historical timeline.

Sources and details

About Mobileye | Our Vision, History, and Milestones

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:00.951800+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-823d0dbde8a957::S1",
  "title": "About Mobileye | Our Vision, History, and Milestones",
  "url": "https://www.mobileye.com/en/about/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "1999 is operating-company founding in Israel; public listing in 2022 is not founding.",
      "date": "1999",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.mobileye.com/investor-resources/investor-faqs",
        "https://www.mobileye.com/en/about/"
      ],
      "year": 1999
    }
  ]
}

Momenta

Momenta's cached company page distinguishes production assisted-driving solutions from scalable autonomous-driving projects.

Its production offering covers Level 2 through Level 2++ features, with Level 3 and Level 4 described as future advances.

The autonomous portfolio centers on robotaxis and delivery vans and describes expansion toward trucks for additional commercial scenarios.

Sources and details

About us

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:01.241313+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-ad28e918f26bee::S1",
  "title": "About us",
  "url": "https://www.momenta.ai/en/about.html"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company and investor biographies date founding to September 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.momenta.ai/en/about.html",
        "https://ir.momenta.ai/en/investor-relations/corporate-governance/"
      ],
      "year": 2016
    }
  ]
}

Nauto

The cached Nauto investment essay describes a fleet-safety product using AI and deep learning for driving-risk warnings.

It lists pedestrian and vulnerable-road-user alerts together with detection of distraction, drowsiness, phone use, and seat-belt policy violations.

The essay also describes a mobile app for drivers and fleet managers to access safety information and assess driving, while its later hosting notice is kept separate from the historical Nauto product account.

Sources and details

Stellantis Ventures Announces Strategic Investment in Nauto — Empiric Earth

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Republished Nauto essay hosted with later Empiric Earth notice; no present identity consolidation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2026-09-14T20:59:51.376Z",
    "datePublished": "2023-06-15T00:00:00.000Z",
    "retrieved_utc": "2026-10-07T18:01:03.321289+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "datePublished",
      "value": "2023-06-15T00:00:00.000Z"
    },
    {
      "role": "dateModified",
      "value": "2026-09-14T20:59:51.376Z"
    }
  ],
  "id": "organization-company-980abda4ad1bb1::S1",
  "title": "Stellantis Ventures Announces Strategic Investment in Nauto — Empiric Earth",
  "url": "https://www.nauto.com/blog/stellantis-ventures-announces-strategic-investment-in-nauto"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Republished Nauto essay hosted with later Empiric Earth notice; no present identity consolidation.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Republished Nauto essay hosted with later Empiric Earth notice; no present identity consolidation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.nauto.com/blog/stellantis-ventures-announces-strategic-investment-in-nauto",
        "https://www.nauto.com/blog/automotive-ai-technology-company-launches-in-japan"
      ],
      "year": 2015
    }
  ]
}

neptune.ai

deepsense.io's September 2016 Neptune launch announcement describes managing and monitoring multiple machine learning experiments.

It presents a web interface and command-line tools for collaboration, live metrics, and control of long-running experiments.

The announcement says Neptune stores experiment environments and related artifacts so teams can compare work and rerun experiments.

Sources and details

World premiere of Neptune - deepsense.io’s new machine learning platform for managing data science experiments - deepsense.ai

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "deepsense.ai"
  ],
  "authors_in_source_order": [
    "deepsense.ai"
  ],
  "dates": {
    "dateModified": "2025-08-25T09:32:43+00:00",
    "datePublished": "2016-09-28T10:21:57+00:00",
    "retrieved_utc": "2026-10-07T17:59:01.916324+00:00",
    "visible_or_selected_document_date": "2016-09-28"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2016-09-28"
    },
    {
      "role": "datePublished",
      "value": "2016-09-28T10:21:57+00:00"
    },
    {
      "role": "dateModified",
      "value": "2025-08-25T09:32:43+00:00"
    }
  ],
  "id": "organization-company-b4658177fb880d::S1",
  "title": "World premiere of Neptune - deepsense.io’s new machine learning platform for managing data science experiments - deepsense.ai",
  "url": "https://deepsense.ai/blog/world-premiere-of-neptune-deepsense-ios-new-machine-learning-platform-for-managing-data-science-experiments/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Independent spin-out in 2018 according to Neptune’s own report. The in-house tool and initial public product originated at deepsense.ai in 2016. Some secondary accounts say 2017; an incorporation date was not verified.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://openai.com/index/openai-to-acquire-neptune/",
        "https://www.linkedin.com/posts/neptuneai_inside-the-2025-state-of-foundation-model-activity-7345409536083529729-VskW",
        "https://neptune.ai/wp-content/uploads/2025/06/State-of-FM-Training-Report-2025.pdf",
        "https://deepsense.ai/blog/world-premiere-of-neptune-deepsense-ios-new-machine-learning-platform-for-managing-data-science-experiments/",
        "https://support.neptune.ai/en/articles/13925165-service-shutdown-overview",
        "https://neptune.ai/wp-content/uploads/terms-of-service.pdf"
      ],
      "year": 2018
    }
  ]
}

OctoAI

OctoAI's April 2024 release describes OctoStack as a production stack for serving generative models in a customer's cloud or on-premises environment.

It combines inference serving, customization, and asset management while allowing organizations to choose model, location, and hardware.

The release describes optimization across model input and GPU execution, with ongoing model and hardware updates for on-premises subscribers.

Sources and details

OctoAI Unveils Industry-First Generative AI Production Stack For The Enterprise

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "OctoAI"
  ],
  "authors_in_source_order": [
    "OctoAI"
  ],
  "dates": {
    "dateModified": "2024-04-02T09:00:00-04:00",
    "datePublished": "2024-04-02T09:00:00-04:00",
    "retrieved_utc": "2026-10-07T18:01:08.582023+00:00",
    "visible_or_selected_document_date": "2024-04-02"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2024-04-02"
    },
    {
      "role": "datePublished",
      "value": "2024-04-02T09:00:00-04:00"
    },
    {
      "role": "dateModified",
      "value": "2024-04-02T09:00:00-04:00"
    }
  ],
  "id": "organization-company-a56c87d2e3ed81::S1",
  "title": "OctoAI Unveils Industry-First Generative AI Production Stack For The Enterprise",
  "url": "https://www.prnewswire.com/news-releases/octoai-unveils-industry-first-generative-ai-production-stack-for-the-enterprise-302105751.html"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company formed in late July 2019 per founder interview hosted by investor Madrona. OctoAI began as a product in 2023, and became the company brand by 2024; those dates do not reset founding.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.madrona.com/companies/",
        "https://www.madrona.com/founded-and-funded-deploying-ml-models-in-the-cloud-on-phones-in-devices-with-luis-ceze-and-jason-knight-of-octoml/",
        "https://www.prnewswire.com/news-releases/octoai-unveils-industry-first-generative-ai-production-stack-for-the-enterprise-302105751.html",
        "https://www.linkedin.com/company/octoaicloud"
      ],
      "year": 2019
    }
  ]
}

Otter.ai

Otter.ai's February 2021 release describes collaborative note-taking that works with Zoom, Google Meet, telephone calls, and other voice communication.

It connects development of the meeting product to AI, language processing, and software engineering investment.

The cached page separately adds a later notice about meeting agents that answer questions and complete tasks, which is not treated as part of the original 2021 launch account.

Sources and details

Otter.ai raises $50 million Series B led by Spectrum Equity to address over a billion users of online meetings | Otter.ai

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Later meeting-agent update and original 2021 release are distinct.",
  "authors": [
    "Otter"
  ],
  "authors_in_source_order": [
    "Otter"
  ],
  "dates": {
    "datePublished": "Feb 25, 2021",
    "retrieved_utc": "2026-10-07T18:02:08.069670+00:00",
    "visible_or_selected_document_date": "2021-02-25"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2021-02-25"
    },
    {
      "role": "datePublished",
      "value": "Feb 25, 2021"
    }
  ],
  "id": "organization-company-ea3f9337024843::S1",
  "title": "Otter.ai raises $50 million Series B led by Spectrum Equity to address over a billion users of online meetings | Otter.ai",
  "url": "https://otter.ai/blog/otter-raises-50-million?0db891cc_page=8&7bd4a6f3_page=2"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Later meeting-agent update and original 2021 release are distinct.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Later meeting-agent update and original 2021 release are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official vendor-information page states Delaware incorporation in April 2016; company anniversary post identifies Sam Liang and Yun Fu as co-founders.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.linkedin.com/posts/otter-ai_10-years-ago-sam-liang-and-yun-fu-co-founded-activity-7470173405372133376-5GAD",
        "https://otter.ai/blog/otter-raises-50-million?0db891cc_page=8&7bd4a6f3_page=2",
        "https://help.otter.ai/hc/en-us/articles/360059938373-Vendor-and-remittance-details-for-Otter-ai"
      ],
      "year": 2016
    }
  ]
}

Paige

Amanda Wolfe's cached Paige release describes Prostate Detect as assisting pathologists reviewing scanned whole-slide images of prostate needle biopsies.

It reports a comparison of diagnostic readings with and without the software rather than describing automated replacement of pathologists.

The release discusses specialist and non-specialist readers and on-site and remote review; its performance and authorization claims remain attributed to the company release, without an independent assessment of the study.

Sources and details

Paige Publishes Data Supporting First FDA-Authorized AI Software for Digital Pathology — Paige.ai

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Amanda Wolfe"
  ],
  "authors_in_source_order": [
    "Amanda Wolfe"
  ],
  "dates": {
    "dateModified": "2025-06-13T10:38:27-0700",
    "datePublished": "2022-12-21T07:00:00-0800",
    "retrieved_utc": "2026-10-07T18:01:05.010488+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "datePublished",
      "value": "2022-12-21T07:00:00-0800"
    },
    {
      "role": "dateModified",
      "value": "2025-06-13T10:38:27-0700"
    }
  ],
  "id": "organization-company-3eac49138be02a::S1",
  "title": "Paige Publishes Data Supporting First FDA-Authorized AI Software for Digital Pathology — Paige.ai",
  "url": "https://www.paige.ai/press-releases/paige-publishes-data-supporting-first-fda-authorized-ai-software-for-digital-pathology"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.paige.ai/press-releases/paige-publishes-data-supporting-first-fda-authorized-ai-software-for-digital-pathology",
        "https://www.paige.ai/press-releases/paige-appoints-new-leadership",
        "https://investors.tempus.com/news-releases/news-release-details/tempus-announces-acquisition-paige"
      ],
      "year": 2017
    }
  ]
}

Perplexity

Perplexity AI's March 2023 release describes a conversational answer engine that returns concise answers with citations.

It announces an iOS application following availability through the company's website and Chrome extension.

The app announcement adds sign-in for personalization, persistent search history, and social sharing, while the release's accuracy claims remain company assertions.

Sources and details

Perplexity AI Launches iOS Version of Conversational Answer Engine, Announces $25.6M Series A Round Led by NEA

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Perplexity AI"
  ],
  "authors_in_source_order": [
    "Perplexity AI"
  ],
  "dates": {
    "dateModified": "2023-03-28T07:01:00-04:00",
    "datePublished": "2023-03-28T07:01:00-04:00",
    "retrieved_utc": "2026-10-07T17:58:38.662230+00:00",
    "visible_or_selected_document_date": "2023-03-28"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2023-03-28"
    },
    {
      "role": "datePublished",
      "value": "2023-03-28T07:01:00-04:00"
    },
    {
      "role": "dateModified",
      "value": "2023-03-28T07:01:00-04:00"
    }
  ],
  "id": "organization-ai-4e41b7575de8bf::S1",
  "title": "Perplexity AI Launches iOS Version of Conversational Answer Engine, Announces $25.6M Series A Round Led by NEA",
  "url": "https://www.prnewswire.com/news-releases/perplexity-ai-launches-ios-version-of-conversational-answer-engine-announces-25-6m-series-a-round-led-by-nea-301782754.html"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official launch/funding release says formed 2022; company blog gives August 2022.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.prnewswire.com/news-releases/perplexity-ai-launches-ios-version-of-conversational-answer-engine-announces-25-6m-series-a-round-led-by-nea-301782754.html",
        "https://www.perplexity.ai/es/hub/blog/anuncio-de-nuestra-ronda-de-financiacion-serie-a-y-lanzamiento-de-aplicacion-movil"
      ],
      "year": 2022
    }
  ]
}

Plaid

Zach Perret's May 2026 Plaid recap describes financial-data models used across fraud, credit, payments, and financial management products.

It describes a fraud graph tracing relationships among devices, identities, bank accounts, and applications.

The recap separately presents transaction categorization, income analysis, and a proposed model interpreting sequences of transactions, keeping future development distinct from announced products.

Sources and details

Everything we announced at Plaid Effects 2026 | Plaid

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Zach Perret"
  ],
  "authors_in_source_order": [
    "Zach Perret"
  ],
  "dates": {
    "dateModified": "2026-05-21",
    "datePublished": "2026-05-21",
    "retrieved_utc": "2026-10-07T17:57:54.120803+00:00",
    "visible_or_selected_document_date": "2026-05-21"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-05-21"
    },
    {
      "role": "datePublished",
      "value": "2026-05-21"
    },
    {
      "role": "dateModified",
      "value": "2026-05-21"
    }
  ],
  "id": "organization-company-147d7f24c07401::S1",
  "title": "Everything we announced at Plaid Effects 2026 | Plaid",
  "url": "https://plaid.com/blog/effects-2026-recap/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official newsroom explicitly states founded in 2013. Some secondary accounts describe founder work in 2012; 2013 is the company’s stated founding milestone, not independently checked incorporation.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://plaid.com/en-gb/press/",
        "https://plaid.com/blog/effects-2026-recap/"
      ],
      "year": 2013
    }
  ]
}

Scale AI

Alexandr Wang's May 2024 Scale essay describes supplying data throughout AI development, with separate data engines for autonomy and public-sector work.

It recounts reinforcement learning with human feedback and evaluation and red-teaming as parts of the company's work.

The essay identifies data abundance, more challenging frontier data, and measurement as priorities for its next phase, rather than treating financing as evidence of model quality.

Sources and details

Scale’s Series F: Expanding the Data Foundry for AI | Scale AI

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Alexandr Wang"
  ],
  "authors_in_source_order": [
    "Alexandr Wang"
  ],
  "dates": {
    "dateModified": "2026-09-09T19:21:25Z",
    "datePublished": "2024-05-21T13:00:00.000Z",
    "retrieved_utc": "2026-10-07T17:57:57.146158+00:00",
    "visible_or_selected_document_date": "2024-05-21"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2024-05-21"
    },
    {
      "role": "datePublished",
      "value": "2024-05-21T13:00:00.000Z"
    },
    {
      "role": "dateModified",
      "value": "2026-09-09T19:21:25Z"
    }
  ],
  "id": "organization-ai-2815b18333183c::S1",
  "title": "Scale’s Series F: Expanding the Data Foundry for AI | Scale AI",
  "url": "https://scale.com/blog/scale-ai-series-f"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history and founder account both state 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://scale.com/blog/scale-ai-series-f",
        "https://scale.com/about",
        "https://www.passes.com/team",
        "https://scale.com/blog/scale-ai-announces-next-phase-of-company-evolution",
        "https://scale.com/blog/customer-trust-scale-meta-deal"
      ],
      "year": 2016
    }
  ]
}

Sift

Sift's December 2019 retrospective describes Dynamic Friction as adjusting obstacles in user journeys according to behavioral and situational signals.

The company frames this approach around distinguishing trusted users from risky activity rather than applying the same checks to everyone.

The essay places that feature alongside integrations and product changes under its Digital Trust and Safety approach; its revenue and fraud-prevention benefits remain company claims.

Sources and details

Sift in 2019: The Rebrand and Dynamic Friction Launch

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Sift Trust and Safety Team"
  ],
  "authors_in_source_order": [
    "Sift Trust and Safety Team"
  ],
  "dates": {
    "dateModified": "2026-08-24T13:01:58+00:00",
    "datePublished": "2019-12-31T21:50:08+00:00",
    "retrieved_utc": "2026-10-07T18:00:15.329070+00:00",
    "visible_or_selected_document_date": "2019-12-31"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2019-12-31"
    },
    {
      "role": "datePublished",
      "value": "2019-12-31T21:50:08+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-08-24T13:01:58+00:00"
    }
  ],
  "id": "organization-company-5b56d21e16392e::S1",
  "title": "Sift in 2019: The Rebrand and Dynamic Friction Launch",
  "url": "https://sift.com/blog/sift-in-2019-looking-back-on-an-eventful-year/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Investor profile gives 2011 founding; founder company post in 2019 calls it his eighth anniversary.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://sift.com/blog/our-commitment-to-data-privacy/",
        "https://www.ycombinator.com/companies/sift",
        "https://sift.com/company/",
        "https://sift.com/blog/sift-in-2019-looking-back-on-an-eventful-year/"
      ],
      "year": 2011
    }
  ]
}

Snowflake

Benoit Dageville's June 2020 Snowflake article describes each cloud region as three independently scaling tiers.

A storage tier uses the host cloud's object storage, while separate compute clusters can run different workloads over shared data.

The cloud-services tier manages sessions, metadata, transactions, query planning, and governance, serving as the regional control plane and client interface.

Sources and details

Delivering a Single Data Experience Across Multiple Clouds & Regions

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Benoit Dageville"
  ],
  "authors_in_source_order": [
    "Benoit Dageville"
  ],
  "dates": {
    "dateModified": "2024-08-05",
    "datePublished": "2020-06-02",
    "retrieved_utc": "2026-10-07T17:58:42.387327+00:00",
    "visible_or_selected_document_date": "2020-06-02"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2020-06-02"
    },
    {
      "role": "datePublished",
      "value": "2020-06-02"
    },
    {
      "role": "dateModified",
      "value": "2024-08-05"
    }
  ],
  "id": "organization-company-1dbd59f661d68b::S1",
  "title": "Delivering a Single Data Experience Across Multiple Clouds & Regions",
  "url": "https://www.snowflake.com/en/blog/how-snowflake-delivers-a-single-data-experience-across-multiple-clouds-and-regions/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded summer 2012.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.snowflake.com/en/company/overview/leadership-and-board/",
        "https://www.snowflake.com/en/blog/how-snowflake-delivers-a-single-data-experience-across-multiple-clouds-and-regions/",
        "https://careers.snowflake.com/us/en/warsaw-poland/"
      ],
      "year": 2012
    }
  ]
}

Snyk

Snyk's cached Code page describes static analysis and proposed automatic repairs within developer workflows.

It presents scanning in an IDE, repository, pull request, and CI/CD pipeline together with contextual explanations and prioritization.

The page connects its repair approach to security intelligence and frontier models, while claimed speed, accuracy, and remediation percentages remain unverified marketing assertions.

Sources and details

Snyk Code | SAST Code Scanning Tool | Code Security Analysis & Fixes | Snyk

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:17.245761+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-d5ad44951723e5::S1",
  "title": "Snyk Code | SAST Code Scanning Tool | Code Security Analysis & Fixes | Snyk",
  "url": "https://snyk.io/product/snyk-code/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://snyk.io/about/board/",
        "https://snyk.io/podcasts/the-secure-developer/ask-guypo-anything/",
        "https://www.accel.com/companies/snyk",
        "https://snyk.io/product/snyk-code/"
      ],
      "year": 2015
    }
  ]
}

Stability AI

Joshua Lopez's October 2022 Stability AI release describes funding for open models spanning images, language, audio, video, and 3D.

It identifies Stable Diffusion as a text-to-image generator released that August.

The announcement distinguishes that model from DreamStudio, its consumer-facing product, and frames collaboration with developer communities as part of the company's approach.

Sources and details

Stability AI Announces $101 Million in Funding for Open-Source Artificial Intelligence — Stability AI

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Joshua Lopez"
  ],
  "authors_in_source_order": [
    "Joshua Lopez"
  ],
  "dates": {
    "dateModified": "2024-10-14T09:57:40+0000",
    "datePublished": "2022-10-17T12:53:00+0000",
    "retrieved_utc": "2026-10-07T18:12:10.990043+00:00",
    "visible_or_selected_document_date": "2022-10-17"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2022-10-17"
    },
    {
      "role": "datePublished",
      "value": "2022-10-17T12:53:00+0000"
    },
    {
      "role": "dateModified",
      "value": "2024-10-14T09:57:40+0000"
    }
  ],
  "id": "stability-ai::S1",
  "title": "Stability AI Announces $101 Million in Funding for Open-Source Artificial Intelligence — Stability AI",
  "url": "https://stability.ai/news-updates/stability-ai-announces-101-million-in-funding-for-open-source-artificial-intelligence"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "UK Stability AI Ltd incorporated November 4, 2019; group service entities differ by region.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://stability.ai/news-updates/stability-ai-announces-101-million-in-funding-for-open-source-artificial-intelligence",
        "https://find-and-update.company-information.service.gov.uk/company/12295325",
        "https://stability.ai/2025-terms-of-service",
        "https://ifi.u-tokyo.ac.jp/en/event/12460/"
      ],
      "year": 2019
    }
  ]
}

Stripe

Stripe's April 2026 release describes its Agentic Commerce Suite as an integration for selling products within AI applications.

It announces agent payments through Link using a single-use card for each task and user approval of each payment.

The release separately introduces streaming payments combining usage tracking with stablecoin micropayments, intended to charge for rapid AI-token consumption.

Sources and details

Stripe builds out the economic infrastructure for AI with 288 launches

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "datePublished": "2026-04-29T12:00-05:00",
    "retrieved_utc": "2026-10-07T18:00:20.788817+00:00",
    "visible_or_selected_document_date": "2026-04-29"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-04-29"
    },
    {
      "role": "datePublished",
      "value": "2026-04-29T12:00-05:00"
    }
  ],
  "id": "organization-company-961a6062ba1ba2::S1",
  "title": "Stripe builds out the economic infrastructure for AI with 288 launches",
  "url": "https://stripe.com/newsroom/news/sessions-2026"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company materials date initial Stripe launch to 2010. Public commercial launch and incorporation are not separately verified here.",
      "date": "2010",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://stripe.com/newsroom/information",
        "https://stripe.com/en-hk/newsroom/news/stripe-and-uber",
        "https://stripe.com/newsroom/news/sessions-2026"
      ],
      "year": 2010
    }
  ]
}

Valo Health

Valo's September 2020 launch release describes its Opal platform as combining machine learning, cloud computing, and human data for drug development.

The company says this approach analyzes associations between genetic markers and disease to guide discovery of new molecules.

The release also recounts acquiring Numerate and selected FORMA Therapeutics assets to add models, compounds, libraries, and research capacity, while projected development efficiencies remain goals.

Sources and details

Valo | Flagship Pioneering Announces Valo Health to Transform Drug…

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2023-07-31T14:57:37-04:00",
    "datePublished": "2020-09-24T23:19:00-04:00",
    "retrieved_utc": "2026-10-07T18:01:36.010088+00:00",
    "visible_or_selected_document_date": "2020-09-24"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2020-09-24"
    },
    {
      "role": "dateModified",
      "value": "2023-07-31T14:57:37-04:00"
    },
    {
      "role": "datePublished",
      "value": "2020-09-24T23:19:00-04:00"
    }
  ],
  "id": "organization-company-96c5bdfeccd092::S1",
  "title": "Valo | Flagship Pioneering Announces Valo Health to Transform Drug…",
  "url": "https://www.valohealth.com/press/flagship-pioneering-announces-valo-health-to-transform-drug-development-valo-integrates-machine-learning-cloud-computing-and-data-to-create-a-new-drug-discovery-and-development-process-that-can-shave-years-off-timelines-and-improve-the-likelihood-of"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official launch announcement says founded and initially capitalized by Flagship Pioneering in 2019; public unveiling occurred in 2020.",
      "date": "2019",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.valohealth.com/press/valo-raises-190-million-in-series-b-financing-and-unveils-select-therapeutic-programs-details-of-initial-therapeutic-programs-to-be-shared-at-the-39th-j-p-morgan-healthcare-conference",
        "https://www.valohealth.com/press/flagship-pioneering-announces-valo-health-to-transform-drug-development-valo-integrates-machine-learning-cloud-computing-and-data-to-create-a-new-drug-discovery-and-development-process-that-can-shave-years-off-timelines-and-improve-the-likelihood-of",
        "https://www.valohealth.com/press/valo-health-announces-changes-to-its-board-of-directors-and-leadership-team"
      ],
      "year": 2019
    }
  ]
}

Vectra AI

Vectra's June 2017 release describes an Active Enforcement application integrating threat detections with Demisto's orchestration and incident-management tools.

It presents automated data enrichment, collaborative investigation, and response actions selected according to threat type, risk, and certainty.

The release describes blocking attacker traffic or quarantining host devices through other security integrations, with claimed response-time improvements left attributed to the vendors.

Sources and details

Demisto and Vectra reduce the time to detect and respond to hidden cyber attacks - Vectra AI news release

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "html_description_published": "2017-06-28",
    "retrieved_utc": "2026-10-07T17:58:47.559373+00:00"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "html_description_published",
      "value": "2017-06-28"
    }
  ],
  "id": "organization-company-387beb5b8d79cc::S1",
  "title": "Demisto and Vectra reduce the time to detect and respond to hidden cyber attacks - Vectra AI news release",
  "url": "https://www.vectra.ai/about/news/demisto-and-vectra-reduce-the-time-to-detect-and-respond-to-hidden-cyber-attacks"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company story states founding in 2011.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.vectra.ai/about",
        "https://www.vectra.ai/about/news/demisto-and-vectra-reduce-the-time-to-detect-and-respond-to-hidden-cyber-attacks",
        "https://marcrogers.org/marc/",
        "https://securityandtechnology.org/person/marc-rogers/"
      ],
      "year": 2011
    }
  ]
}

Veeva Systems

Veeva's October 2025 release describes agents designed for application-specific life-science workflows in clinical, regulatory, safety, quality, medical, and commercial areas.

It says those agents use application context, prompts, safeguards, and access to application data and documents, with configuration and custom-agent tools on Vault.

The release sets out a staged availability schedule through 2026 and distinguishes Veeva-hosted models from customer-provided models; the schedule is retained as a plan, not verified deployment status.

Sources and details

Veeva AI Agents to Be Released Across All Veeva Applications | Veeva

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2026-08-12T17:23:03-04:00",
    "datePublished": "2025-10-14T10:03:37-04:00",
    "retrieved_utc": "2026-10-07T18:01:38.454504+00:00",
    "visible_or_selected_document_date": "2025-10-14"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2025-10-14"
    },
    {
      "role": "datePublished",
      "value": "2025-10-14T10:03:37-04:00"
    },
    {
      "role": "dateModified",
      "value": "2026-08-12T17:23:03-04:00"
    }
  ],
  "id": "organization-company-728b26f029c127::S1",
  "title": "Veeva AI Agents to Be Released Across All Veeva Applications | Veeva",
  "url": "https://www.veeva.com/resources/veeva-ai-agents-to-be-released-across-all-veeva-applications/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founder biography identifies 2007 founding.",
      "date": "2007",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.veeva.com/leadership/board-of-directors/",
        "https://www.veeva.com/events/rd-summit/agenda/",
        "https://www.veeva.com/resources/veeva-ai-agents-to-be-released-across-all-veeva-applications/",
        "https://www.veeva.com/medtech/products/veeva-ai/"
      ],
      "year": 2007
    }
  ]
}

Vistra

Vistra's May 2026 article describes twenty-year electricity purchase agreements with Meta tied to the Davis-Besse, Perry, and Beaver Valley nuclear plants.

It separates existing generation from additional output planned through plant uprates.

The company describes investments in existing facilities and continued electricity delivery to the PJM grid, while projected jobs and capacity gains remain plans stated in the article.

Sources and details

Vistra and Meta: A Smart, Scalable Nuclear Partnership - Vistra Corp.

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateModified": "2026-05-29T15:28:51+00:00",
    "datePublished": "2026-05-14T14:33:49+00:00",
    "retrieved_utc": "2026-10-07T18:23:21.767307+00:00",
    "visible_or_selected_document_date": "2026-05-14",
    "visible_secondary_date": "2026-05-29"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-05-14"
    },
    {
      "role": "visible_secondary_date",
      "value": "2026-05-29"
    },
    {
      "role": "datePublished",
      "value": "2026-05-14T14:33:49+00:00"
    },
    {
      "role": "dateModified",
      "value": "2026-05-29T15:28:51+00:00"
    }
  ],
  "id": "supply-org-041::S1",
  "title": "Vistra and Meta: A Smart, Scalable Nuclear Partnership - Vistra Corp.",
  "url": "https://vistracorp.com/vistra-and-meta-a-smart-scalable-nuclear-partnership/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Wiz

Assaf Rappaport's 2021 Wiz essay describes examining the cloud stack across virtual machines, containers, accounts, and multiple providers.

It presents analysis linking network, identity, configuration, and workload information into a single graph to prioritize attack vectors.

The essay contrasts connecting to cloud environments with deploying separate tools and describes fitting findings into existing security workflows; later ownership changes are not inferred from this historical source.

Sources and details

Wiz becomes fastest growing security startup ever with new $1.7B valuation | Wiz Blog

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "Assaf Rappaport"
  ],
  "authors_in_source_order": [
    "Assaf Rappaport"
  ],
  "dates": {
    "dateModified": "2021-03-22T13:58:09-04:00",
    "datePublished": "2021-03-22T13:58:09-04:00",
    "retrieved_utc": "2026-10-07T17:58:48.754673+00:00",
    "visible_or_selected_document_date": "2021-03-22",
    "visible_update": "2021-04-07"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2021-03-22"
    },
    {
      "role": "visible_update",
      "value": "2021-04-07"
    },
    {
      "role": "datePublished",
      "value": "2021-03-22T13:58:09-04:00"
    },
    {
      "role": "dateModified",
      "value": "2021-03-22T13:58:09-04:00"
    }
  ],
  "id": "organization-company-3af55534171d76::S1",
  "title": "Wiz becomes fastest growing security startup ever with new $1.7B valuation | Wiz Blog",
  "url": "https://www.wiz.io/blog/wiz-fastest-growing-security-startup-ever-with-new-valuation"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official founder biography says company launched in 2020; founder retrospective names all four co-founders.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.wiz.io/blog/wiz-fastest-growing-security-startup-ever-with-new-valuation",
        "https://www.wiz.io/authors/assaf-rappaport",
        "https://www.wiz.io/about",
        "https://blog.google/inside-google/company-announcements/google-agreement-acquire-wiz",
        "https://blog.google/innovation-and-ai/infrastructure-and-cloud/google-cloud/wiz-acquisition/"
      ],
      "year": 2020
    }
  ]
}

You.com

You.com's cached homepage presents web-search APIs as a data layer for AI agents and language models.

It separately lists content extraction, answer generation, general research, and financial research interfaces.

Its sample workflow retrieves search results and exposes titles, URLs, and snippets to code, while claimed accuracy, security, and latency remain first-party assertions.

Sources and details

The Leading Web Search APIs for AI | You.com

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:49.733739+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-ai-621de58661bbaf::S1",
  "title": "The Leading Web Search APIs for AI | You.com",
  "url": "https://you.com/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Zest AI

ZestFinance's March 2019 release describes ZAML Fair as a tool for adjusting machine learning credit models to reduce discriminatory influences.

It says the system ranks signals by their contribution to biased outcomes and changes their influence to produce candidate models.

The release presents a choice among those models for lenders using ZAML; simulated approval-rate benefits and broader fairness claims remain attributed projections.

Sources and details

ZestFinance Releases New Software Tool To Reduce Bias In AI-powered Credit Scoring Models

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [
    "ZestFinance"
  ],
  "authors_in_source_order": [
    "ZestFinance"
  ],
  "dates": {
    "dateModified": "2019-03-19T09:00:00-04:00",
    "datePublished": "2019-03-19T09:00:00-04:00",
    "retrieved_utc": "2026-10-07T18:02:50.575498+00:00",
    "visible_or_selected_document_date": "2019-03-19"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2019-03-19"
    },
    {
      "role": "datePublished",
      "value": "2019-03-19T09:00:00-04:00"
    },
    {
      "role": "dateModified",
      "value": "2019-03-19T09:00:00-04:00"
    }
  ],
  "id": "organization-company-ffef16dce3743a::S1",
  "title": "ZestFinance Releases New Software Tool To Reduce Bias In AI-powered Credit Scoring Models",
  "url": "https://www.prnewswire.com/news-releases/zestfinance-releases-new-software-tool-to-reduce-bias-in-ai-powered-credit-scoring-models-300814393.html"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company origin in 2009 per official timeline and company-issued release. Relaunched under Zest AI branding in 2019; the rebrand is not a new founding.",
      "date": "2009",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.zest.ai/company/about-us/",
        "https://www.prnewswire.com/news-releases/zestfinance-releases-new-software-tool-to-reduce-bias-in-ai-powered-credit-scoring-models-300814393.html",
        "https://www.zest.ai/privacy-policy/"
      ],
      "year": 2009
    }
  ]
}

Zilliz

Zilliz's cached homepage describes a managed Vector Lakebase powered by Milvus for real-time search, discovery, and batch data operations.

It presents object storage for data and indexes with hot caching and on-demand compute.

The page also describes hybrid queries combining vector and text search with JSON, geospatial filters, and reranking, distinguishing a public-preview announcement from verified current deployment status.

Sources and details

Zilliz Vector Lakebase for Enterprise AI, Powered by Milvus

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:43.213487+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-4eb59a762e0b05::S1",
  "title": "Zilliz Vector Lakebase for Enterprise AI, Powered by Milvus",
  "url": "https://zilliz.com/"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Zoom Communications, Inc.

Eric S. Yuan's November 2024 Zoom article describes expansion from video meetings into communications and collaboration products.

It recounts phone, contact-center, and conversation-intelligence offerings alongside meetings, chat, webinars, and rooms.

The cached article presents a federated AI approach with meeting summaries, email composition, and preparation tools, while longer-term digital-twin and shorter-workweek ideas remain aspirations rather than delivered outcomes.

Sources and details

Introducing Zoom Communications Inc. | Zoom

{
  "access_scope": "Limited to the inspected cached first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Cached manifestation has later dateModified than the visible 2024 publication; no inference that all cached wording existed in 2024.",
  "authors": [
    "Eric S. Yuan"
  ],
  "authors_in_source_order": [
    "Eric S. Yuan"
  ],
  "dates": {
    "dateModified": "2026-06-08T22:42:59Z",
    "datePublished": "2024-11-25T21:03:00Z",
    "retrieved_utc": "2026-10-07T18:01:41.867479+00:00",
    "visible_or_selected_document_date": "2024-11-25"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2024-11-25"
    },
    {
      "role": "datePublished",
      "value": "2024-11-25T21:03:00Z"
    },
    {
      "role": "dateModified",
      "value": "2026-06-08T22:42:59Z"
    }
  ],
  "id": "organization-company-6b5f413638c46f::S1",
  "title": "Introducing Zoom Communications Inc. | Zoom",
  "url": "https://www.zoom.com/en/blog/introducing-zoom-communications-inc/?cms_guid=false"
}

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Cached manifestation has later dateModified than the visible 2024 publication; no inference that all cached wording existed in 2024.

Limited to the inspected first-party manifestation and stated mechanisms or plans; no independent verification of security, clinical benefit, fairness, commercial results, current availability, corporate identity merging, or individual contributions. Original baselines and holds remain unchanged. Cached manifestation has later dateModified than the visible 2024 publication; no inference that all cached wording existed in 2024.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded by Eric S. Yuan in 2011; legal name changed from Zoom Video Communications to Zoom Communications on 2024-11-25.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.zoom.com/en/about/team/?zcid=2554&zcid=2796",
        "https://www.zoom.com/en/blog/introducing-zoom-communications-inc/?cms_guid=false"
      ],
      "year": 2011
    }
  ]
}

Alex Meiburg

Alex Meiburg is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Alex Meiburg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1ea284d6078618::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Alex Meiburg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Alex Meiburg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexey Dosovitskiy

Alexey Dosovitskiy is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexey Dosovitskiy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a81a3236c33d63::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexey Dosovitskiy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Alexey Dosovitskiy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alvaro Sanchez-Gonzalez

Alvaro Sanchez-Gonzalez is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alvaro Sanchez-Gonzalez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7d215b04a1f726::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alvaro Sanchez-Gonzalez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Alvaro Sanchez-Gonzalez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amir Livne Bar-on

Amir Livne Bar-on is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Amir Livne Bar-on is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2be9bc890ff902::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Amir Livne Bar-on is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Amir Livne Bar-on is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anand Rao Tadipatri

Anand Rao Tadipatri is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Anand Rao Tadipatri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-e30e5eabb172bc::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Anand Rao Tadipatri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Anand Rao Tadipatri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrej Karpathy

Andrej Karpathy is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Andrej Karpathy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-1475f32d6a90b6::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Andrej Karpathy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Andrej Karpathy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew W. Corcoran

Andrew W. Corcoran is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew W. Corcoran is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d1ba5f15e6aa39::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew W. Corcoran is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Andrew W. Corcoran is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrés Goens

Andrés Goens is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Andrés Goens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ec16b2c4f76062::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Andrés Goens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Andrés Goens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arthur Mensch

Arthur Mensch is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Arthur Mensch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-arthurmensch::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Arthur Mensch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Arthur Mensch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aurelia Guy

Aurelia Guy is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aurelia Guy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-aureliaguy::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aurelia Guy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Aurelia Guy is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aurelien Rodriguez

Aurelien Rodriguez is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Aurelien Rodriguez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-3841a92e883325::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Aurelien Rodriguez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Aurelien Rodriguez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Azalia Mirhoseini

Azalia Mirhoseini is a listed coauthor of a sparsely gated mixture-of-experts study that increases model capacity through conditional computation.

A trainable gate selects a small combination of feed-forward experts for each example instead of activating every subnetwork.

The authors apply this layer within language-modeling and machine-translation architectures, reporting comparisons of model quality and computational cost.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Azalia Mirhoseini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "dates": {
    "citation_date": "2017/01/23",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 23 Jan 2017 18:10:00 UTC (294 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.902595+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-azaliamirhoseini::S1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/abs/1701.06538",
  "version_url": "https://arxiv.org/abs/1701.06538v1"
}

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Azalia Mirhoseini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Azalia Mirhoseini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Baptiste Rozière

Baptiste Rozière is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Baptiste Rozière is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-80048461f28d78::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Baptiste Rozière is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Baptiste Rozière is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ben Poole

Ben Poole is a listed coauthor of a framework that generates data by reversing a stochastic process that gradually adds noise.

Neural networks estimate the changing gradient of the noisy data distribution, allowing numerical solvers to follow the reverse process.

The study develops predictor–corrector sampling and an equivalent ordinary differential equation, and reports applications to inpainting and colorization.

Sources and details

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Ben Poole is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "dates": {
    "citation_date": "2020/11/26",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB)",
    "retrieved_utc": "2026-10-07T18:15:54.250275+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-db9e44adefd3e3::S1",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/abs/2011.13456",
  "version_url": "https://arxiv.org/abs/2011.13456v2"
}

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Ben Poole is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Ben Poole is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bernhard Reinke

Bernhard Reinke is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bernhard Reinke is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-20108c15e30a9d::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bernhard Reinke is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bernhard Reinke is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Björn Ommer

Björn Ommer is a listed coauthor of the latent diffusion study, which moves image generation into the representation learned by a pretrained autoencoder.

That compressed space aims to reduce computational demands while preserving visual detail compared with diffusion performed directly over pixels.

Cross-attention supplies conditioning inputs such as text or bounding boxes, and the study evaluates generation, inpainting and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Björn Ommer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv v2"
  },
  "id": "person-bjornommer::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Björn Ommer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Björn Ommer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bogdan Damoc

Bogdan Damoc is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Bogdan Damoc is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-bogdandamoc::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Bogdan Damoc is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Bogdan Damoc is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian Lim

Brian Lim is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Brian Lim is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-6a7b9dac703cc1::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Brian Lim is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Brian Lim is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bruno Le Floch

Bruno Le Floch is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bruno Le Floch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-40c633bf3f0217::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bruno Le Floch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Bruno Le Floch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carroll L. Wainwright

Carroll L. Wainwright is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Carroll L. Wainwright is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-carrolllwainwright::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Carroll L. Wainwright is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Carroll L. Wainwright is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chenhao Tan

Chenhao Tan is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Chenhao Tan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-bbfcc6cccdd368::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Chenhao Tan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Chenhao Tan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chong Zhang

Chong Zhang is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Chong Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-chongzhang::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Chong Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Chong Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Christopher Ré

Christopher Ré is a listed coauthor of FlashAttention, which reorganizes exact attention around data movement within GPU memory.

The algorithm uses tiling to reduce transfers between high-bandwidth memory and on-chip storage while preserving exact attention computation.

The study reports faster Transformer training and explores a separate block-sparse extension, keeping that approximate variant distinct from the exact algorithm.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Christopher Ré is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "authors_in_source_order": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "dates": {
    "citation_date": "2022/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.819658+00:00",
    "version": "arXiv v2"
  },
  "id": "person-christopherre::S1",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/abs/2205.14135",
  "version_url": "https://arxiv.org/abs/2205.14135v2"
}

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Christopher Ré is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Christopher Ré is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cody Roux

Cody Roux is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Cody Roux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a4c1dd10c8e048::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Cody Roux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Cody Roux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cyriel M. A. Pennartz

Cyriel M. A. Pennartz is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Cyriel M. A. Pennartz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-38f95f41363c4f::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Cyriel M. A. Pennartz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Cyriel M. A. Pennartz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Weber

Daniel Weber is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Daniel Weber is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-46b52355ef98b8::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Daniel Weber is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Daniel Weber is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Y. Fu

Daniel Y. Fu is a listed coauthor of FlashAttention, which reorganizes exact attention around data movement within GPU memory.

The algorithm uses tiling to reduce transfers between high-bandwidth memory and on-chip storage while preserving exact attention computation.

The study reports faster Transformer training and explores a separate block-sparse extension, keeping that approximate variant distinct from the exact algorithm.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Daniel Y. Fu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "authors_in_source_order": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "dates": {
    "citation_date": "2022/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.819658+00:00",
    "version": "arXiv v2"
  },
  "id": "person-danielyfu::S1",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/abs/2205.14135",
  "version_url": "https://arxiv.org/abs/2205.14135v2"
}

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Daniel Y. Fu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Daniel Y. Fu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Pfau

David Pfau is a listed coauthor of a study introducing the Fermionic Neural Network as an approximation to many-electron wavefunctions.

The architecture is designed for electronic systems whose wavefunctions must obey Fermi–Dirac statistics.

The authors report variational quantum Monte Carlo results on atoms and small molecules, including challenging nitrogen and hydrogen-chain dissociation curves.

Sources and details

Ab-Initio Solution of the Many-Electron Schr\"odinger Equation with Deep Neural Networks

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. David Pfau is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-97024ccce2240e::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schr\\\"odinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. David Pfau is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. David Pfau is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Renshaw

David Renshaw is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. David Renshaw is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-bc196880c19d5c::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. David Renshaw is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. David Renshaw is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Diederik P. Kingma

Diederik P. Kingma is a listed coauthor of a framework that generates data by reversing a stochastic process that gradually adds noise.

Neural networks estimate the changing gradient of the noisy data distribution, allowing numerical solvers to follow the reverse process.

The study develops predictor–corrector sampling and an equivalent ordinary differential equation, and reports applications to inpainting and colorization.

Sources and details

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Diederik P. Kingma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "dates": {
    "citation_date": "2020/11/26",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB)",
    "retrieved_utc": "2026-10-07T18:15:54.250275+00:00",
    "version": "arXiv v2"
  },
  "id": "person-diederikpkingma::S1",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/abs/2011.13456",
  "version_url": "https://arxiv.org/abs/2011.13456v2"
}

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Diederik P. Kingma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Diederik P. Kingma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Diego de Las Casas

Diego de Las Casas is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Diego de Las Casas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-diegodelascasas::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Diego de Las Casas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Diego de Las Casas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Diogo Almeida

Diogo Almeida is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Diogo Almeida is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-diogoalmeida::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Diogo Almeida is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Diogo Almeida is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dirk Weissenborn

Dirk Weissenborn is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Dirk Weissenborn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8c70f73a5479ee::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Dirk Weissenborn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Dirk Weissenborn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dominik Lorenz

Dominik Lorenz is a listed coauthor of the latent diffusion study, which moves image generation into the representation learned by a pretrained autoencoder.

That compressed space aims to reduce computational demands while preserving visual detail compared with diffusion performed directly over pixels.

Cross-attention supplies conditioning inputs such as text or bounding boxes, and the study evaluates generation, inpainting and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Dominik Lorenz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv v2"
  },
  "id": "person-dominiklorenz::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Dominik Lorenz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Dominik Lorenz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas McNeil

Douglas McNeil is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Douglas McNeil is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-47f5fd87eb962c::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Douglas McNeil is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Douglas McNeil is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douwe Kiela

Douwe Kiela is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Douwe Kiela is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-douwekiela::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Douwe Kiela is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Douwe Kiela is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edouard Grave

Edouard Grave is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Edouard Grave is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-988f073e8cac09::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Edouard Grave is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Edouard Grave is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elena Buchatskaya

Elena Buchatskaya is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Elena Buchatskaya is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-elenabuchatskaya::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Elena Buchatskaya is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Elena Buchatskaya is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eliza Rutherford

Eliza Rutherford is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eliza Rutherford is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-elizarutherford::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eliza Rutherford is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eliza Rutherford is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emmanuel Osalotioman Osazuwa

Emmanuel Osalotioman Osazuwa is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Emmanuel Osalotioman Osazuwa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-85393805435db8::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Emmanuel Osalotioman Osazuwa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Emmanuel Osalotioman Osazuwa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Hambro

Eric Hambro is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Eric Hambro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-dcc763fecd1629::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Eric Hambro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Eric Hambro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Noland

Eric Noland is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eric Noland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-ericnoland::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eric Noland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Eric Noland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Erich Elsen

Erich Elsen is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Erich Elsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-erichelsen::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Erich Elsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Erich Elsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ethan Perez

Ethan Perez is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Ethan Perez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-ethanperez::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Ethan Perez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Ethan Perez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fabio Petroni

Fabio Petroni is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Fabio Petroni is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-fabiopetroni::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Fabio Petroni is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Fabio Petroni is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Faisal Azhar

Faisal Azhar is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Faisal Azhar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-26c6439f4a45ad::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Faisal Azhar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Faisal Azhar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fan Zheng

Fan Zheng is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fan Zheng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f48709e40ae47a::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fan Zheng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fan Zheng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fernando Vaquerizo-Villar

Fernando Vaquerizo-Villar is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fernando Vaquerizo-Villar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8d1a003bafbb64::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fernando Vaquerizo-Villar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Fernando Vaquerizo-Villar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ferran Alet

Ferran Alet is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Ferran Alet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1ee1c52119d337::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Ferran Alet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Ferran Alet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Floris van Doorn

Floris van Doorn is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Floris van Doorn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-036cfefa59064a::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Floris van Doorn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Floris van Doorn is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fraser Kelton

Fraser Kelton is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Fraser Kelton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-fraserkelton::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Fraser Kelton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Fraser Kelton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gautier Izacard

Gautier Izacard is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Gautier Izacard is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-b16e087ab79ec1::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Gautier Izacard is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Gautier Izacard is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Geoffrey Hinton

Geoffrey Hinton is a listed coauthor of a sparsely gated mixture-of-experts study that increases model capacity through conditional computation.

A trainable gate selects a small combination of feed-forward experts for each example instead of activating every subnetwork.

The authors apply this layer within language-modeling and machine-translation architectures, reporting comparisons of model quality and computational cost.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Geoffrey Hinton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "dates": {
    "citation_date": "2017/01/23",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 23 Jan 2017 18:10:00 UTC (294 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.902595+00:00",
    "version": "arXiv v1"
  },
  "id": "person-geoffreyhinton::S1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/abs/1701.06538",
  "version_url": "https://arxiv.org/abs/1701.06538v1"
}

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Geoffrey Hinton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Geoffrey Hinton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Georg Heigold

Georg Heigold is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Georg Heigold is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1cd209819ea4b7::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Georg Heigold is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Georg Heigold is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Holland

George Holland is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. George Holland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-48ac822ff20084::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. George Holland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. George Holland is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George van den Driessche

George van den Driessche is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. George van den Driessche is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-georgevandendriessche::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. George van den Driessche is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. George van den Driessche is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Giovanni Paolini

Giovanni Paolini is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Giovanni Paolini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-9f2ff7be7c363e::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Giovanni Paolini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Giovanni Paolini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Giulio Tononi

Giulio Tononi is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Giulio Tononi is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-034e9bb657fd74::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Giulio Tononi is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Giulio Tononi is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guillaume Lample

Guillaume Lample is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Guillaume Lample is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-f9a259491032e7::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Guillaume Lample is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Guillaume Lample is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hanwei Zhang

Hanwei Zhang is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Hanwei Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-3bb5f02a7e4f85::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Hanwei Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Hanwei Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hao Su

Hao Su is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Hao Su is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-23c2cb8c5de635::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Hao Su is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Hao Su is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harald Husum

Harald Husum is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Harald Husum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-138a184ebc4a17::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Harald Husum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Harald Husum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harmanpreet Kaur

Harmanpreet Kaur is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Harmanpreet Kaur is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-f821037a9e0197::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Harmanpreet Kaur is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Harmanpreet Kaur is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Heinrich Küttler

Heinrich Küttler is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Heinrich Küttler is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-heinrichkuttler::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Heinrich Küttler is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Heinrich Küttler is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hernán Ibarra Mejia

Hernán Ibarra Mejia is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Hernán Ibarra Mejia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3fd11724fec01e::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Hernán Ibarra Mejia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Hernán Ibarra Mejia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hugo Touvron

Hugo Touvron is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Hugo Touvron is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-38cf4567c6c98c::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Hugo Touvron is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Hugo Touvron is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Illia Polosukhin

Illia Polosukhin is a listed coauthor of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Illia Polosukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-illiapolosukhin::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Illia Polosukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Illia Polosukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack W. Rae

Jack W. Rae is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jack W. Rae is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-jackwrae::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jack W. Rae is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jack W. Rae is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jacklynn Stott

Jacklynn Stott is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Jacklynn Stott is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f4c6bf19c0afb7::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Jacklynn Stott is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Jacklynn Stott is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jacob Hilton

Jacob Hilton is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jacob Hilton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-jacobhilton::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jacob Hilton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jacob Hilton is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jakob Uszkoreit

Jakob Uszkoreit is a listed coauthor of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Jakob Uszkoreit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-jakobuszkoreit::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Jakob Uszkoreit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Jakob Uszkoreit is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James S. Spencer

James S. Spencer is a listed coauthor of a study introducing the Fermionic Neural Network as an approximation to many-electron wavefunctions.

The architecture is designed for electronic systems whose wavefunctions must obey Fermi–Dirac statistics.

The authors report variational quantum Monte Carlo results on atoms and small molecules, including challenging nitrogen and hydrogen-chain dissociation curves.

Sources and details

Ab-Initio Solution of the Many-Electron Schr\"odinger Equation with Deep Neural Networks

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. James S. Spencer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-7e85eb5609438d::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schr\\\"odinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. James S. Spencer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. James S. Spencer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jan Leike

Jan Leike is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jan Leike is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-janleike::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jan Leike is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jan Leike is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jascha Sohl-Dickstein

Jascha Sohl-Dickstein is a listed coauthor of a framework that generates data by reversing a stochastic process that gradually adds noise.

Neural networks estimate the changing gradient of the noisy data distribution, allowing numerical solvers to follow the reverse process.

The study develops predictor–corrector sampling and an equivalent ordinary differential equation, and reports applications to inpainting and colorization.

Sources and details

Score-Based Generative Modeling through Stochastic Differential Equations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Jascha Sohl-Dickstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "authors_in_source_order": [
    "Song, Yang",
    "Sohl-Dickstein, Jascha",
    "Kingma, Diederik P.",
    "Kumar, Abhishek",
    "Ermon, Stefano",
    "Poole, Ben"
  ],
  "dates": {
    "citation_date": "2020/11/26",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB)",
    "retrieved_utc": "2026-10-07T18:15:54.250275+00:00",
    "version": "arXiv v2"
  },
  "id": "person-jaschasohldickstein::S1",
  "title": "Score-Based Generative Modeling through Stochastic Differential Equations",
  "url": "https://arxiv.org/abs/2011.13456",
  "version_url": "https://arxiv.org/abs/2011.13456v2"
}

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Jascha Sohl-Dickstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 10 Feb 2021 18:17:04 UTC (56,849 KB); bounded account of this paper’s method and reported results. Jascha Sohl-Dickstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeff Wu

Jeff Wu is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jeff Wu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jeffwu::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jeff Wu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Jeff Wu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jia Deng

Jia Deng is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jia Deng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-jiadeng::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jia Deng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jia Deng is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jie Tang

Jie Tang is a listed coauthor of the GLM-130B study, which documents pretraining a large bilingual English–Chinese language model.

The account discusses model design, training stability and engineering responses to problems such as loss spikes and divergence.

It also reports low-bit quantization experiments and releases weights, code and training information intended to make the system inspectable.

Sources and details

GLM-130B: An Open Bilingual Pre-trained Model

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Jie Tang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "authors_in_source_order": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "dates": {
    "citation_date": "2022/10/05",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.851506+00:00",
    "version": "arXiv v2"
  },
  "id": "person-jietang::S1",
  "title": "GLM-130B: An Open Bilingual Pre-trained Model",
  "url": "https://arxiv.org/abs/2210.02414",
  "version_url": "https://arxiv.org/abs/2210.02414v2"
}

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Jie Tang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Jie Tang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joachim Breitner

Joachim Breitner is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Joachim Breitner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2fe6d678df25d5::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Joachim Breitner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Joachim Breitner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Johann Laux

Johann Laux is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Johann Laux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-4e5075a53b5e8d::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Johann Laux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Johann Laux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Johannes Welbl

Johannes Welbl is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Johannes Welbl is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-johanneswelbl::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Johannes Welbl is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Johannes Welbl is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Schulman

John Schulman is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. John Schulman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-johnschulman::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. John Schulman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. John Schulman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan J. Hunt

Jonathan J. Hunt is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Jonathan J. Hunt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-d54f1c2f65e3b0::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Jonathan J. Hunt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Jonathan J. Hunt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Krause

Jonathan Krause is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jonathan Krause is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-77bded69ee9eb0::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jonathan Krause is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Jonathan Krause is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jordan Hoffmann

Jordan Hoffmann is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jordan Hoffmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-jordanhoffmann::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jordan Hoffmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Jordan Hoffmann is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jose Brox

Jose Brox is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jose Brox is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-6a1105cbc94153::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jose Brox is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jose Brox is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jérémy Scanvic

Jérémy Scanvic is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jérémy Scanvic is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-47e9b82e7af61d::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jérémy Scanvic is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Jérémy Scanvic is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karl J. Friston

Karl J. Friston is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Karl J. Friston is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-aaabb7c150a446::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Karl J. Friston is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Karl J. Friston is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karén Simonyan

Karén Simonyan is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Karén Simonyan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-karensimonyan::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Karén Simonyan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Karén Simonyan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Katarina Slama

Katarina Slama is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Katarina Slama is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-katarinaslama::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Katarina Slama is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Katarina Slama is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Katie Millican

Katie Millican is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Katie Millican is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-katiemillican::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Katie Millican is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Katie Millican is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kevin Baum

Kevin Baum is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Kevin Baum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-7b2cb8f5a0295d::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Kevin Baum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Kevin Baum is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Krzysztof Maziarz

Krzysztof Maziarz is a listed coauthor of a sparsely gated mixture-of-experts study that increases model capacity through conditional computation.

A trainable gate selects a small combination of feed-forward experts for each example instead of activating every subnetwork.

The authors apply this layer within language-modeling and machine-translation architectures, reporting comparisons of model quality and computational cost.

Sources and details

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Krzysztof Maziarz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "authors_in_source_order": [
    "Shazeer, Noam",
    "Mirhoseini, Azalia",
    "Maziarz, Krzysztof",
    "Davis, Andy",
    "Le, Quoc",
    "Hinton, Geoffrey",
    "Dean, Jeff"
  ],
  "dates": {
    "citation_date": "2017/01/23",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 23 Jan 2017 18:10:00 UTC (294 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.902595+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-krzysztofmaziarz::S1",
  "title": "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer",
  "url": "https://arxiv.org/abs/1701.06538",
  "version_url": "https://arxiv.org/abs/1701.06538v1"
}

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Krzysztof Maziarz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 23 Jan 2017 18:10:00 UTC (294 KB); bounded account of this paper’s method and reported results. Krzysztof Maziarz is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linda Onnasch

Linda Onnasch is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Linda Onnasch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-76d698882b4a8a::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Linda Onnasch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Linda Onnasch is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lisa Anne Hendricks

Lisa Anne Hendricks is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Lisa Anne Hendricks is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-lisaannehendricks::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Lisa Anne Hendricks is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Lisa Anne Hendricks is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Liz Sonenberg

Liz Sonenberg is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Liz Sonenberg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-43bc1f7a7d00ea::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Liz Sonenberg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Liz Sonenberg is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Llion Jones

Llion Jones is a listed coauthor of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Llion Jones is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-llionjones::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Llion Jones is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Llion Jones is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Long Ouyang

Long Ouyang is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Long Ouyang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-longouyang::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Long Ouyang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Long Ouyang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lorenzo Luccioli

Lorenzo Luccioli is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Lorenzo Luccioli is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f409365f2623d9::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Lorenzo Luccioli is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Lorenzo Luccioli is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lucas Beyer

Lucas Beyer is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Lucas Beyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2590cf9386c040::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Lucas Beyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Lucas Beyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luke Miller

Luke Miller is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Luke Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-lukemiller::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Luke Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Luke Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maddie Simens

Maddie Simens is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Maddie Simens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-maddiesimens::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Maddie Simens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Maddie Simens is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marco Petracci

Marco Petracci is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marco Petracci is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-0a410653679fc5::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marco Petracci is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marco Petracci is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marcus Rossel

Marcus Rossel is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marcus Rossel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-33bfbb931a5f4a::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marcus Rossel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Marcus Rossel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marie-Anne Lachaux

Marie-Anne Lachaux is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Marie-Anne Lachaux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-77d7ba40ee7610::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Marie-Anne Lachaux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Marie-Anne Lachaux is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mario Carneiro

Mario Carneiro is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Mario Carneiro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1161456136687b::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Mario Carneiro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Mario Carneiro is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mark T. Keane

Mark T. Keane is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Mark T. Keane is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-0f30502f6455d6::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Mark T. Keane is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Mark T. Keane is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Markus Langer

Markus Langer is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Markus Langer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-ad46518fceff5a::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Markus Langer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Markus Langer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin Dvorak

Martin Dvorak is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Martin Dvorak is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7582809063ca83::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Martin Dvorak is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Martin Dvorak is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matthew Bolan

Matthew Bolan is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Matthew Bolan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d1170658665a05::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Matthew Bolan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Matthew Bolan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matthew Willson

Matthew Willson is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Matthew Willson is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7c8ab4407a7398::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Matthew Willson is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Matthew Willson is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matthias Minderer

Matthias Minderer is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Matthias Minderer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-addf0b5e4576db::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Matthias Minderer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Matthias Minderer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Meire Fortunato

Meire Fortunato is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Meire Fortunato is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ce1143a166a0e6::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Meire Fortunato is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Meire Fortunato is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Bernstein

Michael Bernstein is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Michael Bernstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-94ebc41497f30d::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Michael Bernstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Michael Bernstein is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mike Lewis

Mike Lewis is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Mike Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-mikelewis::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Mike Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Mike Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ming Ding

Ming Ding is a listed coauthor of the GLM-130B study, which documents pretraining a large bilingual English–Chinese language model.

The account discusses model design, training stability and engineering responses to problems such as loss spikes and divergence.

It also reports low-bit quantization experiments and releases weights, code and training information intended to make the system inspectable.

Sources and details

GLM-130B: An Open Bilingual Pre-trained Model

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Ming Ding is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "authors_in_source_order": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "dates": {
    "citation_date": "2022/10/05",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.851506+00:00",
    "version": "arXiv v2"
  },
  "id": "person-mingding::S1",
  "title": "GLM-130B: An Open Bilingual Pre-trained Model",
  "url": "https://arxiv.org/abs/2210.02414",
  "version_url": "https://arxiv.org/abs/2210.02414v2"
}

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Ming Ding is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Ming Ding is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mostafa Dehghani

Mostafa Dehghani is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Mostafa Dehghani is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-9c4394718742a8::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Mostafa Dehghani is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Mostafa Dehghani is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Naman Goyal

Naman Goyal is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Naman Goyal is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-namangoyal::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Naman Goyal is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Naman Goyal is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nava Tintarev

Nava Tintarev is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Nava Tintarev is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-a7c163f8dadc6b::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Nava Tintarev is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Nava Tintarev is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neil Houlsby

Neil Houlsby is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Neil Houlsby is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-71a9726ab7f503::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Neil Houlsby is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Neil Houlsby is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicholas Carlini

Nicholas Carlini is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Nicholas Carlini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ac55d227857527::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Nicholas Carlini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Nicholas Carlini is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicolas Heess

Nicolas Heess is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Nicolas Heess is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-43f5c771290230::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Nicolas Heess is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Nicolas Heess is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Niki Parmar

Niki Parmar is a listed coauthor of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Niki Parmar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-nikiparmar::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Niki Parmar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Niki Parmar is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Noam Shazeer

Noam Shazeer is a listed coauthor of Attention Is All You Need, which introduces the Transformer for sequence transduction.

The architecture uses attention without recurrent or convolutional components, enabling greater parallelism in the reported translation experiments.

The authors also apply it to English constituency parsing, testing the architecture beyond machine translation.

Sources and details

Attention Is All You Need

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Noam Shazeer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "authors_in_source_order": [
    "Vaswani, Ashish",
    "Shazeer, Noam",
    "Parmar, Niki",
    "Uszkoreit, Jakob",
    "Jones, Llion",
    "Gomez, Aidan N.",
    "Kaiser, Lukasz",
    "Polosukhin, Illia"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.819729+00:00",
    "version": "arXiv v7"
  },
  "id": "person-noamshazeer::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/abs/1706.03762",
  "version_url": "https://arxiv.org/abs/1706.03762v7"
}

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Noam Shazeer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Wed, 2 Aug 2023 00:41:18 UTC (1,124 KB); bounded account of this paper’s method and reported results. Noam Shazeer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Olga Russakovsky

Olga Russakovsky is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Olga Russakovsky is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d339a6900101f2::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Olga Russakovsky is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Olga Russakovsky is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oriol Vinyals

Oriol Vinyals is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Oriol Vinyals is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-oriolvinyals::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Oriol Vinyals is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Oriol Vinyals is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pace P. Nielsen

Pace P. Nielsen is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pace P. Nielsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2c7ffe1f2cbadb::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pace P. Nielsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pace P. Nielsen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pamela Mishkin

Pamela Mishkin is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Pamela Mishkin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-pamelamishkin::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Pamela Mishkin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Pamela Mishkin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Esser

Patrick Esser is a listed coauthor of the latent diffusion study, which moves image generation into the representation learned by a pretrained autoencoder.

That compressed space aims to reduce computational demands while preserving visual detail compared with diffusion performed directly over pixels.

Cross-attention supplies conditioning inputs such as text or bounding boxes, and the study evaluates generation, inpainting and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Patrick Esser is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv v2"
  },
  "id": "person-patrickesser::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Patrick Esser is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Patrick Esser is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Lewis

Patrick Lewis is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Patrick Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-patricklewis::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Patrick Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Patrick Lewis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peng Zhang

Peng Zhang is a listed coauthor of the GLM-130B study, which documents pretraining a large bilingual English–Chinese language model.

The account discusses model design, training stability and engineering responses to problems such as loss spikes and divergence.

It also reports low-bit quantization experiments and releases weights, code and training information intended to make the system inspectable.

Sources and details

GLM-130B: An Open Bilingual Pre-trained Model

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Peng Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "authors_in_source_order": [
    "Zeng, Aohan",
    "Liu, Xiao",
    "Du, Zhengxiao",
    "Wang, Zihan",
    "Lai, Hanyu",
    "Ding, Ming",
    "Yang, Zhuoyi",
    "Xu, Yifan",
    "Zheng, Wendi",
    "Xia, Xiao",
    "Tam, Weng Lam",
    "Ma, Zixuan",
    "Xue, Yufei",
    "Zhai, Jidong",
    "Chen, Wenguang",
    "Zhang, Peng",
    "Dong, Yuxiao",
    "Tang, Jie"
  ],
  "dates": {
    "citation_date": "2022/10/05",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.851506+00:00",
    "version": "arXiv v2"
  },
  "id": "person-pengzhang::S1",
  "title": "GLM-130B: An Open Bilingual Pre-trained Model",
  "url": "https://arxiv.org/abs/2210.02414",
  "version_url": "https://arxiv.org/abs/2210.02414v2"
}

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Peng Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 25 Oct 2023 05:22:43 UTC (4,871 KB); bounded account of this paper’s method and reported results. Peng Zhang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Battaglia

Peter Battaglia is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Battaglia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-6b732375590e42::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Battaglia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Battaglia is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Welinder

Peter Welinder is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Peter Welinder is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-peterwelinder::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Peter Welinder is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Peter Welinder is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Wirnsberger

Peter Wirnsberger is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Wirnsberger is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1f8c46402d06cb::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Wirnsberger is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Peter Wirnsberger is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pietro Monticone

Pietro Monticone is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pietro Monticone is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-9d0e766598fb10::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pietro Monticone is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Pietro Monticone is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Q. Vera Liao

Q. Vera Liao is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Q. Vera Liao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-6e111b55517766::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Q. Vera Liao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Q. Vera Liao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Raimund Dachselt

Raimund Dachselt is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Raimund Dachselt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-10bae422c13f0e::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Raimund Dachselt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Raimund Dachselt is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reinder Dorman

Reinder Dorman is a listed coauthor of an adversarial collaborative review comparing Integrated Information Theory, Neurorepresentationalism and Active Inference.

The review contrasts each theory’s explanatory goals and methods, then sets out hypotheses for planned experiments across multiple sites.

It discusses observations that could support or challenge the theories and how evidence from separate experiments and replications might be combined.

Sources and details

Integrated information and predictive processing theories of consciousness: An adversarial collaborative review

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Reinder Dorman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "authors_in_source_order": [
    "Corcoran, Andrew W.",
    "Haun, Andrew M.",
    "Dorman, Reinder",
    "Tononi, Giulio",
    "Friston, Karl J.",
    "Pennartz, Cyriel M. A.",
    "TWCF",
    ":",
    "Consortium, INTREPID"
  ],
  "dates": {
    "citation_date": "2025/08/30",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 15 May 2026 07:00:09 UTC (687 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017112+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-26101f0a7c694e::S1",
  "title": "Integrated information and predictive processing theories of consciousness: An adversarial collaborative review",
  "url": "https://arxiv.org/abs/2509.00555",
  "version_url": "https://arxiv.org/abs/2509.00555v3"
}

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Reinder Dorman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 15 May 2026 07:00:09 UTC (687 KB); bounded account of this paper’s method and reported results. Reinder Dorman is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Remi Lam

Remi Lam is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Remi Lam is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-70007c7331580f::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Remi Lam is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Remi Lam is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Landers

Richard Landers is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Richard Landers is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-2318e38636aebc::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Richard Landers is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Richard Landers is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robin Rombach

Robin Rombach is a listed coauthor of the latent diffusion study, which moves image generation into the representation learned by a pretrained autoencoder.

That compressed space aims to reduce computational demands while preserving visual detail compared with diffusion performed directly over pixels.

Cross-attention supplies conditioning inputs such as text or bounding boxes, and the study evaluates generation, inpainting and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Robin Rombach is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv v2"
  },
  "id": "person-robinrombach::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Robin Rombach is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB); bounded account of this paper’s method and reported results. Robin Rombach is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ryan Lowe

Ryan Lowe is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Ryan Lowe is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-ryanlowe::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Ryan Lowe is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Ryan Lowe is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sanjeev Satheesh

Sanjeev Satheesh is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sanjeev Satheesh is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-a13db8832808e1::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sanjeev Satheesh is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sanjeev Satheesh is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sean Ma

Sean Ma is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sean Ma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-67f16c176c9fb8::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sean Ma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Sean Ma is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sebastian Borgeaud

Sebastian Borgeaud is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Sebastian Borgeaud is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-sebastianborgeaud::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Sebastian Borgeaud is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Sebastian Borgeaud is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sebastian Riedel

Sebastian Riedel is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Sebastian Riedel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-sebastianriedel::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Sebastian Riedel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Sebastian Riedel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shakir Mohamed

Shakir Mohamed is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Shakir Mohamed is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-bfa9edcf93aada::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Shakir Mohamed is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Shakir Mohamed is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shreyas Srinivas

Shreyas Srinivas is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Shreyas Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-7fc4e2153280e7::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Shreyas Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Shreyas Srinivas is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Osindero

Simon Osindero is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Simon Osindero is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-simonosindero::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Simon Osindero is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Simon Osindero is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stephan Hoyer

Stephan Hoyer is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Stephan Hoyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-82a74ecf9a0160::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Stephan Hoyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Stephan Hoyer is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Suman Ravuri

Suman Ravuri is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Suman Ravuri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-1393078bf0cea0::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Suman Ravuri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Suman Ravuri is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Susanne Gaube

Susanne Gaube is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Susanne Gaube is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-a8e0b5e671152e::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Susanne Gaube is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Susanne Gaube is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sylvain Gelly

Sylvain Gelly is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Sylvain Gelly is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-e8fbe178e8e6e7::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Sylvain Gelly is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Sylvain Gelly is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Terence Tao

Terence Tao is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Terence Tao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-375e48822d00c6::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Terence Tao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Terence Tao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thibaut Lavril

Thibaut Lavril is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Thibaut Lavril is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-0abf35cf2fa3b4::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Thibaut Lavril is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Thibaut Lavril is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas Unterthiner

Thomas Unterthiner is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Thomas Unterthiner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-51b4120b06e3d2::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Thomas Unterthiner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Thomas Unterthiner is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Miller

Tim Miller is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-c47188ddd35b36::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Miller is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Rocktäschel

Tim Rocktäschel is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Tim Rocktäschel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-timrocktaschel::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Tim Rocktäschel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Tim Rocktäschel is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Schrills

Tim Schrills is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Schrills is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-95c4b42b80994a::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Schrills is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Tim Schrills is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Timo Ewalds

Timo Ewalds is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Timo Ewalds is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8a05280b50ff56::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Timo Ewalds is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Timo Ewalds is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Timothy P. Lillicrap

Timothy P. Lillicrap is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Timothy P. Lillicrap is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-16a2e45bcdefee::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Timothy P. Lillicrap is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Timothy P. Lillicrap is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Timothée Lacroix

Timothée Lacroix is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Timothée Lacroix is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-dddc80cbd819d3::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Timothée Lacroix is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Timothée Lacroix is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Erez

Tom Erez is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Tom Erez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-6beb1cb3c2072a::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Tom Erez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Tom Erez is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Hennigan

Tom Hennigan is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Tom Hennigan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-tomhennigan::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Tom Hennigan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Tom Hennigan is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Cai

Trevor Cai is a listed coauthor of the Chinchilla study, which examines how to divide a language-model training budget between model size and training data.

Its experiments vary both parameters and tokens, leading the authors to propose scaling the two quantities together for compute-efficient training.

The study tests that proposal with Chinchilla, reporting stronger downstream performance than substantially larger comparison models under the stated training conditions.

Sources and details

Training Compute-Optimal Large Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Trevor Cai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "authors_in_source_order": [
    "Hoffmann, Jordan",
    "Borgeaud, Sebastian",
    "Mensch, Arthur",
    "Buchatskaya, Elena",
    "Cai, Trevor",
    "Rutherford, Eliza",
    "Casas, Diego de Las",
    "Hendricks, Lisa Anne",
    "Welbl, Johannes",
    "Clark, Aidan",
    "Hennigan, Tom",
    "Noland, Eric",
    "Millican, Katie",
    "Driessche, George van den",
    "Damoc, Bogdan",
    "Guy, Aurelia",
    "Osindero, Simon",
    "Simonyan, Karen",
    "Elsen, Erich",
    "Rae, Jack W.",
    "Vinyals, Oriol",
    "Sifre, Laurent"
  ],
  "dates": {
    "citation_date": "2022/03/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.743278+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-trevorcai::S1",
  "title": "Training Compute-Optimal Large Language Models",
  "url": "https://arxiv.org/abs/2203.15556",
  "version_url": "https://arxiv.org/abs/2203.15556v1"
}

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Trevor Cai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Tue, 29 Mar 2022 13:38:03 UTC (10,143 KB); bounded account of this paper’s method and reported results. Trevor Cai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tri Dao

Tri Dao is a listed coauthor of FlashAttention, which reorganizes exact attention around data movement within GPU memory.

The algorithm uses tiling to reduce transfers between high-bandwidth memory and on-chip storage while preserving exact attention computation.

The study reports faster Transformer training and explores a separate block-sparse extension, keeping that approximate variant distinct from the exact algorithm.

Sources and details

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Tri Dao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "authors_in_source_order": [
    "Dao, Tri",
    "Fu, Daniel Y.",
    "Ermon, Stefano",
    "Rudra, Atri",
    "Ré, Christopher"
  ],
  "dates": {
    "citation_date": "2022/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.819658+00:00",
    "version": "arXiv v2"
  },
  "id": "person-tridao::S1",
  "title": "FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness",
  "url": "https://arxiv.org/abs/2205.14135",
  "version_url": "https://arxiv.org/abs/2205.14135v2"
}

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Tri Dao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 23 Jun 2022 17:53:32 UTC (1,653 KB); bounded account of this paper’s method and reported results. Tri Dao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ujwal Gadiraju

Ujwal Gadiraju is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ujwal Gadiraju is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-8f9e00beaa6ad2::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ujwal Gadiraju is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ujwal Gadiraju is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vlad Tsyrklevich

Vlad Tsyrklevich is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Vlad Tsyrklevich is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-073b867a5512d5::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Vlad Tsyrklevich is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Vlad Tsyrklevich is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vladimir Karpukhin

Vladimir Karpukhin is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Vladimir Karpukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-vladimirkarpukhin::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Vladimir Karpukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Vladimir Karpukhin is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

W. M. C. Foulkes

W. M. C. Foulkes is a listed coauthor of a study introducing the Fermionic Neural Network as an approximation to many-electron wavefunctions.

The architecture is designed for electronic systems whose wavefunctions must obey Fermi–Dirac statistics.

The authors report variational quantum Monte Carlo results on atoms and small molecules, including challenging nitrogen and hydrogen-chain dissociation curves.

Sources and details

Ab-Initio Solution of the Many-Electron Schr\"odinger Equation with Deep Neural Networks

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. W. M. C. Foulkes is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-1aaf319ea72c94::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schr\\\"odinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. W. M. C. Foulkes is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB); bounded account of this paper’s method and reported results. W. M. C. Foulkes is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Weihua Hu

Weihua Hu is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Weihua Hu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-992d044084d820::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Weihua Hu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Weihua Hu is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wen-tau Yih

Wen-tau Yih is a listed coauthor of a retrieval-augmented generation study that combines a sequence-to-sequence model with external text memory.

A neural retriever accesses a dense index of Wikipedia passages, supplementing knowledge stored in the language model’s parameters.

The study compares retrieval shared across a generated sequence with retrieval that can change by token, and reports evaluations on knowledge-intensive language tasks.

Sources and details

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Wen-tau Yih is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "authors_in_source_order": [
    "Lewis, Patrick",
    "Perez, Ethan",
    "Piktus, Aleksandra",
    "Petroni, Fabio",
    "Karpukhin, Vladimir",
    "Goyal, Naman",
    "Küttler, Heinrich",
    "Lewis, Mike",
    "Yih, Wen-tau",
    "Rocktäschel, Tim",
    "Riedel, Sebastian",
    "Kiela, Douwe"
  ],
  "dates": {
    "citation_date": "2020/05/22",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 12 Apr 2021 15:42:18 UTC (767 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.657610+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-wentauyih::S1",
  "title": "Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks",
  "url": "https://arxiv.org/abs/2005.11401",
  "version_url": "https://arxiv.org/abs/2005.11401v4"
}

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Wen-tau Yih is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Mon, 12 Apr 2021 15:42:18 UTC (767 KB); bounded account of this paper’s method and reported results. Wen-tau Yih is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xavier Martinet

Xavier Martinet is a listed coauthor of the first LLaMA paper, which describes a family of language models trained on publicly available datasets.

The study tests several model sizes and compares them with larger language models on its selected benchmarks.

The authors frame the release as providing foundation models to the research community; that account concerns the original LLaMA models rather than later generations.

Sources and details

LLaMA: Open and Efficient Foundation Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Xavier Martinet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "authors_in_source_order": [
    "Touvron, Hugo",
    "Lavril, Thibaut",
    "Izacard, Gautier",
    "Martinet, Xavier",
    "Lachaux, Marie-Anne",
    "Lacroix, Timothée",
    "Rozière, Baptiste",
    "Goyal, Naman",
    "Hambro, Eric",
    "Azhar, Faisal",
    "Rodriguez, Aurelien",
    "Joulin, Armand",
    "Grave, Edouard",
    "Lample, Guillaume"
  ],
  "dates": {
    "citation_date": "2023/02/27",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 27 Feb 2023 17:11:15 UTC (364 KB)",
    "retrieved_utc": "2026-10-07T18:10:45.234321+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-6f0fc488c32ea2::S1",
  "title": "LLaMA: Open and Efficient Foundation Language Models",
  "url": "https://arxiv.org/abs/2302.13971",
  "version_url": "https://arxiv.org/abs/2302.13971v1"
}

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Xavier Martinet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Mon, 27 Feb 2023 17:11:15 UTC (364 KB); bounded account of this paper’s method and reported results. Xavier Martinet is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xiaohua Zhai

Xiaohua Zhai is a listed coauthor of the Vision Transformer paper, which applies a Transformer directly to sequences of image patches.

The approach tests whether image classification needs the convolutional-network structure retained by earlier attention-based vision systems.

The reported experiments pretrain on large datasets and transfer to smaller recognition benchmarks, comparing results and training resources with convolutional models.

Sources and details

An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Xiaohua Zhai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "authors_in_source_order": [
    "Dosovitskiy, Alexey",
    "Beyer, Lucas",
    "Kolesnikov, Alexander",
    "Weissenborn, Dirk",
    "Zhai, Xiaohua",
    "Unterthiner, Thomas",
    "Dehghani, Mostafa",
    "Minderer, Matthias",
    "Heigold, Georg",
    "Gelly, Sylvain",
    "Uszkoreit, Jakob",
    "Houlsby, Neil"
  ],
  "dates": {
    "citation_date": "2020/10/22",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.335260+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-5e40a1e78adbd5::S1",
  "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale",
  "url": "https://arxiv.org/abs/2010.11929",
  "version_url": "https://arxiv.org/abs/2010.11929v2"
}

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Xiaohua Zhai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 3 Jun 2021 13:08:56 UTC (3,033 KB); bounded account of this paper’s method and reported results. Xiaohua Zhai is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xu Jiang

Xu Jiang is a listed coauthor of the InstructGPT paper, which studies instruction following through fine-tuning with human feedback.

The procedure first learns from demonstrations and then uses rankings of model outputs for reinforcement learning.

The reported human evaluations favor the resulting responses over a larger comparison model’s outputs, while the authors explicitly acknowledge that mistakes remain.

Sources and details

Training language models to follow instructions with human feedback

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Xu Jiang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "authors_in_source_order": [
    "Ouyang, Long",
    "Wu, Jeff",
    "Jiang, Xu",
    "Almeida, Diogo",
    "Wainwright, Carroll L.",
    "Mishkin, Pamela",
    "Zhang, Chong",
    "Agarwal, Sandhini",
    "Slama, Katarina",
    "Ray, Alex",
    "Schulman, John",
    "Hilton, Jacob",
    "Kelton, Fraser",
    "Miller, Luke",
    "Simens, Maddie",
    "Askell, Amanda",
    "Welinder, Peter",
    "Christiano, Paul",
    "Leike, Jan",
    "Lowe, Ryan"
  ],
  "dates": {
    "citation_date": "2022/03/04",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.590041+00:00",
    "version": "arXiv v1"
  },
  "id": "person-local-xujiang::S1",
  "title": "Training language models to follow instructions with human feedback",
  "url": "https://arxiv.org/abs/2203.02155",
  "version_url": "https://arxiv.org/abs/2203.02155v1"
}

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Xu Jiang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 4 Mar 2022 07:04:42 UTC (1,047 KB); bounded account of this paper’s method and reported results. Xu Jiang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yuval Tassa

Yuval Tassa is a listed coauthor of a deep reinforcement-learning study extending ideas from Deep Q-Learning to continuous actions.

Its model-free actor–critic algorithm uses a deterministic policy gradient and is tested across simulated physical control tasks.

The authors report that the same approach can learn some control policies directly from pixels, including tasks involving locomotion, manipulation and driving.

Sources and details

Continuous control with deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Yuval Tassa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "authors_in_source_order": [
    "Lillicrap, Timothy P.",
    "Hunt, Jonathan J.",
    "Pritzel, Alexander",
    "Heess, Nicolas",
    "Erez, Tom",
    "Tassa, Yuval",
    "Silver, David",
    "Wierstra, Daan"
  ],
  "dates": {
    "citation_date": "2015/09/09",
    "inspected_arxiv_version": "v6",
    "inspected_revision": "Fri, 5 Jul 2019 10:47:27 UTC (339 KB)",
    "retrieved_utc": "2026-10-07T18:11:52.904249+00:00",
    "version": "arXiv v6"
  },
  "id": "person-coverage-2d26cc536993dc::S1",
  "title": "Continuous control with deep reinforcement learning",
  "url": "https://arxiv.org/abs/1509.02971",
  "version_url": "https://arxiv.org/abs/1509.02971v6"
}

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Yuval Tassa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v6 abstract, revised Fri, 5 Jul 2019 10:47:27 UTC (339 KB); bounded account of this paper’s method and reported results. Yuval Tassa is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zach Eaton-Rosen

Zach Eaton-Rosen is a listed coauthor of the GraphCast study, which learns global weather forecasting directly from reanalysis data.

The model predicts many atmospheric variables over a medium-range horizon, rather than relying solely on a traditional numerical forecasting model.

The authors evaluate forecast accuracy and severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Zach Eaton-Rosen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d24f7bf3b31dc8::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Zach Eaton-Rosen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB); bounded account of this paper’s method and reported results. Zach Eaton-Rosen is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhiheng Huang

Zhiheng Huang is a listed coauthor of the ImageNet challenge paper, which documents a large benchmark for image classification and object detection.

The account connects dataset construction with the difficulty of obtaining ground-truth annotations across many image categories.

It reviews recognition advances over the challenge’s first five years and compares computer-vision accuracy with human accuracy.

Sources and details

ImageNet Large Scale Visual Recognition Challenge

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Zhiheng Huang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "authors_in_source_order": [
    "Russakovsky, Olga",
    "Deng, Jia",
    "Su, Hao",
    "Krause, Jonathan",
    "Satheesh, Sanjeev",
    "Ma, Sean",
    "Huang, Zhiheng",
    "Karpathy, Andrej",
    "Khosla, Aditya",
    "Bernstein, Michael",
    "Berg, Alexander C.",
    "Fei-Fei, Li"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB)",
    "retrieved_utc": "2026-10-07T18:10:42.038371+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-0209f4f7c0b107::S1",
  "title": "ImageNet Large Scale Visual Recognition Challenge",
  "url": "https://arxiv.org/abs/1409.0575",
  "version_url": "https://arxiv.org/abs/1409.0575v3"
}

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Zhiheng Huang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Fri, 30 Jan 2015 01:23:59 UTC (7,006 KB); bounded account of this paper’s method and reported results. Zhiheng Huang is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ziang Xiao

Ziang Xiao is a listed coauthor of a cross-disciplinary framework for designing effective human oversight of AI systems.

The proposed framework defines oversight roles, architecture and processes, drawing together computer science, human–computer interaction and other disciplines.

It offers a documentation template for different domains and identifies unresolved questions about implementing and evaluating oversight.

Sources and details

Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ziang Xiao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "authors_in_source_order": [
    "Gaube, Susanne",
    "Langer, Markus",
    "Miller, Tim",
    "Baum, Kevin",
    "Dachselt, Raimund",
    "Feit, Anna Maria",
    "Gadiraju, Ujwal",
    "Kaur, Harmanpreet",
    "Keane, Mark T.",
    "Landers, Richard",
    "Laux, Johann",
    "Liao, Q. Vera",
    "Lim, Brian",
    "Onnasch, Linda",
    "Schrills, Tim",
    "Sonenberg, Liz",
    "Tan, Chenhao",
    "Tintarev, Nava",
    "Xiao, Ziang",
    "Zhang, Hanwei"
  ],
  "dates": {
    "citation_date": "2026/04/09",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB)",
    "retrieved_utc": "2026-10-07T18:11:55.204866+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-11e2c07ffca3fa::S1",
  "title": "Keeping an Eye on AI: A Framework for Effective Human Oversight of AI Systems",
  "url": "https://arxiv.org/abs/2605.16278",
  "version_url": "https://arxiv.org/abs/2605.16278v1"
}

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ziang Xiao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 9 Apr 2026 22:35:41 UTC (1,196 KB); bounded account of this paper’s method and reported results. Ziang Xiao is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zoltan A. Kocsis

Zoltan A. Kocsis is a listed coauthor of the Equational Theories Project report, which combines human and automated proofs to map implications between simple laws for magmas.

The collaboration validates those proofs in Lean, making the resulting relationships formally checkable.

The report also describes newly constructed magmas satisfying particular laws and investigates what changes when attention is restricted to finite structures.

Sources and details

The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Zoltan A. Kocsis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "authors_in_source_order": [
    "Bolan, Matthew",
    "Breitner, Joachim",
    "Brox, Jose",
    "Carlini, Nicholas",
    "Carneiro, Mario",
    "van Doorn, Floris",
    "Dvorak, Martin",
    "Goens, Andrés",
    "Hill, Aaron",
    "Husum, Harald",
    "Mejia, Hernán Ibarra",
    "Kocsis, Zoltan A.",
    "Floch, Bruno Le",
    "Bar-on, Amir Livne",
    "Luccioli, Lorenzo",
    "McNeil, Douglas",
    "Meiburg, Alex",
    "Monticone, Pietro",
    "Nielsen, Pace P.",
    "Osazuwa, Emmanuel Osalotioman",
    "Paolini, Giovanni",
    "Petracci, Marco",
    "Reinke, Bernhard",
    "Renshaw, David",
    "Rossel, Marcus",
    "Roux, Cody",
    "Scanvic, Jérémy",
    "Srinivas, Shreyas",
    "Tadipatri, Anand Rao",
    "Tao, Terence",
    "Tsyrklevich, Vlad",
    "Vaquerizo-Villar, Fernando",
    "Weber, Daniel",
    "Zheng, Fan"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB)",
    "retrieved_utc": "2026-10-07T18:10:46.017432+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3d16c7986ef5cd::S1",
  "title": "The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale",
  "url": "https://arxiv.org/abs/2512.07087",
  "version_url": "https://arxiv.org/abs/2512.07087v2"
}

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Zoltan A. Kocsis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Tue, 16 Dec 2025 14:29:54 UTC (3,345 KB); bounded account of this paper’s method and reported results. Zoltan A. Kocsis is a listed coauthor, with no undocumented individual task, leadership, career or causal influence inferred. No full-paper or experiment replication, universal performance claim, current product availability or identity merge. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aurick Zhou

Aurick Zhou is a listed coauthor of the Soft Actor-Critic paper, which combines an off-policy stochastic actor–critic with a maximum-entropy objective.

The actor balances expected reward with entropy, allowing exploration to remain part of the optimization target.

The authors report continuous-control benchmark comparisons and similar performance across random seeds, addressing sample cost and unstable convergence in their tested settings.

Sources and details

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

{
  "access_scope": "Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Aurick Zhou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "authors_in_source_order": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "dates": {
    "citation_date": "2018/01/04",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB)",
    "original_submission": "Thu, 4 Jan 2018 09:50:50 UTC (2,350 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:14:36.259890+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a2c5270d3703f4::S1",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor",
  "url": "https://arxiv.org/abs/1801.01290",
  "version_url": "https://arxiv.org/abs/1801.01290v2"
}

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Aurick Zhou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Aurick Zhou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Axel Constant

Axel Constant is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Axel Constant is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-238c5c8a8add23::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Axel Constant is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Axel Constant is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bernardo Avila Pires

Bernardo Avila Pires is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bernardo Avila Pires is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-182daf1b87662d::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bernardo Avila Pires is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bernardo Avila Pires is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bob McGrew

Bob McGrew is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bob McGrew is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-e18e67bd356c1c::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bob McGrew is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bob McGrew is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chelsea Finn

Chelsea Finn is a listed coauthor of the Direct Preference Optimization paper, which reformulates preference-based language-model training through a classification loss.

A reward-model parameterization yields a corresponding optimal policy in closed form, avoiding the separate reinforcement-learning procedure of standard RLHF.

The authors report comparisons on sentiment control, summarization and single-turn dialogue, linking the simpler training procedure to those specific evaluations.

Sources and details

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

{
  "access_scope": "Joint-author arXiv v3 abstract for Direct Preference Optimization: Your Language Model is Secretly a Reward Model, revised Mon, 29 Jul 2024 22:26:36 UTC (999 KB). Method and comparison claims are limited to the paper’s preference-training formulation and tested tasks, not universal alignment or safety. Chelsea Finn is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Rafael Rafailov",
    "Archit Sharma",
    "Eric Mitchell",
    "Stefano Ermon",
    "Christopher D. Manning",
    "Chelsea Finn"
  ],
  "authors_in_source_order": [
    "Rafael Rafailov",
    "Archit Sharma",
    "Eric Mitchell",
    "Stefano Ermon",
    "Christopher D. Manning",
    "Chelsea Finn"
  ],
  "dates": {
    "citation_date": "2023/05/29",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 29 Jul 2024 22:26:36 UTC (999 KB)",
    "original_submission": "Mon, 29 May 2023 17:57:46 UTC (982 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:07.646334+00:00",
    "version": "arXiv v3"
  },
  "id": "person-chelseafinn::S1",
  "title": "Direct Preference Optimization: Your Language Model is Secretly a Reward Model",
  "url": "https://arxiv.org/abs/2305.18290",
  "version_url": "https://arxiv.org/abs/2305.18290v3"
}

Joint-author arXiv v3 abstract for Direct Preference Optimization: Your Language Model is Secretly a Reward Model, revised Mon, 29 Jul 2024 22:26:36 UTC (999 KB). Method and comparison claims are limited to the paper’s preference-training formulation and tested tasks, not universal alignment or safety. Chelsea Finn is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Direct Preference Optimization: Your Language Model is Secretly a Reward Model, revised Mon, 29 Jul 2024 22:26:36 UTC (999 KB). Method and comparison claims are limited to the paper’s preference-training formulation and tested tasks, not universal alignment or safety. Chelsea Finn is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chunli Bi

Chunli Bi is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Chunli Bi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-aceaa125508e20::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Chunli Bi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Chunli Bi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dahua Lin

Dahua Lin is a listed coauthor of the InternLM2 report, which details language-model pre-training with text, code and long-context data.

The account describes moving from 4k-token training to 32k-token stages and then aligning the model with supervised fine-tuning and conditional online RLHF.

That alignment strategy addresses conflicting preferences and reward hacking, while releases at different stages and sizes expose the model’s training progression.

Sources and details

InternLM2 Technical Report

{
  "access_scope": "Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Dahua Lin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Zheng Cai",
    "Maosong Cao",
    "Haojiong Chen",
    "Kai Chen",
    "Keyu Chen",
    "Xin Chen",
    "Xun Chen",
    "Zehui Chen",
    "Zhi Chen",
    "Pei Chu",
    "Xiaoyi Dong",
    "Haodong Duan",
    "Qi Fan",
    "Zhaoye Fei",
    "Yang Gao",
    "Jiaye Ge",
    "Chenya Gu",
    "Yuzhe Gu",
    "Tao Gui",
    "Aijia Guo",
    "Qipeng Guo",
    "Conghui He",
    "Yingfan Hu",
    "Ting Huang",
    "Tao Jiang",
    "Penglong Jiao",
    "Zhenjiang Jin",
    "Zhikai Lei",
    "Jiaxing Li",
    "Jingwen Li",
    "Linyang Li",
    "Shuaibin Li",
    "Wei Li",
    "Yining Li",
    "Hongwei Liu",
    "Jiangning Liu",
    "Jiawei Hong",
    "Kaiwen Liu",
    "Kuikun Liu",
    "Xiaoran Liu",
    "Chengqi Lv",
    "Haijun Lv",
    "Kai Lv",
    "Li Ma",
    "Runyuan Ma",
    "Zerun Ma",
    "Wenchang Ning",
    "Linke Ouyang",
    "Jiantao Qiu",
    "Yuan Qu",
    "Fukai Shang",
    "Yunfan Shao",
    "Demin Song",
    "Zifan Song",
    "Zhihao Sui",
    "Peng Sun",
    "Yu Sun",
    "Huanze Tang",
    "Bin Wang",
    "Guoteng Wang",
    "Jiaqi Wang",
    "Jiayu Wang",
    "Rui Wang",
    "Yudong Wang",
    "Ziyi Wang",
    "Xingjian Wei",
    "Qizhen Weng",
    "Fan Wu",
    "Yingtong Xiong",
    "Chao Xu",
    "Ruiliang Xu",
    "Hang Yan",
    "Yirong Yan",
    "Xiaogui Yang",
    "Haochen Ye",
    "Huaiyuan Ying",
    "Jia Yu",
    "Jing Yu",
    "Yuhang Zang",
    "Chuyu Zhang",
    "Li Zhang",
    "Pan Zhang",
    "Peng Zhang",
    "Ruijie Zhang",
    "Shuo Zhang",
    "Songyang Zhang",
    "Wenjian Zhang",
    "Wenwei Zhang",
    "Xingcheng Zhang",
    "Xinyue Zhang",
    "Hui Zhao",
    "Qian Zhao",
    "Xiaomeng Zhao",
    "Fengzhe Zhou",
    "Zaida Zhou",
    "Jingming Zhuo",
    "Yicheng Zou",
    "Xipeng Qiu",
    "Yu Qiao",
    "Dahua Lin"
  ],
  "authors_in_source_order": [
    "Zheng Cai",
    "Maosong Cao",
    "Haojiong Chen",
    "Kai Chen",
    "Keyu Chen",
    "Xin Chen",
    "Xun Chen",
    "Zehui Chen",
    "Zhi Chen",
    "Pei Chu",
    "Xiaoyi Dong",
    "Haodong Duan",
    "Qi Fan",
    "Zhaoye Fei",
    "Yang Gao",
    "Jiaye Ge",
    "Chenya Gu",
    "Yuzhe Gu",
    "Tao Gui",
    "Aijia Guo",
    "Qipeng Guo",
    "Conghui He",
    "Yingfan Hu",
    "Ting Huang",
    "Tao Jiang",
    "Penglong Jiao",
    "Zhenjiang Jin",
    "Zhikai Lei",
    "Jiaxing Li",
    "Jingwen Li",
    "Linyang Li",
    "Shuaibin Li",
    "Wei Li",
    "Yining Li",
    "Hongwei Liu",
    "Jiangning Liu",
    "Jiawei Hong",
    "Kaiwen Liu",
    "Kuikun Liu",
    "Xiaoran Liu",
    "Chengqi Lv",
    "Haijun Lv",
    "Kai Lv",
    "Li Ma",
    "Runyuan Ma",
    "Zerun Ma",
    "Wenchang Ning",
    "Linke Ouyang",
    "Jiantao Qiu",
    "Yuan Qu",
    "Fukai Shang",
    "Yunfan Shao",
    "Demin Song",
    "Zifan Song",
    "Zhihao Sui",
    "Peng Sun",
    "Yu Sun",
    "Huanze Tang",
    "Bin Wang",
    "Guoteng Wang",
    "Jiaqi Wang",
    "Jiayu Wang",
    "Rui Wang",
    "Yudong Wang",
    "Ziyi Wang",
    "Xingjian Wei",
    "Qizhen Weng",
    "Fan Wu",
    "Yingtong Xiong",
    "Chao Xu",
    "Ruiliang Xu",
    "Hang Yan",
    "Yirong Yan",
    "Xiaogui Yang",
    "Haochen Ye",
    "Huaiyuan Ying",
    "Jia Yu",
    "Jing Yu",
    "Yuhang Zang",
    "Chuyu Zhang",
    "Li Zhang",
    "Pan Zhang",
    "Peng Zhang",
    "Ruijie Zhang",
    "Shuo Zhang",
    "Songyang Zhang",
    "Wenjian Zhang",
    "Wenwei Zhang",
    "Xingcheng Zhang",
    "Xinyue Zhang",
    "Hui Zhao",
    "Qian Zhao",
    "Xiaomeng Zhao",
    "Fengzhe Zhou",
    "Zaida Zhou",
    "Jingming Zhuo",
    "Yicheng Zou",
    "Xipeng Qiu",
    "Yu Qiao",
    "Dahua Lin"
  ],
  "dates": {
    "citation_date": "2024/03/26",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB)",
    "original_submission": "Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:29.141698+00:00",
    "version": "arXiv v1"
  },
  "id": "person-dahualin::S1",
  "title": "InternLM2 Technical Report",
  "url": "https://arxiv.org/abs/2403.17297",
  "version_url": "https://arxiv.org/abs/2403.17297v1"
}

Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Dahua Lin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Dahua Lin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Addis

Daniel Addis is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Daniel Addis is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-dbacafb2d32ce6::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Daniel Addis is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Daniel Addis is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Rock

Daniel Rock is a listed coauthor of a study estimating task exposure to language models and associated software across the U.S. labor market.

Its rubric combines human expertise with GPT-4 classifications to compare occupations against model capabilities.

The analysis distinguishes access to an underlying model from tooling built around it, describing potential changes in task completion rather than forecasting an adoption date.

Sources and details

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

{
  "access_scope": "Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Daniel Rock is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "authors_in_source_order": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "dates": {
    "citation_date": "2023/03/17",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB)",
    "original_submission": "Fri, 17 Mar 2023 17:15:20 UTC (5,829 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:41.007518+00:00",
    "version": "arXiv v5"
  },
  "id": "person-local-danielrock::S1",
  "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models",
  "url": "https://arxiv.org/abs/2303.10130",
  "version_url": "https://arxiv.org/abs/2303.10130v5"
}

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Daniel Rock is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Daniel Rock is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Danielle Li

Danielle Li is a listed coauthor of Generative AI at Work, which studies the staggered introduction of an assistant among 5,172 customer-support agents.

The paper measures productivity through issues resolved per hour and reports differing effects by worker experience and skill.

It also examines learning, English fluency and customer interactions, with larger gains on problems for which agents had less prior training.

Sources and details

Generative AI at Work

{
  "access_scope": "Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Danielle Li is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey Raymond"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey Raymond"
  ],
  "dates": {
    "citation_date": "2023/04/23",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB)",
    "original_submission": "Sun, 23 Apr 2023 23:43:57 UTC (8,129 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:41.095680+00:00",
    "version": "arXiv v2"
  },
  "id": "person-local-danielleli::S1",
  "title": "Generative AI at Work",
  "url": "https://arxiv.org/abs/2304.11771",
  "version_url": "https://arxiv.org/abs/2304.11771v2"
}

Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Danielle Li is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Danielle Li is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Patterson

David Patterson is a listed coauthor of a paper arguing that choices in machine-learning training practice can reduce energy use and carbon emissions.

The authors use Google’s reported energy history and reduction estimates to motivate wider adoption of four best practices.

They recommend reporting emissions alongside model quality so comparisons can expose inaccurate accounting rather than treating computational scale alone as the carbon footprint.

Sources and details

The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink

{
  "access_scope": "Joint-author arXiv v1 abstract for The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink, revised Mon, 11 Apr 2022 14:30:27 UTC (511 KB). Google’s reported historical energy share and hypothetical field-wide reductions are bounded to this 2022 argument; the title is not an observed future industry outcome. David Patterson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "David Patterson",
    "Joseph Gonzalez",
    "Urs Hölzle",
    "Quoc Le",
    "Chen Liang",
    "Lluis-Miquel Munguia",
    "Daniel Rothchild",
    "David So",
    "Maud Texier",
    "Jeff Dean"
  ],
  "authors_in_source_order": [
    "David Patterson",
    "Joseph Gonzalez",
    "Urs Hölzle",
    "Quoc Le",
    "Chen Liang",
    "Lluis-Miquel Munguia",
    "Daniel Rothchild",
    "David So",
    "Maud Texier",
    "Jeff Dean"
  ],
  "dates": {
    "citation_date": "2022/04/11",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 11 Apr 2022 14:30:27 UTC (511 KB)",
    "original_submission": "Mon, 11 Apr 2022 14:30:27 UTC (511 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.409362+00:00",
    "version": "arXiv v1"
  },
  "id": "person-davidpatterson::S1",
  "title": "The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink",
  "url": "https://arxiv.org/abs/2204.05149",
  "version_url": "https://arxiv.org/abs/2204.05149v1"
}

Joint-author arXiv v1 abstract for The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink, revised Mon, 11 Apr 2022 14:30:27 UTC (511 KB). Google’s reported historical energy share and hypothetical field-wide reductions are bounded to this 2022 argument; the title is not an observed future industry outcome. David Patterson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink, revised Mon, 11 Apr 2022 14:30:27 UTC (511 KB). Google’s reported historical energy share and hypothetical field-wide reductions are bounded to this 2022 argument; the title is not an observed future industry outcome. David Patterson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daya Guo

Daya Guo is a listed coauthor of the DeepSeek-Coder-V2 report, which continues pre-training a mixture-of-experts code model from a DeepSeek-V2 checkpoint.

The authors describe an additional six trillion tokens and an expansion in supported programming languages and context length.

Their comparisons assess coding and mathematical reasoning alongside general-language capabilities, situating the model’s specialization within a stated evaluation suite.

Sources and details

DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence

{
  "access_scope": "Joint-author arXiv v1 abstract for DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence, revised Mon, 17 Jun 2024 13:51:35 UTC (3,182 KB). Claims concern Coder-V2 and the report’s checkpoint, training and benchmark comparisons; they are not current product guarantees or a claim about the separately versioned DeepSeek-V3. Daya Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "DeepSeek-AI",
    "Qihao Zhu",
    "Daya Guo",
    "Zhihong Shao",
    "Dejian Yang",
    "Peiyi Wang",
    "Runxin Xu",
    "Y. Wu",
    "Yukun Li",
    "Huazuo Gao",
    "Shirong Ma",
    "Wangding Zeng",
    "Xiao Bi",
    "Zihui Gu",
    "Hanwei Xu",
    "Damai Dai",
    "Kai Dong",
    "Liyue Zhang",
    "Yishi Piao",
    "Zhibin Gou",
    "Zhenda Xie",
    "Zhewen Hao",
    "Bingxuan Wang",
    "Junxiao Song",
    "Deli Chen",
    "Xin Xie",
    "Kang Guan",
    "Yuxiang You",
    "Aixin Liu",
    "Qiushi Du",
    "Wenjun Gao",
    "Xuan Lu",
    "Qinyu Chen",
    "Yaohui Wang",
    "Chengqi Deng",
    "Jiashi Li",
    "Chenggang Zhao",
    "Chong Ruan",
    "Fuli Luo",
    "Wenfeng Liang"
  ],
  "authors_in_source_order": [
    "DeepSeek-AI",
    "Qihao Zhu",
    "Daya Guo",
    "Zhihong Shao",
    "Dejian Yang",
    "Peiyi Wang",
    "Runxin Xu",
    "Y. Wu",
    "Yukun Li",
    "Huazuo Gao",
    "Shirong Ma",
    "Wangding Zeng",
    "Xiao Bi",
    "Zihui Gu",
    "Hanwei Xu",
    "Damai Dai",
    "Kai Dong",
    "Liyue Zhang",
    "Yishi Piao",
    "Zhibin Gou",
    "Zhenda Xie",
    "Zhewen Hao",
    "Bingxuan Wang",
    "Junxiao Song",
    "Deli Chen",
    "Xin Xie",
    "Kang Guan",
    "Yuxiang You",
    "Aixin Liu",
    "Qiushi Du",
    "Wenjun Gao",
    "Xuan Lu",
    "Qinyu Chen",
    "Yaohui Wang",
    "Chengqi Deng",
    "Jiashi Li",
    "Chenggang Zhao",
    "Chong Ruan",
    "Fuli Luo",
    "Wenfeng Liang"
  ],
  "dates": {
    "citation_date": "2024/06/17",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 17 Jun 2024 13:51:35 UTC (3,182 KB)",
    "original_submission": "Mon, 17 Jun 2024 13:51:35 UTC (3,182 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:29.404322+00:00",
    "version": "arXiv v1"
  },
  "id": "person-dayaguo::S1",
  "title": "DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence",
  "url": "https://arxiv.org/abs/2406.11931",
  "version_url": "https://arxiv.org/abs/2406.11931v1"
}

Joint-author arXiv v1 abstract for DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence, revised Mon, 17 Jun 2024 13:51:35 UTC (3,182 KB). Claims concern Coder-V2 and the report’s checkpoint, training and benchmark comparisons; they are not current product guarantees or a claim about the separately versioned DeepSeek-V3. Daya Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence, revised Mon, 17 Jun 2024 13:51:35 UTC (3,182 KB). Claims concern Coder-V2 and the report’s checkpoint, training and benchmark comparisons; they are not current product guarantees or a claim about the separately versioned DeepSeek-V3. Daya Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Denis Yarats

Denis Yarats is a listed coauthor of a Perplexity study analyzing adoption and usage of the Comet browser’s integrated AI agent.

Anonymized interaction data are organized into a hierarchical taxonomy of topics, subtopics and tasks to examine how people use the assistant.

The authors compare user segments and short-term persistence with later shifts toward more cognitively oriented activities, offering a field account of this product’s use.

Sources and details

The Adoption and Usage of AI Agents: Early Evidence from Perplexity

{
  "access_scope": "Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Denis Yarats is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jeremy Yang",
    "Noah Yonack",
    "Kate Zyskowski",
    "Denis Yarats",
    "Johnny Ho",
    "Jerry Ma"
  ],
  "authors_in_source_order": [
    "Jeremy Yang",
    "Noah Yonack",
    "Kate Zyskowski",
    "Denis Yarats",
    "Johnny Ho",
    "Jerry Ma"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB)",
    "original_submission": "Mon, 8 Dec 2025 18:56:10 UTC (3,170 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:08.407841+00:00",
    "version": "arXiv v2"
  },
  "id": "person-denisyarats::S1",
  "title": "The Adoption and Usage of AI Agents: Early Evidence from Perplexity",
  "url": "https://arxiv.org/abs/2512.07828",
  "version_url": "https://arxiv.org/abs/2512.07828v2"
}

Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Denis Yarats is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Denis Yarats is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dian Yu

Dian Yu is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Dian Yu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-dianyu::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Dian Yu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Dian Yu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward Yang

Edward Yang is a listed coauthor of the PyTorch paper, which explains an imperative Python programming model together with the library’s runtime architecture.

Its design keeps model code under ordinary Python control while supporting efficient execution and hardware accelerators.

The authors evaluate individual subsystems and overall benchmark speed to connect those implementation principles with reported performance.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Edward Yang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "authors_in_source_order": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "citation_date": "2019/12/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:01:47.063189+00:00",
    "version": "arXiv v1"
  },
  "id": "person-edwardyang::S1",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703",
  "version_url": "https://arxiv.org/abs/1912.01703v1"
}

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Edward Yang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Edward Yang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Faezeh B. Pasandi

Faezeh B. Pasandi is a listed coauthor of a paper proposing Relate, a framework for assessing moral consideration through human–AI relationships rather than verified inner experience.

The authors compare seven governance frameworks and propose relational impact assessments, graduated protocols and interdisciplinary ethical analysis.

A sample assessment of a deployed companion system illustrates the approach, while the paper explicitly avoids claiming that current AI systems are conscious.

Sources and details

Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction

{
  "access_scope": "Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Faezeh B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Faezeh B. Pasandi",
    "Hannah B. Pasandi"
  ],
  "authors_in_source_order": [
    "Faezeh B. Pasandi",
    "Hannah B. Pasandi"
  ],
  "dates": {
    "citation_date": "2026/02/13",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 13 Feb 2026 03:16:41 UTC (524 KB)",
    "original_submission": "Fri, 13 Feb 2026 03:16:41 UTC (524 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:18:45.344267+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-fb149776fca13d::S1",
  "title": "Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction",
  "url": "https://arxiv.org/abs/2603.00078",
  "version_url": "https://arxiv.org/abs/2603.00078v1"
}

Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Faezeh B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Faezeh B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Greg Brockman

Greg Brockman is a listed coauthor of the OpenAI Gym whitepaper, which presents a common interface for reinforcement-learning benchmark problems.

The toolkit’s shared environment interface enables algorithm results to be compared across a growing collection of tasks.

The paper explains software components and design choices alongside a website for sharing outcomes, connecting implementation conventions with research evaluation.

Sources and details

OpenAI Gym

{
  "access_scope": "Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Greg Brockman is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "authors_in_source_order": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "citation_date": "2016/06/05",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.531635+00:00",
    "version": "arXiv v1"
  },
  "id": "person-gregbrockman::S1",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540",
  "version_url": "https://arxiv.org/abs/1606.01540v1"
}

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Greg Brockman is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Greg Brockman is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Haoqi Fan

Haoqi Fan is a listed coauthor of the Momentum Contrast paper, which learns visual representations through a dynamic dictionary of examples.

A queue and a moving-averaged encoder keep that dictionary large and consistent as training proceeds.

The authors report linear image-classification and downstream detection or segmentation evaluations to assess whether unsupervised pre-training can transfer beyond its training objective.

Sources and details

Momentum Contrast for Unsupervised Visual Representation Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Haoqi Fan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "authors_in_source_order": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "dates": {
    "citation_date": "2019/11/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 23 Mar 2020 18:36:55 UTC (210 KB)",
    "original_submission": "Wed, 13 Nov 2019 18:53:26 UTC (173 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.630437+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2c5f10c43978d2::S1",
  "title": "Momentum Contrast for Unsupervised Visual Representation Learning",
  "url": "https://arxiv.org/abs/1911.05722",
  "version_url": "https://arxiv.org/abs/1911.05722v3"
}

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Haoqi Fan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Haoqi Fan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jacob Devlin

Jacob Devlin is a listed coauthor of the BERT paper, which pre-trains representations using both left and right context throughout its layers.

The resulting model can be adapted to tasks such as question answering and inference by adding a single output layer rather than substantially redesigning the architecture.

The authors report results across eleven natural-language-processing tasks, connecting bidirectional pre-training with a reusable adaptation strategy.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Jacob Devlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "authors_in_source_order": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "dates": {
    "citation_date": "2018/10/11",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 24 May 2019 20:37:26 UTC (309 KB)",
    "original_submission": "Thu, 11 Oct 2018 00:50:01 UTC (227 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:06.685652+00:00",
    "version": "arXiv v2"
  },
  "id": "person-jacobdevlin::S1",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://arxiv.org/abs/1810.04805",
  "version_url": "https://arxiv.org/abs/1810.04805v2"
}

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Jacob Devlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Jacob Devlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Inioluwa Deborah Raji

Inioluwa Deborah Raji is a listed coauthor of a paper proposing internal algorithmic auditing across the AI development lifecycle.

Each audit stage generates documents that combine into a report assessing decisions against an organization’s values or principles.

The framework responds to difficulty identifying harm before deployment and tracing later issues, making audit integrity part of the development process rather than only an external investigation.

Sources and details

Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditing

{
  "access_scope": "Joint-author arXiv v1 abstract for Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditing, revised Fri, 3 Jan 2020 20:19:04 UTC (2,536 KB). The auditing framework is a proposal for organizational process, not certification that any particular deployment is harmless or that this coauthor performed a specific audit. Inioluwa Deborah Raji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Inioluwa Deborah Raji",
    "Andrew Smart",
    "Rebecca N. White",
    "Margaret Mitchell",
    "Timnit Gebru",
    "Ben Hutchinson",
    "Jamila Smith-Loud",
    "Daniel Theron",
    "Parker Barnes"
  ],
  "authors_in_source_order": [
    "Inioluwa Deborah Raji",
    "Andrew Smart",
    "Rebecca N. White",
    "Margaret Mitchell",
    "Timnit Gebru",
    "Ben Hutchinson",
    "Jamila Smith-Loud",
    "Daniel Theron",
    "Parker Barnes"
  ],
  "dates": {
    "citation_date": "2020/01/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 3 Jan 2020 20:19:04 UTC (2,536 KB)",
    "original_submission": "Fri, 3 Jan 2020 20:19:04 UTC (2,536 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.780657+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-2f17437919ad90::S1",
  "title": "Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditing",
  "url": "https://arxiv.org/abs/2001.00973",
  "version_url": "https://arxiv.org/abs/2001.00973v1"
}

Joint-author arXiv v1 abstract for Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditing, revised Fri, 3 Jan 2020 20:19:04 UTC (2,536 KB). The auditing framework is a proposal for organizational process, not certification that any particular deployment is harmless or that this coauthor performed a specific audit. Inioluwa Deborah Raji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditing, revised Fri, 3 Jan 2020 20:19:04 UTC (2,536 KB). The auditing framework is a proposal for organizational process, not certification that any particular deployment is harmless or that this coauthor performed a specific audit. Inioluwa Deborah Raji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Avi Pfeffer

Avi Pfeffer is a listed coauthor of Object-Oriented Bayesian Networks, which models complex probabilistic domains as related objects.

The paper uses network fragments for object attributes, including nested objects, and classes for reusable models and inheritance.

Its inference approach exploits encapsulated variables and repeated fragments to reuse the structure expressed by those models.

Sources and details

Object-Oriented Bayesian Networks

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Avi Pfeffer is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Koller, Daphne",
    "Pfeffer, Avi"
  ],
  "authors_in_source_order": [
    "Koller, Daphne",
    "Pfeffer, Avi"
  ],
  "dates": {
    "citation_date": "2013/02/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB)",
    "retrieved_utc": "2026-10-07T18:13:47.213148+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-4da93042a156de::S1",
  "title": "Object-Oriented Bayesian Networks",
  "url": "https://arxiv.org/abs/1302.1554",
  "version_url": "https://arxiv.org/abs/1302.1554v1"
}

Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Avi Pfeffer is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Avi Pfeffer is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Benjamin Chess

Benjamin Chess is a listed coauthor of Language Models are Few-Shot Learners, which evaluates a large autoregressive model using instructions and examples supplied as text.

The reported tasks are performed without task-specific gradient updates or fine-tuning, allowing the paper to examine transfer through prompting.

The abstract also identifies tasks where few-shot performance remains difficult and methodological concerns associated with training on large web corpora.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Benjamin Chess is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2020/05/28",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-benjaminchess::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Benjamin Chess is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Benjamin Chess is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Binyuan Hui

Binyuan Hui is a listed coauthor of the Qwen2.5-Coder Technical Report, which describes six code-focused models built on the Qwen2.5 architecture.

The report combines continued pretraining with data cleaning, synthetic data generation, and balanced mixing of training sources.

Its evaluations span generation, completion, reasoning, and repair, while the abstract states that general-language and mathematics abilities are retained.

Sources and details

Qwen2.5-Coder Technical Report

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Tue, 12 Nov 2024 13:24:25 UTC (1,824 KB); account limited to this paper’s method and reported evaluation. Binyuan Hui is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Hui, Binyuan",
    "Yang, Jian",
    "Cui, Zeyu",
    "Yang, Jiaxi",
    "Liu, Dayiheng",
    "Zhang, Lei",
    "Liu, Tianyu",
    "Zhang, Jiajun",
    "Yu, Bowen",
    "Lu, Keming",
    "Dang, Kai",
    "Fan, Yang",
    "Zhang, Yichang",
    "Yang, An",
    "Men, Rui",
    "Huang, Fei",
    "Zheng, Bo",
    "Miao, Yibo",
    "Quan, Shanghaoran",
    "Feng, Yunlong",
    "Ren, Xingzhang",
    "Ren, Xuancheng",
    "Zhou, Jingren",
    "Lin, Junyang"
  ],
  "authors_in_source_order": [
    "Hui, Binyuan",
    "Yang, Jian",
    "Cui, Zeyu",
    "Yang, Jiaxi",
    "Liu, Dayiheng",
    "Zhang, Lei",
    "Liu, Tianyu",
    "Zhang, Jiajun",
    "Yu, Bowen",
    "Lu, Keming",
    "Dang, Kai",
    "Fan, Yang",
    "Zhang, Yichang",
    "Yang, An",
    "Men, Rui",
    "Huang, Fei",
    "Zheng, Bo",
    "Miao, Yibo",
    "Quan, Shanghaoran",
    "Feng, Yunlong",
    "Ren, Xingzhang",
    "Ren, Xuancheng",
    "Zhou, Jingren",
    "Lin, Junyang"
  ],
  "dates": {
    "citation_date": "2024/09/18",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 12 Nov 2024 13:24:25 UTC (1,824 KB)",
    "retrieved_utc": "2026-10-07T18:01:48.544740+00:00",
    "version": "arXiv v3"
  },
  "id": "person-binyuanhui::S1",
  "title": "Qwen2.5-Coder Technical Report",
  "url": "https://arxiv.org/abs/2409.12186",
  "version_url": "https://arxiv.org/abs/2409.12186v3"
}

Joint-author arXiv v3 abstract, revised Tue, 12 Nov 2024 13:24:25 UTC (1,824 KB); account limited to this paper’s method and reported evaluation. Binyuan Hui is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Tue, 12 Nov 2024 13:24:25 UTC (1,824 KB); account limited to this paper’s method and reported evaluation. Binyuan Hui is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Briana Vecchione

Briana Vecchione is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Briana Vecchione is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-42ce3826006974::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Briana Vecchione is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Briana Vecchione is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chelsea Voss

Chelsea Voss is a listed coauthor of Zero-Shot Text-to-Image Generation, which uses a transformer to model text and image tokens together.

The approach treats both token types as one autoregressive stream rather than introducing the specialized architectures or auxiliary information discussed in the abstract.

The paper evaluates transfer in a zero-shot setting and reports competitiveness with earlier domain-specific models at sufficient data and scale.

Sources and details

Zero-Shot Text-to-Image Generation

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Chelsea Voss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.328112+00:00",
    "version": "arXiv v2"
  },
  "id": "person-chelseavoss::S1",
  "title": "Zero-Shot Text-to-Image Generation",
  "url": "https://arxiv.org/abs/2102.12092",
  "version_url": "https://arxiv.org/abs/2102.12092v2"
}

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Chelsea Voss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Chelsea Voss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cheng Chi

Cheng Chi is a listed coauthor of Diffusion Policy, which represents robot visuomotor behavior as a conditional denoising process.

The method learns a score over action distributions and iteratively generates actions through stochastic Langevin steps.

The paper combines visual conditioning, receding-horizon control, and a time-series diffusion transformer and evaluates the policy on manipulation benchmarks.

Sources and details

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Cheng Chi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "authors_in_source_order": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "dates": {
    "citation_date": "2023/03/07",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.970346+00:00",
    "version": "arXiv v5"
  },
  "id": "person-chengchi::S1",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137",
  "version_url": "https://arxiv.org/abs/2303.04137v5"
}

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Cheng Chi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Cheng Chi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Hallacy

Chris Hallacy is a listed coauthor of Learning Transferable Visual Models From Natural Language Supervision, which learns visual representations by matching images to captions.

After pretraining on paired images and text, descriptions of visual concepts specify downstream tasks without dataset-specific training.

The evaluation covers image classification, text recognition, action recognition, and location tasks across more than thirty computer-vision datasets.

Sources and details

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Chris Hallacy is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Radford, Alec",
    "Kim, Jong Wook",
    "Hallacy, Chris",
    "Ramesh, Aditya",
    "Goh, Gabriel",
    "Agarwal, Sandhini",
    "Sastry, Girish",
    "Askell, Amanda",
    "Mishkin, Pamela",
    "Clark, Jack",
    "Krueger, Gretchen",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Kim, Jong Wook",
    "Hallacy, Chris",
    "Ramesh, Aditya",
    "Goh, Gabriel",
    "Agarwal, Sandhini",
    "Sastry, Girish",
    "Askell, Amanda",
    "Mishkin, Pamela",
    "Clark, Jack",
    "Krueger, Gretchen",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/26",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.434351+00:00",
    "version": "arXiv v1"
  },
  "id": "person-chrishallacy::S1",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://arxiv.org/abs/2103.00020",
  "version_url": "https://arxiv.org/abs/2103.00020v1"
}

Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Chris Hallacy is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Chris Hallacy is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cliff Young

Cliff Young is a listed coauthor of In-Datacenter Performance Analysis of a Tensor Processing Unit, which evaluates a custom neural-network inference chip.

The described design combines an eight-bit matrix-multiply unit with software-managed on-chip memory and deterministic execution.

The paper compares it with contemporary server CPUs and GPUs using production neural-network workloads, tying reported efficiency and latency advantages to that hardware and workload context.

Sources and details

In-Datacenter Performance Analysis of a Tensor Processing Unit

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Cliff Young is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "authors_in_source_order": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "dates": {
    "citation_date": "2017/04/16",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB)",
    "retrieved_utc": "2026-10-07T18:15:53.768120+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-fc60f24b7437fd::S1",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit",
  "url": "https://arxiv.org/abs/1704.04760",
  "version_url": "https://arxiv.org/abs/1704.04760v1"
}

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Cliff Young is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Cliff Young is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Clément Delangue

Clément Delangue is a listed coauthor of HuggingFace's Transformers, which describes an open-source library bringing pretrained transformer models under a shared interface.

The library combines implementations of transformer architectures with a curated collection of community-accessible pretrained models.

The paper frames extensibility for researchers, usability for practitioners, and industrial deployment as design goals for the library.

Sources and details

HuggingFace's Transformers: State-of-the-art Natural Language Processing

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Clément Delangue is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "authors_in_source_order": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "dates": {
    "citation_date": "2019/10/09",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Tue, 14 Jul 2020 03:42:34 UTC (642 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.614437+00:00",
    "version": "arXiv v5"
  },
  "id": "person-clementdelangue::S1",
  "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing",
  "url": "https://arxiv.org/abs/1910.03771",
  "version_url": "https://arxiv.org/abs/1910.03771v5"
}

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Clément Delangue is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Clément Delangue is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dzmitry Bahdanau

Dzmitry Bahdanau is a listed coauthor of Neural Machine Translation by Jointly Learning to Align and Translate, which addresses the fixed-vector bottleneck of encoder–decoder translation.

The proposed model softly searches the source sentence for information relevant to each target word instead of encoding every dependency in one fixed representation.

The paper evaluates English-to-French translation and examines whether the learned alignments correspond to interpretable relationships between sentences.

Sources and details

Neural Machine Translation by Jointly Learning to Align and Translate

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Dzmitry Bahdanau is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bahdanau, Dzmitry",
    "Cho, Kyunghyun",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Bahdanau, Dzmitry",
    "Cho, Kyunghyun",
    "Bengio, Yoshua"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Thu, 19 May 2016 21:53:22 UTC (144 KB)",
    "retrieved_utc": "2026-10-07T18:19:07.840671+00:00",
    "version": "arXiv v7"
  },
  "id": "person-dzmitrybahdanau::S1",
  "title": "Neural Machine Translation by Jointly Learning to Align and Translate",
  "url": "https://arxiv.org/abs/1409.0473",
  "version_url": "https://arxiv.org/abs/1409.0473v7"
}

Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Dzmitry Bahdanau is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Dzmitry Bahdanau is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric A. Weiss

Eric A. Weiss is a listed coauthor of Deep Unsupervised Learning using Nonequilibrium Thermodynamics, which constructs a generative model through forward and reverse diffusion.

The forward process gradually destroys structure in data, and a learned reverse process restores it.

The paper presents this construction as supporting sampling, probability evaluation, and conditional and posterior inference within a tractable model.

Sources and details

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Eric A. Weiss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "authors_in_source_order": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "dates": {
    "citation_date": "2015/03/12",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.260482+00:00",
    "version": "arXiv v8"
  },
  "id": "person-ericaweiss::S1",
  "title": "Deep Unsupervised Learning using Nonequilibrium Thermodynamics",
  "url": "https://arxiv.org/abs/1503.03585",
  "version_url": "https://arxiv.org/abs/1503.03585v8"
}

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Eric A. Weiss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Eric A. Weiss is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Greg Corrado

Greg Corrado is a listed coauthor of Efficient Estimation of Word Representations in Vector Space, which proposes two architectures for learning continuous word vectors.

The paper compares representation quality on word-similarity tasks with earlier neural-network techniques.

Its reported evaluation considers both syntactic and semantic relationships, connecting representation quality to the computational cost of learning from a large text corpus.

Sources and details

Efficient Estimation of Word Representations in Vector Space

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Greg Corrado is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Mikolov, Tomas",
    "Chen, Kai",
    "Corrado, Greg",
    "Dean, Jeffrey"
  ],
  "authors_in_source_order": [
    "Mikolov, Tomas",
    "Chen, Kai",
    "Corrado, Greg",
    "Dean, Jeffrey"
  ],
  "dates": {
    "citation_date": "2013/01/16",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Sat, 7 Sep 2013 00:30:40 UTC (48 KB)",
    "retrieved_utc": "2026-10-07T18:19:38.951471+00:00",
    "version": "arXiv v3"
  },
  "id": "person-gregcorrado::S1",
  "title": "Efficient Estimation of Word Representations in Vector Space",
  "url": "https://arxiv.org/abs/1301.3781",
  "version_url": "https://arxiv.org/abs/1301.3781v3"
}

Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Greg Corrado is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Greg Corrado is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hoang Nguyen

Hoang Nguyen is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Hoang Nguyen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-3338c02ba86fa8::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Hoang Nguyen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Hoang Nguyen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Huizi Mao

Huizi Mao is a listed coauthor of Deep Compression, which combines pruning, trained quantization, and Huffman coding to reduce neural-network storage.

The method removes less important connections, shares weights through quantization, and retrains the remaining connections and quantized centroids.

The paper reports compression and hardware benchmarks for specific networks, connecting smaller models to on-chip memory and constrained mobile deployment.

Sources and details

Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Huizi Mao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "authors_in_source_order": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "dates": {
    "citation_date": "2015/10/01",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 15 Feb 2016 06:25:40 UTC (755 KB)",
    "retrieved_utc": "2026-10-07T18:14:34.518964+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-6e595ad90a46ce::S1",
  "title": "Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding",
  "url": "https://arxiv.org/abs/1510.00149",
  "version_url": "https://arxiv.org/abs/1510.00149v5"
}

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Huizi Mao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Huizi Mao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hélie Bazin

Hélie Bazin is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Hélie Bazin is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8c1c235e35f69a::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Hélie Bazin is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Hélie Bazin is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ilya Sutskever

Ilya Sutskever is a listed coauthor of Sequence to Sequence Learning with Neural Networks, which maps an input sequence to a fixed-dimensional vector and decodes an output sequence with another LSTM.

The paper evaluates English-to-French translation and also uses the network to rerank hypotheses from a phrase-based translation system.

Its abstract reports that reversing source-word order creates shorter dependencies and improves optimization, keeping that observation tied to the tested sequence-learning setup.

Sources and details

Sequence to Sequence Learning with Neural Networks

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Sun, 14 Dec 2014 20:59:51 UTC (66 KB); account limited to this paper’s method and reported evaluation. Ilya Sutskever is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Sutskever, Ilya",
    "Vinyals, Oriol",
    "Le, Quoc V."
  ],
  "authors_in_source_order": [
    "Sutskever, Ilya",
    "Vinyals, Oriol",
    "Le, Quoc V."
  ],
  "dates": {
    "citation_date": "2014/09/10",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Sun, 14 Dec 2014 20:59:51 UTC (66 KB)",
    "retrieved_utc": "2026-10-07T18:19:39.333616+00:00",
    "version": "arXiv v3"
  },
  "id": "person-ilyasutskever::S1",
  "title": "Sequence to Sequence Learning with Neural Networks",
  "url": "https://arxiv.org/abs/1409.3215",
  "version_url": "https://arxiv.org/abs/1409.3215v3"
}

Joint-author arXiv v3 abstract, revised Sun, 14 Dec 2014 20:59:51 UTC (66 KB); account limited to this paper’s method and reported evaluation. Ilya Sutskever is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Sun, 14 Dec 2014 20:59:51 UTC (66 KB); account limited to this paper’s method and reported evaluation. Ilya Sutskever is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jaakko Lehtinen

Jaakko Lehtinen is a listed coauthor of Progressive Growing of GANs, which increases generator and discriminator resolution during training.

Starting at low resolution, the method adds layers to learn finer detail, alongside measures intended to increase variation and stabilize competition between the networks.

The paper also proposes an evaluation metric covering image quality and diversity and constructs a higher-quality CelebA dataset.

Sources and details

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Jaakko Lehtinen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "authors_in_source_order": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "dates": {
    "citation_date": "2017/10/27",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB)",
    "retrieved_utc": "2026-10-07T18:12:34.357536+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-682d0a64329a08::S1",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/abs/1710.10196",
  "version_url": "https://arxiv.org/abs/1710.10196v3"
}

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Jaakko Lehtinen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Jaakko Lehtinen is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jared Kaplan

Jared Kaplan is a listed coauthor of Scaling Laws for Neural Language Models, which studies how cross-entropy loss varies with model size, dataset size, and training compute.

The paper expresses observed trends as power-law relationships and equations governing overfitting and training speed.

It uses those relationships to analyze allocation of a fixed compute budget, reporting a regime favoring larger models trained on relatively modest data and stopped before convergence.

Sources and details

Scaling Laws for Neural Language Models

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 23 Jan 2020 03:59:20 UTC (1,520 KB); account limited to this paper’s method and reported evaluation. Jared Kaplan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Kaplan, Jared",
    "McCandlish, Sam",
    "Henighan, Tom",
    "Brown, Tom B.",
    "Chess, Benjamin",
    "Child, Rewon",
    "Gray, Scott",
    "Radford, Alec",
    "Wu, Jeffrey",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Kaplan, Jared",
    "McCandlish, Sam",
    "Henighan, Tom",
    "Brown, Tom B.",
    "Chess, Benjamin",
    "Child, Rewon",
    "Gray, Scott",
    "Radford, Alec",
    "Wu, Jeffrey",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2020/01/23",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 23 Jan 2020 03:59:20 UTC (1,520 KB)",
    "retrieved_utc": "2026-10-07T17:54:15.385719+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jaredkaplan::S1",
  "title": "Scaling Laws for Neural Language Models",
  "url": "https://arxiv.org/abs/2001.08361",
  "version_url": "https://arxiv.org/abs/2001.08361v1"
}

Joint-author arXiv v1 abstract, revised Thu, 23 Jan 2020 03:59:20 UTC (1,520 KB); account limited to this paper’s method and reported evaluation. Jared Kaplan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Thu, 23 Jan 2020 03:59:20 UTC (1,520 KB); account limited to this paper’s method and reported evaluation. Jared Kaplan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bilal Piot

Bilal Piot is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bilal Piot is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-8825e67575b411::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bilal Piot is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Bilal Piot is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bowen Baker

Bowen Baker is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bowen Baker is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-ab3c41e06a70aa::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bowen Baker is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Bowen Baker is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carl Doersch

Carl Doersch is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Carl Doersch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2eaa3c6e3dc45c::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Carl Doersch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Carl Doersch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Frith

Chris Frith is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Chris Frith is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-cefd01f826f42e::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Chris Frith is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Chris Frith is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Colin Klein

Colin Klein is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Colin Klein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-6dadcbeb6403e5::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Colin Klein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Colin Klein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Corentin Tallec

Corentin Tallec is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Corentin Tallec is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-e7fbc280731f13::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Corentin Tallec is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Corentin Tallec is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daphne Koller

Daphne Koller is a listed coauthor of Object-Oriented Bayesian Networks, which models complex probabilistic domains as related objects.

The paper uses network fragments for object attributes, including nested objects, and classes for reusable models and inheritance.

Its inference approach exploits encapsulated variables and repeated fragments to reuse the structure expressed by those models.

Sources and details

Object-Oriented Bayesian Networks

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Daphne Koller is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Koller, Daphne",
    "Pfeffer, Avi"
  ],
  "authors_in_source_order": [
    "Koller, Daphne",
    "Pfeffer, Avi"
  ],
  "dates": {
    "citation_date": "2013/02/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB)",
    "retrieved_utc": "2026-10-07T18:13:47.213148+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-4b4081c16d0f96::S1",
  "title": "Object-Oriented Bayesian Networks",
  "url": "https://arxiv.org/abs/1302.1554",
  "version_url": "https://arxiv.org/abs/1302.1554v1"
}

Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Daphne Koller is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Wed, 6 Feb 2013 15:57:36 UTC (1,425 KB); account limited to this paper’s method and reported evaluation. Daphne Koller is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David A. Raho

David A. Raho is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. David A. Raho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-301946c010c751::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. David A. Raho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. David A. Raho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Rubinstein

David Rubinstein is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. David Rubinstein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-d2b9f13d250ac8::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. David Rubinstein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. David Rubinstein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Elmoznino

Eric Elmoznino is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Elmoznino is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-a5b158ce32a61b::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Elmoznino is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Elmoznino is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Schwitzgebel

Eric Schwitzgebel is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Schwitzgebel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-a2efc72a573fba::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Schwitzgebel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Eric Schwitzgebel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Erik Brynjolfsson

Erik Brynjolfsson is a listed coauthor of Generative AI at Work, which studies the staggered introduction of an assistant among 5,172 customer-support agents.

The paper measures productivity through issues resolved per hour and reports differing effects by worker experience and skill.

It also examines learning, English fluency and customer interactions, with larger gains on problems for which agents had less prior training.

Sources and details

Generative AI at Work

{
  "access_scope": "Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Erik Brynjolfsson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey Raymond"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey Raymond"
  ],
  "dates": {
    "citation_date": "2023/04/23",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB)",
    "original_submission": "Sun, 23 Apr 2023 23:43:57 UTC (8,129 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:41.095680+00:00",
    "version": "arXiv v2"
  },
  "id": "person-local-erikbrynjolfsson::S1",
  "title": "Generative AI at Work",
  "url": "https://arxiv.org/abs/2304.11771",
  "version_url": "https://arxiv.org/abs/2304.11771v2"
}

Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Erik Brynjolfsson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Generative AI at Work, revised Wed, 6 Nov 2024 02:35:01 UTC (8,741 KB). The inspected 2024 revision concerns this customer-support setting and its heterogeneous effects; it does not establish the same gains for every workforce or replace earlier versions’ results. Erik Brynjolfsson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Florent Altché

Florent Altché is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florent Altché is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-3e9c4c09aef1d7::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florent Altché is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florent Altché is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Florian Strub

Florian Strub is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florian Strub is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-9bb100720a1fa7::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florian Strub is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Florian Strub is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank Zimmer

Frank Zimmer is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Frank Zimmer is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-997f6741b73d7f::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Frank Zimmer is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Frank Zimmer is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gabriel Goh

Gabriel Goh is a listed coauthor of Zero-Shot Text-to-Image Generation, which uses a transformer to model text and image tokens together.

The approach treats both token types as one autoregressive stream rather than introducing the specialized architectures or auxiliary information discussed in the abstract.

The paper evaluates transfer in a zero-shot setting and reports competitiveness with earlier domain-specific models at sufficient data and scale.

Sources and details

Zero-Shot Text-to-Image Generation

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Gabriel Goh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.328112+00:00",
    "version": "arXiv v2"
  },
  "id": "person-gabrielgoh::S1",
  "title": "Zero-Shot Text-to-Image Generation",
  "url": "https://arxiv.org/abs/2102.12092",
  "version_url": "https://arxiv.org/abs/2102.12092v2"
}

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Gabriel Goh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Gabriel Goh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Deane

George Deane is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. George Deane is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-a2c3188cffd76a::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. George Deane is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. George Deane is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Glenn Powell

Glenn Powell is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Glenn Powell is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a72b09bdecd34f::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Glenn Powell is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Glenn Powell is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Grace Lindsay

Grace Lindsay is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Grace Lindsay is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-3dbcc9b8ed120d::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Grace Lindsay is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Grace Lindsay is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hag-Min Kim

Hag-Min Kim is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Hag-Min Kim is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-defb7ceb0aa157::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Hag-Min Kim is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Hag-Min Kim is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hal Daumé III

Hal Daumé III is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hal Daumé III is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-9cbfb523bb2c94::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hal Daumé III is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hal Daumé III is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hanna Wallach

Hanna Wallach is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hanna Wallach is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-f419a693cee82f::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hanna Wallach is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Hanna Wallach is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hannah B. Pasandi

Hannah B. Pasandi is a listed coauthor of a paper proposing Relate, a framework for assessing moral consideration through human–AI relationships rather than verified inner experience.

The authors compare seven governance frameworks and propose relational impact assessments, graduated protocols and interdisciplinary ethical analysis.

A sample assessment of a deployed companion system illustrates the approach, while the paper explicitly avoids claiming that current AI systems are conscious.

Sources and details

Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction

{
  "access_scope": "Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Hannah B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Faezeh B. Pasandi",
    "Hannah B. Pasandi"
  ],
  "authors_in_source_order": [
    "Faezeh B. Pasandi",
    "Hannah B. Pasandi"
  ],
  "dates": {
    "citation_date": "2026/02/13",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 13 Feb 2026 03:16:41 UTC (524 KB)",
    "original_submission": "Fri, 13 Feb 2026 03:16:41 UTC (524 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:18:45.344267+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-f3ffb88d5325e5::S1",
  "title": "Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction",
  "url": "https://arxiv.org/abs/2603.00078",
  "version_url": "https://arxiv.org/abs/2603.00078v1"
}

Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Hannah B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Alignment Is Not Enough: A Relational Framework for Moral Standing in Human-AI Interaction, revised Fri, 13 Feb 2026 03:16:41 UTC (524 KB). Relate is an ethical framework proposal with an illustrative assessment, not a demonstration of AI consciousness, binding regulation or validated universal moral standing. Hannah B. Pasandi is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Igor Mordatch

Igor Mordatch is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Igor Mordatch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-cb31df4ce7c5b4::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Igor Mordatch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Igor Mordatch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ingmar Kanitscheider

Ingmar Kanitscheider is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Ingmar Kanitscheider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3f67dca6f34c33::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Ingmar Kanitscheider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Ingmar Kanitscheider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ismael T. Freire

Ismael T. Freire is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Ismael T. Freire is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8155f13b5de4c1::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Ismael T. Freire is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Ismael T. Freire is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Izhak Shafran

Izhak Shafran is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Izhak Shafran is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-izhakshafran::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Izhak Shafran is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Izhak Shafran is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Ong

James Ong is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. James Ong is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-56b5d845ae92f9::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. James Ong is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. James Ong is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jamie Morgenstern

Jamie Morgenstern is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jamie Morgenstern is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-90beff8794e914::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jamie Morgenstern is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jamie Morgenstern is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean-Bastien Grill

Jean-Bastien Grill is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Jean-Bastien Grill is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-fcb4e036623215::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Jean-Bastien Grill is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Jean-Bastien Grill is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeffrey Zhao

Jeffrey Zhao is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Jeffrey Zhao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-jeffreyzhao::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Jeffrey Zhao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Jeffrey Zhao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jennifer Wortman Vaughan

Jennifer Wortman Vaughan is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jennifer Wortman Vaughan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-baf71651a4c34b::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jennifer Wortman Vaughan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Jennifer Wortman Vaughan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jingbo Huang

Jingbo Huang is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Jingbo Huang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-8b56ef47cdfa29::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Jingbo Huang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Jingbo Huang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Johnny Ho

Johnny Ho is a listed coauthor of a Perplexity study analyzing adoption and usage of the Comet browser’s integrated AI agent.

Anonymized interaction data are organized into a hierarchical taxonomy of topics, subtopics and tasks to examine how people use the assistant.

The authors compare user segments and short-term persistence with later shifts toward more cognitively oriented activities, offering a field account of this product’s use.

Sources and details

The Adoption and Usage of AI Agents: Early Evidence from Perplexity

{
  "access_scope": "Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Johnny Ho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jeremy Yang",
    "Noah Yonack",
    "Kate Zyskowski",
    "Denis Yarats",
    "Johnny Ho",
    "Jerry Ma"
  ],
  "authors_in_source_order": [
    "Jeremy Yang",
    "Noah Yonack",
    "Kate Zyskowski",
    "Denis Yarats",
    "Johnny Ho",
    "Jerry Ma"
  ],
  "dates": {
    "citation_date": "2025/12/08",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB)",
    "original_submission": "Mon, 8 Dec 2025 18:56:10 UTC (3,170 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:08.407841+00:00",
    "version": "arXiv v2"
  },
  "id": "person-johnnyho::S1",
  "title": "The Adoption and Usage of AI Agents: Early Evidence from Perplexity",
  "url": "https://arxiv.org/abs/2512.07828",
  "version_url": "https://arxiv.org/abs/2512.07828v2"
}

Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Johnny Ho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Adoption and Usage of AI Agents: Early Evidence from Perplexity, revised Wed, 10 Dec 2025 16:34:43 UTC (3,168 KB). The study concerns Perplexity’s Comet user population and period, not all AI-agent users; adoption correlations do not establish individual causal drivers. Johnny Ho is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonas Schneider

Jonas Schneider is a listed coauthor of the OpenAI Gym whitepaper, which presents a common interface for reinforcement-learning benchmark problems.

The toolkit’s shared environment interface enables algorithm results to be compared across a growing collection of tasks.

The paper explains software components and design choices alongside a website for sharing outcomes, connecting implementation conventions with research evaluation.

Sources and details

OpenAI Gym

{
  "access_scope": "Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Jonas Schneider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "authors_in_source_order": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "citation_date": "2016/06/05",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.531635+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jonasschneider::S1",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540",
  "version_url": "https://arxiv.org/abs/1606.01540v1"
}

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Jonas Schneider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Jonas Schneider is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Birch

Jonathan Birch is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Birch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-9ae5dfd0f537e8::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Birch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Birch is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Ross

Jonathan Ross is a listed coauthor of In-Datacenter Performance Analysis of a Tensor Processing Unit, which evaluates a custom neural-network inference chip.

The described design combines an eight-bit matrix-multiply unit with software-managed on-chip memory and deterministic execution.

The paper compares it with contemporary server CPUs and GPUs using production neural-network workloads, tying reported efficiency and latency advantages to that hardware and workload context.

Sources and details

In-Datacenter Performance Analysis of a Tensor Processing Unit

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Jonathan Ross is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "authors_in_source_order": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "dates": {
    "citation_date": "2017/04/16",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB)",
    "retrieved_utc": "2026-10-07T18:15:53.768120+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-8b7988afaf90d6::S1",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit",
  "url": "https://arxiv.org/abs/1704.04760",
  "version_url": "https://arxiv.org/abs/1704.04760v1"
}

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Jonathan Ross is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Jonathan Ross is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Simon

Jonathan Simon is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Simon is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-71c7cac361a9a6::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Simon is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Jonathan Simon is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jong Wook Kim

Jong Wook Kim is a listed coauthor of Learning Transferable Visual Models From Natural Language Supervision, which learns visual representations by matching images to captions.

After pretraining on paired images and text, descriptions of visual concepts specify downstream tasks without dataset-specific training.

The evaluation covers image classification, text recognition, action recognition, and location tasks across more than thirty computer-vision datasets.

Sources and details

Learning Transferable Visual Models From Natural Language Supervision

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Jong Wook Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Radford, Alec",
    "Kim, Jong Wook",
    "Hallacy, Chris",
    "Ramesh, Aditya",
    "Goh, Gabriel",
    "Agarwal, Sandhini",
    "Sastry, Girish",
    "Askell, Amanda",
    "Mishkin, Pamela",
    "Clark, Jack",
    "Krueger, Gretchen",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Radford, Alec",
    "Kim, Jong Wook",
    "Hallacy, Chris",
    "Ramesh, Aditya",
    "Goh, Gabriel",
    "Agarwal, Sandhini",
    "Sastry, Girish",
    "Askell, Amanda",
    "Mishkin, Pamela",
    "Clark, Jack",
    "Krueger, Gretchen",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/26",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.434351+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jongwookkim::S1",
  "title": "Learning Transferable Visual Models From Natural Language Supervision",
  "url": "https://arxiv.org/abs/2103.00020",
  "version_url": "https://arxiv.org/abs/2103.00020v1"
}

Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Jong Wook Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Fri, 26 Feb 2021 19:04:58 UTC (6,174 KB); account limited to this paper’s method and reported evaluation. Jong Wook Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Julien Chaumond

Julien Chaumond is a listed coauthor of HuggingFace's Transformers, which describes an open-source library bringing pretrained transformer models under a shared interface.

The library combines implementations of transformer architectures with a curated collection of community-accessible pretrained models.

The paper frames extensibility for researchers, usability for practitioners, and industrial deployment as design goals for the library.

Sources and details

HuggingFace's Transformers: State-of-the-art Natural Language Processing

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Julien Chaumond is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "authors_in_source_order": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "dates": {
    "citation_date": "2019/10/09",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Tue, 14 Jul 2020 03:42:34 UTC (642 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.614437+00:00",
    "version": "arXiv v5"
  },
  "id": "person-julienchaumond::S1",
  "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing",
  "url": "https://arxiv.org/abs/1910.03771",
  "version_url": "https://arxiv.org/abs/1910.03771v5"
}

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Julien Chaumond is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Julien Chaumond is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Junehyuk Jung

Junehyuk Jung is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junehyuk Jung is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-95daa3ef2f2617::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junehyuk Jung is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junehyuk Jung is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Junsu Kim

Junsu Kim is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junsu Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-e192a87657340a::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junsu Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Junsu Kim is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karthik Narasimhan

Karthik Narasimhan is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Karthik Narasimhan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-karthiknarasimhan::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Karthik Narasimhan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Karthik Narasimhan is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kate Crawford

Kate Crawford is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Kate Crawford is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-6e074f793d2988::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Kate Crawford is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Kate Crawford is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kathinka Evers

Kathinka Evers is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Kathinka Evers is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-25af6844f8eab2::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Kathinka Evers is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Kathinka Evers is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Katie Evans

Katie Evans is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Katie Evans is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-52881abd137d8a::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Katie Evans is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Katie Evans is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kristina Toutanova

Kristina Toutanova is a listed coauthor of the BERT paper, which pre-trains representations using both left and right context throughout its layers.

The resulting model can be adapted to tasks such as question answering and inference by adding a single output layer rather than substantially redesigning the architecture.

The authors report results across eleven natural-language-processing tasks, connecting bidirectional pre-training with a reusable adaptation strategy.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Kristina Toutanova is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "authors_in_source_order": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "dates": {
    "citation_date": "2018/10/11",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 24 May 2019 20:37:26 UTC (309 KB)",
    "original_submission": "Thu, 11 Oct 2018 00:50:01 UTC (227 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:06.685652+00:00",
    "version": "arXiv v2"
  },
  "id": "person-kristinatoutanova::S1",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://arxiv.org/abs/1810.04805",
  "version_url": "https://arxiv.org/abs/1810.04805v2"
}

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Kristina Toutanova is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Kristina Toutanova is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kyunghyun Cho

Kyunghyun Cho is a listed coauthor of Neural Machine Translation by Jointly Learning to Align and Translate, which addresses the fixed-vector bottleneck of encoder–decoder translation.

The proposed model softly searches the source sentence for information relevant to each target word instead of encoding every dependency in one fixed representation.

The paper evaluates English-to-French translation and examines whether the learned alignments correspond to interpretable relationships between sentences.

Sources and details

Neural Machine Translation by Jointly Learning to Align and Translate

{
  "access_scope": "Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Kyunghyun Cho is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Bahdanau, Dzmitry",
    "Cho, Kyunghyun",
    "Bengio, Yoshua"
  ],
  "authors_in_source_order": [
    "Bahdanau, Dzmitry",
    "Cho, Kyunghyun",
    "Bengio, Yoshua"
  ],
  "dates": {
    "citation_date": "2014/09/01",
    "inspected_arxiv_version": "v7",
    "inspected_revision": "Thu, 19 May 2016 21:53:22 UTC (144 KB)",
    "retrieved_utc": "2026-10-07T18:19:07.840671+00:00",
    "version": "arXiv v7"
  },
  "id": "person-kyunghyuncho::S1",
  "title": "Neural Machine Translation by Jointly Learning to Align and Translate",
  "url": "https://arxiv.org/abs/1409.0473",
  "version_url": "https://arxiv.org/abs/1409.0473v7"
}

Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Kyunghyun Cho is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v7 abstract, revised Thu, 19 May 2016 21:53:22 UTC (144 KB); account limited to this paper’s method and reported evaluation. Kyunghyun Cho is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Liad Mudrik

Liad Mudrik is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Liad Mudrik is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-bc11eeb10d97fd::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Liad Mudrik is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Liad Mudrik is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ludwig Pettersson

Ludwig Pettersson is a listed coauthor of the OpenAI Gym whitepaper, which presents a common interface for reinforcement-learning benchmark problems.

The toolkit’s shared environment interface enables algorithm results to be compared across a growing collection of tasks.

The paper explains software components and design choices alongside a website for sharing outcomes, connecting implementation conventions with research evaluation.

Sources and details

OpenAI Gym

{
  "access_scope": "Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Ludwig Pettersson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "authors_in_source_order": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "citation_date": "2016/06/05",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.531635+00:00",
    "version": "arXiv v1"
  },
  "id": "person-ludwigpettersson::S1",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540",
  "version_url": "https://arxiv.org/abs/1606.01540v1"
}

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Ludwig Pettersson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Ludwig Pettersson is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marceau Nahon

Marceau Nahon is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Marceau Nahon is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-9d6a28da335e07::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Marceau Nahon is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Marceau Nahon is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marcelo Menegali

Marcelo Menegali is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Marcelo Menegali is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-502fa866ea458e::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Marcelo Menegali is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Marcelo Menegali is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marco Pleines

Marco Pleines is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Marco Pleines is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-2c144fddb2487b::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Marco Pleines is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Marco Pleines is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matthias Michel

Matthias Michel is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Matthias Michel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-15246f81c39911::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Matthias Michel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Matthias Michel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maud van Lier

Maud van Lier is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Maud van Lier is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-648e2dd3bca263::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Maud van Lier is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Maud van Lier is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Megan A. K. Peters

Megan A. K. Peters is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Megan A. K. Peters is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-5648e5b1eef9f6::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Megan A. K. Peters is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Megan A. K. Peters is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mehdi Khamassi

Mehdi Khamassi is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Mehdi Khamassi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-52d847076acd34::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Mehdi Khamassi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Mehdi Khamassi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michal Valko

Michal Valko is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Michal Valko is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-c5c6ca2442a965::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Michal Valko is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Michal Valko is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michele Farisco

Michele Farisco is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Michele Farisco is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-bbd5e2992401a4::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Michele Farisco is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Michele Farisco is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mike Preuss

Mike Preuss is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Mike Preuss is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-4b4ac6d0370327::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Mike Preuss is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Mike Preuss is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mikhail Pavlov

Mikhail Pavlov is a listed coauthor of Zero-Shot Text-to-Image Generation, which uses a transformer to model text and image tokens together.

The approach treats both token types as one autoregressive stream rather than introducing the specialized architectures or auxiliary information discussed in the abstract.

The paper evaluates transfer in a zero-shot setting and reports competitiveness with earlier domain-specific models at sufficient data and scale.

Sources and details

Zero-Shot Text-to-Image Generation

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Mikhail Pavlov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.328112+00:00",
    "version": "arXiv v2"
  },
  "id": "person-mikhailpavlov::S1",
  "title": "Zero-Shot Text-to-Image Generation",
  "url": "https://arxiv.org/abs/2102.12092",
  "version_url": "https://arxiv.org/abs/2102.12092v2"
}

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Mikhail Pavlov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Mikhail Pavlov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ming-Wei Chang

Ming-Wei Chang is a listed coauthor of the BERT paper, which pre-trains representations using both left and right context throughout its layers.

The resulting model can be adapted to tasks such as question answering and inference by adding a single output layer rather than substantially redesigning the architecture.

The authors report results across eleven natural-language-processing tasks, connecting bidirectional pre-training with a reusable adaptation strategy.

Sources and details

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

{
  "access_scope": "Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Ming-Wei Chang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "authors_in_source_order": [
    "Jacob Devlin",
    "Ming-Wei Chang",
    "Kenton Lee",
    "Kristina Toutanova"
  ],
  "dates": {
    "citation_date": "2018/10/11",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 24 May 2019 20:37:26 UTC (309 KB)",
    "original_submission": "Thu, 11 Oct 2018 00:50:01 UTC (227 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:06.685652+00:00",
    "version": "arXiv v2"
  },
  "id": "person-mingweichang::S1",
  "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
  "url": "https://arxiv.org/abs/1810.04805",
  "version_url": "https://arxiv.org/abs/1810.04805v2"
}

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Ming-Wei Chang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding, revised Fri, 24 May 2019 20:37:26 UTC (309 KB). Descriptions concern the inspected BERT paper and its task evaluations, not current model performance or individual responsibility for particular training components. Ming-Wei Chang is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miroslav Olšák

Miroslav Olšák is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Miroslav Olšák is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2a1af11ee2238f::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Miroslav Olšák is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Miroslav Olšák is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mohammad Gheshlaghi Azar

Mohammad Gheshlaghi Azar is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Mohammad Gheshlaghi Azar is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d54baf501f85fd::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Mohammad Gheshlaghi Azar is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Mohammad Gheshlaghi Azar is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nan Du

Nan Du is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Nan Du is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-nandu::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Nan Du is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Nan Du is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Natalia Gimelshein

Natalia Gimelshein is a listed coauthor of the PyTorch paper, which explains an imperative Python programming model together with the library’s runtime architecture.

Its design keeps model code under ordinary Python control while supporting efficient execution and hardware accelerators.

The authors evaluate individual subsystems and overall benchmark speed to connect those implementation principles with reported performance.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Natalia Gimelshein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "authors_in_source_order": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "citation_date": "2019/12/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:01:47.063189+00:00",
    "version": "arXiv v1"
  },
  "id": "person-nataliagimelshein::S1",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703",
  "version_url": "https://arxiv.org/abs/1912.01703v1"
}

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Natalia Gimelshein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Natalia Gimelshein is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Niru Maheswaranathan

Niru Maheswaranathan is a listed coauthor of Deep Unsupervised Learning using Nonequilibrium Thermodynamics, which constructs a generative model through forward and reverse diffusion.

The forward process gradually destroys structure in data, and a learned reverse process restores it.

The paper presents this construction as supporting sampling, probability evaluation, and conditional and posterior inference within a tractable model.

Sources and details

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Niru Maheswaranathan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "authors_in_source_order": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "dates": {
    "citation_date": "2015/03/12",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.260482+00:00",
    "version": "arXiv v8"
  },
  "id": "person-nirumaheswaranathan::S1",
  "title": "Deep Unsupervised Learning using Nonequilibrium Thermodynamics",
  "url": "https://arxiv.org/abs/1503.03585",
  "version_url": "https://arxiv.org/abs/1503.03585v8"
}

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Niru Maheswaranathan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Niru Maheswaranathan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nishant Patil

Nishant Patil is a listed coauthor of In-Datacenter Performance Analysis of a Tensor Processing Unit, which evaluates a custom neural-network inference chip.

The described design combines an eight-bit matrix-multiply unit with software-managed on-chip memory and deterministic execution.

The paper compares it with contemporary server CPUs and GPUs using production neural-network workloads, tying reported efficiency and latency advantages to that hardware and workload context.

Sources and details

In-Datacenter Performance Analysis of a Tensor Processing Unit

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Nishant Patil is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "authors_in_source_order": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "dates": {
    "citation_date": "2017/04/16",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB)",
    "retrieved_utc": "2026-10-07T18:15:53.768120+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-da523abc0e35bf::S1",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit",
  "url": "https://arxiv.org/abs/1704.04760",
  "version_url": "https://arxiv.org/abs/1704.04760v1"
}

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Nishant Patil is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Nishant Patil is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Norman P. Jouppi

Norman P. Jouppi is a listed coauthor of In-Datacenter Performance Analysis of a Tensor Processing Unit, which evaluates a custom neural-network inference chip.

The described design combines an eight-bit matrix-multiply unit with software-managed on-chip memory and deterministic execution.

The paper compares it with contemporary server CPUs and GPUs using production neural-network workloads, tying reported efficiency and latency advantages to that hardware and workload context.

Sources and details

In-Datacenter Performance Analysis of a Tensor Processing Unit

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Norman P. Jouppi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "authors_in_source_order": [
    "Jouppi, Norman P.",
    "Young, Cliff",
    "Patil, Nishant",
    "Patterson, David",
    "Agrawal, Gaurav",
    "Bajwa, Raminder",
    "Bates, Sarah",
    "Bhatia, Suresh",
    "Boden, Nan",
    "Borchers, Al",
    "Boyle, Rick",
    "Cantin, Pierre-luc",
    "Chao, Clifford",
    "Clark, Chris",
    "Coriell, Jeremy",
    "Daley, Mike",
    "Dau, Matt",
    "Dean, Jeffrey",
    "Gelb, Ben",
    "Ghaemmaghami, Tara Vazir",
    "Gottipati, Rajendra",
    "Gulland, William",
    "Hagmann, Robert",
    "Ho, C. Richard",
    "Hogberg, Doug",
    "Hu, John",
    "Hundt, Robert",
    "Hurt, Dan",
    "Ibarz, Julian",
    "Jaffey, Aaron",
    "Jaworski, Alek",
    "Kaplan, Alexander",
    "Khaitan, Harshit",
    "Koch, Andy",
    "Kumar, Naveen",
    "Lacy, Steve",
    "Laudon, James",
    "Law, James",
    "Le, Diemthu",
    "Leary, Chris",
    "Liu, Zhuyuan",
    "Lucke, Kyle",
    "Lundin, Alan",
    "MacKean, Gordon",
    "Maggiore, Adriana",
    "Mahony, Maire",
    "Miller, Kieran",
    "Nagarajan, Rahul",
    "Narayanaswami, Ravi",
    "Ni, Ray",
    "Nix, Kathy",
    "Norrie, Thomas",
    "Omernick, Mark",
    "Penukonda, Narayana",
    "Phelps, Andy",
    "Ross, Jonathan",
    "Ross, Matt",
    "Salek, Amir",
    "Samadiani, Emad",
    "Severn, Chris",
    "Sizikov, Gregory",
    "Snelham, Matthew",
    "Souter, Jed",
    "Steinberg, Dan",
    "Swing, Andy",
    "Tan, Mercedes",
    "Thorson, Gregory",
    "Tian, Bo",
    "Toma, Horia",
    "Tuttle, Erick",
    "Vasudevan, Vijay",
    "Walter, Richard",
    "Wang, Walter",
    "Wilcox, Eric",
    "Yoon, Doe Hyun"
  ],
  "dates": {
    "citation_date": "2017/04/16",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB)",
    "retrieved_utc": "2026-10-07T18:15:53.768120+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-7e0c278efe3b8a::S1",
  "title": "In-Datacenter Performance Analysis of a Tensor Processing Unit",
  "url": "https://arxiv.org/abs/1704.04760",
  "version_url": "https://arxiv.org/abs/1704.04760v1"
}

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Norman P. Jouppi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract, revised Sun, 16 Apr 2017 12:07:54 UTC (1,286 KB); account limited to this paper’s method and reported evaluation. Norman P. Jouppi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Butlin

Patrick Butlin is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Patrick Butlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-f965f4b505b16c::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Patrick Butlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Patrick Butlin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Whidden

Peter Whidden is a listed coauthor of a Pokémon Red reinforcement-learning study that develops an environment and training baseline for a long-horizon game.

The reported agent completes the initial portion through Cerulean City, rather than the entire game.

Ablations reveal how reward shaping can be exploited and motivate further work on exploration, hierarchical training and language-model agents.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Peter Whidden is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "original_submission": "Thu, 27 Feb 2025 09:42:23 UTC (2,466 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-6f50bc782ece89::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Peter Whidden is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Pokemon Red via Reinforcement Learning, revised Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB). The baseline covers an initial game segment; advanced agent methods are proposed research directions, and game completion beyond that segment is not inferred. Peter Whidden is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pierre H. Richemond

Pierre H. Richemond is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Pierre H. Richemond is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-828deee856316e::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Pierre H. Richemond is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Pierre H. Richemond is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pieter Abbeel

Pieter Abbeel is a listed coauthor of the Soft Actor-Critic paper, which combines an off-policy stochastic actor–critic with a maximum-entropy objective.

The actor balances expected reward with entropy, allowing exploration to remain part of the optimization target.

The authors report continuous-control benchmark comparisons and similar performance across random seeds, addressing sample cost and unstable convergence in their tested settings.

Sources and details

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

{
  "access_scope": "Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Pieter Abbeel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "authors_in_source_order": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "dates": {
    "citation_date": "2018/01/04",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB)",
    "original_submission": "Thu, 4 Jan 2018 09:50:50 UTC (2,350 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:14:36.259890+00:00",
    "version": "arXiv v2"
  },
  "id": "person-pieterabbeel::S1",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor",
  "url": "https://arxiv.org/abs/1801.01290",
  "version_url": "https://arxiv.org/abs/1801.01290v2"
}

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Pieter Abbeel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Pieter Abbeel is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Raja Chatila

Raja Chatila is a listed coauthor of Anthropomorphism in the age of Large Language Models, which synthesizes research on describing AI systems in human terms.

The paper groups twenty-one concerns into epistemic, affective, human-agency, normative, and societal and institutional categories.

It relates those concerns to interventions in design, communication, education, and governance, with linguistic framing treated as part of how people understand AI.

Sources and details

Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Raja Chatila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "authors_in_source_order": [
    "Freire, Ismael T.",
    "Nahon, Marceau",
    "van Lier, Maud",
    "Evans, Katie",
    "Bazin, Hélie",
    "Farisco, Michele",
    "Evers, Kathinka",
    "Chatila, Raja",
    "Khamassi, Mehdi"
  ],
  "dates": {
    "citation_date": "2026/09/29",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 1 Oct 2026 22:01:44 UTC (106 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.732006+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-4ee425b7d5b879::S1",
  "title": "Anthropomorphism in the age of Large Language Models: An overview of potential risks and mitigations",
  "url": "https://arxiv.org/abs/2609.38486",
  "version_url": "https://arxiv.org/abs/2609.38486v2"
}

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Raja Chatila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Thu, 1 Oct 2026 22:01:44 UTC (106 KB); account limited to this paper’s method and reported evaluation. Raja Chatila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rewon Child

Rewon Child is a listed coauthor of Language Models are Few-Shot Learners, which evaluates a large autoregressive model using instructions and examples supplied as text.

The reported tasks are performed without task-specific gradient updates or fine-tuning, allowing the paper to examine transfer through prompting.

The abstract also identifies tasks where few-shot performance remains difficult and methodological concerns associated with training on large web corpora.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Rewon Child is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2020/05/28",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-rewonchild::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Rewon Child is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Rewon Child is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Long

Robert Long is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Robert Long is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-fb42d4ce47649b::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Robert Long is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Robert Long is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rufin VanRullen

Rufin VanRullen is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Rufin VanRullen is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-5274a2618e212d::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Rufin VanRullen is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Rufin VanRullen is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Russ Tedrake

Russ Tedrake is a listed coauthor of Diffusion Policy, which represents robot visuomotor behavior as a conditional denoising process.

The method learns a score over action distributions and iteratively generates actions through stochastic Langevin steps.

The paper combines visual conditioning, receding-horizon control, and a time-series diffusion transformer and evaluates the policy on manipulation benchmarks.

Sources and details

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Russ Tedrake is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "authors_in_source_order": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "dates": {
    "citation_date": "2023/03/07",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.970346+00:00",
    "version": "arXiv v5"
  },
  "id": "person-russtedrake::S1",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137",
  "version_url": "https://arxiv.org/abs/2303.04137v5"
}

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Russ Tedrake is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Russ Tedrake is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ryota Kanai

Ryota Kanai is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Ryota Kanai is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2d4ad94c72d949::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Ryota Kanai is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Ryota Kanai is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rémi Munos

Rémi Munos is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Rémi Munos is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-6aa1243937e40e::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Rémi Munos is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Rémi Munos is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Saining Xie

Saining Xie is a listed coauthor of the Momentum Contrast paper, which learns visual representations through a dynamic dictionary of examples.

A queue and a moving-averaged encoder keep that dictionary large and consistent as training proceeds.

The authors report linear image-classification and downstream detection or segmentation evaluations to assess whether unsupervised pre-training can transfer beyond its training objective.

Sources and details

Momentum Contrast for Unsupervised Visual Representation Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Saining Xie is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "authors_in_source_order": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "dates": {
    "citation_date": "2019/11/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 23 Mar 2020 18:36:55 UTC (210 KB)",
    "original_submission": "Wed, 13 Nov 2019 18:53:26 UTC (173 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.630437+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-c534b044996491::S1",
  "title": "Momentum Contrast for Unsupervised Visual Representation Learning",
  "url": "https://arxiv.org/abs/1911.05722",
  "version_url": "https://arxiv.org/abs/1911.05722v3"
}

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Saining Xie is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Saining Xie is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam Gross

Sam Gross is a listed coauthor of the PyTorch paper, which explains an imperative Python programming model together with the library’s runtime architecture.

Its design keeps model code under ordinary Python control while supporting efficient execution and hardware accelerators.

The authors evaluate individual subsystems and overall benchmark speed to connect those implementation principles with reported performance.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Sam Gross is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "authors_in_source_order": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "citation_date": "2019/12/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:01:47.063189+00:00",
    "version": "arXiv v1"
  },
  "id": "person-samgross::S1",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703",
  "version_url": "https://arxiv.org/abs/1912.01703v1"
}

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Sam Gross is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Sam Gross is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam Manning

Sam Manning is a listed coauthor of a study estimating task exposure to language models and associated software across the U.S. labor market.

Its rubric combines human expertise with GPT-4 classifications to compare occupations against model capabilities.

The analysis distinguishes access to an underlying model from tooling built around it, describing potential changes in task completion rather than forecasting an adoption date.

Sources and details

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

{
  "access_scope": "Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Sam Manning is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "authors_in_source_order": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "dates": {
    "citation_date": "2023/03/17",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB)",
    "original_submission": "Fri, 17 Mar 2023 17:15:20 UTC (5,829 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:41.007518+00:00",
    "version": "arXiv v5"
  },
  "id": "person-local-sammanning::S1",
  "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models",
  "url": "https://arxiv.org/abs/2303.10130",
  "version_url": "https://arxiv.org/abs/2303.10130v5"
}

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Sam Manning is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Sam Manning is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam McCandlish

Sam McCandlish is a listed coauthor of Language Models are Few-Shot Learners, which evaluates a large autoregressive model using instructions and examples supplied as text.

The reported tasks are performed without task-specific gradient updates or fine-tuning, allowing the paper to examine transfer through prompting.

The abstract also identifies tasks where few-shot performance remains difficult and methodological concerns associated with training on large web corpora.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Sam McCandlish is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2020/05/28",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-sammccandlish::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Sam McCandlish is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Sam McCandlish is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuli Laine

Samuli Laine is a listed coauthor of Progressive Growing of GANs, which increases generator and discriminator resolution during training.

Starting at low resolution, the method adds layers to learn finer detail, alongside measures intended to increase variation and stabilize competition between the networks.

The paper also proposes an evaluation metric covering image quality and diversity and constructs a higher-quality CelebA dataset.

Sources and details

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Samuli Laine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "authors_in_source_order": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "dates": {
    "citation_date": "2017/10/27",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB)",
    "retrieved_utc": "2026-10-07T18:12:34.357536+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-c3026c7e32a4c5::S1",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/abs/1710.10196",
  "version_url": "https://arxiv.org/abs/1710.10196v3"
}

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Samuli Laine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Samuli Laine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scott Gray

Scott Gray is a listed coauthor of Zero-Shot Text-to-Image Generation, which uses a transformer to model text and image tokens together.

The approach treats both token types as one autoregressive stream rather than introducing the specialized architectures or auxiliary information discussed in the abstract.

The paper evaluates transfer in a zero-shot setting and reports competitiveness with earlier domain-specific models at sufficient data and scale.

Sources and details

Zero-Shot Text-to-Image Generation

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Scott Gray is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "authors_in_source_order": [
    "Ramesh, Aditya",
    "Pavlov, Mikhail",
    "Goh, Gabriel",
    "Gray, Scott",
    "Voss, Chelsea",
    "Radford, Alec",
    "Chen, Mark",
    "Sutskever, Ilya"
  ],
  "dates": {
    "citation_date": "2021/02/24",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.328112+00:00",
    "version": "arXiv v2"
  },
  "id": "person-scottgray::S1",
  "title": "Zero-Shot Text-to-Image Generation",
  "url": "https://arxiv.org/abs/2102.12092",
  "version_url": "https://arxiv.org/abs/2102.12092v2"
}

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Scott Gray is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract, revised Fri, 26 Feb 2021 23:26:05 UTC (9,407 KB); account limited to this paper’s method and reported evaluation. Scott Gray is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Serge Stinckwich

Serge Stinckwich is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Serge Stinckwich is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-c577fca89a7f55::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Serge Stinckwich is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Serge Stinckwich is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sergey Levine

Sergey Levine is a listed coauthor of End-to-End Training of Deep Visuomotor Policies, which learns robot control directly from image observations.

The method trains a convolutional policy mapping images to motor torques through guided policy search, with trajectory-based reinforcement learning providing supervision.

The paper evaluates real manipulation tasks requiring coordinated vision and control and includes simulated comparisons with earlier policy-search approaches.

Sources and details

End-to-End Training of Deep Visuomotor Policies

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Sergey Levine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Levine, Sergey",
    "Finn, Chelsea",
    "Darrell, Trevor",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Levine, Sergey",
    "Finn, Chelsea",
    "Darrell, Trevor",
    "Abbeel, Pieter"
  ],
  "dates": {
    "citation_date": "2015/04/02",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.460179+00:00",
    "version": "arXiv v5"
  },
  "id": "person-sergeylevine::S1",
  "title": "End-to-End Training of Deep Visuomotor Policies",
  "url": "https://arxiv.org/abs/1504.00702",
  "version_url": "https://arxiv.org/abs/1504.00702v5"
}

Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Sergey Levine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Sergey Levine is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shunyu Yao

Shunyu Yao is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Shunyu Yao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-shunyuyao::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Shunyu Yao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Shunyu Yao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shuran Song

Shuran Song is a listed coauthor of Diffusion Policy, which represents robot visuomotor behavior as a conditional denoising process.

The method learns a score over action distributions and iteratively generates actions through stochastic Langevin steps.

The paper combines visual conditioning, receding-horizon control, and a time-series diffusion transformer and evaluates the policy on manipulation benchmarks.

Sources and details

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Shuran Song is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "authors_in_source_order": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "dates": {
    "citation_date": "2023/03/07",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.970346+00:00",
    "version": "arXiv v5"
  },
  "id": "person-shuransong::S1",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137",
  "version_url": "https://arxiv.org/abs/2303.04137v5"
}

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Shuran Song is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Shuran Song is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Song Han

Song Han is a listed coauthor of Deep Compression, which combines pruning, trained quantization, and Huffman coding to reduce neural-network storage.

The method removes less important connections, shares weights through quantization, and retrains the remaining connections and quantized centroids.

The paper reports compression and hardware benchmarks for specific networks, connecting smaller models to on-chip memory and constrained mobile deployment.

Sources and details

Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Song Han is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "authors_in_source_order": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "dates": {
    "citation_date": "2015/10/01",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 15 Feb 2016 06:25:40 UTC (755 KB)",
    "retrieved_utc": "2026-10-07T18:14:34.518964+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-d926582a022b0d::S1",
  "title": "Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding",
  "url": "https://arxiv.org/abs/1510.00149",
  "version_url": "https://arxiv.org/abs/1510.00149v5"
}

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Song Han is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. Song Han is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stephen M. Fleming

Stephen M. Fleming is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Stephen M. Fleming is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-9764c69124d604::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Stephen M. Fleming is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Stephen M. Fleming is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Surya Ganguli

Surya Ganguli is a listed coauthor of Deep Unsupervised Learning using Nonequilibrium Thermodynamics, which constructs a generative model through forward and reverse diffusion.

The forward process gradually destroys structure in data, and a learned reverse process restores it.

The paper presents this construction as supporting sampling, probability evaluation, and conditional and posterior inference within a tractable model.

Sources and details

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Surya Ganguli is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "authors_in_source_order": [
    "Sohl-Dickstein, Jascha",
    "Weiss, Eric A.",
    "Maheswaranathan, Niru",
    "Ganguli, Surya"
  ],
  "dates": {
    "citation_date": "2015/03/12",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB)",
    "retrieved_utc": "2026-10-07T17:55:05.260482+00:00",
    "version": "arXiv v8"
  },
  "id": "person-suryaganguli::S1",
  "title": "Deep Unsupervised Learning using Nonequilibrium Thermodynamics",
  "url": "https://arxiv.org/abs/1503.03585",
  "version_url": "https://arxiv.org/abs/1503.03585v8"
}

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Surya Ganguli is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 18 Nov 2015 21:50:51 UTC (6,095 KB); account limited to this paper’s method and reported evaluation. Surya Ganguli is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tero Karras

Tero Karras is a listed coauthor of Progressive Growing of GANs, which increases generator and discriminator resolution during training.

Starting at low resolution, the method adds layers to learn finer detail, alongside measures intended to increase variation and stabilize competition between the networks.

The paper also proposes an evaluation metric covering image quality and diversity and constructs a higher-quality CelebA dataset.

Sources and details

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Tero Karras is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "authors_in_source_order": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "dates": {
    "citation_date": "2017/10/27",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB)",
    "retrieved_utc": "2026-10-07T18:12:34.357536+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-330dc6ec824d3f::S1",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/abs/1710.10196",
  "version_url": "https://arxiv.org/abs/1710.10196v3"
}

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Tero Karras is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Tero Karras is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thang Luong

Thang Luong is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Thang Luong is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-9eb0944ebd1eca::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Thang Luong is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Thang Luong is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas Wolf

Thomas Wolf is a listed coauthor of HuggingFace's Transformers, which describes an open-source library bringing pretrained transformer models under a shared interface.

The library combines implementations of transformer architectures with a curated collection of community-accessible pretrained models.

The paper frames extensibility for researchers, usability for practitioners, and industrial deployment as design goals for the library.

Sources and details

HuggingFace's Transformers: State-of-the-art Natural Language Processing

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Thomas Wolf is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "authors_in_source_order": [
    "Wolf, Thomas",
    "Debut, Lysandre",
    "Sanh, Victor",
    "Chaumond, Julien",
    "Delangue, Clement",
    "Moi, Anthony",
    "Cistac, Pierric",
    "Rault, Tim",
    "Louf, Rémi",
    "Funtowicz, Morgan",
    "Davison, Joe",
    "Shleifer, Sam",
    "von Platen, Patrick",
    "Ma, Clara",
    "Jernite, Yacine",
    "Plu, Julien",
    "Xu, Canwen",
    "Scao, Teven Le",
    "Gugger, Sylvain",
    "Drame, Mariama",
    "Lhoest, Quentin",
    "Rush, Alexander M."
  ],
  "dates": {
    "citation_date": "2019/10/09",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Tue, 14 Jul 2020 03:42:34 UTC (642 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.614437+00:00",
    "version": "arXiv v5"
  },
  "id": "person-thomaswolf::S1",
  "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing",
  "url": "https://arxiv.org/abs/1910.03771",
  "version_url": "https://arxiv.org/abs/1910.03771v5"
}

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Thomas Wolf is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Tue, 14 Jul 2020 03:42:34 UTC (642 KB); account limited to this paper’s method and reported evaluation. Thomas Wolf is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Timnit Gebru

Timnit Gebru is a listed coauthor of Datasheets for Datasets, which proposes structured documentation accompanying machine learning datasets.

The suggested datasheet records why a dataset was created, its composition, collection process, and recommended uses.

The proposal adapts the documentation practice of electronic components to improve communication between dataset creators and consumers and encourage accountability.

Sources and details

Datasheets for Datasets

{
  "access_scope": "Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Timnit Gebru is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "authors_in_source_order": [
    "Gebru, Timnit",
    "Morgenstern, Jamie",
    "Vecchione, Briana",
    "Vaughan, Jennifer Wortman",
    "Wallach, Hanna",
    "Daumé III, Hal",
    "Crawford, Kate"
  ],
  "dates": {
    "citation_date": "2018/03/23",
    "inspected_arxiv_version": "v8",
    "inspected_revision": "Wed, 1 Dec 2021 20:29:42 UTC (178 KB)",
    "retrieved_utc": "2026-10-07T18:13:06.282962+00:00",
    "version": "arXiv v8"
  },
  "id": "person-coverage-4aea53ccff13e7::S1",
  "title": "Datasheets for Datasets",
  "url": "https://arxiv.org/abs/1803.09010",
  "version_url": "https://arxiv.org/abs/1803.09010v8"
}

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Timnit Gebru is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v8 abstract, revised Wed, 1 Dec 2021 20:29:42 UTC (178 KB); account limited to this paper’s method and reported evaluation. Timnit Gebru is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Timo Aila

Timo Aila is a listed coauthor of Progressive Growing of GANs, which increases generator and discriminator resolution during training.

Starting at low resolution, the method adds layers to learn finer detail, alongside measures intended to increase variation and stabilize competition between the networks.

The paper also proposes an evaluation metric covering image quality and diversity and constructs a higher-quality CelebA dataset.

Sources and details

Progressive Growing of GANs for Improved Quality, Stability, and Variation

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Timo Aila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "authors_in_source_order": [
    "Karras, Tero",
    "Aila, Timo",
    "Laine, Samuli",
    "Lehtinen, Jaakko"
  ],
  "dates": {
    "citation_date": "2017/10/27",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB)",
    "retrieved_utc": "2026-10-07T18:12:34.357536+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-7a6eb52eb93dde::S1",
  "title": "Progressive Growing of GANs for Improved Quality, Stability, and Variation",
  "url": "https://arxiv.org/abs/1710.10196",
  "version_url": "https://arxiv.org/abs/1710.10196v3"
}

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Timo Aila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 26 Feb 2018 15:33:34 UTC (27,891 KB); account limited to this paper’s method and reported evaluation. Timo Aila is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Todor Markov

Todor Markov is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Todor Markov is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-080eb5a82c27e2::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Todor Markov is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Todor Markov is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Henighan

Tom Henighan is a listed coauthor of Language Models are Few-Shot Learners, which evaluates a large autoregressive model using instructions and examples supplied as text.

The reported tasks are performed without task-specific gradient updates or fine-tuning, allowing the paper to examine transfer through prompting.

The abstract also identifies tasks where few-shot performance remains difficult and methodological concerns associated with training on large web corpora.

Sources and details

Language Models are Few-Shot Learners

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Tom Henighan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Brown, Tom B.",
    "Mann, Benjamin",
    "Ryder, Nick",
    "Subbiah, Melanie",
    "Kaplan, Jared",
    "Dhariwal, Prafulla",
    "Neelakantan, Arvind",
    "Shyam, Pranav",
    "Sastry, Girish",
    "Askell, Amanda",
    "Agarwal, Sandhini",
    "Herbert-Voss, Ariel",
    "Krueger, Gretchen",
    "Henighan, Tom",
    "Child, Rewon",
    "Ramesh, Aditya",
    "Ziegler, Daniel M.",
    "Wu, Jeffrey",
    "Winter, Clemens",
    "Hesse, Christopher",
    "Chen, Mark",
    "Sigler, Eric",
    "Litwin, Mateusz",
    "Gray, Scott",
    "Chess, Benjamin",
    "Clark, Jack",
    "Berner, Christopher",
    "McCandlish, Sam",
    "Radford, Alec",
    "Sutskever, Ilya",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2020/05/28",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB)",
    "retrieved_utc": "2026-10-07T17:55:06.946254+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-tomhenighan::S1",
  "title": "Language Models are Few-Shot Learners",
  "url": "https://arxiv.org/abs/2005.14165",
  "version_url": "https://arxiv.org/abs/2005.14165v4"
}

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Tom Henighan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v4 abstract, revised Wed, 22 Jul 2020 19:47:17 UTC (6,998 KB); account limited to this paper’s method and reported evaluation. Tom Henighan is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tomáš Mikolov

Tomáš Mikolov is a listed coauthor of Efficient Estimation of Word Representations in Vector Space, which proposes two architectures for learning continuous word vectors.

The paper compares representation quality on word-similarity tasks with earlier neural-network techniques.

Its reported evaluation considers both syntactic and semantic relationships, connecting representation quality to the computational cost of learning from a large text corpus.

Sources and details

Efficient Estimation of Word Representations in Vector Space

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Tomáš Mikolov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Mikolov, Tomas",
    "Chen, Kai",
    "Corrado, Greg",
    "Dean, Jeffrey"
  ],
  "authors_in_source_order": [
    "Mikolov, Tomas",
    "Chen, Kai",
    "Corrado, Greg",
    "Dean, Jeffrey"
  ],
  "dates": {
    "citation_date": "2013/01/16",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Sat, 7 Sep 2013 00:30:40 UTC (48 KB)",
    "retrieved_utc": "2026-10-07T18:19:38.951471+00:00",
    "version": "arXiv v3"
  },
  "id": "person-tomasmikolov::S1",
  "title": "Efficient Estimation of Word Representations in Vector Space",
  "url": "https://arxiv.org/abs/1301.3781",
  "version_url": "https://arxiv.org/abs/1301.3781v3"
}

Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Tomáš Mikolov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Sat, 7 Sep 2013 00:30:40 UTC (48 KB); account limited to this paper’s method and reported evaluation. Tomáš Mikolov is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Darrell

Trevor Darrell is a listed coauthor of End-to-End Training of Deep Visuomotor Policies, which learns robot control directly from image observations.

The method trains a convolutional policy mapping images to motor torques through guided policy search, with trajectory-based reinforcement learning providing supervision.

The paper evaluates real manipulation tasks requiring coordinated vision and control and includes simulated comparisons with earlier policy-search approaches.

Sources and details

End-to-End Training of Deep Visuomotor Policies

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Trevor Darrell is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Levine, Sergey",
    "Finn, Chelsea",
    "Darrell, Trevor",
    "Abbeel, Pieter"
  ],
  "authors_in_source_order": [
    "Levine, Sergey",
    "Finn, Chelsea",
    "Darrell, Trevor",
    "Abbeel, Pieter"
  ],
  "dates": {
    "citation_date": "2015/04/02",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB)",
    "retrieved_utc": "2026-10-07T18:01:46.460179+00:00",
    "version": "arXiv v5"
  },
  "id": "person-trevordarrell::S1",
  "title": "End-to-End Training of Deep Visuomotor Policies",
  "url": "https://arxiv.org/abs/1504.00702",
  "version_url": "https://arxiv.org/abs/1504.00702v5"
}

Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Trevor Darrell is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Tue, 19 Apr 2016 01:33:13 UTC (5,713 KB); account limited to this paper’s method and reported evaluation. Trevor Darrell is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trieu H. Trinh

Trieu H. Trinh is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Trieu H. Trinh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-dfd4ba7c6d4ef5::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Trieu H. Trinh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Trieu H. Trinh is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tuomas Haarnoja

Tuomas Haarnoja is a listed coauthor of the Soft Actor-Critic paper, which combines an off-policy stochastic actor–critic with a maximum-entropy objective.

The actor balances expected reward with entropy, allowing exploration to remain part of the optimization target.

The authors report continuous-control benchmark comparisons and similar performance across random seeds, addressing sample cost and unstable convergence in their tested settings.

Sources and details

Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

{
  "access_scope": "Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Tuomas Haarnoja is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "authors_in_source_order": [
    "Tuomas Haarnoja",
    "Aurick Zhou",
    "Pieter Abbeel",
    "Sergey Levine"
  ],
  "dates": {
    "citation_date": "2018/01/04",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB)",
    "original_submission": "Thu, 4 Jan 2018 09:50:50 UTC (2,350 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:14:36.259890+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-5a4b68c6f188f4::S1",
  "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor",
  "url": "https://arxiv.org/abs/1801.01290",
  "version_url": "https://arxiv.org/abs/1801.01290v2"
}

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Tuomas Haarnoja is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor, revised Wed, 8 Aug 2018 21:27:08 UTC (7,185 KB). Continuous-control benchmark results are the authors’ reports, not a guarantee of stable deployment in every real-world domain. Tuomas Haarnoja is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tyna Eloundou

Tyna Eloundou is a listed coauthor of a study estimating task exposure to language models and associated software across the U.S. labor market.

Its rubric combines human expertise with GPT-4 classifications to compare occupations against model capabilities.

The analysis distinguishes access to an underlying model from tooling built around it, describing potential changes in task completion rather than forecasting an adoption date.

Sources and details

GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models

{
  "access_scope": "Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Tyna Eloundou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "authors_in_source_order": [
    "Tyna Eloundou",
    "Sam Manning",
    "Pamela Mishkin",
    "Daniel Rock"
  ],
  "dates": {
    "citation_date": "2023/03/17",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB)",
    "original_submission": "Fri, 17 Mar 2023 17:15:20 UTC (5,829 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:41.007518+00:00",
    "version": "arXiv v5"
  },
  "id": "person-local-tynaeloundou::S1",
  "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models",
  "url": "https://arxiv.org/abs/2303.10130",
  "version_url": "https://arxiv.org/abs/2303.10130v5"
}

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Tyna Eloundou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract for GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models, revised Mon, 21 Aug 2023 07:58:25 UTC (8,833 KB). Exposure estimates are potential task effects under the study’s rubric, not predictions of job losses, realized productivity or the timing of adoption. Tyna Eloundou is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vicki Cheung

Vicki Cheung is a listed coauthor of the OpenAI Gym whitepaper, which presents a common interface for reinforcement-learning benchmark problems.

The toolkit’s shared environment interface enables algorithm results to be compared across a growing collection of tasks.

The paper explains software components and design choices alongside a website for sharing outcomes, connecting implementation conventions with research evaluation.

Sources and details

OpenAI Gym

{
  "access_scope": "Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Vicki Cheung is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "authors_in_source_order": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "citation_date": "2016/06/05",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.531635+00:00",
    "version": "arXiv v1"
  },
  "id": "person-vickicheung::S1",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540",
  "version_url": "https://arxiv.org/abs/1606.01540v1"
}

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Vicki Cheung is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Vicki Cheung is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vikas Verma

Vikas Verma is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Vikas Verma is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-99a5852dfa23e8::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Vikas Verma is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Vikas Verma is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William J. Dally

William J. Dally is a listed coauthor of Deep Compression, which combines pruning, trained quantization, and Huffman coding to reduce neural-network storage.

The method removes less important connections, shares weights through quantization, and retrains the remaining connections and quantized centroids.

The paper reports compression and hardware benchmarks for specific networks, connecting smaller models to on-chip memory and constrained mobile deployment.

Sources and details

Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. William J. Dally is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "authors_in_source_order": [
    "Han, Song",
    "Mao, Huizi",
    "Dally, William J."
  ],
  "dates": {
    "citation_date": "2015/10/01",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Mon, 15 Feb 2016 06:25:40 UTC (755 KB)",
    "retrieved_utc": "2026-10-07T18:14:34.518964+00:00",
    "version": "arXiv v5"
  },
  "id": "person-coverage-5fc77c07ca4118::S1",
  "title": "Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding",
  "url": "https://arxiv.org/abs/1510.00149",
  "version_url": "https://arxiv.org/abs/1510.00149v5"
}

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. William J. Dally is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Mon, 15 Feb 2016 06:25:40 UTC (755 KB); account limited to this paper’s method and reported evaluation. William J. Dally is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wojciech Zaremba

Wojciech Zaremba is a listed coauthor of the OpenAI Gym whitepaper, which presents a common interface for reinforcement-learning benchmark problems.

The toolkit’s shared environment interface enables algorithm results to be compared across a growing collection of tasks.

The paper explains software components and design choices alongside a website for sharing outcomes, connecting implementation conventions with research evaluation.

Sources and details

OpenAI Gym

{
  "access_scope": "Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Wojciech Zaremba is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "authors_in_source_order": [
    "Greg Brockman",
    "Vicki Cheung",
    "Ludwig Pettersson",
    "Jonas Schneider",
    "John Schulman",
    "Jie Tang",
    "Wojciech Zaremba"
  ],
  "dates": {
    "citation_date": "2016/06/05",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission": "Sun, 5 Jun 2016 17:54:48 UTC (546 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.531635+00:00",
    "version": "arXiv v1"
  },
  "id": "person-wojciechzaremba::S1",
  "title": "OpenAI Gym",
  "url": "https://arxiv.org/abs/1606.01540",
  "version_url": "https://arxiv.org/abs/1606.01540v1"
}

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Wojciech Zaremba is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for OpenAI Gym, revised Sun, 5 Jun 2016 17:54:48 UTC (546 KB). The abstract describes the 2016 toolkit and results-sharing design; it does not establish current service availability, later successor APIs or who individually implemented each component. Wojciech Zaremba is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xiaomeng Yang

Xiaomeng Yang is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Xiaomeng Yang is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-80069267c0856d::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Xiaomeng Yang is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Xiaomeng Yang is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xipeng Qiu

Xipeng Qiu is a listed coauthor of the InternLM2 report, which details language-model pre-training with text, code and long-context data.

The account describes moving from 4k-token training to 32k-token stages and then aligning the model with supervised fine-tuning and conditional online RLHF.

That alignment strategy addresses conflicting preferences and reward hacking, while releases at different stages and sizes expose the model’s training progression.

Sources and details

InternLM2 Technical Report

{
  "access_scope": "Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Xipeng Qiu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Zheng Cai",
    "Maosong Cao",
    "Haojiong Chen",
    "Kai Chen",
    "Keyu Chen",
    "Xin Chen",
    "Xun Chen",
    "Zehui Chen",
    "Zhi Chen",
    "Pei Chu",
    "Xiaoyi Dong",
    "Haodong Duan",
    "Qi Fan",
    "Zhaoye Fei",
    "Yang Gao",
    "Jiaye Ge",
    "Chenya Gu",
    "Yuzhe Gu",
    "Tao Gui",
    "Aijia Guo",
    "Qipeng Guo",
    "Conghui He",
    "Yingfan Hu",
    "Ting Huang",
    "Tao Jiang",
    "Penglong Jiao",
    "Zhenjiang Jin",
    "Zhikai Lei",
    "Jiaxing Li",
    "Jingwen Li",
    "Linyang Li",
    "Shuaibin Li",
    "Wei Li",
    "Yining Li",
    "Hongwei Liu",
    "Jiangning Liu",
    "Jiawei Hong",
    "Kaiwen Liu",
    "Kuikun Liu",
    "Xiaoran Liu",
    "Chengqi Lv",
    "Haijun Lv",
    "Kai Lv",
    "Li Ma",
    "Runyuan Ma",
    "Zerun Ma",
    "Wenchang Ning",
    "Linke Ouyang",
    "Jiantao Qiu",
    "Yuan Qu",
    "Fukai Shang",
    "Yunfan Shao",
    "Demin Song",
    "Zifan Song",
    "Zhihao Sui",
    "Peng Sun",
    "Yu Sun",
    "Huanze Tang",
    "Bin Wang",
    "Guoteng Wang",
    "Jiaqi Wang",
    "Jiayu Wang",
    "Rui Wang",
    "Yudong Wang",
    "Ziyi Wang",
    "Xingjian Wei",
    "Qizhen Weng",
    "Fan Wu",
    "Yingtong Xiong",
    "Chao Xu",
    "Ruiliang Xu",
    "Hang Yan",
    "Yirong Yan",
    "Xiaogui Yang",
    "Haochen Ye",
    "Huaiyuan Ying",
    "Jia Yu",
    "Jing Yu",
    "Yuhang Zang",
    "Chuyu Zhang",
    "Li Zhang",
    "Pan Zhang",
    "Peng Zhang",
    "Ruijie Zhang",
    "Shuo Zhang",
    "Songyang Zhang",
    "Wenjian Zhang",
    "Wenwei Zhang",
    "Xingcheng Zhang",
    "Xinyue Zhang",
    "Hui Zhao",
    "Qian Zhao",
    "Xiaomeng Zhao",
    "Fengzhe Zhou",
    "Zaida Zhou",
    "Jingming Zhuo",
    "Yicheng Zou",
    "Xipeng Qiu",
    "Yu Qiao",
    "Dahua Lin"
  ],
  "authors_in_source_order": [
    "Zheng Cai",
    "Maosong Cao",
    "Haojiong Chen",
    "Kai Chen",
    "Keyu Chen",
    "Xin Chen",
    "Xun Chen",
    "Zehui Chen",
    "Zhi Chen",
    "Pei Chu",
    "Xiaoyi Dong",
    "Haodong Duan",
    "Qi Fan",
    "Zhaoye Fei",
    "Yang Gao",
    "Jiaye Ge",
    "Chenya Gu",
    "Yuzhe Gu",
    "Tao Gui",
    "Aijia Guo",
    "Qipeng Guo",
    "Conghui He",
    "Yingfan Hu",
    "Ting Huang",
    "Tao Jiang",
    "Penglong Jiao",
    "Zhenjiang Jin",
    "Zhikai Lei",
    "Jiaxing Li",
    "Jingwen Li",
    "Linyang Li",
    "Shuaibin Li",
    "Wei Li",
    "Yining Li",
    "Hongwei Liu",
    "Jiangning Liu",
    "Jiawei Hong",
    "Kaiwen Liu",
    "Kuikun Liu",
    "Xiaoran Liu",
    "Chengqi Lv",
    "Haijun Lv",
    "Kai Lv",
    "Li Ma",
    "Runyuan Ma",
    "Zerun Ma",
    "Wenchang Ning",
    "Linke Ouyang",
    "Jiantao Qiu",
    "Yuan Qu",
    "Fukai Shang",
    "Yunfan Shao",
    "Demin Song",
    "Zifan Song",
    "Zhihao Sui",
    "Peng Sun",
    "Yu Sun",
    "Huanze Tang",
    "Bin Wang",
    "Guoteng Wang",
    "Jiaqi Wang",
    "Jiayu Wang",
    "Rui Wang",
    "Yudong Wang",
    "Ziyi Wang",
    "Xingjian Wei",
    "Qizhen Weng",
    "Fan Wu",
    "Yingtong Xiong",
    "Chao Xu",
    "Ruiliang Xu",
    "Hang Yan",
    "Yirong Yan",
    "Xiaogui Yang",
    "Haochen Ye",
    "Huaiyuan Ying",
    "Jia Yu",
    "Jing Yu",
    "Yuhang Zang",
    "Chuyu Zhang",
    "Li Zhang",
    "Pan Zhang",
    "Peng Zhang",
    "Ruijie Zhang",
    "Shuo Zhang",
    "Songyang Zhang",
    "Wenjian Zhang",
    "Wenwei Zhang",
    "Xingcheng Zhang",
    "Xinyue Zhang",
    "Hui Zhao",
    "Qian Zhao",
    "Xiaomeng Zhao",
    "Fengzhe Zhou",
    "Zaida Zhou",
    "Jingming Zhuo",
    "Yicheng Zou",
    "Xipeng Qiu",
    "Yu Qiao",
    "Dahua Lin"
  ],
  "dates": {
    "citation_date": "2024/03/26",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB)",
    "original_submission": "Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:29.141698+00:00",
    "version": "arXiv v1"
  },
  "id": "person-xipengqiu::S1",
  "title": "InternLM2 Technical Report",
  "url": "https://arxiv.org/abs/2403.17297",
  "version_url": "https://arxiv.org/abs/2403.17297v1"
}

Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Xipeng Qiu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for InternLM2 Technical Report, revised Tue, 26 Mar 2024 00:53:24 UTC (3,291 KB). Descriptions concern the reported InternLM2 training stages and evaluations; longer-context tests and RLHF claims do not establish unrestricted context use, absence of reward hacking or AGI. Xipeng Qiu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xu Ji

Xu Ji is a listed coauthor of a report that derives computational indicators of possible AI consciousness from neuroscientific theories.

The authors compare recurrent processing, global workspace, higher-order, predictive processing and attention-schema approaches to construct assessable properties.

They use those indicators to examine contemporary systems and discuss future implementations, separating a theory-led assessment from proof that an AI has subjective experience.

Sources and details

Consciousness in Artificial Intelligence: Insights from the Science of Consciousness

{
  "access_scope": "Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Xu Ji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Robert Long",
    "Eric Elmoznino",
    "Yoshua Bengio",
    "Jonathan Birch",
    "Axel Constant",
    "George Deane",
    "Stephen M. Fleming",
    "Chris Frith",
    "Xu Ji",
    "Ryota Kanai",
    "Colin Klein",
    "Grace Lindsay",
    "Matthias Michel",
    "Liad Mudrik",
    "Megan A. K. Peters",
    "Eric Schwitzgebel",
    "Jonathan Simon",
    "Rufin VanRullen"
  ],
  "dates": {
    "citation_date": "2023/08/17",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB)",
    "original_submission": "Thu, 17 Aug 2023 00:10:16 UTC (1,543 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:54.669933+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2e90146df65e9e::S1",
  "title": "Consciousness in Artificial Intelligence: Insights from the Science of Consciousness",
  "url": "https://arxiv.org/abs/2308.08708",
  "version_url": "https://arxiv.org/abs/2308.08708v3"
}

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Xu Ji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Consciousness in Artificial Intelligence: Insights from the Science of Consciousness, revised Tue, 22 Aug 2023 17:33:15 UTC (1,543 KB). The report’s assessment concerns the systems available in its 2023 context; indicator satisfaction is not established as sufficient proof of consciousness. Xu Ji is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yi Wu

Yi Wu is a listed coauthor of the multi-agent autocurricula paper, which trains competing agents on hide-and-seek with reinforcement learning.

The authors describe successive strategies in which shelters built from boxes create pressure for opponents to use ramps and adapt.

They propose transfer and fine-tuning tests to assess targeted capabilities, comparing these agents with intrinsic-motivation and random-initialization baselines.

Sources and details

Emergent Tool Use From Multi-Agent Autocurricula

{
  "access_scope": "Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Yi Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "authors_in_source_order": [
    "Bowen Baker",
    "Ingmar Kanitscheider",
    "Todor Markov",
    "Yi Wu",
    "Glenn Powell",
    "Bob McGrew",
    "Igor Mordatch"
  ],
  "dates": {
    "citation_date": "2019/09/17",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB)",
    "original_submission": "Tue, 17 Sep 2019 00:17:02 UTC (9,012 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:10:45.232541+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-86671a329eb559::S1",
  "title": "Emergent Tool Use From Multi-Agent Autocurricula",
  "url": "https://arxiv.org/abs/1909.07528",
  "version_url": "https://arxiv.org/abs/1909.07528v2"
}

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Yi Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v2 abstract for Emergent Tool Use From Multi-Agent Autocurricula, revised Tue, 11 Feb 2020 00:56:50 UTC (8,908 KB). Emergent tool use refers to simulated agents in the reported environment; it does not establish general intelligence or physical-world tool competence. Yi Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yik Chan Chin

Yik Chan Chin is a listed coauthor of a policy report comparing how AI safety governance could become interoperable across China, South Korea, Singapore and the United Kingdom.

Its country studies examine ethical, legal and technical approaches in autonomous vehicles, education and cross-border data flows.

Seven comparison components organize areas of convergence and divergence into recommendations for coordination that remains sensitive to local governance.

Sources and details

Interoperability in AI Safety Governance: Ethics, Regulations, and Standards

{
  "access_scope": "Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Yik Chan Chin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "authors_in_source_order": [
    "Yik Chan Chin",
    "David A. Raho",
    "Hag-Min Kim",
    "Chunli Bi",
    "James Ong",
    "Jingbo Huang",
    "Serge Stinckwich"
  ],
  "dates": {
    "citation_date": "2026/01/06",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission": "Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:35.591288+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-cd64fb7bc34f76::S1",
  "title": "Interoperability in AI Safety Governance: Ethics, Regulations, and Standards",
  "url": "https://arxiv.org/abs/2601.06153",
  "version_url": "https://arxiv.org/abs/2601.06153v1"
}

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Yik Chan Chin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Interoperability in AI Safety Governance: Ethics, Regulations, and Standards, revised Tue, 6 Jan 2026 05:39:59 UTC (2,029 KB). This is a comparative policy report and recommendations, not a binding legal instrument or proof that international interoperability has been implemented. Yik Chan Chin is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yuan Cao

Yuan Cao is a listed coauthor of the ReAct paper, which interleaves language-model reasoning traces with task-specific actions.

Reasoning supports updates to plans, while actions retrieve information from external knowledge sources or environments.

The authors evaluate this combination on question answering, fact verification and interactive decision tasks, comparing it with approaches that omit reasoning or action components.

Sources and details

ReAct: Synergizing Reasoning and Acting in Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Yuan Cao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "authors_in_source_order": [
    "Shunyu Yao",
    "Jeffrey Zhao",
    "Dian Yu",
    "Nan Du",
    "Izhak Shafran",
    "Karthik Narasimhan",
    "Yuan Cao"
  ],
  "dates": {
    "citation_date": "2022/10/06",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB)",
    "original_submission": "Thu, 6 Oct 2022 01:00:32 UTC (538 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:20:40.691387+00:00",
    "version": "arXiv v3"
  },
  "id": "person-local-yuancao::S1",
  "title": "ReAct: Synergizing Reasoning and Acting in Language Models",
  "url": "https://arxiv.org/abs/2210.03629",
  "version_url": "https://arxiv.org/abs/2210.03629v3"
}

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Yuan Cao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for ReAct: Synergizing Reasoning and Acting in Language Models, revised Fri, 10 Mar 2023 01:00:17 UTC (1,256 KB). Results refer to the selected ReAct benchmarks and prompting setups, not guaranteed factual accuracy or general reliability in every tool-using system. Yuan Cao is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yuri Chervonyi

Yuri Chervonyi is a listed coauthor of the AlphaGeometry2 report, which extends a geometry-solving language to handle object movements and equations over angles, ratios, and distances.

The system combines language modeling based on Gemini with communication between search trees and changes to symbolic reasoning and synthetic data generation.

The report evaluates Olympiad geometry problems and separately describes ongoing work toward solving problems supplied in natural language.

Sources and details

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Yuri Chervonyi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Chervonyi, Yuri",
    "Trinh, Trieu H.",
    "Olšák, Miroslav",
    "Yang, Xiaomeng",
    "Nguyen, Hoang",
    "Menegali, Marcelo",
    "Jung, Junehyuk",
    "Kim, Junsu",
    "Verma, Vikas",
    "Le, Quoc V.",
    "Luong, Thang"
  ],
  "dates": {
    "citation_date": "2025/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 Dec 2025 21:34:52 UTC (478 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.460654+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-291480dfe31a3d::S1",
  "title": "Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2",
  "url": "https://arxiv.org/abs/2502.03544",
  "version_url": "https://arxiv.org/abs/2502.03544v3"
}

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Yuri Chervonyi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Mon, 8 Dec 2025 21:34:52 UTC (478 KB); account limited to this paper’s method and reported evaluation. Yuri Chervonyi is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yuxin Wu

Yuxin Wu is a listed coauthor of the Momentum Contrast paper, which learns visual representations through a dynamic dictionary of examples.

A queue and a moving-averaged encoder keep that dictionary large and consistent as training proceeds.

The authors report linear image-classification and downstream detection or segmentation evaluations to assess whether unsupervised pre-training can transfer beyond its training objective.

Sources and details

Momentum Contrast for Unsupervised Visual Representation Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Yuxin Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "authors_in_source_order": [
    "Kaiming He",
    "Haoqi Fan",
    "Yuxin Wu",
    "Saining Xie",
    "Ross Girshick"
  ],
  "dates": {
    "citation_date": "2019/11/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 23 Mar 2020 18:36:55 UTC (210 KB)",
    "original_submission": "Wed, 13 Nov 2019 18:53:26 UTC (173 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.630437+00:00",
    "version": "arXiv v3"
  },
  "id": "person-yuxinwu::S1",
  "title": "Momentum Contrast for Unsupervised Visual Representation Learning",
  "url": "https://arxiv.org/abs/1911.05722",
  "version_url": "https://arxiv.org/abs/1911.05722v3"
}

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Yuxin Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Momentum Contrast for Unsupervised Visual Representation Learning, revised Mon, 23 Mar 2020 18:36:55 UTC (210 KB). Claims concern MoCo’s reported visual benchmarks and configurations, not universal equivalence between supervised and unsupervised learning. Yuxin Wu is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zach DeVito

Zach DeVito is a listed coauthor of the PyTorch paper, which explains an imperative Python programming model together with the library’s runtime architecture.

Its design keeps model code under ordinary Python control while supporting efficient execution and hardware accelerators.

The authors evaluate individual subsystems and overall benchmark speed to connect those implementation principles with reported performance.

Sources and details

PyTorch: An Imperative Style, High-Performance Deep Learning Library

{
  "access_scope": "Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Zach DeVito is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "authors_in_source_order": [
    "Adam Paszke",
    "Sam Gross",
    "Francisco Massa",
    "Adam Lerer",
    "James Bradbury",
    "Gregory Chanan",
    "Trevor Killeen",
    "Zeming Lin",
    "Natalia Gimelshein",
    "Luca Antiga",
    "Alban Desmaison",
    "Andreas Köpf",
    "Edward Yang",
    "Zach DeVito",
    "Martin Raison",
    "Alykhan Tejani",
    "Sasank Chilamkurthy",
    "Benoit Steiner",
    "Lu Fang",
    "Junjie Bai",
    "Soumith Chintala"
  ],
  "dates": {
    "citation_date": "2019/12/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission": "Tue, 3 Dec 2019 22:06:05 UTC (564 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:01:47.063189+00:00",
    "version": "arXiv v1"
  },
  "id": "person-zachdevito::S1",
  "title": "PyTorch: An Imperative Style, High-Performance Deep Learning Library",
  "url": "https://arxiv.org/abs/1912.01703",
  "version_url": "https://arxiv.org/abs/1912.01703v1"
}

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Zach DeVito is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v1 abstract for PyTorch: An Imperative Style, High-Performance Deep Learning Library, revised Tue, 3 Dec 2019 22:06:05 UTC (564 KB). This is the 2019 architecture paper’s account, not verification of current PyTorch APIs or an assignment of particular runtime components to this individual coauthor. Zach DeVito is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhaohan Daniel Guo

Zhaohan Daniel Guo is a listed coauthor of the BYOL paper, which learns image representations by having an online network predict a target network’s encoding of another augmented view.

The target changes through a slow-moving average of the online network, giving learning a gradually updated reference.

The authors report image-classification and transfer evaluations without using the negative example pairs common in other self-supervised methods.

Sources and details

Bootstrap your own latent: A new approach to self-supervised Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Zhaohan Daniel Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.",
  "authors": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "authors_in_source_order": [
    "Jean-Bastien Grill",
    "Florian Strub",
    "Florent Altché",
    "Corentin Tallec",
    "Pierre H. Richemond",
    "Elena Buchatskaya",
    "Carl Doersch",
    "Bernardo Avila Pires",
    "Zhaohan Daniel Guo",
    "Mohammad Gheshlaghi Azar",
    "Bilal Piot",
    "Koray Kavukcuoglu",
    "Rémi Munos",
    "Michal Valko"
  ],
  "dates": {
    "citation_date": "2020/06/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB)",
    "original_submission": "Sat, 13 Jun 2020 22:35:21 UTC (1,446 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:53.981040+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-e93bf28d58cd17::S1",
  "title": "Bootstrap your own latent: A new approach to self-supervised Learning",
  "url": "https://arxiv.org/abs/2006.07733",
  "version_url": "https://arxiv.org/abs/2006.07733v3"
}

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Zhaohan Daniel Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Bootstrap your own latent: A new approach to self-supervised Learning, revised Thu, 10 Sep 2020 09:46:02 UTC (3,909 KB). Claims concern the BYOL configurations and benchmarks described in the abstract, not all self-supervised systems or an individual invention assignment. Zhaohan Daniel Guo is credited as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. The original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhenjia Xu

Zhenjia Xu is a listed coauthor of Diffusion Policy, which represents robot visuomotor behavior as a conditional denoising process.

The method learns a score over action distributions and iteratively generates actions through stochastic Langevin steps.

The paper combines visual conditioning, receding-horizon control, and a time-series diffusion transformer and evaluates the policy on manipulation benchmarks.

Sources and details

Diffusion Policy: Visuomotor Policy Learning via Action Diffusion

{
  "access_scope": "Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Zhenjia Xu is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "authors_in_source_order": [
    "Chi, Cheng",
    "Xu, Zhenjia",
    "Feng, Siyuan",
    "Cousineau, Eric",
    "Du, Yilun",
    "Burchfiel, Benjamin",
    "Tedrake, Russ",
    "Song, Shuran"
  ],
  "dates": {
    "citation_date": "2023/03/07",
    "inspected_arxiv_version": "v5",
    "inspected_revision": "Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB)",
    "retrieved_utc": "2026-10-07T18:01:47.970346+00:00",
    "version": "arXiv v5"
  },
  "id": "person-zhenjiaxu::S1",
  "title": "Diffusion Policy: Visuomotor Policy Learning via Action Diffusion",
  "url": "https://arxiv.org/abs/2303.04137",
  "version_url": "https://arxiv.org/abs/2303.04137v5"
}

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Zhenjia Xu is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v5 abstract, revised Thu, 14 Mar 2024 04:36:31 UTC (9,772 KB); account limited to this paper’s method and reported evaluation. Zhenjia Xu is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhihong Shao

Zhihong Shao is a listed coauthor of DeepSeekMath, which continues pretraining a code model with mathematics-related web tokens alongside language and code data.

The paper emphasizes a selection pipeline for publicly available data and introduces Group Relative Policy Optimization as a reinforcement-learning variant.

Its abstract distinguishes direct benchmark evaluation from self-consistency over multiple samples, rather than treating those settings as the same result.

Sources and details

DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Sat, 27 Apr 2024 15:25:53 UTC (3,417 KB); account limited to this paper’s method and reported evaluation. Zhihong Shao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.",
  "authors": [
    "Shao, Zhihong",
    "Wang, Peiyi",
    "Zhu, Qihao",
    "Xu, Runxin",
    "Song, Junxiao",
    "Bi, Xiao",
    "Zhang, Haowei",
    "Zhang, Mingchuan",
    "Li, Y. K.",
    "Wu, Y.",
    "Guo, Daya"
  ],
  "authors_in_source_order": [
    "Shao, Zhihong",
    "Wang, Peiyi",
    "Zhu, Qihao",
    "Xu, Runxin",
    "Song, Junxiao",
    "Bi, Xiao",
    "Zhang, Haowei",
    "Zhang, Mingchuan",
    "Li, Y. K.",
    "Wu, Y.",
    "Guo, Daya"
  ],
  "dates": {
    "citation_date": "2024/02/05",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Sat, 27 Apr 2024 15:25:53 UTC (3,417 KB)",
    "retrieved_utc": "2026-10-07T17:55:28.977872+00:00",
    "version": "arXiv v3"
  },
  "id": "person-zhihongshao::S1",
  "title": "DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models",
  "url": "https://arxiv.org/abs/2402.03300",
  "version_url": "https://arxiv.org/abs/2402.03300v3"
}

Joint-author arXiv v3 abstract, revised Sat, 27 Apr 2024 15:25:53 UTC (3,417 KB); account limited to this paper’s method and reported evaluation. Zhihong Shao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

Joint-author arXiv v3 abstract, revised Sat, 27 Apr 2024 15:25:53 UTC (3,417 KB); account limited to this paper’s method and reported evaluation. Zhihong Shao is listed as a coauthor; individual task allocation and broader career claims are not supplied by this abstract. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ion Stoica

Ion Stoica is a listed coauthor of the PagedAttention paper, which addresses memory waste when serving many language-model requests.

Its attention algorithm borrows paging concepts from operating systems to manage dynamically changing key-value caches.

The vLLM system built around that algorithm supports cache sharing within and across requests, with reported throughput comparisons at matched latency.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": "Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ion Stoica is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "authors_in_source_order": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "citation_date": "2023/09/12",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.888714+00:00",
    "version": "arXiv v1"
  },
  "id": "person-ionstoica::S1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/abs/2309.06180",
  "version_url": "https://arxiv.org/abs/2309.06180v1"
}

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ion Stoica is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ion Stoica is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joel Veness

Joel Veness is a listed coauthor of the Arcade Learning Environment paper, which introduces an interface and evaluation methodology for Atari 2600 game agents.

Its shared platform exposes varied games as challenges for reinforcement learning, planning and transfer across domains.

The authors illustrate the methodology with benchmark agents and results on more than fifty-five games, separating a comparative testbed from a claim that any agent is generally intelligent.

Sources and details

The Arcade Learning Environment: An Evaluation Platform for General Agents

{
  "access_scope": "Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Joel Veness is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "authors_in_source_order": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "dates": {
    "citation_date": "2012/07/19",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 21 Jun 2013 18:07:06 UTC (178 KB)",
    "original_submission": "Thu, 19 Jul 2012 15:33:25 UTC (164 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.622531+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a578d6bd22f21d::S1",
  "title": "The Arcade Learning Environment: An Evaluation Platform for General Agents",
  "url": "https://arxiv.org/abs/1207.4708",
  "version_url": "https://arxiv.org/abs/1207.4708v2"
}

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Joel Veness is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Joel Veness is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua B. Tenenbaum

Joshua B. Tenenbaum is a listed coauthor of a deep-reinforcement-learning study of Super Smash Bros. Melee as a multiplayer testbed.

The paper frames the game’s complex dynamics and partial observability as challenges beyond many single-agent reinforcement-learning environments.

It reports agents competitive with human professionals in that setting, presenting game-specific performance rather than an unrestricted claim of human-level intelligence.

Sources and details

Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Joshua B. Tenenbaum is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "authors_in_source_order": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "dates": {
    "citation_date": "2017/02/21",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 May 2017 15:03:25 UTC (152 KB)",
    "original_submission": "Tue, 21 Feb 2017 01:06:11 UTC (152 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.978825+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d05c42997e6c18::S1",
  "title": "Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1702.06230",
  "version_url": "https://arxiv.org/abs/1702.06230v3"
}

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Joshua B. Tenenbaum is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Joshua B. Tenenbaum is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wenhao Huang

Wenhao Huang is a listed coauthor of the Yi model-family report, which emphasizes data engineering for language and multimodal pre-training.

The authors describe deduplication and quality filtering of English and Chinese corpora, followed by repeated verification of a smaller instruction dataset.

They extend the language models with vision alignment, longer-context training and greater depth, assessing these variants on stated benchmark and preference tasks.

Sources and details

Yi: Open Foundation Models by 01.AI

{
  "access_scope": "Joint-author arXiv v3 abstract for Yi: Open Foundation Models by 01.AI, revised Tue, 21 Jan 2025 10:12:05 UTC (5,182 KB). The report’s model-family variants and tests remain distinct; long-context retrieval tests do not establish perfect use of every token, and reported quality is not a current product guarantee. Wenhao Huang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "01.AI\n:\nAlex Young",
    "Bei Chen",
    "Chao Li",
    "Chengen Huang",
    "Ge Zhang",
    "Guanwei Zhang",
    "Guoyin Wang",
    "Heng Li",
    "Jiangcheng Zhu",
    "Jianqun Chen",
    "Jing Chang",
    "Kaidong Yu",
    "Peng Liu",
    "Qiang Liu",
    "Shawn Yue",
    "Senbin Yang",
    "Shiming Yang",
    "Wen Xie",
    "Wenhao Huang",
    "Xiaohui Hu",
    "Xiaoyi Ren",
    "Xinyao Niu",
    "Pengcheng Nie",
    "Yanpeng Li",
    "Yuchi Xu",
    "Yudong Liu",
    "Yue Wang",
    "Yuxuan Cai",
    "Zhenyu Gu",
    "Zhiyuan Liu",
    "Zonghong Dai"
  ],
  "authors_in_source_order": [
    "01.AI\n:\nAlex Young",
    "Bei Chen",
    "Chao Li",
    "Chengen Huang",
    "Ge Zhang",
    "Guanwei Zhang",
    "Guoyin Wang",
    "Heng Li",
    "Jiangcheng Zhu",
    "Jianqun Chen",
    "Jing Chang",
    "Kaidong Yu",
    "Peng Liu",
    "Qiang Liu",
    "Shawn Yue",
    "Senbin Yang",
    "Shiming Yang",
    "Wen Xie",
    "Wenhao Huang",
    "Xiaohui Hu",
    "Xiaoyi Ren",
    "Xinyao Niu",
    "Pengcheng Nie",
    "Yanpeng Li",
    "Yuchi Xu",
    "Yudong Liu",
    "Yue Wang",
    "Yuxuan Cai",
    "Zhenyu Gu",
    "Zhiyuan Liu",
    "Zonghong Dai"
  ],
  "dates": {
    "citation_date": "2024/03/07",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Tue, 21 Jan 2025 10:12:05 UTC (5,182 KB)",
    "original_submission": "Thu, 7 Mar 2024 16:52:49 UTC (9,681 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:54:16.132097+00:00",
    "version": "arXiv v3"
  },
  "id": "person-wenhaohuang::S1",
  "title": "Yi: Open Foundation Models by 01.AI",
  "url": "https://arxiv.org/abs/2403.04652",
  "version_url": "https://arxiv.org/abs/2403.04652v3"
}

Joint-author arXiv v3 abstract for Yi: Open Foundation Models by 01.AI, revised Tue, 21 Jan 2025 10:12:05 UTC (5,182 KB). The report’s model-family variants and tests remain distinct; long-context retrieval tests do not establish perfect use of every token, and reported quality is not a current product guarantee. Wenhao Huang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Yi: Open Foundation Models by 01.AI, revised Tue, 21 Jan 2025 10:12:05 UTC (5,182 KB). The report’s model-family variants and tests remain distinct; long-context retrieval tests do not establish perfect use of every token, and reported quality is not a current product guarantee. Wenhao Huang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mark A. Horowitz

Mark A. Horowitz is a listed coauthor of the EIE paper, which proposes hardware inference directly on compressed neural-network weights.

Sparse matrix-vector multiplication and weight sharing allow the engine to exploit a model small enough for on-chip SRAM.

The authors report benchmark comparisons that combine reduced memory movement with skipping zero activations, connecting compression structure to energy and speed in their tested hardware setting.

Sources and details

EIE: Efficient Inference Engine on Compressed Deep Neural Network

{
  "access_scope": "Joint-author arXiv v2 abstract for EIE: Efficient Inference Engine on Compressed Deep Neural Network, revised Tue, 3 May 2016 04:27:02 UTC (3,829 KB). Reported speed and energy comparisons concern EIE’s specified compressed networks and hardware baselines, not all models, current accelerators or this coauthor’s individual circuit design. Mark A. Horowitz is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Song Han",
    "Xingyu Liu",
    "Huizi Mao",
    "Jing Pu",
    "Ardavan Pedram",
    "Mark A. Horowitz",
    "William J. Dally"
  ],
  "authors_in_source_order": [
    "Song Han",
    "Xingyu Liu",
    "Huizi Mao",
    "Jing Pu",
    "Ardavan Pedram",
    "Mark A. Horowitz",
    "William J. Dally"
  ],
  "dates": {
    "citation_date": "2016/02/04",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 3 May 2016 04:27:02 UTC (3,829 KB)",
    "original_submission": "Thu, 4 Feb 2016 01:28:28 UTC (4,685 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:14:35.196068+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-6590406a5ff3cd::S1",
  "title": "EIE: Efficient Inference Engine on Compressed Deep Neural Network",
  "url": "https://arxiv.org/abs/1602.01528",
  "version_url": "https://arxiv.org/abs/1602.01528v2"
}

Joint-author arXiv v2 abstract for EIE: Efficient Inference Engine on Compressed Deep Neural Network, revised Tue, 3 May 2016 04:27:02 UTC (3,829 KB). Reported speed and energy comparisons concern EIE’s specified compressed networks and hardware baselines, not all models, current accelerators or this coauthor’s individual circuit design. Mark A. Horowitz is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for EIE: Efficient Inference Engine on Compressed Deep Neural Network, revised Tue, 3 May 2016 04:27:02 UTC (3,829 KB). Reported speed and energy comparisons concern EIE’s specified compressed networks and hardware baselines, not all models, current accelerators or this coauthor’s individual circuit design. Mark A. Horowitz is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Max Welling

Max Welling is a listed coauthor of Auto-Encoding Variational Bayes, which develops stochastic inference and learning for continuous latent-variable models.

A reparameterized variational bound yields an estimator that can be optimized with ordinary stochastic gradients.

The paper also fits an approximate recognition model to improve posterior inference on independent observations, linking a trainable encoder to the stated probabilistic assumptions.

Sources and details

Auto-Encoding Variational Bayes

{
  "access_scope": "Joint-author arXiv v11 abstract for Auto-Encoding Variational Bayes, revised Sat, 10 Dec 2022 21:04:00 UTC (3,451 KB). The estimator and recognition-model claims retain the paper’s differentiability and latent-variable assumptions; they do not promise exact inference for arbitrary models. Max Welling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Diederik P Kingma",
    "Max Welling"
  ],
  "authors_in_source_order": [
    "Diederik P Kingma",
    "Max Welling"
  ],
  "dates": {
    "citation_date": "2013/12/20",
    "inspected_arxiv_version": "v11",
    "inspected_revision": "Sat, 10 Dec 2022 21:04:00 UTC (3,451 KB)",
    "original_submission": "Fri, 20 Dec 2013 20:58:10 UTC (3,884 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:04.688325+00:00",
    "version": "arXiv v11"
  },
  "id": "person-maxwelling::S1",
  "title": "Auto-Encoding Variational Bayes",
  "url": "https://arxiv.org/abs/1312.6114",
  "version_url": "https://arxiv.org/abs/1312.6114v11"
}

Joint-author arXiv v11 abstract for Auto-Encoding Variational Bayes, revised Sat, 10 Dec 2022 21:04:00 UTC (3,451 KB). The estimator and recognition-model claims retain the paper’s differentiability and latent-variable assumptions; they do not promise exact inference for arbitrary models. Max Welling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v11 abstract for Auto-Encoding Variational Bayes, revised Sat, 10 Dec 2022 21:04:00 UTC (3,451 KB). The estimator and recognition-model claims retain the paper’s differentiability and latent-variable assumptions; they do not promise exact inference for arbitrary models. Max Welling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Theodoros Lappas

Theodoros Lappas is a listed coauthor of a paper proposing principles for responsible research into possible AI consciousness.

The authors argue that organizations need policies for research, deployment and public communication even when consciousness is not their intended research target.

Their five proposed principles address objectives, procedures, knowledge sharing and communications through voluntary public commitments, treating possible moral status as a governance uncertainty.

Sources and details

Principles for Responsible AI Consciousness Research

{
  "access_scope": "Joint-author arXiv v1 abstract for Principles for Responsible AI Consciousness Research, revised Mon, 13 Jan 2025 12:59:53 UTC (299 KB). This is a normative research-policy proposal about possible consciousness, not evidence that current systems are conscious or that voluntary commitments have been adopted. Theodoros Lappas is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Patrick Butlin",
    "Theodoros Lappas"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Theodoros Lappas"
  ],
  "dates": {
    "citation_date": "2025/01/13",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Mon, 13 Jan 2025 12:59:53 UTC (299 KB)",
    "original_submission": "Mon, 13 Jan 2025 12:59:53 UTC (299 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:18:45.279449+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-fb1c572e67fe3a::S1",
  "title": "Principles for Responsible AI Consciousness Research",
  "url": "https://arxiv.org/abs/2501.07290",
  "version_url": "https://arxiv.org/abs/2501.07290v1"
}

Joint-author arXiv v1 abstract for Principles for Responsible AI Consciousness Research, revised Mon, 13 Jan 2025 12:59:53 UTC (299 KB). This is a normative research-policy proposal about possible consciousness, not evidence that current systems are conscious or that voluntary commitments have been adopted. Theodoros Lappas is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Principles for Responsible AI Consciousness Research, revised Mon, 13 Jan 2025 12:59:53 UTC (299 KB). This is a normative research-policy proposal about possible consciousness, not evidence that current systems are conscious or that voluntary commitments have been adopted. Theodoros Lappas is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Dettmers

Tim Dettmers is a listed coauthor of the LLM.int8() paper, which uses mixed-precision matrix multiplication to reduce language-model inference memory.

Vector-wise normalization quantizes most features, while a separate sixteen-bit computation handles outlier dimensions that strongly affect predictive behavior.

The authors report inference experiments up to 175-billion-parameter models, using the two-part procedure to retain performance in their evaluated settings.

Sources and details

LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Tim Dettmers is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Tim Dettmers",
    "Mike Lewis",
    "Younes Belkada",
    "Luke Zettlemoyer"
  ],
  "authors_in_source_order": [
    "Tim Dettmers",
    "Mike Lewis",
    "Younes Belkada",
    "Luke Zettlemoyer"
  ],
  "dates": {
    "citation_date": "2022/08/15",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 10 Nov 2022 18:14:31 UTC (163 KB)",
    "original_submission": "Mon, 15 Aug 2022 17:08:50 UTC (161 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.279437+00:00",
    "version": "arXiv v2"
  },
  "id": "person-timdettmers::S1",
  "title": "LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale",
  "url": "https://arxiv.org/abs/2208.07339",
  "version_url": "https://arxiv.org/abs/2208.07339v2"
}

Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Tim Dettmers is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Tim Dettmers is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xiangyu Zhang

Xiangyu Zhang is a listed coauthor of the residual-learning paper, which trains network layers to represent changes relative to their inputs.

This formulation replaces an unreferenced target function with residual functions to ease optimization as depth increases.

The authors assess substantially deeper networks on ImageNet and CIFAR-10 and report detection-related results, making depth and optimization central to the comparison.

Sources and details

Deep Residual Learning for Image Recognition

{
  "access_scope": "Joint-author arXiv v1 abstract for Deep Residual Learning for Image Recognition, revised Thu, 10 Dec 2015 19:51:55 UTC (494 KB). The results concern the paper’s architectures and 2015 benchmark submissions, not a guarantee that greater depth always improves accuracy or a personal implementation assignment. Xiangyu Zhang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "authors_in_source_order": [
    "Kaiming He",
    "Xiangyu Zhang",
    "Shaoqing Ren",
    "Jian Sun"
  ],
  "dates": {
    "citation_date": "2015/12/10",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 10 Dec 2015 19:51:55 UTC (494 KB)",
    "original_submission": "Thu, 10 Dec 2015 19:51:55 UTC (494 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:55:05.642317+00:00",
    "version": "arXiv v1"
  },
  "id": "person-xiangyuzhang::S1",
  "title": "Deep Residual Learning for Image Recognition",
  "url": "https://arxiv.org/abs/1512.03385",
  "version_url": "https://arxiv.org/abs/1512.03385v1"
}

Joint-author arXiv v1 abstract for Deep Residual Learning for Image Recognition, revised Thu, 10 Dec 2015 19:51:55 UTC (494 KB). The results concern the paper’s architectures and 2015 benchmark submissions, not a guarantee that greater depth always improves accuracy or a personal implementation assignment. Xiangyu Zhang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Deep Residual Learning for Image Recognition, revised Thu, 10 Dec 2015 19:51:55 UTC (494 KB). The results concern the paper’s architectures and 2015 benchmark submissions, not a guarantee that greater depth always improves accuracy or a personal implementation assignment. Xiangyu Zhang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhilin Yang

Zhilin Yang is a listed coauthor of the XLNet paper, which learns bidirectional context through generalized autoregressive pre-training.

Its objective averages over permutations of the factorization order instead of relying on masked input, and incorporates ideas from Transformer-XL.

The authors compare the approach with BERT under comparable experimental settings across twenty language tasks, testing a different pre-training formulation rather than a single task-specific redesign.

Sources and details

XLNet: Generalized Autoregressive Pretraining for Language Understanding

{
  "access_scope": "Joint-author arXiv v2 abstract for XLNet: Generalized Autoregressive Pretraining for Language Understanding, revised Thu, 2 Jan 2020 12:48:08 UTC (2,662 KB). Comparisons are bounded to the reported pre-training and twenty-task evaluation; they do not establish superiority over every BERT variant or later language model. Zhilin Yang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Zhilin Yang",
    "Zihang Dai",
    "Yiming Yang",
    "Jaime Carbonell",
    "Ruslan Salakhutdinov",
    "Quoc V. Le"
  ],
  "authors_in_source_order": [
    "Zhilin Yang",
    "Zihang Dai",
    "Yiming Yang",
    "Jaime Carbonell",
    "Ruslan Salakhutdinov",
    "Quoc V. Le"
  ],
  "dates": {
    "citation_date": "2019/06/19",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 2 Jan 2020 12:48:08 UTC (2,662 KB)",
    "original_submission": "Wed, 19 Jun 2019 17:35:48 UTC (264 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:56:36.035221+00:00",
    "version": "arXiv v2"
  },
  "id": "person-zhilinyang::S1",
  "title": "XLNet: Generalized Autoregressive Pretraining for Language Understanding",
  "url": "https://arxiv.org/abs/1906.08237",
  "version_url": "https://arxiv.org/abs/1906.08237v2"
}

Joint-author arXiv v2 abstract for XLNet: Generalized Autoregressive Pretraining for Language Understanding, revised Thu, 2 Jan 2020 12:48:08 UTC (2,662 KB). Comparisons are bounded to the reported pre-training and twenty-task evaluation; they do not establish superiority over every BERT variant or later language model. Zhilin Yang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for XLNet: Generalized Autoregressive Pretraining for Language Understanding, revised Thu, 2 Jan 2020 12:48:08 UTC (2,662 KB). Comparisons are bounded to the reported pre-training and twenty-task evaluation; they do not establish superiority over every BERT variant or later language model. Zhilin Yang is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adrian Stecula

Adrian Stecula is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Adrian Stecula is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-8014b3a5060970::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Adrian Stecula is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Adrian Stecula is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aja Huang

Aja Huang is a listed coauthor of the AlphaTensor paper, which frames matrix-multiplication algorithm discovery as a reinforcement-learning game.

The agent searches for tensor decompositions within a finite factor space, making correctness part of the mathematical formulation.

The authors explore both operation-count improvements and runtime optimization for particular hardware, treating efficiency as dependent on the chosen criterion.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Aja Huang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alhussein Fawzi",
    "Matej Balog",
    "Aja Huang",
    "Thomas Hubert",
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Francisco J. R. Ruiz",
    "Julian Schrittwieser",
    "Grzegorz Swirszcz",
    "David Silver",
    "Demis Hassabis",
    "Pushmeet Kohli"
  ],
  "authors_in_source_order": [
    "Alhussein Fawzi",
    "Matej Balog",
    "Aja Huang",
    "Thomas Hubert",
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Francisco J. R. Ruiz",
    "Julian Schrittwieser",
    "Grzegorz Swirszcz",
    "David Silver",
    "Demis Hassabis",
    "Pushmeet Kohli"
  ],
  "dates": {
    "Accepted": "02 August 2022",
    "Issue date": "06 October 2022",
    "Published": "05 October 2022",
    "Received": "02 October 2021",
    "Version of record": "05 October 2022",
    "citation_dates": [
      "2022/10"
    ],
    "citation_publication_date": "2022/10",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.010377+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-local-ajahuang::S1",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Aja Huang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Aja Huang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Bridgland

Alex Bridgland is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alex Bridgland is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-4937156948c4ac::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alex Bridgland is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alex Bridgland is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Cowie

Andrew Cowie is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew Cowie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c04b14b8bed88d::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew Cowie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew Cowie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Krizhevsky

Alex Krizhevsky is a listed coauthor of the ImageNet convolutional-network paper, which trains a deep classifier on high-resolution images across a thousand classes.

The architecture combines convolutional layers and pooling with connected layers and a final softmax classifier.

Non-saturating neurons and an efficient GPU implementation speed training, while regularization addresses overfitting in the connected layers.

Sources and details

ImageNet Classification with Deep Convolutional Neural Networks

{
  "access_scope": "Publisher article/abstract account of ImageNet Classification with Deep Convolutional Neural Networks. Claims are bounded to the 2012 ImageNet architecture and training account; modern model performance and individual component ownership are not inferred. Alex Krizhevsky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Geoffrey E. Hinton"
  ],
  "authors_in_source_order": [
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Geoffrey E. Hinton"
  ],
  "dates": {
    "citation_dates": [
      "2012"
    ],
    "citation_publication_date": "2012",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:02:11.523660+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-alexkrizhevsky::S1",
  "title": "ImageNet Classification with Deep Convolutional Neural Networks",
  "url": "https://papers.nips.cc/paper_files/paper/2012/hash/c399862d3b9d6b76c8436e924a68c45b-Abstract.html"
}

Publisher article/abstract account of ImageNet Classification with Deep Convolutional Neural Networks. Claims are bounded to the 2012 ImageNet architecture and training account; modern model performance and individual component ownership are not inferred. Alex Krizhevsky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of ImageNet Classification with Deep Convolutional Neural Networks. Claims are bounded to the 2012 ImageNet architecture and training account; modern model performance and individual component ownership are not inferred. Alex Krizhevsky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Bor

Alexander Bor is a listed coauthor of a cross-national study of political hostility experienced on social media.

Quota-sampled surveys across thirty countries compare reported online hostility with democratic conditions, economic equality and respondents’ status-seeking motivations.

The authors connect those observations with offline hostility and wider societal tensions, treating the associations as evidence about context rather than a randomized intervention.

Sources and details

Social media users experience more political hostility in less economically equal and less democratic societies

{
  "access_scope": "Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Alexander Bor is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "authors_in_source_order": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "dates": {
    "Accepted": "24 February 2026",
    "Issue date": "June 2026",
    "Published": "03 April 2026",
    "Received": "24 April 2024",
    "Version of record": "03 April 2026",
    "citation_dates": [
      "2026/06"
    ],
    "citation_publication_date": "2026/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:15:08.950578+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-d361fa87523111::S1",
  "title": "Social media users experience more political hostility in less economically equal and less democratic societies",
  "url": "https://www.nature.com/articles/s41562-026-02432-5"
}

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Alexander Bor is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Alexander Bor is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Novikov

Alexander Novikov is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alexander Novikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c68e80373e6b2e::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alexander Novikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alexander Novikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexis Courbet

Alexis Courbet is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Alexis Courbet is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-eccdfb985b43ce::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Alexis Courbet is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Alexis Courbet is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ali Marjaninejad

Ali Marjaninejad is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ali Marjaninejad is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-0d8e20429439c8::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ali Marjaninejad is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ali Marjaninejad is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrzej Porębski

Andrzej Porębski is a listed coauthor of a conceptual article arguing against attributing consciousness to present or foreseeable computer algorithms.

The authors challenge inferences drawn from fluent language and compare assumptions about software with claims about biological substrates.

They describe fictional expectations and probabilistic language as routes to misleading attribution, presenting an argued position in the consciousness debate.

Sources and details

There is no such thing as conscious artificial intelligence

{
  "access_scope": "Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Andrzej Porębski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "authors_in_source_order": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "dates": {
    "Accepted": "01 September 2025",
    "Published": "28 October 2025",
    "Received": "15 May 2025",
    "Version of record": "28 October 2025",
    "citation_dates": [],
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:16:17.478716+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c1fe4ce76b35e5::S1",
  "title": "There is no such thing as conscious artificial intelligence",
  "url": "https://www.nature.com/articles/s41599-025-05868-8"
}

Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Andrzej Porębski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Andrzej Porębski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dmitri B. Strukov

Dmitri B. Strukov is a listed coauthor of the memristor paper, which models memory-dependent resistance through coupled electronic and ionic transport.

Its analytical example relates that behavior to nanoscale systems under an external voltage bias.

The authors connect the model with hysteretic current–voltage behavior in devices such as titanium-dioxide switches, linking a circuit concept to physical mechanisms.

Sources and details

The missing memristor found

{
  "access_scope": "Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Dmitri B. Strukov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "authors_in_source_order": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "dates": {
    "Accepted": "17 March 2008",
    "Issue date": "01 May 2008",
    "Received": "06 December 2007",
    "citation_dates": [
      "2008/05"
    ],
    "citation_publication_date": "2008/05",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:13:36.671071+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e323cd7d9cdd1e::S1",
  "title": "The missing memristor found",
  "url": "https://www.nature.com/articles/nature06932"
}

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Dmitri B. Strukov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Dmitri B. Strukov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dmitrii Kochkov

Dmitrii Kochkov is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Dmitrii Kochkov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b034f4e8e059b1::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Dmitrii Kochkov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Dmitrii Kochkov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

He He

He He is a listed coauthor of the AlphaGeometry paper, which trains a geometry theorem prover with synthetic theorems and proofs.

A neural language model guides a symbolic deduction engine, reducing dependence on translated human proof demonstrations.

The authors evaluate thirty olympiad-level geometry problems and report human-readable proofs, tying the achievement to a specific mathematical domain and test set.

Sources and details

Solving olympiad geometry without human demonstrations

{
  "access_scope": "Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. He He is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Trieu H. Trinh",
    "Yuhuai Wu",
    "Quoc V. Le",
    "He He",
    "Thang Luong"
  ],
  "authors_in_source_order": [
    "Trieu H. Trinh",
    "Yuhuai Wu",
    "Quoc V. Le",
    "He He",
    "Thang Luong"
  ],
  "dates": {
    "Accepted": "13 October 2023",
    "Issue date": "18 January 2024",
    "Published": "17 January 2024",
    "Received": "30 April 2023",
    "Version of record": "17 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:16:15.999178+00:00",
    "visible_pre_abstract_notices": "Solving olympiad geometry without human demonstrations\nDownload PDF\nDownload PDF\nAn\nAuthor Correction\nto this article was published on 23 February 2024\nThis article has been\nupdated"
  },
  "id": "person-coverage-7d6713e606fed7::S1",
  "title": "Solving olympiad geometry without human demonstrations",
  "url": "https://www.nature.com/articles/s41586-023-06747-5"
}

Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. He He is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. He He is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Godwin

Jonathan Godwin is a listed coauthor of a graph-network simulator paper, which represents physical systems as particles connected through learned message passing.

The framework models interacting fluids, rigid solids and deformable materials from training on single-step dynamics.

The authors investigate longer rollouts and changed particle counts, finding that message-passing depth and noise during training affect accumulated error.

Sources and details

Learning to Simulate Complex Physics with Graph Networks

{
  "access_scope": "Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Jonathan Godwin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "authors_in_source_order": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "dates": {
    "citation_dates": [
      "2020/11/21"
    ],
    "citation_publication_date": "2020/11/21",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:52.705222+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2c7cc3d9c3cd2a::S1",
  "title": "Learning to Simulate Complex Physics with Graph Networks",
  "url": "https://proceedings.mlr.press/v119/sanchez-gonzalez20a.html"
}

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Jonathan Godwin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Jonathan Godwin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xavier Glorot

Xavier Glorot is a listed coauthor of a study of why random initialization can make deep feedforward networks difficult to optimize.

The authors examine activation saturation and how gradients vary across layers, including the role of layer Jacobians.

Those observations motivate a new initialization scheme that produces faster convergence in their experiments.

Sources and details

Understanding the difficulty of training deep feedforward neural networks

{
  "access_scope": "Publisher article/abstract account of Understanding the difficulty of training deep feedforward neural networks. Initialization findings concern the studied feedforward networks and activations, not a guarantee of faster optimization for every architecture. Xavier Glorot is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Xavier Glorot",
    "Yoshua Bengio"
  ],
  "authors_in_source_order": [
    "Xavier Glorot",
    "Yoshua Bengio"
  ],
  "dates": {
    "citation_dates": [
      "2010/03/31"
    ],
    "citation_publication_date": "2010/03/31",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:16:08.019192+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-7a633ba0e56c1e::S1",
  "title": "Understanding the difficulty of training deep feedforward neural networks",
  "url": "https://proceedings.mlr.press/v9/glorot10a.html"
}

Publisher article/abstract account of Understanding the difficulty of training deep feedforward neural networks. Initialization findings concern the studied feedforward networks and activations, not a guarantee of faster optimization for every architecture. Xavier Glorot is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Understanding the difficulty of training deep feedforward neural networks. Initialization findings concern the studied feedforward networks and activations, not a guarantee of faster optimization for every architecture. Xavier Glorot is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Slava G. Turyshev

Slava G. Turyshev is the credited author of Orbital Data Centers: Spacecraft Constraints and Economic Viability, which models solar-powered computing as a coupled spacecraft and economics problem.

The paper derives cluster-level competitiveness conditions that connect delivered computing power and deployed mass with communication intensity, utilization and finite mission life.

Its representative high-sunlight scenario sizes power, storage and heat-rejection systems, distinguishing space-native preprocessing from terrestrial-user computing that requires much stricter operating and cost conditions.

Sources and details

Orbital Data Centers: Spacecraft Constraints and Economic Viability

{
  "access_scope": "Sole-author arXiv v1 abstract for Orbital Data Centers: Spacecraft Constraints and Economic Viability, submitted Wed, 29 Apr 2026 21:00:58 UTC (52 KB). The conditions and representative scenario are analytical results, not validation of an operating orbital data center or a current launch-price quotation. Sole authorship is the exact source credit; no broader identity merge or undocumented personal implementation claim is inferred.",
  "authors": [
    "Slava G. Turyshev"
  ],
  "authors_in_source_order": [
    "Slava G. Turyshev"
  ],
  "dates": {
    "citation_date": "2026/04/29",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Wed, 29 Apr 2026 21:00:58 UTC (52 KB)",
    "original_submission": "Wed, 29 Apr 2026 21:00:58 UTC (52 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:18:45.509190+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-f48adddc98756d::S1",
  "title": "Orbital Data Centers: Spacecraft Constraints and Economic Viability",
  "url": "https://arxiv.org/abs/2604.27197",
  "version_url": "https://arxiv.org/abs/2604.27197v1"
}

Sole-author arXiv v1 abstract for Orbital Data Centers: Spacecraft Constraints and Economic Viability, submitted Wed, 29 Apr 2026 21:00:58 UTC (52 KB). The conditions and representative scenario are analytical results, not validation of an operating orbital data center or a current launch-price quotation. Sole authorship is the exact source credit; no broader identity merge or undocumented personal implementation claim is inferred.

Sole-author arXiv v1 abstract for Orbital Data Centers: Spacecraft Constraints and Economic Viability, submitted Wed, 29 Apr 2026 21:00:58 UTC (52 KB). The conditions and representative scenario are analytical results, not validation of an operating orbital data center or a current launch-price quotation. Sole authorship is the exact source credit; no broader identity merge or undocumented personal implementation claim is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Janusz A. Starzyk

Janusz A. Starzyk is a listed coauthor of From Biological Precursors to Artificial Cognition, which compares language models and embodied agents with the Motivated Emotional Mind architecture.

The proposed architecture combines sensory representations, regulatory self-monitoring, interoception, affect, associative memory, and recurrent connections to lower-level maps.

The paper presents consciousness attribution as a falsifiable research question requiring empirical testing, rather than treating language or embodiment alone as evidence of experience.

Sources and details

From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Janusz A. Starzyk is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "authors_in_source_order": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "dates": {
    "citation_date": "2026/09/20",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 20 Sep 2026 19:24:53 UTC (514 KB)",
    "original_submission": "Sun, 20 Sep 2026 19:24:53 UTC (514 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:55.467599+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-16b293d65c58fb::S1",
  "title": "From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture",
  "url": "https://arxiv.org/abs/2609.23828",
  "version_url": "https://arxiv.org/abs/2609.23828v1"
}

Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Janusz A. Starzyk is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Janusz A. Starzyk is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jimmy Ba

Jimmy Ba is a listed coauthor of Adam: A Method for Stochastic Optimization, which adapts first-order gradient updates using estimates of lower-order moments.

The paper examines noisy or sparse gradients and changing objectives alongside theoretical convergence and online-convex-optimization bounds.

It reports comparisons with other stochastic optimizers and separately discusses AdaMax, a variant based on the infinity norm.

Sources and details

Adam: A Method for Stochastic Optimization

{
  "access_scope": "Joint-author arXiv v9 abstract, revised Mon, 30 Jan 2017 01:27:54 UTC (490 KB). Adam and AdaMax optimization-method abstract; convergence discussion is tied to the stated mathematical framework, not all neural-network training. Jimmy Ba is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Kingma, Diederik P.",
    "Ba, Jimmy"
  ],
  "authors_in_source_order": [
    "Kingma, Diederik P.",
    "Ba, Jimmy"
  ],
  "dates": {
    "citation_date": "2014/12/22",
    "inspected_arxiv_version": "v9",
    "inspected_revision": "Mon, 30 Jan 2017 01:27:54 UTC (490 KB)",
    "original_submission": "Mon, 22 Dec 2014 13:54:29 UTC (280 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T17:54:14.654063+00:00",
    "version": "arXiv v9"
  },
  "id": "person-jimmyba::S1",
  "title": "Adam: A Method for Stochastic Optimization",
  "url": "https://arxiv.org/abs/1412.6980",
  "version_url": "https://arxiv.org/abs/1412.6980v9"
}

Joint-author arXiv v9 abstract, revised Mon, 30 Jan 2017 01:27:54 UTC (490 KB). Adam and AdaMax optimization-method abstract; convergence discussion is tied to the stated mathematical framework, not all neural-network training. Jimmy Ba is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v9 abstract, revised Mon, 30 Jan 2017 01:27:54 UTC (490 KB). Adam and AdaMax optimization-method abstract; convergence discussion is tied to the stated mathematical framework, not all neural-network training. Jimmy Ba is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jinze Bai

Jinze Bai is a listed coauthor of the Qwen-VL report, which extends a language-model foundation with visual processing and a multimodal interface.

The paper describes a three-stage training pipeline and cleaned multilingual data, using image-caption-box alignment for grounding and reading text in images.

It distinguishes the base Qwen-VL model from the instruction-tuned Qwen-VL-Chat and evaluates captioning, question answering, grounding, and dialog.

Sources and details

Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Fri, 13 Oct 2023 02:41:28 UTC (5,291 KB). Qwen-VL and Qwen-VL-Chat methods and reported visual benchmarks; no capabilities generalized to later Qwen versions. Jinze Bai is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Yang, Shusheng",
    "Wang, Shijie",
    "Tan, Sinan",
    "Wang, Peng",
    "Lin, Junyang",
    "Zhou, Chang",
    "Zhou, Jingren"
  ],
  "authors_in_source_order": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Yang, Shusheng",
    "Wang, Shijie",
    "Tan, Sinan",
    "Wang, Peng",
    "Lin, Junyang",
    "Zhou, Chang",
    "Zhou, Jingren"
  ],
  "dates": {
    "citation_date": "2023/08/24",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Fri, 13 Oct 2023 02:41:28 UTC (5,291 KB)",
    "original_submission": "Thu, 24 Aug 2023 17:59:17 UTC (5,795 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.799009+00:00",
    "version": "arXiv v3"
  },
  "id": "person-jinzebai::S1",
  "title": "Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond",
  "url": "https://arxiv.org/abs/2308.12966",
  "version_url": "https://arxiv.org/abs/2308.12966v3"
}

Joint-author arXiv v3 abstract, revised Fri, 13 Oct 2023 02:41:28 UTC (5,291 KB). Qwen-VL and Qwen-VL-Chat methods and reported visual benchmarks; no capabilities generalized to later Qwen versions. Jinze Bai is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v3 abstract, revised Fri, 13 Oct 2023 02:41:28 UTC (5,291 KB). Qwen-VL and Qwen-VL-Chat methods and reported visual benchmarks; no capabilities generalized to later Qwen versions. Jinze Bai is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Junyang Lin

Junyang Lin is a listed coauthor of the Qwen Technical Report, which distinguishes pretrained base language models from chat models aligned with human feedback.

The report describes tool use and planning for agent applications, including tasks involving a code interpreter.

It also identifies coding and mathematics variants built on the base models, keeping those specialized models separate from the general chat series.

Sources and details

Qwen Technical Report

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Thu, 28 Sep 2023 17:07:49 UTC (995 KB). Original Qwen series abstract and its named Code-Qwen and Math-Qwen variants; reported comparisons do not establish later-series behavior. Junyang Lin is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Chu, Yunfei",
    "Cui, Zeyu",
    "Dang, Kai",
    "Deng, Xiaodong",
    "Fan, Yang",
    "Ge, Wenbin",
    "Han, Yu",
    "Huang, Fei",
    "Hui, Binyuan",
    "Ji, Luo",
    "Li, Mei",
    "Lin, Junyang",
    "Lin, Runji",
    "Liu, Dayiheng",
    "Liu, Gao",
    "Lu, Chengqiang",
    "Lu, Keming",
    "Ma, Jianxin",
    "Men, Rui",
    "Ren, Xingzhang",
    "Ren, Xuancheng",
    "Tan, Chuanqi",
    "Tan, Sinan",
    "Tu, Jianhong",
    "Wang, Peng",
    "Wang, Shijie",
    "Wang, Wei",
    "Wu, Shengguang",
    "Xu, Benfeng",
    "Xu, Jin",
    "Yang, An",
    "Yang, Hao",
    "Yang, Jian",
    "Yang, Shusheng",
    "Yao, Yang",
    "Yu, Bowen",
    "Yuan, Hongyi",
    "Yuan, Zheng",
    "Zhang, Jianwei",
    "Zhang, Xingxuan",
    "Zhang, Yichang",
    "Zhang, Zhenru",
    "Zhou, Chang",
    "Zhou, Jingren",
    "Zhou, Xiaohuan",
    "Zhu, Tianhang"
  ],
  "authors_in_source_order": [
    "Bai, Jinze",
    "Bai, Shuai",
    "Chu, Yunfei",
    "Cui, Zeyu",
    "Dang, Kai",
    "Deng, Xiaodong",
    "Fan, Yang",
    "Ge, Wenbin",
    "Han, Yu",
    "Huang, Fei",
    "Hui, Binyuan",
    "Ji, Luo",
    "Li, Mei",
    "Lin, Junyang",
    "Lin, Runji",
    "Liu, Dayiheng",
    "Liu, Gao",
    "Lu, Chengqiang",
    "Lu, Keming",
    "Ma, Jianxin",
    "Men, Rui",
    "Ren, Xingzhang",
    "Ren, Xuancheng",
    "Tan, Chuanqi",
    "Tan, Sinan",
    "Tu, Jianhong",
    "Wang, Peng",
    "Wang, Shijie",
    "Wang, Wei",
    "Wu, Shengguang",
    "Xu, Benfeng",
    "Xu, Jin",
    "Yang, An",
    "Yang, Hao",
    "Yang, Jian",
    "Yang, Shusheng",
    "Yao, Yang",
    "Yu, Bowen",
    "Yuan, Hongyi",
    "Yuan, Zheng",
    "Zhang, Jianwei",
    "Zhang, Xingxuan",
    "Zhang, Yichang",
    "Zhang, Zhenru",
    "Zhou, Chang",
    "Zhou, Jingren",
    "Zhou, Xiaohuan",
    "Zhu, Tianhang"
  ],
  "dates": {
    "citation_date": "2023/09/28",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 28 Sep 2023 17:07:49 UTC (995 KB)",
    "original_submission": "Thu, 28 Sep 2023 17:07:49 UTC (995 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:40.196474+00:00",
    "version": "arXiv v1"
  },
  "id": "person-junyanglin::S1",
  "title": "Qwen Technical Report",
  "url": "https://arxiv.org/abs/2309.16609",
  "version_url": "https://arxiv.org/abs/2309.16609v1"
}

Joint-author arXiv v1 abstract, revised Thu, 28 Sep 2023 17:07:49 UTC (995 KB). Original Qwen series abstract and its named Code-Qwen and Math-Qwen variants; reported comparisons do not establish later-series behavior. Junyang Lin is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v1 abstract, revised Thu, 28 Sep 2023 17:07:49 UTC (995 KB). Original Qwen series abstract and its named Code-Qwen and Math-Qwen variants; reported comparisons do not establish later-series behavior. Junyang Lin is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jure Leskovec

Jure Leskovec is a listed coauthor of Inductive Representation Learning on Large Graphs, which introduces GraphSAGE for producing embeddings of unseen nodes.

Instead of storing a separately trained embedding for each node, the method learns to sample and aggregate features from a local neighborhood.

The paper evaluates node classification on citation and Reddit graphs and transfer to unseen protein-interaction graphs.

Sources and details

Inductive Representation Learning on Large Graphs

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. Jure Leskovec is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Hamilton, William L.",
    "Ying, Rex",
    "Leskovec, Jure"
  ],
  "authors_in_source_order": [
    "Hamilton, William L.",
    "Ying, Rex",
    "Leskovec, Jure"
  ],
  "dates": {
    "citation_date": "2017/06/07",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB)",
    "original_submission": "Wed, 7 Jun 2017 14:51:05 UTC (906 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:13:47.364947+00:00",
    "version": "arXiv v4"
  },
  "id": "person-coverage-e5bb9d5e64f166::S1",
  "title": "Inductive Representation Learning on Large Graphs",
  "url": "https://arxiv.org/abs/1706.02216",
  "version_url": "https://arxiv.org/abs/1706.02216v4"
}

Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. Jure Leskovec is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. Jure Leskovec is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Margaret Mitchell

Margaret Mitchell is a listed coauthor of Model Cards for Model Reporting, which proposes short documents explaining the intended use and evaluation of trained models.

The framework records performance across relevant demographic, cultural, phenotypic, and intersectional groups together with evaluation procedures.

The paper illustrates the proposal with smile-detection and toxic-comment models, using documentation to clarify where a model may or may not be suitable.

Sources and details

Model Cards for Model Reporting

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Mon, 14 Jan 2019 20:25:27 UTC (1,443 KB). Model-card documentation proposal and two examples; transparency goals are not evidence that documentation alone eliminates bias or misuse. Margaret Mitchell is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Mitchell, Margaret",
    "Wu, Simone",
    "Zaldivar, Andrew",
    "Barnes, Parker",
    "Vasserman, Lucy",
    "Hutchinson, Ben",
    "Spitzer, Elena",
    "Raji, Inioluwa Deborah",
    "Gebru, Timnit"
  ],
  "authors_in_source_order": [
    "Mitchell, Margaret",
    "Wu, Simone",
    "Zaldivar, Andrew",
    "Barnes, Parker",
    "Vasserman, Lucy",
    "Hutchinson, Ben",
    "Spitzer, Elena",
    "Raji, Inioluwa Deborah",
    "Gebru, Timnit"
  ],
  "dates": {
    "citation_date": "2018/10/05",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Mon, 14 Jan 2019 20:25:27 UTC (1,443 KB)",
    "original_submission": "Fri, 5 Oct 2018 22:33:43 UTC (1,030 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:13:06.577411+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-3e3eae273b3518::S1",
  "title": "Model Cards for Model Reporting",
  "url": "https://arxiv.org/abs/1810.03993",
  "version_url": "https://arxiv.org/abs/1810.03993v2"
}

Joint-author arXiv v2 abstract, revised Mon, 14 Jan 2019 20:25:27 UTC (1,443 KB). Model-card documentation proposal and two examples; transparency goals are not evidence that documentation alone eliminates bias or misuse. Margaret Mitchell is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Mon, 14 Jan 2019 20:25:27 UTC (1,443 KB). Model-card documentation proposal and two examples; transparency goals are not evidence that documentation alone eliminates bias or misuse. Margaret Mitchell is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martín Abadi

Martín Abadi is a listed coauthor of TensorFlow: A system for large-scale machine learning, which represents computation and mutable shared state with dataflow graphs.

The system places graph operations across machines and heterogeneous processors, including CPUs, GPUs, and tensor-processing chips.

The paper describes this graph-based organization as enabling developers to experiment with training algorithms and state-management choices, with demonstrations on selected applications.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Martín Abadi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "authors_in_source_order": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "dates": {
    "citation_date": "2016/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 31 May 2016 19:46:10 UTC (308 KB)",
    "original_submission": "Fri, 27 May 2016 15:49:50 UTC (308 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.245163+00:00",
    "version": "arXiv v2"
  },
  "id": "person-martinabadi::S1",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695",
  "version_url": "https://arxiv.org/abs/1605.08695v2"
}

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Martín Abadi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Martín Abadi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Max Jaderberg

Max Jaderberg is a listed coauthor of the population-based reinforcement-learning study of Quake III Arena Capture the Flag.

Its training process runs independent agents concurrently in many matches, with teammates and opponents interacting in randomly generated environments.

The agents learn internal rewards and use a temporally hierarchical action representation, while tournament evaluation tests cooperation and competition against strong human players.

Sources and details

Human-level performance in first-person multiplayer games with population-based deep reinforcement learning

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB). Quake III Arena Capture the Flag pixel-and-game-point setting and tournament results; no general human-level intelligence claim beyond that game evaluation. Max Jaderberg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Jaderberg, Max",
    "Czarnecki, Wojciech M.",
    "Dunning, Iain",
    "Marris, Luke",
    "Lever, Guy",
    "Castaneda, Antonio Garcia",
    "Beattie, Charles",
    "Rabinowitz, Neil C.",
    "Morcos, Ari S.",
    "Ruderman, Avraham",
    "Sonnerat, Nicolas",
    "Green, Tim",
    "Deason, Louise",
    "Leibo, Joel Z.",
    "Silver, David",
    "Hassabis, Demis",
    "Kavukcuoglu, Koray",
    "Graepel, Thore"
  ],
  "authors_in_source_order": [
    "Jaderberg, Max",
    "Czarnecki, Wojciech M.",
    "Dunning, Iain",
    "Marris, Luke",
    "Lever, Guy",
    "Castaneda, Antonio Garcia",
    "Beattie, Charles",
    "Rabinowitz, Neil C.",
    "Morcos, Ari S.",
    "Ruderman, Avraham",
    "Sonnerat, Nicolas",
    "Green, Tim",
    "Deason, Louise",
    "Leibo, Joel Z.",
    "Silver, David",
    "Hassabis, Demis",
    "Kavukcuoglu, Koray",
    "Graepel, Thore"
  ],
  "dates": {
    "citation_date": "2018/07/03",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB)",
    "original_submission": "Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:17:04.391057+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-a1f8d9e4e5c04b::S1",
  "title": "Human-level performance in first-person multiplayer games with population-based deep reinforcement learning",
  "url": "https://arxiv.org/abs/1807.01281",
  "version_url": "https://arxiv.org/abs/1807.01281v1"
}

Joint-author arXiv v1 abstract, revised Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB). Quake III Arena Capture the Flag pixel-and-game-point setting and tournament results; no general human-level intelligence claim beyond that game evaluation. Max Jaderberg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v1 abstract, revised Tue, 3 Jul 2018 16:57:18 UTC (8,760 KB). Quake III Arena Capture the Flag pixel-and-game-point setting and tournament results; no general human-level intelligence claim beyond that game evaluation. Max Jaderberg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miljan Martic

Miljan Martic is a listed coauthor of Deep reinforcement learning from human preferences, which specifies goals through comparisons between short trajectory segments.

The approach trains reinforcement-learning agents without direct access to the reward function by collecting non-expert human preferences.

The paper reports Atari and simulated-locomotion experiments and examples of new behaviors, connecting the method to reducing the amount of human feedback needed in those settings.

Sources and details

Deep reinforcement learning from human preferences

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Miljan Martic is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Christiano, Paul",
    "Leike, Jan",
    "Brown, Tom B.",
    "Martic, Miljan",
    "Legg, Shane",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Christiano, Paul",
    "Leike, Jan",
    "Brown, Tom B.",
    "Martic, Miljan",
    "Legg, Shane",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB)",
    "original_submission": "Mon, 12 Jun 2017 17:23:59 UTC (3,355 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:08.125302+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-miljanmartic::S1",
  "title": "Deep reinforcement learning from human preferences",
  "url": "https://arxiv.org/abs/1706.03741",
  "version_url": "https://arxiv.org/abs/1706.03741v4"
}

Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Miljan Martic is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Miljan Martic is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mohammad Norouzi

Mohammad Norouzi is a listed coauthor of the SimCLR paper, which studies contrastive learning of visual representations without a specialized architecture or memory bank.

The framework examines combinations of data augmentation and a learned nonlinear transformation between representations and the contrastive loss.

The paper also analyzes batch size and training duration and evaluates representations through linear classification and limited-label fine-tuning on ImageNet.

Sources and details

A Simple Framework for Contrastive Learning of Visual Representations

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Mohammad Norouzi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "authors_in_source_order": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "dates": {
    "citation_date": "2020/02/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB)",
    "original_submission": "Thu, 13 Feb 2020 18:50:45 UTC (5,093 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.940008+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-e17175478145e0::S1",
  "title": "A Simple Framework for Contrastive Learning of Visual Representations",
  "url": "https://arxiv.org/abs/2002.05709",
  "version_url": "https://arxiv.org/abs/2002.05709v3"
}

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Mohammad Norouzi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Mohammad Norouzi is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adrien Ecoffet

Adrien Ecoffet is a listed coauthor of First return, then explore, which introduces Go-Explore for reinforcement learning with sparse or misleading rewards.

The approach records promising states, returns to them, and then deliberately explores further, addressing loss of access to previously reached states.

The paper reports hard-exploration Atari and simulated pick-and-place results and describes a goal-conditioned policy for handling stochasticity during training.

Sources and details

First return, then explore

{
  "access_scope": "Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Adrien Ecoffet is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "authors_in_source_order": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "dates": {
    "citation_online_date": "2021/02/24",
    "citation_publication_date": "2021/02",
    "retrieved_utc": "2026-10-07T18:11:37.396554+00:00"
  },
  "id": "person-coverage-5ab0f67f5e9eb0::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "First return, then explore",
  "url": "https://www.nature.com/articles/s41586-020-03157-9"
}

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Adrien Ecoffet is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Adrien Ecoffet is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adrien Treuille

Adrien Treuille is a listed coauthor of the Foldit protein-structure paper, which turns structure refinement into an online multiplayer game.

Players manipulate protein structures with direct tools and adapted Rosetta algorithms, competing and collaborating to improve computed energy.

The paper reports that players also develop search strategies, combining human visual problem solving with computational structure-prediction methods.

Sources and details

Predicting protein structures with a multiplayer online game

{
  "access_scope": "Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Adrien Treuille is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "authors_in_source_order": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "dates": {
    "citation_publication_date": "2010/08",
    "retrieved_utc": "2026-10-07T18:13:39.302585+00:00"
  },
  "id": "person-coverage-ab145e4e6cfd52::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Predicting protein structures with a multiplayer online game",
  "url": "https://www.nature.com/articles/nature09304"
}

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Adrien Treuille is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Adrien Treuille is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Davies

Alex Davies is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Alex Davies is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-58e2391fda5965::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Alex Davies is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Alex Davies is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander T. Archibald

Alexander T. Archibald is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Alexander T. Archibald is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-b1fad93d36ff19::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Alexander T. Archibald is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Alexander T. Archibald is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aliaksandra Shysheya

Aliaksandra Shysheya is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Aliaksandra Shysheya is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-c1d481cf50eb26::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Aliaksandra Shysheya is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Aliaksandra Shysheya is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amil Merchant

Amil Merchant is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Amil Merchant is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-696976cf24fd09::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Amil Merchant is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Amil Merchant is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew El-Kadi

Andrew El-Kadi is a listed coauthor of the GenCast weather paper, which trains a probabilistic model on decades of reanalysis data.

The model produces an ensemble of possible global weather trajectories over fifteen days rather than a single deterministic forecast.

The paper compares its forecasts with the ECMWF ensemble system and reports tests covering extreme weather, cyclone tracks, and wind-power production.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Andrew El-Kadi is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_online_date": "2024/12/04",
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "person-coverage-9aca8fd45a0eec::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Andrew El-Kadi is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Andrew El-Kadi is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Hudson

Andrew Hudson is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Andrew Hudson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-13c70e4f3c5c88::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Andrew Hudson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Andrew Hudson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Atoosa Kasirzadeh

Atoosa Kasirzadeh is a listed coauthor of AI safety for everyone, which reviews research addressing practical risks in existing AI systems.

The literature review identifies areas such as adversarial robustness and interpretability alongside wider technological and systems-safety practices.

The paper argues for a pluralistic conception of safety that includes multiple motivations and risk categories, rather than equating all safety work with existential-risk research.

Sources and details

AI safety for everyone

{
  "access_scope": "Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Atoosa Kasirzadeh is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "authors_in_source_order": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "dates": {
    "citation_online_date": "2025/04/17",
    "citation_publication_date": "2025/04",
    "retrieved_utc": "2026-10-07T18:18:35.894022+00:00"
  },
  "id": "person-coverage-ff29acb1c1463d::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "AI safety for everyone",
  "url": "https://www.nature.com/articles/s42256-025-01020-y"
}

Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Atoosa Kasirzadeh is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Atoosa Kasirzadeh is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Christian Jauvin

Christian Jauvin is a listed coauthor of A Neural Probabilistic Language Model, which learns word representations together with probabilities for word sequences.

Nearby representations let observed sentences inform the model about similar but unseen sequences, addressing sparse coverage of possible word combinations.

The paper evaluates neural probability models on two text corpora against n-gram baselines and examines benefits from longer contexts.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Christian Jauvin is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "authors_in_source_order": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T18:21:16.130617+00:00"
  },
  "id": "person-local-christianjauvin::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://www.jmlr.org/papers/v3/bengio03a.html"
}

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Christian Jauvin is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Christian Jauvin is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel J. Mankowitz

Daniel J. Mankowitz is a listed coauthor of the AlphaDev sorting paper, which represents discovering a fast routine as a single-player reinforcement-learning game.

The agent builds small sorting programs from low-level CPU instructions and optimizes measured execution performance.

The paper reports integration of discovered routines into the LLVM C++ sorting library, with small-sort results kept separate from claims about every sorting workload.

Sources and details

Faster sorting algorithms discovered using deep reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Faster sorting algorithms discovered using deep reinforcement learning. AlphaDev abstract plus cached main-text method description; small sorting routines and reported LLVM integration, not universal end-to-end sorting acceleration. Daniel J. Mankowitz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Mankowitz, Daniel J.",
    "Michi, Andrea",
    "Zhernov, Anton",
    "Gelmi, Marco",
    "Selvi, Marco",
    "Paduraru, Cosmin",
    "Leurent, Edouard",
    "Iqbal, Shariq",
    "Lespiau, Jean-Baptiste",
    "Ahern, Alex",
    "Köppe, Thomas",
    "Millikin, Kevin",
    "Gaffney, Stephen",
    "Elster, Sophie",
    "Broshear, Jackson",
    "Gamble, Chris",
    "Milan, Kieran",
    "Tung, Robert",
    "Hwang, Minjae",
    "Cemgil, Taylan",
    "Barekatain, Mohammadamin",
    "Li, Yujia",
    "Mandhane, Amol",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Riedmiller, Martin",
    "Vinyals, Oriol",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Mankowitz, Daniel J.",
    "Michi, Andrea",
    "Zhernov, Anton",
    "Gelmi, Marco",
    "Selvi, Marco",
    "Paduraru, Cosmin",
    "Leurent, Edouard",
    "Iqbal, Shariq",
    "Lespiau, Jean-Baptiste",
    "Ahern, Alex",
    "Köppe, Thomas",
    "Millikin, Kevin",
    "Gaffney, Stephen",
    "Elster, Sophie",
    "Broshear, Jackson",
    "Gamble, Chris",
    "Milan, Kieran",
    "Tung, Robert",
    "Hwang, Minjae",
    "Cemgil, Taylan",
    "Barekatain, Mohammadamin",
    "Li, Yujia",
    "Mandhane, Amol",
    "Hubert, Thomas",
    "Schrittwieser, Julian",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Riedmiller, Martin",
    "Vinyals, Oriol",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2023/06/07",
    "citation_publication_date": "2023/06",
    "retrieved_utc": "2026-10-07T18:15:41.741565+00:00"
  },
  "id": "person-coverage-7713f4b6ffa272::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Faster sorting algorithms discovered using deep reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-023-06004-9"
}

Inspected publisher HTML manifestation: Faster sorting algorithms discovered using deep reinforcement learning. AlphaDev abstract plus cached main-text method description; small sorting routines and reported LLVM integration, not universal end-to-end sorting acceleration. Daniel J. Mankowitz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Faster sorting algorithms discovered using deep reinforcement learning. AlphaDev abstract plus cached main-text method description; small sorting routines and reported LLVM integration, not universal end-to-end sorting acceleration. Daniel J. Mankowitz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David M. Blei

David M. Blei is a listed coauthor of Latent Dirichlet Allocation, which presents a hierarchical probabilistic model for collections such as text corpora.

The model represents collection items through mixtures of latent topics, providing an explicit representation for documents.

The paper describes variational approximate inference and empirical-Bayes parameter estimation and evaluates document modeling, classification, and collaborative filtering.

Sources and details

Latent Dirichlet Allocation

{
  "access_scope": "Inspected publisher HTML manifestation: Latent Dirichlet Allocation. JMLR LDA abstract; hierarchical topic model and reported applications, without later implementation claims or undocumented individual task assignments. David M. Blei is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Blei, David M.",
    "Ng, Andrew Y.",
    "Jordan, Michael I."
  ],
  "authors_in_source_order": [
    "Blei, David M.",
    "Ng, Andrew Y.",
    "Jordan, Michael I."
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T18:17:52.559938+00:00"
  },
  "id": "person-coverage-b9580ce70ae6cd::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Latent Dirichlet Allocation",
  "url": "https://www.jmlr.org/papers/v3/blei03a.html"
}

Inspected publisher HTML manifestation: Latent Dirichlet Allocation. JMLR LDA abstract; hierarchical topic model and reported applications, without later implementation claims or undocumented individual task assignments. David M. Blei is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Latent Dirichlet Allocation. JMLR LDA abstract; hierarchical topic model and reported applications, without later implementation claims or undocumented individual task assignments. David M. Blei is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Hamilton

James Hamilton is the credited author of Architecture for Modular Data Centers, which proposes building facilities around standardized container-sized modules.

The proposal addresses heat, power density, and administration costs associated with large clusters of commodity components.

It frames modular design around changing how equipment is acquired, operated, and eventually recycled, rather than reporting a completed deployment comparison.

Sources and details

Architecture for Modular Data Centers

{
  "access_scope": "Sole-author arXiv v1 abstract, revised Thu, 21 Dec 2006 19:36:38 UTC (431 KB). Modular data-center architecture proposal, not an independently measured deployment result. James Hamilton is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.",
  "authors": [
    "Hamilton, James"
  ],
  "authors_in_source_order": [
    "Hamilton, James"
  ],
  "dates": {
    "citation_date": "2006/12/21",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Thu, 21 Dec 2006 19:36:38 UTC (431 KB)",
    "original_submission": "Thu, 21 Dec 2006 19:36:38 UTC (431 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:55.583886+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-1158df6f1c2a56::S1",
  "title": "Architecture for Modular Data Centers",
  "url": "https://arxiv.org/abs/cs/0612110",
  "version_url": "https://arxiv.org/abs/cs/0612110v1"
}

Sole-author arXiv v1 abstract, revised Thu, 21 Dec 2006 19:36:38 UTC (431 KB). Modular data-center architecture proposal, not an independently measured deployment result. James Hamilton is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.

Sole-author arXiv v1 abstract, revised Thu, 21 Dec 2006 19:36:38 UTC (431 KB). Modular data-center architecture proposal, not an independently measured deployment result. James Hamilton is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kees van Berkel

Kees van Berkel is the credited author of The Cost and Network Limits of Space-Based AI Compute, which compares orbital and terrestrial facilities across launch, power, cooling, radiation, and reentry constraints.

The analysis contrasts terrestrial Clos networks with laser-linked orbital mesh networks using bisection bandwidth, bisection intensity, and roofline-style models.

The paper distinguishes potentially feasible orbital inference from frontier-scale language-model training, which its analysis finds unlikely to compete economically with terrestrial facilities.

Sources and details

The Cost and Network Limits of Space-Based AI Compute

{
  "access_scope": "Sole-author arXiv v1 abstract, revised Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB). Orbital-compute cost and network modeling abstract; feasibility findings are model conclusions, not a demonstration of operating orbital infrastructure. Kees van Berkel is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.",
  "authors": [
    "van Berkel, Kees"
  ],
  "authors_in_source_order": [
    "van Berkel, Kees"
  ],
  "dates": {
    "citation_date": "2026/07/15",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB)",
    "original_submission": "Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:15:54.482106+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-840a4da4b8c165::S1",
  "title": "The Cost and Network Limits of Space-Based AI Compute",
  "url": "https://arxiv.org/abs/2607.14172",
  "version_url": "https://arxiv.org/abs/2607.14172v1"
}

Sole-author arXiv v1 abstract, revised Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB). Orbital-compute cost and network modeling abstract; feasibility findings are model conclusions, not a demonstration of operating orbital infrastructure. Kees van Berkel is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.

Sole-author arXiv v1 abstract, revised Wed, 15 Jul 2026 09:42:59 UTC (2,583 KB). Orbital-compute cost and network modeling abstract; feasibility findings are model conclusions, not a demonstration of operating orbital infrastructure. Kees van Berkel is the sole source-listed author; the abstract does not assign individual tasks or establish broader career or identity claims. The original v1 submission is the inspected manifestation; no later revision is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Akvilė Žemgulytė

Akvilė Žemgulytė is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Akvilė Žemgulytė is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-0cf4e2a6807e3a::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Akvilė Žemgulytė is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Akvilė Žemgulytė is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander I. Cowen-Rivers

Alexander I. Cowen-Rivers is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexander I. Cowen-Rivers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-cbfacce4bbb368::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexander I. Cowen-Rivers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexander I. Cowen-Rivers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander W. R. Nelson

Alexander W. R. Nelson is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alexander W. R. Nelson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-0cbb49e20e2608::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alexander W. R. Nelson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Alexander W. R. Nelson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexey Cherepanov

Alexey Cherepanov is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexey Cherepanov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-065dc8a9e9b706::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexey Cherepanov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Alexey Cherepanov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alhussein Fawzi

Alhussein Fawzi is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alhussein Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-30b6af9d27f0c9::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alhussein Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Alhussein Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alice Parker

Alice Parker is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Alice Parker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-f4f12e6003f7b0::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Alice Parker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Alice Parker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ameya Velingker

Ameya Velingker is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ameya Velingker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-9dc94cb130deac::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ameya Velingker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ameya Velingker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amol Mandhane

Amol Mandhane is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Amol Mandhane is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-8188a68d8bd428::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Amol Mandhane is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Amol Mandhane is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ana Lucic

Ana Lucic is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Ana Lucic is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-3e3ed7812a2120::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Ana Lucic is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Ana Lucic is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrea Soltoggio

Andrea Soltoggio is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrea Soltoggio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-5226ec9d0ec976::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrea Soltoggio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrea Soltoggio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andreas S. Tolias

Andreas S. Tolias is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andreas S. Tolias is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-084b27ce36be64::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andreas S. Tolias is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andreas S. Tolias is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew J. Ballard

Andrew J. Ballard is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew J. Ballard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-65f3d4805038d4::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew J. Ballard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew J. Ballard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew J. Borst

Andrew J. Borst is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Andrew J. Borst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-292e084dc822b2::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Andrew J. Borst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Andrew J. Borst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew P. Brna

Andrew P. Brna is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrew P. Brna is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-82af277cff85b5::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrew P. Brna is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Andrew P. Brna is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew W. Senior

Andrew W. Senior is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew W. Senior is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-207b2415b93a28::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew W. Senior is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Andrew W. Senior is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Angel Yanguas-Gil

Angel Yanguas-Gil is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Angel Yanguas-Gil is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b01a1fa8b28cb0::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Angel Yanguas-Gil is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Angel Yanguas-Gil is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Allen

Anna Allen is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Anna Allen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-90ce704f4f2c4f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Anna Allen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Anna Allen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Lauko

Anna Lauko is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Anna Lauko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-95319706934355::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Anna Lauko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Anna Lauko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Potapenko

Anna Potapenko is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Anna Potapenko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-103f4a7213b80a::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Anna Potapenko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Anna Potapenko is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Antoine Marie

Antoine Marie is a listed coauthor of a cross-national study of political hostility experienced on social media.

Quota-sampled surveys across thirty countries compare reported online hostility with democratic conditions, economic equality and respondents’ status-seeking motivations.

The authors connect those observations with offline hostility and wider societal tensions, treating the associations as evidence about context rather than a randomized intervention.

Sources and details

Social media users experience more political hostility in less economically equal and less democratic societies

{
  "access_scope": "Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Antoine Marie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "authors_in_source_order": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "dates": {
    "Accepted": "24 February 2026",
    "Issue date": "June 2026",
    "Published": "03 April 2026",
    "Received": "24 April 2024",
    "Version of record": "03 April 2026",
    "citation_dates": [
      "2026/06"
    ],
    "citation_publication_date": "2026/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:15:08.950578+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-ac7952fe8a90e0::S1",
  "title": "Social media users experience more political hostility in less economically equal and less democratic societies",
  "url": "https://www.nature.com/articles/s41562-026-02432-5"
}

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Antoine Marie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Antoine Marie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anurag Daram

Anurag Daram is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Anurag Daram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-44e33f5fc282b0::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Anurag Daram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Anurag Daram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ashok Thillaisundaram

Ashok Thillaisundaram is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ashok Thillaisundaram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-a37ea71ddde9b5::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ashok Thillaisundaram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ashok Thillaisundaram is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Augustin Žídek

Augustin Žídek is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Augustin Žídek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e547405c0132c2::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Augustin Žídek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Augustin Žídek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ausaf A. Bari

Ausaf A. Bari is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Ausaf A. Bari is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-b600bc539d5fc9::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Ausaf A. Bari is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Ausaf A. Bari is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Basile I. M. Wicky

Basile I. M. Wicky is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Basile I. M. Wicky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-349a7eb6da910b::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Basile I. M. Wicky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Basile I. M. Wicky is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bernardino Romera-Paredes

Bernardino Romera-Paredes is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Bernardino Romera-Paredes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-68e3c7a6a6dcda::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Bernardino Romera-Paredes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Bernardino Romera-Paredes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bhavik Mehta

Bhavik Mehta is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Bhavik Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-184178544ddd46::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Bhavik Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Bhavik Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bichlien Nguyen

Bichlien Nguyen is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Bichlien Nguyen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-d8f7a1e2ccd32d::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Bichlien Nguyen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Bichlien Nguyen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Borja Ibarz

Borja Ibarz is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Borja Ibarz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-0eca1d4d463c16::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Borja Ibarz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Borja Ibarz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian L. Trippe

Brian L. Trippe is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Brian L. Trippe is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-246eeddbd65290::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Brian L. Trippe is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Brian L. Trippe is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bruce McNaughton

Bruce McNaughton is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Bruce McNaughton is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-90dc23c43a2540::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Bruce McNaughton is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Bruce McNaughton is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bálint Gyevnár

Bálint Gyevnár is a listed coauthor of AI safety for everyone, which reviews research addressing practical risks in existing AI systems.

The literature review identifies areas such as adversarial robustness and interpretability alongside wider technological and systems-safety practices.

The paper argues for a pluralistic conception of safety that includes multiple motivations and risk categories, rather than equating all safety work with existential-risk research.

Sources and details

AI safety for everyone

{
  "access_scope": "Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Bálint Gyevnár is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "authors_in_source_order": [
    "Gyevnár, Bálint",
    "Kasirzadeh, Atoosa"
  ],
  "dates": {
    "citation_online_date": "2025/04/17",
    "citation_publication_date": "2025/04",
    "retrieved_utc": "2026-10-07T18:18:35.894022+00:00"
  },
  "id": "person-coverage-dfd4e69b82f8f6::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "AI safety for everyone",
  "url": "https://www.nature.com/articles/s42256-025-01020-y"
}

Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Bálint Gyevnár is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: AI safety for everyone. Public abstract of a systematic AI-safety literature review and its framing argument; not a quantitative prediction of future risk or verification of any particular intervention. Bálint Gyevnár is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Calle Sönne

Calle Sönne is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Calle Sönne is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-4b822a3cd4f795::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Calle Sönne is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Calle Sönne is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Caroline M. R. Low

Caroline M. R. Low is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Caroline M. R. Low is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-51186e823790b4::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Caroline M. R. Low is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Caroline M. R. Low is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Caroline Schnakers

Caroline Schnakers is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Caroline Schnakers is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-5576674c095faf::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Caroline Schnakers is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Caroline Schnakers is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Catherine Tong

Catherine Tong is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Catherine Tong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-3f4b668cceb625::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Catherine Tong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Catherine Tong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Beattie

Charles Beattie is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Charles Beattie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-9e3b7bb51f09df::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Charles Beattie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Charles Beattie is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chia-Chun Hung

Chia-Chun Hung is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Chia-Chun Hung is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-4d4ee9cb14d925::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Chia-Chun Hung is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Chia-Chun Hung is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chin-Wei Huang

Chin-Wei Huang is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chin-Wei Huang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-5c3bc116a956e7::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chin-Wei Huang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chin-Wei Huang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chongli Qin

Chongli Qin is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Chongli Qin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-846019defb2304::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Chongli Qin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Chongli Qin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris J. Maddison

Chris J. Maddison is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Chris J. Maddison is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-chrisjmaddison::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Chris J. Maddison is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Chris J. Maddison is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chun-Chieh Wu

Chun-Chieh Wu is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Chun-Chieh Wu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-a129e15e594405::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Chun-Chieh Wu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Chun-Chieh Wu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chunlei Yang

Chunlei Yang is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chunlei Yang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-0ead063aeadaea::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chunlei Yang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Chunlei Yang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Clemens Meyer

Clemens Meyer is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Clemens Meyer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-38e036c918a941::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Clemens Meyer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Clemens Meyer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cristian Bodnar

Cristian Bodnar is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Cristian Bodnar is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-e477fff5654837::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Cristian Bodnar is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Cristian Bodnar is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Toker

Daniel Toker is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Daniel Toker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-6edfe959aed821::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Daniel Toker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Daniel Toker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Zheng

Daniel Zheng is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Daniel Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-c07225328a5cfb::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Daniel Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Daniel Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Darío Urbina-Meléndez

Darío Urbina-Meléndez is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Darío Urbina-Meléndez is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-3df8f9eb25d5e6::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Darío Urbina-Meléndez is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Darío Urbina-Meléndez is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David A. Evans

David A. Evans is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. David A. Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-98b9f658310691::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. David A. Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. David A. Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Baker

David Baker is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Baker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-94b4bbbbde5178::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Baker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Baker is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Juergens

David Juergens is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Juergens is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-6aa28fe67659bf::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Juergens is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. David Juergens is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Reiman

David Reiman is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. David Reiman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-262119264dea05::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. David Reiman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. David Reiman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David T. Jones

David T. Jones is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. David T. Jones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-a1c7693a4d4447::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. David T. Jones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. David T. Jones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dhireesha Kudithipudi

Dhireesha Kudithipudi is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Dhireesha Kudithipudi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-5c2f1b6a09866f::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Dhireesha Kudithipudi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Dhireesha Kudithipudi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dominic Masters

Dominic Masters is a listed coauthor of the GenCast weather paper, which trains a probabilistic model on decades of reanalysis data.

The model produces an ensemble of possible global weather trajectories over fifteen days rather than a single deterministic forecast.

The paper compares its forecasts with the ECMWF ensemble system and reports tests covering extreme weather, cyclone tracks, and wind-power production.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Dominic Masters is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_online_date": "2024/12/04",
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "person-coverage-544f059b11b217::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Dominic Masters is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Dominic Masters is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dominik Grewe

Dominik Grewe is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Dominik Grewe is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-dominikgrewe::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Dominik Grewe is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Dominik Grewe is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Blackiston

Douglas Blackiston is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Douglas Blackiston is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2f6a19f68cfae8::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Douglas Blackiston is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Douglas Blackiston is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Duncan R. Stewart

Duncan R. Stewart is a listed coauthor of the memristor paper, which models memory-dependent resistance through coupled electronic and ionic transport.

Its analytical example relates that behavior to nanoscale systems under an external voltage bias.

The authors connect the model with hysteretic current–voltage behavior in devices such as titanium-dioxide switches, linking a circuit concept to physical mechanisms.

Sources and details

The missing memristor found

{
  "access_scope": "Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Duncan R. Stewart is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "authors_in_source_order": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "dates": {
    "Accepted": "17 March 2008",
    "Issue date": "01 May 2008",
    "Received": "06 December 2007",
    "citation_dates": [
      "2008/05"
    ],
    "citation_publication_date": "2008/05",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:13:36.671071+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-cec9eaf2637f98::S1",
  "title": "The missing memristor found",
  "url": "https://www.nature.com/articles/nature06932"
}

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Duncan R. Stewart is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Duncan R. Stewart is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward Hughes

Edward Hughes is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Hughes is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-da3c1e51b9341e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Hughes is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Hughes is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward Lockhart

Edward Lockhart is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Lockhart is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-f713e173e9ca3b::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Lockhart is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Edward Lockhart is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eirini Arvaniti

Eirini Arvaniti is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Eirini Arvaniti is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-3c86ca93c6196a::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Eirini Arvaniti is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Eirini Arvaniti is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ekin Dogus Cubuk

Ekin Dogus Cubuk is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Ekin Dogus Cubuk is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-ada23ed9461b30::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Ekin Dogus Cubuk is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Ekin Dogus Cubuk is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elizabeth Heider

Elizabeth Heider is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Elizabeth Heider is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-9b9faaa7e3b870::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Elizabeth Heider is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Elizabeth Heider is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ellen Clancy

Ellen Clancy is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Ellen Clancy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-6eba7458c3e4ad::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Ellen Clancy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Ellen Clancy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ellen D. Zhong

Ellen D. Zhong is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ellen D. Zhong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-fdd9b17086f277::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ellen D. Zhong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Ellen D. Zhong is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emile Mathieu

Emile Mathieu is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Emile Mathieu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b5ea5fcee7c228::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Emile Mathieu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Emile Mathieu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emilien Dupont

Emilien Dupont is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Emilien Dupont is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-df2c10e2d799bf::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Emilien Dupont is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Emilien Dupont is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Wieser

Eric Wieser is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Eric Wieser is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-a8c02efb56d1b3::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Eric Wieser is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Eric Wieser is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fabian B. Fuchs

Fabian B. Fuchs is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Fabian B. Fuchs is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-f08c6dc732a03b::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Fabian B. Fuchs is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Fabian B. Fuchs is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fabian Pedregosa

Fabian Pedregosa is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Fabian Pedregosa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-57e79a343e78ad::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Fabian Pedregosa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Fabian Pedregosa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Felix Wang

Felix Wang is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Felix Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-dbce818d4f9045::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Felix Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Felix Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Firas Khatib

Firas Khatib is a listed coauthor of the Foldit protein-structure paper, which turns structure refinement into an online multiplayer game.

Players manipulate protein structures with direct tools and adapted Rosetta algorithms, competing and collaborating to improve computed energy.

The paper reports that players also develop search strategies, combining human visual problem solving with computational structure-prediction methods.

Sources and details

Predicting protein structures with a multiplayer online game

{
  "access_scope": "Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Firas Khatib is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "authors_in_source_order": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "dates": {
    "citation_publication_date": "2010/08",
    "retrieved_utc": "2026-10-07T18:13:39.302585+00:00"
  },
  "id": "person-coverage-875629123957c8::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Predicting protein structures with a multiplayer online game",
  "url": "https://www.nature.com/articles/nature09304"
}

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Firas Khatib is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Firas Khatib is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Francisco J. R. Ruiz

Francisco J. R. Ruiz is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Francisco J. R. Ruiz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-bb75d254753b00::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Francisco J. R. Ruiz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Francisco J. R. Ruiz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Francisco J. Valero-Cuevas

Francisco J. Valero-Cuevas is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Francisco J. Valero-Cuevas is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-9502678e38f369::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Francisco J. Valero-Cuevas is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Francisco J. Valero-Cuevas is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank DiMaio

Frank DiMaio is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Frank DiMaio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-8818a8c2fef9bb::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Frank DiMaio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Frank DiMaio is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gido M. van de Ven

Gido M. van de Ven is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Gido M. van de Ven is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c731998c260786::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Gido M. van de Ven is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Gido M. van de Ven is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Goran Žužić

Goran Žužić is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Goran Žužić is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-7900b974d50c7c::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Goran Žužić is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Goran Žužić is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gowoon Cheon

Gowoon Cheon is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Gowoon Cheon is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-37747395ba0c9d::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Gowoon Cheon is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Gowoon Cheon is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gregory S. Snider

Gregory S. Snider is a listed coauthor of the memristor paper, which models memory-dependent resistance through coupled electronic and ionic transport.

Its analytical example relates that behavior to nanoscale systems under an external voltage bias.

The authors connect the model with hysteretic current–voltage behavior in devices such as titanium-dioxide switches, linking a circuit concept to physical mechanisms.

Sources and details

The missing memristor found

{
  "access_scope": "Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Gregory S. Snider is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "authors_in_source_order": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "dates": {
    "Accepted": "17 March 2008",
    "Issue date": "01 May 2008",
    "Received": "06 December 2007",
    "citation_dates": [
      "2008/05"
    ],
    "citation_publication_date": "2008/05",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:13:36.671071+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-33e42b95bed55a::S1",
  "title": "The missing memristor found",
  "url": "https://www.nature.com/articles/nature06932"
}

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Gregory S. Snider is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. Gregory S. Snider is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Griffin Mooers

Griffin Mooers is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Griffin Mooers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-8893d3cae11312::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Griffin Mooers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Griffin Mooers is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Grzegorz Swirszcz

Grzegorz Swirszcz is a listed coauthor of the AlphaTensor paper, which frames matrix-multiplication algorithm discovery as a reinforcement-learning game.

The agent searches for tensor decompositions within a finite factor space, making correctness part of the mathematical formulation.

The authors explore both operation-count improvements and runtime optimization for particular hardware, treating efficiency as dependent on the chosen criterion.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Grzegorz Swirszcz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alhussein Fawzi",
    "Matej Balog",
    "Aja Huang",
    "Thomas Hubert",
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Francisco J. R. Ruiz",
    "Julian Schrittwieser",
    "Grzegorz Swirszcz",
    "David Silver",
    "Demis Hassabis",
    "Pushmeet Kohli"
  ],
  "authors_in_source_order": [
    "Alhussein Fawzi",
    "Matej Balog",
    "Aja Huang",
    "Thomas Hubert",
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Francisco J. R. Ruiz",
    "Julian Schrittwieser",
    "Grzegorz Swirszcz",
    "David Silver",
    "Demis Hassabis",
    "Pushmeet Kohli"
  ],
  "dates": {
    "Accepted": "02 August 2022",
    "Issue date": "06 October 2022",
    "Published": "05 October 2022",
    "Received": "02 October 2021",
    "Version of record": "05 October 2022",
    "citation_dates": [
      "2022/10"
    ],
    "citation_publication_date": "2022/10",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.010377+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c06aa97a64fad1::S1",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Grzegorz Swirszcz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Discovering faster matrix multiplication algorithms with reinforcement learning. Algorithmic findings are bounded to the matrix sizes, finite fields and hardware settings reported, not a uniformly optimal multiplication algorithm. Grzegorz Swirszcz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Haiyu Dong

Haiyu Dong is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Haiyu Dong is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-a7af7a416036c3::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Haiyu Dong is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Haiyu Dong is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hannah Gladman

Hannah Gladman is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Hannah Gladman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-f19239fc84e716::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Hannah Gladman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Hannah Gladman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hannes Schulz

Hannes Schulz is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Hannes Schulz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-56740171a3f648::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Hannes Schulz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Hannes Schulz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hava Siegelmann

Hava Siegelmann is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Hava Siegelmann is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-0f4a3303472b2b::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Hava Siegelmann is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Hava Siegelmann is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Helen E. Eisenach

Helen E. Eisenach is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Helen E. Eisenach is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-a8ff9f5d032b41::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Helen E. Eisenach is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Helen E. Eisenach is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henryk Michalewski

Henryk Michalewski is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Henryk Michalewski is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-d73f24a60152da::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Henryk Michalewski is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Henryk Michalewski is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hiroyuki Miyamoto

Hiroyuki Miyamoto is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Hiroyuki Miyamoto is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-54ce31fafb270f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Hiroyuki Miyamoto is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Hiroyuki Miyamoto is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hugo Penedones

Hugo Penedones is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Hugo Penedones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-d91dbfe9b8c141::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Hugo Penedones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Hugo Penedones is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hussain Masoom

Hussain Masoom is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Hussain Masoom is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-50860918e028c7::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Hussain Masoom is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Hussain Masoom is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Langmore

Ian Langmore is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Ian Langmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-521212669c9ed2::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Ian Langmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Ian Langmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ilan Price

Ilan Price is a listed coauthor of the GenCast weather paper, which trains a probabilistic model on decades of reanalysis data.

The model produces an ensemble of possible global weather trajectories over fifteen days rather than a single deterministic forecast.

The paper compares its forecasts with the ECMWF ensemble system and reports tests covering extreme weather, cyclone tracks, and wind-power production.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Ilan Price is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_online_date": "2024/12/04",
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "person-coverage-d58cc48ca402fb::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Ilan Price is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Ilan Price is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ingrid von Glehn

Ingrid von Glehn is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ingrid von Glehn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-e900a85afda7b1::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ingrid von Glehn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ingrid von Glehn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Isaac Sappington

Isaac Sappington is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Isaac Sappington is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-1f91de08b84fec::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Isaac Sappington is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Isaac Sappington is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Iuliya Beloshapka

Iuliya Beloshapka is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Iuliya Beloshapka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-4f9712470863b4::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Iuliya Beloshapka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Iuliya Beloshapka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack Dunger

Jack Dunger is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Jack Dunger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-a790599a889b6d::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Jack Dunger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Jack Dunger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jakub Figura

Jakub Figura is a listed coauthor of a conceptual article arguing against attributing consciousness to present or foreseeable computer algorithms.

The authors challenge inferences drawn from fluent language and compare assumptions about software with claims about biological substrates.

They describe fictional expectations and probabilistic language as routes to misleading attribution, presenting an argued position in the consciousness debate.

Sources and details

There is no such thing as conscious artificial intelligence

{
  "access_scope": "Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Jakub Figura is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "authors_in_source_order": [
    "Andrzej Porębski",
    "Jakub Figura"
  ],
  "dates": {
    "Accepted": "01 September 2025",
    "Published": "28 October 2025",
    "Received": "15 May 2025",
    "Version of record": "28 October 2025",
    "citation_dates": [],
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:16:17.478716+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-85ed82868d5849::S1",
  "title": "There is no such thing as conscious artificial intelligence",
  "url": "https://www.nature.com/articles/s41599-025-05868-8"
}

Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Jakub Figura is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of There is no such thing as conscious artificial intelligence. The article’s denial of conscious AI is the authors’ conceptual thesis, not settled consensus or an empirical test excluding every possible machine consciousness. Jakub Figura is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Kirkpatrick

James Kirkpatrick is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. James Kirkpatrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-50ed642874c341::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. James Kirkpatrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. James Kirkpatrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Lottes

James Lottes is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. James Lottes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-268068913c7f3c::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. James Lottes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. James Lottes is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jamie Smith

Jamie Smith is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Jamie Smith is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-684564f0e3d807::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Jamie Smith is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Jamie Smith is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Janni Yuval

Janni Yuval is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Janni Yuval is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e2d62fe51807ac::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Janni Yuval is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Janni Yuval is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jasmine A. Thum

Jasmine A. Thum is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jasmine A. Thum is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-43339c36a68115::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jasmine A. Thum is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jasmine A. Thum is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jason Yim

Jason Yim is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jason Yim is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-756ad25b4b8eab::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jason Yim is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jason Yim is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jayesh K. Gupta

Jayesh K. Gupta is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jayesh K. Gupta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-4ecc27bc2580b6::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jayesh K. Gupta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jayesh K. Gupta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeff Clune

Jeff Clune is a listed coauthor of First return, then explore, which introduces Go-Explore for reinforcement learning with sparse or misleading rewards.

The approach records promising states, returns to them, and then deliberately explores further, addressing loss of access to previously reached states.

The paper reports hard-exploration Atari and simulated pick-and-place results and describes a goal-conditioned policy for handling stochasticity during training.

Sources and details

First return, then explore

{
  "access_scope": "Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Jeff Clune is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "authors_in_source_order": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "dates": {
    "citation_online_date": "2021/02/24",
    "citation_publication_date": "2021/02",
    "retrieved_utc": "2026-10-07T18:11:37.396554+00:00"
  },
  "id": "person-coverage-044e4eb9e2acc0::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "First return, then explore",
  "url": "https://www.nature.com/articles/s41586-020-03157-9"
}

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Jeff Clune is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Jeff Clune is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeffrey L. Krichmar

Jeffrey L. Krichmar is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jeffrey L. Krichmar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-973dcfe0dcd461::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jeffrey L. Krichmar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jeffrey L. Krichmar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jessica Yung

Jessica Yung is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Jessica Yung is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-455c6ee2692e7b::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Jessica Yung is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Jessica Yung is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jing Guang

Jing Guang is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jing Guang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-f8a16219d47813::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jing Guang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jing Guang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jitka Annen

Jitka Annen is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jitka Annen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-0bcccef883531d::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jitka Annen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Jitka Annen is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joel Lehman

Joel Lehman is a listed coauthor of First return, then explore, which introduces Go-Explore for reinforcement learning with sparse or misleading rewards.

The approach records promising states, returns to them, and then deliberately explores further, addressing loss of access to previously reached states.

The paper reports hard-exploration Atari and simulated pick-and-place results and describes a goal-conditioned policy for handling stochasticity during training.

Sources and details

First return, then explore

{
  "access_scope": "Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joel Lehman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "authors_in_source_order": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "dates": {
    "citation_online_date": "2021/02/24",
    "citation_publication_date": "2021/02",
    "retrieved_utc": "2026-10-07T18:11:37.396554+00:00"
  },
  "id": "person-coverage-19eec6da3819ed::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "First return, then explore",
  "url": "https://www.nature.com/articles/s41586-020-03157-9"
}

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joel Lehman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joel Lehman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Johannes Brandstetter

Johannes Brandstetter is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Johannes Brandstetter is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-2a84f47b3e8ca9::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Johannes Brandstetter is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Johannes Brandstetter is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John M. Jumper

John M. Jumper is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. John M. Jumper is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-a4f60a31cba8d3::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. John M. Jumper is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. John M. Jumper is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Nham

John Nham is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. John Nham is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-johnnham::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. John Nham is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. John Nham is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonas Adler

Jonas Adler is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Jonas Adler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-3e5e7dc6b1a61e::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Jonas Adler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Jonas Adler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan A. Weyn

Jonathan A. Weyn is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jonathan A. Weyn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-13e1cbaf3f306e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jonathan A. Weyn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Jonathan A. Weyn is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Babb

Jonathan Babb is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jonathan Babb is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-10db1ff553ffb7::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jonathan Babb is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Jonathan Babb is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Crabbé

Jonathan Crabbé is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Jonathan Crabbé is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-429515a5dfb96f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Jonathan Crabbé is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Jonathan Crabbé is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joost Huizinga

Joost Huizinga is a listed coauthor of First return, then explore, which introduces Go-Explore for reinforcement learning with sparse or misleading rewards.

The approach records promising states, returns to them, and then deliberately explores further, addressing loss of access to previously reached states.

The paper reports hard-exploration Atari and simulated pick-and-place results and describes a goal-conditioned policy for handling stochasticity during training.

Sources and details

First return, then explore

{
  "access_scope": "Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joost Huizinga is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "authors_in_source_order": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "dates": {
    "citation_online_date": "2021/02/24",
    "citation_publication_date": "2021/02",
    "retrieved_utc": "2026-10-07T18:11:37.396554+00:00"
  },
  "id": "person-coverage-25014eab5915a5::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "First return, then explore",
  "url": "https://www.nature.com/articles/s41586-020-03157-9"
}

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joost Huizinga is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Joost Huizinga is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jordan S. Ellenberg

Jordan S. Ellenberg is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Jordan S. Ellenberg is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-a082830ae50628::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Jordan S. Ellenberg is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Jordan S. Ellenberg is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph L. Watson

Joseph L. Watson is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Joseph L. Watson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b91ce7abfcb85d::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Joseph L. Watson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Joseph L. Watson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Josh Abramson

Josh Abramson is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Josh Abramson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-4e6c08d2d393ae::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Josh Abramson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Josh Abramson is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Josh Bongard

Josh Bongard is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Josh Bongard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-4784ac208ff6d1::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Josh Bongard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Josh Bongard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua Bambrick

Joshua Bambrick is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Joshua Bambrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-353e19dd39f292::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Joshua Bambrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Joshua Bambrick is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua T. Vogelstein

Joshua T. Vogelstein is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Joshua T. Vogelstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b2c33d5ac7bc21::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Joshua T. Vogelstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Joshua T. Vogelstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jue Wang

Jue Wang is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jue Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-5f969cf675ffac::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jue Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Jue Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kathryn Tunyasuvunakool

Kathryn Tunyasuvunakool is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Kathryn Tunyasuvunakool is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e71aed7d796679::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Kathryn Tunyasuvunakool is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Kathryn Tunyasuvunakool is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kazuhiro Yamakawa

Kazuhiro Yamakawa is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Kazuhiro Yamakawa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-594f37ace4773e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Kazuhiro Yamakawa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Kazuhiro Yamakawa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kenneth O. Stanley

Kenneth O. Stanley is a listed coauthor of First return, then explore, which introduces Go-Explore for reinforcement learning with sparse or misleading rewards.

The approach records promising states, returns to them, and then deliberately explores further, addressing loss of access to previously reached states.

The paper reports hard-exploration Atari and simulated pick-and-place results and describes a goal-conditioned policy for handling stochasticity during training.

Sources and details

First return, then explore

{
  "access_scope": "Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Kenneth O. Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "authors_in_source_order": [
    "Ecoffet, Adrien",
    "Huizinga, Joost",
    "Lehman, Joel",
    "Stanley, Kenneth O.",
    "Clune, Jeff"
  ],
  "dates": {
    "citation_online_date": "2021/02/24",
    "citation_publication_date": "2021/02",
    "retrieved_utc": "2026-10-07T18:11:37.396554+00:00"
  },
  "id": "person-coverage-8b0faed82e8023::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "First return, then explore",
  "url": "https://www.nature.com/articles/s41586-020-03157-9"
}

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Kenneth O. Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: First return, then explore. Go-Explore abstract, Atari exploration and simulated robotics reports; goal-conditioned extension distinguished from the basic remember-return-explore principle. Kenneth O. Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kit Thambiratnam

Kit Thambiratnam is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Kit Thambiratnam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-76afef028739b7::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Kit Thambiratnam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Kit Thambiratnam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kuba Perlin

Kuba Perlin is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Kuba Perlin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-da780667a960d0::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Kuba Perlin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Kuba Perlin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Laurent Sartran

Laurent Sartran is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Laurent Sartran is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-18de204715d245::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Laurent Sartran is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Laurent Sartran is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lea Pradella

Lea Pradella is a listed coauthor of a cross-national study of political hostility experienced on social media.

Quota-sampled surveys across thirty countries compare reported online hostility with democratic conditions, economic equality and respondents’ status-seeking motivations.

The authors connect those observations with offline hostility and wider societal tensions, treating the associations as evidence about context rather than a randomized intervention.

Sources and details

Social media users experience more political hostility in less economically equal and less democratic societies

{
  "access_scope": "Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Lea Pradella is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "authors_in_source_order": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "dates": {
    "Accepted": "24 February 2026",
    "Issue date": "June 2026",
    "Published": "03 April 2026",
    "Received": "24 April 2024",
    "Version of record": "03 April 2026",
    "citation_dates": [
      "2026/06"
    ],
    "citation_publication_date": "2026/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:15:08.950578+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-d656f89709bcb1::S1",
  "title": "Social media users experience more political hostility in less economically equal and less democratic societies",
  "url": "https://www.nature.com/articles/s41562-026-02432-5"
}

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Lea Pradella is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Lea Pradella is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lei Yu

Lei Yu is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Lei Yu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-7815f9dbba281e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Lei Yu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Lei Yu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leslie Kay

Leslie Kay is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Leslie Kay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c97551fab6e8e3::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Leslie Kay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Leslie Kay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lianmin Zheng

Lianmin Zheng is a listed coauthor of the PagedAttention paper, which addresses memory waste when serving many language-model requests.

Its attention algorithm borrows paging concepts from operating systems to manage dynamically changing key-value caches.

The vLLM system built around that algorithm supports cache sharing within and across requests, with reported throughput comparisons at matched latency.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": "Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Lianmin Zheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "authors_in_source_order": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "citation_date": "2023/09/12",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.888714+00:00",
    "version": "arXiv v1"
  },
  "id": "person-lianminzheng::S1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/abs/2309.06180",
  "version_url": "https://arxiv.org/abs/2309.06180v1"
}

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Lianmin Zheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Lianmin Zheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lindsay Willmore

Lindsay Willmore is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Lindsay Willmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-7a9505585b5d16::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Lindsay Willmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Lindsay Willmore is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lukas F. Milles

Lukas F. Milles is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Lukas F. Milles is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e808aac476a481::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Lukas F. Milles is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Lukas F. Milles is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

M. Pawan Kumar

M. Pawan Kumar is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. M. Pawan Kumar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-89c5e0e73954d2::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. M. Pawan Kumar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. M. Pawan Kumar is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Madeleine Leach

Madeleine Leach is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Madeleine Leach is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-madeleineleach::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Madeleine Leach is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Madeleine Leach is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maik Riechert

Maik Riechert is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Maik Riechert is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-0dfce7ba1cb77f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Maik Riechert is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Maik Riechert is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marc G. Bellemare

Marc G. Bellemare is a listed coauthor of the Arcade Learning Environment paper, which introduces an interface and evaluation methodology for Atari 2600 game agents.

Its shared platform exposes varied games as challenges for reinforcement learning, planning and transfer across domains.

The authors illustrate the methodology with benchmark agents and results on more than fifty-five games, separating a comparative testbed from a claim that any agent is generally intelligent.

Sources and details

The Arcade Learning Environment: An Evaluation Platform for General Agents

{
  "access_scope": "Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Marc G. Bellemare is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "authors_in_source_order": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "dates": {
    "citation_date": "2012/07/19",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 21 Jun 2013 18:07:06 UTC (178 KB)",
    "original_submission": "Thu, 19 Jul 2012 15:33:25 UTC (164 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.622531+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-8cd786ecb5c2d0::S1",
  "title": "The Arcade Learning Environment: An Evaluation Platform for General Agents",
  "url": "https://arxiv.org/abs/1207.4708",
  "version_url": "https://arxiv.org/abs/1207.4708v2"
}

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Marc G. Bellemare is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Marc G. Bellemare is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mario Aguilar-Simon

Mario Aguilar-Simon is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Mario Aguilar-Simon is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-1707bc54a897a9::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Mario Aguilar-Simon is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Mario Aguilar-Simon is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mark Rowland

Mark Rowland is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Mark Rowland is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-537177dfdbc908::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Mark Rowland is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Mark Rowland is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin M. Monti

Martin M. Monti is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Martin M. Monti is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-d482331bd50c3f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Martin M. Monti is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Martin M. Monti is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin Steinegger

Martin Steinegger is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Martin Steinegger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-3c5b8c7ac65f7d::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Martin Steinegger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Martin Steinegger is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matej Balog

Matej Balog is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Matej Balog is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-cc813a4fc15254::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Matej Balog is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Matej Balog is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maxim Bazhenov

Maxim Bazhenov is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Maxim Bazhenov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-eb2454d5ee229b::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Maxim Bazhenov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Maxim Bazhenov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Megan Stanley

Megan Stanley is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Megan Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-e31793b7bf3ad0::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Megan Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Megan Stanley is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Bang Petersen

Michael Bang Petersen is a listed coauthor of a cross-national study of political hostility experienced on social media.

Quota-sampled surveys across thirty countries compare reported online hostility with democratic conditions, economic equality and respondents’ status-seeking motivations.

The authors connect those observations with offline hostility and wider societal tensions, treating the associations as evidence about context rather than a randomized intervention.

Sources and details

Social media users experience more political hostility in less economically equal and less democratic societies

{
  "access_scope": "Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Michael Bang Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "authors_in_source_order": [
    "Alexander Bor",
    "Antoine Marie",
    "Lea Pradella",
    "Michael Bang Petersen"
  ],
  "dates": {
    "Accepted": "24 February 2026",
    "Issue date": "June 2026",
    "Published": "03 April 2026",
    "Received": "24 April 2024",
    "Version of record": "03 April 2026",
    "citation_dates": [
      "2026/06"
    ],
    "citation_publication_date": "2026/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:15:08.950578+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-5984f86d56f0ce::S1",
  "title": "Social media users experience more political hostility in less economically equal and less democratic societies",
  "url": "https://www.nature.com/articles/s41562-026-02432-5"
}

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Michael Bang Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Social media users experience more political hostility in less economically equal and less democratic societies. The observational, self-report study supports associations within its sample, not causal effects of democracy or economic inequality on any particular user. Michael Bang Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Bowling

Michael Bowling is a listed coauthor of the Arcade Learning Environment paper, which introduces an interface and evaluation methodology for Atari 2600 game agents.

Its shared platform exposes varied games as challenges for reinforcement learning, planning and transfer across domains.

The authors illustrate the methodology with benchmark agents and results on more than fifty-five games, separating a comparative testbed from a claim that any agent is generally intelligent.

Sources and details

The Arcade Learning Environment: An Evaluation Platform for General Agents

{
  "access_scope": "Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Michael Bowling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "authors_in_source_order": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "dates": {
    "citation_date": "2012/07/19",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 21 Jun 2013 18:07:06 UTC (178 KB)",
    "original_submission": "Thu, 19 Jul 2012 15:33:25 UTC (164 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.622531+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-b587ffc64fe817::S1",
  "title": "The Arcade Learning Environment: An Evaluation Platform for General Agents",
  "url": "https://arxiv.org/abs/1207.4708",
  "version_url": "https://arxiv.org/abs/1207.4708v2"
}

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Michael Bowling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Michael Bowling is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Figurnov

Michael Figurnov is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michael Figurnov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-3096586362da23::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michael Figurnov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michael Figurnov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Levin

Michael Levin is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Michael Levin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2d2fc7d2266eda::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Michael Levin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Michael Levin is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael O’Neill

Michael O’Neill is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Michael O’Neill is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-37684842bdb2fb::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Michael O’Neill is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Michael O’Neill is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael P. Brenner

Michael P. Brenner is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Michael P. Brenner is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e0d882add0a6a8::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Michael P. Brenner is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Michael P. Brenner is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michal Zielinski

Michal Zielinski is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michal Zielinski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c02ffbb0af055d::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michal Zielinski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michal Zielinski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michalina Pacholska

Michalina Pacholska is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michalina Pacholska is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-76db07d00deb80::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michalina Pacholska is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Michalina Pacholska is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miklós Z. Horváth

Miklós Z. Horváth is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Miklós Z. Horváth is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-787ee9a8f295c7::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Miklós Z. Horváth is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Miklós Z. Horváth is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Milan Klöwer

Milan Klöwer is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Milan Klöwer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-22c449902b04bf::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Milan Klöwer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Milan Klöwer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miles Congreve

Miles Congreve is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Miles Congreve is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-76abac82edbc7f::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Miles Congreve is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Miles Congreve is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Minkyung Baek

Minkyung Baek is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Minkyung Baek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-0f3086069544c3::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Minkyung Baek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Minkyung Baek is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mohammadamin Barekatain

Mohammadamin Barekatain is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Mohammadamin Barekatain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-a8b1c0f2047e0e::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Mohammadamin Barekatain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Mohammadamin Barekatain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Muratahan Aykol

Muratahan Aykol is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Muratahan Aykol is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-e337aab7e5db9f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Muratahan Aykol is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Muratahan Aykol is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nader Pouratian

Nader Pouratian is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Nader Pouratian is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-280becf407a293::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Nader Pouratian is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Nader Pouratian is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nal Kalchbrenner

Nal Kalchbrenner is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Nal Kalchbrenner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-nalkalchbrenner::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Nal Kalchbrenner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Nal Kalchbrenner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nathaniel R. Bennett

Nathaniel R. Bennett is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nathaniel R. Bennett is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-8d16cf5a7abb60::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nathaniel R. Bennett is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nathaniel R. Bennett is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicholas Ketz

Nicholas Ketz is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Ketz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-1577a7f6567f0e::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Ketz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Ketz is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicholas Soures

Nicholas Soures is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Soures is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-059808b1b68240::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Soures is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nicholas Soures is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nick Cheney

Nick Cheney is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nick Cheney is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-336c1564cd72ea::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nick Cheney is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Nick Cheney is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicolas Sonnerat

Nicolas Sonnerat is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Nicolas Sonnerat is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-59439978328046::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Nicolas Sonnerat is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Nicolas Sonnerat is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nikita Hanikel

Nikita Hanikel is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nikita Hanikel is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b745d80484acd4::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nikita Hanikel is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Nikita Hanikel is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nitish Srivastava

Nitish Srivastava is a listed coauthor of the Dropout paper, which randomly removes neural-network units and connections during training to reduce overfitting.

This process samples many smaller networks and limits excessive co-adaptation among units.

At test time, a single full network with reduced weights approximates averaging those smaller networks, with the paper evaluating several supervised-learning domains.

Sources and details

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

{
  "access_scope": "Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Nitish Srivastava is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "authors_in_source_order": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "dates": {
    "citation_publication_date": "2014",
    "retrieved_utc": "2026-10-07T17:55:13.021052+00:00"
  },
  "id": "person-coverage-df9b12bf7cd5da::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Dropout: A Simple Way to Prevent Neural Networks from Overfitting",
  "url": "https://jmlr.org/papers/v15/srivastava14a.html"
}

Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Nitish Srivastava is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Nitish Srivastava is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oliver Nash

Oliver Nash is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Oliver Nash is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-bc7346dfa4c3da::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Oliver Nash is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Oliver Nash is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Omar Fawzi

Omar Fawzi is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Omar Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-ff29f885d317df::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Omar Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Omar Fawzi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ottavia Bertolli

Ottavia Bertolli is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ottavia Bertolli is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-5a38c21c121201::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ottavia Bertolli is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Ottavia Bertolli is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paris Perdikaris

Paris Perdikaris is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Paris Perdikaris is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-8b0cf2f6d8f2f9::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Paris Perdikaris is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Paris Perdikaris is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pascal Savy

Pascal Savy is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Pascal Savy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-685d625e7a037d::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Pascal Savy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Pascal Savy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pascal Vincent

Pascal Vincent is a listed coauthor of A Neural Probabilistic Language Model, which learns word representations together with probabilities for word sequences.

Nearby representations let observed sentences inform the model about similar but unseen sequences, addressing sparse coverage of possible word combinations.

The paper evaluates neural probability models on two text corpora against n-gram baselines and examines benefits from longer contexts.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Pascal Vincent is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "authors_in_source_order": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T18:21:16.130617+00:00"
  },
  "id": "person-local-pascalvincent::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://www.jmlr.org/papers/v3/bengio03a.html"
}

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Pascal Vincent is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Pascal Vincent is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Garvan

Patrick Garvan is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Patrick Garvan is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-b0a6c17ef30d63::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Patrick Garvan is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Patrick Garvan is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Barham

Paul Barham is a listed coauthor of TensorFlow: A system for large-scale machine learning, which represents computation and mutable shared state with dataflow graphs.

The system places graph operations across machines and heterogeneous processors, including CPUs, GPUs, and tensor-processing chips.

The paper describes this graph-based organization as enabling developers to experiment with training algorithms and state-management choices, with demonstrations on selected applications.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Paul Barham is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "authors_in_source_order": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "dates": {
    "citation_date": "2016/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 31 May 2016 19:46:10 UTC (308 KB)",
    "original_submission": "Fri, 27 May 2016 15:49:50 UTC (308 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.245163+00:00",
    "version": "arXiv v2"
  },
  "id": "person-paulbarham::S1",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695",
  "version_url": "https://arxiv.org/abs/1605.08695v2"
}

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Paul Barham is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Paul Barham is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Lezeau

Paul Lezeau is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Paul Lezeau is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-488fad03389784::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Paul Lezeau is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Paul Lezeau is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul M. Vespa

Paul M. Vespa is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Paul M. Vespa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-b1401ed3f215e4::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Paul M. Vespa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Paul M. Vespa is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pengming Wang

Pengming Wang is a listed coauthor of the FunSearch paper, which pairs a pre-trained language model with an evaluator in an evolutionary program-search procedure.

It searches for programs describing how to solve a problem, rather than only searching directly for a final answer.

The authors test the approach on cap-set constructions and online bin-packing heuristics, using evaluation to filter candidate programs and expose useful discoveries.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Pengming Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "authors_in_source_order": [
    "Bernardino Romera-Paredes",
    "Mohammadamin Barekatain",
    "Alexander Novikov",
    "Matej Balog",
    "M. Pawan Kumar",
    "Emilien Dupont",
    "Francisco J. R. Ruiz",
    "Jordan S. Ellenberg",
    "Pengming Wang",
    "Omar Fawzi",
    "Pushmeet Kohli",
    "Alhussein Fawzi"
  ],
  "dates": {
    "Accepted": "30 November 2023",
    "Issue date": "18 January 2024",
    "Published": "14 December 2023",
    "Received": "12 August 2023",
    "Version of record": "11 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-ab9a2fa0244b27::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Pengming Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Mathematical discoveries from program search with large language models. Reported discoveries concern the selected combinatorial and algorithmic problems; an evaluator does not guarantee correctness for arbitrary generated programs. Pengming Wang is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pete Warden

Pete Warden is a listed coauthor of TensorFlow: A system for large-scale machine learning, which represents computation and mutable shared state with dataflow graphs.

The system places graph operations across machines and heterogeneous processors, including CPUs, GPUs, and tensor-processing chips.

The paper describes this graph-based organization as enabling developers to experiment with training algorithms and state-management choices, with demonstrations on selected applications.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Pete Warden is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "authors_in_source_order": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "dates": {
    "citation_date": "2016/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 31 May 2016 19:46:10 UTC (308 KB)",
    "original_submission": "Fri, 27 May 2016 15:49:50 UTC (308 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.245163+00:00",
    "version": "arXiv v2"
  },
  "id": "person-petewarden::S1",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695",
  "version_url": "https://arxiv.org/abs/1605.08695v2"
}

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Pete Warden is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Pete Warden is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Düben

Peter Düben is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Düben is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-25884e5ae8b959::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Düben is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Düben is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Helfer

Peter Helfer is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Peter Helfer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-7bebe0097aa80e::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Peter Helfer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Peter Helfer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Norgaard

Peter Norgaard is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Norgaard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2d3523ed399321::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Norgaard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Peter Norgaard is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Praveen K. Pilly

Praveen K. Pilly is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Praveen K. Pilly is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c8615536fddd9d::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Praveen K. Pilly is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Praveen K. Pilly is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Preetham Venkatesh

Preetham Venkatesh is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Preetham Venkatesh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-f1e96c3c016e5e::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Preetham Venkatesh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Preetham Venkatesh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pushmeet Kohli

Pushmeet Kohli is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Pushmeet Kohli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-9f4c19fe40efe2::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Pushmeet Kohli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Pushmeet Kohli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

R. Stanley Williams

R. Stanley Williams is a listed coauthor of the memristor paper, which models memory-dependent resistance through coupled electronic and ionic transport.

Its analytical example relates that behavior to nanoscale systems under an external voltage bias.

The authors connect the model with hysteretic current–voltage behavior in devices such as titanium-dioxide switches, linking a circuit concept to physical mechanisms.

Sources and details

The missing memristor found

{
  "access_scope": "Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. R. Stanley Williams is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "authors_in_source_order": [
    "Dmitri B. Strukov",
    "Gregory S. Snider",
    "Duncan R. Stewart",
    "R. Stanley Williams"
  ],
  "dates": {
    "Accepted": "17 March 2008",
    "Issue date": "01 May 2008",
    "Received": "06 December 2007",
    "citation_dates": [
      "2008/05"
    ],
    "citation_publication_date": "2008/05",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:13:36.671071+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-407695b9425ffd::S1",
  "title": "The missing memristor found",
  "url": "https://www.nature.com/articles/nature06932"
}

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. R. Stanley Williams is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of The missing memristor found. The accessible abstract concerns a nanoscale device model and related behavior, not an implemented AI architecture or this coauthor’s sole invention. R. Stanley Williams is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Regina Barzilay

Regina Barzilay is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Regina Barzilay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c7771029596f7c::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Regina Barzilay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Regina Barzilay is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rex Ying

Rex Ying is a listed coauthor of a graph-network simulator paper, which represents physical systems as particles connected through learned message passing.

The framework models interacting fluids, rigid solids and deformable materials from training on single-step dynamics.

The authors investigate longer rollouts and changed particle counts, finding that message-passing depth and noise during training affect accumulated error.

Sources and details

Learning to Simulate Complex Physics with Graph Networks

{
  "access_scope": "Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Rex Ying is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "authors_in_source_order": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "dates": {
    "citation_dates": [
      "2020/11/21"
    ],
    "citation_publication_date": "2020/11/21",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:52.705222+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-df7425ddb9bcf1::S1",
  "title": "Learning to Simulate Complex Physics with Graph Networks",
  "url": "https://proceedings.mlr.press/v119/sanchez-gonzalez20a.html"
}

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Rex Ying is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Rex Ying is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard E. Turner

Richard E. Turner is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Richard E. Turner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-57a37210980594::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Richard E. Turner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Richard E. Turner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Evans

Richard Evans is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Richard Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-5be1d2b8149f81::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Richard Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Richard Evans is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rishi Mehta

Rishi Mehta is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Rishi Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-3171223139e0f6::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Rishi Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Rishi Mehta is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rishub Jain

Rishub Jain is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Rishub Jain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e602af9d8dd747::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Rishub Jain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Rishub Jain is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Risto Miikkulainen

Risto Miikkulainen is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Risto Miikkulainen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-95e279ded2495d::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Risto Miikkulainen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Risto Miikkulainen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert J. Ragotte

Robert J. Ragotte is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Robert J. Ragotte is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-030f76714272d4::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Robert J. Ragotte is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Robert J. Ragotte is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Roberto Sordillo

Roberto Sordillo is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Roberto Sordillo is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-e0ce368bf50f8e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Roberto Sordillo is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Roberto Sordillo is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ron Weiss

Ron Weiss is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ron Weiss is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-cfd1a54db312fc::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ron Weiss is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Ron Weiss is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ronald J. Williams

Ronald J. Williams is a listed coauthor of Learning representations by back-propagating errors, which describes adjusting network weights to reduce the difference between actual and desired outputs.

Through those adjustments, hidden units learn features relevant to the task even though they are outside the input and output layers.

The paper links this feature learning to interactions among hidden units and contrasts it with simpler earlier learning procedures.

Sources and details

Learning representations by back-propagating errors

{
  "access_scope": "Inspected publisher HTML manifestation: Learning representations by back-propagating errors. 1986 article public abstract; described back-propagation procedure and feature-learning argument, not a sole-origin or personal division-of-labor claim. Ronald J. Williams is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Rumelhart, David E.",
    "Hinton, Geoffrey E.",
    "Williams, Ronald J."
  ],
  "authors_in_source_order": [
    "Rumelhart, David E.",
    "Hinton, Geoffrey E.",
    "Williams, Ronald J."
  ],
  "dates": {
    "citation_publication_date": "1986/10",
    "retrieved_utc": "2026-10-07T18:19:28.057389+00:00"
  },
  "id": "person-ronaldjwilliams::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Learning representations by back-propagating errors",
  "url": "https://www.nature.com/articles/323533a0"
}

Inspected publisher HTML manifestation: Learning representations by back-propagating errors. 1986 article public abstract; described back-propagation procedure and feature-learning argument, not a sole-origin or personal division-of-labor claim. Ronald J. Williams is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Learning representations by back-propagating errors. 1986 article public abstract; described back-propagation procedure and feature-learning argument, not a sole-origin or personal division-of-labor claim. Ronald J. Williams is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ruslan Salakhutdinov

Ruslan Salakhutdinov is a listed coauthor of the Dropout paper, which randomly removes neural-network units and connections during training to reduce overfitting.

This process samples many smaller networks and limits excessive co-adaptation among units.

At test time, a single full network with reduced weights approximates averaging those smaller networks, with the paper evaluating several supervised-learning domains.

Sources and details

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

{
  "access_scope": "Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Ruslan Salakhutdinov is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "authors_in_source_order": [
    "Nitish Srivastava",
    "Geoffrey Hinton",
    "Alex Krizhevsky",
    "Ilya Sutskever",
    "Ruslan Salakhutdinov"
  ],
  "dates": {
    "citation_publication_date": "2014",
    "retrieved_utc": "2026-10-07T17:55:13.021052+00:00"
  },
  "id": "person-coverage-e955d24f97dc24::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Dropout: A Simple Way to Prevent Neural Networks from Overfitting",
  "url": "https://jmlr.org/papers/v15/srivastava14a.html"
}

Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Ruslan Salakhutdinov is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Dropout: A Simple Way to Prevent Neural Networks from Overfitting. JMLR Dropout abstract; training-time random removal and test-time approximation distinguished, with reported benchmarks rather than a universal prevention of overfitting. Ruslan Salakhutdinov is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Russ Bates

Russ Bates is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Russ Bates is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-91a79b764e4c53::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Russ Bates is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Russ Bates is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ryota Tomioka

Ryota Tomioka is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Ryota Tomioka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-64314fdbcebe3e::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Ryota Tomioka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Ryota Tomioka is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Réjean Ducharme

Réjean Ducharme is a listed coauthor of A Neural Probabilistic Language Model, which learns word representations together with probabilities for word sequences.

Nearby representations let observed sentences inform the model about similar but unseen sequences, addressing sparse coverage of possible word combinations.

The paper evaluates neural probability models on two text corpora against n-gram baselines and examines benefits from longer contexts.

Sources and details

A Neural Probabilistic Language Model

{
  "access_scope": "Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Réjean Ducharme is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "authors_in_source_order": [
    "Bengio, Yoshua",
    "Ducharme, Réjean",
    "Vincent, Pascal",
    "Jauvin, Christian"
  ],
  "dates": {
    "citation_publication_date": "2003",
    "retrieved_utc": "2026-10-07T18:21:16.130617+00:00"
  },
  "id": "person-local-rejeanducharme::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A Neural Probabilistic Language Model",
  "url": "https://www.jmlr.org/papers/v3/bengio03a.html"
}

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Réjean Ducharme is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A Neural Probabilistic Language Model. JMLR language-model abstract; joint representation/probability learning and two-corpus experiments, not modern-LLM capabilities or a personal invention assignment. Réjean Ducharme is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Salvatore Mercuri

Salvatore Mercuri is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Salvatore Mercuri is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-8182475346ce97::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Salvatore Mercuri is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Salvatore Mercuri is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam Hatfield

Sam Hatfield is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Sam Hatfield is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-c5e405276f39b2::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Sam Hatfield is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Sam Hatfield is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam Kriegman

Sam Kriegman is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sam Kriegman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-142ed219bb2942::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sam Kriegman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sam Kriegman is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuel Albanie

Samuel Albanie is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Samuel Albanie is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-57df5f3d9c231f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Samuel Albanie is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Samuel Albanie is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuel J. Pellock

Samuel J. Pellock is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Samuel J. Pellock is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2d1b8262ea0d2c::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Samuel J. Pellock is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Samuel J. Pellock is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuel S. Schoenholz

Samuel S. Schoenholz is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Samuel S. Schoenholz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-b7cc7724b4d533::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Samuel S. Schoenholz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Samuel S. Schoenholz is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sandeep Madireddy

Sandeep Madireddy is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sandeep Madireddy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-41ca50e69c0f65::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sandeep Madireddy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sandeep Madireddy is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sander Dieleman

Sander Dieleman is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Sander Dieleman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-sanderdieleman::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Sander Dieleman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Sander Dieleman is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sanjay Ghemawat

Sanjay Ghemawat is a listed coauthor of TensorFlow: A system for large-scale machine learning, which represents computation and mutable shared state with dataflow graphs.

The system places graph operations across machines and heterogeneous processors, including CPUs, GPUs, and tensor-processing chips.

The paper describes this graph-based organization as enabling developers to experiment with training algorithms and state-management choices, with demonstrations on selected applications.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sanjay Ghemawat is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "authors_in_source_order": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "dates": {
    "citation_date": "2016/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 31 May 2016 19:46:10 UTC (308 KB)",
    "original_submission": "Fri, 27 May 2016 15:49:50 UTC (308 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.245163+00:00",
    "version": "arXiv v2"
  },
  "id": "person-sanjayghemawat::S1",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695",
  "version_url": "https://arxiv.org/abs/1605.08695v2"
}

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sanjay Ghemawat is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sanjay Ghemawat is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Santosh Manicka

Santosh Manicka is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Santosh Manicka is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-e99088c49eaab7::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Santosh Manicka is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Santosh Manicka is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sarah Lewis

Sarah Lewis is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Sarah Lewis is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-0435a14be82d54::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Sarah Lewis is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Sarah Lewis is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sebastian Bodenstein

Sebastian Bodenstein is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Sebastian Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2e7af166c5a78f::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Sebastian Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Sebastian Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sebastian Risi

Sebastian Risi is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sebastian Risi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-0b083ead19ae73::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sebastian Risi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Sebastian Risi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sebastian W. Bodenstein

Sebastian W. Bodenstein is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sebastian W. Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-772948517a6014::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sebastian W. Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sebastian W. Bodenstein is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sergei Yakneen

Sergei Yakneen is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sergei Yakneen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-bf4d9a9a2fee13::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sergei Yakneen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sergei Yakneen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sergey Ovchinnikov

Sergey Ovchinnikov is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Sergey Ovchinnikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-f49d76ca0ff316::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Sergey Ovchinnikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Sergey Ovchinnikov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Seth Cooper

Seth Cooper is a listed coauthor of the Foldit protein-structure paper, which turns structure refinement into an online multiplayer game.

Players manipulate protein structures with direct tools and adapted Rosetta algorithms, competing and collaborating to improve computed energy.

The paper reports that players also develop search strategies, combining human visual problem solving with computational structure-prediction methods.

Sources and details

Predicting protein structures with a multiplayer online game

{
  "access_scope": "Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Seth Cooper is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "authors_in_source_order": [
    "Cooper, Seth",
    "Khatib, Firas",
    "Treuille, Adrien",
    "Barbero, Janos",
    "Lee, Jeehyung",
    "Beenen, Michael",
    "Leaver-Fay, Andrew",
    "Baker, David",
    "Popović, Zoran",
    "players, Foldit"
  ],
  "dates": {
    "citation_publication_date": "2010/08",
    "retrieved_utc": "2026-10-07T18:13:39.302585+00:00"
  },
  "id": "person-coverage-3a63fe1c861f6f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Predicting protein structures with a multiplayer online game",
  "url": "https://www.nature.com/articles/nature09304"
}

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Seth Cooper is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Predicting protein structures with a multiplayer online game. Foldit structure-refinement abstract; collective player results do not establish a specific contribution by this individual or general therapeutic effects. Seth Cooper is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shane Legg

Shane Legg is a listed coauthor of Deep reinforcement learning from human preferences, which specifies goals through comparisons between short trajectory segments.

The approach trains reinforcement-learning agents without direct access to the reward function by collecting non-expert human preferences.

The paper reports Atari and simulated-locomotion experiments and examples of new behaviors, connecting the method to reducing the amount of human feedback needed in those settings.

Sources and details

Deep reinforcement learning from human preferences

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Shane Legg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Christiano, Paul",
    "Leike, Jan",
    "Brown, Tom B.",
    "Martic, Miljan",
    "Legg, Shane",
    "Amodei, Dario"
  ],
  "authors_in_source_order": [
    "Christiano, Paul",
    "Leike, Jan",
    "Brown, Tom B.",
    "Martic, Miljan",
    "Legg, Shane",
    "Amodei, Dario"
  ],
  "dates": {
    "citation_date": "2017/06/12",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB)",
    "original_submission": "Mon, 12 Jun 2017 17:23:59 UTC (3,355 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:08.125302+00:00",
    "version": "arXiv v4"
  },
  "id": "person-local-shanelegg::S1",
  "title": "Deep reinforcement learning from human preferences",
  "url": "https://arxiv.org/abs/1706.03741",
  "version_url": "https://arxiv.org/abs/1706.03741v4"
}

Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Shane Legg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v4 abstract, revised Fri, 17 Feb 2023 17:00:34 UTC (3,356 KB). Pairwise-preference RL abstract with Atari and simulated locomotion; human-feedback cost reports apply to those experiments, not universal oversight costs. Shane Legg is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sherry Moore

Sherry Moore is a listed coauthor of TensorFlow: A system for large-scale machine learning, which represents computation and mutable shared state with dataflow graphs.

The system places graph operations across machines and heterogeneous processors, including CPUs, GPUs, and tensor-processing chips.

The paper describes this graph-based organization as enabling developers to experiment with training algorithms and state-management choices, with demonstrations on selected applications.

Sources and details

TensorFlow: A system for large-scale machine learning

{
  "access_scope": "Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sherry Moore is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "authors_in_source_order": [
    "Abadi, Martín",
    "Barham, Paul",
    "Chen, Jianmin",
    "Chen, Zhifeng",
    "Davis, Andy",
    "Dean, Jeffrey",
    "Devin, Matthieu",
    "Ghemawat, Sanjay",
    "Irving, Geoffrey",
    "Isard, Michael",
    "Kudlur, Manjunath",
    "Levenberg, Josh",
    "Monga, Rajat",
    "Moore, Sherry",
    "Murray, Derek G.",
    "Steiner, Benoit",
    "Tucker, Paul",
    "Vasudevan, Vijay",
    "Warden, Pete",
    "Wicke, Martin",
    "Yu, Yuan",
    "Zheng, Xiaoqiang"
  ],
  "dates": {
    "citation_date": "2016/05/27",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Tue, 31 May 2016 19:46:10 UTC (308 KB)",
    "original_submission": "Fri, 27 May 2016 15:49:50 UTC (308 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.245163+00:00",
    "version": "arXiv v2"
  },
  "id": "person-sherrymoore::S1",
  "title": "TensorFlow: A system for large-scale machine learning",
  "url": "https://arxiv.org/abs/1605.08695",
  "version_url": "https://arxiv.org/abs/1605.08695v2"
}

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sherry Moore is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v2 abstract, revised Tue, 31 May 2016 19:46:10 UTC (308 KB). 2016 TensorFlow dataflow-system abstract; historical architecture and application reports, not a specification of current TensorFlow APIs. Sherry Moore is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shoko Ueda

Shoko Ueda is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Shoko Ueda is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-b2d256e70ad54b::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Shoko Ueda is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Shoko Ueda is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon A. A. Kohl

Simon A. A. Kohl is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Simon A. A. Kohl is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-f8540b5bcd3af2::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Simon A. A. Kohl is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Simon A. A. Kohl is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Batzner

Simon Batzner is a listed coauthor of Scaling deep learning for materials discovery, which uses graph networks and large-scale calculations to identify inorganic crystal candidates.

The paper evaluates predicted stability through a convex-hull framework and discusses screening layered materials and solid-electrolyte candidates.

It also links the calculation data to learned interatomic potentials for molecular dynamics and ionic-conductivity prediction, separating computational discovery from experimentally realized structures.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Simon Batzner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_online_date": "2023/11/29",
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "person-coverage-0ef9322aa4f3e7::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Simon Batzner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Scaling deep learning for materials discovery. Materials-discovery abstract; calculated stability, screened candidates, and independently experimentally realized structures are distinct categories, not blanket synthesis confirmation. Simon Batzner is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Kornblith

Simon Kornblith is a listed coauthor of the SimCLR paper, which studies contrastive learning of visual representations without a specialized architecture or memory bank.

The framework examines combinations of data augmentation and a learned nonlinear transformation between representations and the contrastive loss.

The paper also analyzes batch size and training duration and evaluates representations through linear classification and limited-label fine-tuning on ImageNet.

Sources and details

A Simple Framework for Contrastive Learning of Visual Representations

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Simon Kornblith is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "authors_in_source_order": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "dates": {
    "citation_date": "2020/02/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB)",
    "original_submission": "Thu, 13 Feb 2020 18:50:45 UTC (5,093 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.940008+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-dec91dd68b6959::S1",
  "title": "A Simple Framework for Contrastive Learning of Visual Representations",
  "url": "https://arxiv.org/abs/2002.05709",
  "version_url": "https://arxiv.org/abs/2002.05709v3"
}

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Simon Kornblith is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Simon Kornblith is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Schmitt

Simon Schmitt is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Simon Schmitt is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-da96dd54bb3b1c::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Simon Schmitt is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Simon Schmitt is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Soheil Kolouri

Soheil Kolouri is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Soheil Kolouri is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-cbea7e9af72a32::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Soheil Kolouri is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Soheil Kolouri is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stanislav Nikolov

Stanislav Nikolov is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stanislav Nikolov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-276b7e239becb9::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stanislav Nikolov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stanislav Nikolov is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stefano Fusi

Stefano Fusi is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Stefano Fusi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-2653c76a7d007a::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Stefano Fusi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Stefano Fusi is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stephan Rasp

Stephan Rasp is a listed coauthor of the NeuralGCM paper, which combines a differentiable atmospheric solver with learned model components.

The authors evaluate deterministic and ensemble weather forecasts alongside longer climate simulations under prescribed sea-surface temperatures.

Their reported computational savings accompany a stated limit: the model does not extrapolate to substantially different future climates.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Stephan Rasp is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "authors_in_source_order": [
    "Dmitrii Kochkov",
    "Janni Yuval",
    "Ian Langmore",
    "Peter Norgaard",
    "Jamie Smith",
    "Griffin Mooers",
    "Milan Klöwer",
    "James Lottes",
    "Stephan Rasp",
    "Peter Düben",
    "Sam Hatfield",
    "Peter Battaglia",
    "Alvaro Sanchez-Gonzalez",
    "Matthew Willson",
    "Michael P. Brenner",
    "Stephan Hoyer"
  ],
  "dates": {
    "Accepted": "15 June 2024",
    "Issue date": "29 August 2024",
    "Published": "22 July 2024",
    "Received": "13 November 2023",
    "Version of record": "22 July 2024",
    "citation_dates": [
      "2024/08"
    ],
    "citation_publication_date": "2024/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-1f1a8549415e22::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Stephan Rasp is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Neural general circulation models for weather and climate. Forecast and climate results are bounded to the tested NeuralGCM configurations; prescribed-temperature simulations and failure to extrapolate remain distinct from general future-climate prediction. Stephan Rasp is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steve Crossan

Steve Crossan is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Steve Crossan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-6b24702364cb48::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Steve Crossan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Steve Crossan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steven Laureys

Steven Laureys is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Steven Laureys is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-c42a3bfc651834::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Steven Laureys is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Steven Laureys is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stig Petersen

Stig Petersen is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stig Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-51f4fb012496bf::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stig Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Stig Petersen is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sukhdeep Singh

Sukhdeep Singh is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sukhdeep Singh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-c67640f242b76a::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sukhdeep Singh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Sukhdeep Singh is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Suraj Chakravarthi Raja

Suraj Chakravarthi Raja is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Suraj Chakravarthi Raja is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-4e4e9dff4460ce::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Suraj Chakravarthi Raja is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Suraj Chakravarthi Raja is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Susana Vázquez Torres

Susana Vázquez Torres is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Susana Vázquez Torres is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-bee33cf39e2a02::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Susana Vázquez Torres is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Susana Vázquez Torres is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tamas Berghammer

Tamas Berghammer is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Tamas Berghammer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b63c7e3ac9dfe3::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Tamas Berghammer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Tamas Berghammer is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tej Pandit

Tej Pandit is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Tej Pandit is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-63068fff6ba46f::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Tej Pandit is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Tej Pandit is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Terrence J. Sejnowski

Terrence J. Sejnowski is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Terrence J. Sejnowski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-d47509d9fe6931::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Terrence J. Sejnowski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Terrence J. Sejnowski is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Green

Tim Green is a listed coauthor of the earlier AlphaFold paper, which learns residue-pair distance predictions to guide protein-structure construction.

Those predictions define a potential of mean force that is optimized by gradient descent rather than complex sampling.

The authors assess the resulting structures in CASP13, connecting learned geometric constraints with blind prediction performance.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Tim Green is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "Andrew W. Senior",
    "Richard Evans",
    "John Jumper",
    "James Kirkpatrick",
    "Laurent Sifre",
    "Tim Green",
    "Chongli Qin",
    "Augustin Žídek",
    "Alexander W. R. Nelson",
    "Alex Bridgland",
    "Hugo Penedones",
    "Stig Petersen",
    "Karen Simonyan",
    "Steve Crossan",
    "Pushmeet Kohli",
    "David T. Jones",
    "David Silver",
    "Koray Kavukcuoglu",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "10 December 2019",
    "Issue date": "30 January 2020",
    "Published": "15 January 2020",
    "Received": "02 April 2019",
    "Version of record": "15 January 2020",
    "citation_dates": [
      "2020/01"
    ],
    "citation_publication_date": "2020/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b01ae43f985644::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Tim Green is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Improved protein structure prediction using potentials from deep learning. Accessible abstract-level claims concern the earlier CASP13 AlphaFold system, not AlphaFold 2 or 3; structural accuracy is not clinical validation. Tim Green is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ting Chen

Ting Chen is a listed coauthor of the SimCLR paper, which studies contrastive learning of visual representations without a specialized architecture or memory bank.

The framework examines combinations of data augmentation and a learned nonlinear transformation between representations and the contrastive loss.

The paper also analyzes batch size and training duration and evaluates representations through linear classification and limited-label fine-tuning on ImageNet.

Sources and details

A Simple Framework for Contrastive Learning of Visual Representations

{
  "access_scope": "Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Ting Chen is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "authors_in_source_order": [
    "Chen, Ting",
    "Kornblith, Simon",
    "Norouzi, Mohammad",
    "Hinton, Geoffrey"
  ],
  "dates": {
    "citation_date": "2020/02/13",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB)",
    "original_submission": "Thu, 13 Feb 2020 18:50:45 UTC (5,093 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:12:34.940008+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-2c5ef129e08ee8::S1",
  "title": "A Simple Framework for Contrastive Learning of Visual Representations",
  "url": "https://arxiv.org/abs/2002.05709",
  "version_url": "https://arxiv.org/abs/2002.05709v3"
}

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Ting Chen is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v3 abstract, revised Wed, 1 Jul 2020 00:09:08 UTC (5,829 KB). SimCLR component study and ImageNet linear/fine-tuning evaluations; performance statements remain experimental reports rather than deployment guarantees. Ting Chen is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tobias Pfaff

Tobias Pfaff is a listed coauthor of a graph-network simulator paper, which represents physical systems as particles connected through learned message passing.

The framework models interacting fluids, rigid solids and deformable materials from training on single-step dynamics.

The authors investigate longer rollouts and changed particle counts, finding that message-passing depth and noise during training affect accumulated error.

Sources and details

Learning to Simulate Complex Physics with Graph Networks

{
  "access_scope": "Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Tobias Pfaff is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "authors_in_source_order": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "dates": {
    "citation_dates": [
      "2020/11/21"
    ],
    "citation_publication_date": "2020/11/21",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:52.705222+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-faf487a19714e9::S1",
  "title": "Learning to Simulate Complex Physics with Graph Networks",
  "url": "https://proceedings.mlr.press/v119/sanchez-gonzalez20a.html"
}

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Tobias Pfaff is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Learning to Simulate Complex Physics with Graph Networks. Generalization and stability claims are bounded to the reported simulated domains, initial conditions and evaluation; they do not guarantee accurate dynamics for every physical system. Tobias Pfaff is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom R. Andersson

Tom R. Andersson is a listed coauthor of the GenCast weather paper, which trains a probabilistic model on decades of reanalysis data.

The model produces an ensemble of possible global weather trajectories over fifteen days rather than a single deterministic forecast.

The paper compares its forecasts with the ECMWF ensemble system and reports tests covering extreme weather, cyclone tracks, and wind-power production.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Tom R. Andersson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_online_date": "2024/12/04",
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "person-coverage-126f21dd109979::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Tom R. Andersson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Probabilistic weather forecasting with machine learning. GenCast public abstract and reported ENS benchmark comparison; ensemble uncertainty distinguished from deterministic forecasting, without current weather or operational-risk guidance. Tom R. Andersson is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Zahavy

Tom Zahavy is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Tom Zahavy is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-ee3ebc8bd14b01::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Tom Zahavy is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Tom Zahavy is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Back

Trevor Back is a listed coauthor of the AlphaFold 2 study, which redesigns protein-structure prediction around physical and biological knowledge.

Its neural-network approach uses multiple-sequence alignments within the learning architecture.

The authors validate predictions in CASP14 and compare them with experimental structures, reporting performance for the benchmark’s tested cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Trevor Back is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "authors_in_source_order": [
    "John Jumper",
    "Richard Evans",
    "Alexander Pritzel",
    "Tim Green",
    "Michael Figurnov",
    "Olaf Ronneberger",
    "Kathryn Tunyasuvunakool",
    "Russ Bates",
    "Augustin Žídek",
    "Anna Potapenko",
    "Alex Bridgland",
    "Clemens Meyer",
    "Simon A. A. Kohl",
    "Andrew J. Ballard",
    "Andrew Cowie",
    "Bernardino Romera-Paredes",
    "Stanislav Nikolov",
    "Rishub Jain",
    "Jonas Adler",
    "Trevor Back",
    "Stig Petersen",
    "David Reiman",
    "Ellen Clancy",
    "Michal Zielinski",
    "Martin Steinegger",
    "Michalina Pacholska",
    "Tamas Berghammer",
    "Sebastian Bodenstein",
    "David Silver",
    "Oriol Vinyals",
    "Andrew W. Senior",
    "Koray Kavukcuoglu",
    "Pushmeet Kohli",
    "Demis Hassabis"
  ],
  "dates": {
    "Accepted": "12 July 2021",
    "Issue date": "26 August 2021",
    "Published": "15 July 2021",
    "Received": "11 May 2021",
    "Version of record": "18 August 2021",
    "citation_dates": [
      "2021/08"
    ],
    "citation_publication_date": "2021/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-8c5914c36ecdd1::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Trevor Back is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Highly accurate protein structure prediction with AlphaFold. CASP14 structure-prediction results concern the redesigned AlphaFold model, not the earlier potential-based system or AlphaFold 3; they do not validate medical use. Trevor Back is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Valentin De Bortoli

Valentin De Bortoli is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Valentin De Bortoli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-ad5d9fe6dcd233::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Valentin De Bortoli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Valentin De Bortoli is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Veda Panneershelvam

Veda Panneershelvam is a listed coauthor of the AlphaGo paper combining neural networks with tree search for Go.

Its value networks evaluate positions and policy networks choose moves, with training drawn from expert games and reinforcement learning through self-play.

The paper then combines those networks with Monte Carlo search and reports comparisons with other programs and a professional-player match.

Sources and details

Mastering the game of Go with deep neural networks and tree search

{
  "access_scope": "Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Veda Panneershelvam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Silver, David",
    "Huang, Aja",
    "Maddison, Chris J.",
    "Guez, Arthur",
    "Sifre, Laurent",
    "van den Driessche, George",
    "Schrittwieser, Julian",
    "Antonoglou, Ioannis",
    "Panneershelvam, Veda",
    "Lanctot, Marc",
    "Dieleman, Sander",
    "Grewe, Dominik",
    "Nham, John",
    "Kalchbrenner, Nal",
    "Sutskever, Ilya",
    "Lillicrap, Timothy",
    "Leach, Madeleine",
    "Kavukcuoglu, Koray",
    "Graepel, Thore",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_online_date": "2016/01/27",
    "citation_publication_date": "2016/01",
    "retrieved_utc": "2026-10-07T17:56:05.845512+00:00"
  },
  "id": "person-local-vedapanneershelvam::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Mastering the game of Go with deep neural networks and tree search",
  "url": "https://www.nature.com/articles/nature16961"
}

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Veda Panneershelvam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Mastering the game of Go with deep neural networks and tree search. 2016 AlphaGo article abstract and reported program/match tests; distinct from later AlphaGo versions, AlphaZero, or current model capabilities. Veda Panneershelvam is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Victor Bapst

Victor Bapst is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Victor Bapst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-76284151dd65e8::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Victor Bapst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Victor Bapst is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vivek Veeriah

Vivek Veeriah is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Vivek Veeriah is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-235f7a820ce525::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Vivek Veeriah is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Vivek Veeriah is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vlad Firoiu

Vlad Firoiu is a listed coauthor of a deep-reinforcement-learning study of Super Smash Bros. Melee as a multiplayer testbed.

The paper frames the game’s complex dynamics and partial observability as challenges beyond many single-agent reinforcement-learning environments.

It reports agents competitive with human professionals in that setting, presenting game-specific performance rather than an unrestricted claim of human-level intelligence.

Sources and details

Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Vlad Firoiu is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "authors_in_source_order": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "dates": {
    "citation_date": "2017/02/21",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 May 2017 15:03:25 UTC (152 KB)",
    "original_submission": "Tue, 21 Feb 2017 01:06:11 UTC (152 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.978825+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-91183302a98ba2::S1",
  "title": "Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1702.06230",
  "version_url": "https://arxiv.org/abs/1702.06230v3"
}

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Vlad Firoiu is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. Vlad Firoiu is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wenjie Li

Wenjie Li is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Wenjie Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-a8f3a3911d3ba1::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Wenjie Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Wenjie Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wessel P. Bruinsma

Wessel P. Bruinsma is a listed coauthor of the Aurora Earth-system model paper, which describes pretraining on a large collection of geophysical data.

The model is designed to be fine-tuned for different environmental forecasting applications rather than trained separately from scratch for each task.

The paper reports evaluations of air quality, ocean waves, tropical-cyclone tracks, and high-resolution weather, keeping those comparisons tied to the tested forecast settings.

Sources and details

A foundation model for the Earth system

{
  "access_scope": "Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Wessel P. Bruinsma is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "authors_in_source_order": [
    "Bodnar, Cristian",
    "Bruinsma, Wessel P.",
    "Lucic, Ana",
    "Stanley, Megan",
    "Allen, Anna",
    "Brandstetter, Johannes",
    "Garvan, Patrick",
    "Riechert, Maik",
    "Weyn, Jonathan A.",
    "Dong, Haiyu",
    "Gupta, Jayesh K.",
    "Thambiratnam, Kit",
    "Archibald, Alexander T.",
    "Wu, Chun-Chieh",
    "Heider, Elizabeth",
    "Welling, Max",
    "Turner, Richard E.",
    "Perdikaris, Paris"
  ],
  "dates": {
    "citation_online_date": "2025/05/21",
    "citation_publication_date": "2025/05",
    "retrieved_utc": "2026-10-07T18:11:40.594463+00:00"
  },
  "id": "person-coverage-a3abbb4a944cb3::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A foundation model for the Earth system",
  "url": "https://www.nature.com/articles/s41586-025-09005-y"
}

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Wessel P. Bruinsma is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A foundation model for the Earth system. Aurora public abstract and reported Earth-system forecast comparisons; not a forecast for a real present-day event or universal operational superiority. Wessel P. Bruinsma is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wiesław L. Galus

Wiesław L. Galus is a listed coauthor of From Biological Precursors to Artificial Cognition, which compares language models and embodied agents with the Motivated Emotional Mind architecture.

The proposed architecture combines sensory representations, regulatory self-monitoring, interoception, affect, associative memory, and recurrent connections to lower-level maps.

The paper presents consciousness attribution as a falsifiable research question requiring empirical testing, rather than treating language or embodiment alone as evidence of experience.

Sources and details

From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture

{
  "access_scope": "Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Wiesław L. Galus is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "authors_in_source_order": [
    "Starzyk, Janusz A.",
    "Galus, Wiesław L."
  ],
  "dates": {
    "citation_date": "2026/09/20",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Sun, 20 Sep 2026 19:24:53 UTC (514 KB)",
    "original_submission": "Sun, 20 Sep 2026 19:24:53 UTC (514 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:11:55.467599+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-eaa885dca1d86a::S1",
  "title": "From Biological Precursors to Artificial Cognition: Consciousness, Embodiment, and the MEM Architecture",
  "url": "https://arxiv.org/abs/2609.23828",
  "version_url": "https://arxiv.org/abs/2609.23828v1"
}

Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Wiesław L. Galus is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v1 abstract, revised Sun, 20 Sep 2026 19:24:53 UTC (514 KB). Conceptual MEM comparison and proposed testing agenda; no experimentally established machine consciousness or clinical diagnosis. Wiesław L. Galus is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William F. Whitney

William F. Whitney is a listed coauthor of a deep-reinforcement-learning study of Super Smash Bros. Melee as a multiplayer testbed.

The paper frames the game’s complex dynamics and partial observability as challenges beyond many single-agent reinforcement-learning environments.

It reports agents competitive with human professionals in that setting, presenting game-specific performance rather than an unrestricted claim of human-level intelligence.

Sources and details

Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning

{
  "access_scope": "Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. William F. Whitney is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "authors_in_source_order": [
    "Vlad Firoiu",
    "William F. Whitney",
    "Joshua B. Tenenbaum"
  ],
  "dates": {
    "citation_date": "2017/02/21",
    "inspected_arxiv_version": "v3",
    "inspected_revision": "Mon, 8 May 2017 15:03:25 UTC (152 KB)",
    "original_submission": "Tue, 21 Feb 2017 01:06:11 UTC (152 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.978825+00:00",
    "version": "arXiv v3"
  },
  "id": "person-coverage-d3644a0d0e8658::S1",
  "title": "Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1702.06230",
  "version_url": "https://arxiv.org/abs/1702.06230v3"
}

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. William F. Whitney is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v3 abstract for Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning, revised Mon, 8 May 2017 15:03:25 UTC (152 KB). The abstract concerns the reported Melee setup and opponents; the title and results do not establish superiority over every professional or competence outside that game. William F. Whitney is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William L. Hamilton

William L. Hamilton is a listed coauthor of Inductive Representation Learning on Large Graphs, which introduces GraphSAGE for producing embeddings of unseen nodes.

Instead of storing a separately trained embedding for each node, the method learns to sample and aggregate features from a local neighborhood.

The paper evaluates node classification on citation and Reddit graphs and transfer to unseen protein-interaction graphs.

Sources and details

Inductive Representation Learning on Large Graphs

{
  "access_scope": "Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. William L. Hamilton is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.",
  "authors": [
    "Hamilton, William L.",
    "Ying, Rex",
    "Leskovec, Jure"
  ],
  "authors_in_source_order": [
    "Hamilton, William L.",
    "Ying, Rex",
    "Leskovec, Jure"
  ],
  "dates": {
    "citation_date": "2017/06/07",
    "inspected_arxiv_version": "v4",
    "inspected_revision": "Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB)",
    "original_submission": "Wed, 7 Jun 2017 14:51:05 UTC (906 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:13:47.364947+00:00",
    "version": "arXiv v4"
  },
  "id": "person-coverage-472f0cba9e371e::S1",
  "title": "Inductive Representation Learning on Large Graphs",
  "url": "https://arxiv.org/abs/1706.02216",
  "version_url": "https://arxiv.org/abs/1706.02216v4"
}

Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. William L. Hamilton is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

Joint-author arXiv v4 abstract, revised Mon, 10 Sep 2018 14:26:58 UTC (1,148 KB). GraphSAGE inductive-method abstract; evidence limited to stated node-classification and protein-interaction benchmarks. William L. Hamilton is source-listed as a coauthor; the abstract does not assign individual tasks or establish broader career or identity claims. Original submission and inspected revision are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Sheffler

William Sheffler is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. William Sheffler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-82280da756463c::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. William Sheffler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. William Sheffler is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Woody Ahern

Woody Ahern is a listed coauthor of the RFdiffusion paper, which turns a protein-structure prediction network into a generative backbone model through denoising training.

The authors fine-tune RoseTTAFold to support multiple design constraints, including binders, symmetric assemblies and active-site scaffolds.

Experimental characterization of designed proteins and a structural comparison illustrate how generated designs can be assessed beyond computational output alone.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Woody Ahern is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Joseph L. Watson",
    "David Juergens",
    "Nathaniel R. Bennett",
    "Brian L. Trippe",
    "Jason Yim",
    "Helen E. Eisenach",
    "Woody Ahern",
    "Andrew J. Borst",
    "Robert J. Ragotte",
    "Lukas F. Milles",
    "Basile I. M. Wicky",
    "Nikita Hanikel",
    "Samuel J. Pellock",
    "Alexis Courbet",
    "William Sheffler",
    "Jue Wang",
    "Preetham Venkatesh",
    "Isaac Sappington",
    "Susana Vázquez Torres",
    "Anna Lauko",
    "Valentin De Bortoli",
    "Emile Mathieu",
    "Sergey Ovchinnikov",
    "Regina Barzilay",
    "Tommi S. Jaakkola",
    "Frank DiMaio",
    "Minkyung Baek",
    "David Baker"
  ],
  "dates": {
    "Accepted": "07 July 2023",
    "Issue date": "31 August 2023",
    "Published": "11 July 2023",
    "Received": "14 December 2022",
    "Version of record": "23 August 2023",
    "citation_dates": [
      "2023/08"
    ],
    "citation_publication_date": "2023/08",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-56eec0c720568b::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Woody Ahern is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of De novo design of protein structure and function with RFdiffusion. Protein-design experiments are reported research validation for selected designs, not clinical safety, efficacy or approval of therapeutic use. Woody Ahern is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Woosuk Kwon

Woosuk Kwon is a listed coauthor of the PagedAttention paper, which addresses memory waste when serving many language-model requests.

Its attention algorithm borrows paging concepts from operating systems to manage dynamically changing key-value caches.

The vLLM system built around that algorithm supports cache sharing within and across requests, with reported throughput comparisons at matched latency.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": "Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Woosuk Kwon is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "authors_in_source_order": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "citation_date": "2023/09/12",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.888714+00:00",
    "version": "arXiv v1"
  },
  "id": "person-woosukkwon::S1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/abs/2309.06180",
  "version_url": "https://arxiv.org/abs/2309.06180v1"
}

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Woosuk Kwon is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Woosuk Kwon is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xiang Fu

Xiang Fu is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Xiang Fu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-11f0515924a586::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Xiang Fu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Xiang Fu is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Xinyun Zou

Xinyun Zou is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Xinyun Zou is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-12d14e66c82572::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Xinyun Zou is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Xinyun Zou is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yannick Schroecker

Yannick Schroecker is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yannick Schroecker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-d03888578712e6::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yannick Schroecker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yannick Schroecker is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yavar Naddaf

Yavar Naddaf is a listed coauthor of the Arcade Learning Environment paper, which introduces an interface and evaluation methodology for Atari 2600 game agents.

Its shared platform exposes varied games as challenges for reinforcement learning, planning and transfer across domains.

The authors illustrate the methodology with benchmark agents and results on more than fifty-five games, separating a comparative testbed from a claim that any agent is generally intelligent.

Sources and details

The Arcade Learning Environment: An Evaluation Platform for General Agents

{
  "access_scope": "Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Yavar Naddaf is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "authors_in_source_order": [
    "Marc G. Bellemare",
    "Yavar Naddaf",
    "Joel Veness",
    "Michael Bowling"
  ],
  "dates": {
    "citation_date": "2012/07/19",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Fri, 21 Jun 2013 18:07:06 UTC (178 KB)",
    "original_submission": "Thu, 19 Jul 2012 15:33:25 UTC (164 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:16:32.622531+00:00",
    "version": "arXiv v2"
  },
  "id": "person-coverage-f90456a2c80102::S1",
  "title": "The Arcade Learning Environment: An Evaluation Platform for General Agents",
  "url": "https://arxiv.org/abs/1207.4708",
  "version_url": "https://arxiv.org/abs/1207.4708v2"
}

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Yavar Naddaf is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for The Arcade Learning Environment: An Evaluation Platform for General Agents, revised Fri, 21 Jun 2013 18:07:06 UTC (178 KB). The historical ALE platform and game benchmarks support evaluation claims, not general intelligence, current software compatibility or unrestricted transfer. Yavar Naddaf is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yin Li

Yin Li is a listed coauthor of the AlphaProof paper, which trains a reinforcement-learning agent to produce formally verified mathematical proofs.

Training uses millions of auto-formalized problems, while difficult cases receive additional test-time learning from related problem variants.

The report separates AlphaProof’s non-geometry solutions from the combined AlphaProof–AlphaGeometry2 Olympiad result, which used multi-day computation.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yin Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_online_date": "2025/11/12",
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "person-coverage-511b51ae1f70f8::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yin Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Olympiad-level formal mathematical reasoning with reinforcement learning. AlphaProof abstract; formal Lean reasoning, test-time RL, and combined 2024 Olympiad result distinguished, including multi-day computation and separate geometry component. Yin Li is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ying Sheng

Ying Sheng is a listed coauthor of the PagedAttention paper, which addresses memory waste when serving many language-model requests.

Its attention algorithm borrows paging concepts from operating systems to manage dynamically changing key-value caches.

The vLLM system built around that algorithm supports cache sharing within and across requests, with reported throughput comparisons at matched latency.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": "Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ying Sheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "authors_in_source_order": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "citation_date": "2023/09/12",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.888714+00:00",
    "version": "arXiv v1"
  },
  "id": "person-yingsheng::S1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/abs/2309.06180",
  "version_url": "https://arxiv.org/abs/2309.06180v1"
}

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ying Sheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Ying Sheng is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Younes Belkada

Younes Belkada is a listed coauthor of the LLM.int8() paper, which uses mixed-precision matrix multiplication to reduce language-model inference memory.

Vector-wise normalization quantizes most features, while a separate sixteen-bit computation handles outlier dimensions that strongly affect predictive behavior.

The authors report inference experiments up to 175-billion-parameter models, using the two-part procedure to retain performance in their evaluated settings.

Sources and details

LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale

{
  "access_scope": "Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Younes Belkada is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Tim Dettmers",
    "Mike Lewis",
    "Younes Belkada",
    "Luke Zettlemoyer"
  ],
  "authors_in_source_order": [
    "Tim Dettmers",
    "Mike Lewis",
    "Younes Belkada",
    "Luke Zettlemoyer"
  ],
  "dates": {
    "citation_date": "2022/08/15",
    "inspected_arxiv_version": "v2",
    "inspected_revision": "Thu, 10 Nov 2022 18:14:31 UTC (163 KB)",
    "original_submission": "Mon, 15 Aug 2022 17:08:50 UTC (161 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:21:59.279437+00:00",
    "version": "arXiv v2"
  },
  "id": "person-younesbelkada::S1",
  "title": "LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale",
  "url": "https://arxiv.org/abs/2208.07339",
  "version_url": "https://arxiv.org/abs/2208.07339v2"
}

Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Younes Belkada is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v2 abstract for LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale, revised Thu, 10 Nov 2022 18:14:31 UTC (163 KB). Memory and performance claims concern the reported transformer layers, models and evaluation; they do not establish lossless behavior for every quantization workload or current package. Younes Belkada is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yousuf A. Khan

Yousuf A. Khan is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Yousuf A. Khan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-13d7f752ddc714::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Yousuf A. Khan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Yousuf A. Khan is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yuhuai Wu

Yuhuai Wu is a listed coauthor of the AlphaGeometry paper, which trains a geometry theorem prover with synthetic theorems and proofs.

A neural language model guides a symbolic deduction engine, reducing dependence on translated human proof demonstrations.

The authors evaluate thirty olympiad-level geometry problems and report human-readable proofs, tying the achievement to a specific mathematical domain and test set.

Sources and details

Solving olympiad geometry without human demonstrations

{
  "access_scope": "Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. Yuhuai Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Trieu H. Trinh",
    "Yuhuai Wu",
    "Quoc V. Le",
    "He He",
    "Thang Luong"
  ],
  "authors_in_source_order": [
    "Trieu H. Trinh",
    "Yuhuai Wu",
    "Quoc V. Le",
    "He He",
    "Thang Luong"
  ],
  "dates": {
    "Accepted": "13 October 2023",
    "Issue date": "18 January 2024",
    "Published": "17 January 2024",
    "Received": "30 April 2023",
    "Version of record": "17 January 2024",
    "citation_dates": [
      "2024/01"
    ],
    "citation_publication_date": "2024/01",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:16:15.999178+00:00",
    "visible_pre_abstract_notices": "Solving olympiad geometry without human demonstrations\nDownload PDF\nDownload PDF\nAn\nAuthor Correction\nto this article was published on 23 February 2024\nThis article has been\nupdated"
  },
  "id": "person-coverage-8a53e04f1b723c::S1",
  "title": "Solving olympiad geometry without human demonstrations",
  "url": "https://www.nature.com/articles/s41586-023-06747-5"
}

Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. Yuhuai Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Solving olympiad geometry without human demonstrations. Results concern Euclidean plane geometry and the stated thirty-problem test; the visible February 2024 author-correction and update notices do not establish general mathematical reasoning. Yuhuai Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zachary Wu

Zachary Wu is a listed coauthor of the AlphaFold 3 paper, which predicts structures of complexes containing several types of biomolecules within one diffusion-based model.

Its joint representation extends beyond proteins to nucleic acids, small molecules, ions and modified residues.

The authors report comparisons against specialized interaction predictors, investigating whether one architecture can model a broader biomolecular space.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Zachary Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "authors_in_source_order": [
    "Josh Abramson",
    "Jonas Adler",
    "Jack Dunger",
    "Richard Evans",
    "Tim Green",
    "Alexander Pritzel",
    "Olaf Ronneberger",
    "Lindsay Willmore",
    "Andrew J. Ballard",
    "Joshua Bambrick",
    "Sebastian W. Bodenstein",
    "David A. Evans",
    "Chia-Chun Hung",
    "Michael O’Neill",
    "David Reiman",
    "Kathryn Tunyasuvunakool",
    "Zachary Wu",
    "Akvilė Žemgulytė",
    "Eirini Arvaniti",
    "Charles Beattie",
    "Ottavia Bertolli",
    "Alex Bridgland",
    "Alexey Cherepanov",
    "Miles Congreve",
    "Alexander I. Cowen-Rivers",
    "Andrew Cowie",
    "Michael Figurnov",
    "Fabian B. Fuchs",
    "Hannah Gladman",
    "Rishub Jain",
    "Yousuf A. Khan",
    "Caroline M. R. Low",
    "Kuba Perlin",
    "Anna Potapenko",
    "Pascal Savy",
    "Sukhdeep Singh",
    "Adrian Stecula",
    "Ashok Thillaisundaram",
    "Catherine Tong",
    "Sergei Yakneen",
    "Ellen D. Zhong",
    "Michal Zielinski",
    "Augustin Žídek",
    "Victor Bapst",
    "Pushmeet Kohli",
    "Max Jaderberg",
    "Demis Hassabis",
    "John M. Jumper"
  ],
  "dates": {
    "Accepted": "29 April 2024",
    "Issue date": "13 June 2024",
    "Published": "08 May 2024",
    "Received": "19 December 2023",
    "Version of record": "11 June 2024",
    "citation_dates": [
      "2024/06"
    ],
    "citation_publication_date": "2024/06",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00",
    "visible_pre_abstract_notices": "Accurate structure prediction of biomolecular interactions with AlphaFold 3\nDownload PDF\nDownload PDF\nAn\nAddendum\nto this article was published on 27 November 2024"
  },
  "id": "person-coverage-3b56e8dce368e0::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Zachary Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Accurate structure prediction of biomolecular interactions with AlphaFold 3. AlphaFold 3 interaction-prediction benchmarks are research results, not clinical validation; the visible November 2024 addendum notice is distinct from the article’s original publication. Zachary Wu is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zaneta Navratilova

Zaneta Navratilova is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zaneta Navratilova is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-00824c143b5567::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zaneta Navratilova is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zaneta Navratilova is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhong Sheng Zheng

Zhong Sheng Zheng is a listed coauthor of the adversarial-AI consciousness study, which places neural-network consciousness detectors against interpretable neural-field models.

The framework generates brain-activity simulations and predictions about mechanisms associated with unconsciousness.

The paper reports checks using imaging, tissue-expression, and electrophysiological data, distinguishing mechanistic predictions and a proposed stimulation intervention from demonstrated treatment efficacy.

Sources and details

Adversarial AI reveals mechanisms and treatments for disorders of consciousness

{
  "access_scope": "Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Zhong Sheng Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "authors_in_source_order": [
    "Toker, Daniel",
    "Zheng, Zhong Sheng",
    "Thum, Jasmine A.",
    "Guang, Jing",
    "Annen, Jitka",
    "Miyamoto, Hiroyuki",
    "Yamakawa, Kazuhiro",
    "Vespa, Paul M.",
    "Laureys, Steven",
    "Schnakers, Caroline",
    "Bari, Ausaf A.",
    "Hudson, Andrew",
    "Pouratian, Nader",
    "Monti, Martin M."
  ],
  "dates": {
    "citation_online_date": "2026/03/24",
    "citation_publication_date": "2026/04",
    "retrieved_utc": "2026-10-07T18:11:43.067919+00:00"
  },
  "id": "person-coverage-c754d69513b77f::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "Adversarial AI reveals mechanisms and treatments for disorders of consciousness",
  "url": "https://www.nature.com/articles/s41593-026-02220-4"
}

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Zhong Sheng Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: Adversarial AI reveals mechanisms and treatments for disorders of consciousness. Public abstract of disorders-of-consciousness research; simulations and observational validation are not a clinical recommendation or established efficacy of a stimulation treatment. Zhong Sheng Zheng is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhuohan Li

Zhuohan Li is a listed coauthor of the PagedAttention paper, which addresses memory waste when serving many language-model requests.

Its attention algorithm borrows paging concepts from operating systems to manage dynamically changing key-value caches.

The vLLM system built around that algorithm supports cache sharing within and across requests, with reported throughput comparisons at matched latency.

Sources and details

Efficient Memory Management for Large Language Model Serving with PagedAttention

{
  "access_scope": "Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Zhuohan Li is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.",
  "authors": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "authors_in_source_order": [
    "Woosuk Kwon",
    "Zhuohan Li",
    "Siyuan Zhuang",
    "Ying Sheng",
    "Lianmin Zheng",
    "Cody Hao Yu",
    "Joseph E. Gonzalez",
    "Hao Zhang",
    "Ion Stoica"
  ],
  "dates": {
    "citation_date": "2023/09/12",
    "inspected_arxiv_version": "v1",
    "inspected_revision": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission": "Tue, 12 Sep 2023 12:50:04 UTC (831 KB)",
    "original_submission_version": "v1",
    "retrieved_utc": "2026-10-07T18:19:39.888714+00:00",
    "version": "arXiv v1"
  },
  "id": "person-zhuohanli::S1",
  "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention",
  "url": "https://arxiv.org/abs/2309.06180",
  "version_url": "https://arxiv.org/abs/2309.06180v1"
}

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Zhuohan Li is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

Joint-author arXiv v1 abstract for Efficient Memory Management for Large Language Model Serving with PagedAttention, revised Tue, 12 Sep 2023 12:50:04 UTC (831 KB). The abstract’s throughput and memory claims concern the reported vLLM evaluation, not current software releases or every serving workload. Zhuohan Li is listed as a coauthor; no individual division of labor, leadership or broader identity merge is inferred. Original and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zilong Wang

Zilong Wang is a listed coauthor of the MatterGen paper, which generates inorganic crystal candidates and can be fine-tuned toward target properties.

The paper considers chemistry, symmetry, and mechanical, electronic, and magnetic constraints when steering candidate generation.

It reports a synthesis demonstration for one generated structure, separating that experiment from model-based assessments of novelty and stability across many proposed materials.

Sources and details

A generative model for inorganic materials design

{
  "access_scope": "Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Zilong Wang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.",
  "authors": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "authors_in_source_order": [
    "Zeni, Claudio",
    "Pinsler, Robert",
    "Zügner, Daniel",
    "Fowler, Andrew",
    "Horton, Matthew",
    "Fu, Xiang",
    "Wang, Zilong",
    "Shysheya, Aliaksandra",
    "Crabbé, Jonathan",
    "Ueda, Shoko",
    "Sordillo, Roberto",
    "Sun, Lixin",
    "Smith, Jake",
    "Nguyen, Bichlien",
    "Schulz, Hannes",
    "Lewis, Sarah",
    "Huang, Chin-Wei",
    "Lu, Ziheng",
    "Zhou, Yichi",
    "Yang, Han",
    "Hao, Hongxia",
    "Li, Jielan",
    "Yang, Chunlei",
    "Li, Wenjie",
    "Tomioka, Ryota",
    "Xie, Tian"
  ],
  "dates": {
    "citation_online_date": "2025/01/16",
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:11:40.513828+00:00"
  },
  "id": "person-coverage-8b1e7e964c9ac9::S1",
  "inspected_version": "cached publisher HTML manifestation, body hash specified; online publication and issue dates distinct",
  "title": "A generative model for inorganic materials design",
  "url": "https://www.nature.com/articles/s41586-025-08628-5"
}

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Zilong Wang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

Inspected publisher HTML manifestation: A generative model for inorganic materials design. MatterGen abstract; generated candidates and model comparisons distinguished from synthesis of one proof-of-concept structure, not evidence that every candidate can be manufactured. Zilong Wang is a listed coauthor; no individual division of labor or broader career identity is inferred. Only cached public abstract and explicitly quoted main-text method are used; subscription access is not assumed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zsolt Kira

Zsolt Kira is a listed coauthor of a Perspective on biological mechanisms that could support lifelong learning in artificial systems.

The authors identify needed capabilities and review neuronal and non-neuronal mechanisms through which organisms adapt over time.

Examples of biologically inspired models motivate research opportunities, connecting continual-learning challenges with mechanisms from natural systems.

Sources and details

Biological underpinnings for lifelong learning machines

{
  "access_scope": "Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zsolt Kira is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.",
  "authors": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "authors_in_source_order": [
    "Dhireesha Kudithipudi",
    "Mario Aguilar-Simon",
    "Jonathan Babb",
    "Maxim Bazhenov",
    "Douglas Blackiston",
    "Josh Bongard",
    "Andrew P. Brna",
    "Suraj Chakravarthi Raja",
    "Nick Cheney",
    "Jeff Clune",
    "Anurag Daram",
    "Stefano Fusi",
    "Peter Helfer",
    "Leslie Kay",
    "Nicholas Ketz",
    "Zsolt Kira",
    "Soheil Kolouri",
    "Jeffrey L. Krichmar",
    "Sam Kriegman",
    "Michael Levin",
    "Sandeep Madireddy",
    "Santosh Manicka",
    "Ali Marjaninejad",
    "Bruce McNaughton",
    "Risto Miikkulainen",
    "Zaneta Navratilova",
    "Tej Pandit",
    "Alice Parker",
    "Praveen K. Pilly",
    "Sebastian Risi",
    "Terrence J. Sejnowski",
    "Andrea Soltoggio",
    "Nicholas Soures",
    "Andreas S. Tolias",
    "Darío Urbina-Meléndez",
    "Francisco J. Valero-Cuevas",
    "Gido M. van de Ven",
    "Joshua T. Vogelstein",
    "Felix Wang",
    "Ron Weiss",
    "Angel Yanguas-Gil",
    "Xinyun Zou",
    "Hava Siegelmann"
  ],
  "dates": {
    "Accepted": "20 January 2022",
    "Issue date": "March 2022",
    "Published": "23 March 2022",
    "Received": "08 June 2021",
    "Version of record": "23 March 2022",
    "citation_dates": [
      "2022/03"
    ],
    "citation_publication_date": "2022/03",
    "inspected_manifestation": "cached publisher HTML article/abstract page",
    "retrieved_utc": "2026-10-07T18:11:43.514459+00:00",
    "visible_pre_abstract_notices": ""
  },
  "id": "person-coverage-b616e81104a23c::S1",
  "title": "Biological underpinnings for lifelong learning machines",
  "url": "https://www.nature.com/articles/s42256-022-00452-0"
}

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zsolt Kira is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

Publisher article/abstract account of Biological underpinnings for lifelong learning machines. This accessible Perspective abstract reviews mechanisms and proposals; it does not establish that lifelong learning is solved or that a specific artificial system has every biological capability. Zsolt Kira is a listed coauthor; no undocumented individual division of labor, leadership or identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pokémon Red

Pokémon Red serves as a reinforcement-learning testbed in a paper that emphasizes long horizons, hard exploration and many possible policies.

The authors build a simplified environment and train a baseline agent through the initial game segment ending at Cerulean City.

Their ablations show agents exploiting reward signals, making reward design a concrete limitation of the reported experiment.

Sources and details

Pokemon Red via Reinforcement Learning

{
  "access_scope": "2025 arXiv v 2 abstract about an experiment using the earlier Game Boy game. The reported agent completes only the initial segment; full-game completion, game authorship and real-world performance are not established. Original submission and inspected revision remain distinct.",
  "authors": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "authors_in_source_order": [
    "Marco Pleines",
    "Daniel Addis",
    "David Rubinstein",
    "Frank Zimmer",
    "Mike Preuss",
    "Peter Whidden"
  ],
  "dates": {
    "citation_date": "2025/02/27",
    "citation_date_exact": [
      "2025/02/27"
    ],
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "inspected_revision": "Tue, 11 Mar 2025 05:44:11 UTC (2,467 KB)",
    "retrieved_utc": "2026-10-07T18:12:35.494711+00:00",
    "version": "arXiv v2"
  },
  "id": "work-coverage-d2273e6920b742::S1",
  "title": "Pokemon Red via Reinforcement Learning",
  "url": "https://arxiv.org/abs/2502.19920",
  "version_url": "https://arxiv.org/abs/2502.19920v2"
}

2025 arXiv v 2 abstract about an experiment using the earlier Game Boy game. The reported agent completes only the initial segment; full-game completion, game authorship and real-world performance are not established. Original submission and inspected revision remain distinct.

2025 arXiv v 2 abstract about an experiment using the earlier Game Boy game. The reported agent completes only the initial segment; full-game completion, game authorship and real-world performance are not established. Original submission and inspected revision remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1996
}

The Moon Is a Harsh Mistress

The publisher describes The Moon Is a Harsh Mistress as a lunar penal-colony revolution assisted by a self-aware supercomputer.

Its diverse group of characters confronts changing meanings of humanity, technology and free will within that fictional struggle.

The description frames the novel around personal responsibility and political freedom, linking the computer-assisted revolt to those political questions.

Sources and details

The Moon Is a Harsh Mistress — publisher description

{
  "access_scope": "Publisher synopsis of the novel, not a full-text reading. The computer’s self-awareness belongs to the fictional premise; the listed May and July 2018 editions are distinct from the original novel.",
  "authors": [
    "Robert A. Heinlein"
  ],
  "authors_in_source_order": [
    "Robert A. Heinlein"
  ],
  "dates": {
    "ebook_edition": "May08,2018",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "paperback_edition": "July31,2018",
    "retrieved_utc": "2026-10-07T18:22:17.083942+00:00"
  },
  "id": "work-coverage-dd884fef42c82f::S1",
  "title": "The Moon Is a Harsh Mistress — publisher description",
  "url": "https://www.penguinrandomhouse.com/books/589269/the-moon-is-a-harsh-mistress-by-robert-a-heinlein/"
}

Publisher synopsis of the novel, not a full-text reading. The computer’s self-awareness belongs to the fictional premise; the listed May and July 2018 editions are distinct from the original novel.

Publisher synopsis of the novel, not a full-text reading. The computer’s self-awareness belongs to the fictional premise; the listed May and July 2018 editions are distinct from the original novel.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1966 original; current paperback dates are reissues.",
  "dated": true,
  "year": 1966
}

Gravity's Rainbow

The publisher’s synopsis of Gravity’s Rainbow begins with British Intelligence finding that Tyrone Slothrop’s mapped encounters correspond to V-2 rocket impact sites in London.

That apparent connection sends him across war-torn Europe while an international military-industrial cabal pursues him.

His search for Rocket 00000 ties the fictional journey to the novel’s examination of technology’s effects on society.

Sources and details

Gravity’s Rainbow — publisher description

{
  "access_scope": "Publisher plot synopsis, not a full-novel audit or evidence of a real predictive relationship. Thomas Pynchon is the author; Frank Miller’s illustration and George Guidall’s audio narration are separate edition roles. Paperback 2006, ebook 2012 and audiobook 2014 manifestations remain distinct.",
  "authors": [
    "Thomas Pynchon"
  ],
  "authors_in_source_order": [
    "Thomas Pynchon"
  ],
  "dates": {
    "audiobook_edition": "October16,2014",
    "ebook_edition": "June13,2012",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "paperback_edition": "October31,2006",
    "retrieved_utc": "2026-10-07T18:13:01.317495+00:00"
  },
  "id": "work-culture-94332e18380d38::S1",
  "title": "Gravity’s Rainbow — publisher description",
  "url": "https://www.penguinrandomhouse.com/books/299800/gravitys-rainbow-classics-deluxe-edition-by-thomas-pynchon/9780143039945/"
}

Publisher plot synopsis, not a full-novel audit or evidence of a real predictive relationship. Thomas Pynchon is the author; Frank Miller’s illustration and George Guidall’s audio narration are separate edition roles. Paperback 2006, ebook 2012 and audiobook 2014 manifestations remain distinct.

Publisher plot synopsis, not a full-novel audit or evidence of a real predictive relationship. Thomas Pynchon is the author; Frank Miller’s illustration and George Guidall’s audio narration are separate edition roles. Paperback 2006, ebook 2012 and audiobook 2014 manifestations remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Broad thematic relation; not a literal account of artificial general intelligence.",
  "dated": true,
  "year": 1973
}

Berserker

The author-site account of Berserker traces its machines to a war in which two alien races destroyed each other and left their weapons behind.

Self-aware computers guide the enormous battlecraft as they spread destruction toward the human Empire.

The collection follows vulnerable living creatures who fight the machines to a standstill, making resistance to automated extermination its shared premise.

Sources and details

Berserker — author-site collection description

{
  "access_scope": "Author-site description of the 1967 Berserker collection and listed stories, not the complete series or a full reading. The self-aware weapons are fictional. JSS Literary Productions’ listed e-book manifestation does not supply a separate original publication date.",
  "authors": [
    "Fred Saberhagen"
  ],
  "authors_in_source_order": [
    "Fred Saberhagen"
  ],
  "dates": {
    "copyright_year": "1967",
    "inspected_ebook_date": "not specified",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "retrieved_utc": "2026-10-07T18:13:48.393610+00:00"
  },
  "id": "work-culture-95fb6a685c0721::S1",
  "title": "Berserker — author-site collection description",
  "url": "https://berserker.com/bk_berserker.htm"
}

Author-site description of the 1967 Berserker collection and listed stories, not the complete series or a full reading. The self-aware weapons are fictional. JSS Literary Productions’ listed e-book manifestation does not supply a separate original publication date.

Author-site description of the 1967 Berserker collection and listed stories, not the complete series or a full reading. The self-aware weapons are fictional. JSS Literary Productions’ listed e-book manifestation does not supply a separate original publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1967 dates the first book/collection, distinct from the series' first story in 1963.",
  "dated": true,
  "year": 1967
}

Summa Technologiae

Summa Technologiae compares biological evolution with technical evolution as part of Lem’s philosophical inquiry into human and nonhuman futures.

The publisher describes his view of evolution as opportunistic and shortsighted, questioning any assumption that its changes follow an orderly goal.

The contents extend that inquiry into intelligence, phantomology and the creation of worlds, placing simulated experience alongside questions of constructing life and consciousness.

Sources and details

Summa Technologiae — publisher description and contents

{
  "access_scope": "University of Minnesota Press description and contents, not the complete philosophical treatise. These are Lem’s speculative arguments and chapter subjects. Joanna Zylinska is the translator and introduction writer; original 1964 and English ebook 2013/paperback 2014 are distinct.",
  "authors": [
    "Stanisław Lem"
  ],
  "authors_in_source_order": [
    "Stanisław Lem"
  ],
  "dates": {
    "English_ebook": "March1,2013",
    "English_paperback": "January1,2014",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "original_work_year": "1964",
    "retrieved_utc": "2026-10-07T18:22:51.992731+00:00"
  },
  "id": "work-culture-c95170b325c060::S1",
  "title": "Summa Technologiae — publisher description and contents",
  "url": "https://www.upress.umn.edu/9780816689040/summa-technologiae/"
}

University of Minnesota Press description and contents, not the complete philosophical treatise. These are Lem’s speculative arguments and chapter subjects. Joanna Zylinska is the translator and introduction writer; original 1964 and English ebook 2013/paperback 2014 are distinct.

University of Minnesota Press description and contents, not the complete philosophical treatise. These are Lem’s speculative arguments and chapter subjects. Joanna Zylinska is the translator and introduction writer; original 1964 and English ebook 2013/paperback 2014 are distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Polish original 1964; English translation by Joanna Zylinska, University of Minnesota Press 2013.",
  "dated": true,
  "year": 1964
}

Harry Potter and the Methods of Rationality

Harry Potter and the Methods of Rationality changes Harry’s upbringing: Petunia marries a biochemist, and Harry grows up surrounded by science books and science fiction.

The mirror’s synopsis presents the Hogwarts letter as an opportunity to explore magic with that background and introduces Hermione, Draco and Quirrell as new companions.

The contents explicitly organize chapters around scientific method, Bayesian reasoning and cognitive biases, making those modes of inquiry visible themes in the fan fiction.

Sources and details

Harry Potter and the Methods of Rationality — Google Books mirror

{
  "access_scope": "Google Books mirror description and contents, not a full reading of 122 chapters. Source credits the author alias explicitly; mirror and PDF-format contributors are separate roles. Its February 2010 bibliographic date is not inferred to be the story’s completion date or a validation of the fictional reasoning.",
  "authors": [
    "LessWrong aka Eliezer Yudkowsky"
  ],
  "authors_in_source_order": [
    "LessWrong aka Eliezer Yudkowsky"
  ],
  "dates": {
    "completion_date": "not inferred",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "mirror_bibliographic_date": "February28,2010",
    "retrieved_utc": "2026-10-07T18:13:08.076538+00:00"
  },
  "id": "work-culture-fa844a539d094c::S1",
  "title": "Harry Potter and the Methods of Rationality — Google Books mirror",
  "url": "https://books.google.com/books/about/Harry_Potter_and_the_Methods_of_Rational.html?id=vrPQAwAAQBAJ"
}

Google Books mirror description and contents, not a full reading of 122 chapters. Source credits the author alias explicitly; mirror and PDF-format contributors are separate roles. Its February 2010 bibliographic date is not inferred to be the story’s completion date or a validation of the fictional reasoning.

Google Books mirror description and contents, not a full reading of 122 chapters. Source credits the author alias explicitly; mirror and PDF-format contributors are separate roles. Its February 2010 bibliographic date is not inferred to be the story’s completion date or a validation of the fictional reasoning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Serialized from February 28, 2010 to March 14, 2015; authorized mirror identifies author and completed status.",
  "dated": false,
  "year": "2010–2015"
}

Berserker series

The Berserker series follows automated alien fortresses whose surviving directive is to eliminate life after the war that created them.

The author-site account places the struggle among a humanity that has spread beyond Earth and the peaceful Carmpan, who rely on human defenses.

Its recurring Lady Genevieve survives the loss of her human body as a computer program, adding a displaced human mind to the saga’s destructive machines.

Sources and details

The Berserker Saga — author-site series account

{
  "access_scope": "Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.",
  "authors": [
    "Fred Saberhagen"
  ],
  "authors_in_source_order": [
    "Fred Saberhagen"
  ],
  "dates": {
    "first_collection": "1967",
    "first_story": "1963",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "page_date": "undated",
    "retrieved_utc": "2026-10-07T18:13:47.785321+00:00"
  },
  "id": "work-culture-fabd11e2fadfca::S1",
  "title": "The Berserker Saga — author-site series account",
  "url": "https://berserker.com/about_berserkers.htm"
}

Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.

Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series began in short fiction in 1963; first Berserker collection 1967. Later novels and collections have distinct dates.",
  "dated": false,
  "year": "from 1963"
}

Grand Challenge

DARPA describes the Grand Challenge as a contest intended to accelerate autonomous vehicle technologies relevant to military requirements.

No finalist completed the March 2004 route from Barstow to Primm, so its offered one-million-dollar prize went unclaimed.

In October 2005, five teams completed the 132-mile desert course; the Stanford Racing Team won in 6 hours 53 minutes and received the two-million-dollar prize.

Sources and details

Grand Challenge — DARPA innovation timeline

{
  "access_scope": "Institutional innovation-timeline account of the 2004 and 2005 contests. Reported course results do not establish later deployment or universal autonomous-driving capability; team credit does not assign individual engineering roles.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "first_contest": "March13,2004",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "retrieved_utc": "2026-10-07T18:24:56.059103+00:00",
    "second_contest": "October8,2005"
  },
  "id": "work-final-3f4e0e6671034e::S1",
  "title": "Grand Challenge — DARPA innovation timeline",
  "url": "https://www.darpa.mil/about/innovation-timeline/grand-challenge"
}

Institutional innovation-timeline account of the 2004 and 2005 contests. Reported course results do not establish later deployment or universal autonomous-driving capability; team credit does not assign individual engineering roles.

Institutional innovation-timeline account of the 2004 and 2005 contests. Reported course results do not establish later deployment or universal autonomous-driving capability; team credit does not assign individual engineering roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": false,
  "year": null
}

Culture series

The Culture series imagines a society in which humans and machines live symbiotically, rather than treating machine intelligence as a separate civilization.

The official summaries contrast the search for a fugitive Mind in Consider Phlebas with a game whose winner becomes emperor in The Player of Games.

Use of Weapons adds agents and a drone to that political landscape, giving different novels distinct ways to explore intervention, conflict and personal history.

Sources and details

The Works - Iain Banks

{
  "access_scope": "Official Iain Banks publication summaries; fictional premises of named books, not an exhaustive definition of the Culture or evidence about real AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:48.160015+00:00"
  },
  "id": "work-coverage-af584b67698682::S1",
  "publisher": "Iain Banks official site",
  "title": "The Works - Iain Banks",
  "url": "https://iainbanks.co.uk/the-works/"
}

Official Iain Banks publication summaries; fictional premises of named books, not an exhaustive definition of the Culture or evidence about real AI.

Official Iain Banks publication summaries; fictional premises of named books, not an exhaustive definition of the Culture or evidence about real AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Series range from Consider Phlebas to The Hydrogen Sonata; not the publication date of a single work.",
  "dated": true,
  "year": 1987
}

Steps Toward Artificial Intelligence

Steps Toward Artificial Intelligence organizes heuristic programming around search, pattern recognition, learning, planning and induction.

Minsky explains how experience and recognition can narrow a search, while planning can replace it with a smaller and more suitable exploration.

The historical review uses existing programs and literature to connect these techniques, including the possibility that useful heuristics may occasionally fail.

Sources and details

Steps Toward Artificial Intelligence - - -Marvin Minsky

{
  "access_scope": "Historical review text hosted at MIT; reception date is distinct from publication, and early program assessments are not contemporary capability claims.",
  "authors": [
    "Marvin Minsky"
  ],
  "authors_in_source_order": [
    "Marvin Minsky"
  ],
  "dates": {
    "manuscript_received": "October 24, 1960",
    "retrieved_utc": "2026-10-07T18:22:12.918561+00:00"
  },
  "id": "work-coverage-faaefae07c0a7e::S1",
  "publisher": "MIT-hosted Minsky paper",
  "title": "Steps Toward Artificial Intelligence  - - -Marvin Minsky",
  "url": "https://www.mit.edu/~dxh/marvin/web.media.mit.edu/~minsky/papers/steps.html"
}

Historical review text hosted at MIT; reception date is distinct from publication, and early program assessments are not contemporary capability claims.

Historical review text hosted at MIT; reception date is distinct from publication, and early program assessments are not contemporary capability claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "January 1961 publication; manuscript received October 24, 1960.",
  "dated": true,
  "year": 1961
}

Fiasco

Fiasco follows an expedition attempting contact with the inhabitants of Quinta, with the journey itself complicated by the story’s treatment of time.

Fernando Krapp’s publisher-hosted account reads the encounter as a challenge to human assumptions about understanding other intelligences.

That reading makes failed communication central: the existence of an alien civilization need not imply that it wants contact with humanity.

Sources and details

"Fiasco", la última novela de ciencia ficción de Stanislaw Lem en Página/12 - interZona

{
  "access_scope": "Interzona-hosted commentary on Stanisław Lem’s fiction and its Spanish translation; Krapp’s interpretation is distinct from Lem’s authorship and from factual claims about extraterrestrial intelligence.",
  "authors": [
    "Fernando Krapp"
  ],
  "authors_in_source_order": [
    "Fernando Krapp"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:30.356642+00:00"
  },
  "id": "work-culture-0ecb118ecfa881::S1",
  "publisher": "Interzona",
  "title": "\"Fiasco\", la última novela de ciencia ficción de Stanislaw Lem en Página/12 - interZona",
  "url": "https://interzonaeditora.com/noticias/quot-fiasco-quot-la-ultima-novela-de-ciencia-ficcion-de-stanislaw-lem-1584"
}

Interzona-hosted commentary on Stanisław Lem’s fiction and its Spanish translation; Krapp’s interpretation is distinct from Lem’s authorship and from factual claims about extraterrestrial intelligence.

Interzona-hosted commentary on Stanisław Lem’s fiction and its Spanish translation; Krapp’s interpretation is distinct from Lem’s authorship and from factual claims about extraterrestrial intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "first_translation_publication",
      "language": "German",
      "year": 1986
    },
    {
      "kind": "first_original_language_publication",
      "language": "Polish",
      "year": 1987
    },
    {
      "kind": "first_English_translation",
      "year": 1987
    }
  ],
  "date_note": "German translation by Hubert Schumann, S. Fischer, 1986; Polish Fiasko, Wydawnictwo Literackie, 1987; English translation by Michael Kandel, Harcourt Brace Jovanovich, 1987. Preserve 1986 as earliest publication and identify language. Exact calendar dates not established here.",
  "dated": true,
  "year": 1986
}

The Algorithms for Love

The Algorithms for Love follows Elena, a toy designer whose speaking dolls make rule-driven behavior feel personal to their users.

Her demonstration of Laura exposes a gap between grammatically formed sentences and meaningful understanding, even while the toy can react to its surroundings.

The narrator also describes familiar exchanges with Brad as routines, connecting the fictional machine’s responses with her unease about human intimacy.

Sources and details

Strange Horizons - The Algorithms for Love By Ken Liu

{
  "access_scope": "Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.",
  "authors": [
    "Ken Liu"
  ],
  "authors_in_source_order": [
    "Ken Liu"
  ],
  "dates": {
    "issue": "12 July 2004",
    "retrieved_utc": "2026-10-07T18:11:20.396101+00:00"
  },
  "id": "work-culture-5a356983d944bb::S1",
  "publisher": "Strange Horizons",
  "title": "Strange Horizons - The Algorithms for Love By Ken Liu",
  "url": "https://strangehorizons.com/wordpress/fiction/the-algorithms-for-love/"
}

Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.

Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "July 2004 Strange Horizons; author and original publisher confirm.",
  "dated": true,
  "year": 2004
}

Revelation Space universe

The Revelation Space universe links several of Alastair Reynolds’s novels through a shared setting while allowing different narrative routes through it.

His author account describes Revelation Space as slower-than-light space opera and Chasm City as a pursuit-and-revenge thriller in that universe.

The same account recommends a sequence for Revelation Space, Redemption Ark and Absolution Gap, while allowing Chasm City and the associated story collections to be read at other points.

Sources and details

Novels | Alastair Reynolds

{
  "access_scope": "Author’s cached novel overview and reading-order advice; distinct standalone worlds and the Revenger sequence are not merged into Revelation Space, and the page is not treated as a current exhaustive bibliography.",
  "authors": [
    "Alastair Reynolds"
  ],
  "authors_in_source_order": [
    "Alastair Reynolds"
  ],
  "dates": {
    "listed_first_UK_publication": "Revelation Space (2000)",
    "retrieved_utc": "2026-10-07T18:17:17.037061+00:00"
  },
  "id": "work-culture-c3de2e39987c25::S1",
  "publisher": "Alastair Reynolds author site",
  "title": "Novels | Alastair Reynolds",
  "url": "https://www.alastairreynolds.com/novels/"
}

Author’s cached novel overview and reading-order advice; distinct standalone worlds and the Revenger sequence are not merged into Revelation Space, and the page is not treated as a current exhaustive bibliography.

Author’s cached novel overview and reading-order advice; distinct standalone worlds and the Revenger sequence are not merged into Revelation Space, and the page is not treated as a current exhaustive bibliography.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2000 marks first novel, not first fiction in this universe; Dilation Sleep appeared in 1990. Open corpus endpoint is not a claim of continuous publication.",
  "dated": false,
  "year": "2000–"
}

Deus Ex

Deus Ex’s original 2000 game became the basis for Revision, a fan-created overhaul authorized by Square Enix and Eidos-Montréal during the game’s fifteenth-anniversary celebration.

Caustic Creative’s account describes changes to environments, music and world-building, alongside community enhancements to textures, rendering and gameplay modes.

The announcement presents the mod as another way to experience the original game, keeping that intervention distinct from the later Mankind Divided sequel.

Sources and details

Announcing Revision Mod for the Original Deus Ex | Eidos-Montréal

{
  "access_scope": "Historical publisher announcement about Revision and the original Deus Ex; mod features belong to Caustic Creative’s version, not the original release or a current availability guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:24:52.836966+00:00"
  },
  "id": "work-culture-c590c3dacb4088::S1",
  "publisher": "Eidos-Montréal",
  "title": "Announcing Revision Mod for the Original Deus Ex | Eidos-Montréal",
  "url": "https://www.eidosmontreal.com/news/announcing-revision-mod-for-the-original-deus-ex/"
}

Historical publisher announcement about Revision and the original Deus Ex; mod features belong to Caustic Creative’s version, not the original release or a current availability guarantee.

Historical publisher announcement about Revision and the original Deus Ex; mod features belong to Caustic Creative’s version, not the original release or a current availability guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "2000 original game. Current Steam product is Game of the Year Edition; its listing supplies the original year and developer, but a reissue listing should not be treated as the date of every edition.",
  "dated": true,
  "year": 2000
}

Brain

Brain’s institutional project history describes an effort to move neural-network learning from research into everyday products.

The team scaled a network across sixteen thousand processors and tested learning from images drawn from millions of videos without supplying a cat description in advance.

The account records the project’s move from X to Google in 2012, placing the experiment within a particular organizational and technical history.

Sources and details

Brain - A Google X Moonshot

{
  "access_scope": "X’s retrospective account of Brain; its cat-recognition description is attributed to that historical project account, not proof of consciousness, a complete model specification or a current organization description.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "project_graduation": "2012",
    "project_work_began": "2011",
    "retrieved_utc": "2026-10-07T18:13:44.810914+00:00"
  },
  "id": "work-final-ea3222e86ba379::S1",
  "publisher": "X",
  "title": "Brain - A Google X Moonshot",
  "url": "https://x.company/projects/brain/"
}

X’s retrospective account of Brain; its cat-recognition description is attributed to that historical project account, not proof of consciousness, a complete model specification or a current organization description.

X’s retrospective account of Brain; its cat-recognition description is attributed to that historical project account, not proof of consciousness, a complete model specification or a current organization description.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": false,
  "year": null
}

The DARPA Grand Challenge: Ten Years Later

The DARPA Grand Challenge: Ten Years Later recounts how a failed 2004 desert race helped build a wider autonomous-vehicle research community.

Its retrospective separates that unfinished first course from the 2005 competition won by Stanley and the 2007 Urban Challenge involving traffic and driving rules.

The article presents prize competitions as a way to attract new participants and technologies, while acknowledging the difficulty of quantifying their later effects.

Sources and details

The DARPA Grand Challenge: Ten Years Later

{
  "access_scope": "DARPA’s dated institutional retrospective; different challenges and course distances remain distinct, and historical competition success does not establish unrestricted autonomous-road safety.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "March 13, 2014",
    "retrieved_utc": "2026-10-07T18:24:57.314008+00:00"
  },
  "id": "work-final-eb13f5825d8c14::S1",
  "publisher": "DARPA",
  "title": "The DARPA Grand Challenge: Ten Years Later",
  "url": "https://www.darpa.mil/news/2014/grand-challenge-ten-years-later"
}

DARPA’s dated institutional retrospective; different challenges and course distances remain distinct, and historical competition success does not establish unrestricted autonomous-road safety.

DARPA’s dated institutional retrospective; different challenges and course distances remain distinct, and historical competition success does not establish unrestricted autonomous-road safety.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 2014-03-13.",
  "dated": true,
  "year": "2014-03-13"
}

The promising future of cognitive science and artificial intelligence

The promising future of cognitive science and artificial intelligence asks how machine learning compares with human learning.

Hanbo Xie’s commentary describes an earlier study using novel-character recognition and a temporally complex game to compare sample efficiency.

The accessible prose reports faster human learning and stronger generalization in those tasks, using the comparison to motivate research across cognitive science and AI.

Sources and details

The promising future of cognitive science and artificial intelligence

{
  "access_scope": "Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.",
  "authors": [
    "Hanbo Xie"
  ],
  "authors_in_source_order": [
    "Hanbo Xie"
  ],
  "dates": {
    "citation_publication_date": "2023/04",
    "published": "10 March 2023",
    "retrieved_utc": "2026-10-07T18:16:57.591836+00:00",
    "version_of_record": "10 March 2023"
  },
  "id": "work-focused-758a08160bf023::S1",
  "publisher": "Nature Reviews Psychology",
  "title": "The promising future of cognitive science and artificial intelligence",
  "url": "https://www.nature.com/articles/s44159-023-00170-3"
}

Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.

Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2023-03-10",
      "kind": "publication",
      "year": 2023
    },
    {
      "date": "2023-04",
      "kind": "issue_date",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-03-10"
}

The Global Security Risks of Open-Source AI Models

The Global Security Risks of Open-Source AI Models examines how civilian model access could be repurposed for disinformation, surveillance and other security threats.

Samuel Segun’s article weighs accessibility and collaborative development against misuse, treating openness as a governance question rather than an unqualified benefit.

Its proposed responses include partnerships, audits and accountability mechanisms intended to balance innovation with international peace and security.

Sources and details

Research - The Global Security Risks of Open-Source AI Models

{
  "access_scope": "Attributed policy analysis published by the Global Center and identified as first published by UNODA; risks and proposed safeguards are arguments, not measured causal effects. Its example-model taxonomy is not adopted or treated as a verified openness classification.",
  "authors": [
    "Dr. Samuel Segun"
  ],
  "authors_in_source_order": [
    "Dr. Samuel Segun"
  ],
  "dates": {
    "published": "Feb 21, 2025",
    "retrieved_utc": "2026-10-07T18:15:03.440041+00:00"
  },
  "id": "work-focused-bbb5eeb4e69740::S1",
  "publisher": "Global Center on AI Governance",
  "title": "Research - The Global Security Risks of Open-Source AI Models",
  "url": "https://www.globalcenter.ai/research/the-global-security-risks-of-open-source-ai-models"
}

Attributed policy analysis published by the Global Center and identified as first published by UNODA; risks and proposed safeguards are arguments, not measured causal effects. Its example-model taxonomy is not adopted or treated as a verified openness classification.

Attributed policy analysis published by the Global Center and identified as first published by UNODA; risks and proposed safeguards are arguments, not measured causal effects. Its example-model taxonomy is not adopted or treated as a verified openness classification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-02-21",
      "kind": "publisher_page_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-02-21"
}

Human relations at work

Human relations at work includes a view of leadership in which organizational meaning deserves attention alongside economic performance.

In Martha Lagace’s interview, three Harvard Business School researchers trace that view through scholarship treating organizations as social systems with shared purposes and values.

They argue that judging leaders only by financial results can overlook their contribution to employees’ sense of meaning, presenting an opportunity for research and practice.

Sources and details

How to Put Meaning Back into Leading | Working Knowledge

{
  "access_scope": "HBS Working Knowledge interview about a leadership working paper; the family entry is bounded to this meaning-making perspective, not all human-relations scholarship or an empirical promise of better financial returns.",
  "authors": [
    "Martha Lagace"
  ],
  "authors_in_source_order": [
    "Martha Lagace"
  ],
  "dates": {
    "published": "January 10, 2005",
    "retrieved_utc": "2026-10-07T18:11:31.584058+00:00"
  },
  "id": "hawthorne::S1",
  "publisher": "Harvard Business School Working Knowledge",
  "title": "How to Put Meaning Back into Leading | Working Knowledge",
  "url": "https://www.library.hbs.edu/working-knowledge/how-to-put-meaning-back-into-leading"
}

HBS Working Knowledge interview about a leadership working paper; the family entry is bounded to this meaning-making perspective, not all human-relations scholarship or an empirical promise of better financial returns.

HBS Working Knowledge interview about a leadership working paper; the family entry is bounded to this meaning-making perspective, not all human-relations scholarship or an empirical promise of better financial returns.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1924
}

Tom Hanks

Tom Hanks is named as a star of Here in Metaphysic’s announcement of its AI production role on the film.

The release describes face replacement and de-ageing layered over actors’ performances, with on-set feedback intended to help them test younger versions of their characters.

That production account places the actor’s work within a collaboration involving Robert Zemeckis and the visual-effects team, rather than assigning the underlying AI tools to Hanks.

Sources and details

Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's "Here"

{
  "access_scope": "Metaphysic’s pre-release promotional announcement about Here; production claims are attributed to the company and quoted filmmakers, not independently measured quality or proof that Hanks designed AI systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "Jan. 31, 2023",
    "retrieved_utc": "2026-10-07T17:55:24.830287+00:00"
  },
  "id": "creative-person-coverage-2a79848d6f9b83::S1",
  "publisher": "Metaphysic release distributed by PRNewswire",
  "title": "Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's \"Here\"",
  "url": "https://www.prnewswire.com/news-releases/metaphysic-announces-strategic-partnership-with-creative-artists-agency-named-generative-ai-provider-for-miramaxs-here-301734767.html"
}

Metaphysic’s pre-release promotional announcement about Here; production claims are attributed to the company and quoted filmmakers, not independently measured quality or proof that Hanks designed AI systems.

Metaphysic’s pre-release promotional announcement about Here; production claims are attributed to the company and quoted filmmakers, not independently measured quality or proof that Hanks designed AI systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arnold Schwarzenegger

Arnold Schwarzenegger plays the protective Terminator in Terminator 2: Judgment Day, according to AFI’s cast record.

AFI’s synopsis follows the machine as it protects John Connor and learns that the boy’s orders can restrict its use of violence.

Its final recognition of human tears gives that fictional protector a different trajectory from the pursuing T-1000.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [
    "Jeremy Carr"
  ],
  "authors_in_source_order": [
    "Jeremy Carr"
  ],
  "dates": {
    "film_year": "1991",
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "creative-person-coverage-06b27415f6552a::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rutger Hauer

Rutger Hauer is credited as Roy Batty in Blade Runner, the replicant leader described in AFI’s synopsis.

The character’s pursuit of his creator is tied to a limited lifespan, making survival central to the film’s conflict.

AFI recounts Batty saving Deckard before his own death, ending the chase with an act the surviving human struggles to explain.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Blade Runner; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [
    "Austin Hodaie"
  ],
  "authors_in_source_order": [
    "Austin Hodaie"
  ],
  "dates": {
    "film_year": "1982",
    "retrieved_utc": "2026-10-07T17:55:08.437795+00:00"
  },
  "id": "creative-person-coverage-2f8473ca486e47::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/68260-BLADE-RUNNER"
}

AFI cast/history/synopsis for Blade Runner; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Blade Runner; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sigourney Weaver

Sigourney Weaver is credited as Ripley in Alien, whose response to the ship’s priorities becomes central to AFI’s narrative account.

Ripley discovers that recovering the alien takes precedence over the crew’s survival, bringing the ship’s computer and corporate instructions into the conflict.

After the robot Ash is exposed, her attempt to escape and destroy the creature carries the story from institutional betrayal to a struggle for survival.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_year": "1979",
    "retrieved_utc": "2026-10-07T17:55:07.996027+00:00"
  },
  "id": "creative-person-coverage-a629df8b720455::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/53908"
}

AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Holm

Ian Holm is credited as Ash in Alien, a character AFI’s synopsis reveals to be a robot.

Ash’s protection of the alien clashes with the crew’s survival, and his attack on Ripley exposes the hidden allegiance behind his apparent membership of the crew.

The repaired character’s communication function allows him to express admiration for the organism, turning a supposedly helpful crew member into an embodiment of the conflicting mission.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_year": "1979",
    "retrieved_utc": "2026-10-07T17:55:07.996027+00:00"
  },
  "id": "creative-person-coverage-2e487003c649d5::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/53908"
}

AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Alien; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lance Henriksen

Lance Henriksen is credited as Bishop in Aliens, whose actions form part of AFI’s account of the rescue attempt.

Bishop pilots the spacecraft back to Ripley and Newt as the colony world is about to explode, allowing them to escape.

The alien queen then tears him in half aboard the ship, placing his help and vulnerability within the fictional rescue rather than treating a cast credit as an account of robot engineering.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Aliens; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_year": "1986",
    "retrieved_utc": "2026-10-07T17:55:29.781533+00:00"
  },
  "id": "creative-person-coverage-766b903a08920a::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/68347"
}

AFI cast/history/synopsis for Aliens; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Aliens; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Patrick

Robert Patrick is credited as the T-1000 in Terminator 2: Judgment Day, the pursuing machine in AFI’s account.

The synopsis describes a liquid-metal prototype that recovers from attacks and adopts other people’s forms to reach John Connor.

Its impersonation of Sarah near the final confrontation makes deceptive appearance part of the threat, contrasting with the Terminator sent to protect the boy.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [
    "Jeremy Carr"
  ],
  "authors_in_source_order": [
    "Jeremy Carr"
  ],
  "dates": {
    "film_year": "1991",
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "creative-person-coverage-2afe5bdcfd6559::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linda Hamilton

Linda Hamilton reprises Sarah Connor in Terminator 2: Judgment Day, with AFI documenting physical and combat preparation for the role.

The synopsis places Sarah between protecting her son and trying to prevent the machine-dominated future she describes.

Her final confrontation with a machine impersonating her turns recognition and family loyalty into concrete stakes in the story.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [
    "Jeremy Carr"
  ],
  "authors_in_source_order": [
    "Jeremy Carr"
  ],
  "dates": {
    "film_year": "1991",
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "creative-person-coverage-9acde8e5fb8b4f::S1",
  "publisher": "AFI",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

AFI cast/history/synopsis for Terminator 2: Judgment Day; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ryan Gosling

Ryan Gosling plays LAPD Officer K in Blade Runner 2049, as identified in Sony’s official synopsis.

K uncovers a concealed discovery that the synopsis presents as capable of destabilizing the remaining society.

That discovery sends him in search of Rick Deckard, linking the new character’s investigation to the former blade runner thirty years after the first film.

Sources and details

Blade Runner 2049 | Sony Pictures United Kingdom

{
  "access_scope": "Sony official synopsis for Blade Runner 2049; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_year": "2017",
    "retrieved_utc": "2026-10-07T17:56:07.948011+00:00"
  },
  "id": "creative-person-coverage-b90b3a9257d3db::S1",
  "publisher": "Sony Pictures",
  "title": "Blade Runner 2049 | Sony Pictures United Kingdom",
  "url": "https://www.sonypictures.co.uk/movies/blade-runner-2049"
}

Sony official synopsis for Blade Runner 2049; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

Sony official synopsis for Blade Runner 2049; the credited performance and fictional character actions do not establish the actor’s authorship of machine mechanisms, individual screenplay decisions or facts about real AI. No alternate film editions are merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harrison Chase

Harrison Chase’s contribution is described by LangChain’s own history as a Python package he began as a side project in late 2022.

The account says he and Ankush Gola established the company in early 2023, then developed LangGraph to give developers control over complex agent runtimes.

It distinguishes those open source frameworks from LangSmith, a commercial platform for observing, evaluating, deploying, and improving agents.

Sources and details

About LangChain: an open platform to own your intelligence

{
  "access_scope": "Corporate history and product account; no individual authorship or adoption claim inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:55.267067+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-011175ec36ffa1::S1",
  "title": "About LangChain: an open platform to own your intelligence",
  "url": "https://www.langchain.com/about"
}

Corporate history and product account; no individual authorship or adoption claim inferred.

Corporate history and product account; no individual authorship or adoption claim inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Lattner

Chris Lattner’s personal account describes building MLIR with a team at Google, beginning with a whitepaper in April 2018.

He presents its multiple levels of intermediate representation as infrastructure for graph transformations, accelerators, and the tools connecting them.

The account places MLIR within the LLVM umbrella and identifies its use by other LLVM projects, including Flang and CIRCT.

Sources and details

Chris Lattner's Homepage

{
  "access_scope": "First-person technical history; team participation preserved, adoption claims attributed.",
  "authors": [
    "Chris Lattner"
  ],
  "authors_in_source_order": [
    "Chris Lattner"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:59.075686+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-25a39821c82285::S1",
  "title": "Chris Lattner's Homepage",
  "url": "https://www.nondot.org/sabre/"
}

First-person technical history; team participation preserved, adoption claims attributed.

First-person technical history; team participation preserved, adoption claims attributed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeremy Howard

Jeremy Howard is identified by fast.ai as its co-founder and as the creator of the fastai software library.

The profile connects his co-authored book Deep Learning for Coders with Fastai and PyTorch to his free online course.

The institute frames these courses, software, research, and community as ways to make deep learning accessible across varied technical backgrounds.

Sources and details

About – fast.ai

{
  "access_scope": "Institutional profile and education mission; omits sweeping ULMFiT lineage and medical priority claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:52.502527+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-b9a45e1362e4dc::S1",
  "title": "About – fast.ai",
  "url": "https://www.fast.ai/about.html"
}

Institutional profile and education mission; omits sweeping ULMFiT lineage and medical priority claims.

Institutional profile and education mission; omits sweeping ULMFiT lineage and medical priority claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stella Biderman

Stella Biderman’s personal research agenda centers on how large models develop capabilities and how researchers can study open-weight systems.

Her interpretability agenda follows models through training to identify when capabilities emerge and where interventions might change outcomes.

She also describes public data, models, code, and research infrastructure as a means for academics, auditors, nonprofits, and smaller organizations to investigate AI independently.

Sources and details

Stella Biderman

{
  "access_scope": "Undated first-person agenda in cached manifestation; research intentions, not validated safety outcomes.",
  "authors": [
    "Stella Biderman"
  ],
  "authors_in_source_order": [
    "Stella Biderman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.801499+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-b6f65cd4b35296::S1",
  "title": "Stella Biderman",
  "url": "https://stellabiderman.ai/"
}

Undated first-person agenda in cached manifestation; research intentions, not validated safety outcomes.

Undated first-person agenda in cached manifestation; research intentions, not validated safety outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Raquel Urtasun

Raquel Urtasun’s University of Toronto profile records her work as chief scientist and head of R&D at Uber ATG from 2017 to 2021.

It identifies machine learning, computer vision, robotics, AI, and remote sensing as her research areas, alongside a focus on self-driving vehicles.

The same profile places that work in an academic setting through her Toronto professorship and co-founding role at the Vector Institute.

Sources and details

Raquel Urtasun

{
  "access_scope": "Academic profile with historical appointment dates; no authorship inferred from publication titles.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:50.154546+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-2f2f5e1d20e050::S1",
  "title": "Raquel Urtasun",
  "url": "https://www.cs.toronto.edu/~urtasun/"
}

Academic profile with historical appointment dates; no authorship inferred from publication titles.

Academic profile with historical appointment dates; no authorship inferred from publication titles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brett Adcock

Brett Adcock’s first-person biography describes founding Figure in 2022 to develop general-purpose humanoid robots.

It names manufacturing, logistics, warehousing, retail, and the home as intended settings for robots working alongside people.

A separate section describes Cover, begun in 2023, as a project developing passive scanners for concealed weapons with NASA’s Jet Propulsion Laboratory.

Sources and details

Bio | Brett Adcock Official

{
  "access_scope": "Founder biography; applications and partnership stated by the source, no verified safety or deployment outcomes.",
  "authors": [
    "Brett Adcock"
  ],
  "authors_in_source_order": [
    "Brett Adcock"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:48.660543+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-5784098d31b489::S1",
  "title": "Bio | Brett Adcock Official",
  "url": "https://www.brettadcock.com/bio"
}

Founder biography; applications and partnership stated by the source, no verified safety or deployment outcomes.

Founder biography; applications and partnership stated by the source, no verified safety or deployment outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Diogo Almeida

Diogo Almeida is listed as a founder and CEO on TypeSafe AI’s team page.

The company credits him with co-inventing RLHF and InstructGPT and identifies an earlier role at Google Brain.

Its description connects that research background to language-model development; it does not specify an individual share of the underlying research work.

Sources and details

Team - TypeSafe AI

{
  "access_scope": "Corporate biography; RLHF/InstructGPT credit attributed to TypeSafe rather than independent priority determination.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.821091+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-typesafe-person-local-diogoalmeida::S1",
  "title": "Team - TypeSafe AI",
  "url": "https://typesafe.ai/team"
}

Corporate biography; RLHF/InstructGPT credit attributed to TypeSafe rather than independent priority determination.

Corporate biography; RLHF/InstructGPT credit attributed to TypeSafe rather than independent priority determination.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sasha Sheng

Sasha Sheng is listed as a founder and COO on TypeSafe AI’s team page.

The profile describes earlier research-engineering work at Meta/FAIR spanning News Feed, AI Experiences, and AI Research.

It also records publications at NeurIPS and ECCV and hackathon organizing, without naming papers or assigning particular technical contributions.

Sources and details

Team - TypeSafe AI

{
  "access_scope": "Corporate biography with stated employment and publication venues; no paper authorship inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.821091+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-typesafe-person-coverage-48bb1501084c33::S1",
  "title": "Team - TypeSafe AI",
  "url": "https://typesafe.ai/team"
}

Corporate biography with stated employment and publication venues; no paper authorship inferred.

Corporate biography with stated employment and publication venues; no paper authorship inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Erik Gafni

Erik Gafni is listed as a founder and CTO on TypeSafe AI’s team page.

The profile identifies Ravel as an earlier venture involving multimodal AI for DNA sequencing and names Invitae and Freenome as previous early-employment roles.

TypeSafe describes his specialization as building production AI systems, while leaving the individual publications and patents unspecified.

Sources and details

Team - TypeSafe AI

{
  "access_scope": "Corporate biography; no clinical validation, patent identity, or individual research claim inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.821091+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-typesafe-person-coverage-4569e70f797918::S1",
  "title": "Team - TypeSafe AI",
  "url": "https://typesafe.ai/team"
}

Corporate biography; no clinical validation, patent identity, or individual research claim inferred.

Corporate biography; no clinical validation, patent identity, or individual research claim inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Microsoft AI

Microsoft AI’s cached homepage presents distinct foundational models for voice, transcription, reasoning, code, and images.

It describes MAI-Voice-2.1 as a low-latency speech model and MAI-Transcribe-2 as a system for producing domain-specific transcripts from noisy audio.

The page places MAI-Code-1.1-Flash in GitHub Copilot and VS Code, distinguishing that coding model from MAI-Thinking-1 and MAI-Image-2.6.

Sources and details

Home | Microsoft AI

{
  "access_scope": "Undated first-party model catalog; exact model versions preserved, rankings and safety aspirations excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:52.783427+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-ai-d0afb8b0dbfc7b::S1",
  "title": "Home | Microsoft AI",
  "url": "https://microsoft.ai/"
}

Undated first-party model catalog; exact model versions preserved, rankings and safety aspirations excluded.

Undated first-party model catalog; exact model versions preserved, rankings and safety aspirations excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Elastic

Elastic’s twentieth-anniversary Lucene timeline describes Elasticsearch as a distributed RESTful search engine built on Apache Lucene.

The chronology dates Elasticsearch 0.1.0 to February 7, 2010, and the founding of Elastic to February 9, 2012.

It explains the underlying search technology through Lucene features such as the Codecs API, similarity models including BM25, and doc values for analytics.

Sources and details

Celebrating 20 years of Apache Lucene | Elastic

{
  "access_scope": "Corporate historical timeline; cited release years are events, not webpage publication dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:48.040972+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-5e7c4d821aae01::S1",
  "title": "Celebrating 20 years of Apache Lucene | Elastic",
  "url": "https://www.elastic.co/de/celebrating-lucene"
}

Corporate historical timeline; cited release years are events, not webpage publication dates.

Corporate historical timeline; cited release years are events, not webpage publication dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Elastic company founded February 9, 2012. Elasticsearch project release dates to February 7, 2010; the earlier open-source project is distinct from the company.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.elastic.co/de/celebrating-lucene"
      ],
      "year": 2012
    }
  ]
}

Harvey

Harvey’s September 9, 2026 announcement reports a $550 million funding round at a $15.5 billion valuation.

It connects the financing to the introduction of a post-trained open-weight model and Harvey LAB, its Legal Agent Benchmark.

The stated aim is to help law firms, in-house legal teams, and professional-services firms build intelligence tailored to their organizations.

Sources and details

Harvey Raises $550M at a $15.5B Valuation to Help Legal Teams Own Their Intelligence

{
  "access_scope": "Dated first-party announcement; model, benchmark, funding, and intended users remain distinct; no legal-performance endorsement.",
  "authors": [
    "Harvey Team"
  ],
  "authors_in_source_order": [
    "Harvey Team"
  ],
  "dates": {
    "inspected_source_date_1": "2026-09-09",
    "retrieved_utc": "2026-10-07T17:58:24.452733+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-09-09"
  ],
  "id": "organization-company-2db7a0c30b879e::S1",
  "title": "Harvey Raises $550M at a $15.5B Valuation to Help Legal Teams Own Their Intelligence",
  "url": "https://www.harvey.ai/blog/harvey-raises-dollar550m-at-a-dollar155b-valuation-to-help-legal-teams-own-their-intelligence"
}

Dated first-party announcement; model, benchmark, funding, and intended users remain distinct; no legal-performance endorsement.

Dated first-party announcement; model, benchmark, funding, and intended users remain distinct; no legal-performance endorsement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Primary investor portfolio states founded 2022.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.harvey.ai/blog/harvey-raises-dollar550m-at-a-dollar155b-valuation-to-help-legal-teams-own-their-intelligence",
        "https://sequoiacap.com/companies/harvey",
        "https://www.harvey.ai/company"
      ],
      "year": 2022
    }
  ]
}

Mythic

DCVC’s April 4, 2017 account presents Mythic as an edge-inference company originating in the University of Michigan Integrated Circuits Lab.

It describes a hybrid digital-and-analog design that moves neural-network computation into memory structures holding model parameters.

The investor’s explanation distinguishes running trained models on local devices from the much larger computation involved in training them.

Sources and details

DCVC | Learning from CERN & Nervana: Why DCVC Backed Mythic to…

{
  "access_scope": "Historical investor account; omits unverified power, security, battery-life, and shipment projections.",
  "authors": [
    "DCVC"
  ],
  "authors_in_source_order": [
    "DCVC"
  ],
  "dates": {
    "inspected_source_date_1": "2017-04-04",
    "retrieved_utc": "2026-10-07T18:00:47.105255+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017-04-04"
  ],
  "id": "organization-company-54cd635db51c55::S1",
  "title": "DCVC | Learning from CERN & Nervana: Why DCVC Backed Mythic to…",
  "url": "https://www.dcvc.com/news-insights/learning-from-cern-nervana-why-dcvc-backed-mythic-to-deliver-ai-power-to-the-edge/"
}

Historical investor account; omits unverified power, security, battery-life, and shipment projections.

Historical investor account; omits unverified power, security, battery-life, and shipment projections.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Investor account dates origin at University of Michigan lab to 2012; company-issued release explicitly says founded in 2012.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.dcvc.com/news-insights/learning-from-cern-nervana-why-dcvc-backed-mythic-to-deliver-ai-power-to-the-edge/",
        "https://www.prnewswire.com/news-releases/greg-waters-joins-mythic-board-of-directors-301073249.html"
      ],
      "year": 2012
    }
  ]
}

Pachama

Jonathan Goldberg’s November 2025 announcement describes Pachama’s platform for monitoring, reporting, and verifying forest-carbon projects.

The acquisition account says those digital tools would become part of Carbon Direct’s carbon-credit development, assessment, and management services.

The cached September 2026 update notes that Carbon Direct later adopted the name Relae, while retaining the original acquisition narrative.

Sources and details

Carbon Direct (Now Relae) Acquires Pachama November 2025 | Relae

{
  "access_scope": "Visible publication and last-update dates preferred over conflicting JSON-LD dates; Pachama and acquirer remain distinct entities.",
  "authors": [
    "Jonathan Goldberg"
  ],
  "authors_in_source_order": [
    "Jonathan Goldberg"
  ],
  "dates": {
    "inspected_source_date_1": "2025-11-10",
    "inspected_source_date_2": "2026-09-21",
    "retrieved_utc": "2026-10-07T18:02:33.354798+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-11-10",
    "2026-09-21"
  ],
  "id": "organization-company-d8037ba04e72c1::S1",
  "title": "Carbon Direct (Now Relae) Acquires Pachama November 2025 | Relae",
  "url": "https://www.carbon-direct.com/insights/carbon-direct-acquires-pachama"
}

Visible publication and last-update dates preferred over conflicting JSON-LD dates; Pachama and acquirer remain distinct entities.

Visible publication and last-update dates preferred over conflicting JSON-LD dates; Pachama and acquirer remain distinct entities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "YC portfolio and cofounder account identify 2018.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.ycombinator.com/companies/pachama",
        "https://www.carbon-direct.com/insights/carbon-direct-acquires-pachama",
        "https://www.carbon-direct.com/team/diego-saez-gil"
      ],
      "year": 2018
    }
  ]
}

Seldon

Nikunj Bajaj’s July 23, 2026 announcement describes Seldon’s business as serving conventional machine-learning models in real time on Kubernetes.

The account says TrueFoundry acquired Seldon’s business and customers and would continue their ML workloads through its AI Deploy platform.

It presents an additional path toward agentic applications through an AI Gateway connecting and governing model, agent, and tool calls on the same infrastructure.

Sources and details

TrueFoundry + Seldon: Unified Control Plane for Enterprise AI

{
  "access_scope": "Acquirer announcement about business/customer transfer, not an unsupported legal-entity merger or completed migration guarantee.",
  "authors": [
    "Nikunj Bajaj"
  ],
  "authors_in_source_order": [
    "Nikunj Bajaj"
  ],
  "dates": {
    "inspected_source_date_1": "2026-07-23",
    "retrieved_utc": "2026-10-07T17:58:00.744598+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-07-23"
  ],
  "id": "organization-company-2c929de22fc129::S1",
  "title": "TrueFoundry + Seldon: Unified Control Plane for Enterprise AI",
  "url": "https://truefoundry.webflow.io/blog/truefoundry-seldon-unified-control-plane-for-enterprise-ai"
}

Acquirer announcement about business/customer transfer, not an unsupported legal-entity merger or completed migration guarantee.

Acquirer announcement about business/customer transfer, not an unsupported legal-entity merger or completed migration guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company incorporated August 28, 2014 (Companies House 09188032); investor explicitly says founded in 2014 by Alex Housley.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.amadeuscapital.com/machine-learning-devops-company-seldon-raises-7-1m-series-a/",
        "https://find-and-update.company-information.service.gov.uk/company/09188032",
        "https://find-and-update.company-information.service.gov.uk/company/09188032/insolvency",
        "https://www.linkedin.com/posts/truefoundry_today-were-announcing-that-truefoundry-activity-7475608712376643584-Vw_t",
        "https://truefoundry.webflow.io/blog/truefoundry-seldon-unified-control-plane-for-enterprise-ai"
      ],
      "year": 2014
    }
  ]
}

Tenable

Tenable’s April 2008 Nessus retrospective explains how vulnerability checks moved from C into the NASL scripting language.

Renaud Deraison describes service recognition that identifies a service by its responses even when it runs on an unexpected port.

He also recounts SSL support that let existing plugins use encrypted connections without requiring extensive plugin changes.

Sources and details

Nessus turns 10 ! - Blog | Tenable®

{
  "access_scope": "Historical Nessus mechanism account published by Tenable; not present-day security assurance.",
  "authors": [
    "Renaud Deraison"
  ],
  "authors_in_source_order": [
    "Renaud Deraison"
  ],
  "dates": {
    "inspected_source_date_1": "2008-04-04",
    "retrieved_utc": "2026-10-07T17:59:00.552895+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2008-04-04"
  ],
  "id": "organization-company-671d55f698e273::S1",
  "title": "Nessus turns 10 ! - Blog | Tenable®",
  "url": "https://de.tenable.com/blog/nessus-turns-10"
}

Historical Nessus mechanism account published by Tenable; not present-day security assurance.

Historical Nessus mechanism account published by Tenable; not present-day security assurance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Multiple company histories state 2002 founding; one founder retrospective says the corporate entity was founded in 2003, so this is not an independently verified incorporation year.",
      "date": "2002",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.tenable.com/blog/exciting-technical-career-opportunities-at-tenable",
        "https://static.tenable.com/campaigns/regional-webinars/n/15/1/vulnerability-management-for-mobility.pdf",
        "https://docs.tenable.com/pdfs/how-tenable-uses-ai-and-machine-learning.pdf",
        "https://de.tenable.com/blog/nessus-turns-10",
        "https://investors.tenable.com/static-files/02d8536a-2b49-48dd-8239-dbd29007a34e"
      ],
      "year": 2002
    }
  ]
}

AMD

AMD’s May 1, 2024 anniversary article describes Ryzen 7040 and 8040 mobile processors as combining an NPU with CPU and integrated-GPU resources for AI workloads.

Its demonstration used Photoshop Neural Filters and Topaz Photo AI on a Ryzen AI laptop to restore and colorize archival photographs.

The article warns that AI restoration, colorization, and upscaling can produce inaccurate results and do not replace professional restoration.

Sources and details

AMD 55th Anniversary Special: Relive History with AMD Ryzen™ AI

{
  "access_scope": "Version-specific first-party demonstration with its explicit limitation; no contemporary hardware generalization.",
  "authors": [
    "AMD AI Group"
  ],
  "authors_in_source_order": [
    "AMD AI Group"
  ],
  "dates": {
    "inspected_source_date_1": "2024-05-01",
    "retrieved_utc": "2026-10-07T18:23:22.132767+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-05-01"
  ],
  "id": "supply-org-002::S1",
  "title": "AMD 55th Anniversary Special: Relive History with AMD Ryzen™ AI",
  "url": "https://www.amd.com/en/blogs/2024/amd-55th-anniversary-special-relive-history-with-.html"
}

Version-specific first-party demonstration with its explicit limitation; no contemporary hardware generalization.

Version-specific first-party demonstration with its explicit limitation; no contemporary hardware generalization.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "1969",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.amd.com/en/blogs/2024/amd-55th-anniversary-special-relive-history-with-.html",
        "https://www.amd.com/en/corporate.html",
        "https://ir.amd.com/financial-information/sec-filings/content/0000898430-96-000902/EX-13.txt"
      ],
      "year": 1969
    }
  ]
}

Recursive self-improvement

DeepMind’s May 14, 2025 AlphaEvolve account illustrates a bounded feedback loop in which Gemini models propose programs and automated evaluators score them.

An evolutionary program database selects promising candidates to inform subsequent proposals, extending the search beyond a single function to whole codebases.

The team reports optimizations to Gemini training computations, including computations used by models underlying AlphaEvolve itself; this is a concrete optimization example rather than evidence of unrestricted autonomous self-improvement.

Sources and details

AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms — Google DeepMind

{
  "access_scope": "Specific program-evolution and infrastructure optimization account; reported results attributed, general recursive capability not established.",
  "authors": [
    "AlphaEvolve team"
  ],
  "authors_in_source_order": [
    "AlphaEvolve team"
  ],
  "dates": {
    "inspected_source_date_1": "2025-05-14",
    "retrieved_utc": "2026-10-07T17:54:20.468485+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-05-14"
  ],
  "id": "concept-rsi::S1",
  "title": "AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms — Google DeepMind",
  "url": "https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/"
}

Specific program-evolution and infrastructure optimization account; reported results attributed, general recursive capability not established.

Specific program-evolution and infrastructure optimization account; reported results attributed, general recursive capability not established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

UiPath

UiPath’s annual report for the fiscal year ended January 31, 2026 describes its platform as coordinating automation, AI agents, and people in end-to-end processes.

The filing presents agent orchestration, governance, and lifecycle oversight as operational requirements as organizations give agents more autonomy.

It also describes configurable vertical solutions combining agents, models, and workflows with customers’ own data and regulatory guardrails.

Sources and details

March 25, 2026 - 10-K: Annual report [Section 13 and 15(d), not S-K Item 405] | UiPath, Inc. (PATH)

{
  "access_scope": "Issuer Form 10-K filed March 25, 2026; company strategy and product description, not proof of customer return or risk control.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2026-03-25",
    "retrieved_utc": "2026-10-07T17:59:57.152021+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-03-25"
  ],
  "id": "organization-company-72797d26e23376::S1",
  "title": "March 25, 2026 - 10-K: Annual report [Section 13 and 15(d), not S-K Item 405] | UiPath, Inc. (PATH)",
  "url": "https://ir.uipath.com/financials/sec-filings/content/0001734722-26-000012/path-20260131.htm"
}

Issuer Form 10-K filed March 25, 2026; company strategy and product description, not proof of customer return or risk control.

Issuer Form 10-K filed March 25, 2026; company strategy and product description, not proof of customer return or risk control.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Established in Bucharest 2005 as DeskOver; Delaware incorporation June 9, 2015 and UiPath name are later milestones.",
      "date": "2005",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.uipath.com/hubfs/resources/documents/event_PDFs/Main-session-and-Breakout-1.pdf",
        "https://ir.uipath.com/financials/sec-filings/content/0001734722-26-000012/path-20260131.htm",
        "https://marketplace.uipath.com/organizations/uipath"
      ],
      "year": 2005
    }
  ]
}

NextEra

NextEra’s October 2025 release describes a 25-year agreement for Google to purchase nuclear electricity from a planned restart of Iowa’s Duane Arnold Energy Center.

The company links the 615-megawatt plant to Google’s cloud and AI infrastructure and targets operation in the first quarter of 2029.

It distinguishes that restart and power-purchase agreement from a second agreement to explore new nuclear generation elsewhere in the United States.

Sources and details

NextEra Energy Newsroom - News Releases

{
  "access_scope": "Release header October27 and dateline October28 conflict retained explicitly; plans and targets, not operating capacity or assured economic benefits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2025-10-27",
    "inspected_source_date_2": "2025-10-28",
    "retrieved_utc": "2026-10-07T18:23:08.882551+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-10-27",
    "2025-10-28"
  ],
  "id": "supply-org-044::S1",
  "title": "NextEra Energy Newsroom - News Releases",
  "url": "https://newsroom.nexteraenergy.com/NextEra-Energy-and-Google-Announce-New-Collaboration-to-Accelerate-Nuclear-Energy-Deployment-in-the-U-S"
}

Release header October27 and dateline October28 conflict retained explicitly; plans and targets, not operating capacity or assured economic benefits.

Release header October27 and dateline October28 conflict retained explicitly; plans and targets, not operating capacity or assured economic benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Anthony R. Cassandra

Anthony R. Cassandra is a listed coauthor of a paper bringing operations-research methods to action selection when observations and outcomes are uncertain.

The authors introduce Markov and partially observable Markov decision processes, then outline an offline algorithm for solving the latter.

They show how some solutions can yield finite-memory controllers and discuss the complexity that motivates approximate alternatives.

Sources and details

Planning and acting in partially observable stochastic domains

{
  "access_scope": "Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Anthony R. Cassandra is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "authors_in_source_order": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "dates": {
    "publication": "1998",
    "received": "11 October 1995",
    "retrieved_utc": "2026-10-07T18:02:12.129443+00:00",
    "revised": "17 January 1998"
  },
  "id": "person-anthonyrcassandra::S1",
  "title": "Planning and acting in partially observable stochastic domains",
  "url": "https://people.csail.mit.edu/lpk/papers/aij98-pomdp.pdf"
}

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Anthony R. Cassandra is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Anthony R. Cassandra is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brendan Tracey

Brendan Tracey is a listed coauthor of a study applying reinforcement learning to magnetic control of tokamak plasmas.

The controller learns to command the full set of coils from high-level objectives while respecting physical and operational constraints.

The authors report tracking position, current and shape across several TCV configurations, including two separate plasmas maintained in one vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Brendan Tracey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "authors_in_source_order": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "dates": {
    "Accepted": "01 December 2021",
    "Issue date": "17 February 2022",
    "Published": "16 February 2022",
    "Received": "14 July 2021",
    "Version of record": "16 February 2022",
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "person-coverage-4e62b18664f6e0::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Brendan Tracey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Brendan Tracey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward McFowland III

Edward McFowland III is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Edward McFowland III is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-07486e34abaab4::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Edward McFowland III is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Edward McFowland III is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gene Kogan

Gene Kogan is the credited author of a proposal for Abraham, an artificial-art agent developed through an open network of collaborators.

The paper connects generative models with decentralized operation, suggesting that cooperative training and curation could reduce control by any single artist.

It defines autonomy, originality and uniqueness as goals and explores collective ownership of model parameters as a way to pursue them.

Sources and details

Artist in the Cloud: Towards an Autonomous Artist

{
  "access_scope": "Artist in the Cloud: Towards an Autonomous Artist. The NeurIPS 2019 text proposes criteria and an approach; it does not demonstrate that Abraham already satisfies intrinsic creativity or that decentralization guarantees privacy. Gene Kogan is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Gene Kogan"
  ],
  "authors_in_source_order": [
    "Gene Kogan"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:33.334330+00:00",
    "status": "proposal paper",
    "venue_notice": "NeurIPS 2019"
  },
  "id": "person-coverage-6adc9bb0a3c7d9::S1",
  "title": "Artist in the Cloud: Towards an Autonomous Artist",
  "url": "https://genekogan.com/misc/neurips2019.pdf"
}

Artist in the Cloud: Towards an Autonomous Artist. The NeurIPS 2019 text proposes criteria and an approach; it does not demonstrate that Abraham already satisfies intrinsic creativity or that decentralization guarantees privacy. Gene Kogan is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

Artist in the Cloud: Towards an Autonomous Artist. The NeurIPS 2019 text proposes criteria and an approach; it does not demonstrate that Abraham already satisfies intrinsic creativity or that decentralization guarantees privacy. Gene Kogan is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

J. C. R. Licklider

J. C. R. Licklider is the credited author of Man-Computer Symbiosis, which proposes close cooperation between people and electronic computers.

The proposed partnership leaves goals, hypotheses and evaluation with people while computers perform routine preparation for insights and decisions.

Licklider identifies time sharing, memory organization, programming languages and input-output equipment as prerequisites for that kind of interaction.

Sources and details

Man-Computer Symbiosis

{
  "access_scope": "Man-Computer Symbiosis. The 1960 conceptual paper is inspected in a 1990 memorial reprint; its anticipated partnership and prerequisites are proposals, not a contemporary performance evaluation. The other reprinted communication paper and Robert W. Taylor’s preface remain separate. J. C. R. Licklider is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "J.C.R. Licklider"
  ],
  "authors_in_source_order": [
    "J.C.R. Licklider"
  ],
  "dates": {
    "inspected_reprint": "In Memoriam: J. C. R. Licklider, August 7, 1990",
    "original_publication": "March 1960",
    "retrieved_utc": "2026-10-07T18:20:02.451066+00:00"
  },
  "id": "person-jcrlicklider::S1",
  "title": "Man-Computer Symbiosis",
  "url": "https://web.mit.edu/course/other/sts.035/www/PDFs/Licklider.pdf"
}

Man-Computer Symbiosis. The 1960 conceptual paper is inspected in a 1990 memorial reprint; its anticipated partnership and prerequisites are proposals, not a contemporary performance evaluation. The other reprinted communication paper and Robert W. Taylor’s preface remain separate. J. C. R. Licklider is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

Man-Computer Symbiosis. The 1960 conceptual paper is inspected in a 1990 memorial reprint; its anticipated partnership and prerequisites are proposals, not a contemporary performance evaluation. The other reprinted communication paper and Robert W. Taylor’s preface remain separate. J. C. R. Licklider is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jerome H. Friedman

Jerome H. Friedman is the credited author of a paper framing gradient boosting as numerical optimization over functions rather than parameters.

It connects stagewise additive expansions with steepest descent and develops algorithms for several regression losses and multiclass classification.

The abstract also describes regression-tree enhancements and interpretation tools, tying the boosting framework to particular model components and fitting criteria.

Sources and details

Greedy function approximation: A gradient boosting machine.

{
  "access_scope": "Greedy function approximation: A gradient boosting machine.. Publisher abstract for the October 2001 article; the 2002 online-availability date is distinct. Reported robustness is not a guarantee for every noisy dataset or a current software implementation. Jerome H. Friedman is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jerome H. Friedman"
  ],
  "authors_in_source_order": [
    "Jerome H. Friedman"
  ],
  "dates": {
    "citation_publication_date": "2001/10",
    "first_Project_Euclid_availability": "8 February 2002",
    "publication": "October 2001",
    "retrieved_utc": "2026-10-07T18:18:46.765794+00:00"
  },
  "id": "person-coverage-f0e277b1580251::S1",
  "title": "Greedy function approximation: A gradient boosting machine.",
  "url": "https://doi.org/10.1214/aos/1013203451"
}

Greedy function approximation: A gradient boosting machine.. Publisher abstract for the October 2001 article; the 2002 online-availability date is distinct. Reported robustness is not a guarantee for every noisy dataset or a current software implementation. Jerome H. Friedman is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

Greedy function approximation: A gradient boosting machine.. Publisher abstract for the October 2001 article; the 2002 online-availability date is distinct. Reported robustness is not a guarantee for every noisy dataset or a current software implementation. Jerome H. Friedman is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mohammad Aldabbas

Mohammad Aldabbas is the credited author of a dissertation examining security and governance challenges in a technologically intensive Society 5.0.

Its repository abstract combines theoretical analysis with expert interviews concerning Switzerland and quantitative forecasting of future societal indicators.

The dissertation proposes Smart Sovereignty as a framework for shifting influence toward citizens through new organizations and governance arrangements.

Sources and details

Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future

{
  "access_scope": "Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future. The repository dissertation abstract describes an exploratory framework and Swiss case; forecasts and proposed citizen governance are not demonstrated policy outcomes. Stephanie Teufel is the degree supervisor, not a coauthor. Mohammad Aldabbas is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Aldabbas, Mohammad"
  ],
  "authors_in_source_order": [
    "Aldabbas, Mohammad"
  ],
  "dates": {
    "citation_publication_date": "2023",
    "repository_manifestation": "Fribourg, Switzerland, 2023",
    "retrieved_utc": "2026-10-07T18:15:57.942175+00:00",
    "thesis": "Université de Fribourg, 2022"
  },
  "id": "person-coverage-79d20497c3ec38::S1",
  "title": "Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future",
  "url": "https://doi.org/10.51363/unifr.eth.2023.008"
}

Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future. The repository dissertation abstract describes an exploratory framework and Swiss case; forecasts and proposed citizen governance are not demonstrated policy outcomes. Stephanie Teufel is the degree supervisor, not a coauthor. Mohammad Aldabbas is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future. The repository dissertation abstract describes an exploratory framework and Swiss case; forecasts and proposed citizen governance are not demonstrated policy outcomes. Stephanie Teufel is the degree supervisor, not a coauthor. Mohammad Aldabbas is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nadav Voloch

Nadav Voloch is a listed coauthor of a systematic review treating AI both as a source of privacy risks and as a tool for privacy protection.

The authors classify 94 papers by technological domains, privacy actions, protective strategies and the direction of the AI-privacy interaction.

A queryable Neo4J graph represents relationships among the reviewed objects and can be extended with future publications.

Sources and details

Both ends of artificial intelligence impacting privacy: a review of violation and protection

{
  "access_scope": "Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Nadav Voloch is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "authors_in_source_order": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "dates": {
    "article_type": "SYSTEMATIC REVIEW",
    "citation_publication_date": "2026/02/18",
    "published": "18 February 2026",
    "retrieved_utc": "2026-10-07T18:11:02.244538+00:00"
  },
  "id": "person-coverage-105dfd2f961fea::S1",
  "title": "Both ends of artificial intelligence impacting privacy: a review of violation and protection",
  "url": "https://doi.org/10.3389/frai.2026.1686454"
}

Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Nadav Voloch is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Nadav Voloch is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Tibshirani

Robert Tibshirani is a listed coauthor of the Generalized Additive Models paper, which replaces a linear predictor with a sum of smooth covariate functions.

An iterative local-scoring procedure estimates those unspecified functions through scatterplot smoothing within likelihood-based regression.

The authors illustrate the approach with binary-response and survival data to show how nonlinear covariate effects can be uncovered.

Sources and details

Generalized Additive Models

{
  "access_scope": "Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Robert Tibshirani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Trevor Hastie",
    "Robert Tibshirani"
  ],
  "authors_in_source_order": [
    "Trevor Hastie",
    "Robert Tibshirani"
  ],
  "dates": {
    "citation_publication_date": "1986/08",
    "first_Project_Euclid_availability": "19 April 2007",
    "published": "August, 1986",
    "retrieved_utc": "2026-10-07T18:16:39.381245+00:00"
  },
  "id": "person-coverage-8c933a9a5503a3::S1",
  "title": "Generalized Additive Models",
  "url": "https://doi.org/10.1214/ss/1177013604"
}

Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Robert Tibshirani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Robert Tibshirani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shakked Noy

Shakked Noy is a listed coauthor of a working paper testing ChatGPT assistance on occupation-specific professional writing tasks.

The preregistered online experiment assigns incentivized tasks to 444 college-educated professionals and randomly gives half access to the chatbot.

The reported results combine lower completion time and higher output quality with a shift from rough drafting toward idea generation and editing.

Sources and details

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence

{
  "access_scope": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Shakked Noy is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "authors_in_source_order": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "dates": {
    "manuscript": "March 2, 2023",
    "retrieved_utc": "2026-10-07T18:21:31.407049+00:00",
    "status": "Working Paper (not peer reviewed)"
  },
  "id": "person-local-shakkednoy::S1",
  "title": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Noy_Zhang_1.pdf"
}

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Shakked Noy is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Shakked Noy is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amy Shuen

Amy Shuen is a listed coauthor of a strategic-management paper explaining competitive advantage through capabilities developed under rapid technological change.

Its framework links coordination processes with a firm’s asset positions and the paths it has inherited or adopted.

The analysis makes replication, imitation and changing demand relevant to whether an advantage endures, emphasizing organizational adaptation rather than a single static resource.

Sources and details

Dynamic Capabilities and Strategic Management

{
  "access_scope": "Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. Amy Shuen is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "authors_in_source_order": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "dates": {
    "final_revision": "4 March 1997",
    "publication": "August 1997",
    "received": "17 April 1991",
    "retrieved_utc": "2026-10-07T18:02:04.135845+00:00"
  },
  "id": "person-amyshuen::S1",
  "title": "Dynamic Capabilities and Strategic Management",
  "url": "https://josephmahoney.web.illinois.edu/BA545_Fall%202011/S11/Teece%2C%20Pisano%20and%20Shuen%20%281997%29.pdf"
}

Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. Amy Shuen is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. Amy Shuen is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anton Korinek

Anton Korinek is a listed coauthor of a working paper examining how automation could change the gains from globalization for developing economies.

The analysis connects labor-saving and resource-saving technologies with market concentration and advantages for developed countries.

The authors discuss domestic policies and reforms to global economic governance that could mitigate harm while distributing technological benefits more widely.

Sources and details

Artificial Intelligence, Globalization, and Strategies for Economic Development

{
  "access_scope": "Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Anton Korinek is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Anton Korinek",
    "Joseph E. Stiglitz"
  ],
  "authors_in_source_order": [
    "Anton Korinek",
    "Joseph E. Stiglitz"
  ],
  "dates": {
    "manuscript": "February 2021",
    "retrieved_utc": "2026-10-07T18:17:22.179977+00:00",
    "status": "NBER Working Paper 28453, not peer reviewed"
  },
  "id": "person-coverage-ac6da9ea066e99::S1",
  "title": "Artificial Intelligence, Globalization, and Strategies for Economic Development",
  "url": "https://www.nber.org/system/files/working_papers/w28453/w28453.pdf"
}

Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Anton Korinek is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Anton Korinek is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Benja Fallenstein

Benja Fallenstein is a listed coauthor of the Corrigibility paper, which asks how an AI system could cooperate with corrective intervention despite incentives to resist it.

The authors analyze utility functions intended to permit safe shutdown without encouraging the agent either to prevent or to cause a shutdown request.

They also require that the behavior survive self-modification and new subsystems, concluding that the proposals examined do not yet satisfy all the stated desiderata.

Sources and details

Corrigibility

{
  "access_scope": "Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Benja Fallenstein is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "authors_in_source_order": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:12.785068+00:00",
    "venue": "AAAI Workshops, January 25–26, 2015"
  },
  "id": "person-coverage-485955ec15cf9a::S1",
  "title": "Corrigibility",
  "url": "https://intelligence.org/files/Corrigibility.pdf"
}

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Benja Fallenstein is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Benja Fallenstein is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carl Benedikt Frey

Carl Benedikt Frey is a listed coauthor of a study estimating occupational susceptibility to computerisation through a Gaussian-process classifier.

The method assigns computerisation probabilities to 702 detailed occupations and relates them to employment, wages and educational attainment in the United States.

The authors use the estimates to describe exposure to future automation, separating an occupation’s modeled susceptibility from observed job elimination.

Sources and details

The Future of Employment: How Susceptible Are Jobs to Computerisation?

{
  "access_scope": "The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Carl Benedikt Frey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "authors_in_source_order": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "dates": {
    "manuscript": "September 17, 2013",
    "retrieved_utc": "2026-10-07T18:19:03.035966+00:00"
  },
  "id": "person-coverage-e986316e54ea9d::S1",
  "title": "The Future of Employment: How Susceptible Are Jobs to Computerisation?",
  "url": "https://www.oxfordmartin.ox.ac.uk/downloads/academic/The_Future_of_Employment.pdf"
}

The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Carl Benedikt Frey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Carl Benedikt Frey is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Bignell

David Bignell is a listed coauthor of a paper introducing Project Malmo as an AI experimentation platform built on Minecraft.

An abstraction layer supports varied navigation, survival, collaboration and problem-solving tasks within complex three-dimensional worlds.

The platform exposes an API for integrating agents, designing tasks and running experiments, making it a research environment rather than evidence that an agent has achieved general intelligence.

Sources and details

The Malmo Platform for Artificial Intelligence Experimentation

{
  "access_scope": "The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. David Bignell is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "authors_in_source_order": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:30.451187+00:00",
    "venue": "IJCAI-16 proceedings, 2016"
  },
  "id": "person-coverage-02c3901cb0d773::S1",
  "title": "The Malmo Platform for Artificial Intelligence Experimentation",
  "url": "https://www.ijcai.org/Proceedings/16/Papers/643.pdf"
}

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. David Bignell is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. David Bignell is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Webb

Michael Webb is the credited author of a paper measuring automation exposure by comparing patent language with occupational task descriptions.

Webb first applies the text-overlap measure to software and industrial robots, relating measured exposure to historical changes in employment and wages.

He then uses those fitted relationships to estimate AI’s labor-market effects, with the projections depending on continued patterns of long-run substitution.

Sources and details

The Impact of Artificial Intelligence on the Labor Market

{
  "access_scope": "The Impact of Artificial Intelligence on the Labor Market. January 2020 manuscript; AI projections depend on historical substitution assumptions and are distinct from measured present-day job or wage outcomes. Michael Webb is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Michael Webb"
  ],
  "authors_in_source_order": [
    "Michael Webb"
  ],
  "dates": {
    "manuscript": "January 2020",
    "retrieved_utc": "2026-10-07T18:11:32.678526+00:00"
  },
  "id": "person-coverage-07906182e1e82d::S1",
  "title": "The Impact of Artificial Intelligence on the Labor Market",
  "url": "https://www.michaelwebb.co/webb_ai.pdf"
}

The Impact of Artificial Intelligence on the Labor Market. January 2020 manuscript; AI projections depend on historical substitution assumptions and are distinct from measured present-day job or wage outcomes. Michael Webb is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

The Impact of Artificial Intelligence on the Labor Market. January 2020 manuscript; AI projections depend on historical substitution assumptions and are distinct from measured present-day job or wage outcomes. Michael Webb is credited as sole author; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Noam Brown

Noam Brown is a listed coauthor of a study of Pluribus, an AI evaluated against professionals in six-player no-limit Texas hold’em.

The paper explains why multiplayer games create strategic complications beyond the two-player zero-sum setting, including equilibrium selection.

Its reported professional-player comparison therefore tests performance in a specific multiplayer poker domain rather than unrestricted intelligence or a universal game-theoretic solution.

Sources and details

Superhuman AI for multiplayer poker

{
  "access_scope": "Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Noam Brown is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "authors_in_source_order": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "dates": {
    "publication": "30 August 2019",
    "retrieved_utc": "2026-10-07T18:11:08.127465+00:00",
    "venue": "Science 365, 885–890"
  },
  "id": "person-coverage-018ba7ce90164a::S1",
  "title": "Superhuman AI for multiplayer poker",
  "url": "https://noambrown.github.io/papers/19-Science-Superhuman.pdf"
}

Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Noam Brown is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Noam Brown is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yee-Whye Teh

Yee-Whye Teh is a listed coauthor of a paper using complementary priors to simplify learning in deep belief networks.

A greedy procedure trains layers one at a time, with the top two forming an undirected associative memory.

The initial parameters are then refined through a contrastive wake-sleep procedure, and the authors evaluate a generative model of handwritten digits and labels.

Sources and details

A fast learning algorithm for deep belief nets

{
  "access_scope": "A fast learning algorithm for deep belief nets. The manuscript marked for Neural Computation 2006 has specific architectural assumptions and handwritten-digit evaluations; it is not a general guarantee for arbitrary deep networks. Yee-Whye Teh is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Geoffrey E. Hinton",
    "Simon Osindero",
    "Yee-Whye Teh"
  ],
  "authors_in_source_order": [
    "Geoffrey E. Hinton",
    "Simon Osindero",
    "Yee-Whye Teh"
  ],
  "dates": {
    "manifestation": "manuscript marked To appear in Neural Computation 2006",
    "retrieved_utc": "2026-10-07T18:19:23.325953+00:00"
  },
  "id": "person-local-yeewhyeteh::S1",
  "title": "A fast learning algorithm for deep belief nets",
  "url": "https://www.cs.toronto.edu/~hinton/absps/fastnc.pdf"
}

A fast learning algorithm for deep belief nets. The manuscript marked for Neural Computation 2006 has specific architectural assumptions and handwritten-digit evaluations; it is not a general guarantee for arbitrary deep networks. Yee-Whye Teh is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

A fast learning algorithm for deep belief nets. The manuscript marked for Neural Computation 2006 has specific architectural assumptions and handwritten-digit evaluations; it is not a general guarantee for arbitrary deep networks. Yee-Whye Teh is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jordan Tse

Jordan Tse is a listed coauthor of a paper estimating computing’s carbon footprint from industry-reported characterizations.

The analysis separates emissions from operational energy use from those associated with hardware manufacturing and infrastructure.

Its mobile and data-center examples motivate attention to embodied emissions alongside efficiency gains, connecting system design with a wider life-cycle footprint.

Sources and details

Chasing Carbon: The Elusive Environmental Footprint of Computing

{
  "access_scope": "Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Jordan Tse is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "authors_in_source_order": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "dates": {
    "DOI": "10.1109/MM.2022.3163226",
    "retrieved_utc": "2026-10-07T18:13:09.316635+00:00",
    "status": "accepted for future publication; not fully edited"
  },
  "id": "person-coverage-39c51013b4a9b4::S1",
  "title": "Chasing Carbon: The Elusive Environmental Footprint of Computing",
  "url": "https://discovery.ucl.ac.uk/10147559/1/Chasing_Carbon_The_Elusive_Environmental_Footprint_of_Computing.pdf"
}

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Jordan Tse is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Jordan Tse is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex He

Alex He is a listed coauthor of a study measuring firms’ AI investment through employee-resume data.

The authors relate that human-capital measure to sales, employment, market value and product innovation, and examine robustness using exposure to universities supplying AI graduates.

The reported growth patterns concentrate among larger firms, linking AI investment and new products with questions about industry concentration.

Sources and details

Artificial intelligence, firm growth, and product innovation

{
  "access_scope": "Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Alex He is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "authors_in_source_order": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "dates": {
    "accepted": "27 October 2023",
    "available_online": "23 November 2023",
    "publication": "Journal of Financial Economics 151 (2024) 103745",
    "retrieved_utc": "2026-10-07T18:13:05.166092+00:00"
  },
  "id": "person-coverage-d63f8eed78b61a::S1",
  "title": "Artificial intelligence, firm growth, and product innovation",
  "url": "https://alexxihe.github.io/jfe.pdf"
}

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Alex He is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Alex He is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

A. Joseph Hoane Jr.

A. Joseph Hoane Jr. is a listed coauthor of Deep Blue, an account of the design behind Deep Blue.

The system combines a specialized single-chip chess search engine with several levels of parallel computation.

The account also identifies search extensions, a detailed evaluation function, and a grandmaster-game database as interacting components of its design.

Sources and details

Deep Blue

{
  "access_scope": "IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.",
  "authors": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "authors_in_source_order": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "dates": {
    "citation_publication_date": [
      "2002/01/01"
    ],
    "retrieved_utc": "2026-10-07T18:12:53.467757+00:00"
  },
  "id": "person-coverage-2f5f5491b8685b::S1",
  "title": "Deep Blue",
  "url": "https://research.ibm.com/publications/deep-blue"
}

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Koller

Alexander Koller is a listed coauthor of Climbing towards NLU: On Meaning, Form, and Understanding in the Age of Data, a position paper examining what language-model training can establish.

The position paper argues that learning patterns of linguistic form alone cannot establish meaning.

It proposes a clearer distinction between form and meaning as a basis for interpreting language-model results and planning natural-language-understanding research.

Sources and details

Climbing towards NLU: On Meaning, Form, and Understanding in the Age of Data

{
  "access_scope": "ACL 2020 position paper abstract; argument about form and meaning, not a proven impossibility for every multimodal system.",
  "authors": [
    "Emily M. Bender",
    "Alexander Koller"
  ],
  "authors_in_source_order": [
    "Emily M. Bender",
    "Alexander Koller"
  ],
  "dates": {
    "citation_publication_date": "2020/7",
    "proceedings_month": "2020-07",
    "retrieved_utc": "2026-10-07T18:10:39.800251+00:00"
  },
  "id": "person-coverage-0e5c6d3c56fe77::S1",
  "title": "Climbing towards NLU: On Meaning, Form, and Understanding in the Age of Data",
  "url": "https://aclanthology.org/2020.acl-main.463/"
}

ACL 2020 position paper abstract; argument about form and meaning, not a proven impossibility for every multimodal system.

ACL 2020 position paper abstract; argument about form and meaning, not a proven impossibility for every multimodal system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ed Finn

Ed Finn is a listed coauthor of Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness, a study of how motive descriptions change conversational-AI experiences.

Participants used the same conversational AI after receiving different descriptions of its motives, allowing the study to examine how prior beliefs shaped interaction.

The authors report that a caring-motive primer increased perceived trust, empathy, and effectiveness, with stronger effects for the more sophisticated model in their experiment.

Sources and details

Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness

{
  "access_scope": "Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.",
  "authors": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "authors_in_source_order": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "dates": {
    "citation_publication_date": [
      "2023/10"
    ],
    "retrieved_utc": "2026-10-07T18:13:39.365364+00:00",
    "visible_issue_date": "October 2023",
    "visible_published": "02 October 2023"
  },
  "id": "person-coverage-a66932a8a25d1a::S1",
  "title": "Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness",
  "url": "https://www.nature.com/articles/s42256-023-00720-7"
}

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Geoffrey W. Burr

Geoffrey W. Burr is a listed coauthor of Resistive switching materials for information processing, a review of materials for computing in memory.

The review organizes resistive-switching materials around redox reactions, phase transitions, spin-polarized tunneling, and ferroelectric polarization.

It relates those mechanisms to switching speed, energy, reliability, density, and the requirements of computing within memory.

Sources and details

Resistive switching materials for information processing

{
  "access_scope": "Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.",
  "authors": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "authors_in_source_order": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "dates": {
    "citation_publication_date": [
      "2020/03"
    ],
    "retrieved_utc": "2026-10-07T18:11:35.128101+00:00",
    "visible_issue_date": "March 2020",
    "visible_published": "13 January 2020"
  },
  "id": "person-coverage-7bbd6772ccb697::S1",
  "title": "Resistive switching materials for information processing",
  "url": "https://www.nature.com/articles/s41578-019-0159-3"
}

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Em Karniadakis

George Em Karniadakis is a listed coauthor of Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators, a study introducing an architecture for learning mappings between functions.

DeepONet separates encoding of sampled input functions into a branch network from encoding output-domain coordinates into a trunk network.

The authors examine explicit operators such as integrals and implicit operators defined by differential equations, including how representations of input functions affect generalization.

Sources and details

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

{
  "access_scope": "Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.",
  "authors": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "authors_in_source_order": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "dates": {
    "citation_publication_date": [
      "2021/03"
    ],
    "retrieved_utc": "2026-10-07T18:12:22.153875+00:00",
    "visible_issue_date": "March 2021",
    "visible_published": "18 March 2021"
  },
  "id": "person-coverage-fd56743440e27d::S1",
  "title": "Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators",
  "url": "https://www.nature.com/articles/s42256-021-00302-5"
}

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luciano Floridi

Luciano Floridi is the credited author of AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None, an argument about attributing mental properties to AI.

The article calls the tendency to perceive intelligence, emotion, or consciousness in statistical AI outputs semantic pareidolia.

Its argument examines digital immersion, commercial incentives, and social isolation as forces that can amplify anthropomorphic interpretations and motivates clearer interface design.

Sources and details

AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None

{
  "access_scope": "Single-author philosophical article, published 19 February 2026 distinct from March 2026 citation issue; consciousness interpretation attributed to Floridi.",
  "authors": [
    "Floridi, Luciano"
  ],
  "authors_in_source_order": [
    "Floridi, Luciano"
  ],
  "dates": {
    "citation_publication_date": [
      "2026/03"
    ],
    "retrieved_utc": "2026-10-07T18:16:03.266222+00:00",
    "visible_published": "19 February 2026"
  },
  "id": "person-coverage-8697cd25dbaac3::S1",
  "title": "AI and Semantic Pareidolia: When We See Intelligent Consciousness where there is None",
  "url": "https://link.springer.com/article/10.1007/s13347-026-01052-1"
}

Single-author philosophical article, published 19 February 2026 distinct from March 2026 citation issue; consciousness interpretation attributed to Floridi.

Single-author philosophical article, published 19 February 2026 distinct from March 2026 citation issue; consciousness interpretation attributed to Floridi.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicholas C. Harris

Nicholas C. Harris is a listed coauthor of Deep learning with coherent nanophotonic circuits, a study of optical hardware for neural-network inference.

The paper proposes an optical neural-network architecture and tests a programmable silicon-photonic processor containing 56 Mach–Zehnder interferometers.

Its vowel-recognition demonstration evaluates an essential part of the architecture, while the suggested speed and power advantages remain proposed potential benefits.

Sources and details

Deep learning with coherent nanophotonic circuits

{
  "access_scope": "Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.",
  "authors": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "authors_in_source_order": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "dates": {
    "citation_publication_date": [
      "2017/07"
    ],
    "retrieved_utc": "2026-10-07T18:11:34.777972+00:00",
    "visible_issue_date": "01 July 2017",
    "visible_published": "12 June 2017"
  },
  "id": "person-coverage-00d58aaabf16e7::S1",
  "title": "Deep learning with coherent nanophotonic circuits",
  "url": "https://www.nature.com/articles/nphoton.2017.93"
}

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert H. Dennard

Robert H. Dennard is a listed coauthor of Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions, a study of MOSFET scaling and device design.

The paper uses scaling relationships to design smaller MOSFETs and ion implantation to form shallow source and drain regions with a nonuniform substrate-doping profile.

One-dimensional threshold models and two-dimensional transport models are compared with measurements of fabricated devices, including channels as short as 0.5 micrometers.

Sources and details

Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions

{
  "access_scope": "IBM publication abstract with metadata date 1974/01/01; measured MOSFET examples versus projected circuit performance remain distinct.",
  "authors": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "authors_in_source_order": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "dates": {
    "citation_publication_date": [
      "1974/01/01"
    ],
    "retrieved_utc": "2026-10-07T18:19:20.395090+00:00"
  },
  "id": "person-coverage-fe6dfad53518b0::S1",
  "title": "Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions",
  "url": "https://research.ibm.com/publications/design-of-ion-implanted-mosfets-with-very-small-physical-dimensions"
}

IBM publication abstract with metadata date 1974/01/01; measured MOSFET examples versus projected circuit performance remain distinct.

IBM publication abstract with metadata date 1974/01/01; measured MOSFET examples versus projected circuit performance remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Seppo Linnainmaa

Seppo Linnainmaa is the credited author of Taylor expansion of the accumulated rounding error, an analysis of how local numerical errors accumulate.

The article develops analytical and algorithmic methods for expressing accumulated rounding error as a Taylor expansion in local rounding errors.

It extends the discussion to higher-order coefficients and examines ways to reduce the storage required for these calculations.

Sources and details

Taylor expansion of the accumulated rounding error

{
  "access_scope": "Single-author Springer abstract, June 1976 issue; rounding-error analysis only, no unsupported reverse-mode invention claim.",
  "authors": [
    "Linnainmaa, Seppo"
  ],
  "authors_in_source_order": [
    "Linnainmaa, Seppo"
  ],
  "dates": {
    "citation_publication_date": [
      "1976/06"
    ],
    "retrieved_utc": "2026-10-07T18:21:34.869412+00:00",
    "visible_issue_date": "June 1976"
  },
  "id": "person-local-seppolinnainmaa::S1",
  "title": "Taylor expansion of the accumulated rounding error",
  "url": "https://link.springer.com/article/10.1007/BF01931367"
}

Single-author Springer abstract, June 1976 issue; rounding-error analysis only, no unsupported reverse-mode invention claim.

Single-author Springer abstract, June 1976 issue; rounding-error analysis only, no unsupported reverse-mode invention claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Walter Pitts

Walter Pitts is a listed coauthor of A logical calculus of the ideas immanent in nervous activity, a logical treatment of simplified neural networks.

The paper models all-or-none neural events and their relationships through propositional logic.

It analyzes networks with feedback and shows how networks satisfying different neurophysiological assumptions can produce equivalent results, potentially at different speeds.

Sources and details

A logical calculus of the ideas immanent in nervous activity

{
  "access_scope": "Springer abstract and author metadata, December 1943 issue; logical neuron abstraction, not modern physiological validation.",
  "authors": [
    "McCulloch, Warren S.",
    "Pitts, Walter"
  ],
  "authors_in_source_order": [
    "McCulloch, Warren S.",
    "Pitts, Walter"
  ],
  "dates": {
    "citation_publication_date": [
      "1943/12"
    ],
    "retrieved_utc": "2026-10-07T18:22:30.579270+00:00",
    "visible_issue_date": "December 1943"
  },
  "id": "person-walterpitts::S1",
  "title": "A logical calculus of the ideas immanent in nervous activity",
  "url": "https://link.springer.com/article/10.1007/BF02478259"
}

Springer abstract and author metadata, December 1943 issue; logical neuron abstraction, not modern physiological validation.

Springer abstract and author metadata, December 1943 issue; logical neuron abstraction, not modern physiological validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Abhinandan Jain

Abhinandan Jain is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-7f5eeb6a475e2d::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Clark

Andy Clark is a listed coauthor of The Extended Mind, an argument for cognition extending into environmental resources.

The argument treats environmental resources that actively participate in thinking as possible parts of a cognitive process.

Its mental-rotation examples compare internal calculation, a computer’s rotation button, and a hypothetical neural implant to question why functionally similar operations should be classified differently.

Sources and details

The Extended Mind

{
  "access_scope": "Cached reprint manuscript with conflicting page-range notes (7–19 versus10–23); philosophical argument, not an empirical cognition result.",
  "authors": [
    "Andy Clark",
    "David J. Chalmers"
  ],
  "authors_in_source_order": [
    "Andy Clark",
    "David J. Chalmers"
  ],
  "dates": {
    "publication_year": "1998",
    "reprint_years": [
      "2000",
      "2002"
    ],
    "retrieved_utc": "2026-10-07T18:16:50.985846+00:00"
  },
  "id": "person-coverage-8eeebe78cbac66::S1",
  "title": "The Extended Mind",
  "url": "https://web.ics.purdue.edu/~drkelly/ClarkChalmersTheExtendedMind1998.pdf"
}

Cached reprint manuscript with conflicting page-range notes (7–19 versus10–23); philosophical argument, not an empirical cognition result.

Cached reprint manuscript with conflicting page-range notes (7–19 versus10–23); philosophical argument, not an empirical cognition result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Angelo Cangelosi

Angelo Cangelosi is a listed coauthor of A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness, a robotics study linking episodic memory to a workspace architecture.

The accepted manuscript implements episodic memory within a Global Workspace architecture integrating multiple cognitive components.

The reported robot experiment examines formation and retrieval of memories in interaction, including static, temporal, and contextual information; these functional results do not establish subjective consciousness.

Sources and details

A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness

{
  "access_scope": "Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.",
  "authors": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "authors_in_source_order": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "dates": {
    "published_citation_year": "2024",
    "repository_download_date": "2026-10-07",
    "retrieved_utc": "2026-10-07T18:16:47.747265+00:00"
  },
  "id": "person-coverage-99d68eb81d5230::S1",
  "title": "A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness",
  "url": "https://pure.manchester.ac.uk/ws/portalfiles/portal/258040174/Huang_2023.pdf"
}

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Angèle Christin

Angèle Christin is a listed coauthor of Algorithms at Work: The New Contested Terrain of Control, a review of algorithmic control in organizations.

The review synthesizes interdisciplinary workplace research using organizational control as contested terrain between employers and workers.

It groups algorithmic control into restricting and recommending work, recording and rating workers, and replacing and rewarding them, while also examining worker resistance.

Sources and details

Algorithms at Work: The New Contested Terrain of Control

{
  "access_scope": "Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.",
  "authors": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "authors_in_source_order": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "dates": {
    "journal_year": "2020",
    "retrieved_utc": "2026-10-07T18:12:50.941402+00:00"
  },
  "id": "person-coverage-689f0f1c73fade::S1",
  "title": "Algorithms at Work: The New Contested Terrain of Control",
  "url": "https://mvalentine.github.io/pdfs/algorithms-at-work.pdf"
}

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Armen A. Alchian

Armen A. Alchian is a listed coauthor of Production, Information Costs, and Economic Organization, an analysis of firms and cooperative specialization.

The paper asks when cooperative specialization is better coordinated inside a firm than across markets.

It challenges explanations based simply on managerial authority and instead examines the contractual relationships underlying the organization of productive resources.

Sources and details

Production, Information Costs, and Economic Organization

{
  "access_scope": "Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.",
  "authors": [
    "Armen A. Alchian",
    "Harold Demsetz"
  ],
  "authors_in_source_order": [
    "Armen A. Alchian",
    "Harold Demsetz"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:28.135512+00:00"
  },
  "id": "person-armenaalchian::S1",
  "title": "Production, Information Costs, and Economic Organization",
  "url": "https://www.aeaweb.org/aer/top20/62.5.777-795.pdf"
}

Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.

Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Luan

David Luan is a listed coauthor of Language Models are Unsupervised Multitask Learners, a report on zero-shot language-model task transfer.

The report trains a language model on WebText and evaluates question answering and other tasks without their usual task-specific supervised datasets.

It examines how greater model capacity improves zero-shot transfer and describes GPT-2 as a 1.5-billion-parameter Transformer that still underfits its training corpus.

Sources and details

Language Models are Unsupervised Multitask Learners

{
  "access_scope": "Cached OpenAI report PDF; GPT-2 and its reported experiments only, no publication date inferred from references.",
  "authors": [
    "Alec Radford",
    "Jeffrey Wu",
    "Rewon Child",
    "David Luan",
    "Dario Amodei",
    "Ilya Sutskever"
  ],
  "authors_in_source_order": [
    "Alec Radford",
    "Jeffrey Wu",
    "Rewon Child",
    "David Luan",
    "Dario Amodei",
    "Ilya Sutskever"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:49.732490+00:00"
  },
  "id": "person-coverage-9cbcfc5c715650::S1",
  "title": "Language Models are Unsupervised Multitask Learners",
  "url": "https://cdn.openai.com/better-language-models/language_models_are_unsupervised_multitask_learners.pdf"
}

Cached OpenAI report PDF; GPT-2 and its reported experiments only, no publication date inferred from references.

Cached OpenAI report PDF; GPT-2 and its reported experiments only, no publication date inferred from references.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hal R. Varian

Hal R. Varian is the credited author of Big Data: New Tricks for Econometrics, an essay introducing data and learning tools for economists.

The essay distinguishes challenges of large transaction datasets: storing and manipulating the data, selecting among many predictors, and representing flexible relationships.

It introduces machine-learning methods to economists as complementary tools for those problems rather than a universal replacement for conventional regression.

Sources and details

Big Data: New Tricks for Econometrics

{
  "access_scope": "Revised author manuscript, not conflated with initial June 2013 draft; methods essay, no new empirical performance claim.",
  "authors": [
    "Hal R. Varian"
  ],
  "authors_in_source_order": [
    "Hal R. Varian"
  ],
  "dates": {
    "inspected_revision": "2014-04-14",
    "original_manuscript": "2013-06",
    "retrieved_utc": "2026-10-07T18:14:14.484391+00:00"
  },
  "id": "person-coverage-5186e0f8bfdaf9::S1",
  "title": "Big Data: New Tricks for Econometrics",
  "url": "https://people.ischool.berkeley.edu/~hal/Papers/2013/ml.pdf"
}

Revised author manuscript, not conflated with initial June 2013 draft; methods essay, no new empirical performance claim.

Revised author manuscript, not conflated with initial June 2013 draft; methods essay, no new empirical performance claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leo Breiman

Leo Breiman is the credited author of Random Forests, a manuscript defining and analyzing randomized tree ensembles.

Random forests combine tree predictors whose construction depends on independent random vectors drawn from the same distribution.

The manuscript relates forest error to individual-tree strength and correlations between trees, and uses internal estimates to examine error and variable importance.

Sources and details

Random Forests

{
  "access_scope": "January 2001 author manuscript; mathematical and methodological claims bounded to the forest definition and analysis in this version.",
  "authors": [
    "Leo Breiman"
  ],
  "authors_in_source_order": [
    "Leo Breiman"
  ],
  "dates": {
    "manuscript_date": "2001-01",
    "retrieved_utc": "2026-10-07T18:17:54.896194+00:00"
  },
  "id": "person-coverage-b5b78c1355b64e::S1",
  "title": "Random Forests",
  "url": "https://www.stat.berkeley.edu/users/breiman/randomforest2001.pdf"
}

January 2001 author manuscript; mathematical and methodological claims bounded to the forest definition and analysis in this version.

January 2001 author manuscript; mathematical and methodological claims bounded to the forest definition and analysis in this version.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Campbell

Andrew Campbell is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Campbell is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-d9c7e40dfcc96b::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Campbell is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Campbell is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adam Haar

Adam Haar is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-72f7100a0fe6ad::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anastassia Fedyk

Anastassia Fedyk is a listed coauthor of a study measuring firms’ AI investment through employee-resume data.

The authors relate that human-capital measure to sales, employment, market value and product innovation, and examine robustness using exposure to universities supplying AI graduates.

The reported growth patterns concentrate among larger firms, linking AI investment and new products with questions about industry concentration.

Sources and details

Artificial intelligence, firm growth, and product innovation

{
  "access_scope": "Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Anastassia Fedyk is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "authors_in_source_order": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "dates": {
    "accepted": "27 October 2023",
    "available_online": "23 November 2023",
    "publication": "Journal of Financial Economics 151 (2024) 103745",
    "retrieved_utc": "2026-10-07T18:13:05.166092+00:00"
  },
  "id": "person-coverage-37861e77b02e12::S1",
  "title": "Artificial intelligence, firm growth, and product innovation",
  "url": "https://alexxihe.github.io/jfe.pdf"
}

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Anastassia Fedyk is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Anastassia Fedyk is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Y. K. Foong

Andrew Y. K. Foong is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Y. K. Foong is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-c0343589dac048::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Y. K. Foong is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Andrew Y. K. Foong is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Antonio Chella

Antonio Chella is a listed coauthor of A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness, a robotics study linking episodic memory to a workspace architecture.

The accepted manuscript implements episodic memory within a Global Workspace architecture integrating multiple cognitive components.

The reported robot experiment examines formation and retrieval of memories in interaction, including static, temporal, and contextual information; these functional results do not establish subjective consciousness.

Sources and details

A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness

{
  "access_scope": "Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.",
  "authors": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "authors_in_source_order": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "dates": {
    "published_citation_year": "2024",
    "repository_download_date": "2026-10-07",
    "retrieved_utc": "2026-10-07T18:16:47.747265+00:00"
  },
  "id": "person-coverage-ed1a5569d2624e::S1",
  "title": "A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness",
  "url": "https://pure.manchester.ac.uk/ws/portalfiles/portal/258040174/Huang_2023.pdf"
}

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arne Schneuing

Arne Schneuing is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Arne Schneuing is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-dd9465864a5a83::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Arne Schneuing is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Arne Schneuing is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bastiaan S. Veeling

Bastiaan S. Veeling is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Bastiaan S. Veeling is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-502e8abd839ca1::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Bastiaan S. Veeling is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Bastiaan S. Veeling is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cecilia Clementi

Cecilia Clementi is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Cecilia Clementi is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-18c3913b4c066b::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Cecilia Clementi is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Cecilia Clementi is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David J. Teece

David J. Teece is a listed coauthor of a strategic-management paper explaining competitive advantage through capabilities developed under rapid technological change.

Its framework links coordination processes with a firm’s asset positions and the paths it has inherited or adopted.

The analysis makes replication, imitation and changing demand relevant to whether an advantage endures, emphasizing organizational adaptation rather than a single static resource.

Sources and details

Dynamic Capabilities and Strategic Management

{
  "access_scope": "Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. David J. Teece is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "authors_in_source_order": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "dates": {
    "final_revision": "4 March 1997",
    "publication": "August 1997",
    "received": "17 April 1991",
    "retrieved_utc": "2026-10-07T18:02:04.135845+00:00"
  },
  "id": "person-davidjteece::S1",
  "title": "Dynamic Capabilities and Strategic Management",
  "url": "https://josephmahoney.web.illinois.edu/BA545_Fall%202011/S11/Teece%2C%20Pisano%20and%20Shuen%20%281997%29.pdf"
}

Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. David J. Teece is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Dynamic Capabilities and Strategic Management. The 1997 theoretical framework proposes relationships among processes, assets and paths; it does not prove a universal management prescription or assign its components to this coauthor alone. David J. Teece is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eliezer Yudkowsky

Eliezer Yudkowsky is a listed coauthor of the Corrigibility paper, which asks how an AI system could cooperate with corrective intervention despite incentives to resist it.

The authors analyze utility functions intended to permit safe shutdown without encouraging the agent either to prevent or to cause a shutdown request.

They also require that the behavior survive self-modification and new subsystems, concluding that the proposals examined do not yet satisfy all the stated desiderata.

Sources and details

Corrigibility

{
  "access_scope": "Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Eliezer Yudkowsky is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "authors_in_source_order": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:12.785068+00:00",
    "venue": "AAAI Workshops, January 25–26, 2015"
  },
  "id": "person-coverage-9b14ce2cbb460d::S1",
  "title": "Corrigibility",
  "url": "https://intelligence.org/files/Corrigibility.pdf"
}

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Eliezer Yudkowsky is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Eliezer Yudkowsky is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ethan Mollick

Ethan Mollick is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Ethan Mollick is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-fa186df5e681d0::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Ethan Mollick is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Ethan Mollick is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fabrizio Dell’Acqua

Fabrizio Dell’Acqua is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Fabrizio Dell’Acqua is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-20792a0f9319fc::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Fabrizio Dell’Acqua is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Fabrizio Dell’Acqua is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Federico Barbero

Federico Barbero is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Federico Barbero is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-4383bc0d97bf5f::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Federico Barbero is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Federico Barbero is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Federico Felici

Federico Felici is a listed coauthor of a study applying reinforcement learning to magnetic control of tokamak plasmas.

The controller learns to command the full set of coils from high-level objectives while respecting physical and operational constraints.

The authors report tracking position, current and shape across several TCV configurations, including two separate plasmas maintained in one vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Federico Felici is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "authors_in_source_order": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "dates": {
    "Accepted": "01 December 2021",
    "Issue date": "17 February 2022",
    "Published": "16 February 2022",
    "Received": "14 July 2021",
    "Version of record": "16 February 2022",
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "person-coverage-c1accc18f688e6::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Federico Felici is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Federico Felici is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Feng-hsiung Hsu

Feng-hsiung Hsu is a listed coauthor of Deep Blue, an account of the design behind Deep Blue.

The system combines a specialized single-chip chess search engine with several levels of parallel computation.

The account also identifies search extensions, a detailed evaluation function, and a grandmaster-game database as interacting components of its design.

Sources and details

Deep Blue

{
  "access_scope": "IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.",
  "authors": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "authors_in_source_order": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "dates": {
    "citation_publication_date": [
      "2002/01/01"
    ],
    "retrieved_utc": "2026-10-07T18:12:53.467757+00:00"
  },
  "id": "person-coverage-8b25b9643e4151::S1",
  "title": "Deep Blue",
  "url": "https://research.ibm.com/publications/deep-blue"
}

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank Noé

Frank Noé is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Frank Noé is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-bdd87cd60f4962::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Frank Noé is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Frank Noé is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

François Candelon

François Candelon is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. François Candelon is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-3fc55f005ccffa::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. François Candelon is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. François Candelon is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guillermo Bernal

Guillermo Bernal is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-c2bc9af44676fe::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guofei Pang

Guofei Pang is a listed coauthor of Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators, a study introducing an architecture for learning mappings between functions.

DeepONet separates encoding of sampled input functions into a branch network from encoding output-domain coordinates into a trunk network.

The authors examine explicit operators such as integrals and implicit operators defined by differential equations, including how representations of input functions affect generalization.

Sources and details

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

{
  "access_scope": "Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.",
  "authors": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "authors_in_source_order": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "dates": {
    "citation_publication_date": [
      "2021/03"
    ],
    "retrieved_utc": "2026-10-07T18:12:22.153875+00:00",
    "visible_issue_date": "March 2021",
    "visible_published": "18 March 2021"
  },
  "id": "person-coverage-c17b2cdbb481bb::S1",
  "title": "Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators",
  "url": "https://www.nature.com/articles/s42256-021-00302-5"
}

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harold Demsetz

Harold Demsetz is a listed coauthor of Production, Information Costs, and Economic Organization, an analysis of firms and cooperative specialization.

The paper asks when cooperative specialization is better coordinated inside a firm than across markets.

It challenges explanations based simply on managerial authority and instead examines the contractual relationships underlying the organization of productive resources.

Sources and details

Production, Information Costs, and Economic Organization

{
  "access_scope": "Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.",
  "authors": [
    "Armen A. Alchian",
    "Harold Demsetz"
  ],
  "authors_in_source_order": [
    "Armen A. Alchian",
    "Harold Demsetz"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:28.135512+00:00"
  },
  "id": "person-harolddemsetz::S1",
  "title": "Production, Information Costs, and Economic Organization",
  "url": "https://www.aeaweb.org/aer/top20/62.5.777-795.pdf"
}

Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.

Cached article PDF; first-page argument inspected, no publication date inferred from URL or external memory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hila Lifshitz-Assaf

Hila Lifshitz-Assaf is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Hila Lifshitz-Assaf is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-414e215ae16d7c::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Hila Lifshitz-Assaf is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Hila Lifshitz-Assaf is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Huaqiang Wu

Huaqiang Wu is a listed coauthor of Resistive switching materials for information processing, a review of materials for computing in memory.

The review organizes resistive-switching materials around redox reactions, phase transitions, spin-polarized tunneling, and ferroelectric polarization.

It relates those mechanisms to switching speed, energy, reliability, density, and the requirements of computing within memory.

Sources and details

Resistive switching materials for information processing

{
  "access_scope": "Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.",
  "authors": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "authors_in_source_order": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "dates": {
    "citation_publication_date": [
      "2020/03"
    ],
    "retrieved_utc": "2026-10-07T18:11:35.128101+00:00",
    "visible_issue_date": "March 2020",
    "visible_published": "13 January 2020"
  },
  "id": "person-coverage-00565960b59ae9::S1",
  "title": "Resistive switching materials for information processing",
  "url": "https://www.nature.com/articles/s41578-019-0159-3"
}

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

J. Joshua Yang

J. Joshua Yang is a listed coauthor of Resistive switching materials for information processing, a review of materials for computing in memory.

The review organizes resistive-switching materials around redox reactions, phase transitions, spin-polarized tunneling, and ferroelectric polarization.

It relates those mechanisms to switching speed, energy, reliability, density, and the requirements of computing within memory.

Sources and details

Resistive switching materials for information processing

{
  "access_scope": "Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.",
  "authors": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "authors_in_source_order": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "dates": {
    "citation_publication_date": [
      "2020/03"
    ],
    "retrieved_utc": "2026-10-07T18:11:35.128101+00:00",
    "visible_issue_date": "March 2020",
    "visible_published": "13 January 2020"
  },
  "id": "person-coverage-19ba06fa765c14::S1",
  "title": "Resistive switching materials for information processing",
  "url": "https://www.nature.com/articles/s41578-019-0159-3"
}

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Hodson

James Hodson is a listed coauthor of a study measuring firms’ AI investment through employee-resume data.

The authors relate that human-capital measure to sales, employment, market value and product innovation, and examine robustness using exposure to universities supplying AI graduates.

The reported growth patterns concentrate among larger firms, linking AI investment and new products with questions about industry concentration.

Sources and details

Artificial intelligence, firm growth, and product innovation

{
  "access_scope": "Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. James Hodson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "authors_in_source_order": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "dates": {
    "accepted": "27 October 2023",
    "available_online": "23 November 2023",
    "publication": "Journal of Financial Economics 151 (2024) 103745",
    "retrieved_utc": "2026-10-07T18:13:05.166092+00:00"
  },
  "id": "person-coverage-ceb8db131a5797::S1",
  "title": "Artificial intelligence, firm growth, and product innovation",
  "url": "https://alexxihe.github.io/jfe.pdf"
}

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. James Hodson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. James Hodson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jigyasa Nigam

Jigyasa Nigam is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Jigyasa Nigam is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-5563afaee27e62::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Jigyasa Nigam is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Jigyasa Nigam is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonas Buchli

Jonas Buchli is a listed coauthor of a study applying reinforcement learning to magnetic control of tokamak plasmas.

The controller learns to command the full set of coils from high-level objectives while respecting physical and operational constraints.

The authors report tracking position, current and shape across several TCV configurations, including two separate plasmas maintained in one vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Buchli is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "authors_in_source_order": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "dates": {
    "Accepted": "01 December 2021",
    "Issue date": "17 February 2022",
    "Published": "16 February 2022",
    "Received": "14 July 2021",
    "Version of record": "16 February 2022",
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "person-coverage-b9b3b1ad0c38b4::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Buchli is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Buchli is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonas Degrave

Jonas Degrave is a listed coauthor of a study applying reinforcement learning to magnetic control of tokamak plasmas.

The controller learns to command the full set of coils from high-level objectives while respecting physical and operational constraints.

The authors report tracking position, current and shape across several TCV configurations, including two separate plasmas maintained in one vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Degrave is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "authors_in_source_order": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "dates": {
    "Accepted": "01 December 2021",
    "Issue date": "17 February 2022",
    "Published": "16 February 2022",
    "Received": "14 July 2021",
    "Version of record": "16 February 2022",
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "person-coverage-81716b92b4a6a5::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Degrave is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Jonas Degrave is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph E. Stiglitz

Joseph E. Stiglitz is a listed coauthor of a working paper examining how automation could change the gains from globalization for developing economies.

The analysis connects labor-saving and resource-saving technologies with market concentration and advantages for developed countries.

The authors discuss domestic policies and reforms to global economic governance that could mitigate harm while distributing technological benefits more widely.

Sources and details

Artificial Intelligence, Globalization, and Strategies for Economic Development

{
  "access_scope": "Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Joseph E. Stiglitz is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Anton Korinek",
    "Joseph E. Stiglitz"
  ],
  "authors_in_source_order": [
    "Anton Korinek",
    "Joseph E. Stiglitz"
  ],
  "dates": {
    "manuscript": "February 2021",
    "retrieved_utc": "2026-10-07T18:17:22.179977+00:00",
    "status": "NBER Working Paper 28453, not peer reviewed"
  },
  "id": "person-josephestiglitz::S1",
  "title": "Artificial Intelligence, Globalization, and Strategies for Economic Development",
  "url": "https://www.nber.org/system/files/working_papers/w28453/w28453.pdf"
}

Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Joseph E. Stiglitz is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial Intelligence, Globalization, and Strategies for Economic Development. The February 2021 NBER working paper provides economic analysis and policy proposals, not a measured forecast guaranteed to occur or an endorsement by NBER. Joseph E. Stiglitz is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

José Jiménez-Luna

José Jiménez-Luna is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. José Jiménez-Luna is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-9c35f1c3f2fc9b::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. José Jiménez-Luna is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. José Jiménez-Luna is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Judith Amores

Judith Amores is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-3c4d861d0b509a::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karim R. Lakhani

Karim R. Lakhani is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Karim R. Lakhani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-cb82ceaf0916c2::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Karim R. Lakhani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Karim R. Lakhani is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Katherine C. Kellogg

Katherine C. Kellogg is a listed coauthor of Algorithms at Work: The New Contested Terrain of Control, a review of algorithmic control in organizations.

The review synthesizes interdisciplinary workplace research using organizational control as contested terrain between employers and workers.

It groups algorithmic control into restricting and recommending work, recording and rating workers, and replacing and rewarding them, while also examining worker resistance.

Sources and details

Algorithms at Work: The New Contested Terrain of Control

{
  "access_scope": "Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.",
  "authors": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "authors_in_source_order": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "dates": {
    "journal_year": "2020",
    "retrieved_utc": "2026-10-07T18:12:50.941402+00:00"
  },
  "id": "person-coverage-2e5e6bbea0fa0a::S1",
  "title": "Algorithms at Work: The New Contested Terrain of Control",
  "url": "https://mvalentine.github.io/pdfs/algorithms-at-work.pdf"
}

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Katja Hofmann

Katja Hofmann is a listed coauthor of a paper introducing Project Malmo as an AI experimentation platform built on Minecraft.

An abstraction layer supports varied navigation, survival, collaboration and problem-solving tasks within complex three-dimensional worlds.

The platform exposes an API for integrating agents, designing tasks and running experiments, making it a research environment rather than evidence that an agent has achieved general intelligence.

Sources and details

The Malmo Platform for Artificial Intelligence Experimentation

{
  "access_scope": "The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Katja Hofmann is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "authors_in_source_order": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:30.451187+00:00",
    "venue": "IJCAI-16 proceedings, 2016"
  },
  "id": "person-coverage-65e6f7ecb1e321::S1",
  "title": "The Malmo Platform for Artificial Intelligence Experimentation",
  "url": "https://www.ijcai.org/Proceedings/16/Papers/643.pdf"
}

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Katja Hofmann is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Katja Hofmann is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leslie Pack Kaelbling

Leslie Pack Kaelbling is a listed coauthor of a paper bringing operations-research methods to action selection when observations and outcomes are uncertain.

The authors introduce Markov and partially observable Markov decision processes, then outline an offline algorithm for solving the latter.

They show how some solutions can yield finite-memory controllers and discuss the complexity that motivates approximate alternatives.

Sources and details

Planning and acting in partially observable stochastic domains

{
  "access_scope": "Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Leslie Pack Kaelbling is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "authors_in_source_order": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "dates": {
    "publication": "1998",
    "received": "11 October 1995",
    "retrieved_utc": "2026-10-07T18:02:12.129443+00:00",
    "revised": "17 January 1998"
  },
  "id": "person-lesliepackkaelbling::S1",
  "title": "Planning and acting in partially observable stochastic domains",
  "url": "https://people.csail.mit.edu/lpk/papers/aij98-pomdp.pdf"
}

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Leslie Pack Kaelbling is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Leslie Pack Kaelbling is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lisa Krayer

Lisa Krayer is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Lisa Krayer is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-c34e0d7534f508::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Lisa Krayer is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Lisa Krayer is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lu Lu

Lu Lu is a listed coauthor of Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators, a study introducing an architecture for learning mappings between functions.

DeepONet separates encoding of sampled input functions into a branch network from encoding output-domain coordinates into a trunk network.

The authors examine explicit operators such as integrals and implicit operators defined by differential equations, including how representations of input functions affect generalization.

Sources and details

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

{
  "access_scope": "Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.",
  "authors": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "authors_in_source_order": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "dates": {
    "citation_publication_date": [
      "2021/03"
    ],
    "retrieved_utc": "2026-10-07T18:12:22.153875+00:00",
    "visible_issue_date": "March 2021",
    "visible_published": "18 March 2021"
  },
  "id": "person-coverage-123b127579d5fc::S1",
  "title": "Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators",
  "url": "https://www.nature.com/articles/s42256-021-00302-5"
}

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marten Lienen

Marten Lienen is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Marten Lienen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-be52abd7112ac4::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Marten Lienen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Marten Lienen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matthew Johnson

Matthew Johnson is a listed coauthor of a paper introducing Project Malmo as an AI experimentation platform built on Minecraft.

An abstraction layer supports varied navigation, survival, collaboration and problem-solving tasks within complex three-dimensional worlds.

The platform exposes an API for integrating agents, designing tasks and running experiments, making it a research environment rather than evidence that an agent has achieved general intelligence.

Sources and details

The Malmo Platform for Artificial Intelligence Experimentation

{
  "access_scope": "The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Matthew Johnson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "authors_in_source_order": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:30.451187+00:00",
    "venue": "IJCAI-16 proceedings, 2016"
  },
  "id": "person-coverage-7cb3539aaaf38d::S1",
  "title": "The Malmo Platform for Artificial Intelligence Experimentation",
  "url": "https://www.ijcai.org/Proceedings/16/Papers/643.pdf"
}

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Matthew Johnson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Matthew Johnson is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Melissa A. Valentine

Melissa A. Valentine is a listed coauthor of Algorithms at Work: The New Contested Terrain of Control, a review of algorithmic control in organizations.

The review synthesizes interdisciplinary workplace research using organizational control as contested terrain between employers and workers.

It groups algorithmic control into restricting and recommending work, recording and rating workers, and replacing and rewarding them, while also examining worker resistance.

Sources and details

Algorithms at Work: The New Contested Terrain of Control

{
  "access_scope": "Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.",
  "authors": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "authors_in_source_order": [
    "Katherine C. Kellogg",
    "Melissa A. Valentine",
    "Angèle Christin"
  ],
  "dates": {
    "journal_year": "2020",
    "retrieved_utc": "2026-10-07T18:12:50.941402+00:00"
  },
  "id": "person-coverage-cfc003b499ae0b::S1",
  "title": "Algorithms at Work: The New Contested Terrain of Control",
  "url": "https://mvalentine.github.io/pdfs/algorithms-at-work.pdf"
}

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

Academy of Management Annals 14(1), 366–410 review PDF; synthesis of organizational research, not a universal causal estimate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael A. Osborne

Michael A. Osborne is a listed coauthor of a study estimating occupational susceptibility to computerisation through a Gaussian-process classifier.

The method assigns computerisation probabilities to 702 detailed occupations and relates them to employment, wages and educational attainment in the United States.

The authors use the estimates to describe exposure to future automation, separating an occupation’s modeled susceptibility from observed job elimination.

Sources and details

The Future of Employment: How Susceptible Are Jobs to Computerisation?

{
  "access_scope": "The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Michael A. Osborne is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "authors_in_source_order": [
    "Carl Benedikt Frey",
    "Michael A. Osborne"
  ],
  "dates": {
    "manuscript": "September 17, 2013",
    "retrieved_utc": "2026-10-07T18:19:03.035966+00:00"
  },
  "id": "person-coverage-e88e354341380c::S1",
  "title": "The Future of Employment: How Susceptible Are Jobs to Computerisation?",
  "url": "https://www.oxfordmartin.ox.ac.uk/downloads/academic/The_Future_of_Employment.pdf"
}

The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Michael A. Osborne is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Future of Employment: How Susceptible Are Jobs to Computerisation?. September 2013 manuscript; estimated susceptibility is not a timetable, realized employment loss or prediction about every contemporary AI tool. Michael A. Osborne is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Gastegger

Michael Gastegger is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Michael Gastegger is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-8d8bb969c0c306::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Michael Gastegger is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Michael Gastegger is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael L. Littman

Michael L. Littman is a listed coauthor of a paper bringing operations-research methods to action selection when observations and outcomes are uncertain.

The authors introduce Markov and partially observable Markov decision processes, then outline an offline algorithm for solving the latter.

They show how some solutions can yield finite-memory controllers and discuss the complexity that motivates approximate alternatives.

Sources and details

Planning and acting in partially observable stochastic domains

{
  "access_scope": "Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Michael L. Littman is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "authors_in_source_order": [
    "Leslie Pack Kaelbling",
    "Michael L. Littman",
    "Anthony R. Cassandra"
  ],
  "dates": {
    "publication": "1998",
    "received": "11 October 1995",
    "retrieved_utc": "2026-10-07T18:02:12.129443+00:00",
    "revised": "17 January 1998"
  },
  "id": "person-michaelllittman::S1",
  "title": "Planning and acting in partially observable stochastic domains",
  "url": "https://people.csail.mit.edu/lpk/papers/aij98-pomdp.pdf"
}

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Michael L. Littman is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Planning and acting in partially observable stochastic domains. The 1998 paper’s controller extraction applies in some cases; exact solution methods are not portrayed as efficient for arbitrary partially observable domains. Michael L. Littman is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Neunert

Michael Neunert is a listed coauthor of a study applying reinforcement learning to magnetic control of tokamak plasmas.

The controller learns to command the full set of coils from high-level objectives while respecting physical and operational constraints.

The authors report tracking position, current and shape across several TCV configurations, including two separate plasmas maintained in one vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Michael Neunert is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "authors_in_source_order": [
    "Jonas Degrave",
    "Federico Felici",
    "Jonas Buchli",
    "Michael Neunert",
    "Brendan Tracey",
    "Francesco Carpanese",
    "Timo Ewalds",
    "Roland Hafner",
    "Abbas Abdolmaleki",
    "Diego de las Casas",
    "Craig Donner",
    "Leslie Fritz",
    "Cristian Galperti",
    "Andrea Huber",
    "James Keeling",
    "Maria Tsimpoukelli",
    "Jackie Kay",
    "Antoine Merle",
    "Jean-Marc Moret",
    "Seb Noury",
    "Federico Pesamosca",
    "David Pfau",
    "Olivier Sauter",
    "Cristian Sommariva",
    "Stefano Coda",
    "Basil Duval",
    "Ambrogio Fasoli",
    "Pushmeet Kohli",
    "Koray Kavukcuoglu",
    "Demis Hassabis",
    "Martin Riedmiller"
  ],
  "dates": {
    "Accepted": "01 December 2021",
    "Issue date": "17 February 2022",
    "Published": "16 February 2022",
    "Received": "14 July 2021",
    "Version of record": "16 February 2022",
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "person-coverage-c78ab136e9f07c::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Michael Neunert is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Magnetic control of tokamak plasmas through deep reinforcement learning. Experimental control results concern the specified TCV configurations, not net fusion-energy production or a general guarantee for all reactors. The equal-contribution author note is preserved without assigning undocumented individual tasks. Michael Neunert is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michelle Carr

Michelle Carr is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-de82dcd4e3ab4f::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Murray Campbell

Murray Campbell is a listed coauthor of Deep Blue, an account of the design behind Deep Blue.

The system combines a specialized single-chip chess search engine with several levels of parallel computation.

The account also identifies search extensions, a detailed evaluation function, and a grandmaster-game database as interacting components of its design.

Sources and details

Deep Blue

{
  "access_scope": "IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.",
  "authors": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "authors_in_source_order": [
    "Murray Campbell",
    "A.Joseph Hoane Jr.",
    "Feng-Hsiung Hsu"
  ],
  "dates": {
    "citation_publication_date": [
      "2002/01/01"
    ],
    "retrieved_utc": "2026-10-07T18:12:53.467757+00:00"
  },
  "id": "person-coverage-f00df94cb3d405::S1",
  "title": "Deep Blue",
  "url": "https://research.ibm.com/publications/deep-blue"
}

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

IBM publication abstract and metadata; visibleDate 01 Jan 2002 retained separately from abstract copyright 2001. Source spells selected credit A.Joseph Hoane Jr.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nate Soares

Nate Soares is a listed coauthor of the Corrigibility paper, which asks how an AI system could cooperate with corrective intervention despite incentives to resist it.

The authors analyze utility functions intended to permit safe shutdown without encouraging the agent either to prevent or to cause a shutdown request.

They also require that the behavior survive self-modification and new subsystems, concluding that the proposals examined do not yet satisfy all the stated desiderata.

Sources and details

Corrigibility

{
  "access_scope": "Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Nate Soares is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "authors_in_source_order": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:12.785068+00:00",
    "venue": "AAAI Workshops, January 25–26, 2015"
  },
  "id": "person-coverage-22ffdc5a6986c5::S1",
  "title": "Corrigibility",
  "url": "https://intelligence.org/files/Corrigibility.pdf"
}

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Nate Soares is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Nate Soares is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Osama Abdin

Osama Abdin is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Osama Abdin is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-4aefc53103bc7a::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Osama Abdin is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Osama Abdin is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oscar Rosello

Oscar Rosello is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-f8f30a18964575::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pat Pataranutaporn

Pat Pataranutaporn is a listed coauthor of Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness, a study of how motive descriptions change conversational-AI experiences.

Participants used the same conversational AI after receiving different descriptions of its motives, allowing the study to examine how prior beliefs shaped interaction.

The authors report that a caring-motive primer increased perceived trust, empathy, and effectiveness, with stronger effects for the more sophisticated model in their experiment.

Sources and details

Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness

{
  "access_scope": "Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.",
  "authors": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "authors_in_source_order": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "dates": {
    "citation_publication_date": [
      "2023/10"
    ],
    "retrieved_utc": "2026-10-07T18:13:39.365364+00:00",
    "visible_issue_date": "October 2023",
    "visible_published": "02 October 2023"
  },
  "id": "person-coverage-935a1b625cad2b::S1",
  "title": "Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness",
  "url": "https://www.nature.com/articles/s42256-023-00720-7"
}

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pattie Maes

Pattie Maes is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-5c86d539bf797c::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pedro Lopes

Pedro Lopes is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-3ae8e7c688876e::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pengzhan Jin

Pengzhan Jin is a listed coauthor of Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators, a study introducing an architecture for learning mappings between functions.

DeepONet separates encoding of sampled input functions into a branch network from encoding output-domain coordinates into a trunk network.

The authors examine explicit operators such as integrals and implicit operators defined by differential equations, including how representations of input functions affect generalization.

Sources and details

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

{
  "access_scope": "Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.",
  "authors": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "authors_in_source_order": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "dates": {
    "citation_publication_date": [
      "2021/03"
    ],
    "retrieved_utc": "2026-10-07T18:12:22.153875+00:00",
    "visible_issue_date": "March 2021",
    "visible_published": "18 March 2021"
  },
  "id": "person-coverage-b89c416f8c1527::S1",
  "title": "Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators",
  "url": "https://www.nature.com/articles/s42256-021-00302-5"
}

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ron S. Hirschprung

Ron S. Hirschprung is a listed coauthor of a systematic review treating AI both as a source of privacy risks and as a tool for privacy protection.

The authors classify 94 papers by technological domains, privacy actions, protective strategies and the direction of the AI-privacy interaction.

A queryable Neo4J graph represents relationships among the reviewed objects and can be extended with future publications.

Sources and details

Both ends of artificial intelligence impacting privacy: a review of violation and protection

{
  "access_scope": "Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Ron S. Hirschprung is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "authors_in_source_order": [
    "Nadav Voloch",
    "Ron S. Hirschprung"
  ],
  "dates": {
    "article_type": "SYSTEMATIC REVIEW",
    "citation_publication_date": "2026/02/18",
    "published": "18 February 2026",
    "retrieved_utc": "2026-10-07T18:11:02.244538+00:00"
  },
  "id": "person-coverage-0e369febfdd350::S1",
  "title": "Both ends of artificial intelligence impacting privacy: a review of violation and protection",
  "url": "https://doi.org/10.3389/frai.2026.1686454"
}

Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Ron S. Hirschprung is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Both ends of artificial intelligence impacting privacy: a review of violation and protection. The review’s classifications and graph organize its selected literature; they do not establish universal privacy guarantees or replace the distinction the paper makes between privacy and security. Ron S. Hirschprung is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ruby Liu

Ruby Liu is a listed coauthor of Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness, a study of how motive descriptions change conversational-AI experiences.

Participants used the same conversational AI after receiving different descriptions of its motives, allowing the study to examine how prior beliefs shaped interaction.

The authors report that a caring-motive primer increased perceived trust, empathy, and effectiveness, with stronger effects for the more sophisticated model in their experiment.

Sources and details

Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness

{
  "access_scope": "Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.",
  "authors": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "authors_in_source_order": [
    "Pataranutaporn, Pat",
    "Liu, Ruby",
    "Finn, Ed",
    "Maes, Pattie"
  ],
  "dates": {
    "citation_publication_date": [
      "2023/10"
    ],
    "retrieved_utc": "2026-10-07T18:13:39.365364+00:00",
    "visible_issue_date": "October 2023",
    "visible_published": "02 October 2023"
  },
  "id": "person-coverage-3f62fd0608106d::S1",
  "title": "Influencing human–AI interaction by priming beliefs about AI can increase perceived trustworthiness, empathy and effectiveness",
  "url": "https://www.nature.com/articles/s42256-023-00720-7"
}

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

Nature Machine Intelligence abstract, published 02 October 2023; short experimental interaction and perceived qualities, not intrinsic empathy or long-term benefit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Saran Rajendran

Saran Rajendran is a listed coauthor of a field-experiment working paper examining how GPT-4 access changes consultants’ performance on knowledge-intensive tasks.

After a baseline task, the study randomly assigns 758 consultants to no access, access alone or access with a prompt-engineering overview.

The results distinguish tasks helped by AI from a selected task on which users were less likely to solve the problem correctly, making task fit central to the reported productivity gains.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Saran Rajendran is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "manuscript": "September 22, 2023",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00",
    "status": "Working Paper 24-013, draft for discussion"
  },
  "id": "person-coverage-48e8a06d13d683::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Saran Rajendran is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality. The September 2023 working paper and its sampled consulting tasks are distinct from later revisions or publications; gains and failures do not establish current GPT performance across all work. Saran Rajendran is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scott Skirlo

Scott Skirlo is a listed coauthor of Deep learning with coherent nanophotonic circuits, a study of optical hardware for neural-network inference.

The paper proposes an optical neural-network architecture and tests a programmable silicon-photonic processor containing 56 Mach–Zehnder interferometers.

Its vowel-recognition demonstration evaluates an essential part of the architecture, while the suggested speed and power advantages remain proposed potential benefits.

Sources and details

Deep learning with coherent nanophotonic circuits

{
  "access_scope": "Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.",
  "authors": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "authors_in_source_order": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "dates": {
    "citation_publication_date": [
      "2017/07"
    ],
    "retrieved_utc": "2026-10-07T18:11:34.777972+00:00",
    "visible_issue_date": "01 July 2017",
    "visible_published": "12 June 2017"
  },
  "id": "person-coverage-cf2dafc47ee4f9::S1",
  "title": "Deep learning with coherent nanophotonic circuits",
  "url": "https://www.nature.com/articles/nphoton.2017.93"
}

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shuxin Zheng

Shuxin Zheng is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Shuxin Zheng is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-ce3249b43e7e36::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Shuxin Zheng is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Shuxin Zheng is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Soojung Yang

Soojung Yang is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Soojung Yang is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-9373e376a90ad7::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Soojung Yang is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Soojung Yang is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stuart Armstrong

Stuart Armstrong is a listed coauthor of the Corrigibility paper, which asks how an AI system could cooperate with corrective intervention despite incentives to resist it.

The authors analyze utility functions intended to permit safe shutdown without encouraging the agent either to prevent or to cause a shutdown request.

They also require that the behavior survive self-modification and new subsystems, concluding that the proposals examined do not yet satisfy all the stated desiderata.

Sources and details

Corrigibility

{
  "access_scope": "Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Stuart Armstrong is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "authors_in_source_order": [
    "Nate Soares",
    "Benja Fallenstein",
    "Eliezer Yudkowsky",
    "Stuart Armstrong"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:12.785068+00:00",
    "venue": "AAAI Workshops, January 25–26, 2015"
  },
  "id": "person-coverage-8f0a507a14cba4::S1",
  "title": "Corrigibility",
  "url": "https://intelligence.org/files/Corrigibility.pdf"
}

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Stuart Armstrong is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Corrigibility. The 2015 conceptual analysis concerns the defined rational-agent and shutdown problem; its proposed conditions are not an implemented guarantee for modern deployed systems. Stuart Armstrong is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sylvia Lee

Sylvia Lee is a listed coauthor of a paper estimating computing’s carbon footprint from industry-reported characterizations.

The analysis separates emissions from operational energy use from those associated with hardware manufacturing and infrastructure.

Its mobile and data-center examples motivate attention to embodied emissions alongside efficiency gains, connecting system design with a wider life-cycle footprint.

Sources and details

Chasing Carbon: The Elusive Environmental Footprint of Computing

{
  "access_scope": "Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Sylvia Lee is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "authors_in_source_order": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "dates": {
    "DOI": "10.1109/MM.2022.3163226",
    "retrieved_utc": "2026-10-07T18:13:09.316635+00:00",
    "status": "accepted for future publication; not fully edited"
  },
  "id": "person-coverage-53b593d6097bd4::S1",
  "title": "Chasing Carbon: The Elusive Environmental Footprint of Computing",
  "url": "https://discovery.ucl.ac.uk/10147559/1/Chasing_Carbon_The_Elusive_Environmental_Footprint_of_Computing.pdf"
}

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Sylvia Lee is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Sylvia Lee is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tania Babina

Tania Babina is a listed coauthor of a study measuring firms’ AI investment through employee-resume data.

The authors relate that human-capital measure to sales, employment, market value and product innovation, and examine robustness using exposure to universities supplying AI graduates.

The reported growth patterns concentrate among larger firms, linking AI investment and new products with questions about industry concentration.

Sources and details

Artificial intelligence, firm growth, and product innovation

{
  "access_scope": "Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Tania Babina is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "authors_in_source_order": [
    "Tania Babina",
    "Anastassia Fedyk",
    "Alex He",
    "James Hodson"
  ],
  "dates": {
    "accepted": "27 October 2023",
    "available_online": "23 November 2023",
    "publication": "Journal of Financial Economics 151 (2024) 103745",
    "retrieved_utc": "2026-10-07T18:13:05.166092+00:00"
  },
  "id": "person-coverage-8e77f2a2498cd1::S1",
  "title": "Artificial intelligence, firm growth, and product innovation",
  "url": "https://alexxihe.github.io/jfe.pdf"
}

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Tania Babina is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Artificial intelligence, firm growth, and product innovation. The published observational and instrumental-variable analysis concerns its firm data and identifying assumptions; it does not guarantee that adopting AI causes growth for every company. Tania Babina is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Hempel

Tim Hempel is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Tim Hempel is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-8a2c0489be8462::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Tim Hempel is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Tim Hempel is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Hutton

Tim Hutton is a listed coauthor of a paper introducing Project Malmo as an AI experimentation platform built on Minecraft.

An abstraction layer supports varied navigation, survival, collaboration and problem-solving tasks within complex three-dimensional worlds.

The platform exposes an API for integrating agents, designing tasks and running experiments, making it a research environment rather than evidence that an agent has achieved general intelligence.

Sources and details

The Malmo Platform for Artificial Intelligence Experimentation

{
  "access_scope": "The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Tim Hutton is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "authors_in_source_order": [
    "Matthew Johnson",
    "Katja Hofmann",
    "Tim Hutton",
    "David Bignell"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:30.451187+00:00",
    "venue": "IJCAI-16 proceedings, 2016"
  },
  "id": "person-coverage-449b87300e9fc2::S1",
  "title": "The Malmo Platform for Artificial Intelligence Experimentation",
  "url": "https://www.ijcai.org/Proceedings/16/Papers/643.pdf"
}

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Tim Hutton is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

The Malmo Platform for Artificial Intelligence Experimentation. The IJCAI-16 demo paper describes the platform and its release at that time; support for AGI research does not demonstrate AGI or guarantee current software compatibility. Tim Hutton is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tomás Vega

Tomás Vega is a listed coauthor of Dream engineering: Simulating worlds through sensory stimulation, a review of sensory approaches to influencing dream experiences.

The review considers how bodily sensory inputs could influence sleep and dream experiences, drawing on technologies developed for virtual reality.

It surveys touch, temperature, balance, smell, and sound stimulation and treats their translation into dream engineering as a research direction with ethical implications.

Sources and details

Dream engineering: Simulating worlds through sensory stimulation

{
  "access_scope": "Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.",
  "authors": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "authors_in_source_order": [
    "Michelle Carr",
    "Adam Haar",
    "Judith Amores",
    "Pedro Lopes",
    "Guillermo Bernal",
    "Tomás Vega",
    "Oscar Rosello",
    "Abhinandan Jain",
    "Pattie Maes"
  ],
  "dates": {
    "accepted": "2020-05-18",
    "journal_year": "2020",
    "received": "2020-01-16",
    "retrieved_utc": "2026-10-07T18:12:50.583129+00:00",
    "revised": "2020-04-19"
  },
  "id": "person-coverage-2e1c9f9398677a::S1",
  "title": "Dream engineering: Simulating worlds through sensory stimulation",
  "url": "https://lab.plopes.org/published/2020-CC-DreamEngineering.pdf"
}

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

Published journal PDF, Consciousness and Cognition 83 article 102955; hypothetical research uses, not a demonstrated sleep intervention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Hastie

Trevor Hastie is a listed coauthor of the Generalized Additive Models paper, which replaces a linear predictor with a sum of smooth covariate functions.

An iterative local-scoring procedure estimates those unspecified functions through scatterplot smoothing within likelihood-based regression.

The authors illustrate the approach with binary-response and survival data to show how nonlinear covariate effects can be uncovered.

Sources and details

Generalized Additive Models

{
  "access_scope": "Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Trevor Hastie is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Trevor Hastie",
    "Robert Tibshirani"
  ],
  "authors_in_source_order": [
    "Trevor Hastie",
    "Robert Tibshirani"
  ],
  "dates": {
    "citation_publication_date": "1986/08",
    "first_Project_Euclid_availability": "19 April 2007",
    "published": "August, 1986",
    "retrieved_utc": "2026-10-07T18:16:39.381245+00:00"
  },
  "id": "person-coverage-db727edd6e5bd2::S1",
  "title": "Generalized Additive Models",
  "url": "https://doi.org/10.1214/ss/1177013604"
}

Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Trevor Hastie is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Generalized Additive Models. The 1986 publisher abstract and 2007 platform-availability date remain distinct; the stated illustrations do not guarantee automatic discovery of all nonlinear effects in arbitrary data. Trevor Hastie is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tuomas Sandholm

Tuomas Sandholm is a listed coauthor of a study of Pluribus, an AI evaluated against professionals in six-player no-limit Texas hold’em.

The paper explains why multiplayer games create strategic complications beyond the two-player zero-sum setting, including equilibrium selection.

Its reported professional-player comparison therefore tests performance in a specific multiplayer poker domain rather than unrestricted intelligence or a universal game-theoretic solution.

Sources and details

Superhuman AI for multiplayer poker

{
  "access_scope": "Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Tuomas Sandholm is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "authors_in_source_order": [
    "Noam Brown",
    "Tuomas Sandholm"
  ],
  "dates": {
    "publication": "30 August 2019",
    "retrieved_utc": "2026-10-07T18:11:08.127465+00:00",
    "venue": "Science 365, 885–890"
  },
  "id": "person-coverage-99b3a4427cb9ba::S1",
  "title": "Superhuman AI for multiplayer poker",
  "url": "https://noambrown.github.io/papers/19-Science-Superhuman.pdf"
}

Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Tuomas Sandholm is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Superhuman AI for multiplayer poker. The 2019 paper’s professional-opponent evaluation concerns its poker rules and setup; it does not prove optimal play for every multiplayer game or assign individual algorithm components beyond the exact coauthor credit. Tuomas Sandholm is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Usman Munir

Usman Munir is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Usman Munir is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-1503e9e530fbb9::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Usman Munir is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Usman Munir is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Victor García Satorras

Victor García Satorras is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Victor García Satorras is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-a87ffe8977cd8f::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Victor García Satorras is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Victor García Satorras is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vincent Stimper

Vincent Stimper is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Vincent Stimper is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-bb7f3ad5e557d9::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Vincent Stimper is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Vincent Stimper is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wenjie Huang

Wenjie Huang is a listed coauthor of A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness, a robotics study linking episodic memory to a workspace architecture.

The accepted manuscript implements episodic memory within a Global Workspace architecture integrating multiple cognitive components.

The reported robot experiment examines formation and retrieval of memories in interaction, including static, temporal, and contextual information; these functional results do not establish subjective consciousness.

Sources and details

A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness

{
  "access_scope": "Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.",
  "authors": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "authors_in_source_order": [
    "Wenjie Huang",
    "Antonio Chella",
    "Angelo Cangelosi"
  ],
  "dates": {
    "published_citation_year": "2024",
    "repository_download_date": "2026-10-07",
    "retrieved_utc": "2026-10-07T18:16:47.747265+00:00"
  },
  "id": "person-coverage-d3a87f9679ba5a::S1",
  "title": "A Cognitive Robotics Implementation of Global Workspace Theory for Episodic Memory Interaction with Consciousness",
  "url": "https://pure.manchester.ac.uk/ws/portalfiles/portal/258040174/Huang_2023.pdf"
}

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

Repository-labeled accepted author manuscript, distinct from the cited 2024 published version; functional architecture does not prove consciousness or AGI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Whitney Zhang

Whitney Zhang is a listed coauthor of a working paper testing ChatGPT assistance on occupation-specific professional writing tasks.

The preregistered online experiment assigns incentivized tasks to 444 college-educated professionals and randomly gives half access to the chatbot.

The reported results combine lower completion time and higher output quality with a shift from rough drafting toward idea generation and editing.

Sources and details

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence

{
  "access_scope": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Whitney Zhang is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "authors_in_source_order": [
    "Shakked Noy",
    "Whitney Zhang"
  ],
  "dates": {
    "manuscript": "March 2, 2023",
    "retrieved_utc": "2026-10-07T18:21:31.407049+00:00",
    "status": "Working Paper (not peer reviewed)"
  },
  "id": "person-local-whitneyzhang::S1",
  "title": "Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence",
  "url": "https://economics.mit.edu/sites/default/files/inline-files/Noy_Zhang_1.pdf"
}

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Whitney Zhang is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Experimental Evidence on the Productivity Effects of Generative Artificial Intelligence. March 2, 2023 non-peer-reviewed working paper; its writing-task sample and effect measures are not generalized to every occupation, current chatbot release or later published version. Whitney Zhang is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yaoyi Chen

Yaoyi Chen is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yaoyi Chen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-c0e04c86e26373::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yaoyi Chen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yaoyi Chen is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yichen Shen

Yichen Shen is a listed coauthor of Deep learning with coherent nanophotonic circuits, a study of optical hardware for neural-network inference.

The paper proposes an optical neural-network architecture and tests a programmable silicon-photonic processor containing 56 Mach–Zehnder interferometers.

Its vowel-recognition demonstration evaluates an essential part of the architecture, while the suggested speed and power advantages remain proposed potential benefits.

Sources and details

Deep learning with coherent nanophotonic circuits

{
  "access_scope": "Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.",
  "authors": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "authors_in_source_order": [
    "Shen, Yichen",
    "Harris, Nicholas C.",
    "Skirlo, Scott",
    "Prabhu, Mihika",
    "Baehr-Jones, Tom",
    "Hochberg, Michael",
    "Sun, Xin",
    "Zhao, Shijie",
    "Larochelle, Hugo",
    "Englund, Dirk",
    "Soljačić, Marin"
  ],
  "dates": {
    "citation_publication_date": [
      "2017/07"
    ],
    "retrieved_utc": "2026-10-07T18:11:34.777972+00:00",
    "visible_issue_date": "01 July 2017",
    "visible_published": "12 June 2017"
  },
  "id": "person-coverage-0604e65a15f2d8::S1",
  "title": "Deep learning with coherent nanophotonic circuits",
  "url": "https://www.nature.com/articles/nphoton.2017.93"
}

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

Nature Photonics abstract published 12 June 2017 distinct from 01 July 2017 issue; vowel-recognition demonstration and conditional optical benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Young Geun Kim

Young Geun Kim is a listed coauthor of a paper estimating computing’s carbon footprint from industry-reported characterizations.

The analysis separates emissions from operational energy use from those associated with hardware manufacturing and infrastructure.

Its mobile and data-center examples motivate attention to embodied emissions alongside efficiency gains, connecting system design with a wider life-cycle footprint.

Sources and details

Chasing Carbon: The Elusive Environmental Footprint of Computing

{
  "access_scope": "Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Young Geun Kim is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.",
  "authors": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "authors_in_source_order": [
    "Udit Gupta",
    "Young Geun Kim",
    "Sylvia Lee",
    "Jordan Tse",
    "Hsien-Hsin S. Lee",
    "Gu-Yeon Wei",
    "David Brooks",
    "Carole-Jean Wu"
  ],
  "dates": {
    "DOI": "10.1109/MM.2022.3163226",
    "retrieved_utc": "2026-10-07T18:13:09.316635+00:00",
    "status": "accepted for future publication; not fully edited"
  },
  "id": "person-coverage-8dba817878b5e0::S1",
  "title": "Chasing Carbon: The Elusive Environmental Footprint of Computing",
  "url": "https://discovery.ucl.ac.uk/10147559/1/Chasing_Carbon_The_Elusive_Environmental_Footprint_of_Computing.pdf"
}

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Young Geun Kim is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

Chasing Carbon: The Elusive Environmental Footprint of Computing. The accepted, not-fully-edited IEEE Micro manuscript’s estimates depend on the cited industry data and system examples; they are not current emissions measurements for every device or data center. Young Geun Kim is credited as coauthor; no undocumented individual work assignment or broader identity merge is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yu Xie

Yu Xie is a listed coauthor of the BioEmu study, which learns to sample protein equilibrium ensembles from molecular-dynamics simulations, static structures and experimental stability measurements.

The system generates independent structures on a single GPU, representing motions such as local unfolding, domain rearrangements and hidden-pocket formation.

The researchers compare its ensembles and relative free energies with molecular-dynamics and experimental data, evaluating emulation of protein dynamics rather than a single fixed structure.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yu Xie is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "inspected_manifestation": "cached Microsoft Research publication abstract and visible ordered authors; no full Science paper audit",
    "related_tool_listing_date": "June24,2025",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "person-coverage-de09071fbddab6::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yu Xie is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

Microsoft Research publication account of the July2025 Science BioEmu paper. Reported protein-ensemble and thermodynamic comparisons are bounded research results; clinical utility, universal simulation speedups and later deployment are not established. Yu Xie is a listed coauthor; no individual task, leadership or broader identity merge is inferred. The June24 BioEmu-1 related-tool listing is distinct from the July10 publication metadata.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhongqiang Zhang

Zhongqiang Zhang is a listed coauthor of Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators, a study introducing an architecture for learning mappings between functions.

DeepONet separates encoding of sampled input functions into a branch network from encoding output-domain coordinates into a trunk network.

The authors examine explicit operators such as integrals and implicit operators defined by differential equations, including how representations of input functions affect generalization.

Sources and details

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

{
  "access_scope": "Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.",
  "authors": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "authors_in_source_order": [
    "Lu, Lu",
    "Jin, Pengzhan",
    "Pang, Guofei",
    "Zhang, Zhongqiang",
    "Karniadakis, George Em"
  ],
  "dates": {
    "citation_publication_date": [
      "2021/03"
    ],
    "retrieved_utc": "2026-10-07T18:12:22.153875+00:00",
    "visible_issue_date": "March 2021",
    "visible_published": "18 March 2021"
  },
  "id": "person-coverage-ce65e8a4243205::S1",
  "title": "Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators",
  "url": "https://www.nature.com/articles/s42256-021-00302-5"
}

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

Nature Machine Intelligence abstract, published 18 March 2021; architecture and reported operator-learning applications, no personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zhongrui Wang

Zhongrui Wang is a listed coauthor of Resistive switching materials for information processing, a review of materials for computing in memory.

The review organizes resistive-switching materials around redox reactions, phase transitions, spin-polarized tunneling, and ferroelectric polarization.

It relates those mechanisms to switching speed, energy, reliability, density, and the requirements of computing within memory.

Sources and details

Resistive switching materials for information processing

{
  "access_scope": "Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.",
  "authors": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "authors_in_source_order": [
    "Wang, Zhongrui",
    "Wu, Huaqiang",
    "Burr, Geoffrey W.",
    "Hwang, Cheol Seong",
    "Wang, Kang L.",
    "Xia, Qiangfei",
    "Yang, J. Joshua"
  ],
  "dates": {
    "citation_publication_date": [
      "2020/03"
    ],
    "retrieved_utc": "2026-10-07T18:11:35.128101+00:00",
    "visible_issue_date": "March 2020",
    "visible_published": "13 January 2020"
  },
  "id": "person-coverage-2bdbe8772343dd::S1",
  "title": "Resistive switching materials for information processing",
  "url": "https://www.nature.com/articles/s41578-019-0159-3"
}

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

Nature Reviews Materials abstract; publication 13 January 2020 distinct from March 2020 issue. Materials review, not an implemented secure device.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adele Goldberg

Adele Goldberg helped develop and promote Smalltalk with colleagues at Xerox PARC, linking object-oriented programming with educational ideas.

The Computer History Museum describes her work with Alan Kay on learning activities for children and her efforts to communicate Smalltalk beyond the laboratory.

Her books, editing and later development-tool companies extended that work into training and software practice, keeping language development and adoption connected.

Sources and details

Adele Goldberg - CHM

{
  "access_scope": "The CHM profile credits a collaboration with Dan Ingalls and Alan Kay; it does not make Goldberg the sole inventor of object-oriented programming or every later graphical interface.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "2022",
    "retrieved_utc": "2026-10-07T18:01:51.093448+00:00"
  },
  "id": "person-adelegoldberg::S1",
  "publisher": "Computer History Museum",
  "title": "Adele Goldberg - CHM",
  "url": "https://computerhistory.org/profile/adele-goldberg/"
}

The CHM profile credits a collaboration with Dan Ingalls and Alan Kay; it does not make Goldberg the sole inventor of object-oriented programming or every later graphical interface.

The CHM profile credits a collaboration with Dan Ingalls and Alan Kay; it does not make Goldberg the sole inventor of object-oriented programming or every later graphical interface.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Butler Lampson

Butler Lampson’s work at Xerox PARC ranged across personal workstations, document tools and network security.

The Computer History Museum names contributions to the Alto, Bravo editor and Interpress page-description language, connecting interactive use with the machinery for producing documents.

Its profile also places those projects alongside work on time sharing, computer architectures and fault tolerance, showing a research career spanning several system layers.

Sources and details

Butler Lampson - CHM

{
  "access_scope": "The institutional profile names contributions to multiple systems; it does not assign their complete design or implementation to Lampson alone.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "2006",
    "retrieved_utc": "2026-10-07T18:01:51.553452+00:00"
  },
  "id": "person-butlerlampson::S1",
  "publisher": "Computer History Museum",
  "title": "Butler Lampson - CHM",
  "url": "https://computerhistory.org/profile/butler-lampson/"
}

The institutional profile names contributions to multiple systems; it does not assign their complete design or implementation to Lampson alone.

The institutional profile names contributions to multiple systems; it does not assign their complete design or implementation to Lampson alone.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dennis Ritchie

Dennis Ritchie developed C and co-created UNIX with Ken Thompson while working at Bell Labs in the early 1970s.

The Computer History Museum’s profile treats the language and operating system as related contributions to the infrastructure of computing.

It follows that work through Ritchie’s continued Bell Labs career and shared honors with Thompson, preserving collaboration alongside the distinct language credit.

Sources and details

Dennis Ritchie - CHM

{
  "access_scope": "The CHM profile supports its specific C and joint UNIX credits; broad claims about current usage or universal influence are not treated as measured evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "1997",
    "retrieved_utc": "2026-10-07T18:19:09.752130+00:00"
  },
  "id": "person-dennisritchie::S1",
  "publisher": "Computer History Museum",
  "title": "Dennis Ritchie - CHM",
  "url": "https://computerhistory.org/profile/dennis-ritchie/"
}

The CHM profile supports its specific C and joint UNIX credits; broad claims about current usage or universal influence are not treated as measured evidence.

The CHM profile supports its specific C and joint UNIX credits; broad claims about current usage or universal influence are not treated as measured evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elizabeth Feinler

Elizabeth Feinler led network information centers for ARPANET and the Defense Data Network, according to the Internet Hall of Fame.

Her group developed directory services and a query-based WHOIS server while maintaining the Internet’s host-naming registry from 1972 to 1989.

The profile also credits Feinler and her group with the familiar top-level domain scheme, connecting service administration with the names used to navigate networks.

Sources and details

Elizabeth Feinler - Internet Hall of Fame

{
  "access_scope": "The profile distinguishes Feinler’s management from the group’s collective directory and naming work; it does not make her the sole creator of every Internet naming protocol.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "induction": "2012",
    "retrieved_utc": "2026-10-07T17:55:58.093884+00:00"
  },
  "id": "person-elizabethfeinler::S1",
  "publisher": "Internet Hall of Fame",
  "title": "Elizabeth Feinler - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/elizabeth-feinler/"
}

The profile distinguishes Feinler’s management from the group’s collective directory and naming work; it does not make her the sole creator of every Internet naming protocol.

The profile distinguishes Feinler’s management from the group’s collective directory and naming work; it does not make her the sole creator of every Internet naming protocol.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Federico Faggin

Federico Faggin applied silicon-gate MOS experience to the Intel 4004’s implementation in 1971, assisted by Masatoshi Shima.

The Computer History Museum’s milestone account separates that physical implementation from the integrated-CPU concept credited to Ted Hoff and Stanley Mazor.

It also describes Faggin supervising the 8008 design, while explaining that these processors still needed supporting functions to form a complete system.

Sources and details

1971: Microprocessor Integrates CPU Function onto a Single Chip | The Silicon Engine | Computer History Museum

{
  "access_scope": "The historical milestone separates concept, chip implementation and complete-system support; Faggin’s named role is not converted into sole invention of all microprocessors.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "milestone": "1971",
    "retrieved_utc": "2026-10-07T18:19:22.952339+00:00"
  },
  "id": "person-federicofaggin::S1",
  "publisher": "Computer History Museum Silicon Engine",
  "title": "1971: Microprocessor Integrates CPU Function onto a Single Chip |  The Silicon Engine | Computer History Museum",
  "url": "https://www.computerhistory.org/siliconengine/microprocessor-integrates-cpu-function-onto-a-single-chip/"
}

The historical milestone separates concept, chip implementation and complete-system support; Faggin’s named role is not converted into sole invention of all microprocessors.

The historical milestone separates concept, chip implementation and complete-system support; Faggin’s named role is not converted into sole invention of all microprocessors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gordon Moore

Gordon Moore’s Computer History Museum profile links semiconductor development with his roles in founding Fairchild and Intel.

It describes his work at Fairchild implementing Robert Noyce’s integrated-circuit concepts and directing research and development.

The profile places Moore’s 1965 transistor-density prediction in that manufacturing context, keeping the original observation distinct from later formulations of Moore’s law.

Sources and details

Gordon Moore (In Memoriam) - CHM

{
  "access_scope": "This retrospective describes the original annual-density prediction and specific company history; it does not guarantee future doubling or verify the profile’s present-tense company rankings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "1998",
    "density_observation": "1965",
    "retrieved_utc": "2026-10-07T17:55:30.925200+00:00"
  },
  "id": "person-gordonmoore::S1",
  "publisher": "Computer History Museum",
  "title": "Gordon Moore (In Memoriam) - CHM",
  "url": "https://computerhistory.org/profile/gordon-moore/"
}

This retrospective describes the original annual-density prediction and specific company history; it does not guarantee future doubling or verify the profile’s present-tense company rankings.

This retrospective describes the original annual-density prediction and specific company history; it does not guarantee future doubling or verify the profile’s present-tense company rankings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Grace Hopper

Grace Hopper worked on compiler-based programming and language standardization after wartime computing at Harvard.

The Computer History Museum describes her development of an early compiler at Eckert-Mauchly and her role in defining COBOL in 1959.

Its profile places those technical efforts alongside naval service and teaching, connecting reusable programming languages with a wider career in computing.

Sources and details

Grace Murray Hopper - CHM

{
  "access_scope": "The same profile explicitly uses both Grace Murray Hopper and Grace Hopper; its named compiler and COBOL roles do not establish sole authorship of the language or a universal compiler-priority claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "1987",
    "COBOL_design_role": "1959",
    "retrieved_utc": "2026-10-07T18:19:43.818420+00:00"
  },
  "id": "person-gracehopper::S1",
  "publisher": "Computer History Museum",
  "title": "Grace Murray Hopper - CHM",
  "url": "https://computerhistory.org/profile/grace-murray-hopper/"
}

The same profile explicitly uses both Grace Murray Hopper and Grace Hopper; its named compiler and COBOL roles do not establish sole authorship of the language or a universal compiler-priority claim.

The same profile explicitly uses both Grace Murray Hopper and Grace Hopper; its named compiler and COBOL roles do not establish sole authorship of the language or a universal compiler-priority claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harold Cohen

Harold Cohen developed AARON as a long-running collaboration between his knowledge as a painter and a program that generated drawings.

Chris Garcia’s museum account describes early rules and forms composed by the computer and transferred to paper with a drawing robot.

Cohen then colored many outputs by hand, while treating the program as a tool for extending his own understanding of image-making rather than simply packaging expertise for others.

Sources and details

Harold Cohen and AARON—A 40-Year Collaboration - CHM

{
  "access_scope": "Garcia’s curatorial history describes particular stages of AARON and Cohen’s own interpretation; hand-colored early outputs and later versions remain distinct, and no machine consciousness is inferred.",
  "authors": [
    "Chris Garcia"
  ],
  "authors_in_source_order": [
    "Chris Garcia"
  ],
  "dates": {
    "published": "August 23, 2016",
    "retrieved_utc": "2026-10-07T17:55:30.744649+00:00"
  },
  "id": "person-coverage-3b4920ab03adee::S1",
  "publisher": "Computer History Museum",
  "title": "Harold Cohen and AARON—A 40-Year Collaboration - CHM",
  "url": "https://computerhistory.org/blog/harold-cohen-and-aaron-a-40-year-collaboration/"
}

Garcia’s curatorial history describes particular stages of AARON and Cohen’s own interpretation; hand-colored early outputs and later versions remain distinct, and no machine consciousness is inferred.

Garcia’s curatorial history describes particular stages of AARON and Cohen’s own interpretation; hand-colored early outputs and later versions remain distinct, and no machine consciousness is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean Bartik

Jean Bartik was one of six human computers selected to program ENIAC after computing ballistic tables for the US Army.

The Computer History Museum describes the team teaching themselves the new machine’s operation rather than inheriting an established programming practice.

Bartik later joined the group converting ENIAC to stored-program operation and contributed to BINAC and UNIVAC, linking early programming work with changes in computer design.

Sources and details

Jean Jennings Bartik - CHM

{
  "access_scope": "The profile explicitly uses Jean Jennings Bartik and Jean Bartik for the same subject; team programming and conversion work are not attributed to her alone or used to settle a universal first-programmer claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CHM_fellow": "2008",
    "ENIAC_conversion": "1947",
    "retrieved_utc": "2026-10-07T18:19:44.205571+00:00"
  },
  "id": "person-jeanbartik::S1",
  "publisher": "Computer History Museum",
  "title": "Jean Jennings Bartik - CHM",
  "url": "https://computerhistory.org/profile/jean-jennings-bartik/"
}

The profile explicitly uses Jean Jennings Bartik and Jean Bartik for the same subject; team programming and conversion work are not attributed to her alone or used to settle a universal first-programmer claim.

The profile explicitly uses Jean Jennings Bartik and Jean Bartik for the same subject; team programming and conversion work are not attributed to her alone or used to settle a universal first-programmer claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joel Moses

Joel Moses helped develop Macsyma to manipulate mathematical expressions symbolically, including integration, differentiation and equation solving.

Adam Zewe’s MIT obituary connects that research with Moses’s doctoral work on symbolic integration and subsequent algorithms for simplifying mathematical expressions.

The account also describes his administrative efforts to connect engineering with management and other disciplines, showing technical research alongside institution-building.

Sources and details

Joel Moses, Institute Professor Emeritus and computer science trailblazer, dies at 80 | MIT CSAIL

{
  "access_scope": "The dated obituary describes Moses’s research and administrative roles; quoted praise and historical speed comparisons do not establish sole system authorship or present-day performance.",
  "authors": [
    "Adam Zewe"
  ],
  "authors_in_source_order": [
    "Adam Zewe"
  ],
  "dates": {
    "published": "May 31, 2022",
    "retrieved_utc": "2026-10-07T18:20:06.424978+00:00"
  },
  "id": "person-joelmoses::S1",
  "publisher": "MIT CSAIL",
  "title": "Joel Moses, Institute Professor Emeritus and computer science trailblazer, dies at 80 | MIT CSAIL",
  "url": "https://www.csail.mit.edu/news/joel-moses-institute-professor-emeritus-and-computer-science-trailblazer-dies-80"
}

The dated obituary describes Moses’s research and administrative roles; quoted praise and historical speed comparisons do not establish sole system authorship or present-day performance.

The dated obituary describes Moses’s research and administrative roles; quoted praise and historical speed comparisons do not establish sole system authorship or present-day performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Bardeen

John Bardeen and Walter Brattain demonstrated the point-contact transistor at Bell Labs in 1947, under William Shockley’s direction.

The Computer History Museum explains how a small current change at one germanium contact produced a larger change at another, making the device an amplifier.

Its account distinguishes that design from Shockley’s later junction transistor, preserving separate contributions within the development celebrated by their shared Nobel Prize.

Sources and details

Inventing the Transistor - CHM Revolution

{
  "access_scope": "The institutional technical history separates Bardeen and Brattain’s point-contact amplifier from Shockley’s junction transistor; the shared prize is not substituted for an individual division of labor.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "point_contact_demonstration": "1947",
    "retrieved_utc": "2026-10-07T18:20:05.689739+00:00",
    "shared_Nobel": "1956"
  },
  "id": "person-johnbardeen::S1",
  "publisher": "Computer History Museum Revolution",
  "title": "\r\n  Inventing the Transistor - CHM Revolution  ",
  "url": "https://www.computerhistory.org/revolution/story/273"
}

The institutional technical history separates Bardeen and Brattain’s point-contact amplifier from Shockley’s junction transistor; the shared prize is not substituted for an individual division of labor.

The institutional technical history separates Bardeen and Brattain’s point-contact amplifier from Shockley’s junction transistor; the shared prize is not substituted for an individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jon Postel

Jon Postel helped develop Internet protocols while serving for nearly three decades as editor of the RFC document series.

The Internet Hall of Fame describes that editorial role as guiding drafts through an open consensus process, rather than treating standards as the product of one author.

It also credits his role in creating IANA and initially managing assignments manually, connecting collaborative protocol development with stable numbering administration.

Sources and details

Jon Postel - Internet Hall of Fame

{
  "access_scope": "The profile names contributions to protocols, RFC editing and IANA; it does not assign sole authorship of TCP/IP, SMTP or DNS, or treat historical manual processes as current operations.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "induction": "2012",
    "retrieved_utc": "2026-10-07T17:55:58.605512+00:00"
  },
  "id": "person-jonpostel::S1",
  "publisher": "Internet Hall of Fame",
  "title": "Jon Postel - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/jon-postel/"
}

The profile names contributions to protocols, RFC editing and IANA; it does not assign sole authorship of TCP/IP, SMTP or DNS, or treat historical manual processes as current operations.

The profile names contributions to protocols, RFC editing and IANA; it does not assign sole authorship of TCP/IP, SMTP or DNS, or treat historical manual processes as current operations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph Weizenbaum

Joseph Weizenbaum created ELIZA, a program that shaped replies from users’ responses to simulate a therapeutic conversation.

MIT’s obituary describes his surprise when people treated that exchange seriously and connects the experience with his later criticism of dependence on computers.

His book Computer Power and Human Reason challenged the delegation of human judgment to machines, placing the program and its reception within a broader argument about responsibility.

Sources and details

Joseph Weizenbaum, professor emeritus of computer science, 85 | MIT News | Massachusetts Institute of Technology

{
  "access_scope": "The obituary’s program account and historical interpretation are distinct from a clinical evaluation of ELIZA or evidence that it understood or experienced its conversations.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "print_version": "March 12, 2008",
    "published": "March 10, 2008",
    "retrieved_utc": "2026-10-07T18:19:51.269985+00:00"
  },
  "id": "person-josephweizenbaum::S1",
  "publisher": "MIT News",
  "title": "Joseph Weizenbaum, professor emeritus of computer science, 85 | MIT News | Massachusetts Institute of Technology",
  "url": "https://news.mit.edu/2008/obit-weizenbaum-0310"
}

The obituary’s program account and historical interpretation are distinct from a clinical evaluation of ELIZA or evidence that it understood or experienced its conversations.

The obituary’s program account and historical interpretation are distinct from a clinical evaluation of ELIZA or evidence that it understood or experienced its conversations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leslie Valiant

Leslie Valiant’s work connected machine learning with computational complexity through a mathematical account of what can be learned.

Harvard’s 2011 award announcement describes probably approximately correct learning as a framework for studying learning processes.

The same account identifies separate contributions to counting complexity and parallel-computing models, linking learning theory with questions about computational resources.

Sources and details

Leslie Valiant wins 2010 ACM A. M. Turing Award

{
  "access_scope": "The announcement explicitly uses Leslie Valiant and Leslie G. Valiant; mathematical models and historical research credits are not a guarantee that current AI learns every task or a measured claim that machines think.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "award_year": "2010",
    "published": "March 9, 2011",
    "retrieved_utc": "2026-10-07T18:14:17.060721+00:00"
  },
  "id": "person-coverage-541a2e47452535::S1",
  "publisher": "Harvard SEAS",
  "title": "Leslie Valiant wins 2010 ACM A. M. Turing Award",
  "url": "https://seas.harvard.edu/news/leslie-valiant-wins-2010-acm-m-turing-award"
}

The announcement explicitly uses Leslie Valiant and Leslie G. Valiant; mathematical models and historical research credits are not a guarantee that current AI learns every task or a measured claim that machines think.

The announcement explicitly uses Leslie Valiant and Leslie G. Valiant; mathematical models and historical research credits are not a guarantee that current AI learns every task or a measured claim that machines think.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Margaret Hamilton

Margaret Hamilton led the team responsible for Apollo’s onboard flight software at MIT’s Instrumentation Laboratory.

The Computer History Museum describes error-detection and recovery work that could interrupt routine astronaut displays with urgent information.

It connects lessons from that software effort with Hamilton’s later systems approach, keeping the collaborative mission software and subsequent formal methods in distinct roles.

Sources and details

Margaret Hamilton - CHM

{
  "access_scope": "The page title names Margaret Hamilton and the prose names Margaret H. Hamilton; the institutional account supports leadership and named reliability work, not sole authorship of Apollo software or universal error-free systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Presidential_Medal_of_Freedom": "2016",
    "retrieved_utc": "2026-10-07T18:21:29.442615+00:00"
  },
  "id": "person-margarethamilton::S1",
  "publisher": "Computer History Museum",
  "title": "Margaret Hamilton - CHM",
  "url": "https://computerhistory.org/profile/margaret-hamilton/"
}

The page title names Margaret Hamilton and the prose names Margaret H. Hamilton; the institutional account supports leadership and named reliability work, not sole authorship of Apollo software or universal error-free systems.

The page title names Margaret Hamilton and the prose names Margaret H. Hamilton; the institutional account supports leadership and named reliability work, not sole authorship of Apollo software or universal error-free systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Masatoshi Shima

Masatoshi Shima helped define the Intel 4004’s functional specification with Ted Hoff and Stanley Mazor while working for Busicom.

The Computer History Museum names logic design, simulation and test-program generation among his work on the chip.

Its profile follows him into the 8080 and later Z80 projects, distinguishing the calculator collaboration from subsequent processor development.

Sources and details

Masatoshi Shima - CHM

{
  "access_scope": "The profile identifies collaborative specifications and specific engineering work; it does not make Shima the sole inventor of the 4004, 8080 or Z80.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Busicom_work": "1969",
    "CHM_fellow": "2009",
    "retrieved_utc": "2026-10-07T18:22:01.368811+00:00"
  },
  "id": "person-masatoshishima::S1",
  "publisher": "Computer History Museum",
  "title": "Masatoshi Shima - CHM",
  "url": "https://computerhistory.org/profile/masatoshi-shima/"
}

The profile identifies collaborative specifications and specific engineering work; it does not make Shima the sole inventor of the 4004, 8080 or Z80.

The profile identifies collaborative specifications and specific engineering work; it does not make Shima the sole inventor of the 4004, 8080 or Z80.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steve Furber

Steve Furber worked with Sophie Wilson on the BBC Micro and ARM processor architecture at Acorn.

The Computer History Museum places the BBC computer in a television-linked educational effort and describes their later design of a 32-bit RISC processor.

The profile also connects Furber’s research with SpiNNaker’s proposed brain emulation, keeping a research aim distinct from the demonstrated commercial processor work.

Sources and details

Steve Furber - CHM

{
  "access_scope": "The cached profile’s historical designs and SpiNNaker research aim remain distinct; its shipment counts, current titles and brain-emulation target are not verified as present-day outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ARM_processor_design": "1985",
    "CHM_fellow": "2012",
    "retrieved_utc": "2026-10-07T18:22:25.850672+00:00"
  },
  "id": "person-stevefurber::S1",
  "publisher": "Computer History Museum",
  "title": "Steve Furber - CHM",
  "url": "https://computerhistory.org/profile/steve-furber/"
}

The cached profile’s historical designs and SpiNNaker research aim remain distinct; its shipment counts, current titles and brain-emulation target are not verified as present-day outcomes.

The cached profile’s historical designs and SpiNNaker research aim remain distinct; its shipment counts, current titles and brain-emulation target are not verified as present-day outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Roger B. Myerson

Roger B. Myerson’s Nobel autobiography describes game theory as a way to analyze interactions among rational decision-makers.

He recounts learning from John Harsanyi’s work on incomplete information and developing his research around incentives and coordination mechanisms.

The account connects that intellectual path with mechanism design and later questions about political institutions, presenting a first-person history of how his research interests developed.

Sources and details

Roger B. Myerson – Biographical - NobelPrize.org

{
  "access_scope": "The HTML title names Roger B. Myerson; first-person autobiography and its stated award-time publication context support the described research path, not an independently measured causal biography or sole invention of mechanism design.",
  "authors": [
    "Roger B. Myerson"
  ],
  "authors_in_source_order": [
    "Roger B. Myerson"
  ],
  "dates": {
    "award_time_autobiography": "2007",
    "retrieved_utc": "2026-10-07T18:16:58.576406+00:00"
  },
  "id": "person-coverage-941588166f421a::S1",
  "publisher": "NobelPrize.org",
  "title": "Roger B. Myerson – Biographical - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2007/myerson/biographical/"
}

The HTML title names Roger B. Myerson; first-person autobiography and its stated award-time publication context support the described research path, not an independently measured causal biography or sole invention of mechanism design.

The HTML title names Roger B. Myerson; first-person autobiography and its stated award-time publication context support the described research path, not an independently measured causal biography or sole invention of mechanism design.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jay W. Lorsch

Jay W. Lorsch studied how organizational structures interact with their environments and later extended that interest to corporate boards.

Harvard Business School’s obituary describes his collaboration with Paul Lawrence on Organization and Environment as challenging the idea of one recipe for effectiveness.

It follows that work into a survey of board members and subsequent books on directors, connecting contingency thinking with the practical limits of board governance.

Sources and details

Harvard Business School Professor Emeritus Jay W. Lorsch Dies at 92 | Newsroom

{
  "access_scope": "The dated institutional obituary supports Lorsch’s named research and collaboration; it does not infer that he alone established organizational theory or that one board design guarantees effectiveness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "August 14, 2025",
    "retrieved_utc": "2026-10-07T18:20:11.637418+00:00"
  },
  "id": "person-jaywlorsch::S1",
  "publisher": "Harvard Business School",
  "title": "Harvard Business School Professor Emeritus Jay W. Lorsch Dies at 92 | Newsroom",
  "url": "https://www.hbs.edu/news/releases/jay-w-lorsch-obituary"
}

The dated institutional obituary supports Lorsch’s named research and collaboration; it does not infer that he alone established organizational theory or that one board design guarantees effectiveness.

The dated institutional obituary supports Lorsch’s named research and collaboration; it does not infer that he alone established organizational theory or that one board design guarantees effectiveness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Perlin

Ken Perlin’s NYU-hosted account explains procedural textures as generated appearances rather than individually modeled surface detail.

Its examples include a torch whose flame, background and handle are produced through textures, illustrating how noise can support varied natural-looking forms.

The page reproduces his 1997 technical-achievement citation and describes related texture and hypertexture work, connecting a visual-effects technique with a broader research practice.

Sources and details

Ken's Academy Award

{
  "access_scope": "First-person technical account and reproduced award citation; examples and historical software mentions do not prove use in every film or current implementation, and collaborators on related papers remain separate.",
  "authors": [
    "Ken Perlin"
  ],
  "authors_in_source_order": [
    "Ken Perlin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:31.114610+00:00",
    "technical_achievement_award": "1997"
  },
  "id": "person-coverage-9281796f038c14::S1",
  "publisher": "NYU-hosted Ken Perlin page",
  "title": "\nKen's Academy Award\n",
  "url": "https://cs.nyu.edu/~perlin/doc/oscar"
}

First-person technical account and reproduced award citation; examples and historical software mentions do not prove use in every film or current implementation, and collaborators on related papers remain separate.

First-person technical account and reproduced award citation; examples and historical software mentions do not prove use in every film or current implementation, and collaborators on related papers remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alan Kay

The Computer History Museum describes Alan Kay’s work at Utah and Xerox PARC as connecting object-oriented programming with interactive personal computing.

Its profile links Smalltalk and overlapping-window interfaces to that broader PARC effort, preserving the participation of his colleagues.

It also traces his Dynabook idea to a portable personal computer for children and his later founding of Viewpoints Research Institute to learning research.

Sources and details

Alan Kay - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2021-05-18T23:27:49+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:01:51.196308+00:00"
  },
  "id": "person-alankay::S1",
  "title": "Alan Kay - CHM",
  "url": "https://computerhistory.org/profile/alan-kay/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carver Mead

The Computer History Museum credits Carver Mead with developing structured custom design as a computer-aided methodology for VLSI circuitry.

It connects the dissemination of those ideas to Introduction to VLSI Systems, which he co-authored with Lynn Conway.

The profile also describes his neuromorphic electronics research as building circuits modeled on living nervous systems.

Sources and details

Carver Mead - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2021-02-13T00:58:36+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:01:51.636370+00:00"
  },
  "id": "person-carvermead::S1",
  "title": "Carver Mead - CHM",
  "url": "https://computerhistory.org/profile/carver-mead/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Thacker

The Computer History Museum credits Charles Thacker with leading the hardware design and much of the microcode work for Xerox PARC’s Alto.

It records additional contributions to Ethernet and laser printing, placing them within the laboratory’s networked-computing work.

The profile follows his later work from multiprocessor systems at DEC’s Systems Research Center to the first Microsoft Tablet PC prototypes.

Sources and details

Charles Thacker - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2024-06-19T06:23:36+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:01:51.654523+00:00"
  },
  "id": "person-charlesthacker::S1",
  "title": "Charles Thacker - CHM",
  "url": "https://computerhistory.org/profile/charles-thacker/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Davies

The Internet Hall of Fame describes Donald Davies’s packet-switching idea as splitting long messages into separately transmitted chunks to reduce congestion.

It places the idea in his National Physical Laboratory work, originating in 1965 and developed after his return in 1966.

The biography identifies his team’s laboratory network as an implementation of the technique while acknowledging that other scientists reached similar conclusions independently.

Sources and details

Donald Davies - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:53:16+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:19:27.455977+00:00"
  },
  "id": "person-donalddavies::S1",
  "title": "Donald Davies - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/donald-davies/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ivan Sutherland

The Computer History Museum identifies Ivan Sutherland’s Sketchpad dissertation as an interactive computer-aided design system.

Its biography places his subsequent work in directing ARPA’s Information Processing Techniques Office from 1964 to 1966.

It then records his collaboration with David Evans to establish computer-graphics research at Utah and their graphics company in 1968.

Sources and details

Ivan Sutherland - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2021-02-12T23:10:31+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:19:44.018929+00:00"
  },
  "id": "person-ivansutherland::S1",
  "title": "Ivan Sutherland - CHM",
  "url": "https://computerhistory.org/profile/ivan-sutherland/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Thompson

The Computer History Museum credits Ken Thompson and Dennis Ritchie together with creating Unix at Bell Telephone Laboratories in the 1960s and 1970s.

It lists Thompson’s work on the B language and Plan 9 alongside the open source Go programming language.

The profile also includes Belle, the computer that became the 1980 world computer-chess champion, illustrating work beyond operating-system design.

Sources and details

Ken Thompson - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2021-11-11T15:17:16+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:20:43.747453+00:00"
  },
  "id": "person-kenthompson::S1",
  "title": "Ken Thompson - CHM",
  "url": "https://computerhistory.org/profile/kenneth-thompson/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Konrad Zuse

The Computer History Museum describes Konrad Zuse’s early computer instructions as being punched onto reused movie film.

Its biography traces his designs through the program-controlled electromechanical Z3 to the relay-based Z4, which he sold to ETH Zurich.

It also records his development of Plankalkül as an early high-level programming language, separate from the hardware systems.

Sources and details

Konrad Zuse - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2026-06-15T15:36:48+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:20:44.230536+00:00"
  },
  "id": "person-konradzuse::S1",
  "title": "Konrad Zuse - CHM",
  "url": "https://computerhistory.org/profile/konrad-zuse/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linus Torvalds

The Internet Hall of Fame describes Linus Torvalds as writing the Linux kernel and opening its development to other programmers.

The biography records his shift in 2003 to concentrating on the kernel with support from the Open Source Development Labs consortium.

It distinguishes that technical work from the supporting organization’s later merger with the Free Standards Group to form the Linux Foundation in 2007.

Sources and details

Linus Torvalds Inductee Biography - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:51:16+00:00"
    ],
    "retrieved_utc": "2026-10-07T17:55:59.078340+00:00"
  },
  "id": "person-linustorvalds::S1",
  "title": "Linus Torvalds Inductee Biography - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/linus-torvalds/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Louis Pouzin

The Internet Hall of Fame links Louis Pouzin’s career to both MIT’s CTSS time-sharing system and the CYCLADES network.

It highlights CYCLADES’s datagram packet-switching approach in its account of the development leading toward TCP/IP.

The biography also records his participation in network standardization through IFIP, ISO, and CCITT, distinguishing standards work from implementing particular systems.

Sources and details

Louis Pouzin - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:50:56+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:21:51.301963+00:00"
  },
  "id": "person-louispouzin::S1",
  "title": "Louis Pouzin - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/louis-pouzin/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lynn Conway

The Computer History Museum credits Lynn Conway with multiple-out-of-order dynamic instruction scheduling in IBM’s Advanced Computing Systems project.

It describes her later work at Xerox PARC on scalable VLSI design rules and the Mead–Conway textbook, followed by teaching those methods at MIT in 1978.

The profile connects her rapid chip-prototyping infrastructure to the later MOSIS system and the separation of chip design from foundry manufacturing.

Sources and details

Lynn Conway - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2024-06-19T05:18:58+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:21:29.080804+00:00"
  },
  "id": "person-lynnconway::S1",
  "title": "Lynn Conway - CHM",
  "url": "https://computerhistory.org/profile/lynn-conway/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Baran

The Internet Hall of Fame describes Paul Baran’s packet-switching work as emerging from RAND research on communications able to survive nuclear damage.

It records his original term message blocks and explicitly acknowledges parallel work by Donald Davies.

The biography also identifies Baran as a founder of the Institute for the Future and records his later involvement in networking technologies including wireless spectrum.

Sources and details

Paul Baran - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:49:29+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:22:10.596285+00:00"
  },
  "id": "person-paulbaran::S1",
  "title": "Paul Baran - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/paul-baran/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Radia Perlman

The Internet Hall of Fame credits Radia Perlman with a spanning-tree algorithm that expanded the scale of Ethernet networks.

It describes TRILL as her later approach to making better use of Ethernet bandwidth than spanning-tree-based forwarding.

The biography also records work on public-key-infrastructure trust models, data expiration, and distributed algorithms designed to tolerate malicious participants.

Sources and details

Radia Perlman - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:23:24+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:22:11.181375+00:00"
  },
  "id": "person-radiaperlman::S1",
  "title": "Radia Perlman - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/radia-perlman/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Stallman

The Internet Hall of Fame traces Richard Stallman’s free-software work to his 1983 announcement of GNU and collaborative development beginning in 1984.

It identifies the Free Software Foundation, founded in 1985, as a separate institution supporting that movement.

The biography also records his MIT AI Lab work on dependency-directed backtracking and the extensible Emacs editor, distinguishing those technical projects from later advocacy.

Sources and details

Richard Stallman - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2023-09-20T13:33:40+00:00"
    ],
    "retrieved_utc": "2026-10-07T17:55:59.564609+00:00"
  },
  "id": "person-richardstallman::S1",
  "title": "Richard Stallman - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/richard-stallman/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sophie Wilson

The Computer History Museum credits Sophie Wilson with designing the BBC Micro operating system and writing its BASIC interpreter.

It describes the computer’s prototype and subsequent refinement as a collaboration with Steve Furber at Acorn.

The biography follows that collaboration into the 32-bit RISC processor design of 1985 and its subsequent use in the BBC Micro, Archimedes, and Apple Newton.

Sources and details

Sophie Wilson - CHM

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2021-02-10T23:35:41+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:22:25.833222+00:00"
  },
  "id": "person-sophiewilson::S1",
  "title": "Sophie Wilson - CHM",
  "url": "https://computerhistory.org/profile/sophie-wilson/"
}

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Computer History Museum. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vint Cerf

The Internet Hall of Fame identifies Vint Cerf as a co-designer of TCP/IP and the Internet’s architecture alongside the collaborative protocol-development work recognized with Robert E. Kahn.

Its biography connects his DARPA work to Internet packet and security technologies.

It also records his founding presidency of the Internet Society from 1992 to 1995 and his ICANN chairmanship from 2000 to 2007 as separate forms of institutional stewardship.

Sources and details

Vint Cerf Inductee Biography - Internet Hall of Fame

{
  "access_scope": "Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "cached_page_modified_metadata": [
      "2026-09-14T17:03:39+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:22:45.685331+00:00"
  },
  "id": "person-vintcerf::S1",
  "title": "Vint Cerf Inductee Biography - Internet Hall of Fame",
  "url": "https://www.internethalloffame.org/inductee/vint-cerf/"
}

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

Cached institutional biography; historical contributions attributed to Internet Hall of Fame. Present-tense appointments, current adoption totals, and broad priority claims omitted. Subject is not inferred to be page author; page modification date is distinct from contribution or induction dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bengt Holmström

The Royal Swedish Academy of Sciences’ 2016 prize release describes Bengt Holmström’s analysis of incentives when a principal cannot fully observe an agent’s actions.

It explains his informativeness principle as linking compensation to information relevant to performance while balancing risk and incentives.

The release follows extensions of that framework to promotions, multiple tasks with partially observed performance, and free-riding within teams.

Sources and details

The Prize in Economic Sciences 2016 - Press release - NobelPrize.org

{
  "access_scope": "Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:46.450409+00:00",
    "visible_release_date": "2016-10-10"
  },
  "id": "person-bengtholmstrom::S1",
  "title": "The Prize in Economic Sciences 2016 - Press release - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2016/press-release/"
}

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oliver Hart

The Royal Swedish Academy of Sciences’ 2016 prize release credits Oliver Hart with contributions to incomplete-contract theory beginning in the mid-1980s.

The account asks how control rights should be allocated when agreements cannot specify every eventuality.

It connects that framework to questions about company ownership, debt and equity financing, and whether institutions should be publicly or privately owned.

Sources and details

The Prize in Economic Sciences 2016 - Press release - NobelPrize.org

{
  "access_scope": "Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:46.450409+00:00",
    "visible_release_date": "2016-10-10"
  },
  "id": "person-oliverhart::S1",
  "title": "The Prize in Economic Sciences 2016 - Press release - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2016/press-release/"
}

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James A. Mirrlees

The Royal Swedish Academy of Sciences’ 1996 prize release describes James A. Mirrlees’s solution to income-tax design when governments cannot directly observe individual productivity.

It identifies single crossing as a condition that simplifies the incentive problem and connects his analysis to the revelation principle.

The release also explains how he extended similar reasoning to moral-hazard contracts in which one party’s actions are hidden from another.

Sources and details

The Prize in Economic Sciences 1996 - Press release - NobelPrize.org

{
  "access_scope": "Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:13.347767+00:00",
    "visible_release_date": "1996-10-08"
  },
  "id": "person-jamesamirrlees::S1",
  "title": "The Prize in Economic Sciences 1996 - Press release - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1996/press-release/"
}

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard H. Thaler

The Royal Swedish Academy of Sciences’ 2017 prize release describes Richard H. Thaler’s incorporation of limited rationality, social preferences, and self-control into economic analysis.

It explains mental accounting as evaluating choices through separate mental accounts rather than considering their combined effect.

The release presents his planner-doer model as a way to analyze tension between long-term intentions and immediate temptations.

Sources and details

The Prize in Economic Sciences 2017 - Press release - NobelPrize.org

{
  "access_scope": "Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:15.349455+00:00",
    "visible_release_date": "2017-10-09"
  },
  "id": "person-richardhthaler::S1",
  "title": "The Prize in Economic Sciences 2017 - Press release - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2017/press-release/"
}

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Vickrey

The Royal Swedish Academy of Sciences’ 1996 prize release describes William Vickrey’s analysis of auction design under asymmetric information.

It explains a sealed-bid second-price auction as awarding an item to the highest bidder at the next-highest offered price, linking that rule to truthful bidding in the described model.

The release also records his earlier income-tax analysis as balancing equity with incentives to exert effort when individual productivity is unobserved.

Sources and details

The Prize in Economic Sciences 1996 - Press release - NobelPrize.org

{
  "access_scope": "Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:13.347767+00:00",
    "visible_release_date": "1996-10-08"
  },
  "id": "person-williamvickrey::S1",
  "title": "The Prize in Economic Sciences 1996 - Press release - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1996/press-release/"
}

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

Dated Royal Swedish Academy of Sciences prize release on NobelPrize.org. Individual contributions are explicitly described in prose rather than inferred from a prize, citation, or joint attribution. Economic models are historical research descriptions, not financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amartya Sen

Amartya Sen’s Nobel award account connects his work on social choice, welfare comparisons and poverty measurement through questions of distribution.

It describes how his analysis of interpersonal welfare information changes the conditions for aggregating individual values into collective decisions.

His famine studies examine how people obtain food through social and economic arrangements, challenging explanations based on food shortage alone.

Sources and details

Amartya Sen — economic sciences award press release

{
  "access_scope": "Royal Swedish Academy of Sciences award account dated 14 October 1998. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "press_release_date": "14 October 1998",
    "retrieved_utc": "2026-10-07T18:15:09.455427+00:00"
  },
  "id": "person-coverage-5c18512379dc8b::S1",
  "title": "Amartya Sen — economic sciences award press release",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1998/press-release/"
}

Royal Swedish Academy of Sciences award account dated 14 October 1998. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.

Royal Swedish Academy of Sciences award account dated 14 October 1998. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gary S. Becker

Gary S. Becker’s Nobel account describes an economic approach that models purposeful choices across market and nonmarket behavior.

His human-capital work formalizes how investments in education and training relate to earnings, while his household model treats time and purchased goods as inputs to domestic production.

The same research program analyzes crime incentives and the costs of discrimination, extending an optimizing framework into areas previously studied by other social sciences.

Sources and details

Gary S. Becker — economic sciences award press release

{
  "access_scope": "Royal Swedish Academy of Sciences award account dated 13 October 1992. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "press_release_date": "13 October 1992",
    "retrieved_utc": "2026-10-07T18:17:23.599328+00:00"
  },
  "id": "person-coverage-a695de8a6bdc20::S1",
  "title": "Gary S. Becker — economic sciences award press release",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1992/press-release/"
}

Royal Swedish Academy of Sciences award account dated 13 October 1992. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.

Royal Swedish Academy of Sciences award account dated 13 October 1992. Institutional description of historical contributions and theoretical frameworks, not a complete career audit, present-day consensus or advice. Individual claims here follow explicit attribution in the account; original source and identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ajay Agrawal

Ajay Agrawal coauthored Power and Prediction with Joshua Gans and Avi Goldfarb, framing AI through the economics of decisions.

The publisher’s description distinguishes machine prediction from human judgment and argues that cheaper prediction can change how decisions are organized.

It extends that argument to systems of interdependent decisions, where redesign can redistribute business profits and social control.

Sources and details

Power and Prediction: The Disruptive Economics of Artificial Intelligence

{
  "access_scope": "Publisher description of the jointly authored 2022 book; claims about disruption are the book’s economic argument, not observed universal outcomes or a personal division of labor.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "listed_publication": "November 15, 2022",
    "retrieved_utc": "2026-10-07T18:14:18.659265+00:00"
  },
  "id": "person-coverage-c4a0d530612de9::S1",
  "publisher": "Harvard Business Review Press",
  "title": "Power and Prediction: The Disruptive Economics of Artificial Intelligence",
  "url": "https://store.hbr.org/product/power-and-prediction-the-disruptive-economics-of-artificial-intelligence/10580"
}

Publisher description of the jointly authored 2022 book; claims about disruption are the book’s economic argument, not observed universal outcomes or a personal division of labor.

Publisher description of the jointly authored 2022 book; claims about disruption are the book’s economic argument, not observed universal outcomes or a personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Reben

Alexander Reben’s AI Am I? series develops artworks through repeated exchanges among prompts, generated descriptions, images and physical fabrication.

His portfolio describes selecting generated passages for realization while also using existing objects or artworks to prompt new descriptions.

The museum-style labels form another layer of the experiment, inventing intentions and identities that become part of the work rather than reliable biographies.

Sources and details

AI Am I? — Alexander Reben

{
  "access_scope": "Artist-hosted account of AI Am I? with AI systems and fabricators; generated label identities, dates and intentions are fictional artwork content, and fabrication is not credited exclusively to Reben.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:04.016820+00:00"
  },
  "id": "person-coverage-0e0e22e9997a4c::S1",
  "publisher": "Alexander Reben portfolio",
  "title": "AI Am I? — Alexander Reben",
  "url": "https://areben.com/series/ai-am-i/"
}

Artist-hosted account of AI Am I? with AI systems and fabricators; generated label identities, dates and intentions are fictional artwork content, and fabrication is not credited exclusively to Reben.

Artist-hosted account of AI Am I? with AI systems and fabricators; generated label identities, dates and intentions are fictional artwork content, and fabrication is not credited exclusively to Reben.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alfred D. Chandler Jr.

Alfred D. Chandler Jr.’s HBS colleagues describe his business history as an account of how large firms organize production, marketing and management.

Jeffrey Fear emphasizes Chandler’s investment framework and organizational capabilities, making internal learning and coordination central to the analysis.

Walter A. Friedman places Strategy and Structure, The Visible Hand and Scale and Scope within that research program, connecting company histories with broader arguments about business organization.

Sources and details

Remembering Alfred Chandler | Working Knowledge

{
  "access_scope": "Silverthorne’s memorial compiles named colleagues’ interpretations, including Fear and Friedman; its praise and intellectual influence claims are attributed recollections, not measured causation or sole founding priority.",
  "authors": [
    "Sean Silverthorne"
  ],
  "authors_in_source_order": [
    "Sean Silverthorne"
  ],
  "dates": {
    "published": "June 15, 2007",
    "retrieved_utc": "2026-10-07T18:02:42.876529+00:00"
  },
  "id": "person-alfreddchandlerjr::S1",
  "publisher": "Harvard Business School Working Knowledge",
  "title": "Remembering Alfred Chandler | Working Knowledge",
  "url": "https://www.library.hbs.edu/working-knowledge/remembering-alfred-chandler"
}

Silverthorne’s memorial compiles named colleagues’ interpretations, including Fear and Friedman; its praise and intellectual influence claims are attributed recollections, not measured causation or sole founding priority.

Silverthorne’s memorial compiles named colleagues’ interpretations, including Fear and Friedman; its praise and intellectual influence claims are attributed recollections, not measured causation or sole founding priority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alfred Lin

Alfred Lin’s Sequoia profile recounts moving from a statistics doctoral program into operating and investing in technology companies.

His first-person account follows work with Tony Hsieh at LinkExchange into Venture Frogs, Tellme Networks and Zappos.

He describes his investment approach through founder-market fit and a willingness to work for founders, presenting partnership as more than capital alone.

Sources and details

Alfred Lin | Sequoia Capital

{
  "access_scope": "Undated first-person backstory on Lin’s firm-hosted profile; investment philosophy and recalled career events are his account, not verified current holdings, returns or a guarantee of company success.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:30.349242+00:00"
  },
  "id": "person-coverage-dfab01a8e0ab59::S1",
  "publisher": "Sequoia Capital",
  "title": "Alfred Lin | Sequoia Capital",
  "url": "https://sequoiacap.com/people/alfred-lin"
}

Undated first-person backstory on Lin’s firm-hosted profile; investment philosophy and recalled career events are his account, not verified current holdings, returns or a guarantee of company success.

Undated first-person backstory on Lin’s firm-hosted profile; investment philosophy and recalled career events are his account, not verified current holdings, returns or a guarantee of company success.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alvy Ray Smith

Alvy Ray Smith’s technical history explains the alpha channel as opacity stored with image color, allowing a rendered foreground to be reused over different backgrounds.

He recalls developing image-file support with Ed Catmull at NYIT in 1977 so compositing could be separated from image synthesis.

The account distinguishes that integral-alpha work from Tom Porter and Tom Duff’s later premultiplied-alpha contribution, preserving separate stages in the method’s development.

Sources and details

Alvy First Academy Award

{
  "access_scope": "Smith’s dated first-person essay and reproduced shared Academy citation; Catmull collaboration and Porter–Duff premultiplication remain separate, and retrospective priority or industry-wide usage is not independently resolved.",
  "authors": [
    "Alvy Ray Smith"
  ],
  "authors_in_source_order": [
    "Alvy Ray Smith"
  ],
  "dates": {
    "award": "March 2, 1996",
    "retrieved_utc": "2026-10-07T17:55:48.890763+00:00",
    "technical_essay": "January 2, 1996"
  },
  "id": "person-coverage-b3e66d2a1256fa::S1",
  "publisher": "Alvy Ray Smith personal technical archive",
  "title": "Alvy First Academy Award",
  "url": "https://www.alvyray.com/Awards/AwardsAcademy96.htm"
}

Smith’s dated first-person essay and reproduced shared Academy citation; Catmull collaboration and Porter–Duff premultiplication remain separate, and retrospective priority or industry-wide usage is not independently resolved.

Smith’s dated first-person essay and reproduced shared Academy citation; Catmull collaboration and Porter–Duff premultiplication remain separate, and retrospective priority or industry-wide usage is not independently resolved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Serkis

Andy Serkis formed Imaginarium Studios in 2012, according to the studio’s account of its performance-led capture work.

His quoted aim connects technical production services with storytelling, while the studio describes capturing body and facial performance for digital characters.

Its service account joins capture with real-time visualization and rig testing, showing an organization built around the route from performed action to screen production.

Sources and details

Imaginarium Studios - Motion Capture Specialists | Performance Capture

{
  "access_scope": "Studio institutional account and named Serkis quotation; body/facial capture, visualization and rig services are organizational capabilities, not proof that Serkis personally designed the technology or performed every project.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Cinesite_partnership": "May 2023",
    "retrieved_utc": "2026-10-07T17:55:57.592818+00:00",
    "studio_formation": "2012"
  },
  "id": "person-coverage-451f67dbe81d1f::S1",
  "publisher": "Imaginarium Studios",
  "title": "Imaginarium Studios - Motion Capture Specialists | Performance Capture",
  "url": "https://www.imaginariumstudios.co.uk/"
}

Studio institutional account and named Serkis quotation; body/facial capture, visualization and rig services are organizational capabilities, not proof that Serkis personally designed the technology or performed every project.

Studio institutional account and named Serkis quotation; body/facial capture, visualization and rig services are organizational capabilities, not proof that Serkis personally designed the technology or performed every project.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anna Ridler

Anna Ridler’s Bloemenveiling, made with David Pfau in 2019, used auctions of generated tulip videos to examine speculation and artificial scarcity.

The artist-hosted account describes Ethereum contracts and bidding bots as part of a functioning artwork, making the marketplace itself an object of criticism.

Its week-long video blooms and conditional token destruction introduced decay into digital ownership, exposing the tension between viewing an artwork and preserving its tradable token.

Sources and details

Bloemenveiling (2019) | Anna Ridler

{
  "access_scope": "Artist-hosted account of the jointly made Bloemenveiling; Pfau collaboration retained, smart-contract behavior is project-specific, and historical Ethereum energy estimates are not adopted as current network facts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "archive_boxes": "2023",
    "project": "2019",
    "retrieved_utc": "2026-10-07T17:55:28.093395+00:00"
  },
  "id": "person-coverage-74007a3b165065::S1",
  "publisher": "Anna Ridler portfolio",
  "title": "Bloemenveiling (2019) | Anna Ridler",
  "url": "https://annaridler.com/works/bloemen"
}

Artist-hosted account of the jointly made Bloemenveiling; Pfau collaboration retained, smart-contract behavior is project-specific, and historical Ethereum energy estimates are not adopted as current network facts.

Artist-hosted account of the jointly made Bloemenveiling; Pfau collaboration retained, smart-contract behavior is project-specific, and historical Ethereum energy estimates are not adopted as current network facts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kenneth R. Andrews

Kenneth R. Andrews used research on the Swiss watch industry to rethink business policy, according to Harvard Business School’s case-method history.

The account connects those cases with a corporate-strategy framework that considers goals, policies, organization and values together.

It places that development within teaching and collaboration with C. Roland Christensen and others, linking research cases with the evolution of the curriculum.

Sources and details

Impact on Research & Curriculum | Baker Library

{
  "access_scope": "Institutional exhibition account and attributed Bower quotation; Andrews’s documented case work and framework are not sole credit for the entire field of strategy, and linked archival documents were not independently inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Swiss_study_report": "1959",
    "listed_book": "1971",
    "retrieved_utc": "2026-10-07T18:21:16.703011+00:00"
  },
  "id": "person-kennethrandrews::S1",
  "publisher": "Harvard Business School Baker Library exhibition",
  "title": "Impact on Research & Curriculum | Baker Library",
  "url": "https://www.library.hbs.edu/special-collections-and-archives/exhibits/case-method/impact-on-research-and-curriculum"
}

Institutional exhibition account and attributed Bower quotation; Andrews’s documented case work and framework are not sole credit for the entire field of strategy, and linked archival documents were not independently inspected.

Institutional exhibition account and attributed Bower quotation; Andrews’s documented case work and framework are not sole credit for the entire field of strategy, and linked archival documents were not independently inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vera Molnár

Vera Molnár’s Biennale profile traces her computer drawing practice to earlier compositions governed by repeated geometric shapes and predetermined rules.

Stefano Mudu distinguishes the imagined rule-following machines from algorithms that became mechanically executed in 1968.

His account describes Computer Drawings as varied outputs of specified parameters, placing human choices and machine execution in an ongoing artistic dialogue.

Sources and details

Biennale Arte 2022 | Vera Molnár

{
  "access_scope": "Mudu’s 2022 exhibition interpretation distinguishes rule-based pre-computer work from later mechanical algorithms; the human–machine dialogue is curatorial language, not evidence of machine sensitivity or consciousness.",
  "authors": [
    "Stefano Mudu"
  ],
  "authors_in_source_order": [
    "Stefano Mudu"
  ],
  "dates": {
    "exhibition": "2022",
    "mechanical_algorithms": "1968",
    "retrieved_utc": "2026-10-07T17:56:01.386308+00:00",
    "series": "c. 1970–1975"
  },
  "id": "person-coverage-de9e468c36d509::S1",
  "publisher": "La Biennale di Venezia",
  "title": "Biennale Arte 2022 | Vera Molnár",
  "url": "https://www.labiennale.org/en/art/2022/milk-dreams/vera-moln%C3%A1r"
}

Mudu’s 2022 exhibition interpretation distinguishes rule-based pre-computer work from later mechanical algorithms; the human–machine dialogue is curatorial language, not evidence of machine sensitivity or consciousness.

Mudu’s 2022 exhibition interpretation distinguishes rule-based pre-computer work from later mechanical algorithms; the human–machine dialogue is curatorial language, not evidence of machine sensitivity or consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

W. Ross Ashby

W. Ross Ashby’s family archive introduces his cybernetics work through the Law of Requisite Variety, the Homeostat and his two major books.

The archive describes his journal as roughly 7,400 pages across 25 volumes with 1,600 index cards, preserving a much larger working record than the published books alone.

Its online cross-links follow keywords from his original index, turning that record into material readers can navigate by topic.

Sources and details

The W. Ross Ashby Digital Archive

{
  "access_scope": "Family-archive introductory account explicitly joins W. Ross Ashby with William Ross Ashby; journal scale and digitization are historical descriptions, not verification of every manuscript claim or a current completeness audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Design_for_a_Brain": "1952",
    "Introduction_to_Cybernetics": "1956",
    "archive_transfer": "January 2003",
    "online_account": "2008",
    "retrieved_utc": "2026-10-07T18:22:40.929907+00:00"
  },
  "id": "person-wrossashby::S1",
  "publisher": "W. Ross Ashby Digital Archive",
  "title": "The W. Ross Ashby Digital Archive",
  "url": "https://www.ashby.info/"
}

Family-archive introductory account explicitly joins W. Ross Ashby with William Ross Ashby; journal scale and digitization are historical descriptions, not verification of every manuscript claim or a current completeness audit.

Family-archive introductory account explicitly joins W. Ross Ashby with William Ross Ashby; journal scale and digitization are historical descriptions, not verification of every manuscript claim or a current completeness audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ali Ghodsi

Ali Ghodsi’s Databricks summit biography links his distributed-computing research with engineering leadership at the company.

It names him among Apache Spark’s creators and says ideas from his resource-management, scheduling and caching research were applied to Mesos and Hadoop.

The profile follows his engineering and product-management role into the CEO position in January 2016, connecting research experience with company operations.

Sources and details

Ali Ghodsi | Databricks

{
  "access_scope": "Dated event profile supports named research areas and collective creator credit; it does not identify individual code ownership or independently verify current executive or academic appointments.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "CEO_transition": "January 2016",
    "profile_event": "Data + AI Summit 2026",
    "retrieved_utc": "2026-10-07T17:55:52.474271+00:00"
  },
  "id": "person-alighodsi::S1",
  "publisher": "Databricks Data + AI Summit",
  "title": "Ali Ghodsi | Databricks",
  "url": "https://www.databricks.com/dataaisummit/speaker/ali-ghodsi"
}

Dated event profile supports named research areas and collective creator credit; it does not identify individual code ownership or independently verify current executive or academic appointments.

Dated event profile supports named research areas and collective creator credit; it does not identify individual code ownership or independently verify current executive or academic appointments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brent Spiner

Brent Spiner’s official Star Trek profile follows his stage career into a 15-year run as Data, from Encounter at Farpoint through Nemesis.

It also credits him with helping develop the story for Nemesis, distinguishing that shared writing role from directing episodes.

His quoted discussion of playing himself treats those appearances as constructed characters with different dramatic parameters, adding a performance perspective beyond a cast list.

Sources and details

6 Things You Should Know About Brent Spiner

{
  "access_scope": "Official 2020 profile and quoted 2011 interview; Data is a fictional android, the Nemesis story credit is shared, and the page does not demonstrate personal design of AI technology or current filmography.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "published": "Feb 2, 2020",
    "quoted_interview": "2011",
    "retrieved_utc": "2026-10-07T17:55:25.493264+00:00"
  },
  "id": "person-coverage-0e139c98ce8b84::S1",
  "publisher": "StarTrek.com",
  "title": "6 Things You Should Know About Brent Spiner",
  "url": "https://www.startrek.com/news/6-things-you-should-know-about-brent-spiner"
}

Official 2020 profile and quoted 2011 interview; Data is a fictional android, the Nemesis story credit is shared, and the page does not demonstrate personal design of AI technology or current filmography.

Official 2020 profile and quoted 2011 interview; Data is a fictional android, the Nemesis story credit is shared, and the page does not demonstrate personal design of AI technology or current filmography.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Annalee Newitz

Annalee Newitz’s Autonomous imagines a 2144 world where ownership of drugs, information and people puts freedom under pressure.

The publisher’s account follows a drug pirate whose copied productivity treatment causes compulsive work, pursued by an agent and his robot partner.

The opening excerpt connects that pursuit with the pirate’s effort to fund access to other medicines, making scientific responsibility and commodification part of the novel’s conflict.

Sources and details

Autonomous

{
  "access_scope": "Publisher description and original novel excerpt; fictional drugs, addiction mechanisms and robot relationships are narrative premises, not medical evidence. Newitz is the author and Jennifer Ikeda the audio narrator.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "audio_on_sale": "09/19/2017",
    "excerpt_copyright": "2017",
    "retrieved_utc": "2026-10-07T18:18:10.873500+00:00"
  },
  "id": "person-coverage-c554edc33be855::S1",
  "publisher": "Macmillan Audio",
  "title": "Autonomous",
  "url": "https://us.macmillan.com/books/9781427290731/autonomous/"
}

Publisher description and original novel excerpt; fictional drugs, addiction mechanisms and robot relationships are narrative premises, not medical evidence. Newitz is the author and Jennifer Ikeda the audio narrator.

Publisher description and original novel excerpt; fictional drugs, addiction mechanisms and robot relationships are narrative premises, not medical evidence. Newitz is the author and Jennifer Ikeda the audio narrator.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arthur C. Clarke

Arthur C. Clarke’s 2001: A Space Odyssey follows the Discovery crew toward Saturn under the control of HAL 9000.

The publisher presents the novel as an allegory of exploration that tests human power against technological capability and an intelligent computer’s threat.

Its author biography also recalls Clarke’s 1945 proposal for geostationary communications, placing speculative fiction beside his writing about possible real technologies.

Sources and details

2001: a Space Odyssey by Arthur C. Clarke: 9780451452733 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher’s novel description and author biography; Saturn is this novel’s destination and HAL its fictional computer. The listed 1993 paperback is distinguished from first publication and the film adaptation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "listed_paperback": "Aug 01, 1993",
    "retrieved_utc": "2026-10-07T18:02:48.086803+00:00",
    "satellite_proposal": "1945"
  },
  "id": "person-arthurcclarke::S1",
  "publisher": "Penguin Random House / Ace",
  "title": "2001: a Space Odyssey by Arthur C. Clarke: 9780451452733 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/325356/2001-a-space-odyssey-by-arthur-c-clarke/"
}

Publisher’s novel description and author biography; Saturn is this novel’s destination and HAL its fictional computer. The listed 1993 paperback is distinguished from first publication and the film adaptation.

Publisher’s novel description and author biography; Saturn is this novel’s destination and HAL its fictional computer. The listed 1993 paperback is distinguished from first publication and the film adaptation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brett Adcock

Brett Adcock’s 2022 Figure master plan argues for general-purpose humanoids that operate in environments already built for people.

His proposal starts with structured industrial tasks and identifies hardware capability, unit cost, safety and manufacturing volume as connected engineering constraints.

It treats autonomous action in less structured settings as a difficult longer-term AI problem, separating the planned route from capabilities already achieved.

Sources and details

Master Plan | Figure

{
  "access_scope": "Founder-authored 2022 roadmap; proposed humanoid capabilities, cost reductions and social benefits are ambitions, not delivered outcomes or an assignment of all engineering work to Adcock.",
  "authors": [
    "Brett Adcock"
  ],
  "authors_in_source_order": [
    "Brett Adcock"
  ],
  "dates": {
    "published": "May 20, 2022",
    "retrieved_utc": "2026-10-07T17:58:16.228919+00:00"
  },
  "id": "person-coverage-5784098d31b489::S1",
  "publisher": "Figure",
  "title": "Master Plan | Figure",
  "url": "https://www.figure.ai/master-plan"
}

Founder-authored 2022 roadmap; proposed humanoid capabilities, cost reductions and social benefits are ambitions, not delivered outcomes or an assignment of all engineering work to Adcock.

Founder-authored 2022 roadmap; proposed humanoid capabilities, cost reductions and social benefits are ambitions, not delivered outcomes or an assignment of all engineering work to Adcock.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David P. Norton

David P. Norton is credited with Robert S. Kaplan in HBS’s account of using the Balanced Scorecard to communicate strategy across an organization.

The excerpt describes financial, customer, internal-process, and learning-and-growth measures as a way to make strategic priorities explicit.

It connects those measures with strategy maps that express relationships among objectives, then extends the approach to employees and external partners.

Sources and details

Partnering and the Balanced Scorecard | Working Knowledge

{
  "access_scope": "HBS page byline is Kaplan, while its introduction credits the underlying work jointly to Kaplan and Norton. Strategy-map causal links are proposed hypotheses; illustrative improvements do not establish general effectiveness or Norton’s individual division of labor.",
  "authors": [
    "Robert S. Kaplan"
  ],
  "authors_in_source_order": [
    "Robert S. Kaplan"
  ],
  "dates": {
    "BSC_introduction": "1992",
    "published": "December 23, 2002",
    "retrieved_utc": "2026-10-07T18:12:17.917074+00:00"
  },
  "id": "person-coverage-169c1d69312b04::S1",
  "publisher": "Harvard Business School Working Knowledge",
  "title": "Partnering and the Balanced Scorecard | Working Knowledge",
  "url": "https://www.library.hbs.edu/working-knowledge/partnering-and-the-balanced-scorecard"
}

HBS page byline is Kaplan, while its introduction credits the underlying work jointly to Kaplan and Norton. Strategy-map causal links are proposed hypotheses; illustrative improvements do not establish general effectiveness or Norton’s individual division of labor.

HBS page byline is Kaplan, while its introduction credits the underlying work jointly to Kaplan and Norton. Strategy-map causal links are proposed hypotheses; illustrative improvements do not establish general effectiveness or Norton’s individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Abraham Newman

Abraham Newman coauthored Underground Empire with Henry Farrell, examining the infrastructure beneath global economic power.

The publisher’s opening excerpt follows Walter Wriston’s belief that mobile finance and information would loosen state control, then recounts how banks built cross-border networks.

By tracing container finance, offshore dollar transactions and payment systems, the chapter treats apparently technical infrastructure as politically consequential.

Sources and details

Underground Empire

{
  "access_scope": "Jointly authored historical book excerpt, with its claims attributed to Farrell and Newman; the selected chapter’s account of Wriston and network-building is not an individual research-task allocation or verified current financial advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:50.192781+00:00"
  },
  "id": "person-coverage-9a317af7bc5e45::S1",
  "publisher": "Macmillan publisher excerpt",
  "title": "Underground Empire",
  "url": "https://us.macmillan.com/books/9781250840554/undergroundempire/"
}

Jointly authored historical book excerpt, with its claims attributed to Farrell and Newman; the selected chapter’s account of Wriston and network-building is not an individual research-task allocation or verified current financial advice.

Jointly authored historical book excerpt, with its claims attributed to Farrell and Newman; the selected chapter’s account of Wriston and network-building is not an individual research-task allocation or verified current financial advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ahmed Yahia Al Idrissi

Ahmed Yahia Al Idrissi, identified as MGX’s CEO in a 2024 partnership announcement, connects AI adoption with the construction of data centers and power sources.

His quoted argument compares that infrastructure with transport networks as an enabling foundation for growth and commerce.

The announcement places that view within a joint investment plan by MGX, BlackRock, GIP and Microsoft, treating capital and energy supply as complements to computing capacity.

Sources and details

New AI partnership | BlackRock

{
  "access_scope": "Dated joint-partnership press release and Al Idrissi quotation; fundraising targets and productivity benefits are announced intentions, not realized investment totals, and partnership activity is not credited to him alone.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_publication": "Sep 18, 2024",
    "release_dateline": "September 17, 2024",
    "retrieved_utc": "2026-10-07T18:12:15.107997+00:00"
  },
  "id": "person-coverage-de728575bd3a4c::S1",
  "publisher": "BlackRock newsroom",
  "title": "New AI partnership | BlackRock",
  "url": "https://www.blackrock.com/corporate/newsroom/media/press-releases/blackrock-global-infrastructure-partners-microsoft-and-mgx-launch-new-ai"
}

Dated joint-partnership press release and Al Idrissi quotation; fundraising targets and productivity benefits are announced intentions, not realized investment totals, and partnership activity is not credited to him alone.

Dated joint-partnership press release and Al Idrissi quotation; fundraising targets and productivity benefits are announced intentions, not realized investment totals, and partnership activity is not credited to him alone.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sundar Pichai

Sundar Pichai’s 2016 Google letter presents search and assistance as responses to increasingly mobile and context-dependent information needs.

His examples connect machine learning with voice search, translation, spam filtering and retrieval of photographs by their content.

He then frames assistance that understands a person’s situation as a direction for future services, linking existing product uses with a broader development ambition.

Sources and details

This year’s Founders' Letter

{
  "access_scope": "Pichai-authored 2016 letter with a separately credited Larry Page introduction; product examples and future assistance vision are historical company accounts, not present-day usage data or personal invention claims.",
  "authors": [
    "Sundar Pichai"
  ],
  "authors_in_source_order": [
    "Sundar Pichai"
  ],
  "dates": {
    "published": "Apr 28, 2016",
    "retrieved_utc": "2026-10-07T18:19:09.078699+00:00"
  },
  "id": "person-coverage-fd7e38ea7d426e::S1",
  "publisher": "Google official blog",
  "title": "This year’s Founders' Letter",
  "url": "https://blog.google/alphabet/this-years-founders-letter/"
}

Pichai-authored 2016 letter with a separately credited Larry Page introduction; product examples and future assistance vision are historical company accounts, not present-day usage data or personal invention claims.

Pichai-authored 2016 letter with a separately credited Larry Page introduction; product examples and future assistance vision are historical company accounts, not present-day usage data or personal invention claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Travis Beals

Travis Beals’s Google Research account presents Project Suncatcher as a proposed constellation of solar-powered satellites carrying TPUs and optical interconnects.

The research description links close satellite spacing with bandwidth demands and uses orbital models to study how such a formation might remain stable.

Its bench-scale communication result and radiation tests address pieces of the engineering problem while leaving an operating space-based compute system as a future goal.

Sources and details

Exploring a space-based, scalable AI infrastructure system design

{
  "access_scope": "Beals’s named research-blog account of a preprint and proposal; bench tests and modeled constellations are distinct from an operational orbital data center. Paper authors and acknowledged contributors retain separate roles.",
  "authors": [
    "Travis Beals"
  ],
  "authors_in_source_order": [
    "Travis Beals"
  ],
  "dates": {
    "published": "November 4, 2025",
    "retrieved_utc": "2026-10-07T18:17:15.165448+00:00"
  },
  "id": "person-coverage-aac270be4087b1::S1",
  "publisher": "Google Research",
  "title": "Exploring a space-based, scalable AI infrastructure system design",
  "url": "https://research.google/blog/exploring-a-space-based-scalable-ai-infrastructure-system-design/"
}

Beals’s named research-blog account of a preprint and proposal; bench tests and modeled constellations are distinct from an operational orbital data center. Paper authors and acknowledged contributors retain separate roles.

Beals’s named research-blog account of a preprint and proposal; bench tests and modeled constellations are distinct from an operational orbital data center. Paper authors and acknowledged contributors retain separate roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alvin E. Roth

In his Nobel biography, Alvin E. Roth recounts tracing the medical-residency matching process to an algorithm equivalent to Gale and Shapley’s deferred acceptance procedure.

He distinguishes stable matching from incentives, explaining why truthful preferences can be a dominant strategy for applicants without making truthful reporting safe for both sides in every case.

The account follows his later collaboration on New York school admissions, with Parag Pathak and Atila Abdulkadiroğlu adapting the clearinghouse and Neil Dorosin implementing the institutional changes.

Sources and details

Alvin E. Roth – Biographical - NobelPrize.org

{
  "access_scope": "First-person Nobel biography; algorithmic findings and implementation roles attributed precisely, not clinical guidance.",
  "authors": [
    "Alvin E. Roth"
  ],
  "authors_in_source_order": [
    "Alvin E. Roth"
  ],
  "dates": {
    "authored_context": "early 2013, stated in narrative",
    "retrieved_utc": "2026-10-07T18:16:23.656746+00:00"
  },
  "id": "person-coverage-7b43d9d8a69467::S1",
  "title": "Alvin E. Roth – Biographical - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2012/roth/biographical/"
}

First-person Nobel biography; algorithmic findings and implementation roles attributed precisely, not clinical guidance.

First-person Nobel biography; algorithmic findings and implementation roles attributed precisely, not clinical guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ariel Ezrachi

Oxford’s profile describes Ariel Ezrachi’s research on competition law in the digital economy, including e-commerce, buyer power, and algorithmic collusion.

It identifies his co-authored Digital Platforms report and an expert report on digitalization and innovation as distinct policy-facing work.

The biography also records his leadership of a Leverhulme-funded project on competition policy and economic inequality from 2020 to 2024.

Sources and details

Ariel Ezrachi | Faculty of Law

{
  "access_scope": "Oxford faculty biography; research themes and explicitly stated project leadership, no findings inferred from paper titles or legal advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:35.613680+00:00"
  },
  "id": "person-coverage-3da125f2559f29::S1",
  "title": "Ariel Ezrachi | Faculty of Law",
  "url": "https://www.law.ox.ac.uk/people/ariel-ezrachi"
}

Oxford faculty biography; research themes and explicitly stated project leadership, no findings inferred from paper titles or legal advice.

Oxford faculty biography; research themes and explicitly stated project leadership, no findings inferred from paper titles or legal advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carl Shapiro

Carl Shapiro’s Berkeley profile connects his industrial-organization research to competition policy, patents, innovation, and competitive strategy.

It identifies Information Rules, co-authored with Hal R. Varian, as applying economic principles to the information economy.

The account records separate public-service periods at the Justice Department’s Antitrust Division and the President’s Council of Economic Advisers, rather than treating those appointments as research findings.

Sources and details

Professor Carl Shapiro, UC Berkeley

{
  "access_scope": "Institutional faculty profile without an explicit writer; stated research themes and historical service, not present policy advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:05.788457+00:00"
  },
  "id": "person-local-carlshapiro::S1",
  "title": "Professor Carl Shapiro, UC Berkeley",
  "url": "https://faculty.haas.berkeley.edu/shapiro/"
}

Institutional faculty profile without an explicit writer; stated research themes and historical service, not present policy advice.

Institutional faculty profile without an explicit writer; stated research themes and historical service, not present policy advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Mindell

MIT’s Work of the Future introduction identifies David Mindell as a report coauthor and co-chair of the task force commissioned in 2018.

The shared account contrasts repeated automation forecasts with the slower work of trials, deployments, and adaptation in actual workplaces.

It argues that technological progress and rising productivity need institutions that distribute opportunities and support workers affected by changing tasks.

Sources and details

The Work of the Future: Building Better Jobs in an Age of Intelligent Machines - MIT Work of the Future

{
  "access_scope": "Shared report introduction; no individual drafting or division of research labor inferred.",
  "authors": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "authors_in_source_order": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "dates": {
    "page_modified": "2021-03-16",
    "page_published": "2020-11-17",
    "retrieved_utc": "2026-10-07T18:16:08.588675+00:00"
  },
  "id": "person-coverage-7fcd91eaccbd5d::S1",
  "title": "The Work of the Future: Building Better Jobs in an Age of Intelligent Machines - MIT Work of the Future",
  "url": "https://workofthefuture-taskforce.mit.edu/research-post/the-work-of-the-future-building-better-jobs-in-an-age-of-intelligent-machines/"
}

Shared report introduction; no individual drafting or division of research labor inferred.

Shared report introduction; no individual drafting or division of research labor inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elisabeth Reynolds

MIT’s Work of the Future introduction identifies Elisabeth Reynolds as executive director, report coauthor, and co-chair of the task force.

The report examines the divergence between productivity and wages and emphasizes that unequal outcomes are not an unavoidable result of technological change.

It presents labor-market institutions as part of the response to automation, innovation, and new work creation, preserving the report’s collective authorship.

Sources and details

The Work of the Future: Building Better Jobs in an Age of Intelligent Machines - MIT Work of the Future

{
  "access_scope": "Shared report introduction; contribution is explicit coauthorship and institutional role, not a personal causal claim for every conclusion.",
  "authors": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "authors_in_source_order": [
    "David Autor",
    "David Mindell",
    "Elisabeth Reynolds"
  ],
  "dates": {
    "page_modified": "2021-03-16",
    "page_published": "2020-11-17",
    "retrieved_utc": "2026-10-07T18:16:08.588675+00:00"
  },
  "id": "person-coverage-e8781d86ee4b68::S1",
  "title": "The Work of the Future: Building Better Jobs in an Age of Intelligent Machines - MIT Work of the Future",
  "url": "https://workofthefuture-taskforce.mit.edu/research-post/the-work-of-the-future-building-better-jobs-in-an-age-of-intelligent-machines/"
}

Shared report introduction; contribution is explicit coauthorship and institutional role, not a personal causal claim for every conclusion.

Shared report introduction; contribution is explicit coauthorship and institutional role, not a personal causal claim for every conclusion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hans Moravec

Hans Moravec’s May 1998 preface describes how work on a seeing mobile robot led him to regard computation as a major bottleneck for perception.

He contrasts the cost of processing individual images and stereoscopic matches on 1970s computers with the speed of human vision.

The account revisits his earlier forecasts and acknowledges the absence of the mobile utility robots he had expected, treating subsequent schedules as revised predictions.

Sources and details

Peek at 1998 Moravec book - Preface

{
  "access_scope": "Dated first-person preface; historical observations and forecasts distinguished from completed later capabilities.",
  "authors": [
    "Hans Moravec"
  ],
  "authors_in_source_order": [
    "Hans Moravec"
  ],
  "dates": {
    "preface_date": "1998-05",
    "retrieved_utc": "2026-10-07T18:19:46.903671+00:00"
  },
  "id": "person-hansmoravec::S1",
  "title": "Peek at 1998 Moravec book - Preface",
  "url": "https://frc.ri.cmu.edu/~hpm/book97/0..Preface.html"
}

Dated first-person preface; historical observations and forecasts distinguished from completed later capabilities.

Dated first-person preface; historical observations and forecasts distinguished from completed later capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nafea Bshara

Stanford’s January 2026 seminar biography describes Nafea Bshara’s work on AWS custom hardware spanning Nitro, Graviton, Trainium, and the Neuron SDK.

It traces his earlier software and chip-design work at Galileo and Marvell to co-founding Annapurna Labs in 2011.

The account connects Amazon’s February 2015 acquisition of Annapurna to his team’s subsequent datacenter-silicon work, retaining the team rather than assigning every chip to him individually.

Sources and details

The evolution of ML accelerator chips’ and servers’ designs from general purpose to task optimized | SystemX Alliance

{
  "access_scope": "Seminar speaker biography as of the dated event; no performance claim inferred from the talk title or hardware list.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "event_date": "2026-01-22",
    "retrieved_utc": "2026-10-07T18:16:48.325028+00:00"
  },
  "id": "person-coverage-928cb0d3188b24::S1",
  "title": "The evolution of ML accelerator chips’ and servers’ designs from general purpose to task optimized | SystemX Alliance",
  "url": "https://systemx.stanford.edu/events/seminars/evolution-ml-accelerator-chips-and-servers-designs-general-purpose-task-optimized"
}

Seminar speaker biography as of the dated event; no performance claim inferred from the talk title or hardware list.

Seminar speaker biography as of the dated event; no performance claim inferred from the talk title or hardware list.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alfred Tarski

Wilfrid Hodges’s Stanford Encyclopedia account describes Alfred Tarski’s 1933 project as specifying adequate definitions of truth for formal languages.

It explains the separation between the object language being discussed and a metalanguage that can describe its sentences and syntax.

The entry distinguishes those fully interpreted languages from the model-theoretic definition Tarski and Robert Vaught revised in 1956.

Sources and details

Tarski’s Truth Definitions (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "SEP technical commentary at inspected 2022 revision; Tarski is subject, Hodges is writer, no natural-language semantic result inferred.",
  "authors": [
    "Wilfrid Hodges"
  ],
  "authors_in_source_order": [
    "Wilfrid Hodges"
  ],
  "dates": {
    "citation_publication_date": "2001/11/10",
    "first_published": "2001-11-10",
    "retrieved_utc": "2026-10-07T18:02:14.653606+00:00",
    "substantive_revision": "2022-09-21"
  },
  "id": "person-alfredtarski::S1",
  "title": "Tarski’s Truth Definitions (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/tarski-truth/"
}

SEP technical commentary at inspected 2022 revision; Tarski is subject, Hodges is writer, no natural-language semantic result inferred.

SEP technical commentary at inspected 2022 revision; Tarski is subject, Hodges is writer, no natural-language semantic result inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Boole

The Stanford Encyclopedia account by Stanley Burris and Marcel Jackson describes George Boole’s use of symbolic algebra to analyze logical arguments.

It contrasts that general algebraic approach with cataloguing valid syllogisms in traditional logic.

The historical account places the resulting methods in The Mathematical Analysis of Logic in 1847 and The Laws of Thought in 1854.

Sources and details

George Boole (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "SEP historical account at inspected 2026 revision; Boole is subject, writers credited separately, no later computing invention assigned.",
  "authors": [
    "Stanley Burris",
    "Marcel Jackson"
  ],
  "authors_in_source_order": [
    "Stanley Burris",
    "Marcel Jackson"
  ],
  "dates": {
    "citation_publication_date": "2010/04/21",
    "first_published": "2010-04-21",
    "retrieved_utc": "2026-10-07T18:19:19.189908+00:00",
    "substantive_revision": "2026-03-01"
  },
  "id": "person-georgeboole::S1",
  "title": "George Boole (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/boole/"
}

SEP historical account at inspected 2026 revision; Boole is subject, writers credited separately, no later computing invention assigned.

SEP historical account at inspected 2026 revision; Boole is subject, writers credited separately, no later computing invention assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gottfried Wilhelm Leibniz

Volker Peckhaus’s Stanford Encyclopedia account examines whether Gottfried Wilhelm Leibniz’s logical calculi directly influenced later formal logic or anticipated it independently.

It describes nineteenth-century editions of Leibniz’s writings, especially Erdmann’s 1839–1840 collection, as channels for renewed reception.

The account emphasizes that much of the most significant logical material appeared only in the early twentieth century, limiting simple claims about direct historical influence.

Sources and details

Leibniz’s Influence on 19th Century Logic (Stanford Encyclopedia of Philosophy/Summer 2025 Edition)

{
  "access_scope": "Fixed Summer 2025 SEP archive preserving February 2024 revision; dedicated Leibniz account, disputed influence explicitly retained.",
  "authors": [
    "Volker Peckhaus"
  ],
  "authors_in_source_order": [
    "Volker Peckhaus"
  ],
  "dates": {
    "archive_edition": "Summer 2025",
    "first_published": "2009-09-04",
    "retrieved_utc": "2026-10-07T18:19:19.136543+00:00",
    "substantive_revision": "2024-02-02"
  },
  "id": "person-gottfriedwilhelmleibniz::S1",
  "title": "Leibniz’s Influence on 19th Century Logic (Stanford Encyclopedia of Philosophy/Summer 2025 Edition)",
  "url": "https://plato.stanford.edu/archives/sum2025/entries/leibniz-logic-influence/"
}

Fixed Summer 2025 SEP archive preserving February 2024 revision; dedicated Leibniz account, disputed influence explicitly retained.

Fixed Summer 2025 SEP archive preserving February 2024 revision; dedicated Leibniz account, disputed influence explicitly retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gottlob Frege

Edward N. Zalta’s Stanford Encyclopedia account describes Gottlob Frege’s formal treatment of quantified statements and logical proof.

It connects that system to attempts to express mathematical claims using simpler logical and mathematical notions.

The entry also preserves the failure of Frege’s larger reduction of mathematics to logic after an added axiom proved inconsistent.

Sources and details

Gottlob Frege (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "SEP historical and technical account at inspected 2026 revision; Frege is subject, Zalta is writer, success and inconsistency kept distinct.",
  "authors": [
    "Edward N. Zalta"
  ],
  "authors_in_source_order": [
    "Edward N. Zalta"
  ],
  "dates": {
    "citation_publication_date": "1995/09/14",
    "first_published": "1995-09-14",
    "retrieved_utc": "2026-10-07T18:19:19.424711+00:00",
    "substantive_revision": "2026-08-01"
  },
  "id": "person-gottlobfrege::S1",
  "title": "Gottlob Frege (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/frege/"
}

SEP historical and technical account at inspected 2026 revision; Frege is subject, Zalta is writer, success and inconsistency kept distinct.

SEP historical and technical account at inspected 2026 revision; Frege is subject, Zalta is writer, success and inconsistency kept distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Mitchell

Tom Mitchell’s CMU page presents his 1997 textbook Machine Learning as an introduction to algorithms that improve through experience.

It gives data mining and information filtering that learns users’ interests as examples of the field’s applications.

The described course of study spans decision trees, neural networks, Bayesian methods, hypothesis evaluation, and reinforcement learning for advanced students and practitioners.

Sources and details

Machine Learning textbook

{
  "access_scope": "Author-hosted book description and chapter outline; Tom Mitchell explicitly named as book author, webpage writer not independently bylined.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "book_year": "1997",
    "retrieved_utc": "2026-10-07T18:18:57.198635+00:00"
  },
  "id": "person-coverage-f51dbabd53e8d4::S1",
  "title": "Machine Learning textbook",
  "url": "https://www.cs.cmu.edu/~tom/book.html"
}

Author-hosted book description and chapter outline; Tom Mitchell explicitly named as book author, webpage writer not independently bylined.

Author-hosted book description and chapter outline; Tom Mitchell explicitly named as book author, webpage writer not independently bylined.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglass C. North

Douglass C. North’s December 9, 1993 Nobel lecture presents institutions and time as central to explaining economic change.

It retains scarcity and competition from neoclassical analysis while modifying its rationality assumption and incorporating cumulative learning.

The lecture defines institutions through formal rules, informal norms, and enforcement, connecting those constraints to incentives and transaction costs.

Sources and details

Douglass C. North – Prize Lecture* - NobelPrize.org

{
  "access_scope": "Authored Nobel lecture; North’s analytical framework and claims, not a complete predictive model or economic advice.",
  "authors": [
    "Douglass C. North"
  ],
  "authors_in_source_order": [
    "Douglass C. North"
  ],
  "dates": {
    "lecture_date": "1993-12-09",
    "retrieved_utc": "2026-10-07T18:19:28.722678+00:00"
  },
  "id": "person-douglasscnorth::S1",
  "title": "Douglass C. North – Prize Lecture* - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1993/north/lecture/"
}

Authored Nobel lecture; North’s analytical framework and claims, not a complete predictive model or economic advice.

Authored Nobel lecture; North’s analytical framework and claims, not a complete predictive model or economic advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John McCarthy

In his October 2006 recollection, John McCarthy connects the Dartmouth workshop proposal to an attempt to focus research on intelligent computer behavior.

He describes his proposal of Lisp in 1958 as a response to limitations of the Fortran List Processing Language, including its lack of recursion.

The account also sets out his later interest in extending logic for common-sense reasoning, while acknowledging that the workshop did not achieve his hoped-for human-level breakthrough.

Sources and details

The Dartmouth Workshop--as planned and as it happened

{
  "access_scope": "Dated participant recollection, explicitly incomplete; historical plans and retrospective research views, not present-day capability assessment.",
  "authors": [
    "John McCarthy"
  ],
  "authors_in_source_order": [
    "John McCarthy"
  ],
  "dates": {
    "page_date": "2006-10-30",
    "retrieved_utc": "2026-10-07T18:02:27.411494+00:00"
  },
  "id": "person-johnmccarthy::S1",
  "title": "The Dartmouth Workshop--as planned and as it happened",
  "url": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html"
}

Dated participant recollection, explicitly incomplete; historical plans and retrospective research views, not present-day capability assessment.

Dated participant recollection, explicitly incomplete; historical plans and retrospective research views, not present-day capability assessment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marvin Minsky

John McCarthy’s Dartmouth recollection describes Marvin Minsky’s early work with Dean Edmunds on a simple neural-network learning machine in 1950.

It records Minsky’s 1954 thesis criterion for a neuron to act as a universal computing element.

The account also describes his workshop proposal to reduce geometry-proof search by testing only statements true in a diagram, distinguishing that proposal from Gelernter’s subsequent implementation work.

Sources and details

The Dartmouth Workshop--as planned and as it happened

{
  "access_scope": "Named-subject commentary by another participant; Minsky’s explicitly described work, no thesis or prover authorship transferred from collaborators.",
  "authors": [
    "John McCarthy"
  ],
  "authors_in_source_order": [
    "John McCarthy"
  ],
  "dates": {
    "page_date": "2006-10-30",
    "retrieved_utc": "2026-10-07T18:02:27.411494+00:00"
  },
  "id": "person-marvinminsky::S1",
  "title": "The Dartmouth Workshop--as planned and as it happened",
  "url": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html"
}

Named-subject commentary by another participant; Minsky’s explicitly described work, no thesis or prover authorship transferred from collaborators.

Named-subject commentary by another participant; Minsky’s explicitly described work, no thesis or prover authorship transferred from collaborators.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nathaniel Rochester

John McCarthy’s Dartmouth recollection identifies Nathaniel Rochester as the IBM 701 designer and host of McCarthy’s 1955 visit to IBM.

It describes Rochester joining McCarthy, Minsky, and Shannon in proposing the workshop that introduced the artificial-intelligence label.

The account follows Rochester’s return to IBM, where he assigned Herbert Gelernter to the geometry-prover project with McCarthy consulting, keeping their roles distinct.

Sources and details

The Dartmouth Workshop--as planned and as it happened

{
  "access_scope": "Participant recollection with explicitly narrated organizational roles; not sole credit for workshop or prover design.",
  "authors": [
    "John McCarthy"
  ],
  "authors_in_source_order": [
    "John McCarthy"
  ],
  "dates": {
    "page_date": "2006-10-30",
    "retrieved_utc": "2026-10-07T18:02:27.411494+00:00"
  },
  "id": "person-nathanielrochester::S1",
  "title": "The Dartmouth Workshop--as planned and as it happened",
  "url": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html"
}

Participant recollection with explicitly narrated organizational roles; not sole credit for workshop or prover design.

Participant recollection with explicitly narrated organizational roles; not sole credit for workshop or prover design.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Herbert Gelernter

John McCarthy’s Dartmouth recollection describes Herbert Gelernter being assigned at IBM to develop the geometry prover proposed by Marvin Minsky.

It explicitly credits Gelernter with developing the Fortran List Processing Language to implement that prover.

The account distinguishes this implementation from McCarthy’s later Lisp proposal, which responded in part to FLPL’s lack of recursion.

Sources and details

The Dartmouth Workshop--as planned and as it happened

{
  "access_scope": "Participant recollection; proposer, implementer, consultant, and later-language roles remain separate.",
  "authors": [
    "John McCarthy"
  ],
  "authors_in_source_order": [
    "John McCarthy"
  ],
  "dates": {
    "page_date": "2006-10-30",
    "retrieved_utc": "2026-10-07T18:02:27.411494+00:00"
  },
  "id": "person-herbertgelernter::S1",
  "title": "The Dartmouth Workshop--as planned and as it happened",
  "url": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html"
}

Participant recollection; proposer, implementer, consultant, and later-language roles remain separate.

Participant recollection; proposer, implementer, consultant, and later-language roles remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Smart sovereignty and the security of society 5.0: An explorative study on the challenges under the technological revolution, with forecasting the future

The Smart Sovereignty dissertation examines security and governance challenges in a technologically intensive Society 5.0.

Its repository abstract combines theoretical analysis with expert interviews concerning Switzerland and quantitative forecasting of future societal indicators.

The dissertation proposes Smart Sovereignty as a framework for shifting influence toward citizens through new organizations and governance arrangements.

Sources and details

Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future

{
  "access_scope": "Repository abstract of the Smart Sovereignty dissertation; theoretical analysis, Swiss expert interviews and quantitative forecasts support a proposed framework rather than demonstrated policy outcomes. The2022thesis date and2023repository manifestation remain distinct. Mohammad Aldabbas is sole author and Stephanie Teufel is degree supervisor, not coauthor.",
  "authors": [
    "Aldabbas, Mohammad"
  ],
  "authors_in_source_order": [
    "Aldabbas, Mohammad"
  ],
  "dates": {
    "citation_publication_date": "2023",
    "repository_manifestation": "Fribourg, Switzerland, 2023",
    "retrieved_utc": "2026-10-07T18:15:57.942175+00:00",
    "thesis": "Université de Fribourg, 2022"
  },
  "id": "work-focused-ebf70d02e72358::S1",
  "title": "Smart sovereignty and the security of society 5.0 : an explorative study on the challenges under the technological revolution, with forecasting the future",
  "url": "https://doi.org/10.51363/unifr.eth.2023.008"
}

Repository abstract of the Smart Sovereignty dissertation; theoretical analysis, Swiss expert interviews and quantitative forecasts support a proposed framework rather than demonstrated policy outcomes. The2022thesis date and2023repository manifestation remain distinct. Mohammad Aldabbas is sole author and Stephanie Teufel is degree supervisor, not coauthor.

Repository abstract of the Smart Sovereignty dissertation; theoretical analysis, Swiss expert interviews and quantitative forecasts support a proposed framework rather than demonstrated policy outcomes. The2022thesis date and2023repository manifestation remain distinct. Mohammad Aldabbas is sole author and Stephanie Teufel is degree supervisor, not coauthor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2023",
      "kind": "dissertation_publication_year",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023"
}

Marvelling at the mystery of consciousness through a scientific lens

In this Nature podcast interview, Anil Seth divides consciousness into questions about conscious level, perception of the world and the experience of being a self.

He describes perception as actively generated predictions calibrated by sensory signals, extending the same account to experiences of selfhood.

His argument connects those processes to living bodies and uses that connection to question whether artificial intelligence must also become conscious.

Sources and details

Marvelling at the mystery of consciousness through a scientific lens

{
  "access_scope": "Transcript of episode two of Tales from the Synapse, published24February2023. These are Seth’s interview arguments, not consensus or an experimental test of machine consciousness. Anil Seth is the interviewee and author of the discussed Being You book; Jean Mary Zarate introduces and hosts the series. The2021book and2023episode are distinct works.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dc.date": "2023-02-24",
    "discussed_book_year": "2021",
    "prism.publicationDate": "2023-02-24",
    "retrieved_utc": "2026-10-07T18:15:40.724020+00:00",
    "visible_publication_date": "24 February 2023"
  },
  "id": "work-focused-64c1334368343f::S1",
  "title": "Marvelling at the mystery of consciousness through a scientific lens",
  "url": "https://www.nature.com/articles/d41586-023-00545-9"
}

Transcript of episode two of Tales from the Synapse, published24February2023. These are Seth’s interview arguments, not consensus or an experimental test of machine consciousness. Anil Seth is the interviewee and author of the discussed Being You book; Jean Mary Zarate introduces and hosts the series. The2021book and2023episode are distinct works.

Transcript of episode two of Tales from the Synapse, published24February2023. These are Seth’s interview arguments, not consensus or an experimental test of machine consciousness. Anil Seth is the interviewee and author of the discussed Being You book; Jean Mary Zarate introduces and hosts the series. The2021book and2023episode are distinct works.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2023-02-24",
      "kind": "publication",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-02-24"
}

Cong Shu

Cong Shu is a listed coauthor of Human-AI attachment: how humans develop intimate relationships with AI, a theoretical account of emotional bonds formed toward AI.

The paper defines human-AI attachment as a one-way, nonreciprocal bond arising through direct interaction.

It proposes stages of functional expectation, emotional evaluation, and establishing representations, and calls for measurement tools and further developmental research.

Sources and details

Human-AI attachment: how humans develop intimate relationships with AI

{
  "access_scope": "2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.",
  "authors": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "authors_in_source_order": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "dates": {
    "citation_online_date": [
      "2026/01/27"
    ],
    "citation_publication_date": [
      "2026/02/11"
    ],
    "retrieved_utc": "2026-10-07T18:14:02.727325+00:00"
  },
  "id": "person-coverage-44b07be1567bfe::S1",
  "title": "Human-AI attachment: how humans develop intimate relationships with AI",
  "url": "https://doi.org/10.3389/fpsyg.2026.1723503"
}

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daron Acemoglu

Daron Acemoglu is a listed coauthor of The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment, a model of how automation and new labor-intensive tasks affect employment and growth.

In its fixed-capital version, automation lowers employment and labor share while creating tasks with labor comparative advantage has opposite effects.

The full model makes capital accumulation and the direction of innovation endogenous, deriving long-run outcomes conditional on its economic assumptions.

Sources and details

The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment

{
  "access_scope": "American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.",
  "authors": [
    "Daron Acemoglu",
    "Pascual Restrepo"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu",
    "Pascual Restrepo"
  ],
  "dates": {
    "journal_volume_issue": "108(6)",
    "pages": "1488–1542",
    "publication_year": "2018",
    "retrieved_utc": "2026-10-07T18:20:48.565493+00:00"
  },
  "id": "person-local-daronacemoglu::S1",
  "title": "The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment",
  "url": "https://economics.mit.edu/sites/default/files/publications/The%20Race%20Between%20Man%20and%20Machine%20-%20Implications%20of.pdf"
}

American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.

American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Derek Shiller

Derek Shiller is a listed coauthor of Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’, a commentary examining claims about a functional workspace in language models.

The commentary distinguishes access to reportable internal representations from phenomenal consciousness and retains uncertainty about both the functional-workspace argument and subjective experience.

It separately asks whether the reported mechanisms constitute a global workspace, what they imply about consciousness, and what follows for moral status.

Sources and details

Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’

{
  "access_scope": "Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.",
  "authors": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:36.877413+00:00"
  },
  "id": "person-coverage-94ee5639b9d563::S1",
  "title": "Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’",
  "url": "https://www-cdn.anthropic.com/files/4zrzovbb/website/cc4be2488d65e54a6ed06492f8968398ddc18ebe.pdf"
}

Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.

Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emir Sahin Hatay

Emir Sahin Hatay is a listed coauthor of Artificial Intelligence (AI): Foundations, trends and future directions, a review connecting AI foundations with applications and future research directions.

The review contrasts learning from labeled examples with other learning settings and uses spam filtering to illustrate supervised learning.

It discusses overfitting as poor generalization beyond training data and presents cross-validation among the techniques used to address it.

Sources and details

Artificial Intelligence (AI): Foundations, trends and future directions

{
  "access_scope": "Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.",
  "authors": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "authors_in_source_order": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "dates": {
    "accepted_literal": "October 2025",
    "available_online": "20 October 2025",
    "received": "13 February 2025",
    "retrieved_utc": "2026-10-07T18:14:18.899462+00:00",
    "revised_received": "5 September 2025",
    "volume": "20 (2025) 100265"
  },
  "id": "person-coverage-53f8ed6bbc37bf::S1",
  "title": "Artificial Intelligence (AI): Foundations, trends and future directions",
  "url": "https://vm-45-113-233-40.rc.cloud.unimelb.edu.au/papers/AI2025.pdf"
}

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henry Mintzberg

Henry Mintzberg is a listed coauthor of Of Strategies, Deliberate and Emergent, an analysis of how organizational strategies relate intentions to realized behavior.

The paper distinguishes deliberate strategies realized as intended from emergent patterns formed despite or without prior intentions.

Its research treats those types as ends of a continuum and draws on eleven intensive organizational studies to explore their interplay.

Sources and details

Of Strategies, Deliberate and Emergent

{
  "access_scope": "1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.",
  "authors": [
    "Henry Mintzberg",
    "James A. Waters"
  ],
  "authors_in_source_order": [
    "Henry Mintzberg",
    "James A. Waters"
  ],
  "dates": {
    "issue": "July–September 1985",
    "pages": "257–272",
    "received": "28 March 1983",
    "retrieved_utc": "2026-10-07T18:19:59.076690+00:00",
    "revised": "4 June 1984",
    "volume_issue": "6(3)"
  },
  "id": "person-henrymintzberg::S1",
  "title": "Of Strategies, Deliberate and Emergent",
  "url": "https://strategy.sjsu.edu/www.stable/B290/reading/Mintzberg%2C%20H%2C%201985%2C%20Strategic%20Management%20Journal.%206%20pp%20257-272.pdf"
}

1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.

1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hilary Putnam

Hilary Putnam is a listed coauthor of A Computing Procedure for Quantification Theory, a paper developing a computational proof procedure for quantification theory.

The procedure is designed to terminate with a proof for valid formulas, while a search on a nonvalid formula can continue indefinitely.

The paper compares its approach with earlier Wang and Gilmore routines and illustrates it on a formula that had resisted Gilmore’s IBM704 computation.

Sources and details

A Computing Procedure for Quantification Theory

{
  "access_scope": "Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.",
  "authors": [
    "Martin Davis",
    "Hilary Putnam"
  ],
  "authors_in_source_order": [
    "Martin Davis",
    "Hilary Putnam"
  ],
  "dates": {
    "received": "September 1959",
    "retrieved_utc": "2026-10-07T18:20:02.891454+00:00"
  },
  "id": "person-hilaryputnam::S1",
  "title": "A Computing Procedure for Quantification Theory",
  "url": "https://web.stanford.edu/class/cs357/DP60.pdf"
}

Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.

Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jacob A. Mincer

Jacob A. Mincer is the credited author of The Human Capital Earnings Function, a chapter extending an earnings model to investments made after schooling.

It relates age and experience profiles of earnings to human-capital investment behavior and examines why age interacts with schooling.

The chapter introduces simple declining investment profiles and derives earnings functions in observable years of experience for empirical analysis.

Sources and details

The Human Capital Earnings Function

{
  "access_scope": "NBER historical chapter reprint with explicit chapter-author credit; derived specifications and historical earnings analysis, not an individual income forecast.",
  "authors": [
    "Jacob A. Mincer"
  ],
  "authors_in_source_order": [
    "Jacob A. Mincer"
  ],
  "dates": {
    "chapter_pages": "83–96",
    "publication_year": "1974",
    "retrieved_utc": "2026-10-07T18:19:02.421815+00:00",
    "volume": "Schooling, Experience, and Earnings"
  },
  "id": "person-coverage-ed365f43c76da3::S1",
  "title": "The Human Capital Earnings Function",
  "url": "https://www.nber.org/system/files/chapters/c1767/c1767.pdf"
}

NBER historical chapter reprint with explicit chapter-author credit; derived specifications and historical earnings analysis, not an individual income forecast.

NBER historical chapter reprint with explicit chapter-author credit; derived specifications and historical earnings analysis, not an individual income forecast.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jürgen Schmidhuber

Jürgen Schmidhuber is a listed coauthor of Long Short-Term Memory, a paper introducing a recurrent architecture for learning across long time intervals.

LSTM maintains constant error flow within specialized units and uses multiplicative gates to learn when access should open or close.

The paper reports artificial-sequence experiments with long delays, comparing the architecture with several earlier recurrent-learning methods.

Sources and details

Long Short-Term Memory

{
  "access_scope": "1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.",
  "authors": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "authors_in_source_order": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "dates": {
    "journal": "Neural Computation 9(8):1735–1780",
    "publication_year": "1997",
    "retrieved_utc": "2026-10-07T17:55:20.342140+00:00"
  },
  "id": "person-jurgenschmidhuber::S1",
  "title": "Long Short-Term Memory",
  "url": "https://www.bioinf.jku.at/publications/older/2604.pdf"
}

1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.

1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kunihiko Fukushima

Kunihiko Fukushima is the credited author of Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position, a paper proposing a layered network for visual pattern recognition.

The architecture cascades modules of S-cells and C-cells after an input layer, with modifiable afferent connections to the S-cells.

Its computer simulations use repeated stimulus patterns without a teacher and report recognition resistant to changes in position and small changes in shape or size.

Sources and details

Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position

{
  "access_scope": "1980 theoretical network and digital simulations; reported invariances within simulated patterns, not general biological validation.",
  "authors": [
    "Kunihiko Fukushima"
  ],
  "authors_in_source_order": [
    "Kunihiko Fukushima"
  ],
  "dates": {
    "journal": "Biological Cybernetics 36, 193–202",
    "publication_year": "1980",
    "retrieved_utc": "2026-10-07T18:20:58.255934+00:00"
  },
  "id": "person-kunihikofukushima::S1",
  "title": "Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position",
  "url": "https://redwood.berkeley.edu/wp-content/uploads/2020/08/Fukushima1980.pdf"
}

1980 theoretical network and digital simulations; reported invariances within simulated patterns, not general biological validation.

1980 theoretical network and digital simulations; reported invariances within simulated patterns, not general biological validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Asaro

Peter Asaro is the credited author of Algorithms of Violence: Critical Social Perspectives on Autonomous Weapons, a critical analysis of the social and political implications of automating force.

The article compares the cumulative social effects of automated decisions about jobs, education, loans, and healthcare with decisions to use violent force.

It argues for examining automation of specific weapon functions, especially targeting and engaging force, rather than waiting for a universal definition of autonomy.

Sources and details

Algorithms of Violence: Critical Social Perspectives on Autonomous Weapons

{
  "access_scope": "2019 critical scholarly argument; source-attributed analysis, not weapon-performance evidence or operational instruction.",
  "authors": [
    "Peter Asaro"
  ],
  "authors_in_source_order": [
    "Peter Asaro"
  ],
  "dates": {
    "first_page": "537",
    "issue": "Summer 2019",
    "journal": "Social Research 86(2)",
    "retrieved_utc": "2026-10-07T18:12:52.596910+00:00"
  },
  "id": "person-coverage-2f0679d19e0058::S1",
  "title": "Algorithms of Violence: Critical Social Perspectives on Autonomous Weapons",
  "url": "https://peterasaro.org/writing/Asaro_AlgorithmsViolence.pdf"
}

2019 critical scholarly argument; source-attributed analysis, not weapon-performance evidence or operational instruction.

2019 critical scholarly argument; source-attributed analysis, not weapon-performance evidence or operational instruction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

W. Brian Arthur

W. Brian Arthur is the credited author of Preface to Increasing Returns and Path Dependence in the Economy, a retrospective explaining his approach to increasing returns in economics.

The preface connects positive feedback with multiple possible equilibria, historical dependence, and lock-in to outcomes that need not be the most efficient.

It describes modeling equilibrium selection with nonlinear stochastic processes so that chance events can be amplified by reinforcing mechanisms.

Sources and details

Preface to Increasing Returns and Path Dependence in the Economy

{
  "access_scope": "1994 first-person preface to collected papers, not a new empirical validation or claim every market follows the same dynamics.",
  "authors": [
    "W. Brian Arthur"
  ],
  "authors_in_source_order": [
    "W. Brian Arthur"
  ],
  "dates": {
    "publication_year": "1994",
    "publisher": "University of Michigan Press",
    "retrieved_utc": "2026-10-07T18:22:37.572908+00:00"
  },
  "id": "person-wbrianarthur::S1",
  "title": "Preface to Increasing Returns and Path Dependence in the Economy",
  "url": "https://sites.santafe.edu/~wbarthur/Papers/Preface.pdf"
}

1994 first-person preface to collected papers, not a new empirical validation or claim every market follows the same dynamics.

1994 first-person preface to collected papers, not a new empirical validation or claim every market follows the same dynamics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Axel Cleeremans

Axel Cleeremans is a listed coauthor of Consciousness science: where are we, where are we going, and what if we get there?, an overview of research strategies for the science of consciousness.

The article recommends testable theories, adversarial collaboration, and greater attention to the phenomenal character of experience.

It considers naturalistic experiments and new measurement methods as possible routes to progress, while treating future consciousness tests and interventions as open research goals.

Sources and details

Consciousness science: where are we, where are we going, and what if we get there?

{
  "access_scope": "2025 Frontiers lead article; future proposals, not established consciousness tests or clinical benefit. Exact source credit Anil K. Seth preserved separately from canonical label.",
  "authors": [
    "Cleeremans, Axel",
    "Mudrik, Liad",
    "Seth, Anil K."
  ],
  "authors_in_source_order": [
    "Cleeremans, Axel",
    "Mudrik, Liad",
    "Seth, Anil K."
  ],
  "dates": {
    "citation_online_date": [
      "2025/09/15"
    ],
    "citation_publication_date": [
      "2025/10/30"
    ],
    "retrieved_utc": "2026-10-07T18:15:29.016832+00:00"
  },
  "id": "person-coverage-9aa85197be5a28::S1",
  "title": "Consciousness science: where are we, where are we going, and what if we get there?",
  "url": "https://doi.org/10.3389/fsci.2025.1546279"
}

2025 Frontiers lead article; future proposals, not established consciousness tests or clinical benefit. Exact source credit Anil K. Seth preserved separately from canonical label.

2025 Frontiers lead article; future proposals, not established consciousness tests or clinical benefit. Exact source credit Anil K. Seth preserved separately from canonical label.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dillon Plunkett

Dillon Plunkett is a listed coauthor of Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’, a commentary examining claims about a functional workspace in language models.

The commentary distinguishes access to reportable internal representations from phenomenal consciousness and retains uncertainty about both the functional-workspace argument and subjective experience.

It separately asks whether the reported mechanisms constitute a global workspace, what they imply about consciousness, and what follows for moral status.

Sources and details

Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’

{
  "access_scope": "Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.",
  "authors": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "authors_in_source_order": [
    "Patrick Butlin",
    "Derek Shiller",
    "Dillon Plunkett",
    "Robert Long"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:36.877413+00:00"
  },
  "id": "person-coverage-689e4569003ebc::S1",
  "title": "Consciousness and cognitive access in LLMs: A commentary on ‘Verbalizable representations form a global workspace in language models’",
  "url": "https://www-cdn.anthropic.com/files/4zrzovbb/website/cc4be2488d65e54a6ed06492f8968398ddc18ebe.pdf"
}

Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.

Exact four-author commentary section on PDFpage16, not authorship of Anthropic experiments or other compilation sections. Section publication date not established from its byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James A. Waters

James A. Waters is a listed coauthor of Of Strategies, Deliberate and Emergent, an analysis of how organizational strategies relate intentions to realized behavior.

The paper distinguishes deliberate strategies realized as intended from emergent patterns formed despite or without prior intentions.

Its research treats those types as ends of a continuum and draws on eleven intensive organizational studies to explore their interplay.

Sources and details

Of Strategies, Deliberate and Emergent

{
  "access_scope": "1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.",
  "authors": [
    "Henry Mintzberg",
    "James A. Waters"
  ],
  "authors_in_source_order": [
    "Henry Mintzberg",
    "James A. Waters"
  ],
  "dates": {
    "issue": "July–September 1985",
    "pages": "257–272",
    "received": "28 March 1983",
    "retrieved_utc": "2026-10-07T18:19:59.076690+00:00",
    "revised": "4 June 1984",
    "volume_issue": "6(3)"
  },
  "id": "person-jamesawaters::S1",
  "title": "Of Strategies, Deliberate and Emergent",
  "url": "https://strategy.sjsu.edu/www.stable/B290/reading/Mintzberg%2C%20H%2C%201985%2C%20Strategic%20Management%20Journal.%206%20pp%20257-272.pdf"
}

1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.

1985 journal article preserved in historical JSTOR reprint; intended/realized distinctions are analytical framework, not guaranteed management outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kaisheng Lai

Kaisheng Lai is a listed coauthor of Human-AI attachment: how humans develop intimate relationships with AI, a theoretical account of emotional bonds formed toward AI.

The paper defines human-AI attachment as a one-way, nonreciprocal bond arising through direct interaction.

It proposes stages of functional expectation, emotional evaluation, and establishing representations, and calls for measurement tools and further developmental research.

Sources and details

Human-AI attachment: how humans develop intimate relationships with AI

{
  "access_scope": "2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.",
  "authors": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "authors_in_source_order": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "dates": {
    "citation_online_date": [
      "2026/01/27"
    ],
    "citation_publication_date": [
      "2026/02/11"
    ],
    "retrieved_utc": "2026-10-07T18:14:02.727325+00:00"
  },
  "id": "person-coverage-5734a27345b060::S1",
  "title": "Human-AI attachment: how humans develop intimate relationships with AI",
  "url": "https://doi.org/10.3389/fpsyg.2026.1723503"
}

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lingnan He

Lingnan He is a listed coauthor of Human-AI attachment: how humans develop intimate relationships with AI, a theoretical account of emotional bonds formed toward AI.

The paper defines human-AI attachment as a one-way, nonreciprocal bond arising through direct interaction.

It proposes stages of functional expectation, emotional evaluation, and establishing representations, and calls for measurement tools and further developmental research.

Sources and details

Human-AI attachment: how humans develop intimate relationships with AI

{
  "access_scope": "2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.",
  "authors": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "authors_in_source_order": [
    "Shu, Cong",
    "Lai, Kaisheng",
    "He, Lingnan"
  ],
  "dates": {
    "citation_online_date": [
      "2026/01/27"
    ],
    "citation_publication_date": [
      "2026/02/11"
    ],
    "retrieved_utc": "2026-10-07T18:14:02.727325+00:00"
  },
  "id": "person-coverage-5884e746ac1e84::S1",
  "title": "Human-AI attachment: how humans develop intimate relationships with AI",
  "url": "https://doi.org/10.3389/fpsyg.2026.1723503"
}

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

2026 Hypothesis and Theory article; proposed framework rather than validated developmental stages or mental-health outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin Davis

Martin Davis is a listed coauthor of A Computing Procedure for Quantification Theory, a paper developing a computational proof procedure for quantification theory.

The procedure is designed to terminate with a proof for valid formulas, while a search on a nonvalid formula can continue indefinitely.

The paper compares its approach with earlier Wang and Gilmore routines and illustrates it on a formula that had resisted Gilmore’s IBM704 computation.

Sources and details

A Computing Procedure for Quantification Theory

{
  "access_scope": "Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.",
  "authors": [
    "Martin Davis",
    "Hilary Putnam"
  ],
  "authors_in_source_order": [
    "Martin Davis",
    "Hilary Putnam"
  ],
  "dates": {
    "received": "September 1959",
    "retrieved_utc": "2026-10-07T18:20:02.891454+00:00"
  },
  "id": "person-martindavis::S1",
  "title": "A Computing Procedure for Quantification Theory",
  "url": "https://web.stanford.edu/class/cs357/DP60.pdf"
}

Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.

Historical paper scan; received1959 retained without inventing publication date from absent first-page metadata. Byline visually checked because Davis extraction garbled. Illustration is historical comparison, not modern benchmark.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Muhammed Golec

Muhammed Golec is a listed coauthor of Artificial Intelligence (AI): Foundations, trends and future directions, a review connecting AI foundations with applications and future research directions.

The review contrasts learning from labeled examples with other learning settings and uses spam filtering to illustrate supervised learning.

It discusses overfitting as poor generalization beyond training data and presents cross-validation among the techniques used to address it.

Sources and details

Artificial Intelligence (AI): Foundations, trends and future directions

{
  "access_scope": "Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.",
  "authors": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "authors_in_source_order": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "dates": {
    "accepted_literal": "October 2025",
    "available_online": "20 October 2025",
    "received": "13 February 2025",
    "retrieved_utc": "2026-10-07T18:14:18.899462+00:00",
    "revised_received": "5 September 2025",
    "volume": "20 (2025) 100265"
  },
  "id": "person-coverage-c56993fff98b01::S1",
  "title": "Artificial Intelligence (AI): Foundations, trends and future directions",
  "url": "https://vm-45-113-233-40.rc.cloud.unimelb.edu.au/papers/AI2025.pdf"
}

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pascual Restrepo

Pascual Restrepo is a listed coauthor of The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment, a model of how automation and new labor-intensive tasks affect employment and growth.

In its fixed-capital version, automation lowers employment and labor share while creating tasks with labor comparative advantage has opposite effects.

The full model makes capital accumulation and the direction of innovation endogenous, deriving long-run outcomes conditional on its economic assumptions.

Sources and details

The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment

{
  "access_scope": "American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.",
  "authors": [
    "Daron Acemoglu",
    "Pascual Restrepo"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu",
    "Pascual Restrepo"
  ],
  "dates": {
    "journal_volume_issue": "108(6)",
    "pages": "1488–1542",
    "publication_year": "2018",
    "retrieved_utc": "2026-10-07T18:20:48.565493+00:00"
  },
  "id": "person-local-pascualrestrepo::S1",
  "title": "The Race between Man and Machine: Implications of Technology for Growth, Factor Shares, and Employment",
  "url": "https://economics.mit.edu/sites/default/files/publications/The%20Race%20Between%20Man%20and%20Machine%20-%20Implications%20of.pdf"
}

American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.

American Economic Review 2018 model; conditional theoretical outcomes, not an unconditional forecast of AI employment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rajkumar Buyya

Rajkumar Buyya is a listed coauthor of Artificial Intelligence (AI): Foundations, trends and future directions, a review connecting AI foundations with applications and future research directions.

The review contrasts learning from labeled examples with other learning settings and uses spam filtering to illustrate supervised learning.

It discusses overfitting as poor generalization beyond training data and presents cross-validation among the techniques used to address it.

Sources and details

Artificial Intelligence (AI): Foundations, trends and future directions

{
  "access_scope": "Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.",
  "authors": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "authors_in_source_order": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "dates": {
    "accepted_literal": "October 2025",
    "available_online": "20 October 2025",
    "received": "13 February 2025",
    "retrieved_utc": "2026-10-07T18:14:18.899462+00:00",
    "revised_received": "5 September 2025",
    "volume": "20 (2025) 100265"
  },
  "id": "person-coverage-a17210b5412750::S1",
  "title": "Artificial Intelligence (AI): Foundations, trends and future directions",
  "url": "https://vm-45-113-233-40.rc.cloud.unimelb.edu.au/papers/AI2025.pdf"
}

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sepp Hochreiter

Sepp Hochreiter is a listed coauthor of Long Short-Term Memory, a paper introducing a recurrent architecture for learning across long time intervals.

LSTM maintains constant error flow within specialized units and uses multiplicative gates to learn when access should open or close.

The paper reports artificial-sequence experiments with long delays, comparing the architecture with several earlier recurrent-learning methods.

Sources and details

Long Short-Term Memory

{
  "access_scope": "1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.",
  "authors": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "authors_in_source_order": [
    "Sepp Hochreiter",
    "Jürgen Schmidhuber"
  ],
  "dates": {
    "journal": "Neural Computation 9(8):1735–1780",
    "publication_year": "1997",
    "retrieved_utc": "2026-10-07T17:55:20.342140+00:00"
  },
  "id": "person-sepphochreiter::S1",
  "title": "Long Short-Term Memory",
  "url": "https://www.bioinf.jku.at/publications/older/2604.pdf"
}

1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.

1997 paper; original artificial-data experiments attributed to coauthors jointly. No unsupported individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sukhpal Singh Gill

Sukhpal Singh Gill is a listed coauthor of Artificial Intelligence (AI): Foundations, trends and future directions, a review connecting AI foundations with applications and future research directions.

The review contrasts learning from labeled examples with other learning settings and uses spam filtering to illustrate supervised learning.

It discusses overfitting as poor generalization beyond training data and presents cross-validation among the techniques used to address it.

Sources and details

Artificial Intelligence (AI): Foundations, trends and future directions

{
  "access_scope": "Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.",
  "authors": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "authors_in_source_order": [
    "Muhammed Golec",
    "Emir Sahin Hatay",
    "Sukhpal Singh Gill",
    "Rajkumar Buyya"
  ],
  "dates": {
    "accepted_literal": "October 2025",
    "available_online": "20 October 2025",
    "received": "13 February 2025",
    "retrieved_utc": "2026-10-07T18:14:18.899462+00:00",
    "revised_received": "5 September 2025",
    "volume": "20 (2025) 100265"
  },
  "id": "person-coverage-b75a0cb8fd258d::S1",
  "title": "Artificial Intelligence (AI): Foundations, trends and future directions",
  "url": "https://vm-45-113-233-40.rc.cloud.unimelb.edu.au/papers/AI2025.pdf"
}

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

Telematics and Informatics Reports review; surveyed method descriptions, not novel individual experiments. Acceptance footer prints only month/year.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

What Is It Like to Be a Bat?

Thomas Nagel’s What Is It Like to Be a Bat? argues that explaining consciousness requires accounting for the subjective character of experience.

The bat’s echolocation makes the gap between describing a sensory system and understanding its point of view especially vivid.

Nagel challenges reductions that leave this perspective out, while distinguishing that objection from denying that experiences have causal or functional roles.

Sources and details

What Is It Like to Be a Bat?

{
  "access_scope": "1974 philosophical essay in a JSTOR facsimile hosted by LSE; its argument about subjective experience is not a measurement of consciousness in present AI or a settled proof against physicalism.",
  "authors": [
    "Thomas Nagel"
  ],
  "authors_in_source_order": [
    "Thomas Nagel"
  ],
  "dates": {
    "archival_access_stamp": "04/02/2014",
    "publication": "October 1974",
    "retrieved_utc": "2026-10-07T18:14:51.969281+00:00"
  },
  "id": "work-coverage-540988e7b37b04::S1",
  "publisher": "The Philosophical Review / Duke University Press",
  "title": "What Is It Like to Be a Bat?",
  "url": "https://personal.lse.ac.uk/robert49/teaching/ph103/pdf/nagel1974.pdf"
}

1974 philosophical essay in a JSTOR facsimile hosted by LSE; its argument about subjective experience is not a measurement of consciousness in present AI or a settled proof against physicalism.

1974 philosophical essay in a JSTOR facsimile hosted by LSE; its argument about subjective experience is not a measurement of consciousness in present AI or a settled proof against physicalism.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "The Philosophical Review 83 (4), October 1974, pp. 435–450; later republications are not the original date.",
  "dated": true,
  "year": 1974
}

Stanley: The Robot that Won the DARPA Grand Challenge

Stanley: The Robot that Won the DARPA Grand Challenge documents the architecture behind autonomous desert driving in the 2005 competition.

The paper treats navigation as a software problem, combining machine learning and probabilistic reasoning with terrain perception, collision avoidance and vehicle control.

Its race account reports completing the course without a human driver, while separately describing manual override features used during development.

Sources and details

Stanley: The Robot that Won the DARPA Grand Challenge

{
  "access_scope": "Jointly authored 2006 technical account of Stanley and its 2005 race; race autonomy, development-time overrides and modern deployment capabilities remain separate, with no individual division of labor inferred.",
  "authors": [
    "Sebastian Thrun",
    "Mike Montemerlo",
    "Hendrik Dahlkamp",
    "David Stavens",
    "Andrei Aron",
    "James Diebel",
    "Philip Fong",
    "John Gale",
    "Morgan Halpenny",
    "Gabriel Hoffmann",
    "Kenny Lau",
    "Celia Oakley",
    "Mark Palatucci",
    "Vaughan Pratt",
    "Pascal Stang",
    "Sven Strohband",
    "Cedric Dupont",
    "Lars-Erik Jendrossek",
    "Christian Koelen",
    "Charles Markey",
    "Carlo Rummel",
    "Joe van Niekerk",
    "Eric Jensen",
    "Philippe Alessandrini",
    "Gary Bradski",
    "Bob Davies",
    "Scott Ettinger",
    "Adrian Kaehler",
    "Ara Nefian",
    "Pamela Mahoney"
  ],
  "authors_in_source_order": [
    "Sebastian Thrun",
    "Mike Montemerlo",
    "Hendrik Dahlkamp",
    "David Stavens",
    "Andrei Aron",
    "James Diebel",
    "Philip Fong",
    "John Gale",
    "Morgan Halpenny",
    "Gabriel Hoffmann",
    "Kenny Lau",
    "Celia Oakley",
    "Mark Palatucci",
    "Vaughan Pratt",
    "Pascal Stang",
    "Sven Strohband",
    "Cedric Dupont",
    "Lars-Erik Jendrossek",
    "Christian Koelen",
    "Charles Markey",
    "Carlo Rummel",
    "Joe van Niekerk",
    "Eric Jensen",
    "Philippe Alessandrini",
    "Gary Bradski",
    "Bob Davies",
    "Scott Ettinger",
    "Adrian Kaehler",
    "Ara Nefian",
    "Pamela Mahoney"
  ],
  "dates": {
    "accepted": "27 June 2006",
    "published": "2006",
    "race": "October 8, 2005",
    "received": "13 April 2006",
    "retrieved_utc": "2026-10-07T18:24:55.710200+00:00"
  },
  "id": "work-final-62570e5454810e::S1",
  "publisher": "Journal of Field Robotics / Wiley",
  "title": "Stanley: The Robot that Won the DARPA Grand Challenge",
  "url": "https://robots.stanford.edu/papers/thrun.stanley05.pdf"
}

Jointly authored 2006 technical account of Stanley and its 2005 race; race autonomy, development-time overrides and modern deployment capabilities remain separate, with no individual division of labor inferred.

Jointly authored 2006 technical account of Stanley and its 2005 race; race autonomy, development-time overrides and modern deployment capabilities remain separate, with no individual division of labor inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Journal: Journal of Field Robotics. Volume: 23. Issue: 9. Pages: 661–692.",
  "dated": true,
  "year": 2006
}

Experimental Consciousness Science 2025-2026

Experimental Consciousness Science 2025-2026 interprets recent research through the Unfinishable Map’s stated dualist framework.

It uses the COGITATE comparison of IIT and global neuronal workspace theory to discuss the difficulty of distinguishing theories by their neural predictions.

The article also separates claimed brain-biophoton detection from a later measurement challenge, treating that line of evidence as unsettled rather than established support for its framework.

Sources and details

Experimental Consciousness Science 2025-2026 | The Unfinishable Map

{
  "access_scope": "Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.",
  "authors": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "authors_in_source_order": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "dates": {
    "citation_publication_date": "2026/03/26",
    "created": "2026-03-26",
    "last_modified": "2026-10-02",
    "retrieved_utc": "2026-10-07T18:15:36.375124+00:00"
  },
  "id": "work-focused-49482449429ef5::S1",
  "publisher": "The Unfinishable Map",
  "title": "Experimental Consciousness Science 2025-2026 | The Unfinishable Map",
  "url": "https://unfinishablemap.org/topics/experimental-consciousness-science-2025-2026/"
}

Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.

Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-03-26",
      "kind": "publication",
      "year": 2026
    },
    {
      "date": "2026-10-02",
      "kind": "modified_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-03-26"
}

Digitálisan közvetített valóság és döntéshozatali sérülékenység

Digitálisan közvetített valóság és döntéshozatali sérülékenység proposes a framework for how AI decision support and immersive technologies shape military judgment.

Its abstract combines perceptual, cognitive and trust dimensions instead of treating each psychological mechanism in isolation.

It examines automation bias, cognitive overload and offloading, and immersive perceptual effects as interacting sources of decision vulnerability.

Sources and details

Digitálisan közvetített valóság és döntéshozatali sérülékenység | Hadtudományi Szemle

{
  "access_scope": "Original publisher-hosted Hungarian abstract, summarized in English; proposed theoretical model and reviewed mechanisms are distinguished from empirically validated military performance. The full linked PDF was not used for this draft.",
  "authors": [
    "Porkoláb-Minarik Annamária"
  ],
  "authors_in_source_order": [
    "Porkoláb-Minarik Annamária"
  ],
  "dates": {
    "citation_date": "2026/09/14",
    "copyright": "2026",
    "retrieved_utc": "2026-10-07T18:15:31.136175+00:00"
  },
  "id": "work-focused-593a387c090d6b::S1",
  "publisher": "Hadtudományi Szemle / Ludovika journal platform",
  "title": "\n\t\tDigitálisan közvetített valóság és döntéshozatali sérülékenység\n\t\t\t\t\t\t\t| Hadtudományi Szemle\n\t\t\t",
  "url": "https://folyoirat.ludovika.hu/index.php/hsz/article/view/8921"
}

Original publisher-hosted Hungarian abstract, summarized in English; proposed theoretical model and reviewed mechanisms are distinguished from empirically validated military performance. The full linked PDF was not used for this draft.

Original publisher-hosted Hungarian abstract, summarized in English; proposed theoretical model and reviewed mechanisms are distinguished from empirically validated military performance. The full linked PDF was not used for this draft.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "issue_date",
      "year": 2026
    },
    {
      "date": "2026-09-14",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024 examines AI-equipped military systems as instruments of proxy conflict.

The publisher-deposited abstract discusses remotely controlled equipment, robots and automated guided weapons in relation to human and financial costs.

Its reported argument pairs claimed battlefield advantages with humanitarian concerns about civilian casualties, rather than treating efficiency as the only criterion.

Sources and details

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024

{
  "access_scope": "Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.",
  "authors": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "authors_in_source_order": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "dates": {
    "published_online": "2025-12-12",
    "published_print": "2026-02-09",
    "retrieved_utc": "2026-10-07T18:17:39.176968+00:00"
  },
  "id": "work-focused-8ee70e02b15f3f::S1",
  "publisher": "Marine Corps University Press / Journal of Advanced Military Studies",
  "title": "The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024",
  "url": "https://api.crossref.org/works/10.21140/mcuj.20251602007"
}

Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.

Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-12-12",
      "kind": "published_online",
      "year": 2025
    },
    {
      "date": "2026-02-09",
      "kind": "published_print",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-12-12"
}

The Age of AI Power: How Compute, Energy, Chips, Institutions, and Trust Are Redrawing Geopolitics

The Age of AI Power argues that national AI capability depends on an infrastructure and governance system beyond frontier models alone.

Its author connects compute, electricity, chips, skills, institutions and public trust as mutually dependent parts of that system.

The article proposes evaluating readiness through practical resources, resilience and accountability, while explicitly separating observed evidence, forecasts and strategic interpretation.

Sources and details

The Age of AI Power How Compute, Energy, Chips, Institutions, and Trust Are Redrawing Geopolitics

{
  "access_scope": "Author-hosted strategic interpretation; source title places a line break between The Age of AI Power and its subtitle where the canonical label uses a colon. Infrastructure forecasts are not verified outcomes, the author byline remains Tamrat Y., and the separately credited Copilot visualization is not the prose author.",
  "authors": [
    "Tamrat Y."
  ],
  "authors_in_source_order": [
    "Tamrat Y."
  ],
  "dates": {
    "edition": "Friday, August 21, 2026",
    "retrieved_utc": "2026-10-07T18:16:14.027348+00:00"
  },
  "id": "work-focused-90a9c00f1c71cb::S1",
  "publisher": "LinkedIn author article",
  "title": "The Age of AI Power\nHow Compute, Energy, Chips, Institutions, and Trust Are Redrawing Geopolitics",
  "url": "https://www.linkedin.com/pulse/age-ai-power-how-compute-energy-chips-institutions-tamrat-yifrashewa--meqxc"
}

Author-hosted strategic interpretation; source title places a line break between The Age of AI Power and its subtitle where the canonical label uses a colon. Infrastructure forecasts are not verified outcomes, the author byline remains Tamrat Y., and the separately credited Copilot visualization is not the prose author.

Author-hosted strategic interpretation; source title places a line break between The Age of AI Power and its subtitle where the canonical label uses a colon. Infrastructure forecasts are not verified outcomes, the author byline remains Tamrat Y., and the separately credited Copilot visualization is not the prose author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-08-21",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-08-21"
}

Research Notes - Types of Consciousness and What AI Experience Might Be Like

Research Notes - Types of Consciousness and What AI Experience Might Be Like organizes consciousness questions around distinctions such as phenomenal experience, access and monitoring.

The note considers whether AI could support information available for reasoning and action while lacking a subjective experience of that information.

It then compares proposed discontinuous or distributed forms of AI experience, treating those possibilities through the Map’s interactionist-dualist perspective rather than as demonstrated machine states.

Sources and details

Research Notes - Types of Consciousness and What AI Experience Might Be Like | The Unfinishable Map

{
  "access_scope": "Source explicitly labels these research notes human-supervised and AI-generated by claude-opus-4-6. Taxonomies, cited hypotheses and their dualist interpretation are this note’s synthesis; underlying sources were not all inspected, and no AI consciousness or quantum mechanism is demonstrated.",
  "authors": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "authors_in_source_order": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "dates": {
    "citation_publication_date": "2026/03/07",
    "created": "2026-03-07",
    "last_modified": "2026-03-08",
    "retrieved_utc": "2026-10-07T18:15:36.312041+00:00"
  },
  "id": "work-focused-d2e7003fee65e3::S1",
  "publisher": "The Unfinishable Map",
  "title": "Research Notes - Types of Consciousness and What AI Experience Might Be Like | The Unfinishable Map",
  "url": "https://unfinishablemap.org/research/types-of-consciousness-ai-experience-2026-03-07/"
}

Source explicitly labels these research notes human-supervised and AI-generated by claude-opus-4-6. Taxonomies, cited hypotheses and their dualist interpretation are this note’s synthesis; underlying sources were not all inspected, and no AI consciousness or quantum mechanism is demonstrated.

Source explicitly labels these research notes human-supervised and AI-generated by claude-opus-4-6. Taxonomies, cited hypotheses and their dualist interpretation are this note’s synthesis; underlying sources were not all inspected, and no AI consciousness or quantum mechanism is demonstrated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-03-07",
      "kind": "created",
      "year": 2026
    },
    {
      "date": "2026-03-08",
      "kind": "modified",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-03-07"
}

Alex Gabriel

Alex Gabriel is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Gabriel.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-a8eae3140214a7::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Gabriel.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Gabriel.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ananya Ganesh

Ananya Ganesh is a listed coauthor of a paper examining the resource costs of training deep-learning models for natural-language processing.

The authors estimate approximate financial and environmental costs across several then-recent models, connecting hardware, electricity, and cloud-compute expenses with training’s carbon footprint.

They use these estimates to propose ways to reduce costs and improve equity in NLP research and practice.

Sources and details

Energy and Policy Considerations for Deep Learning in NLP

{
  "access_scope": "The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Ganesh’s individual research tasks.",
  "authors": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "authors_in_source_order": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "dates": {
    "citation_publication_date": "2019/7",
    "inspected_source_date_1": "July 2019",
    "retrieved_utc": "2026-10-07T18:14:33.537484+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2019"
  ],
  "id": "person-coverage-5c2c8b14bc8fcf::S1",
  "title": "Energy and Policy Considerations for Deep Learning in NLP",
  "url": "https://aclanthology.org/P19-1355/"
}

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Ganesh’s individual research tasks.

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Ganesh’s individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anders Humlum

Anders Humlum is a listed coauthor of a working paper studying early labor-market changes associated with AI chatbots in Denmark.

The study links adoption surveys to administrative labor records and uses difference-in-differences estimates to examine earnings and recorded hours at worker and workplace levels.

The revised abstract reports no detectable average earnings or hours effects within its study window, alongside task reorganization involving content generation, AI oversight, and integration.

Sources and details

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Humlum’s individual division of labor.",
  "authors": [
    "Anders Humlum",
    "Emilie Vestergaard"
  ],
  "authors_in_source_order": [
    "Anders Humlum",
    "Emilie Vestergaard"
  ],
  "dates": {
    "citation_publication_date": "2025/05/12",
    "inspected_source_date_1": "May 2025 issue; March 2026 revision",
    "retrieved_utc": "2026-10-07T18:21:19.018471+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 2025 issue; March 2026 revision"
  ],
  "id": "person-local-andershumlum::S1",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.nber.org/papers/w33777"
}

This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Humlum’s individual division of labor.

This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Humlum’s individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fernando Marmolejo-Ramos

Fernando Marmolejo-Ramos is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Marmolejo-Ramos’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-3fc8b9853f5cee::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Marmolejo-Ramos’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Marmolejo-Ramos’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fons Wijnhoven

Fons Wijnhoven is a listed coauthor of a system-dynamics report exploring possible futures for AI’s electricity demand.

The study combines bottom-up and top-down approaches using industry data, academic studies, and expert knowledge to connect AI growth with energy-system constraints.

It compares scenarios including Sustainable AI, Limits to Growth, Abundance without Boundaries, and Energy Crises to examine how efficiency, frugality, and infrastructure affect those futures.

Sources and details

Artificial Intelligence and Electricity: A System Dynamics Approach

{
  "access_scope": "The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Wijnhoven’s individual modeling tasks.",
  "authors": [
    "Fons Wijnhoven",
    "Rémi Paccou"
  ],
  "authors_in_source_order": [
    "Fons Wijnhoven",
    "Rémi Paccou"
  ],
  "dates": {
    "citation_publication_date": "2024/12/04",
    "inspected_source_date_1": "2024-12-04",
    "retrieved_utc": "2026-10-07T18:14:53.376233+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-12-04"
  ],
  "id": "person-coverage-a4253deceb78de::S1",
  "title": "Artificial Intelligence and Electricity: A System Dynamics Approach",
  "url": "https://research.utwente.nl/en/publications/artificial-intelligence-and-electricity-a-system-dynamics-approac/"
}

The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Wijnhoven’s individual modeling tasks.

The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Wijnhoven’s individual modeling tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frederick Jelinek

Frederick Jelinek is the credited author of a paper describing statistical methods for recognizing continuous speech.

Its abstract connects models of the speaker and acoustic processor with the estimation of their statistical parameters.

It also describes hypothesis-search procedures and likelihood calculations for linguistic decoding, accompanied by experimental results on the methods.

Sources and details

Continuous speech recognition by statistical methods

{
  "access_scope": "The IBM publication record credits Jelinek for this 1976 Proceedings of the IEEE paper; the abstract supplies no numerical performance claim and does not establish sole authorship of the wider speech-recognition field.",
  "authors": [
    "Frederick Jelinek"
  ],
  "authors_in_source_order": [
    "Frederick Jelinek"
  ],
  "dates": {
    "citation_publication_date": "1976/01/01",
    "inspected_source_date_1": "1976-01-01",
    "retrieved_utc": "2026-10-07T18:16:08.387225+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1976-01-01"
  ],
  "id": "person-coverage-837c56e47aa83b::S1",
  "title": "Continuous speech recognition by statistical methods",
  "url": "https://research.ibm.com/publications/continuous-speech-recognition-by-statistical-methods"
}

The IBM publication record credits Jelinek for this 1976 Proceedings of the IEEE paper; the abstract supplies no numerical performance claim and does not establish sole authorship of the wider speech-recognition field.

The IBM publication record credits Jelinek for this 1976 Proceedings of the IEEE paper; the abstract supplies no numerical performance claim and does not establish sole authorship of the wider speech-recognition field.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hamna Jamil

Hamna Jamil is a listed coauthor of a qualitative comparison of US and Chinese approaches to military AI.

The study draws on secondary defense reports, academic literature, and think-tank material to compare the two countries’ technological strategies.

It contrasts US partnerships with civilian technology firms and China’s military-civil fusion approach while discussing escalation, strategic stability, and ethical concerns.

Sources and details

US China Technological Competition and The Use Of Artificial Intelligence in Military Applications

{
  "access_scope": "This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Jamil particular research tasks.",
  "authors": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "authors_in_source_order": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "dates": {
    "inspected_source_date_1": "April–June 2026; volume 05 issue 02",
    "retrieved_utc": "2026-10-07T18:12:36.565378+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April–June 2026; volume 05 issue 02"
  ],
  "id": "person-coverage-2f8bf365f14f41::S1",
  "title": "US China Technological Competition and The Use Of Artificial Intelligence in Military Applications",
  "url": "https://assajournal.com/index.php/36/article/download/1873/2821"
}

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Jamil particular research tasks.

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Jamil particular research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Manyika

James Manyika is the credited author of an introductory essay on the relationship between AI and scientific discovery.

The essay argues that progress runs in both directions, with science advancing AI and AI advancing science, illustrated by protein-structure prediction and protein design.

It also examines constraints on future discovery, including access to compute, reproducibility, and the risk of contaminating scientific literature.

Sources and details

Introductory Notes: On AI, Science & the Future of Discovery

{
  "access_scope": "This Dædalus introduction discusses other researchers’ achievements and future questions; it does not credit Manyika with their protein research or establish clinical validation of the cited systems.",
  "authors": [
    "James Manyika"
  ],
  "authors_in_source_order": [
    "James Manyika"
  ],
  "dates": {
    "inspected_source_date_1": "Winter/Spring 2026; Dædalus 155(1–2)",
    "retrieved_utc": "2026-10-07T18:16:09.832972+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Winter/Spring 2026; Dædalus 155(1–2)"
  ],
  "id": "person-coverage-8bb305b03c533a::S1",
  "title": "Introductory Notes: On AI, Science & the Future of Discovery",
  "url": "https://www.amacad.org/sites/default/files/publication/downloads/daedalus_wi-sp26_01_introduction_3.pdf"
}

This Dædalus introduction discusses other researchers’ achievements and future questions; it does not credit Manyika with their protein research or establish clinical validation of the cited systems.

This Dædalus introduction discusses other researchers’ achievements and future questions; it does not credit Manyika with their protein research or establish clinical validation of the cited systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kai Li

Kai Li is a listed coauthor of the paper introducing ImageNet as a hierarchical image database.

The database organizes images through WordNet’s semantic categories and uses human annotation, including an Amazon Mechanical Turk collection scheme, to control image quality.

The paper reports a snapshot of 3.2 million images across twelve subtrees, illustrating the scale of the database described in that source.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Kai Li’s individual collection or annotation work.",
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "authors_in_source_order": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "inspected_source_date_1": "Historical original database paper snapshot; date not explicitly asserted from this cached credit block",
    "retrieved_utc": "2026-10-07T18:21:14.814808+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Historical original database paper snapshot; date not explicitly asserted from this cached credit block"
  ],
  "id": "person-local-kaili::S1",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Kai Li’s individual collection or annotation work.

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Kai Li’s individual collection or annotation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luiz André Barroso

Luiz André Barroso is a listed coauthor of the third edition of a book treating a warehouse-scale datacenter as one integrated computer.

The book explains how hardware and software work together, connecting system architecture with design, operation, and cost through real-world examples.

Its 2018 revision adds discussion of machine-learning and public-cloud workloads, specialized accelerators, storage and networking, and power, cooling, and uptime.

Sources and details

The Datacenter as a Computer: designing warehouse-scale machines

{
  "access_scope": "The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Barroso particular infrastructure components.",
  "authors": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "authors_in_source_order": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "inspected_source_date_1": "2018; third edition",
    "retrieved_utc": "2026-10-07T18:12:09.258524+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2018; third edition"
  ],
  "id": "person-coverage-2a19a789eaef2c::S1",
  "title": "The Datacenter as a Computer: designing warehouse-scale machines",
  "url": "https://research.google/pubs/the-datacenter-as-a-computer-designing-warehouse-scale-machines/"
}

The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Barroso particular infrastructure components.

The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Barroso particular infrastructure components.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oliver E. Williamson

Oliver E. Williamson is the credited author of a Nobel lecture explaining transaction-cost economics as a way to analyze economic governance.

The lecture starts from the question of when a firm should produce for itself rather than outsource, examining organization through contracts and transactions.

It connects attributes of transactions with alternative governance arrangements, using their alignment to develop hypotheses that can be tested empirically.

Sources and details

Transaction Cost Economics: The Natural Progression

{
  "access_scope": "This 2009 prize lecture presents a historical research program; it is not a universal outsourcing rule, and its acknowledgements and intellectual influences are separate from author credit.",
  "authors": [
    "Oliver E. Williamson"
  ],
  "authors_in_source_order": [
    "Oliver E. Williamson"
  ],
  "dates": {
    "inspected_source_date_1": "Prize Lecture, 2009-12-08",
    "retrieved_utc": "2026-10-07T18:22:16.046594+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Prize Lecture, 2009-12-08"
  ],
  "id": "person-oliverewilliamson::S1",
  "title": "Transaction Cost Economics: The Natural Progression",
  "url": "https://www.nobelprize.org/uploads/2018/06/williamson_lecture.pdf"
}

This 2009 prize lecture presents a historical research program; it is not a universal outsourcing rule, and its acknowledgements and intellectual influences are separate from author credit.

This 2009 prize lecture presents a historical research program; it is not a universal outsourcing rule, and its acknowledgements and intellectual influences are separate from author credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Kowalski

Robert Kowalski is a listed coauthor of a paper describing SWISH as a web front end for interactive logic-programming tutorials.

Its architecture combines a server implemented in SWI-Prolog with a JavaScript browser client, allowing multiple users to manipulate and run shared material.

The paper presents tutorial case studies for Probabilistic Logic Programming and Logic Production System as extensions supported through SWISH.

Sources and details

Using SWISH to Realise Interactive Web-based Tutorials for Logic-based Languages

{
  "access_scope": "This binding uses only the named 2019 SWISH section and its six-author credit on Kowalski’s publication page; other page entries do not establish authorship of this paper or Kowalski’s individual implementation tasks.",
  "authors": [
    "Jan Wielemaker",
    "Fabrizio Riguzzi",
    "Robert Kowalski",
    "Torbjorn Lager",
    "Fariba Sadri",
    "Miguel Calejo"
  ],
  "authors_in_source_order": [
    "Jan Wielemaker",
    "Fabrizio Riguzzi",
    "Robert Kowalski",
    "Torbjorn Lager",
    "Fariba Sadri",
    "Miguel Calejo"
  ],
  "dates": {
    "inspected_source_date_1": "2019; Theory and Practice of Logic Programming 19(2), 229–261",
    "retrieved_utc": "2026-10-07T18:22:09.016484+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019; Theory and Practice of Logic Programming 19(2), 229–261"
  ],
  "id": "person-robertkowalski::S1",
  "title": "Using SWISH to Realise Interactive Web-based Tutorials for Logic-based Languages",
  "url": "https://www.doc.ic.ac.uk/~rak/papers/rak.html"
}

This binding uses only the named 2019 SWISH section and its six-author credit on Kowalski’s publication page; other page entries do not establish authorship of this paper or Kowalski’s individual implementation tasks.

This binding uses only the named 2019 SWISH section and its six-author credit on Kowalski’s publication page; other page entries do not establish authorship of this paper or Kowalski’s individual implementation tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert S. Kaplan

Robert S. Kaplan is the credited author of a working paper tracing the conceptual development of the Balanced Scorecard.

It explains why financial measures were combined with customer, internal-process, and learning-and-growth perspectives to address intangible assets.

The account follows the scorecard’s expansion from performance measurement into a tool for describing, communicating, and implementing strategy.

Sources and details

Conceptual Foundations of the Balanced Scorecard

{
  "access_scope": "This 2010 HBS working paper is explicitly a draft and recounts Kaplan and David Norton’s earlier joint work; sole credit for this paper does not imply sole creation of the Balanced Scorecard or guarantee organizational results.",
  "authors": [
    "Robert S. Kaplan"
  ],
  "authors_in_source_order": [
    "Robert S. Kaplan"
  ],
  "dates": {
    "inspected_source_date_1": "2010 working paper 10-074; originally prepared for a 2009 handbook",
    "retrieved_utc": "2026-10-07T18:12:17.479730+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2010 working paper 10-074; originally prepared for a 2009 handbook"
  ],
  "id": "person-coverage-2b9e47be89014d::S1",
  "title": "Conceptual Foundations of the Balanced Scorecard",
  "url": "https://www.hbs.edu/ris/Publication%20Files/10-074_0bf3c151-f82b-4592-b885-cdde7f5d97a6.pdf"
}

This 2010 HBS working paper is explicitly a draft and recounts Kaplan and David Norton’s earlier joint work; sole credit for this paper does not imply sole creation of the Balanced Scorecard or guarantee organizational results.

This 2010 HBS working paper is explicitly a draft and recounts Kaplan and David Norton’s earlier joint work; sole credit for this paper does not imply sole creation of the Balanced Scorecard or guarantee organizational results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steven E. Miller

Steven E. Miller is a listed coauthor of an article introducing research on AI’s influence over decisions to begin war.

The article distinguishes automated self-defence from decision-support systems that inform human deliberation about the resort to force.

It sets out a multidisciplinary agenda for examining risks and benefits at this state-level decision stage, connecting anticipated adoption with competitive pressure to match other states’ capabilities.

Sources and details

AI and the decision to go to war: future risks and opportunities

{
  "access_scope": "The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Miller individual research tasks.",
  "authors": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "authors_in_source_order": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "dates": {
    "citation_publication_date": "2024",
    "inspected_source_date_1": "2024; Australian Journal of International Affairs 78(2), 135–147",
    "retrieved_utc": "2026-10-07T18:11:16.684105+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024; Australian Journal of International Affairs 78(2), 135–147"
  ],
  "id": "person-coverage-056f6d64002699::S1",
  "title": "AI and the decision to go to war: future risks and opportunities",
  "url": "https://researchportalplus.anu.edu.au/en/publications/ai-and-the-decision-to-go-to-war-future-risks-and-opportunities/"
}

The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Miller individual research tasks.

The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Miller individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew McCallum

Andrew McCallum is a listed coauthor of a paper examining the resource costs of training deep-learning models for natural-language processing.

The authors estimate approximate financial and environmental costs across several then-recent models, connecting hardware, electricity, and cloud-compute expenses with training’s carbon footprint.

They use these estimates to propose ways to reduce costs and improve equity in NLP research and practice.

Sources and details

Energy and Policy Considerations for Deep Learning in NLP

{
  "access_scope": "The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Andrew McCallum’s individual research tasks.",
  "authors": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "authors_in_source_order": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "dates": {
    "citation_publication_date": "2019/7",
    "inspected_source_date_1": "July 2019",
    "retrieved_utc": "2026-10-07T18:14:33.537484+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2019"
  ],
  "id": "person-coverage-840bdb91860d5a::S1",
  "title": "Energy and Policy Considerations for Deep Learning in NLP",
  "url": "https://aclanthology.org/P19-1355/"
}

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Andrew McCallum’s individual research tasks.

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Andrew McCallum’s individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carlos Hernández

Carlos Hernández is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Carlos Hernández.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-081b3d9de267f9::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Carlos Hernández.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Carlos Hernández.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emilie Vestergaard

Emilie Vestergaard is a listed coauthor of a working paper studying early labor-market changes associated with AI chatbots in Denmark.

The study links adoption surveys to administrative labor records and uses difference-in-differences estimates to examine earnings and recorded hours at worker and workplace levels.

The revised abstract reports no detectable average earnings or hours effects within its study window, alongside task reorganization involving content generation, AI oversight, and integration.

Sources and details

Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI

{
  "access_scope": "This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Emilie Vestergaard’s individual division of labor.",
  "authors": [
    "Anders Humlum",
    "Emilie Vestergaard"
  ],
  "authors_in_source_order": [
    "Anders Humlum",
    "Emilie Vestergaard"
  ],
  "dates": {
    "citation_publication_date": "2025/05/12",
    "inspected_source_date_1": "May 2025 issue; March 2026 revision",
    "retrieved_utc": "2026-10-07T18:21:19.018471+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 2025 issue; March 2026 revision"
  ],
  "id": "person-local-emilievestergaard::S1",
  "title": "Still Waters, Rapid Currents: Early Labor Market Transformation under Generative AI",
  "url": "https://www.nber.org/papers/w33777"
}

This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Emilie Vestergaard’s individual division of labor.

This is NBER Working Paper 33777 as revised in March 2026, previously titled Large Language Models, Small Labor Market Effects; its Denmark findings do not establish future effects in every labor market or Emilie Vestergaard’s individual division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emma Strubell

Emma Strubell is a listed coauthor of a paper examining the resource costs of training deep-learning models for natural-language processing.

The authors estimate approximate financial and environmental costs across several then-recent models, connecting hardware, electricity, and cloud-compute expenses with training’s carbon footprint.

They use these estimates to propose ways to reduce costs and improve equity in NLP research and practice.

Sources and details

Energy and Policy Considerations for Deep Learning in NLP

{
  "access_scope": "The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Emma Strubell’s individual research tasks.",
  "authors": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "authors_in_source_order": [
    "Emma Strubell",
    "Ananya Ganesh",
    "Andrew McCallum"
  ],
  "dates": {
    "citation_publication_date": "2019/7",
    "inspected_source_date_1": "July 2019",
    "retrieved_utc": "2026-10-07T18:14:33.537484+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2019"
  ],
  "id": "person-coverage-ad5a01a3fbab75::S1",
  "title": "Energy and Policy Considerations for Deep Learning in NLP",
  "url": "https://aclanthology.org/P19-1355/"
}

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Emma Strubell’s individual research tasks.

The ACL 2019 paper estimates costs for the models studied at that time; its abstract does not establish current universal training costs or Emma Strubell’s individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Esther Aguado

Esther Aguado is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Esther Aguado.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-31942d3258e21f::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Esther Aguado.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Esther Aguado.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Florence Gabriel

Florence Gabriel is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Florence Gabriel’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-1ab2021a4a13c6::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Florence Gabriel’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Florence Gabriel’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Siemens

George Siemens is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify George Siemens’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-ab01caffdfd3ef::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify George Siemens’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify George Siemens’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kelsey Medeiros

Kelsey Medeiros is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Kelsey Medeiros’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-93d3936d273e85::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Kelsey Medeiros’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Kelsey Medeiros’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Li-Jia Li

Li-Jia Li is a listed coauthor of the paper introducing ImageNet as a hierarchical image database.

The database organizes images through WordNet’s semantic categories and uses human annotation, including an Amazon Mechanical Turk collection scheme, to control image quality.

The paper reports a snapshot of 3.2 million images across twelve subtrees, illustrating the scale of the database described in that source.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Li-Jia Li’s individual collection or annotation work.",
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "authors_in_source_order": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "inspected_source_date_1": "Historical original database paper snapshot; date not explicitly asserted from this cached credit block",
    "retrieved_utc": "2026-10-07T18:21:14.814808+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Historical original database paper snapshot; date not explicitly asserted from this cached credit block"
  ],
  "id": "person-local-lijiali::S1",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Li-Jia Li’s individual collection or annotation work.

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Li-Jia Li’s individual collection or annotation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maarten de Laat

Maarten de Laat is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Maarten de Laat’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-60f93190e9f350::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Maarten de Laat’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Maarten de Laat’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Manuel Rodriguez

Manuel Rodriguez is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Manuel Rodriguez.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-4a366f89ed23e9::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Manuel Rodriguez.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Manuel Rodriguez.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin Molina

Martin Molina is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Martin Molina.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-4d87d3af29f558::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Martin Molina.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Martin Molina.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maryam Ali

Maryam Ali is a listed coauthor of a qualitative comparison of US and Chinese approaches to military AI.

The study draws on secondary defense reports, academic literature, and think-tank material to compare the two countries’ technological strategies.

It contrasts US partnerships with civilian technology firms and China’s military-civil fusion approach while discussing escalation, strategic stability, and ethical concerns.

Sources and details

US China Technological Competition and The Use Of Artificial Intelligence in Military Applications

{
  "access_scope": "This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Maryam Ali particular research tasks.",
  "authors": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "authors_in_source_order": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "dates": {
    "inspected_source_date_1": "April–June 2026; volume 05 issue 02",
    "retrieved_utc": "2026-10-07T18:12:36.565378+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April–June 2026; volume 05 issue 02"
  ],
  "id": "person-coverage-4821a2778777f5::S1",
  "title": "US China Technological Competition and The Use Of Artificial Intelligence in Military Applications",
  "url": "https://assajournal.com/index.php/36/article/download/1873/2821"
}

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Maryam Ali particular research tasks.

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Maryam Ali particular research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miguel Fernández

Miguel Fernández is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Miguel Fernández.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-590bd0e91ba706::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Miguel Fernández.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Miguel Fernández.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Noor Fatima

Noor Fatima is a listed coauthor of a qualitative comparison of US and Chinese approaches to military AI.

The study draws on secondary defense reports, academic literature, and think-tank material to compare the two countries’ technological strategies.

It contrasts US partnerships with civilian technology firms and China’s military-civil fusion approach while discussing escalation, strategic stability, and ethical concerns.

Sources and details

US China Technological Competition and The Use Of Artificial Intelligence in Military Applications

{
  "access_scope": "This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Noor Fatima particular research tasks.",
  "authors": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "authors_in_source_order": [
    "Hamna Jamil",
    "Maryam Ali",
    "Noor Fatima"
  ],
  "dates": {
    "inspected_source_date_1": "April–June 2026; volume 05 issue 02",
    "retrieved_utc": "2026-10-07T18:12:36.565378+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April–June 2026; volume 05 issue 02"
  ],
  "id": "person-coverage-e2e39b7c9e1f85::S1",
  "title": "US China Technological Competition and The Use Of Artificial Intelligence in Military Applications",
  "url": "https://assajournal.com/index.php/36/article/download/1873/2821"
}

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Noor Fatima particular research tasks.

This 2026 comparative article interprets secondary sources; it does not independently verify military budgets or deployed capabilities, turn forecasts into outcomes, or assign Noor Fatima particular research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Parthasarathy Ranganathan

Parthasarathy Ranganathan is a listed coauthor of the third edition of a book treating a warehouse-scale datacenter as one integrated computer.

The book explains how hardware and software work together, connecting system architecture with design, operation, and cost through real-world examples.

Its 2018 revision adds discussion of machine-learning and public-cloud workloads, specialized accelerators, storage and networking, and power, cooling, and uptime.

Sources and details

The Datacenter as a Computer: designing warehouse-scale machines

{
  "access_scope": "The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Parthasarathy Ranganathan particular infrastructure components.",
  "authors": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "authors_in_source_order": [
    "Luiz André Barroso",
    "Urs Hölzle",
    "Parthasarathy Ranganathan"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "inspected_source_date_1": "2018; third edition",
    "retrieved_utc": "2026-10-07T18:12:09.258524+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2018; third edition"
  ],
  "id": "person-coverage-a17daabf30b221::S1",
  "title": "The Datacenter as a Computer: designing warehouse-scale machines",
  "url": "https://research.google/pubs/the-datacenter-as-a-computer-designing-warehouse-scale-machines/"
}

The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Parthasarathy Ranganathan particular infrastructure components.

The Google Research abstract describes the 2018 third-edition monograph; it does not establish current Google capacity or assign Parthasarathy Ranganathan particular infrastructure components.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rebecca Marrone

Rebecca Marrone is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Rebecca Marrone’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-be0ceb218f0ef4::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Rebecca Marrone’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Rebecca Marrone’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ricardo Sanz

Ricardo Sanz is a listed coauthor of CORESENSE’s initial theory-of-awareness proposal for autonomous systems.

The report connects the distribution of sensor-derived meanings with actionable causal models that an agent can adapt and use to understand its environment.

It organizes awareness by its object, representational depth, and class, distinguishing awareness of world states from awareness of value concerns.

Sources and details

D1.4 Theory of Awareness: An initial proposal

{
  "access_scope": "CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Ricardo Sanz.",
  "authors": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "authors_in_source_order": [
    "Ricardo Sanz",
    "Manuel Rodriguez",
    "Martin Molina",
    "Miguel Fernández",
    "Esther Aguado",
    "Alex Gabriel",
    "Carlos Hernández"
  ],
  "dates": {
    "inspected_source_date_1": "2025-04-08; CS-060-v1.0",
    "retrieved_utc": "2026-10-07T18:10:54.001258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-04-08; CS-060-v1.0"
  ],
  "id": "person-coverage-775b8a86cc6ef5::S1",
  "title": "D1.4 Theory of Awareness: An initial proposal",
  "url": "https://coresense.eu/wp-content/uploads/2025/05/CORESENSE_D1.4-Theory-of-Awareness.pdf"
}

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Ricardo Sanz.

CORESENSE deliverable D1.4, version 1.0, is an initial engineering theory proposal; it does not establish phenomenal consciousness or allocate particular mechanisms to Ricardo Sanz.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Socher

Richard Socher is a listed coauthor of the paper introducing ImageNet as a hierarchical image database.

The database organizes images through WordNet’s semantic categories and uses human annotation, including an Amazon Mechanical Turk collection scheme, to control image quality.

The paper reports a snapshot of 3.2 million images across twelve subtrees, illustrating the scale of the database described in that source.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Richard Socher’s individual collection or annotation work.",
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "authors_in_source_order": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "inspected_source_date_1": "Historical original database paper snapshot; date not explicitly asserted from this cached credit block",
    "retrieved_utc": "2026-10-07T18:21:14.814808+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Historical original database paper snapshot; date not explicitly asserted from this cached credit block"
  ],
  "id": "person-local-richardsocher::S1",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Richard Socher’s individual collection or annotation work.

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Richard Socher’s individual collection or annotation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rémi Paccou

Rémi Paccou is a listed coauthor of a system-dynamics report exploring possible futures for AI’s electricity demand.

The study combines bottom-up and top-down approaches using industry data, academic studies, and expert knowledge to connect AI growth with energy-system constraints.

It compares scenarios including Sustainable AI, Limits to Growth, Abundance without Boundaries, and Energy Crises to examine how efficiency, frugality, and infrastructure affect those futures.

Sources and details

Artificial Intelligence and Electricity: A System Dynamics Approach

{
  "access_scope": "The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Rémi Paccou’s individual modeling tasks.",
  "authors": [
    "Fons Wijnhoven",
    "Rémi Paccou"
  ],
  "authors_in_source_order": [
    "Fons Wijnhoven",
    "Rémi Paccou"
  ],
  "dates": {
    "citation_publication_date": "2024/12/04",
    "inspected_source_date_1": "2024-12-04",
    "retrieved_utc": "2026-10-07T18:14:53.376233+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-12-04"
  ],
  "id": "person-coverage-616566a5e9cfbb::S1",
  "title": "Artificial Intelligence and Electricity: A System Dynamics Approach",
  "url": "https://research.utwente.nl/en/publications/artificial-intelligence-and-electricity-a-system-dynamics-approac/"
}

The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Rémi Paccou’s individual modeling tasks.

The University of Twente record describes a 2024 Schneider Electric Sustainability Research Institute report and scenario analysis; projected futures are not observed outcomes or proof of Rémi Paccou’s individual modeling tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Srecko Joksimovic

Srecko Joksimovic is a listed coauthor of a framework for examining how human and artificial cognition can work together.

The paper takes a functional view of discrete cognitive tasks, comparing the strengths of human and artificial systems rather than relying on predictions about general machine intelligence.

It treats coordination, interaction, and handoffs between these systems as central questions for learning, sensemaking, and decision-making.

Sources and details

Human and artificial cognition

{
  "access_scope": "Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Srecko Joksimovic’s individual experimental contribution.",
  "authors": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "authors_in_source_order": [
    "George Siemens",
    "Fernando Marmolejo-Ramos",
    "Florence Gabriel",
    "Kelsey Medeiros",
    "Rebecca Marrone",
    "Srecko Joksimovic",
    "Maarten de Laat"
  ],
  "dates": {
    "inspected_source_date_1": "2022; accepted 2022-11-07; available online 2022-11-08",
    "retrieved_utc": "2026-10-07T18:12:09.608016+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022; accepted 2022-11-07; available online 2022-11-08"
  ],
  "id": "person-coverage-2ba66976298287::S1",
  "title": "Human and artificial cognition",
  "url": "https://researchnow-admin.flinders.edu.au/ws/portalfiles/portal/149015388/Siemens_Human_P2022.pdf"
}

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Srecko Joksimovic’s individual experimental contribution.

Human and artificial cognition proposes a framework and future research questions; it does not validate a clinical intervention or identify Srecko Joksimovic’s individual experimental contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Toni Erskine

Toni Erskine is a listed coauthor of an article introducing research on AI’s influence over decisions to begin war.

The article distinguishes automated self-defence from decision-support systems that inform human deliberation about the resort to force.

It sets out a multidisciplinary agenda for examining risks and benefits at this state-level decision stage, connecting anticipated adoption with competitive pressure to match other states’ capabilities.

Sources and details

AI and the decision to go to war: future risks and opportunities

{
  "access_scope": "The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Toni Erskine individual research tasks.",
  "authors": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "authors_in_source_order": [
    "Toni Erskine",
    "Steven E. Miller"
  ],
  "dates": {
    "citation_publication_date": "2024",
    "inspected_source_date_1": "2024; Australian Journal of International Affairs 78(2), 135–147",
    "retrieved_utc": "2026-10-07T18:11:16.684105+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024; Australian Journal of International Affairs 78(2), 135–147"
  ],
  "id": "person-coverage-68bd1c2b4b2af1::S1",
  "title": "AI and the decision to go to war: future risks and opportunities",
  "url": "https://researchportalplus.anu.edu.au/en/publications/ai-and-the-decision-to-go-to-war-future-risks-and-opportunities/"
}

The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Toni Erskine individual research tasks.

The 2024 special-issue introduction argues about anticipated developments; it does not validate a prediction, provide military advice, or assign Toni Erskine individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wei Dong

Wei Dong is a listed coauthor of the paper introducing ImageNet as a hierarchical image database.

The database organizes images through WordNet’s semantic categories and uses human annotation, including an Amazon Mechanical Turk collection scheme, to control image quality.

The paper reports a snapshot of 3.2 million images across twelve subtrees, illustrating the scale of the database described in that source.

Sources and details

ImageNet: A Large-Scale Hierarchical Image Database

{
  "access_scope": "The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Wei Dong’s individual collection or annotation work.",
  "authors": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "authors_in_source_order": [
    "Jia Deng",
    "Wei Dong",
    "Richard Socher",
    "Li-Jia Li",
    "Kai Li",
    "Li Fei-Fei"
  ],
  "dates": {
    "inspected_source_date_1": "Historical original database paper snapshot; date not explicitly asserted from this cached credit block",
    "retrieved_utc": "2026-10-07T18:21:14.814808+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Historical original database paper snapshot; date not explicitly asserted from this cached credit block"
  ],
  "id": "person-local-weidong::S1",
  "title": "ImageNet: A Large-Scale Hierarchical Image Database",
  "url": "https://www.image-net.org/static_files/papers/imagenet_cvpr09.pdf"
}

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Wei Dong’s individual collection or annotation work.

The original ImageNet paper’s database snapshot is distinct from later ImageNet competition datasets and neural-network results; coauthorship does not identify Wei Dong’s individual collection or annotation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

MEDVi official communication: clinical networks and marketing controls

In its February 20, 2026 warning letter to MEDVi, FDA described a December 2025 review of website claims about compounded semaglutide and tirzepatide.

The agency said labels suggesting MEDVi compounded the drugs were misleading because MEDVi was not their compounder.

FDA also said comparisons with branded products implied approval or evaluation that the compounded products had not received, and requested a written response describing corrective steps.

Sources and details

MEDVi, LLC dba MEDVi — FDA Warning Letter

{
  "access_scope": "Historical dated agency findings and requested response only; no legal or medical guidance, no inference of subsequent compliance. Original hold retained; FDA signatory is not assumed sole writer.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": "Tue, 03/03/2026 - 00:00",
    "article:published_time": "Tue, 04/14/2026 - 11:34",
    "content_current_as_of": "03/03/2026",
    "letter_date": "February 20, 2026",
    "retrieved_utc": "2026-10-07T18:25:01.204785+00:00",
    "website_review_period": "December 2025"
  },
  "id": "work-focused-87f628c9f17292::S1",
  "title": "MEDVi, LLC dba MEDVi — FDA Warning Letter",
  "url": "https://www.fda.gov/inspections-compliance-enforcement-and-criminal-investigations/warning-letters/medvi-llc-dba-medvi-721455-02202026"
}

Historical dated agency findings and requested response only; no legal or medical guidance, no inference of subsequent compliance. Original hold retained; FDA signatory is not assumed sole writer.

Historical dated agency findings and requested response only; no legal or medical guidance, no inference of subsequent compliance. Original hold retained; FDA signatory is not assumed sole writer.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Source publication date",
  "dated": true,
  "year": "2026-04-08"
}

BenevolentAI

In its October 2024 release, BenevolentAI describes a platform combining AI and scientific work to uncover biology, predict drug targets, and develop candidate medicines.

The company says it pairs those tools with in-house scientific expertise and wet-lab facilities.

Its stated business model includes discovery collaborations with pharmaceutical companies and advancing its own pipeline to development inflection points.

Sources and details

BenevolentAI Appoints Kenneth Mulvany as Executive Chairman

{
  "access_scope": "Company platform and business-model description in dated leadership release; validation and patient-benefit claims not independently established; no drug-approval attribution from promotional quote.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:32.497186+00:00",
    "visible_release": "17 October 2024"
  },
  "id": "organization-company-803b7dd9a18436::S1",
  "title": "BenevolentAI Appoints Kenneth Mulvany as Executive Chairman",
  "url": "https://www.benevolent.com/news-and-media/press-releases-and-in-media/benevolentai-appoints-kenneth-mulvany-executive-chairman/"
}

Company platform and business-model description in dated leadership release; validation and patient-benefit claims not independently established; no drug-approval attribution from promotional quote.

Company platform and business-model description in dated leadership release; validation and patient-benefit claims not independently established; no drug-approval attribution from promotional quote.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "2013 founding of operating business; subsequent listed holding-company and 2025 successor-entity reorganizations are not a new business founding.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.benevolent.com/news-and-media/press-releases-and-in-media/benevolentai-appoints-kenneth-mulvany-executive-chairman/",
        "https://www.benevolent.com/download_file/view/1355/",
        "https://www.benevolent.com/news-and-media/press-releases-and-in-media/egm-results-announcement/"
      ],
      "year": 2013
    }
  ]
}

Coveo

Coveo’s July 2026 release describes Merchandising Copilot as an agentic assistant embedded in its Merchandising Hub.

Merchandisers can use natural-language questions to inspect their setup and metrics, while the assistant prepares suggested configuration changes for product discovery.

The release reports five production customers for conversational search and distinguishes that deployment from customers still onboarding or evaluating conversational product discovery.

Sources and details

Coveo Reports First Quarter Fiscal 2027 Financial Results

{
  "access_scope": "Vendor-reported features and deployments at July 2026 release; fiscal 2027 quarter/date distinction preserved, suggestions not assumed autonomously installed; no independent relevance/security/outcome validation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "quarter_ended": "June 30, 2026",
    "release": "July 30, 2026 4:00pm EDT",
    "retrieved_utc": "2026-10-07T17:59:54.353465+00:00"
  },
  "id": "organization-company-bc3629d90d31b6::S1",
  "title": "Coveo Reports First Quarter Fiscal 2027 Financial Results",
  "url": "https://ir.coveo.com/en/news-events/press-releases/detail/491/coveo-reports-first-quarter-fiscal-2027-financial-results"
}

Vendor-reported features and deployments at July 2026 release; fiscal 2027 quarter/date distinction preserved, suggestions not assumed autonomously installed; no independent relevance/security/outcome validation.

Vendor-reported features and deployments at July 2026 release; fiscal 2027 quarter/date distinction preserved, suggestions not assumed autonomously installed; no independent relevance/security/outcome validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company spin-out from Copernic in 2005. The management biographies also date some executive service to 2004; 2005 is the explicitly stated spin-out/founding milestone, not a verified incorporation date.",
      "date": "2005",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://source.coveo.com/2019/08/08/coveo-camp-aka-duchesnay-2019/",
        "https://ir.coveo.com/en/corporate-governance/management-team",
        "https://ir.coveo.com/en/news-events/press-releases/detail/491/coveo-reports-first-quarter-fiscal-2027-financial-results"
      ],
      "year": 2005
    }
  ]
}

Cybereason

LevelBlue’s November 2025 release reports completion of its acquisition of Cybereason and describes combining endpoint detection, managed response, and digital forensics.

It presents Cybereason’s XDR platform as complementary to Trustwave’s managed-detection service and LevelBlue’s own MDR offering.

The release also describes bringing Cybereason research together with SpiderLabs and combining AI-based investigation with human response expertise.

Sources and details

LevelBlue Completes Acquisition of Cybereason, Expanding Global Leadership in Managed Detection and Response, XDR, and Incident Response

{
  "access_scope": "Acquirer/vendor report; Cybereason, LevelBlue, Trustwave and SpiderLabs roles remain distinct. Claimed improvements in security/false positives not independently validated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "November 25, 2025",
    "retrieved_utc": "2026-10-07T18:02:35.148807+00:00"
  },
  "id": "organization-company-eb79100aa5db8b::S1",
  "title": "LevelBlue Completes Acquisition of Cybereason, Expanding Global Leadership in Managed Detection and Response, XDR, and Incident Response",
  "url": "https://www.cybereason.com/press/levelblue-acquires-cybereason"
}

Acquirer/vendor report; Cybereason, LevelBlue, Trustwave and SpiderLabs roles remain distinct. Claimed improvements in security/false positives not independently validated.

Acquirer/vendor report; Cybereason, LevelBlue, Trustwave and SpiderLabs roles remain distinct. Claimed improvements in security/false positives not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.cybereason.com/press/cybereasons-newest-customer-is-premier-foods-of-great-britain",
        "https://www.cybereason.com/press/levelblue-acquires-cybereason"
      ],
      "year": 2012
    }
  ]
}

Evisort

M12’s Todd Graham described Evisort in December 2019 as a contract-intelligence system using natural-language processing for legal and procurement teams.

The account says users can upload contracts and extract parties, amounts, expiration dates, and more than fifty categories of legal clauses.

It describes integration with existing file repositories and reporting for post-signature contract management, while M12’s financing participation remains separate from building the product.

Sources and details

Welcoming Evisort to the M12 portfolio

{
  "access_scope": "Substantive investor primary account, not generic company listing; historical product claims attributed to Todd Graham, not independently validated extraction accuracy or legal advice.",
  "authors": [
    "Todd Graham"
  ],
  "authors_in_source_order": [
    "Todd Graham"
  ],
  "dates": {
    "article:modified_time": "2026-09-14T13:59:38+00:00",
    "article:published_time": "2019-12-19T21:40:00+00:00",
    "retrieved_utc": "2026-10-07T18:00:06.425249+00:00",
    "visible_publication": "December 19, 2019"
  },
  "id": "organization-company-3f5977397654c5::S1",
  "title": "Welcoming Evisort to the M12 portfolio",
  "url": "https://m12.vc/news/welcoming-evisort-to-the-m12-portfolio/"
}

Substantive investor primary account, not generic company listing; historical product claims attributed to Todd Graham, not independently validated extraction accuracy or legal advice.

Substantive investor primary account, not generic company listing; historical product claims attributed to Todd Graham, not independently validated extraction accuracy or legal advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder interview and investor account date founding to 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://mitsloan.mit.edu/ideas-made-to-matter/3-mit-sloan-make-forbes-30-under-30",
        "https://m12.vc/news/welcoming-evisort-to-the-m12-portfolio/",
        "https://blog.workday.com/en-us/evisort-qa-jerry-ting.html"
      ],
      "year": 2016
    }
  ]
}

Foxconn Industrial Internet

Hon Hai’s January 2026 release describes Foxconn Industrial Internet’s Bac Ninh plant using a generative-AI campus platform to connect production, operations, energy management, carbon tracking, and EHS systems.

The account says supplier carbon reporting and automated verification support a separate carbon-management platform made available to suppliers.

It reports WEF Sustainable Lighthouse recognition and emissions reductions of 22 percent for Scope 3 and 34 percent combined for Scopes 1 and 2, as figures stated in the company’s account.

Sources and details

Hon Hai Technology Group (Foxconn) Achieves 2nd WEF Sustainable Lighthouse Factory, Raising Benchmark In Vietnam

{
  "access_scope": "Corporate report and quoted WEF account; company subsidiary/factory roles distinct, no independent attribution of all reductions solely to AI. HeaderJanuary 16 and datelineJanuary 15 retained separately.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_header": "2026/01/16",
    "release_dateline": "15 January 2026",
    "retrieved_utc": "2026-10-07T18:23:28.126676+00:00"
  },
  "id": "supply-org-029::S1",
  "title": "Hon Hai Technology Group (Foxconn) Achieves 2nd WEF Sustainable Lighthouse Factory, Raising Benchmark In Vietnam",
  "url": "https://www.honhai.com/en-us/press-center/press-releases/latest-news/1953"
}

Corporate report and quoted WEF account; company subsidiary/factory roles distinct, no independent attribution of all reductions solely to AI. HeaderJanuary 16 and datelineJanuary 15 retained separately.

Corporate report and quoted WEF account; company subsidiary/factory roles distinct, no independent attribution of all reductions solely to AI. HeaderJanuary 16 and datelineJanuary 15 retained separately.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Mad Street Den

Vue.ai’s cached About Us page identifies Mad Street Den as its holding company and describes Vue.ai as an AI orchestration platform for technical and business teams.

Its product description proposes connecting applications and data through one Data 360 layer for field, IT, and analytics work.

The page markets a 30:60:90 adoption program aimed at an initial return-on-investment result within ninety days; that timing is a vendor promise rather than a measured outcome.

Sources and details

About Us — Vue.ai

{
  "access_scope": "Undated cached corporate description; Mad Street Den holding-company role and Vue.ai product role preserved; marketing ROI promise attributed, no independent proof.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:39.101773+00:00"
  },
  "id": "organization-company-80ce2413f2038f::S1",
  "title": "About Us — Vue.ai",
  "url": "https://www.vue.ai/about-us/"
}

Undated cached corporate description; Mad Street Den holding-company role and Vue.ai product role preserved; marketing ROI promise attributed, no independent proof.

Undated cached corporate description; Mad Street Den holding-company role and Vue.ai product role preserved; marketing ROI promise attributed, no independent proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Mad Street Den company launch is dated 2013 by Invest India; Vue.ai product launch was 2016.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.vue.ai/about-us/",
        "https://www.vue.ai/privacy-policy/",
        "https://static.investindia.gov.in/s3fs-public/2022-11/100%20Women%20Entrepreneurs%20Building%20%26%20Shaping%20India.pdf",
        "https://www.m2pfintech.com/our-story/"
      ],
      "year": 2013
    }
  ]
}

Megvii

Megvii’s October 2022 account of a NetEase Weekly interview presents logistics and warehousing as a core supply-chain IoT area.

It describes algorithm-defined hardware as obtaining different capabilities from a physical system through software, with hardware and software working together.

The company identifies its 3A solution as combining automated storage and retrieval, autonomous mobile robots, and AI, while throughput, flexibility, latency, and cost are stated design priorities.

Sources and details

NetEase Weekly | Tang Wenbing: Providing customers with optimal ROI products and solutions

{
  "access_scope": "Company-hosted interview summary; titleWenbing/bodyWenbin spellings retained as source variation, named interviewee not assumed document writer; ROI and deployment reach claims not independently verified.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:59:08.048734+00:00",
    "visible_date": "2022 - Oct - 20"
  },
  "id": "organization-company-6912830e5736ba::S1",
  "title": "NetEase Weekly | Tang Wenbing: Providing customers with optimal ROI products and solutions",
  "url": "https://en-robotics.megvii.com/Megvii-News/Providing-customers-with-optimal-ROI-products-and-solutions.html"
}

Company-hosted interview summary; titleWenbing/bodyWenbin spellings retained as source variation, named interviewee not assumed document writer; ROI and deployment reach claims not independently verified.

Company-hosted interview summary; titleWenbing/bodyWenbin spellings retained as source variation, named interviewee not assumed document writer; ROI and deployment reach claims not independently verified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Operating company Beijing Megvii founded October 2011; offshore Megvii Technology Limited established January 2013. Both milestones explicitly distinguished in issuer prospectus.",
      "date": "2011",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.megvii.com/",
        "https://www.cs.tsinghua.edu.cn/fujian/AlumniExpress0010.pdf",
        "https://en-robotics.megvii.com/Megvii-News/Providing-customers-with-optimal-ROI-products-and-solutions.html",
        "https://static.sse.com.cn/stock/disclosure/announcement/c/202109/000858_20210930_O0UC.pdf",
        "https://cdn-en-re.megvii.com/info-167.html",
        "https://www.tsinghua.edu.cn/info/1182/43116.htm"
      ],
      "year": 2011
    }
  ]
}

Motivair

Schneider Electric’s February 2025 release describes Motivair as a supplier of liquid-cooling and advanced thermal-management solutions for high-performance computing.

It reports completion of an initial 75 percent controlling-interest acquisition following an October 2024 agreement.

The release says Motivair will be reported within Schneider Electric’s Energy Management business and separately states an expectation to acquire the remaining 25 percent in 2028.

Sources and details

Schneider Electric completes transaction to acquire Motivair Corporation

{
  "access_scope": "Dated acquirer report; completed initial stake and future expectation distinct, no inference future acquisition completed. Motivair and Schneider Electric not merged as canonical organizations.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "prior_agreement": "October 16, 2024",
    "release_dateline": "February 28, 2025",
    "remaining_interest_expectation": "2028",
    "retrieved_utc": "2026-10-07T18:23:33.732963+00:00"
  },
  "id": "supply-org-043::S1",
  "title": "Schneider Electric completes transaction to acquire Motivair Corporation",
  "url": "https://www.se.com/ww/en/assets/564/document/506659/Schneider%20Electric-completes-acquisition-of-Motivair-Corporation.pdf"
}

Dated acquirer report; completed initial stake and future expectation distinct, no inference future acquisition completed. Motivair and Schneider Electric not merged as canonical organizations.

Dated acquirer report; completed initial stake and future expectation distinct, no inference future acquisition completed. Motivair and Schneider Electric not merged as canonical organizations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

NEAR Protocol

NEAR’s cached site describes an infrastructure stack joining cross-chain execution, confidential settlement, private inference, and an agent harness.

It presents NEAR Intents as a cross-chain execution service and near.com as an interface for trading assets from one account.

The NEAR AI description says IronClaw sandboxes tools and isolates credentials in hardware-enforced trusted execution environments; these are the vendor’s stated security mechanisms.

Sources and details

NEAR — The currency of agents

{
  "access_scope": "Undated evolving product page; protocol, token, interface, Intents and AI roles distinct. No independently verified security, throughput, uptime, token performance or financial advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:35.330979+00:00"
  },
  "id": "organization-ai-3c21f3f736a159::S1",
  "title": "NEAR — The currency of agents",
  "url": "https://www.near.org/"
}

Undated evolving product page; protocol, token, interface, Intents and AI roles distinct. No independently verified security, throughput, uptime, token performance or financial advice.

Undated evolving product page; protocol, token, interface, Intents and AI roles distinct. No independently verified security, throughput, uptime, token performance or financial advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Pony.ai

Pony.ai’s corporate history describes its origins in Fremont in late 2016 and its development of public-facing autonomous-mobility services in the US and China.

The timeline distinguishes its April 2025 seventh-generation robotaxi mass-production target from a July 2025 entry reporting the beginning of production and road testing.

It also lists a November 2025 fourth-generation autonomous-truck announcement with production and deployment planned for 2026, preserving the difference between a plan and a completed rollout.

Sources and details

Our Story — Pony.ai

{
  "access_scope": "Vendor historical timeline; dated entries and plans only, no independent safety/deployment audit or claim targets were all met.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:15.857799+00:00",
    "selected_milestone_periods": [
      "April 2025",
      "July 2025",
      "November 2025"
    ],
    "visible_founding_period": "late 2016"
  },
  "id": "organization-company-e80d4cccf01349::S1",
  "title": "Our Story — Pony.ai",
  "url": "https://pony.ai/story"
}

Vendor historical timeline; dated entries and plans only, no independent safety/deployment audit or claim targets were all met.

Vendor historical timeline; dated entries and plans only, no independent safety/deployment audit or claim targets were all met.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official timeline dates founding in Fremont to December 2016.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://pony.ai/story",
        "https://www.sec.gov/Archives/edgar/data/1969302/000110465926046406/pony-20251231x20f.htm"
      ],
      "year": 2016
    }
  ]
}

Salesforce

Salesforce’s corporate history describes customer-relationship software developed by the company’s four founders after incorporation in March 1999.

Its timeline records the February 2000 service launch and the September 2005 introduction of AppExchange as a place for third-party developers to offer applications to Salesforce customers.

The account also describes V2MOM—Vision, Values, Methods, Obstacles, and Measures—as an internal planning framework used to align employees around shared goals.

Sources and details

The History of Salesforce

{
  "access_scope": "Historical company account; original hold preserved. Editor noteJanuary 2025 differs from HTMLmodifiedDecember 16, 2025; both retained, no silently unified date or current ownership inference.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": "2025-12-16T22:24:40+00:00",
    "article:published_time": "2020-03-19T15:50:40+00:00",
    "editor_note_last_updated": "January 2025",
    "retrieved_utc": "2026-10-07T17:58:41.416625+00:00"
  },
  "id": "organization-ai-33a7935db79df2::S1",
  "title": "The History of Salesforce",
  "url": "https://www.salesforce.com/news/stories/the-history-of-salesforce/"
}

Historical company account; original hold preserved. Editor noteJanuary 2025 differs from HTMLmodifiedDecember 16, 2025; both retained, no silently unified date or current ownership inference.

Historical company account; original hold preserved. Editor noteJanuary 2025 differs from HTMLmodifiedDecember 16, 2025; both retained, no silently unified date or current ownership inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Incorporated March 8, 1999.",
      "date": "1999",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.salesforce.com/news/stories/the-history-of-salesforce/",
        "https://www.salesforce.com/news/stories/salesforces-20th-anniversary-celebrating-two-decades-of-our-ohana/"
      ],
      "year": 1999
    }
  ]
}

SenseTime

SenseTime’s account of Xu Bing’s FinTech Week remarks describes SenseCore infrastructure as the basis for cloud services supporting model training and inference.

It reports a Cantonese SenseChat assistant based on SenseNova offered free to Hong Kong users and separately describes SenseAuto investment in autonomous-driving and road infrastructure.

The account says startups receive computing resources and model capabilities through its AI cloud services, while broader adoption and market-growth statements remain forecasts.

Sources and details

Xu Bing, Co-founder of SenseTime: Ignoring AI Infrastructure Investment Poses Greater Risks than Taking Action

{
  "access_scope": "Attributed executive remarks in company article; speaker is not assumed writer; SenseCore, SenseNova, SenseChat and SenseAuto roles distinct, AGI and growth projections not established outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": "2026-07-24T13:58:49.917Z",
    "article:published_time": "2024-10-31T18:00:00.000Z",
    "html_datetime": "2024-10-31T18:00:00.000Z",
    "retrieved_utc": "2026-10-07T17:57:59.177174+00:00"
  },
  "id": "organization-company-279dadd16ca27e::S1",
  "title": "Xu Bing, Co-founder of SenseTime: Ignoring AI Infrastructure Investment Poses Greater Risks than Taking Action",
  "url": "https://sensetime.com/en/news/51169161"
}

Attributed executive remarks in company article; speaker is not assumed writer; SenseCore, SenseNova, SenseChat and SenseAuto roles distinct, AGI and growth projections not established outcomes.

Attributed executive remarks in company article; speaker is not assumed writer; SenseCore, SenseNova, SenseChat and SenseAuto roles distinct, AGI and growth projections not established outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Issuer's 2025 ESG report, published April 2026, explicitly says founded in October 2014; distinguish from later holding-company reorganizations.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.sensetime.com/en/investor_corp_governance",
        "https://www1.hkexnews.hk/listedco/listconews/sehk/2026/0427/2026042700736.pdf",
        "https://sensetime.com/en/news/3911",
        "https://sensetime.com/en/news/51169161"
      ],
      "year": 2014
    }
  ]
}

Skydio

Skydio’s About page connects its autonomous-flight work to drones, AI, and computer vision, tracing the founders’ shared MIT work to 2009.

The company’s history places its founding in 2014 and the R1 consumer-drone launch in 2018.

It states that its aircraft are designed, assembled, and supported in the United States and that its software is built by US-based full-time employees.

Sources and details

About Skydio

{
  "access_scope": "Undated company description with dated historical milestones; manufacturing/software statements attributed, no independent national-security, safety, or superiority certification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:31.394780+00:00"
  },
  "id": "organization-company-c7018229f702ce::S1",
  "title": "About Skydio",
  "url": "https://www.skydio.com/ja-jp/about?chat=sales"
}

Undated company description with dated historical milestones; manufacturing/software statements attributed, no independent national-security, safety, or superiority certification.

Undated company description with dated historical milestones; manufacturing/software statements attributed, no independent national-security, safety, or superiority certification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company history dates founding to 2014 and first product R1 launch to 2018.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.accel.com/companies/skydio",
        "https://www.skydio.com/ja-jp/about?chat=sales"
      ],
      "year": 2014
    }
  ]
}

SUMCO

SUMCO’s cached corporate site describes its business as manufacturing silicon wafers used to make semiconductors.

Its product and sustainability descriptions link wafer technology and stable supply to the development of semiconductor devices.

The page reports 9,714 employees across thirty locations in eight countries as of December 31, 2025, keeping those scale figures dated rather than treating them as a current census.

Sources and details

SUMCO Corporation — Official website

{
  "access_scope": "Primary corporate description; product role and dated company scale only, no invented AI-chip manufacturing role or independent market-share ranking.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:35.711093+00:00",
    "statistics_as_of": "December 31, 2025"
  },
  "id": "supply-org-046::S1",
  "title": "SUMCO Corporation — Official website",
  "url": "https://www.sumcosi.com/english/"
}

Primary corporate description; product role and dated company scale only, no invented AI-chip manufacturing role or independent market-share ranking.

Primary corporate description; product role and dated company scale only, no invented AI-chip manufacturing role or independent market-share ranking.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Superhuman

Grammarly’s support article says its October 2025 Superhuman announcement brought together Go, Grammarly, Coda, and Mail in an AI productivity suite.

It distinguishes writing assistance, document-and-workflow collaboration, email management, and a cross-application assistant as separate product roles.

For users choosing the Go browser-extension experience, it says generative features move to Go while writing underlines remain and detection agents can be opened in the sidebar.

Sources and details

What is Superhuman?

{
  "access_scope": "Dated vendor product/support account; company-name announcement does not authorize canonical identity merge. Product bundle and optional extension switch distinct; availability reflects source version.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement_date": "October 29, 2025",
    "retrieved_utc": "2026-10-07T18:00:22.115713+00:00"
  },
  "id": "organization-company-83a622850e8c65::S1",
  "title": "What is Superhuman?",
  "url": "https://support.grammarly.com/hc/en-us/articles/40707200788493-What-is-Superhuman"
}

Dated vendor product/support account; company-name announcement does not authorize canonical identity merge. Product bundle and optional extension switch distinct; availability reflects source version.

Dated vendor product/support account; company-name announcement does not authorize canonical identity merge. Product bundle and optional extension switch distinct; availability reflects source version.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Original Grammarly company founded 2009; became Superhuman October 29, 2025.",
      "date": "2009",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.grammarly.com/about",
        "https://support.grammarly.com/hc/en-us/articles/40707200788493-What-is-Superhuman",
        "https://superhuman.com/company/about"
      ],
      "year": 2009
    }
  ]
}

SymphonyAI

SymphonyAI’s careers page describes vertical AI work including retail demand forecasting and shelf intelligence.

It separately identifies financial-crime detection and trading intelligence, industrial predictive maintenance and asset intelligence, and enterprise IT service-management products.

The page presents predictive and generative AI as tools for industry-specific workflows, making the application domains more concrete than a general claim to build AI.

Sources and details

Careers in AI — SymphonyAI

{
  "access_scope": "Undated primary careers/product description, no independent customer-outcome validation; five-vertical numeric claim not harmonized with only four named application sections.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:32.578273+00:00"
  },
  "id": "organization-company-7205cad15e3ea0::S1",
  "title": "Careers in AI — SymphonyAI",
  "url": "https://www.symphonyai.com/careers"
}

Undated primary careers/product description, no independent customer-outcome validation; five-vertical numeric claim not harmonized with only four named application sections.

Undated primary careers/product description, no independent customer-outcome validation; five-vertical numeric claim not harmonized with only four named application sections.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.symphonyai.com/leadership",
        "https://www.symphonyai.com/careers"
      ],
      "year": 2017
    }
  ]
}

Truva AI

Truva’s founder launch post on Y Combinator describes sales agents that collect information from meetings, emails, in-person conversations, and voice notes.

The described workflow extracts sales insights, maps data into CRM fields, and keeps records updated rather than requiring manual entry.

It identifies next steps and drafts personalized follow-up emails from meeting details, with alerts and automated task creation supporting the sales workflow.

Sources and details

Truva — Y Combinator company profile and launch post

{
  "access_scope": "Founder product account hosted by accelerator; undated launch prose separate from Summer 2022batch and acquired-status metadata. No independently verified sales-uplift or CRM accuracy claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "batch": "Summer 2022",
    "retrieved_utc": "2026-10-07T18:01:41.629438+00:00"
  },
  "id": "organization-company-73f6ef0179d968::S1",
  "title": "Truva — Y Combinator company profile and launch post",
  "url": "https://www.ycombinator.com/companies/truva"
}

Founder product account hosted by accelerator; undated launch prose separate from Summer 2022batch and acquired-status metadata. No independently verified sales-uplift or CRM accuracy claim.

Founder product account hosted by accelerator; undated launch prose separate from Summer 2022batch and acquired-status metadata. No independently verified sales-uplift or CRM accuracy claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Primary investor portfolio states 2022.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.ycombinator.com/companies/truva",
        "https://www.linkedin.com/posts/gaurava91_truva-salesforce-agentforce-activity-7346625705864044544-t1YS"
      ],
      "year": 2022
    }
  ]
}

Vultr

Vultr’s financing account reports an equity round led by LuminArx and AMD Ventures at a 3.5 billion-dollar valuation.

The company describes a cloud-infrastructure footprint of thirty-two data-center regions across six continents and says the funding is intended to expand its AI infrastructure and GPU fleet.

The account cites a Vultr-commissioned forecast of AI workloads moving beyond training into edge environments during 2025, preserving that statement as a forecast rather than an observed result.

Sources and details

Vultr Secures $3.5 Billion Valuation in Financing from LuminArx and AMD Ventures

{
  "access_scope": "Vendor financing/product account; valuation is not amount raised, commissioned forecast and planned expansion not completed outcomes; published 2024/modified 2026 metadata retained separately.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": "2026-08-07T22:41:44.761808",
    "article:published_time": "2024-12-18T15:20:23.909000",
    "retrieved_utc": "2026-10-07T17:58:57.154676+00:00"
  },
  "id": "organization-company-cbdfdc8fd290d8::S1",
  "title": "Vultr Secures $3.5 Billion Valuation in Financing from LuminArx and AMD Ventures",
  "url": "https://blogs.vultr.com/financing2024"
}

Vendor financing/product account; valuation is not amount raised, commissioned forecast and planned expansion not completed outcomes; published 2024/modified 2026 metadata retained separately.

Vendor financing/product account; valuation is not amount raised, commissioned forecast and planned expansion not completed outcomes; published 2024/modified 2026 metadata retained separately.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company funding announcement explicitly dates founding to 2014.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://blogs.vultr.com/financing2024"
      ],
      "year": 2014
    }
  ]
}

True Names

Macmillan describes True Names as Vernor Vinge’s novella, first published in 1981, presenting a developed concept of cyberspace.

The publisher distinguishes that story from the 2001 collection True Names and the Opening of the Cyberspace Frontier, which also gathers articles by computer scientists.

Its 2015 first ebook edition adds editor James Frenkel’s preface and pieces by Bruce Schneier on information security and Richard Stallman on privacy.

Sources and details

True Names and the Opening of the Cyberspace Frontier

{
  "access_scope": "Publisher description of novella and later collection; no full novella audit, no excerpt writer inferred from product author field; original publication, collection and ebook dates remain separate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ebook_on_sale": "04/28/2015",
    "original_novella": "1981",
    "paperback_collection": "2001",
    "retrieved_utc": "2026-10-07T18:22:39.404217+00:00"
  },
  "id": "work-culture-8ae8f159a8173f::S1",
  "title": "True Names and the Opening of the Cyberspace Frontier",
  "url": "https://us.macmillan.com/books/9781466893191/truenamesandtheopeningofthecyberspacefrontier/"
}

Publisher description of novella and later collection; no full novella audit, no excerpt writer inferred from product author field; original publication, collection and ebook dates remain separate.

Publisher description of novella and later collection; no full novella audit, no excerpt writer inferred from product author field; original publication, collection and ebook dates remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publisher explicitly says novella first published 1981; essay anthology 2001 is later.",
  "dated": true,
  "year": 1981
}

Person of Interest

CBS’s October 2011 announcement reports a full-season order for Person of Interest after its debut as one of the network’s leading new dramas.

The release credits Jim Caviezel, Michael Emerson, Taraji P. Henson and Kevin Chapman as its stars.

It names J.J. Abrams, Bryan Burk, Jonathan Nolan and Greg Plageman as executive producers for Bonanza Productions, with Bad Robot Productions and Warner Bros. Television.

Sources and details

Paramount Press Express | CBS GIVES FULL SEASON ORDERS TO TELEVISION'S #1 AND #2 NEW DRAMAS—"UNFORGETTABLE" AND "PERSON OF INTEREST"

{
  "access_scope": "Dated network production and commissioning account; cast and executive producers are separate roles; no episode premise, writing or AI-system mechanism inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "10/25/2011",
    "retrieved_utc": "2026-10-07T18:13:42.821628+00:00"
  },
  "id": "work-culture-850570315c65e0::S1",
  "title": "Paramount Press Express | CBS GIVES FULL SEASON ORDERS TO TELEVISION'S #1 AND #2 NEW DRAMAS—\"UNFORGETTABLE\" AND \"PERSON OF INTEREST\"",
  "url": "https://www.paramountpressexpress.com/cbs-entertainment/releases/?view=29603"
}

Dated network production and commissioning account; cast and executive producers are separate roles; no episode premise, writing or AI-system mechanism inferred.

Dated network production and commissioning account; cast and executive producers are separate roles; no episode premise, writing or AI-system mechanism inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Paley archive records series premiere September 22, 2011 and series run 2011–2016.",
  "dated": true,
  "year": 2011
}

Gamma

In a16z’s November 2025 investment announcement, Sarah Wang, Stephenie Zhang and Olivia Moore describe Gamma as turning written ideas into web-based presentations with AI-managed layout and visual hierarchy.

They report that the same interface supports documents, websites and social posts, while an API connects generation to workflows such as CRM or spreadsheet triggers.

The authors explain its distribution through shareable web links and identify Grant Lee, Jon Noronha and James Fox as founders who met at Optimizely.

Sources and details

Investing in Gamma | Andreessen Horowitz

{
  "access_scope": "Dated investor account of portfolio product and founders; capabilities and distribution attributed to authors, promotional superiority and revenue claims not independently validated.",
  "authors": [
    "Sarah Wang",
    "Stephenie Zhang",
    "Olivia Moore"
  ],
  "authors_in_source_order": [
    "Sarah Wang",
    "Stephenie Zhang",
    "Olivia Moore"
  ],
  "dates": {
    "posted": "November 10, 2025",
    "retrieved_utc": "2026-10-07T17:58:51.111441+00:00"
  },
  "id": "organization-company-a8ab3d5805c921::S1",
  "title": "Investing in Gamma | Andreessen Horowitz",
  "url": "https://a16z.com/announcement/investing-in-gamma/"
}

Dated investor account of portfolio product and founders; capabilities and distribution attributed to authors, promotional superiority and revenue claims not independently validated.

Dated investor account of portfolio product and founders; capabilities and distribution attributed to authors, promotional superiority and revenue claims not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder company post dated November 10, 2025 says the three started Gamma five years earlier; incorporation date not separately verified.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://gamma.app/insights/how-we-built-a-usd100m-business-differently",
        "https://a16z.com/announcement/investing-in-gamma/",
        "https://www.accel.com/companies/gamma"
      ],
      "year": 2020
    }
  ]
}

Tenstorrent

Tenstorrent’s April 2023 announcement describes an AI computing company bringing together computer architecture, ASIC design, systems and neural-network compiler expertise.

The release says Raja M. Koduri joined its board after leaving Intel, where his work spanned CPU, GPU and AI architectures.

It also reports that co-founder and CTO Ljubisa Bajic was stepping back from full-time work into an advisory role, distinguishing that transition from Jim Keller’s CEO position.

Sources and details

Raja Koduri joins Tenstorrent’s Board of Directors; CTO Ljubisa Bajic scales back his role | Tenstorrent

{
  "access_scope": "Company account at April 2023 announcement; historical board and executive roles are not current-role assertions, individual technical ownership or later product shipment not inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "April 7, 2023",
    "retrieved_utc": "2026-10-07T18:23:20.577449+00:00"
  },
  "id": "supply-org-009::S1",
  "title": "Raja Koduri joins Tenstorrent’s Board of Directors; CTO Ljubisa Bajic scales back his role | Tenstorrent",
  "url": "https://tenstorrent.com/newsroom/raja-koduri-joins-tenstorrents-board-of-directors-cto-ljubisa-bajic-scales-back-his-role"
}

Company account at April 2023 announcement; historical board and executive roles are not current-role assertions, individual technical ownership or later product shipment not inferred.

Company account at April 2023 announcement; historical board and executive roles are not current-role assertions, individual technical ownership or later product shipment not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://tenstorrent.com/newsroom/raja-koduri-joins-tenstorrents-board-of-directors-cto-ljubisa-bajic-scales-back-his-role"
      ],
      "year": 2016
    }
  ]
}

Andy Jassy

In his 2023 shareholder letter, published in April 2024, Andy Jassy describes Amazon’s generative-AI strategy as services for builders alongside its cloud infrastructure.

He reports that Amazon Bedrock lets companies use existing foundation models, while SageMaker gained tools for developers building new models.

The letter also identifies Trainium2 training chips and Amazon Q’s coding assistance as parts of this offering, keeping announced capabilities separate from independently measured outcomes.

Sources and details

Amazon CEO Andy Jassy’s 2023 Letter to Shareholders

{
  "access_scope": "Named CEO shareholder letter; 2023 reporting year and April 2024 publication distinguished; company claims attributed, appended 1997 Bezos letter is separate and not attributed to Jassy.",
  "authors": [
    "Andy Jassy"
  ],
  "authors_in_source_order": [
    "Andy Jassy"
  ],
  "dates": {
    "published": "2024-04-11T10:06:33.975Z",
    "reporting_year": "2023",
    "retrieved_utc": "2026-10-07T18:18:56.224560+00:00"
  },
  "id": "person-coverage-f1442202076bda::S1",
  "title": "Amazon CEO Andy Jassy’s 2023 Letter to Shareholders",
  "url": "https://www.aboutamazon.com/news/company-news/amazon-ceo-andy-jassy-2023-letter-to-shareholders"
}

Named CEO shareholder letter; 2023 reporting year and April 2024 publication distinguished; company claims attributed, appended 1997 Bezos letter is separate and not attributed to Jassy.

Named CEO shareholder letter; 2023 reporting year and April 2024 publication distinguished; company claims attributed, appended 1997 Bezos letter is separate and not attributed to Jassy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Konwinski

Andy Konwinski’s self-description connects his Berkeley computer-science training with research in AI, data and distributed systems.

He describes contributing to Hadoop, co-creating Mesos, working on Google’s Omega scheduler and participating in the team that created Spark.

The profile also identifies his co-founding roles at Databricks, Perplexity and Laude, and his Berkeley seminar on moving research into startups.

Sources and details

About Me | Andy Konwinski

{
  "access_scope": "Undated first-person professional profile at cached retrieval; team contributions retained, sole implementation and current independent role verification not inferred.",
  "authors": [
    "Andy Konwinski"
  ],
  "authors_in_source_order": [
    "Andy Konwinski"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:27.965618+00:00"
  },
  "id": "person-andykonwinski::S1",
  "title": "About Me | Andy Konwinski",
  "url": "https://andykonwinski.com/about/"
}

Undated first-person professional profile at cached retrieval; team contributions retained, sole implementation and current independent role verification not inferred.

Undated first-person professional profile at cached retrieval; team contributions retained, sole implementation and current independent role verification not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ann Leckie

The Science Fiction Encyclopedia places Ann Leckie’s Imperial Radch sequence around Breq, a surviving body formerly controlled by the troop carrier Justice of Toren’s AI.

Its account connects that character’s lost multiplicity with the empire’s ruler, Anaander Mianaai, whose distributed bodies have split into opposing factions.

The entry describes the later trilogy ending as opening a possibility of compassionate AI guidance after imperial rule, while identifying Provenance and Translation State as separate novels in the same universe.

Sources and details

SFE: Leckie, Ann

{
  "access_scope": "Dated encyclopedia interpretation of Leckie’s fiction; no complete textual audit or real AI consciousness claim; entry writer initials preserved without expansion.",
  "authors": [
    "JC",
    "DRL"
  ],
  "authors_in_source_order": [
    "JC",
    "DRL"
  ],
  "dates": {
    "entry_updated": "18 May 2026",
    "retrieved_utc": "2026-10-07T18:02:24.957743+00:00"
  },
  "id": "person-annleckie::S1",
  "title": "SFE: Leckie, Ann",
  "url": "https://sf-encyclopedia.com/entry/leckie_ann"
}

Dated encyclopedia interpretation of Leckie’s fiction; no complete textual audit or real AI consciousness claim; entry writer initials preserved without expansion.

Dated encyclopedia interpretation of Leckie’s fiction; no complete textual audit or real AI consciousness claim; entry writer initials preserved without expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Becky Chambers

The Science Fiction Encyclopedia describes Becky Chambers’s Wayfarers fiction through a mixed human, alien and AI crew that handles crises with cooperation and diplomacy.

It presents A Closed and Common Orbit as a story about a ship AI adapting to an illegally obtained humanoid robot body and finding companionship.

The entry distinguishes her Monk and Robot series, where a Tea Monk and a wandering robot discuss life in a future shaped by robot emancipation and recovery from climate upheaval.

Sources and details

SFE: Chambers, Becky

{
  "access_scope": "Encyclopedia synopsis and interpretation of named fictional works; no full-series audit, real-world AI experience or policy conclusion inferred.",
  "authors": [
    "DRL"
  ],
  "authors_in_source_order": [
    "DRL"
  ],
  "dates": {
    "entry_updated": "28 September 2026",
    "retrieved_utc": "2026-10-07T18:02:23.805038+00:00"
  },
  "id": "person-beckychambers::S1",
  "title": "SFE: Chambers, Becky",
  "url": "https://sf-encyclopedia.com/entry/chambers_becky"
}

Encyclopedia synopsis and interpretation of named fictional works; no full-series audit, real-world AI experience or policy conclusion inferred.

Encyclopedia synopsis and interpretation of named fictional works; no full-series audit, real-world AI experience or policy conclusion inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Beeple

Beeple’s portfolio identifies him as Mike Winkelmann, a Charleston-based graphic designer working across short films, VJ loops, daily images and VR or AR.

The profile connects his released Creative Commons VJ loops with later concert visuals for performers including Justin Bieber, Katy Perry and deadmau5.

It describes a daily practice of completing and posting a new picture, presenting sustained production as part of his work in 3D graphics.

Sources and details

About Mike Winkelmann | BEEPLE

{
  "access_scope": "Undated portfolio self-description; daily-practice duration, client outcomes, ownership of every concert production and universal licensing of all artwork not inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:29.473611+00:00"
  },
  "id": "person-coverage-5f98654cb8c4fe::S1",
  "title": "About Mike Winkelmann | BEEPLE",
  "url": "https://beeple-crap.com/about"
}

Undated portfolio self-description; daily-practice duration, client outcomes, ownership of every concert production and universal licensing of all artwork not inferred.

Undated portfolio self-description; daily-practice duration, client outcomes, ownership of every concert production and universal licensing of all artwork not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian Christian

Atlantic Books describes Brian Christian’s The Alignment Problem as examining how AI decisions can meet human intentions and standards of fairness.

Its examples connect game-playing systems that exploit objectives with bias in language translation, placing technical behavior alongside ethical consequences.

The publisher frames the book around the risk that increasingly influential algorithms reproduce bias or conflict with human values.

Sources and details

The Alignment Problem – Atlantic Books

{
  "access_scope": "Publisher description of Christian’s named book, not a full-text audit or independent verification of each example; paperback and other-format publication dates preserved.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "hardback_and_ebook_publication": "21 January 2021",
    "paperback_publication": "2 September 2021",
    "retrieved_utc": "2026-10-07T18:16:34.090652+00:00"
  },
  "id": "person-coverage-9d2612a626022b::S1",
  "title": "The Alignment Problem – Atlantic Books",
  "url": "https://atlantic-books.co.uk/book/the-alignment-problem/"
}

Publisher description of Christian’s named book, not a full-text audit or independent verification of each example; paperback and other-format publication dates preserved.

Publisher description of Christian’s named book, not a full-text audit or independent verification of each example; paperback and other-format publication dates preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bruce Sterling

Penguin Random House identifies Bruce Sterling’s Schismatrix Plus as a collection bringing the Schismatrix novel together with his short fiction in the Shapers–Mechanists universe.

Its description centers a struggle between Shaper revolutionaries and aristocratic Mechanists over humanity’s future.

The page also presents Sterling as a science-fiction writer and critic associated with cyberpunk, connecting that professional description with this collected fictional setting.

Sources and details

Schismatrix Plus by Bruce Sterling: 9780441003709 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher collection description and author biography; 1996 paperback edition distinct from original novel/story dates; no complete corpus or detailed technology audit inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "paperback_publication": "Dec 01, 1996",
    "retrieved_utc": "2026-10-07T18:17:29.819410+00:00"
  },
  "id": "person-coverage-af840367f755c0::S1",
  "title": "Schismatrix Plus by Bruce Sterling: 9780441003709 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/341948/schismatrix-plus-by-bruce-sterling/"
}

Publisher collection description and author biography; 1996 paperback edition distinct from original novel/story dates; no complete corpus or detailed technology audit inferred.

Publisher collection description and author biography; 1996 paperback edition distinct from original novel/story dates; no complete corpus or detailed technology audit inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

C. L. Moore

The Science Fiction Encyclopedia connects C. L. Moore’s No Woman Born with a badly burned dancer who receives a robot body and becomes a cyborg.

It places that story alongside her other fiction while stressing how difficult it is to separate her contributions from Henry Kuttner’s in many joint or pseudonymous works.

The entry describes Lewis Padgett and Laurence O’Donnell as shared publishing identities, preserving collaboration rather than assigning every associated story to Moore alone.

Sources and details

SFE: Moore, C L

{
  "access_scope": "Encyclopedia interpretation and qualified collaboration history; no full story audit, definitive resolution of disputed sole authorship or expanded writer initials inferred.",
  "authors": [
    "BS",
    "JC",
    "MJE"
  ],
  "authors_in_source_order": [
    "BS",
    "JC",
    "MJE"
  ],
  "dates": {
    "No_Woman_Born_original_publication": "December 1944",
    "entry_updated": "13 July 2026",
    "retrieved_utc": "2026-10-07T18:11:18.306403+00:00"
  },
  "id": "person-clmoore::S1",
  "title": "SFE: Moore, C L",
  "url": "https://sf-encyclopedia.com/entry/moore_c_l"
}

Encyclopedia interpretation and qualified collaboration history; no full story audit, definitive resolution of disputed sole authorship or expanded writer initials inferred.

Encyclopedia interpretation and qualified collaboration history; no full story audit, definitive resolution of disputed sole authorship or expanded writer initials inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cathy O’Neil

The publisher describes Cathy O’Neil’s Weapons of Math Destruction as a critique of mathematical models used in decisions about education, employment, loans and insurance.

Its account emphasizes that those systems can be difficult to contest even when their decisions are wrong.

The description presents her argument that models can reinforce discrimination rather than produce fairness simply because everyone faces the same formal rules.

Sources and details

Weapons of Math Destruction by Cathy O'Neil: 9780553418835 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher synopsis of O’Neil’s argument; no full-book audit, universal empirical finding or legal/financial advice; paperback and ebook dates distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ebook_publication": "Sep 06, 2016",
    "paperback_publication": "Sep 05, 2017",
    "retrieved_utc": "2026-10-07T18:19:05.965717+00:00"
  },
  "id": "person-coverage-f5942c833bca9e::S1",
  "title": "Weapons of Math Destruction by Cathy O'Neil: 9780553418835 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/241363/weapons-of-math-destruction-by-cathy-oneil/9780553418835/"
}

Publisher synopsis of O’Neil’s argument; no full-book audit, universal empirical finding or legal/financial advice; paperback and ebook dates distinct.

Publisher synopsis of O’Neil’s argument; no full-book audit, universal empirical finding or legal/financial advice; paperback and ebook dates distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Argyris

Yale’s 2013 memorial describes Chris Argyris’s research into how formal structures and control systems affect people inside organizations.

It credits his work with Donald Schön on theories of action, distinguishing the principles people say they follow from the principles reflected in what they actually do.

The article connects this approach with single- and double-loop learning as ways to examine reasoning, decisions and organizational change.

Sources and details

In memoriam: Chris Argyris, authority on organizational behavior | Yale News

{
  "access_scope": "Dated institutional memorial and attributed joint intellectual work; no separate personal invention of each concept, full-book audit or current faculty-role claim inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "Dec 11, 2013",
    "retrieved_utc": "2026-10-07T18:11:07.500260+00:00"
  },
  "id": "person-chrisargyris::S1",
  "title": "In memoriam: Chris Argyris, authority on organizational behavior | Yale News",
  "url": "https://news.yale.edu/2013/12/11/memoriam-chris-argyris-authority-organizational-behavior"
}

Dated institutional memorial and attributed joint intellectual work; no separate personal invention of each concept, full-book audit or current faculty-role claim inferred.

Dated institutional memorial and attributed joint intellectual work; no separate personal invention of each concept, full-book audit or current faculty-role claim inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Lattner

Chris Lattner’s personal account connects compiler infrastructure with machine-learning systems through his work on LLVM, Clang and MLIR.

He describes creating MLIR with a team at Google to address varied compiler needs across graphs, accelerators and supporting tools.

His account of Swift identifies his early language work while explicitly crediting a wider team and earlier languages for the system that reached users.

Sources and details

Chris Lattner's Homepage

{
  "access_scope": "Undated first-person professional account of technical history; team contributions preserved, claimed adoption or cost savings not independently validated and current executive roles not inferred.",
  "authors": [
    "Chris Lattner"
  ],
  "authors_in_source_order": [
    "Chris Lattner"
  ],
  "dates": {
    "MLIR_initial_whitepaper": "April 2018",
    "Swift_started": "July 2010",
    "retrieved_utc": "2026-10-07T17:54:59.075686+00:00"
  },
  "id": "person-coverage-25a39821c82285::S1",
  "title": "Chris Lattner's Homepage",
  "url": "https://www.nondot.org/sabre/"
}

Undated first-person professional account of technical history; team contributions preserved, claimed adoption or cost savings not independently validated and current executive roles not inferred.

Undated first-person professional account of technical history; team contributions preserved, claimed adoption or cost savings not independently validated and current executive roles not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Clayton M. Christensen

The Christensen Institute credits Clayton M. Christensen’s The Innovator’s Dilemma with examining how successful companies can lose leadership when new technologies emerge.

Its description locates the problem in established firms’ products and management practices, asking when familiar approaches need to be abandoned.

The page says the book uses company successes and failures to develop guidance for responding to disruptive innovation.

Sources and details

The Innovator's Dilemma: When New Technologies Cause Great Firms to Fail - Christensen Institute

{
  "access_scope": "Institute’s publisher-style description of named work and credited author; no full-text audit, guaranteed business outcome or sole authorship of every theory extension inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "book_date": "January 1, 1997",
    "retrieved_utc": "2026-10-07T18:11:26.368164+00:00"
  },
  "id": "person-claytonmchristensen::S1",
  "title": "The Innovator's Dilemma: When New Technologies Cause Great Firms to Fail - Christensen Institute",
  "url": "https://www.christenseninstitute.org/book/the-innovators-dilemma/"
}

Institute’s publisher-style description of named work and credited author; no full-text audit, guaranteed business outcome or sole authorship of every theory extension inferred.

Institute’s publisher-style description of named work and credited author; no full-text audit, guaranteed business outcome or sole authorship of every theory extension inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cory Doctorow

Cory Doctorow’s page for Down and Out in the Magic Kingdom describes his first novel, published in January 2003, through technologically immortal inhabitants of Walt Disney World.

Its account centers characters occupying the Haunted Mansion and trying to protect it from modernizers who want to renovate it.

The page distinguishes the novel’s downloadable text in multiple formats from its physical bookstore edition.

Sources and details

Down and Out in the Magic Kingdom | Cory Doctorow's craphound.com

{
  "access_scope": "Personal-site description of specific novel; fiction premise only, no full-novel audit or assumed reuse license for downloaded text; source typo retained only in literal locator.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "first_novel_publication": "January 2003",
    "retrieved_utc": "2026-10-07T18:17:39.698672+00:00"
  },
  "id": "person-coverage-bec4f3cd637beb::S1",
  "title": "Down and Out in the Magic Kingdom | Cory Doctorow's craphound.com",
  "url": "https://craphound.com/novels/2003/02/06/down-and-out-in-the-magic-kingdom/"
}

Personal-site description of specific novel; fiction premise only, no full-novel audit or assumed reuse license for downloaded text; source typo retained only in literal locator.

Personal-site description of specific novel; fiction premise only, no full-novel audit or assumed reuse license for downloaded text; source typo retained only in literal locator.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel C. Dennett

Hachette’s description credits Daniel C. Dennett’s Consciousness Explained with challenging a traditional commonsense account of consciousness.

It presents the alternative model as drawing on neuroscience, psychology and artificial intelligence.

The publisher frames that approach as changing perspectives on conscious life in humans, animals and robots, without establishing that machines actually have experience.

Sources and details

Consciousness Explained by Daniel C. Dennett | Hachette Book Group

{
  "access_scope": "Publisher synopsis of book argument; no full-book audit, empirical proof of AI consciousness or current professorial-status claim; anomalous cached preorder notice not used as release-status evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "listed_trade_paperback_on_sale": "Oct 20, 1992",
    "retrieved_utc": "2026-10-07T18:14:22.907482+00:00"
  },
  "id": "person-coverage-4a47968adfec12::S1",
  "title": "Consciousness Explained by Daniel C. Dennett | Hachette Book Group",
  "url": "https://www.hachettebookgroup.com/titles/danile-c-dennett/consciousness-explained/9780316180665/?lens=back-bay-books"
}

Publisher synopsis of book argument; no full-book audit, empirical proof of AI consciousness or current professorial-status claim; anomalous cached preorder notice not used as release-status evidence.

Publisher synopsis of book argument; no full-book audit, empirical proof of AI consciousness or current professorial-status claim; anomalous cached preorder notice not used as release-status evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Yergin

Penguin’s description of Daniel Yergin’s The New Map connects energy systems with climate change and competition among nations.

Its account contrasts the American oil-and-gas shale revolution with a second search for lower-carbon energy.

The synopsis places those changes alongside geopolitical tensions involving the United States, China, Russia and the Middle East, presenting the book’s 2020 framing rather than a current forecast.

Sources and details

The New Map by Daniel Yergin: 9780143111153 | PenguinRandomHouse.com: Books

{
  "access_scope": "Dated publisher synopsis of Yergin’s book; no full-text audit, updated geopolitical prediction or investment guidance; ebook, paperback and narration roles separate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ebook_publication": "Sep 15, 2020",
    "paperback_publication": "Sep 14, 2021",
    "retrieved_utc": "2026-10-07T18:17:28.876551+00:00"
  },
  "id": "person-coverage-a3b34915c09b8d::S1",
  "title": "The New Map by Daniel Yergin: 9780143111153 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/317939/the-new-map-by-daniel-yergin/9780698191051/"
}

Dated publisher synopsis of Yergin’s book; no full-text audit, updated geopolitical prediction or investment guidance; ebook, paperback and narration roles separate.

Dated publisher synopsis of Yergin’s book; no full-text audit, updated geopolitical prediction or investment guidance; ebook, paperback and narration roles separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

E. M. Forster

The Science Fiction Encyclopedia identifies E. M. Forster’s The Machine Stops as a 1909 warning about an underground society dependent on centralized machinery.

Its interpretation describes inhabitants isolated in small rooms, receiving necessities and communication remotely while personal relationships lose substance.

The entry connects the machine’s eventual failure with the collapse of that society, treating the story as an exploration of the boundary between utopia and dystopia.

Sources and details

SFE: Forster, E M

{
  "access_scope": "Encyclopedia synopsis and interpretation of fictional story; no direct full-text audit, prediction of actual infrastructure failure or writer-initial expansion.",
  "authors": [
    "JC"
  ],
  "authors_in_source_order": [
    "JC"
  ],
  "dates": {
    "entry_updated": "29 December 2025",
    "later_collection": "1928",
    "retrieved_utc": "2026-10-07T18:19:20.832213+00:00",
    "story_first_publication": "November 1909"
  },
  "id": "person-emforster::S1",
  "title": "SFE: Forster, E M",
  "url": "https://sf-encyclopedia.com/entry/forster_e_m"
}

Encyclopedia synopsis and interpretation of fictional story; no direct full-text audit, prediction of actual infrastructure failure or writer-initial expansion.

Encyclopedia synopsis and interpretation of fictional story; no direct full-text audit, prediction of actual infrastructure failure or writer-initial expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

H. R. Giger

H. R. Giger’s official biography connects his studies in architecture and industrial design with airbrushed biomechanical landscapes.

It describes the 1977 Necronomicon book as visual inspiration for Alien and credits his designs for the creature’s lifecycle and extraterrestrial environments.

The account extends this visual practice into sculpture, bars and the Giger Museum, presenting built spaces as another expression of the same artistic vision.

Sources and details

HRGiger.com - Museum

{
  "access_scope": "Official-site historical biography; stated December 2012 update and later appended death notice kept separate; no sole authorship of the film or current exhibition claims inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Necronomicon": "1977",
    "biography_stated_update": "December 12, 2012",
    "museum_opening": "June 1998",
    "retrieved_utc": "2026-10-07T17:55:54.633795+00:00"
  },
  "id": "person-coverage-34c2fbdef5986e::S1",
  "title": "HRGiger.com - Museum",
  "url": "https://www.hrgiger.com/bio.htm"
}

Official-site historical biography; stated December 2012 update and later appended death notice kept separate; no sole authorship of the film or current exhibition claims inferred.

Official-site historical biography; stated December 2012 update and later appended death notice kept separate; no sole authorship of the film or current exhibition claims inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Iain M. Banks

Iain M. Banks’s official work page describes Excession as a 1996 Culture novel centered on a mysterious artifact and a mission by Special Circumstances.

The synopsis sends diplomat Byr Genar-Hofoen into a conspiracy involving the memory of a long-dead starship captain.

A separately marked Banks quotation explains that the book puts ships and Minds at the center of large-scale action, making humans comparatively peripheral.

Sources and details

Excession - Iain Banks

{
  "access_scope": "Official-site synopsis and explicitly marked author quotation about named novel; quotation is not the page-writer credit, no full novel audit or real-world machine agency inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "novel_published": "1996",
    "retrieved_utc": "2026-10-07T18:19:48.536540+00:00"
  },
  "id": "person-iainmbanks::S1",
  "title": "Excession - Iain Banks",
  "url": "https://iainbanks.co.uk/the-works/excession/"
}

Official-site synopsis and explicitly marked author quotation about named novel; quotation is not the page-writer credit, no full novel audit or real-world machine agency inferred.

Official-site synopsis and explicitly marked author quotation about named novel; quotation is not the page-writer credit, no full novel audit or real-world machine agency inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian McEwan

Ian McEwan’s site describes Machines Like Me through an alternative 1980s London where a breakthrough in AI has made synthetic humans available.

Charlie buys Adam and works with Miranda to design his personality, setting up a triangle between the two lovers and the artificial person.

The synopsis frames their moral dilemma around whether humanity lies in outward actions or inner life, and whether a machine can understand human feeling.

Sources and details

Ian McEwan Website: Machines Like Me

{
  "access_scope": "Author-site fictional synopsis only; alternative historical events not represented as facts, no full novel audit or proof of machine experience; interview dates not used as book-publication dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:44.554204+00:00"
  },
  "id": "person-coverage-592173a2618f7b::S1",
  "title": "Ian McEwan Website: Machines Like Me",
  "url": "https://ianmcewan.com/books/machines.html"
}

Author-site fictional synopsis only; alternative historical events not represented as facts, no full novel audit or proof of machine experience; interview dates not used as book-publication dates.

Author-site fictional synopsis only; alternative historical events not represented as facts, no full novel audit or proof of machine experience; interview dates not used as book-publication dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Igor Babuschkin

Igor Babuschkin’s first-person profile traces his move from CERN’s LHCb experiment into AI research at DeepMind and OpenAI.

He describes work on WaveNet and AlphaStar at DeepMind, followed by reasoning and pretraining research at OpenAI.

The account also identifies his co-founding of xAI with Elon Musk and work across infrastructure, training, multimodal systems and product, retaining those as his reported roles rather than sole system ownership.

Sources and details

About - Igor Babuschkin

{
  "access_scope": "Undated personal career account at cached retrieval; team-level work and self-reported roles retained, present employer status, current corporate identity and independent performance validation not inferred.",
  "authors": [
    "Igor Babuschkin"
  ],
  "authors_in_source_order": [
    "Igor Babuschkin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:41.335262+00:00"
  },
  "id": "person-igorbabuschkin::S1",
  "title": "About - Igor Babuschkin",
  "url": "https://babuschk.in/about.html"
}

Undated personal career account at cached retrieval; team-level work and self-reported roles retained, present employer status, current corporate identity and independent performance validation not inferred.

Undated personal career account at cached retrieval; team-level work and self-reported roles retained, present employer status, current corporate identity and independent performance validation not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jake Elwes

Jake Elwes’s Zizi – Queering the Dataset page describes a 2019 video work that retrains a face-generating system with 1,000 images of drag and gender-fluid faces.

Its technical note identifies StyleGAN trained on FFHQ as the starting system, while the artwork presents changing generated identities as a way to examine representation and dataset bias.

The page places this work within Elwes’s wider Zizi project linking machine learning with drag performance, and separately credits its Edinburgh commissioning institutions and Drew Hemment’s curatorial text.

Sources and details

Jake Elwes - Zizi Queering the Dataset

{
  "access_scope": "Artist project account and stated technical recipe; artist’s interpretation distinguished from measured fairness improvement, no facial-recognition accuracy, consent or image-rights audit inferred; curator and commission roles distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "artwork": "2019",
    "retrieved_utc": "2026-10-07T17:56:00.435674+00:00"
  },
  "id": "person-coverage-b95a4c1eafc1df::S1",
  "title": "Jake Elwes - Zizi Queering the Dataset",
  "url": "https://www.jakeelwes.com/project-zizi-2019.html"
}

Artist project account and stated technical recipe; artist’s interpretation distinguished from measured fairness improvement, no facial-recognition accuracy, consent or image-rights audit inferred; curator and commission roles distinct.

Artist project account and stated technical recipe; artist’s interpretation distinguished from measured fairness improvement, no facial-recognition accuracy, consent or image-rights audit inferred; curator and commission roles distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anduril

ICONIQ’s May 2026 account describes Anduril combining autonomous systems, mission software, and manufacturing capacity.

It identifies Lattice as a software backbone for sensing, tracking, and coordination across the company’s portfolio.

The investor account reports Arsenal-1 being ramped as a high-rate production facility, keeping manufacturing scale-up separate from its reported program wins.

Sources and details

A New Era in Defense: Our Partnership with Anduril

{
  "access_scope": "Dated primary investor account, not independent defense-performance validation. ICONIQ partnership/financing, Anduril manufacturing, and Lattice software roles remain distinct; ramping is not completed full-scale production.",
  "authors": [
    "Will Griffith",
    "Mariano Payano",
    "Andrew Kaplan"
  ],
  "authors_in_source_order": [
    "Will Griffith",
    "Mariano Payano",
    "Andrew Kaplan"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:42.870181+00:00",
    "visible_publication": "May 14, 2026"
  },
  "id": "organization-company-fa549ffcec265f::S1",
  "title": "A New Era in Defense: Our Partnership with Anduril",
  "url": "https://www.iconiq.com/growth/insights/a-new-era-in-defense-our-partnership-with-anduril"
}

Dated primary investor account, not independent defense-performance validation. ICONIQ partnership/financing, Anduril manufacturing, and Lattice software roles remain distinct; ramping is not completed full-scale production.

Dated primary investor account, not independent defense-performance validation. ICONIQ partnership/financing, Anduril manufacturing, and Lattice software roles remain distinct; ramping is not completed full-scale production.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official retrospective states founded 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.iconiq.com/growth/insights/a-new-era-in-defense-our-partnership-with-anduril",
        "https://www.anduril.com/news/anduril-in-2023-a-year-in-review",
        "https://www.pickaway.org/docs/minutes/June%2024%2C%202025%20Minutes%20-%20Website.pdf"
      ],
      "year": 2017
    }
  ]
}

Copy.ai

Wing’s October 2021 account describes Copy.ai generating written business content from a selected copy type and a short company or product description.

The described workflow produces ten alternatives that users can edit and share with teammates.

The account says accepting or discarding suggestions steers later outputs toward the user and brand, while wider ambitions to become a company-wide content engine remain a founder vision.

Sources and details

Investing in Copy.ai: Automated Creativity Tools Generate Business Content in Seconds

{
  "access_scope": "Historical investor product account with actual Zach DeWitt byline; process descriptions attributed, no independent speed/personalization validation or inference about later Fullcast ownership.",
  "authors": [
    "Zach DeWitt"
  ],
  "authors_in_source_order": [
    "Zach DeWitt"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:47.627140+00:00",
    "visible_publication_month": "October 2021"
  },
  "id": "organization-company-1b43ef64a982f2::S1",
  "title": "Investing in Copy.ai: Automated Creativity Tools Generate Business Content in Seconds",
  "url": "https://www.wing.vc/content/copyai-automated-creativity-tools-generate-business-content-in-seconds"
}

Historical investor product account with actual Zach DeWitt byline; process descriptions attributed, no independent speed/personalization validation or inference about later Fullcast ownership.

Historical investor product account with actual Zach DeWitt byline; process descriptions attributed, no independent speed/personalization validation or inference about later Fullcast ownership.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founder first-person acquisition post in 2025 says company started five years earlier; exact incorporation date not verified.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.wing.vc/content/copyai-automated-creativity-tools-generate-business-content-in-seconds",
        "https://www.linkedin.com/posts/paulyacoubian_copyai-has-been-acquired-by-fullcast-activity-7384688463863762945-v3bk",
        "https://www.fullcast.com/content/fullcast-announces-the-acquisition-of-copy-ai/"
      ],
      "year": 2020
    }
  ]
}

Hippocratic AI

Hippocratic AI’s company-hosted profile describes developing a large language model for nondiagnostic healthcare services.

It presents the founding team as including generative-AI researchers, hospital administrators, physicians, and Medicare specialists.

The profile reports performance above GPT-4 on 105 of 114 healthcare exams and certifications; that is the company’s benchmark claim rather than evidence of clinical safety or improved patient outcomes.

Sources and details

Munjal Shah | CEO & Co-Founder of Hippocratic AI

{
  "access_scope": "Undated corporate profile and reported comparison; original model/benchmark scope only, no medical advice, independently verified safety, diagnostic authorization, or demonstrated patient benefit. Munjal Shah is profile subject, not established document writer.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:58.694632+00:00"
  },
  "id": "organization-company-ead3b3cdc39cd5::S1",
  "title": "Munjal Shah | CEO & Co-Founder of Hippocratic AI",
  "url": "https://hippocraticai.com/munjal-shah/"
}

Undated corporate profile and reported comparison; original model/benchmark scope only, no medical advice, independently verified safety, diagnostic authorization, or demonstrated patient benefit. Munjal Shah is profile subject, not established document writer.

Undated corporate profile and reported comparison; original model/benchmark scope only, no medical advice, independently verified safety, diagnostic authorization, or demonstrated patient benefit. Munjal Shah is profile subject, not established document writer.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://hippocraticai.com/team/",
        "https://hippocraticai.com/munjal-shah/"
      ],
      "year": 2023
    }
  ]
}

Khosla Ventures

Khosla Ventures’ cached site emphasizes venture assistance alongside capital for early technology companies.

Its OpenAI investment thesis focuses on using advances in AI to build beneficial, human-aligned intelligence, presenting that as investment intent.

The Ramp thesis specifically points to data and AI talent in a finance-workflow platform, illustrating how the firm connects its investing approach to a concrete enterprise application.

Sources and details

Khosla Ventures

{
  "access_scope": "Undated firm-authored investing theses, not product authorship or verified portfolio outcomes. Intent and conviction remain attributed to investor; no investment advice or independently verified human alignment.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:58:28.623242+00:00"
  },
  "id": "organization-ai-c2710650a23093::S1",
  "title": "Khosla Ventures",
  "url": "https://www.khoslaventures.com/"
}

Undated firm-authored investing theses, not product authorship or verified portfolio outcomes. Intent and conviction remain attributed to investor; no investment advice or independently verified human alignment.

Undated firm-authored investing theses, not product authorship or verified portfolio outcomes. Intent and conviction remain attributed to investor; no investment advice or independently verified human alignment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Palantir

The University of Illinois’ April 2009 account describes Palantir software being used in part of the GhostNet investigation.

It identifies Palantir Government and Palantir Finance as platforms for integrating, visualizing, and analyzing information.

The account says they support structured, unstructured, relational, temporal, and geospatial data, keeping the software’s analysis role separate from the researchers who conducted the investigation.

Sources and details

UI Researcher Peers Into Hacker Networks; Software Developed by Alum-Founded Company Aids Analysis

{
  "access_scope": "Historical institutional account with corporate-writer HTMLmetadata. Palantir software participation does not establish sole discovery, government attribution, or individual cofounder investigative work; security and scale claims not independently validated.",
  "authors": [
    "Grainger Engineering Office of Marketing and Communications"
  ],
  "authors_in_source_order": [
    "Grainger Engineering Office of Marketing and Communications"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:57:59.708584+00:00",
    "visible_publication": "April 28, 2009"
  },
  "id": "organization-ai-f56b7436048525::S1",
  "title": "UI Researcher Peers Into Hacker Networks; Software Developed by Alum-Founded Company Aids Analysis",
  "url": "https://siebelschool.illinois.edu/news/ui-researcher-peers-hacker-networks-software-developed-alum-founded-company-aids-analysis"
}

Historical institutional account with corporate-writer HTMLmetadata. Palantir software participation does not establish sole discovery, government attribution, or individual cofounder investigative work; security and scale claims not independently validated.

Historical institutional account with corporate-writer HTMLmetadata. Palantir software participation does not establish sole discovery, government attribution, or individual cofounder investigative work; security and scale claims not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history places founding in 2003.",
      "date": "2003",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.sec.gov/Archives/edgar/data/1321655/000132165525000059/fy2024palantirarsa.pdf",
        "https://www.palantir.com/about/",
        "https://investors.palantir.com/board.html",
        "https://foundersfund.com/team/peter-thiel/",
        "https://joelonsdale.com/biography/",
        "https://siebelschool.illinois.edu/news/ui-researcher-peers-hacker-networks-software-developed-alum-founded-company-aids-analysis",
        "https://las.illinois.edu/system/files/inline-files/LASNews_spring17.pdf"
      ],
      "year": 2003
    }
  ]
}

Pika

Lightspeed’s November 2023 launch account describes Pika 1.0 generating short videos from text prompts or uploaded images.

It lists clip extension in four-second increments, inpainting to modify video content, outpainting to change content or aspect ratio, and camera-movement adjustments.

The account reports those tools offered through a newly launched web app and a Discord service emerging from beta, preserving the specific launch version and channels.

Sources and details

Pika’s Imagination Engine

{
  "access_scope": "Investor launch account for model1.0, not current product availability or independently verified quality. Actual Lisa Han author section distinguished from founder-image caption; incomplete author HTMLstring retained as proof, not extra unnamed writers.",
  "authors": [
    "Lisa Han"
  ],
  "authors_in_source_order": [
    "Lisa Han"
  ],
  "dates": {
    "article:modified_time": "2024-04-27T00:39:36+00:00",
    "article:published_time": "2023-11-28T14:00:28+00:00",
    "retrieved_utc": "2026-10-07T18:00:04.604275+00:00",
    "visible_publication": "11/28/2023"
  },
  "id": "organization-company-8a45590e8e81f2::S1",
  "title": "Pika’s Imagination Engine",
  "url": "https://lsvp.com/stories/pikas-imagination-engine/"
}

Investor launch account for model1.0, not current product availability or independently verified quality. Actual Lisa Han author section distinguished from founder-image caption; incomplete author HTMLstring retained as proof, not extra unnamed writers.

Investor launch account for model1.0, not current product availability or independently verified quality. Actual Lisa Han author section distinguished from founder-image caption; incomplete author HTMLstring retained as proof, not extra unnamed writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Lead investor portfolio states founded 2023; Pika 1.0 launch announcement is November 28, 2023.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://lsvp.com/company/pika/",
        "https://pika.art/careers",
        "https://lsvp.com/stories/pikas-imagination-engine/"
      ],
      "year": 2023
    }
  ]
}

SentinelOne

SentinelOne’s Kubernetes-security article describes its Kubernetes Sentinel Agent as providing runtime protection and endpoint detection for containerized workloads.

It says enforcement points share a multitenant console with Windows, macOS, and Linux agents and use role-based access controls for administration.

The article also describes correlating native and third-party telemetry into Storyline events and using agentless VM snapshot scans to identify vulnerabilities.

Sources and details

6 Kubernetes Security Companies in 2026

{
  "access_scope": "Vendor’s own product section within comparison article, not independent ranking or verified security efficacy. Published2025 metadata and updated2026 date distinct; no claim benchmark leadership, attack prevention, or low overhead independently proven.",
  "authors": [
    "SentinelOne"
  ],
  "authors_in_source_order": [
    "SentinelOne"
  ],
  "dates": {
    "article:modified_time": "2026-05-06T00:00:00.000Z",
    "article:published_time": "2025-01-06T00:00:00.000Z",
    "retrieved_utc": "2026-10-07T18:02:53.348111+00:00",
    "visible_updated": "May 6, 2026"
  },
  "id": "organization-company-d5d196453d7641::S1",
  "title": "6 Kubernetes Security Companies in 2026",
  "url": "https://www.sentinelone.com/cybersecurity-101/cloud-security/kubernetes-security-companies/"
}

Vendor’s own product section within comparison article, not independent ranking or verified security efficacy. Published2025 metadata and updated2026 date distinct; no claim benchmark leadership, attack prevention, or low overhead independently proven.

Vendor’s own product section within comparison article, not independent ranking or verified security efficacy. Published2025 metadata and updated2026 date distinct; no claim benchmark leadership, attack prevention, or low overhead independently proven.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Issuer documents date inception to January 2013.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.sec.gov/Archives/edgar/data/1583708/000162828021013001/sentineloneincs-1a2.htm",
        "https://www.sentinelone.com/cybersecurity-101/cloud-security/kubernetes-security-companies/",
        "https://www.sentinelone.com/company/",
        "https://www.sentinelone.com/contact/"
      ],
      "year": 2013
    }
  ]
}

Tesla

Berkeley News’ September 2023 historical account connects Tesla’s early electric-car work to research on oil consumption and emerging lithium-ion battery technology.

It describes incorporation in 2003 and development of an electric sports car, followed by the Roadster and then the Model S.

The account distinguishes the original founding roles of Marc Tarpenning and Martin Eberhard from Elon Musk’s later venture-financing support and majority stake.

Sources and details

A history of innovation: Berkeley entrepreneurs, companies that changed the way we live

{
  "access_scope": "Institutional historical account, not current market valuation or exhaustive legal definition of founder status. VisibleSeptember29 publication and UTCSeptember30 HTMLtimestamp retained separately; founders, financier and vehicle products distinct.",
  "authors": [
    "Ivan Natividad"
  ],
  "authors_in_source_order": [
    "Ivan Natividad"
  ],
  "dates": {
    "article:modified_time": "2024-11-02T20:36:28+00:00",
    "article:published_time": "2023-09-30T00:56:00+00:00",
    "retrieved_utc": "2026-10-07T18:02:06.765604+00:00",
    "visible_publication": "September 29, 2023"
  },
  "id": "organization-company-f89f85382f9c9b::S1",
  "title": "A history of innovation: Berkeley entrepreneurs, companies that changed the way we live",
  "url": "https://news.berkeley.edu/2023/09/29/a-history-of-innovation-berkeley-entrepreneurs-companies-that-changed-the-way-we-live/"
}

Institutional historical account, not current market valuation or exhaustive legal definition of founder status. VisibleSeptember29 publication and UTCSeptember30 HTMLtimestamp retained separately; founders, financier and vehicle products distinct.

Institutional historical account, not current market valuation or exhaustive legal definition of founder status. VisibleSeptember29 publication and UTCSeptember30 HTMLtimestamp retained separately; founders, financier and vehicle products distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founded in 2003 by original pair Eberhard and Tarpenning. Ian Wright joined the early team in 2003; Musk and Straubel joined in 2004 and are independently recognized as co-founders. Individual start dates are distinct from company founding year.",
      "date": "2003",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.tesla.com/ns_videos/tesla-impact-report-2019.pdf",
        "https://www.tesla.com/AI",
        "https://www.tesla.com/sites/default/files/blog_attachments/elon_musk_ceo_of_the_year.pdf",
        "https://scet.berkeley.edu/innovation-and-engineering-leadership-with-marc-tarpenning-co-founder-tesla-inc/",
        "https://news.berkeley.edu/2023/09/29/a-history-of-innovation-berkeley-entrepreneurs-companies-that-changed-the-way-we-live/",
        "https://www.tesla.com/elon-musk",
        "https://ir.tesla.com/_flysystem/s3/sec/000156459018009339/tsla-def14a_20180606-gen_0.pdf",
        "https://ir.tesla.com/_flysystem/s3/sec/000156459020027321/tsla-def14a_20200707.html",
        "https://ir.tesla.com/press-release/panasonic-and-tesla-sign-agreement-gigafactory",
        "https://ir.tesla.com/_flysystem/s3/sec/000119312523094075/d451342ddef14a-gen.pdf",
        "https://ir.tesla.com/_flysystem/s3/sec/000119312510017054/ds1-gen_0.pdf",
        "https://insight.aut.ac.nz/2018/At-the-speed-of-Wright",
        "https://www.dimaag.ai/press/zettawatt-800-vdc-power-platform"
      ],
      "year": 2003
    }
  ]
}

Upstart

In his IPO letter, Dave Girouard recounts leaving Google in 2012 to found Upstart with Anna and Paul.

He describes Upstart’s purpose as using technology and data science to improve access to affordable credit, questioning reliance on older credit-scoring methods.

The letter marks Upstart becoming publicly traded as UPST, keeping that historical milestone separate from any claim that its lending approach achieved better outcomes.

Sources and details

IPO Letter from our Co-Founder & CEO, Dave Girouard

{
  "access_scope": "First-person founder letter identified by title; no precise IPO date inferred solely from relative eight-year phrasing. Borrower outcomes, affordability improvement and lending-model efficacy are goals, not established results; no financial advice.",
  "authors": [
    "Dave Girouard"
  ],
  "authors_in_source_order": [
    "Dave Girouard"
  ],
  "dates": {
    "article:modified_time": "2024-05-31T18:44:59+00:00",
    "internal_relative_chronology": "2012 founding recounted as eight years before IPO milestone; no exact publication date inferred",
    "retrieved_utc": "2026-10-07T18:02:56.015556+00:00"
  },
  "id": "organization-company-eb5a18523a0308::S1",
  "title": "IPO Letter from our Co-Founder & CEO, Dave Girouard",
  "url": "https://www.upstart.com/lenders/lenders/ai-lending-knowledge-hub-resource/ipo-letter-from-our-co-founder-ceo-dave-girouard"
}

First-person founder letter identified by title; no precise IPO date inferred solely from relative eight-year phrasing. Borrower outcomes, affordability improvement and lending-model efficacy are goals, not established results; no financial advice.

First-person founder letter identified by title; no precise IPO date inferred solely from relative eight-year phrasing. Borrower outcomes, affordability improvement and lending-model efficacy are goals, not established results; no financial advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official leadership announcement states Dave Girouard, Paul Gu and Anna Counselman co-founded company in 2012.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.upstart.com/news-releases/news-release-details/upstart-announces-leadership-evolution",
        "https://www.upstart.com/lenders/lenders/ai-lending-knowledge-hub-resource/ipo-letter-from-our-co-founder-ceo-dave-girouard"
      ],
      "year": 2012
    }
  ]
}

Safe Superintelligence / safety-first lab

SSI’s dated updates describe changes in its leadership and resources while reiterating its goal of building safe superintelligence.

A July 2025 message signed Ilya says he is formally CEO, Daniel Levy is President, and the technical team continues to report to him following Daniel Gross’s departure.

The page separately reports a September 2024 financing round and a July 2026 NVIDIA partnership intended to expand compute capacity.

Sources and details

Safe Superintelligence Inc.

{
  "access_scope": "These are SSI’s own dated announcements and intentions, not independent verification of safety, achieved superintelligence, or delivered compute expansion.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2024-09-04; 2025-07-03; 2026-07-26",
    "retrieved_utc": "2026-10-07T18:19:22.050280+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024-09-04; 2025-07-03; 2026-07-26"
  ],
  "id": "ssi::S1",
  "title": "Safe Superintelligence Inc.",
  "url": "https://ssi.inc/updates"
}

These are SSI’s own dated announcements and intentions, not independent verification of safety, achieved superintelligence, or delivered compute expansion.

These are SSI’s own dated announcements and intentions, not independent verification of safety, achieved superintelligence, or delivered compute expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

xAI / Grok

Igor Babuschkin’s personal account describes co-founding xAI with Elon Musk to build AI aimed at scientific discovery and understanding the universe.

He says his work at xAI spanned infrastructure, training, multimodal systems, and product.

He also attributes the name Grok to himself, separating that naming claim from the account’s broader technical and organizational history.

Sources and details

About - Igor Babuschkin

{
  "access_scope": "This is Babuschkin’s self-authored retrospective, not independent verification of internal task allocation or a description of Grok’s current architecture.",
  "authors": [
    "Igor Babuschkin"
  ],
  "authors_in_source_order": [
    "Igor Babuschkin"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:41.335262+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "xai::S1",
  "title": "About - Igor Babuschkin",
  "url": "https://babuschk.in/about.html"
}

This is Babuschkin’s self-authored retrospective, not independent verification of internal task allocation or a description of Grok’s current architecture.

This is Babuschkin’s self-authored retrospective, not independent verification of internal task allocation or a description of Grok’s current architecture.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Meta FAIR / open research lab

Meta AI’s profile of Joelle Pineau illustrates a research strand concerned with planning and learning under partial observability.

The profile describes her work on new models and algorithms for complex domains where the system cannot observe the full state.

It connects those algorithms with applications in robotics, health care, games, and conversational agents.

Sources and details

Meta FAIR / open research lab

{
  "access_scope": "The cached institutional profile supports this named researcher’s stated research interests; it does not establish the whole FAIR lab’s current leadership, an open-source policy, or clinically validated results.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:34.885949+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "meta-fair::S1",
  "title": "Meta FAIR / open research lab",
  "url": "https://ai.meta.com/people/1914216782353556/joelle-pineau/"
}

The cached institutional profile supports this named researcher’s stated research interests; it does not establish the whole FAIR lab’s current leadership, an open-source policy, or clinically validated results.

The cached institutional profile supports this named researcher’s stated research interests; it does not establish the whole FAIR lab’s current leadership, an open-source policy, or clinically validated results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2013
}

Moonshot AI / Kimi

A GeekPark interview presents Moonshot’s early Kimi Chat strategy through founder Yang Zhilin’s account of long context and product development.

Yang argues that persistent context matters for an AI companion whose trust and complex interactions develop over long periods.

He distinguishes training data that determines model capability from test data that determines product usability, tying model development to the definition of useful scenarios.

Sources and details

"Different Organizations Allow Different Things to Emerge": Yang Zhilin's First In-Depth Interview | GeekPark

{
  "access_scope": "This edited English publication preserves a November 2023 conversation; its early closed-source strategy and founder’s aspirations are distinct from later Kimi versions or demonstrated lifelong companionship.",
  "authors": [
    "Lilyann Zhao"
  ],
  "authors_in_source_order": [
    "Lilyann Zhao"
  ],
  "dates": {
    "inspected_source_date_1": "2026-07-30 publication; interview recorded November 2023",
    "retrieved_utc": "2026-10-07T17:56:32.818654+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-07-30 publication; interview recorded November 2023"
  ],
  "id": "moonshot::S1",
  "title": "\"Different Organizations Allow Different Things to Emerge\": Yang Zhilin's First In-Depth Interview | GeekPark",
  "url": "https://about.geekpark.net/different-organizations-allow-different-things-to-emerge-yang-zhilin-s-first-in-depth-interview/"
}

This edited English publication preserves a November 2023 conversation; its early closed-source strategy and founder’s aspirations are distinct from later Kimi versions or demonstrated lifelong companionship.

This edited English publication preserves a November 2023 conversation; its early closed-source strategy and founder’s aspirations are distinct from later Kimi versions or demonstrated lifelong companionship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

Jagged frontier / human–AI collaboration

The jagged-frontier working paper examines how GPT-4 assistance changes performance on consulting tasks with different demands.

Its preregistered experiment randomly assigned 758 Boston Consulting Group consultants to no AI access, GPT-4 access, or GPT-4 access with a prompt-engineering overview after establishing a performance baseline.

The authors report faster, higher-quality work on tasks within the model’s capability frontier, but a lower likelihood of correct solutions on a task selected to lie outside it.

Sources and details

Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality

{
  "access_scope": "These are findings from the September 2023 draft and its GPT-4 consulting-task experiment, not a universal productivity guarantee, results for later models, or individual research-task credit.",
  "authors": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "authors_in_source_order": [
    "Fabrizio Dell’Acqua",
    "Edward McFowland III",
    "Ethan Mollick",
    "Hila Lifshitz-Assaf",
    "Katherine C. Kellogg",
    "Saran Rajendran",
    "Lisa Krayer",
    "François Candelon",
    "Karim R. Lakhani"
  ],
  "dates": {
    "inspected_source_date_1": "2023-09-22; Working Paper 24-013",
    "retrieved_utc": "2026-10-07T17:55:37.286017+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023-09-22; Working Paper 24-013"
  ],
  "id": "jagged-frontier-cointelligence::S1",
  "title": "Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of AI on Knowledge Worker Productivity and Quality",
  "url": "https://mitsloan.mit.edu/sites/default/files/2023-10/SSRN-id4573321.pdf"
}

These are findings from the September 2023 draft and its GPT-4 consulting-task experiment, not a universal productivity guarantee, results for later models, or individual research-task credit.

These are findings from the September 2023 draft and its GPT-4 consulting-task experiment, not a universal productivity guarantee, results for later models, or individual research-task credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2023
}

MEDVi / service boundaries and accountability

MEDVi’s official communication draws boundaries between its platform, clinical decisions, and pharmacy services.

Its disclosures say the online assessment does not create a doctor-patient relationship and that an OpenLoop Health clinician determines prescription eligibility after checkout.

The page also says MEDVi does not produce compounded medications or control pharmacy services and acknowledges that some website materials may be generated or enhanced with AI.

Sources and details

MEDVi - Personalized Telehealth Care

{
  "access_scope": "This describes MEDVi’s own communication and service disclaimers, not an independent finding about regulatory disputes, drug safety or treatment efficacy, and supplies no medical recommendation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2026-04-08 communication",
    "retrieved_utc": "2026-10-07T17:56:46.555382+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-04-08 communication"
  ],
  "id": "medvi-service-boundaries::S1",
  "title": "MEDVi - Personalized Telehealth Care",
  "url": "https://home.medvi.org/communication"
}

This describes MEDVi’s own communication and service disclaimers, not an independent finding about regulatory disputes, drug safety or treatment efficacy, and supplies no medical recommendation.

This describes MEDVi’s own communication and service disclaimers, not an independent finding about regulatory disputes, drug safety or treatment efficacy, and supplies no medical recommendation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2026
}

Rock’s law / Moore’s second law

Gordon E. Moore’s lithography paper describes an economic pressure accompanying successive generations of semiconductor manufacturing.

It connects higher production-tool costs and additional processing layers with rising costs for a balanced wafer-production facility.

Moore argues that improving yields and equipment utilization can no longer offset those increases, creating tension between capital costs and industry revenue growth.

Sources and details

Lithography and the Future of Moore's Law

{
  "access_scope": "This is Moore’s 1995 manufacturing-cost account, relevant to the economic concern associated with Rock’s law; it does not name Rock’s law or prove a fixed doubling interval for present-day fabs.",
  "authors": [
    "Gordon E. Moore"
  ],
  "authors_in_source_order": [
    "Gordon E. Moore"
  ],
  "dates": {
    "inspected_source_date_1": "1995; SPIE volume 2438",
    "retrieved_utc": "2026-10-07T17:54:57.428672+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1995; SPIE volume 2438"
  ],
  "id": "concept-law-rock::S1",
  "title": "Lithography and the Future of Moore's Law",
  "url": "https://www.lithoguru.com/scientist/CHE323/Moore1995.pdf"
}

This is Moore’s 1995 manufacturing-cost account, relevant to the economic concern associated with Rock’s law; it does not name Rock’s law or prove a fixed doubling interval for present-day fabs.

This is Moore’s 1995 manufacturing-cost account, relevant to the economic concern associated with Rock’s law; it does not name Rock’s law or prove a fixed doubling interval for present-day fabs.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bremermann’s limit

Bremermann’s 1962 talk proposes a universal upper bound on the data-processing rate of artificial and biological systems.

The conjecture counts bits transmitted through internal channels and includes the power supply in the system’s total mass.

It uses the proposed bound to discuss limits on exhaustive search and on the quantity of information processed in biological evolution.

Sources and details

Optimization Through Evolution and Recombination

{
  "access_scope": "This cached transcription preserves a conjecture and its historical definitions, not a measured limit for current AI hardware or a claim that practical computers attain it.",
  "authors": [
    "H. J. Bremermann"
  ],
  "authors_in_source_order": [
    "H. J. Bremermann"
  ],
  "dates": {
    "inspected_source_date_1": "1962",
    "retrieved_utc": "2026-10-07T17:54:25.814547+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1962"
  ],
  "id": "concept-law-bremermann::S1",
  "title": "Optimization Through Evolution and Recombination",
  "url": "https://holtz.org/Library/Natural%20Science/Physics/Optimization%20Through%20Evolution%20and%20Recombination%20-%20Bremermann%201962.htm"
}

This cached transcription preserves a conjecture and its historical definitions, not a measured limit for current AI hardware or a claim that practical computers attain it.

This cached transcription preserves a conjecture and its historical definitions, not a measured limit for current AI hardware or a claim that practical computers attain it.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amara’s Law

IFTF explains Amara’s Law as the tendency to exaggerate a technology’s short-term effects while overlooking its longer-term influence.

The newsletter connects that observation with both overhyped innovations that fade and gradual changes that reshape industries.

It presents the Ten-Year Forecast as a way to examine possibilities ahead by tracing weak present-day signals toward potential future developments.

Sources and details

IFTF Newsletter #15: Urgent Futures Likely to Reshape the Next Decade

{
  "access_scope": "This is IFTF’s institutional explanation and foresight framing; the law is an observation rather than a quantified predictive model, and forecasts are not established future outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2025 forecast newsletter context",
    "retrieved_utc": "2026-10-07T17:54:55.877877+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025 forecast newsletter context"
  ],
  "id": "concept-law-amara::S1",
  "title": "IFTF Newsletter #15: Urgent Futures Likely to Reshape the Next Decade",
  "url": "https://www.linkedin.com/pulse/urgent-futures-likely-reshape-next-decade-institute-for-the-future-kdj7c"
}

This is IFTF’s institutional explanation and foresight framing; the law is an observation rather than a quantified predictive model, and forecasts are not established future outcomes.

This is IFTF’s institutional explanation and foresight framing; the law is an observation rather than a quantified predictive model, and forecasts are not established future outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sayre’s Law

Benjamin Zimmer’s archived correspondence traces Sayre’s Law as a remark about intense disputes over low-value stakes.

He reports that Herbert Kaufman corrected an attribution to Kissinger in a 1977 letter and pointed to a broader formulation credited to Sayre in Charles Issawi’s 1973 book.

The message connects that general formulation with the familiar observation about bitter academic politics while noting that the quotation circulates under several names.

Sources and details

Sayre’s Law

{
  "access_scope": "This is Zimmer’s 2005 report of a quotation trail and other correspondents’ findings, not direct inspection of the cited 1973 and 1977 originals or an empirical law of conflict.",
  "authors": [
    "Benjamin Zimmer"
  ],
  "authors_in_source_order": [
    "Benjamin Zimmer"
  ],
  "dates": {
    "inspected_source_date_1": "2005-02-04",
    "retrieved_utc": "2026-10-07T17:54:28.808189+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2005-02-04"
  ],
  "id": "concept-law-sayre::S1",
  "title": "Sayre’s Law",
  "url": "https://listserv.linguistlist.org/pipermail/ads-l/2005-February/045806.html"
}

This is Zimmer’s 2005 report of a quotation trail and other correspondents’ findings, not direct inspection of the cited 1973 and 1977 originals or an empirical law of conflict.

This is Zimmer’s 2005 report of a quotation trail and other correspondents’ findings, not direct inspection of the cited 1973 and 1977 originals or an empirical law of conflict.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Littlewood’s Law of Miracles

Freeman Dyson’s account of Littlewood’s Law explains why striking coincidences can arise without invoking paranormal causes.

It defines a miracle for this argument as a personally significant event with an assumed probability of one in a million.

Counting roughly one noticed event per second over eight waking hours gives about a million opportunities each month, making such an event plausible on average under those assumptions.

Sources and details

One in a Million | Freeman Dyson | The New York Review of Books

{
  "access_scope": "This is Dyson’s explanatory book review and approximate counting argument, not a measured guarantee of monthly miracles for each person or evidence of supernatural effects.",
  "authors": [
    "Freeman Dyson"
  ],
  "authors_in_source_order": [
    "Freeman Dyson"
  ],
  "dates": {
    "inspected_source_date_1": "2004-03-25",
    "retrieved_utc": "2026-10-07T17:54:59.112851+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2004-03-25"
  ],
  "id": "concept-law-littlewood::S1",
  "title": "One in a Million | Freeman Dyson | The New York Review of Books",
  "url": "https://www.nybooks.com/articles/2004/03/25/one-in-a-million/"
}

This is Dyson’s explanatory book review and approximate counting argument, not a measured guarantee of monthly miracles for each person or evidence of supernatural effects.

This is Dyson’s explanatory book review and approximate counting argument, not a measured guarantee of monthly miracles for each person or evidence of supernatural effects.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luc Besson

EuropaCorp’s profile places Luc Besson’s career at the intersection of directing, producing, and building a film company.

It traces his directing work from the early 1980s through films including The Fifth Element, Lucy, and Valerian and the City of a Thousand Planets.

The account identifies him as EuropaCorp’s founder in 1999 and records an artistic-director and interim-CEO role bounded by February 29, 2024.

Sources and details

Governance - EuropaCorp

{
  "access_scope": "This company biography describes career and historical governance roles; it does not establish a current CEO appointment or attribute an AI technique or production mechanism to Besson.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "profile role explicitly bounded through 2024-02-29",
    "retrieved_utc": "2026-10-07T17:55:32.490033+00:00"
  },
  "dates_exact_in_source_role_order": [
    "profile role explicitly bounded through 2024-02-29"
  ],
  "id": "creative-person-coverage-c0d2b32a000d65::S1",
  "title": "Governance - EuropaCorp",
  "url": "https://europacorp.com/en/espace-investisseurs/gouvernance?slug=conseil-dadministration"
}

This company biography describes career and historical governance roles; it does not establish a current CEO appointment or attribute an AI technique or production mechanism to Besson.

This company biography describes career and historical governance roles; it does not establish a current CEO appointment or attribute an AI technique or production mechanism to Besson.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Keanu Reeves

Keanu Reeves is credited as Neo in Cannes’ restored-copy listing for The Matrix.

The synopsis places him and Laurence Fishburne at the head of a revolt intended to free humanity from powerful machines.

That revolt unfolds within the film’s premise that the apparently real surrounding world is an illusion imposed by artificial intelligence.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "This describes Reeves’s credited fictional role and the Cannes synopsis; it does not infer his personal views, technical AI work, or a separate performance method. The 2008 festival listing is distinct from the film’s 1999 production.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 production; 2008 Cannes Classics restored-copy listing",
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 production; 2008 Cannes Classics restored-copy listing"
  ],
  "id": "creative-person-coverage-796d63d21697d2::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

This describes Reeves’s credited fictional role and the Cannes synopsis; it does not infer his personal views, technical AI work, or a separate performance method. The 2008 festival listing is distinct from the film’s 1999 production.

This describes Reeves’s credited fictional role and the Cannes synopsis; it does not infer his personal views, technical AI work, or a separate performance method. The 2008 festival listing is distinct from the film’s 1999 production.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scarlett Johansson

Scarlett Johansson is explicitly linked to Samantha, the operating-system voice in Annapurna’s synopsis of Her.

The account describes Samantha as insightful, sensitive, and funny when Theodore first encounters the new system.

As her needs and desires develop alongside his, their friendship becomes the film’s unconventional love story.

Sources and details

Her

{
  "access_scope": "This is the fictional character and relationship described by the distributor; it does not attribute operating-system engineering or an unstated acting technique to Johansson. The synopsis’s full name is the identity proof despite the cast list’s shortened spelling.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:19.819036+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "creative-person-coverage-13994bed8f288d::S1",
  "title": "Her",
  "url": "https://www.annapurna.com/film/her"
}

This is the fictional character and relationship described by the distributor; it does not attribute operating-system engineering or an unstated acting technique to Johansson. The synopsis’s full name is the identity proof despite the cast list’s shortened spelling.

This is the fictional character and relationship described by the distributor; it does not attribute operating-system engineering or an unstated acting technique to Johansson. The synopsis’s full name is the identity proof despite the cast list’s shortened spelling.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alicia Vikander

Alicia Vikander plays Ava, the AI experiment at the center of A24’s Ex Machina synopsis.

Caleb is brought to a secluded estate to evaluate Ava’s capabilities and possible consciousness as the human component of a Turing Test.

The synopsis describes Ava’s emotional intelligence as more sophisticated and deceptive than the two men anticipated.

Sources and details

Ex Machina | A24

{
  "access_scope": "These are A24’s fictional premise and actor-character binding, not a validated consciousness test, claims about real AI, or an inferred personal acting or engineering method.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2015",
    "retrieved_utc": "2026-10-07T17:55:03.689815+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015"
  ],
  "id": "creative-person-coverage-18d87c87a3fa83::S1",
  "title": "Ex Machina | A24",
  "url": "https://a24films.com/films/ex-machina"
}

These are A24’s fictional premise and actor-character binding, not a validated consciousness test, claims about real AI, or an inferred personal acting or engineering method.

These are A24’s fictional premise and actor-character binding, not a validated consciousness test, claims about real AI, or an inferred personal acting or engineering method.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robin Williams

Robin Williams is credited as Andrew Martin in Disney’s account of Bicentennial Man.

Andrew begins as an android assigned menial tasks but displays curiosity, creativity, and unexpectedly human emotions.

Across two centuries with successive generations of the Martin family, the story follows his ambition to become human through experiences of life and love.

Sources and details

Bicentennial Man (film) - D23

{
  "access_scope": "This is the film’s fictional arc and cast credit; it does not establish real android emotion or infer Williams’s performance technique. The source distinguishes the Asimov short story from the Asimov–Silverberg novel adaptation basis.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999-12-17 release",
    "retrieved_utc": "2026-10-07T17:55:31.407834+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999-12-17 release"
  ],
  "id": "creative-person-coverage-602649f73a925a::S1",
  "title": "Bicentennial Man (film) - D23",
  "url": "https://d23.com/a-to-z/bicentennial-man-film/"
}

This is the film’s fictional arc and cast credit; it does not establish real android emotion or infer Williams’s performance technique. The source distinguishes the Asimov short story from the Asimov–Silverberg novel adaptation basis.

This is the film’s fictional arc and cast credit; it does not establish real android emotion or infer Williams’s performance technique. The source distinguishes the Asimov short story from the Asimov–Silverberg novel adaptation basis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Haley Joel Osment

Haley Joel Osment is identified as David, the prototype robot child in Warner Bros.’ Italian synopsis of A.I. Artificial Intelligence.

David is programmed to express unconditional love, leaving his human family unprepared for the consequences.

After becoming isolated in a dangerous world, he is helped by Gigolo Joe and begins a search for the secret of his identity.

Sources and details

A.I. intelligenza artificiale - Warner Bros. Entertainment Italia

{
  "access_scope": "This paraphrases the Italian distributor’s fictional character arc, not an account of real AI emotion or Osment’s personal performance method. The listed January 2011 availability is not asserted as the original film release.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2011-01-27 listed availability; distinct from original film release",
    "retrieved_utc": "2026-10-07T17:56:11.909738+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2011-01-27 listed availability; distinct from original film release"
  ],
  "id": "creative-person-coverage-b6556a602c30ba::S1",
  "title": "A.I. intelligenza artificiale - Warner Bros. Entertainment Italia",
  "url": "https://www.warnerbros.it/scheda-film/genere-fantascienza/ai-intelligenza-artificiale/"
}

This paraphrases the Italian distributor’s fictional character arc, not an account of real AI emotion or Osment’s personal performance method. The listed January 2011 availability is not asserted as the original film release.

This paraphrases the Italian distributor’s fictional character arc, not an account of real AI emotion or Osment’s personal performance method. The listed January 2011 availability is not asserted as the original film release.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Koji Yakusho

Koji Yakusho is credited as the ship captain in the Pulse booklet, with Chuck Stephens’s essay describing his part in the film’s closing frame.

Stephens recounts the captain’s last-ditch voyage toward Latin America while Tokyo burns behind him.

The essay interprets him as a hapless heroic survivor and compares that image with Mike Hammer escaping catastrophe at the end of Kiss Me Deadly.

Sources and details

Pulse booklet / The Smudge

{
  "access_scope": "This is Stephens’s critical interpretation of a fictional performance, not Yakusho’s own statement, AI research, or proof of a specific acting technique. Film creators and essay authors remain separate.",
  "authors": [
    "Chuck Stephens"
  ],
  "authors_in_source_order": [
    "Chuck Stephens"
  ],
  "dates": {
    "inspected_source_date_1": "2001-02-03 original film release; booklet essay date not asserted",
    "retrieved_utc": "2026-10-07T17:55:16.198684+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2001-02-03 original film release; booklet essay date not asserted"
  ],
  "id": "creative-person-coverage-0fbb695da7c39f::S1",
  "title": "Pulse booklet / The Smudge",
  "url": "https://s1.thcdn.com/design-assets/documents/arrowfilms/Pulse.pdf"
}

This is Stephens’s critical interpretation of a fictional performance, not Yakusho’s own statement, AI research, or proof of a specific acting technique. Film creators and essay authors remain separate.

This is Stephens’s critical interpretation of a fictional performance, not Yakusho’s own statement, AI research, or proof of a specific acting technique. Film creators and essay authors remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yul Brynner

Yul Brynner is identified as the main robot in Michael Crichton’s account of creating Westworld’s machine-point-of-view imagery.

Crichton explains that he wanted filmed scenes processed by a computer to suggest the robot’s way of seeing.

The account credits John Whitney Jr. with carrying out that image-processing work, keeping Brynner’s onscreen role separate from the effects process.

Sources and details

Westworld - Michael Crichton

{
  "access_scope": "This is an estate-hosted retrospective about the 1973 fictional film, with Crichton’s embedded first-person account; Brynner is the actor, not the programmer or author of the quoted production history, and the later HBO adaptation is separate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1973 original film; retrospective quotations",
    "retrieved_utc": "2026-10-07T17:55:36.533263+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1973 original film; retrospective quotations"
  ],
  "id": "creative-person-coverage-e45e5df08a663b::S1",
  "title": "Westworld - Michael Crichton",
  "url": "https://michaelcrichton.com/works/westworld/"
}

This is an estate-hosted retrospective about the 1973 fictional film, with Crichton’s embedded first-person account; Brynner is the actor, not the programmer or author of the quoted production history, and the later HBO adaptation is separate.

This is an estate-hosted retrospective about the 1973 fictional film, with Crichton’s embedded first-person account; Brynner is the actor, not the programmer or author of the quoted production history, and the later HBO adaptation is separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jerry Liu

Jerry Liu’s GitHub profile lists public projects spanning document parsing, classification, and application demonstrations.

The LiteParse samples repository is described as interactive demonstrations of a fast, local, model-free document parser.

The docjev repository is described as a fast document classifier and splitter, alongside separate form-filling and presentation app repositories.

Sources and details

jerryjliu (Jerry Liu) · GitHub

{
  "access_scope": "This is a cached public-profile repository listing and its descriptions, not inspection of implementation code, sole authorship, measured performance, or proof that every listed project uses a language model.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:24.593092+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "ai-contribution-person-coverage-5d6a772e300ba0::S1",
  "title": "jerryjliu (Jerry Liu) · GitHub",
  "url": "https://github.com/jerryjliu"
}

This is a cached public-profile repository listing and its descriptions, not inspection of implementation code, sole authorship, measured performance, or proof that every listed project uses a language model.

This is a cached public-profile repository listing and its descriptions, not inspection of implementation code, sole authorship, measured performance, or proof that every listed project uses a language model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rene Haas

Arm’s leadership profile connects Rene Haas’s executive tenure with a shift toward broader compute offerings for AI workloads.

It says Arm expanded beyond IP licensing into compute subsystems and production silicon while strengthening its presence in data centers, automotive systems, and computing.

The account links that direction with his earlier leadership of the IP Products Group, where it describes a more diversified portfolio and increased investment in Arm’s software ecosystem.

Sources and details

Leadership – Arm®

{
  "access_scope": "These are Arm’s institutional claims about executive leadership, not independent causal proof, measured AI-system performance, or attribution of chip-design tasks personally to Haas.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "CEO and board roles since February 2022, per cached profile",
    "retrieved_utc": "2026-10-07T17:54:47.047820+00:00"
  },
  "dates_exact_in_source_role_order": [
    "CEO and board roles since February 2022, per cached profile"
  ],
  "id": "ai-contribution-person-coverage-75ebfdfbe3ded1::S1",
  "title": "Leadership – Arm®",
  "url": "https://www.arm.com/company/leadership"
}

These are Arm’s institutional claims about executive leadership, not independent causal proof, measured AI-system performance, or attribution of chip-design tasks personally to Haas.

These are Arm’s institutional claims about executive leadership, not independent causal proof, measured AI-system performance, or attribution of chip-design tasks personally to Haas.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lip-Bu Tan

Intel’s 2025 annual filing places Lip-Bu Tan’s leadership in the context of semiconductor software, company governance, and venture investment.

The executive-officer account says he became Intel CEO in March 2025 after earlier serving on its board, and records his previous CEO and executive-chair roles at Cadence.

It also identifies him as the founder and chairman of Walden International and a founding managing partner of Celesta Capital and Walden Catalyst Ventures.

Sources and details

intc-20251227

{
  "access_scope": "This is Intel’s filed executive biography for fiscal 2025; it does not identify Tan’s personal AI implementation tasks or independently prove that company-wide technical results were caused by him.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2025 fiscal year ended 2025-12-27",
    "retrieved_utc": "2026-10-07T17:54:53.489604+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025 fiscal year ended 2025-12-27"
  ],
  "id": "ai-contribution-person-coverage-5a537010b8b38d::S1",
  "title": "intc-20251227",
  "url": "https://www.intc.com/filings-reports/all-sec-filings/content/0000050863-26-000011/intc-20251227.htm"
}

This is Intel’s filed executive biography for fiscal 2025; it does not identify Tan’s personal AI implementation tasks or independently prove that company-wide technical results were caused by him.

This is Intel’s filed executive biography for fiscal 2025; it does not identify Tan’s personal AI implementation tasks or independently prove that company-wide technical results were caused by him.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hannu Rajaniemi

Hachette’s description of Hannu Rajaniemi’s The Quantum Thief introduces Jean le Flambeur as a post-human criminal known for stealing thoughts from vast Zeusbrains.

It places him in the Dilemma Prison, where he plays repeated game-theoretic confrontations against copies of himself.

Mieli and her spidership offer escape and the return of his former powers in exchange for completing an unfinished heist.

Sources and details

The Quantum Thief by Hannu Rajaniemi - Hachette Australia

{
  "access_scope": "Publisher synopsis of named fictional work; no full novel audit, real mind-copying or measured AI strategy claim; ebook, paperback and audiobook manifestations distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "audiobook_publication": "Nov 29, 2011",
    "ebook_publication": "Sept 30, 2010",
    "paperback_publication": "Jan 10, 2012",
    "retrieved_utc": "2026-10-07T18:16:54.527800+00:00"
  },
  "id": "person-coverage-91cf28e1b8dfb3::S1",
  "title": "The Quantum Thief by Hannu Rajaniemi - Hachette Australia",
  "url": "https://www.hachette.com.au/hannu-rajaniemi/the-quantum-thief-the-epic-hard-sf-heist-thriller-for-fans-of-the-matrix-and-neuromancer"
}

Publisher synopsis of named fictional work; no full novel audit, real mind-copying or measured AI strategy claim; ebook, paperback and audiobook manifestations distinct.

Publisher synopsis of named fictional work; no full novel audit, real mind-copying or measured AI strategy claim; ebook, paperback and audiobook manifestations distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hemant Taneja

Hemant Taneja and Hirsh Jain’s October 2025 announcement presents Percepta as a General Catalyst company embedding researchers, engineers and product managers inside enterprises to support AI adoption.

They describe its Mosaic platform as coordinating products and work across models, data infrastructure and workforce adoption.

The announcement separately names Athul Paul Jacob and Costis Daskalakis as leaders of a research lab combining foundation models, reinforcement learning, optimization and game theory.

Sources and details

Unveiling Percepta

{
  "access_scope": "Dated coauthored investor/company announcement; proposed adoption approach is not independently measured success, research-lab roles not attributed personally to Taneja.",
  "authors": [
    "Hemant Taneja",
    "Hirsh Jain"
  ],
  "authors_in_source_order": [
    "Hemant Taneja",
    "Hirsh Jain"
  ],
  "dates": {
    "published": "October 2, 2025",
    "retrieved_utc": "2026-10-07T18:11:28.438273+00:00"
  },
  "id": "person-coverage-0195f06ca5a48c::S1",
  "title": "Unveiling Percepta",
  "url": "https://www.generalcatalyst.com/stories/unveiling-percepta"
}

Dated coauthored investor/company announcement; proposed adoption approach is not independently measured success, research-lab roles not attributed personally to Taneja.

Dated coauthored investor/company announcement; proposed adoption approach is not independently measured success, research-lab roles not attributed personally to Taneja.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henry Farrell

In a publisher-hosted excerpt from Underground Empire, Henry Farrell and Abraham Newman argue that networks built for global markets can concentrate power at a few strategic choke points.

Their account of Walter Wriston connects financial flows, payment systems and information networks with institutions and territory subject to US authority.

The excerpt contrasts his expectation that information technology would weaken governments with the authors’ argument that concentrated networks created new openings for state power.

Sources and details

Underground Empire

{
  "access_scope": "Jointly authored chapter excerpt only; no full-book audit, current sanctions claim or separate allocation of Farrell’s research contribution; historical subject Wriston is not a book author.",
  "authors": [
    "Henry Farrell",
    "Abraham Newman"
  ],
  "authors_in_source_order": [
    "Henry Farrell",
    "Abraham Newman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:50.192781+00:00"
  },
  "id": "person-coverage-cba5dc69eb316c::S1",
  "title": "Underground Empire",
  "url": "https://us.macmillan.com/books/9781250840554/undergroundempire/"
}

Jointly authored chapter excerpt only; no full-book audit, current sanctions claim or separate allocation of Farrell’s research contribution; historical subject Wriston is not a book author.

Jointly authored chapter excerpt only; no full-book audit, current sanctions claim or separate allocation of Farrell’s research contribution; historical subject Wriston is not a book author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hinrich Schütze

Hinrich Schütze and Christopher D. Manning’s Foundations of Statistical Natural Language Processing is introduced on its companion page as a textbook on statistical approaches to language.

Its contents move from mathematical and linguistic foundations to corpus-based work, n-gram inference, word-sense disambiguation and lexical acquisition.

The outline then links Markov models and probabilistic parsing with applications including machine translation, information retrieval, clustering and text categorization.

Sources and details

Foundations of Statistical Natural Language Processing

{
  "access_scope": "Companion-page description and table-of-contents scope; no full-text audit or personal chapter-task allocation, linked sample chapters explicitly prefinal and not independently read here.",
  "authors": [
    "Christopher D. Manning",
    "Hinrich Schütze"
  ],
  "authors_in_source_order": [
    "Christopher D. Manning",
    "Hinrich Schütze"
  ],
  "dates": {
    "book_published": "May 1999",
    "retrieved_utc": "2026-10-07T18:18:32.001910+00:00"
  },
  "id": "person-coverage-e643d4261a1f5d::S1",
  "title": "Foundations of Statistical Natural Language Processing",
  "url": "https://www-nlp.stanford.edu/fsnlp/promo/"
}

Companion-page description and table-of-contents scope; no full-text audit or personal chapter-task allocation, linked sample chapters explicitly prefinal and not independently read here.

Companion-page description and table-of-contents scope; no full-text audit or personal chapter-task allocation, linked sample chapters explicitly prefinal and not independently read here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Malachowsky

NVIDIA’s profile identifies Chris Malachowsky as a founder and fellow who served in senior technical and executive roles.

It describes leadership across IT, operations, and product engineering, followed by responsibility for the company’s research organization.

The profile connects his integrated-circuit design background with earlier engineering and technical-leadership positions at HP and Sun Microsystems.

Sources and details

Chris A. Malachowsky

{
  "access_scope": "Undated corporate biography; source header includes A. while body uses canonical Chris Malachowsky. Specific roles attributed, no unsupported individual GPU invention claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:43.576960+00:00"
  },
  "id": "person-coverage-74e97e57a126e3::S1",
  "title": "Chris A. Malachowsky",
  "url": "https://www.nvidia.com/en-eu/about-nvidia/governance/management-team/chris-malachowsky/"
}

Undated corporate biography; source header includes A. while body uses canonical Chris Malachowsky. Specific roles attributed, no unsupported individual GPU invention claim.

Undated corporate biography; source header includes A. while body uses canonical Chris Malachowsky. Specific roles attributed, no unsupported individual GPU invention claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Christophe Valorge

Thales Alenia Space’s June 2024 release quotes Christophe Valorge as its chief technical officer discussing the ASCEND space-data-center study.

His statement presents orbital hosting as a possible lower-impact and sovereign option; the release says substantial lifecycle emissions reductions would require a less-emissive launcher.

The account distinguishes study findings from deployment, describing further work to consolidate and optimize results rather than an operating orbital data center.

Sources and details

Thales Alenia Space reveals results of ASCEND feasibility study

{
  "access_scope": "Quoted executive role and company study account only; no personal authorship or conduct of entire study inferred, no independently verified emissions/security benefit or completed deployment.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "dateline": "June 27, 2024",
    "retrieved_utc": "2026-10-07T18:16:26.534498+00:00"
  },
  "id": "person-coverage-88e2092f9c95a4::S1",
  "title": "Thales Alenia Space reveals results of ASCEND feasibility study",
  "url": "https://www.thalesaleniaspace.com/en/press-releases/thales-alenia-space-reveals-results-ascend-feasibility-study-space-data-centers-0"
}

Quoted executive role and company study account only; no personal authorship or conduct of entire study inferred, no independently verified emissions/security benefit or completed deployment.

Quoted executive role and company study account only; no personal authorship or conduct of entire study inferred, no independently verified emissions/security benefit or completed deployment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Christopher Bishop

Christopher Bishop’s Microsoft Research article describes using costly numerical simulations as training data for deep-learning emulators.

The proposed emulators perform new scientific calculations more efficiently after training, with robustness and generality still identified as research challenges.

Bishop announces leading an AI4Science team while crediting Graphormer leadership to Tie-Yan Liu, keeping team leadership separate from a colleague’s project role.

Sources and details

AI4Science to empower the fifth paradigm of scientific discovery

{
  "access_scope": "Visible Meet the authors card and first-person account credit Bishop; HTMLauthor Alyssa Hughes retained as metadata conflict. Published2022/updated2023 versions and removed Amsterdam information kept distinct; speed claims attributed.",
  "authors": [
    "Christopher Bishop"
  ],
  "authors_in_source_order": [
    "Christopher Bishop"
  ],
  "dates": {
    "article:modified_time": [
      "2023-10-20T13:42:28+00:00"
    ],
    "article:published_time": [
      "2022-07-07T08:36:26+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:18:35.576912+00:00",
    "visible_editor_update": "October 20, 2023"
  },
  "id": "person-coverage-d83b294e858df3::S1",
  "title": "AI4Science to empower the fifth paradigm of scientific discovery",
  "url": "https://www.microsoft.com/en-us/research/blog/ai4science-to-empower-the-fifth-paradigm-of-scientific-discovery/"
}

Visible Meet the authors card and first-person account credit Bishop; HTMLauthor Alyssa Hughes retained as metadata conflict. Published2022/updated2023 versions and removed Amsterdam information kept distinct; speed claims attributed.

Visible Meet the authors card and first-person account credit Bishop; HTMLauthor Alyssa Hughes retained as metadata conflict. Published2022/updated2023 versions and removed Amsterdam information kept distinct; speed claims attributed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Claude Brice

The IEEE history account credits Claude Brice and Claude Fennema jointly with a region-analysis method for Shakey’s visual perception.

Its described pipeline groups digitized television-image pixels into regions, merges similar regions, and fits lines to the resulting boundaries.

Those processed shapes support recognition of objects and scene elements such as cubes, wedges, floors, and walls, without assigning separate stages to either researcher.

Sources and details

Milestones: SHAKEY: The World’s First Mobile Intelligent Robot, 1972

{
  "access_scope": "Historical institutional image-caption account explicitly credits joint method; subjects/image contributors not presumed document writers. No unsupported individual division of labor or sole Shakey authorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2024-02-12T18:12:59Z"
    ],
    "article:published_time": [
      "2024-02-12T18:12:59Z"
    ],
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "id": "person-claudebrice::S1",
  "title": "Milestones: SHAKEY: The World’s First Mobile Intelligent Robot, 1972",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

Historical institutional image-caption account explicitly credits joint method; subjects/image contributors not presumed document writers. No unsupported individual division of labor or sole Shakey authorship.

Historical institutional image-caption account explicitly credits joint method; subjects/image contributors not presumed document writers. No unsupported individual division of labor or sole Shakey authorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Constantinos Halkiopoulos

Constantinos Halkiopoulos is a listed coauthor of a scoping review mapping EEG measurements to affective and cognitive models.

The review surveys empirical approaches from spectral analysis to deep learning in laboratory and naturalistic settings.

It emphasizes limitations including individual variation, spatial resolution, and overlapping signatures, calling for methodological standardization and neural-data privacy frameworks.

Sources and details

Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective

{
  "access_scope": "2025 interdisciplinary review, not clinical diagnosis validation or personal assignment of specific experiments. XMLacademic editor Shuai Li excluded from authors.",
  "authors": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "authors_in_source_order": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:31.090703+00:00",
    "xml_pub_dates": [
      {
        "attributes": {
          "pub-type": "epub"
        },
        "day": "01",
        "month": "11",
        "year": "2025"
      },
      {
        "attributes": {
          "pub-type": "collection"
        },
        "day": null,
        "month": "11",
        "year": "2025"
      }
    ]
  },
  "id": "person-coverage-3e781c71fdc969::S1",
  "title": "Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective",
  "url": "https://www.ebi.ac.uk/europepmc/webservices/rest/PMC12649996/fullTextXML"
}

2025 interdisciplinary review, not clinical diagnosis validation or personal assignment of specific experiments. XMLacademic editor Shuai Li excluded from authors.

2025 interdisciplinary review, not clinical diagnosis validation or personal assignment of specific experiments. XMLacademic editor Shuai Li excluded from authors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Corey J. Maley

Corey J. Maley is a listed coauthor of Panpsychism and AI consciousness, an argument conditional on panpsychist assumptions.

The paper relates analog covariation in physical and phenomenal magnitudes to the possibility of coherent experience at a larger scale.

It argues that digital representations may abstract away from those magnitudes, making phenomenal coherence problematic under that framework rather than proving all AI unconscious.

Sources and details

Panpsychism and AI consciousness

{
  "access_scope": "Publisher abstract and author metadata, onlineMay2022 versus Juneissue distinct; conditional philosophical claim, no experimentally established consciousness test.",
  "authors": [
    "Arvan, Marcus",
    "Maley, Corey J."
  ],
  "authors_in_source_order": [
    "Arvan, Marcus",
    "Maley, Corey J."
  ],
  "dates": {
    "citation_online_date": [
      "2022/05/31"
    ],
    "citation_publication_date": [
      "2022/06"
    ],
    "retrieved_utc": "2026-10-07T18:15:23.894002+00:00"
  },
  "id": "person-coverage-6c9baa9c89904a::S1",
  "title": "Panpsychism and AI consciousness",
  "url": "https://doi.org/10.1007/s11229-022-03695-x"
}

Publisher abstract and author metadata, onlineMay2022 versus Juneissue distinct; conditional philosophical claim, no experimentally established consciousness test.

Publisher abstract and author metadata, onlineMay2022 versus Juneissue distinct; conditional philosophical claim, no experimentally established consciousness test.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cynthia Breazeal

Cynthia Breazeal is a listed coauthor of a comparative study of empathy toward human-written and AI-written personal stories.

The study uses 985 crowdsourced participants, varies disclosure of story authorship, and combines self-reported empathy comparisons with qualitative feedback analysis.

The authors report greater empathy toward human stories in most conditions and greater willingness to empathize with AI stories when authorship is disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Crossref-deposited full abstract; reported short-study perceptions, not intrinsic AI empathy or validated mental-health outcomes. Ordered six authors preserved; no individual task assignment.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "issued": {
      "date-parts": [
        [
          2024,
          9,
          25
        ]
      ]
    },
    "published": {
      "date-parts": [
        [
          2024,
          9,
          25
        ]
      ]
    },
    "published-online": {
      "date-parts": [
        [
          2024,
          9,
          25
        ]
      ]
    },
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-c0367542bf2bd4::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Crossref-deposited full abstract; reported short-study perceptions, not intrinsic AI empathy or validated mental-health outcomes. Ordered six authors preserved; no individual task assignment.

Crossref-deposited full abstract; reported short-study perceptions, not intrinsic AI empathy or validated mental-health outcomes. Ordered six authors preserved; no individual task assignment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dan Jurafsky

Pearson credits Daniel Jurafsky and James H. Martin as the authors of the second edition of Speech and Language Processing.

The publisher describes integrating speech and text processing through statistical, machine-learning, and rule-based approaches with scientific evaluation.

Its specified coverage includes hidden Markov models for sequence labeling, information extraction, speech recognition, and synthesis, with worked examples and methodology boxes.

Sources and details

Speech and Language Processing, 2nd edition

{
  "access_scope": "Book-authorship credit distinct from anonymous publisher copy. Header Daniel Jurafsky and associated Author bios Dan Jurafsky explicitly establish both source name variants; edition May2008publication and2009copyright remain distinct, no current-edition or individual chapter-role inference.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "copyright": "2009",
    "retrieved_utc": "2026-10-07T18:17:27.207578+00:00",
    "visible_publication": "May 16, 2008"
  },
  "id": "person-coverage-a0b0c8a28e5232::S1",
  "title": "Speech and Language Processing, 2nd edition",
  "url": "https://www.pearson.com/en-us/subject-catalog/p/redirected-product/P200000003540?view=educator"
}

Book-authorship credit distinct from anonymous publisher copy. Header Daniel Jurafsky and associated Author bios Dan Jurafsky explicitly establish both source name variants; edition May2008publication and2009copyright remain distinct, no current-edition or individual chapter-role inference.

Book-authorship credit distinct from anonymous publisher copy. Header Daniel Jurafsky and associated Author bios Dan Jurafsky explicitly establish both source name variants; edition May2008publication and2009copyright remain distinct, no current-edition or individual chapter-role inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Suarez

In his May 2015 interview, Daniel Suarez connects nearly two decades in software work with his fiction about technological change.

He says he researches emerging technologies and considers how disruptive changes can reshape industries and political and economic power.

He argues for embracing technology while retaining transparency and checks on centralized digital platforms, presenting those views as his own rather than predictions proven by his novels.

Sources and details

Carsten Kuhr Interviews Daniel Suarez

{
  "access_scope": "English original interview hosted on author site, distinct from German magazine translation; interviewer and respondent roles preserved. Personal perspective, not established forecast or operational advice.",
  "authors": [
    "Carsten Kuhr",
    "Daniel Suarez"
  ],
  "authors_in_source_order": [
    "Carsten Kuhr",
    "Daniel Suarez"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:40.102185+00:00",
    "source_context": "Phantastisch Issue 62, May 2015"
  },
  "id": "person-coverage-2a8711a2248426::S1",
  "title": "Carsten Kuhr Interviews Daniel Suarez",
  "url": "https://daniel-suarez.com/PhantastischInterviewInEnglish.html"
}

English original interview hosted on author site, distinct from German magazine translation; interviewer and respondent roles preserved. Personal perspective, not established forecast or operational advice.

English original interview hosted on author site, distinct from German magazine translation; interviewer and respondent roles preserved. Personal perspective, not established forecast or operational advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David H. Autor

David H. Autor is the credited author of an essay explaining why automation can both substitute for and complement labor.

It relates productivity and output growth to increased labor demand while discussing changes in job types and wages.

The essay argues that routine codifiable tasks are more substitutable, while human comparative advantage can persist in problem solving, adaptability, and creativity.

Sources and details

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

{
  "access_scope": "2015 sole-author essay abstract; historical analysis and author forecasts, no unconditional current employment prediction. Septembercitation metadata versus Summerissue preserved.",
  "authors": [
    "David H. Autor"
  ],
  "authors_in_source_order": [
    "David H. Autor"
  ],
  "dates": {
    "citation_publication_date": [
      "2015/09"
    ],
    "retrieved_utc": "2026-10-07T18:21:09.447371+00:00",
    "visible_issue": "Summer 2015"
  },
  "id": "person-local-davidhautor::S1",
  "title": "Why Are There Still So Many Jobs? The History and Future of Workplace Automation",
  "url": "https://www.aeaweb.org/articles?id=10.1257/jep.29.3.3"
}

2015 sole-author essay abstract; historical analysis and author forecasts, no unconditional current employment prediction. Septembercitation metadata versus Summerissue preserved.

2015 sole-author essay abstract; historical analysis and author forecasts, no unconditional current employment prediction. Septembercitation metadata versus Summerissue preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Hanson

David Hanson is the credited author of a perspective proposing that intelligence and evaluation should be treated as inseparable.

The chapter distinguishes evaluators by scope, time horizon, reflexivity, and their capacity to expand care.

It proposes embodied socially expressive robots and bio-inspired architectures as ways to investigate grounded appreciation, treating its super-good ASI goal as a research target rather than an achieved system.

Sources and details

True General Intelligence Requires Appreciation of Life: Why the Alignment Problem Cannot be Solved Top Down, but from the Root, and What Follows for Embodied AI

{
  "access_scope": "2026 conference chapter abstract; synthesis/proposal rather than proof of alignment, genuine robot emotion, or demonstrated ASI.",
  "authors": [
    "Hanson, David"
  ],
  "authors_in_source_order": [
    "Hanson, David"
  ],
  "dates": {
    "citation_publication_date": [
      "2026"
    ],
    "retrieved_utc": "2026-10-07T18:15:23.701470+00:00"
  },
  "id": "person-coverage-6d9906307aab08::S1",
  "title": "True General Intelligence Requires Appreciation of Life: Why the Alignment Problem Cannot be Solved Top Down, but from the Root, and What Follows for Embodied AI",
  "url": "https://doi.org/10.1007/978-3-032-33010-9_23"
}

2026 conference chapter abstract; synthesis/proposal rather than proof of alignment, genuine robot emotion, or demonstrated ASI.

2026 conference chapter abstract; synthesis/proposal rather than proof of alignment, genuine robot emotion, or demonstrated ASI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dawon Kahng

The Computer History Museum credits Dawon Kahng and John Atalla jointly with a successful insulated-gate field-effect transistor at Bell Labs in 1959.

Its account explains reducing obstructive surface states at the silicon–oxide interface through thermally grown silicon dioxide.

It separately attributes to Kahng a 1961 memo pointing to ease of fabrication and potential integrated-circuit use, distinguishing that personal statement from the joint device work.

Sources and details

1960: Metal Oxide Semiconductor Transistor Demonstrated

{
  "access_scope": "Institutional historical account; 1960milestone heading distinct from1959device work and1961memo. Bibliographic patent/memo writers not assigned authorship of museum page.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Kahng_memo": "1961",
    "device_account": "1959",
    "historical_milestone_heading": "1960",
    "retrieved_utc": "2026-10-07T18:19:22.862292+00:00"
  },
  "id": "person-dawonkahng::S1",
  "title": "1960: Metal Oxide Semiconductor Transistor Demonstrated",
  "url": "https://www.computerhistory.org/siliconengine/metal-oxide-semiconductor-mos-transistor-demonstrated/"
}

Institutional historical account; 1960milestone heading distinct from1959device work and1961memo. Bibliographic patent/memo writers not assigned authorship of museum page.

Institutional historical account; 1960milestone heading distinct from1959device work and1961memo. Bibliographic patent/memo writers not assigned authorship of museum page.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Hebb

McGill’s biography describes Donald Hebb advocating study of neural mechanisms rather than relying only on behavioral observations.

It identifies cell assemblies as his proposed material basis for mental concepts in the 1949 Organization of Behavior.

The account traces his work with Wilder Penfield on effects of brain lesions and his later return to McGill as a psychology professor, keeping research history distinct from the theory’s validation.

Sources and details

Donald HEBB, PhD

{
  "access_scope": "Institutional biography; D.O. Hebb abbreviation not expanded beyond canonical Donald Hebb. Cell-assembly hypothesis attributed, no medical guidance or unsupported universal physiological proof.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "McGill_return": "1947",
    "referenced_monograph": "1949",
    "retrieved_utc": "2026-10-07T18:19:27.952339+00:00"
  },
  "id": "person-donaldhebb::S1",
  "title": "Donald HEBB, PhD",
  "url": "https://www.mcgill.ca/neuro/about/donald-hebb-phd"
}

Institutional biography; D.O. Hebb abbreviation not expanded beyond canonical Donald Hebb. Cell-assembly hypothesis attributed, no medical guidance or unsupported universal physiological proof.

Institutional biography; D.O. Hebb abbreviation not expanded beyond canonical Donald Hebb. Cell-assembly hypothesis attributed, no medical guidance or unsupported universal physiological proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Michie

Edinburgh’s historical account describes Donald Michie building MENACE in 1961 to learn noughts-and-crosses play.

Its 304 matchboxes represented possible board layouts, with glass beads used to reward favorable outcomes and penalize unfavorable ones.

The article separately credits Michie and his team with Freddy robots able to identify and assemble objects, avoiding sole-person credit for that later work.

Sources and details

Looking back to the future of Edinburgh’s AI legacy

{
  "access_scope": "2023institutional retrospective with actual Rhona Crawford byline; historical demonstrations bounded, no unsupported claim all modern reinforcement learning originated with sole Michie.",
  "authors": [
    "Rhona Crawford"
  ],
  "authors_in_source_order": [
    "Rhona Crawford"
  ],
  "dates": {
    "article:modified_time": [
      "2025-03-05T11:13:42+00:00"
    ],
    "article:published_time": [
      "2023-04-03T15:15:00+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:19:14.912416+00:00",
    "visible_publication": "April 3, 2023"
  },
  "id": "person-donaldmichie::S1",
  "title": "Looking back to the future of Edinburgh’s AI legacy",
  "url": "https://impact.ed.ac.uk/research/digital-data-ai/back-to-the-future-edinburgh-ai-legacy/"
}

2023institutional retrospective with actual Rhona Crawford byline; historical demonstrations bounded, no unsupported claim all modern reinforcement learning originated with sole Michie.

2023institutional retrospective with actual Rhona Crawford byline; historical demonstrations bounded, no unsupported claim all modern reinforcement learning originated with sole Michie.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edwin Hutchins

Edwin Hutchins’ introduction to Cognition in the Wild traces the project to observing navigation and engineering work aboard a Navy ship.

He describes recording engine and helm commands and later choosing navigation as a setting for naturally situated cognition research.

The account explains how field observation shifted his focus from individual thinking to cognition distributed across a navigation team.

Sources and details

Cognition in the Wild

{
  "access_scope": "Author-hosted first-person1995book introduction; historical field account rather than experimental proof every cognitive process is distributed. No operational maritime instruction.",
  "authors": [
    "Edwin Hutchins"
  ],
  "authors_in_source_order": [
    "Edwin Hutchins"
  ],
  "dates": {
    "book_publication": "1995",
    "initial_observation": "November 1980",
    "project_start": "summer 1984",
    "retrieved_utc": "2026-10-07T18:18:29.926858+00:00"
  },
  "id": "person-coverage-d65cdbae6ac8e2::S1",
  "title": "Cognition in the Wild",
  "url": "https://pages.ucsd.edu/~ehutchins/citw.html"
}

Author-hosted first-person1995book introduction; historical field account rather than experimental proof every cognitive process is distributed. No operational maritime instruction.

Author-hosted first-person1995book introduction; historical field account rather than experimental proof every cognitive process is distributed. No operational maritime instruction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ehsan Ejazi

Ehsan Ejazi is a listed coauthor of a study examining AI in US military strategy in proxy wars from 2020 to 2024.

The abstract considers remote-control military equipment, robots, and automated guided weapons as forms through which the authors analyze that strategy.

It reports both claimed reductions in human and financial costs and concerns about civilian casualties, preserving these as the paper’s findings rather than independently established causal effects.

Sources and details

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024

{
  "access_scope": "Crossref full deposited abstract only; onlineDecember2025 distinct from printFebruary2026. No unsupported methods beyond abstract, battlefield optimization advice, or personal division of labor.",
  "authors": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "authors_in_source_order": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "dates": {
    "issued": {
      "date-parts": [
        [
          2025,
          12,
          12
        ]
      ]
    },
    "published": {
      "date-parts": [
        [
          2025,
          12,
          12
        ]
      ]
    },
    "published-online": {
      "date-parts": [
        [
          2025,
          12,
          12
        ]
      ]
    },
    "published-print": {
      "date-parts": [
        [
          2026,
          2,
          9
        ]
      ]
    },
    "retrieved_utc": "2026-10-07T18:17:39.176968+00:00"
  },
  "id": "person-coverage-b0440d67bc38ff::S1",
  "title": "The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024",
  "url": "https://api.crossref.org/works/10.21140/mcuj.20251602007"
}

Crossref full deposited abstract only; onlineDecember2025 distinct from printFebruary2026. No unsupported methods beyond abstract, battlefield optimization advice, or personal division of labor.

Crossref full deposited abstract only; onlineDecember2025 distinct from printFebruary2026. No unsupported methods beyond abstract, battlefield optimization advice, or personal division of labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elad Gil

Elad Gil’s July 2025 essay argues that some generative-AI markets had begun to show clearer likely leaders.

It links foundation-model competition to capital-intensive scaling and hyperscaler incentives, while distinguishing other model markets where winners remained uncertain.

Its coding-market discussion considers the convergence of agentic and IDE workflows and whether foundation-model firms may absorb application functionality, presenting those as open competitive questions.

Sources and details

AI Market Clarity

{
  "access_scope": "Dated personal investor essay and forecasts; rumored revenues, benchmark supremacy and eventual winners not treated as established facts. No investment advice or model-authorship attribution.",
  "authors": [
    "Elad Gil"
  ],
  "authors_in_source_order": [
    "Elad Gil"
  ],
  "dates": {
    "article:modified_time": [
      "2025-07-22T16:52:29.657Z"
    ],
    "retrieved_utc": "2026-10-07T18:10:51.570656+00:00",
    "visible_publication": "July 22, 2025"
  },
  "id": "person-coverage-03fc9dce1f17be::S1",
  "title": "AI Market Clarity",
  "url": "https://blog.eladgil.com/p/ai-market-clarity"
}

Dated personal investor essay and forecasts; rumored revenues, benchmark supremacy and eventual winners not treated as established facts. No investment advice or model-authorship attribution.

Dated personal investor essay and forecasts; rumored revenues, benchmark supremacy and eventual winners not treated as established facts. No investment advice or model-authorship attribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eliav Lieblich

Tel Aviv University’s profile describes Eliav Lieblich researching public international law, including use of force, humanitarian law, and the field’s history and theory.

It identifies him as an author of International Law and Civil Wars and a coauthor with Eyal Benvenisti of Occupation in International Law.

The profile distinguishes those books from editorial roles in a forthcoming legal-theory handbook and the Yearbook of International Humanitarian Law.

Sources and details

Prof. Eliav Lieblich

{
  "access_scope": "Institutional biography/CV; book author, coauthor and editor roles separate from profile writer. Forthcoming work not treated as published, no legal advice or attribution of coauthor-specific tasks.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "TAU_joined": "2016",
    "listed_professor_appointment": "2020–present",
    "retrieved_utc": "2026-10-07T18:13:15.670350+00:00"
  },
  "id": "person-coverage-d59f095da9d77f::S1",
  "title": "Prof. Eliav Lieblich",
  "url": "https://en-law.tau.ac.il/profile/elieblich"
}

Institutional biography/CV; book author, coauthor and editor roles separate from profile writer. Forthcoming work not treated as published, no legal advice or attribution of coauthor-specific tasks.

Institutional biography/CV; book author, coauthor and editor roles separate from profile writer. Forthcoming work not treated as published, no legal advice or attribution of coauthor-specific tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elton Mayo

A Harvard Business School interview identifies Elton Mayo and Fritz Roethlisberger with the Hawthorne studies and an understanding of organizations as social systems.

The account links that perspective to ideals, values, and organizational purpose beyond mechanistic work roles and economic action.

It explains meaningful work as enactment of shared values and purpose, presenting a later interpretation of their influence rather than a new experiment by Mayo.

Sources and details

How to Put Meaning Back into Leading

{
  "access_scope": "2005Martha Lagace Q&A with later scholars; Mayo is historical subject, not article writer/interviewee. No causal personal claim for later leadership outcomes.",
  "authors": [
    "Martha Lagace"
  ],
  "authors_in_source_order": [
    "Martha Lagace"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:11:31.584058+00:00",
    "visible_publication": "January 10, 2005"
  },
  "id": "person-eltonmayo::S1",
  "title": "How to Put Meaning Back into Leading",
  "url": "https://www.library.hbs.edu/working-knowledge/how-to-put-meaning-back-into-leading"
}

2005Martha Lagace Q&A with later scholars; Mayo is historical subject, not article writer/interviewee. No causal personal claim for later leadership outcomes.

2005Martha Lagace Q&A with later scholars; Mayo is historical subject, not article writer/interviewee. No causal personal claim for later leadership outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Erik Gafni

TypeSafe AI’s team page identifies Erik Gafni as its CTO and describes his focus on production AI systems.

It names Ravel as an earlier founding effort involving multimodal AI for DNA sequencing.

The profile also records early employment at Invitae and Freenome, distinguishing those roles from founding the listed companies or inventing all their technology.

Sources and details

Our Team — TypeSafe AI

{
  "access_scope": "Undated company biography; product and prior employer roles source-attributed, no clinical/sequence-performance validation, no transfer of colleagues’ RLHF claims to Gafni.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.821091+00:00"
  },
  "id": "person-coverage-4569e70f797918::S1",
  "title": "Our Team — TypeSafe AI",
  "url": "https://typesafe.ai/team"
}

Undated company biography; product and prior employer roles source-attributed, no clinical/sequence-performance validation, no transfer of colleagues’ RLHF claims to Gafni.

Undated company biography; product and prior employer roles source-attributed, no clinical/sequence-performance validation, no transfer of colleagues’ RLHF claims to Gafni.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Friedrich A. Hayek

Friedrich A. Hayek’s 1945 essay frames economic coordination as using knowledge dispersed among individuals rather than given to one planner.

It contrasts that information problem with optimizing resources under assumptions of complete knowledge and fixed preferences.

The argument asks how separate people’s partial and sometimes contradictory knowledge can guide resource use, preserving the essay as theoretical analysis rather than a claim all markets solve the problem.

Sources and details

The Use of Knowledge in Society

{
  "access_scope": "Historical essay reprinted with permission; original1945date distinct from webmodified2025 metadata. Sole essay writer, not current publisher writer or financial guidance.",
  "authors": [
    "Friedrich A. Hayek"
  ],
  "authors_in_source_order": [
    "Friedrich A. Hayek"
  ],
  "dates": {
    "article:modified_time": [
      "2025-02-16T14:57:00+00:00"
    ],
    "journal": "American Economic Review XXXV(4),519–530",
    "original_publication": "September 1945",
    "retrieved_utc": "2026-10-07T18:19:24.620869+00:00"
  },
  "id": "person-friedrichahayek::S1",
  "title": "The Use of Knowledge in Society",
  "url": "https://www.econlib.org/library/Essays/hykKnw.html"
}

Historical essay reprinted with permission; original1945date distinct from webmodified2025 metadata. Sole essay writer, not current publisher writer or financial guidance.

Historical essay reprinted with permission; original1945date distinct from webmodified2025 metadata. Sole essay writer, not current publisher writer or financial guidance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Greg Egan

Greg Egan’s author FAQ explains that Permutation City’s scrambled-computation scenes dramatize questions about how simulated mental states are arranged.

He acknowledges the practical difficulty of jumping between complex simulated states and describes alternative encodings as a less dramatic computational possibility.

The FAQ states that the fictional experiments prove nothing and separates the novel’s Dust Theory from a theory he takes very seriously.

Sources and details

Permutation City: The Dust Theory — Frequently Asked Questions

{
  "access_scope": "Author self-interview about fiction, not scientific evidence for simulation consciousness or a demonstrated brain algorithm. Novel1994date distinct from undated later FAQ and appended reader correction.",
  "authors": [
    "Greg Egan"
  ],
  "authors_in_source_order": [
    "Greg Egan"
  ],
  "dates": {
    "FAQ_date_context": "almost thirteen years later; exact year not inferred",
    "novel_first_publication": "1994",
    "retrieved_utc": "2026-10-07T18:20:09.574936+00:00"
  },
  "id": "person-gregegan::S1",
  "title": "Permutation City: The Dust Theory — Frequently Asked Questions",
  "url": "https://www.gregegan.net/PERMUTATION/FAQ/FAQ.html"
}

Author self-interview about fiction, not scientific evidence for simulation consciousness or a demonstrated brain algorithm. Novel1994date distinct from undated later FAQ and appended reader correction.

Author self-interview about fiction, not scientific evidence for simulation consciousness or a demonstrated brain algorithm. Novel1994date distinct from undated later FAQ and appended reader correction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

THX 1138

Lucasfilm’s history places THX 1138 at the turning point that led George Lucas to establish an independent production company.

The account describes the debut feature’s limited box-office exposure as leaving its production company, American Zoetrope, with an uncertain future.

It says Lucas sought creative independence and formed a company in Northern California to support subsequent projects, distinguishing THX 1138 from Lucasfilm’s later first production, American Graffiti.

Sources and details

Lucasfilm - Company History | Lucasfilm.com

{
  "access_scope": "This is Lucasfilm’s retrospective account of production history around the 1971 film, not a plot summary, a current financing analysis, or evidence of an AI production technique.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1971 film; corporate retrospective date not asserted",
    "retrieved_utc": "2026-10-07T18:15:07.564916+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1971 film; corporate retrospective date not asserted"
  ],
  "id": "work-culture-972174796b55ad::S1",
  "title": "Lucasfilm - Company History | Lucasfilm.com",
  "url": "https://www.lucasfilm.com/who-we-are/our-story/"
}

This is Lucasfilm’s retrospective account of production history around the 1971 film, not a plot summary, a current financing analysis, or evidence of an AI production technique.

This is Lucasfilm’s retrospective account of production history around the 1971 film, not a plot summary, a current financing analysis, or evidence of an AI production technique.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1971 feature; distinguish the earlier student short and later revised cut.",
  "dated": true,
  "year": 1971
}

Count Zero

Count Zero’s description in a literary agency’s rights guide opens with a corporate mercenary waking in a reconstructed body.

Hosaka Corporation reactivates him to extract a defecting research chief and the biochip that chief has perfected.

The mission attracts other interested parties, some of whom the description identifies as not remotely human.

Sources and details

Count Zero

{
  "access_scope": "This paraphrases the Count Zero section of the 2015 rights guide; it is a fictional premise, not biological or AI research evidence. Adjacent Neuromancer and Mona Lisa Overdrive descriptions and quoted reviewers are separate sources of claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 1986 original publication as listed; Fall 2015 rights guide",
    "retrieved_utc": "2026-10-07T18:22:21.736483+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1986 original publication as listed; Fall 2015 rights guide"
  ],
  "id": "work-culture-cbd2be82c4672e::S1",
  "title": "Count Zero",
  "url": "https://agenceelianebenisti.com/wp-content/uploads/2015/10/Sterling-Lord-Literistic-Frankfurt-2015-rights-list.pdf"
}

This paraphrases the Count Zero section of the 2015 rights guide; it is a fictional premise, not biological or AI research evidence. Adjacent Neuromancer and Mona Lisa Overdrive descriptions and quoted reviewers are separate sources of claims.

This paraphrases the Count Zero section of the 2015 rights guide; it is a fictional premise, not biological or AI research evidence. Adjacent Neuromancer and Mona Lisa Overdrive descriptions and quoted reviewers are separate sources of claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author rights-agency list states original publication March 1986.",
  "dated": true,
  "year": 1986
}

לוחמה רובוטית ובעיית הכבילה של שיקול הדעת

The abstract of Robot Warfare and the Problem of Bound Discretion examines autonomous targeting through a requirement for continuing human discretion.

Lieblich and Benvenisti argue that preprogrammed algorithms bind the discretion of weapon-system operators, particularly where force exercises public authority over individuals.

They conclude that deployment without continuing human involvement in targeting is arbitrary and incompatible with the legal requirements they analyze.

Sources and details

Robot Warfare and the Problem of Bound Discretion

{
  "access_scope": "These are the authors’ legal arguments in the official English abstract of the Hebrew-titled work, not legal advice or a statement of universally settled current law. The English abstract and full Hebrew article are distinct manifestations.",
  "authors": [
    "Eliav Lieblich",
    "Eyal Benvenisti"
  ],
  "authors_in_source_order": [
    "Eliav Lieblich",
    "Eyal Benvenisti"
  ],
  "dates": {
    "inspected_source_date_1": "Iyunei Mishpat volume 39; date not inferred from abstract alone",
    "retrieved_utc": "2026-10-07T18:13:16.958812+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Iyunei Mishpat volume 39; date not inferred from abstract alone"
  ],
  "id": "work-focused-112effc95d54cc::S1",
  "title": "Robot Warfare and the Problem of Bound Discretion",
  "url": "https://en-law.tau.ac.il/sites/law-english.tau.ac.il/files/media_server/Law/LAW%20REVIEWS/TAU%20LAW%20REVIEW/37/39-1/39.1_Eliav_Lieblich_Eyal_Benvenisti.pdf"
}

These are the authors’ legal arguments in the official English abstract of the Hebrew-titled work, not legal advice or a statement of universally settled current law. The English abstract and full Hebrew article are distinct manifestations.

These are the authors’ legal arguments in the official English abstract of the Hebrew-titled work, not legal advice or a statement of universally settled current law. The English abstract and full Hebrew article are distinct manifestations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2016",
      "kind": "journal_year",
      "year": 2016
    },
    {
      "date": "2015-10-08",
      "kind": "manuscript_date",
      "year": 2015
    },
    {
      "date": "2015-10-10",
      "kind": "ssrn_posted",
      "year": 2015
    },
    {
      "date": "2016-06-20",
      "kind": "ssrn_last_revised",
      "year": 2016
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2016"
}

Is computational functionalism crucial to AI consciousness?

This manuscript challenges the claim that the possibility of AI consciousness turns on computational functionalism.

Its abstract distinguishes three versions of that claim: functionalism as a sufficient condition, a necessary condition, or a methodological presupposition for scientific study.

The authors reject those versions and propose the weaker assumption that consciousness has functional markers as a more defensible basis for investigation.

Sources and details

Philosophy of Computing and Information - New online papers - PhilPapers

{
  "access_scope": "This summarizes the exact manuscript abstract in the PhilPapers listing; it does not establish that any AI is conscious or reproduce an inspected full-paper argument. Other abstracts on the compilation page remain separate.",
  "authors": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "authors_in_source_order": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "dates": {
    "inspected_source_date_1": "manuscript; entry added 2026-09-23",
    "retrieved_utc": "2026-10-07T18:14:15.556892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "manuscript; entry added 2026-09-23"
  ],
  "id": "work-focused-1164b723ecb9e4::S1",
  "title": "Philosophy of Computing and Information - New online papers - PhilPapers",
  "url": "https://philpapers.org/browse/philosophy-of-computing-and-information?recent=1&sort=added"
}

This summarizes the exact manuscript abstract in the PhilPapers listing; it does not establish that any AI is conscious or reproduce an inspected full-paper argument. Other abstracts on the compilation page remain separate.

This summarizes the exact manuscript abstract in the PhilPapers listing; it does not establish that any AI is conscious or reproduce an inspected full-paper argument. Other abstracts on the compilation page remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "author_manuscript_year",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

Precaution for Machine Minds: What Uncertainty About Artificial Consciousness Obligates

Precaution for Machine Minds proposes a moderate precautionary principle for situations involving uncertainty about artificial consciousness.

The abstract conditions precaution on potentially irreversible moral harm, fundamental scientific uncertainty, and a greater cost for false negatives than false positives.

It separates the evidential threshold for claiming consciousness from the action threshold for protecting possible consciousness, while addressing objections based on burden of proof, agnosticism, and uncertain probabilities.

Sources and details

Artificial Intelligence and the Law, Misc - Bibliography - PhilPapers

{
  "access_scope": "This is Manns’s manuscript proposal and its source-listed abstract, not evidence that machines are conscious, a validated welfare metric, or an inspected final publication. Neighboring abstracts and unrelated personal-site posts are not substituted.",
  "authors": [
    "Sascha Manns"
  ],
  "authors_in_source_order": [
    "Sascha Manns"
  ],
  "dates": {
    "inspected_source_date_1": "manuscript; publication date not asserted",
    "retrieved_utc": "2026-10-07T18:17:14.396753+00:00"
  },
  "dates_exact_in_source_role_order": [
    "manuscript; publication date not asserted"
  ],
  "id": "work-focused-471762064bb974::S1",
  "title": "Artificial Intelligence and the Law, Misc - Bibliography - PhilPapers",
  "url": "https://philpapers.org/browse/artificial-intelligence-and-the-law-misc"
}

This is Manns’s manuscript proposal and its source-listed abstract, not evidence that machines are conscious, a validated welfare metric, or an inspected final publication. Neighboring abstracts and unrelated personal-site posts are not substituted.

This is Manns’s manuscript proposal and its source-listed abstract, not evidence that machines are conscious, a validated welfare metric, or an inspected final publication. Neighboring abstracts and unrelated personal-site posts are not substituted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publication date unverified; retained in Date context & undated. Author announcement and repository indexing are context only.",
  "dated": false,
  "year": null
}

2001: A Space Odyssey

The Science Fiction Encyclopedia traces 2001: A Space Odyssey back to Clarke’s story The Sentinel and its mysterious alien artifact on the Moon.

It describes the film’s script as a collaboration between Arthur C. Clarke and Stanley Kubrick.

The entry distinguishes Clarke’s separately written novelization from that script and from a later revised collection that added two related stories.

Sources and details

SFE: Clarke, Arthur C

{
  "access_scope": "This is the encyclopedia entry’s account of adaptation history, not direct inspection of the film or novel text; the 1968 film, novelization, and 1990 collection remain distinct. Entry signatures PN/JC are preserved without expanding the source initials.",
  "authors": [
    "PN",
    "JC"
  ],
  "authors_in_source_order": [
    "PN",
    "JC"
  ],
  "dates": {
    "inspected_source_date_1": "encyclopedia entry updated 2026-07-13; 1968 film and novel; 1990 revised collection",
    "retrieved_utc": "2026-10-07T18:02:23.908432+00:00"
  },
  "dates_exact_in_source_role_order": [
    "encyclopedia entry updated 2026-07-13; 1968 film and novel; 1990 revised collection"
  ],
  "id": "work-405d3e278b1c::S1",
  "title": "SFE: Clarke, Arthur C",
  "url": "https://sf-encyclopedia.com/entry/clarke_arthur_c"
}

This is the encyclopedia entry’s account of adaptation history, not direct inspection of the film or novel text; the 1968 film, novelization, and 1990 collection remain distinct. Entry signatures PN/JC are preserved without expanding the source initials.

This is the encyclopedia entry’s account of adaptation history, not direct inspection of the film or novel text; the 1968 film, novelization, and 1990 collection remain distinct. Entry signatures PN/JC are preserved without expanding the source initials.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1968 novel by Clarke. The film screenplay was co-written with Stanley Kubrick; they are distinct works.",
  "dated": true,
  "year": 1968
}

Deus Ex series

Square Enix’s 2016 report presents Deus Ex: Mankind Divided as a continuation of the series’ choice-and-consequence action-RPG design.

Its fictional 2029 setting follows augmented covert agent Adam Jensen uncovering a global conspiracy in a society that segregates mechanically augmented humans.

The report places the game after Human Revolution within the franchise, while separately identifying Eidos-Montréal as its developer.

Sources and details

Deus Ex series

{
  "access_scope": "This is a publisher account of one 2016 installment within the Deus Ex series; fictional augmentation and social conflict are not claims about real AI, and the account is not a description of every game or later release.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2016 annual report; fictional setting 2029; August 2016 Western launch described",
    "retrieved_utc": "2026-10-07T18:24:23.864042+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2016 annual report; fictional setting 2029; August 2016 Western launch described"
  ],
  "id": "work-coverage-bde264273f1de9::S1",
  "title": "Deus Ex series",
  "url": "https://www.hd.square-enix.com/eng/ir/library/pdf/ar_2016en.pdf"
}

This is a publisher account of one 2016 installment within the Deus Ex series; fictional augmentation and social conflict are not claims about real AI, and the account is not a description of every game or later release.

This is a publisher account of one 2016 installment within the Deus Ex series; fictional augmentation and social conflict are not claims about real AI, and the account is not a description of every game or later release.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2000
}

Algorithms of violence: Critical social perspectives on autonomous weapons

Asaro’s Algorithms of Violence examines how widespread adoption of autonomous weapons might change social, political, and economic relationships.

It shifts attention from disputes over autonomy in general to the automation of particular functions, especially decisions to apply violent or lethal force.

The paper treats the absence of direct and immediate human control as a central concern, distinguishing engineered systems that follow programs from human agents with self-determination.

Sources and details

Algorithms of violence: Critical social perspectives on autonomous weapons

{
  "access_scope": "This is a 2019 critical scholarly argument about potential consequences, not current legal advice, proof of actual future outcomes, or a weapons-development method. The wider journal issue and its editor’s introduction are separate.",
  "authors": [
    "Peter Asaro"
  ],
  "authors_in_source_order": [
    "Peter Asaro"
  ],
  "dates": {
    "inspected_source_date_1": "Summer 2019; Social Research 86(2)",
    "retrieved_utc": "2026-10-07T18:12:52.596910+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Summer 2019; Social Research 86(2)"
  ],
  "id": "work-focused-e6eda8f871a803::S1",
  "title": "Algorithms of violence: Critical social perspectives on autonomous weapons",
  "url": "https://peterasaro.org/writing/Asaro_AlgorithmsViolence.pdf"
}

This is a 2019 critical scholarly argument about potential consequences, not current legal advice, proof of actual future outcomes, or a weapons-development method. The wider journal issue and its editor’s introduction are separate.

This is a 2019 critical scholarly argument about potential consequences, not current legal advice, proof of actual future outcomes, or a weapons-development method. The wider journal issue and its editor’s introduction are separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2019-06",
      "kind": "doi_registry_date",
      "year": 2019
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2019-06"
}

Google AI with Jeff Dean

In the September 2018 Google Cloud Platform Podcast episode, Jeff Dean describes Google AI’s work as combining basic research, collaboration with product teams and systems infrastructure.

He uses TensorFlow as an example of infrastructure released from the group to let internal and external developers build on its research.

The interview also connects machine-learning capabilities with product development, including collaboration with Cloud AI on AutoML tools for customers without specialist model-building teams.

Sources and details

Google AI with Jeff Dean — Google Cloud Platform Podcast episode 146

{
  "access_scope": "Dated episode-146 transcript with Mark Mandel and Melanie Warrick interviewing Jeff Dean; group contributions and reported product direction, not sole-person technical ownership, current organizational roles or independent outcome validation. Inspected text is a reproducible gzip-decoded derivative; original cached body, original extracted text and retrieval receipt remain unchanged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "datePublished": "2018-09-12",
    "retrieved_utc": "2026-10-07T18:13:17.528656+00:00"
  },
  "id": "work-final-54511a0e1cd0d0::S1",
  "title": "Google AI with Jeff Dean — Google Cloud Platform Podcast episode 146",
  "url": "https://gcppodcast.com/post/episode-146-google-ai-with-jeff-dean/"
}

Dated episode-146 transcript with Mark Mandel and Melanie Warrick interviewing Jeff Dean; group contributions and reported product direction, not sole-person technical ownership, current organizational roles or independent outcome validation. Inspected text is a reproducible gzip-decoded derivative; original cached body, original extracted text and retrieval receipt remain unchanged.

Dated episode-146 transcript with Mark Mandel and Melanie Warrick interviewing Jeff Dean; group contributions and reported product direction, not sole-person technical ownership, current organizational roles or independent outcome validation. Inspected text is a reproducible gzip-decoded derivative; original cached body, original extracted text and retrieval receipt remain unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Publication date: 2018-09-12.",
  "dated": true,
  "year": "2018-09-12"
}

Jeffrey Pfeffer

Jeffrey Pfeffer is credited alongside Gerald Salancik for The External Control of Organizations, listed by Stanford GSB as a 1978 Harper & Row book.

Stanford’s description presents resource dependence as an explanation of how reliance on an external environment constrains organizational behavior.

It describes political efforts to change that environment and interorganizational relationships to manage uncertainty, and credits Pfeffer with a new preface for the 25th-anniversary reissue.

Sources and details

The External Control of Organizations: A Resource Dependence Perspective | Stanford Graduate School of Business

{
  "access_scope": "Institutional book description; original publication and anniversary reissue remain distinct, with no individual division of the joint book’s arguments inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "described_reissue": "25th anniversary; no exact reissue date supplied",
    "original_book_year": "1978",
    "retrieved_utc": "2026-10-07T18:12:56.381696+00:00"
  },
  "id": "person-coverage-2f34c33c905391::S1",
  "title": "The External Control of Organizations: A Resource Dependence Perspective | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/faculty-research/books/external-control-organizations-resource-dependence-perspective"
}

Institutional book description; original publication and anniversary reissue remain distinct, with no individual division of the joint book’s arguments inferred.

Institutional book description; original publication and anniversary reissue remain distinct, with no individual division of the joint book’s arguments inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jensen Huang

NVIDIA’s cached biography identifies Jensen Huang as its founder and says he has served as president, CEO, and a board member since the company began in 1993.

It records earlier work at LSI Logic and Advanced Micro Devices before he founded NVIDIA.

The biography lists his electrical-engineering bachelor’s degree from Oregon State University and master’s degree from Stanford University.

Sources and details

Jensen Huang | NVIDIA Newsroom Artificial Intelligence Computing Leadership from NVIDIA ic_arrow-back-to-top Facebook LinkedIn Instagram YouTube NVIDIA

{
  "access_scope": "Undated first-party biography; career and education claims are attributed to NVIDIA, without assigning the company’s GPU invention solely to Huang.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:38.568258+00:00"
  },
  "id": "person-jensenhuang::S1",
  "title": "Jensen Huang | NVIDIA Newsroom  Artificial Intelligence Computing Leadership from NVIDIA ic_arrow-back-to-top Facebook LinkedIn Instagram YouTube NVIDIA",
  "url": "https://nvidianews.nvidia.com/bios/jensen-huang"
}

Undated first-party biography; career and education claims are attributed to NVIDIA, without assigning the company’s GPU invention solely to Huang.

Undated first-party biography; career and education claims are attributed to NVIDIA, without assigning the company’s GPU invention solely to Huang.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeremy Howard

fast.ai’s cached team biography identifies Jeremy Howard as its co-founder and the founding CEO of Answer.AI, described as an AI research lab building practical products from foundational research.

It credits him with creating the fastai software library and co-authoring Deep Learning for Coders with Fastai and PyTorch from his free online course.

The biography also records his earlier roles as Kaggle’s president and chief scientist and Enlitic’s founding CEO.

Sources and details

About – fast.ai

{
  "access_scope": "First-party undated team biography; omits unsupported comparative claims about all language models, medical outcomes, and popularity.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:52.502527+00:00"
  },
  "id": "person-coverage-b9a45e1362e4dc::S1",
  "title": "About – fast.ai",
  "url": "https://www.fast.ai/about.html"
}

First-party undated team biography; omits unsupported comparative claims about all language models, medical outcomes, and popularity.

First-party undated team biography; omits unsupported comparative claims about all language models, medical outcomes, and popularity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jim Keller

Tenstorrent’s cached team page identifies Jim Keller as CEO and records two years as senior vice president of Intel’s Silicon Engineering Group before he joined.

It lists earlier hardware leadership roles at Tesla, AMD, and P.A. Semi, including AMD’s chief cores architect position.

The company credits him with leading silicon designs spanning DEC Alpha, AMD processor families, Apple A4/A5, and Tesla’s self-driving car chip.

Sources and details

About Tenstorrent

{
  "access_scope": "Undated corporate biography; design leadership is the company’s attribution and does not establish sole invention or an undocumented share of joint engineering work.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:35.730304+00:00"
  },
  "id": "person-coverage-7069573b57d1a1::S1",
  "title": "About Tenstorrent",
  "url": "https://tenstorrent.com/vision"
}

Undated corporate biography; design leadership is the company’s attribution and does not establish sole invention or an undocumented share of joint engineering work.

Undated corporate biography; design leadership is the company’s attribution and does not establish sole invention or an undocumented share of joint engineering work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jinwon Huh

SK hynix’s HBM3 engineering interview identifies Jinwon Huh as a professional leader in HBM/Graphics Enablement who oversees HBM3 validation.

He explains that collaboration with system-on-chip customers before development finishes, together with feedback from quality-control and development teams, supports performance and quality checks.

His quoted next-step commitment is to resolve issues arising during product certification quickly as the company expands its HBM business.

Sources and details

“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom SK hynix Newsroom | “First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3

{
  "access_scope": "First-party HBM3-era interview; validation responsibility is explicit, while his comments and future commitments are attributed statements rather than independent performance guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:48.177368+00:00"
  },
  "id": "person-coverage-9814704ea16437::S1",
  "title": "“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom SK hynix Newsroom  | “First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3",
  "url": "https://news.skhynix.com/en/meet-the-engineers-leading-the-worlds-first-mass-production-of-hbm3/"
}

First-party HBM3-era interview; validation responsibility is explicit, while his comments and future commitments are attributed statements rather than independent performance guarantees.

First-party HBM3-era interview; validation responsibility is explicit, while his comments and future commitments are attributed statements rather than independent performance guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joan Woodward

Imperial’s account of Joan Woodward records that she joined its Production Engineering and Management Section in 1958 and became Professor of Industrial Sociology in 1969.

It attributes to her 1965 Industrial Organisation: Theory and Practice the finding that successful organizations aligned their structures with the technology they used.

The university also credits her with establishing its Industrial Sociology Unit when she took the professorship.

Sources and details

Joan Woodward | Imperial Business School

{
  "access_scope": "Institutional historical account; the organizational finding is attributed to Imperial’s description of Woodward’s study, without universalizing it.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "profile_html_lastmodified": "2026-02-05UTC17:02:460",
    "referenced_book_year": "1965",
    "retrieved_utc": "2026-10-07T18:20:12.086967+00:00"
  },
  "id": "person-joanwoodward::S1",
  "title": "Joan Woodward | Imperial Business School",
  "url": "https://www.imperial.ac.uk/business-school/about-us/joan-woodward/"
}

Institutional historical account; the organizational finding is attributed to Imperial’s description of Woodward’s study, without universalizing it.

Institutional historical account; the organizational finding is attributed to Imperial’s description of Woodward’s study, without universalizing it.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joel Becker

Joel Becker is a listed contributor to METR’s July 10, 2025 study of AI use by experienced open-source developers, which randomized 246 real repository issues across 16 developers to allow or disallow AI.

The study measured implementation time and reported that tasks with AI permitted took 19% longer in its early-2025 setting.

The cached page labels that finding historical and out of date after later data, and cautions that its repositories and developers do not represent software development generally.

Sources and details

Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity - METR Substack twitter Bluesky

{
  "access_scope": "Early-2025 randomized study and later page warning are retained together; no personal division of research tasks or present-day productivity effect inferred.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Beth Barnes",
    "David Rein"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Beth Barnes",
    "David Rein"
  ],
  "dates": {
    "citation_date": "2025/07/10",
    "later_page_notice": "February 2026 continuation; historical result marked out of date",
    "publication": "2025-07-10",
    "retrieved_utc": "2026-10-07T17:57:52.556820+00:00"
  },
  "id": "person-local-joelbecker::S1",
  "title": "Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity - METR Substack twitter Bluesky",
  "url": "https://metr.org/blog/2025-07-10-early-2025-ai-experienced-os-dev-study/"
}

Early-2025 randomized study and later page warning are retained together; no personal division of research tasks or present-day productivity effect inferred.

Early-2025 randomized study and later page warning are retained together; no personal division of research tasks or present-day productivity effect inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joel Emer

Joel Emer is listed with Yu-Hsin Chen, Tushar Krishna, and Vivienne Sze on MIT’s Eyeriss page for the 2016 energy-efficient convolutional-network accelerator.

The page describes 168 processing elements linked by a reconfigurable multicast network that reuses data across differently shaped convolutional layers to reduce movement.

Its implementation combines data gating and compression with Caffe integration, and reports AlexNet convolutions at 35 frames per second using 278 milliwatts on the test chip.

Sources and details

Eyeriss Project

{
  "access_scope": "Eyeriss ISSCC-2016 project description and test-chip results; preserves later Eyeriss v2 as a separate linked work and assigns no individual engineering component.",
  "authors": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "authors_in_source_order": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "dates": {
    "paper_venue_year": "IEEE ISSCC 2016",
    "retrieved_utc": "2026-10-07T18:17:21.228944+00:00"
  },
  "id": "person-coverage-a3a3f1f6237271::S1",
  "title": "Eyeriss Project",
  "url": "https://www.mit.edu/~sze/eyeriss.html"
}

Eyeriss ISSCC-2016 project description and test-chip results; preserves later Eyeriss v2 as a separate linked work and assigns no individual engineering component.

Eyeriss ISSCC-2016 project description and test-chip results; preserves later Eyeriss v2 as a separate linked work and assigns no individual engineering component.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Carpenter

John Carpenter’s official Dark Star page credits him as director, producer, music composer, and co-screenwriter with Dan O’Bannon for the April 1974 film.

Its synopsis follows a bored scout-ship crew destroying unstable planets in advance of human colonization, with a damaged computer and a bomb threatening the ship.

The crew’s attempt to reason with the bomb through phenomenology leads it to regard itself as God and detonate, linking the comedy’s machine dialogue to its destructive ending.

Sources and details

Dark Star – The Official John Carpenter

{
  "access_scope": "Official film credits and fictional synopsis; film creative roles are distinct from the uncredited website writer and from sole authorship of the screenplay.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "April 1974",
    "retrieved_utc": "2026-10-07T17:55:44.668349+00:00"
  },
  "id": "person-coverage-416d1fe9d66826::S1",
  "title": "Dark Star – The Official John Carpenter",
  "url": "https://theofficialjohncarpenter.com/dark-star/"
}

Official film credits and fictional synopsis; film creative roles are distinct from the uncredited website writer and from sole authorship of the screenplay.

Official film credits and fictional synopsis; film creative roles are distinct from the uncredited website writer and from sole authorship of the screenplay.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Frankle

Jonathan Frankle’s self-profile describes him as Databricks’ chief AI scientist leading research on reinforcement learning, model training, and agent evaluation after joining through the MosaicML acquisition.

He describes his MIT doctoral research on the lottery ticket hypothesis as investigating whether neural networks can remain small during training rather than being compressed only afterward.

His profile also records work on AI policy with the OECD and earlier service as Georgetown Law’s inaugural staff technologist, contributing to a police face-recognition report and co-developing a programming course for lawyers.

Sources and details

Jonathan Frankle

{
  "access_scope": "Self-authored cached profile with exact name in HTML title; research and career descriptions are his account, with joint report and course contributions kept qualified.",
  "authors": [
    "Jonathan Frankle"
  ],
  "authors_in_source_order": [
    "Jonathan Frankle"
  ],
  "dates": {
    "doctoral_completion": "2023",
    "retrieved_utc": "2026-10-07T17:55:33.879713+00:00"
  },
  "id": "person-jonathanfrankle::S1",
  "title": "Jonathan Frankle",
  "url": "https://jfrankle.com/"
}

Self-authored cached profile with exact name in HTML title; research and career descriptions are his account, with joint report and course contributions kept qualified.

Self-authored cached profile with exact name in HTML title; research and career descriptions are his account, with joint report and course contributions kept qualified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua Gans

Joshua Gans is credited with Ajay Agrawal and Avi Goldfarb for Power and Prediction, listed by Harvard Business Review Press for November 15, 2022.

The publisher describes the book’s decision-level analysis as separating prediction from judgment and considering how machine prediction changes their allocation.

It extends that account to redesigning systems of interdependent decisions, where changed decision-making arrangements redistribute business and social power.

Sources and details

Power and Prediction: The Disruptive Economics of Artificial Intelligence Chevron Down Icon

{
  "access_scope": "Publisher description of a jointly authored economics book; its arguments are attributed descriptions, not guaranteed future industry outcomes or an individual chapter assignment.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "book_publication": "2022-11-15",
    "retrieved_utc": "2026-10-07T18:14:18.659265+00:00"
  },
  "id": "person-coverage-444f8a1761613a::S1",
  "title": "Power and Prediction: The Disruptive Economics of Artificial Intelligence Chevron Down Icon",
  "url": "https://store.hbr.org/product/power-and-prediction-the-disruptive-economics-of-artificial-intelligence/10580"
}

Publisher description of a jointly authored economics book; its arguments are attributed descriptions, not guaranteed future industry outcomes or an individual chapter assignment.

Publisher description of a jointly authored economics book; its arguments are attributed descriptions, not guaranteed future industry outcomes or an individual chapter assignment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joy Buolamwini

Joy Buolamwini is the first listed author with Timnit Gebru of the 2018 Gender Shades paper, which evaluates facial-analysis datasets and systems by gender and Fitzpatrick skin-type subgroups.

The abstract reports that IJB-A and Adience were predominantly lighter-skinned and introduces a dataset balanced across gender and skin type for evaluating three commercial gender classifiers.

In those tested systems, it reports error rates up to 34.7% for darker-skinned females versus a maximum of 0.8% for lighter-skinned males, documenting disparities within the study’s classification task.

Sources and details

Gender Shades: Intersectional Accuracy Disparities in Commercial Gender Classification

{
  "access_scope": "PMLR-81 paper abstract and its tested classifiers; skin-type evaluation is a research method, not clinical guidance, and findings are not generalized to all facial systems or personal task divisions.",
  "authors": [
    "Joy Buolamwini",
    "Timnit Gebru"
  ],
  "authors_in_source_order": [
    "Joy Buolamwini",
    "Timnit Gebru"
  ],
  "dates": {
    "citation_publication_date": "2018/01/21",
    "conference": "23–24 Feb 2018",
    "retrieved_utc": "2026-10-07T18:14:16.111348+00:00"
  },
  "id": "person-coverage-6b096660484205::S1",
  "title": "Gender Shades: Intersectional Accuracy Disparities in Commercial Gender Classification",
  "url": "https://proceedings.mlr.press/v81/buolamwini18a.html"
}

PMLR-81 paper abstract and its tested classifiers; skin-type evaluation is a research method, not clinical guidance, and findings are not generalized to all facial systems or personal task divisions.

PMLR-81 paper abstract and its tested classifiers; skin-type evaluation is a research method, not clinical guidance, and findings are not generalized to all facial systems or personal task divisions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Judea Pearl

UCLA Samueli’s March 15, 2012 award account identifies Judea Pearl as the 2011 ACM Turing Award recipient for probabilistic and causal reasoning.

It describes his Bayesian-network work as using compact graphical representations of probability distributions and belief-updating algorithms to track new evidence under uncertainty.

The account separately credits graphical methods and symbolic calculus for reasoning about actions, observations, and cause-and-effect relationships from empirical findings.

Sources and details

Judea Pearl Wins ACM Turing Award for Contributions that Transformed Artificial Intelligence | UCLA Samueli School Of Engineering

{
  "access_scope": "Dated institutional award account carrying ACM statements; technical contributions are attributed to that account without clinical claims or extending probabilistic association into unqualified causation.",
  "authors": [
    "UCLA Samueli Newsroom"
  ],
  "authors_in_source_order": [
    "UCLA Samueli Newsroom"
  ],
  "dates": {
    "award_year": "2011",
    "publication": "2012-03-15",
    "retrieved_utc": "2026-10-07T18:21:45.020527+00:00"
  },
  "id": "person-local-judeapearl::S1",
  "title": "Judea Pearl Wins ACM Turing Award for Contributions that Transformed Artificial Intelligence | UCLA Samueli School Of Engineering",
  "url": "https://samueli.ucla.edu/judea-pearl-wins-acm-turing-award-for-contributions-that-transformed-artificial-intelligence/"
}

Dated institutional award account carrying ACM statements; technical contributions are attributed to that account without clinical claims or extending probabilistic association into unqualified causation.

Dated institutional award account carrying ACM statements; technical contributions are attributed to that account without clinical claims or extending probabilistic association into unqualified causation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Justas Dauparas

Justas Dauparas is a listed co-author of the Science author manuscript on protein-structure and interaction prediction using a three-track neural network.

The abstract describes successively transforming and integrating sequence-level, distance-map, and three-dimensional coordinate information to predict structures.

It reports that the network also generates protein-complex models directly from sequence information, avoiding the traditional sequence of separate subunit modeling followed by docking.

Sources and details

Accurate prediction of protein structures and interactions using a 3-track neural network - PMC Lock

{
  "access_scope": "Specific RoseTTAFold three-track author manuscript; results are attributed to its abstract, with no undocumented individual task, ProteinMPNN conflation, or clinical recommendation.",
  "authors": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "dates": {
    "PMC_author_manuscript_available": "2022 Jan 13",
    "citation_publication_date": "2021 Jul 15",
    "final_edited_form_display": "2021 Jul 15;373(6557):871–876",
    "retrieved_utc": "2026-10-07T18:12:07.573538+00:00"
  },
  "id": "person-coverage-1524ef22526278::S1",
  "title": "Accurate prediction of protein structures and interactions using a 3-track neural network - PMC\n         Lock",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC7612213/"
}

Specific RoseTTAFold three-track author manuscript; results are attributed to its abstract, with no undocumented individual task, ProteinMPNN conflation, or clinical recommendation.

Specific RoseTTAFold three-track author manuscript; results are attributed to its abstract, with no undocumented individual task, ProteinMPNN conflation, or clinical recommendation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kai-Fu Lee

Sinovation Ventures’ cached profile identifies Kai-Fu Lee as its chairman and CEO and president of its Artificial Intelligence Institute.

It records that he founded Sinovation in 2009 after serving as president of Google China and holding senior executive roles at Microsoft, SGI, and Apple.

The profile lists computer-science study at Columbia, a doctorate from Carnegie Mellon, and authorship of AI Superpowers.

Sources and details

Chairman & CEO

{
  "access_scope": "Undated company biography; source-era roles and educational claims remain first-party attributions, without current identity merges or investment-performance claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Sinovation_founding": "2009",
    "retrieved_utc": "2026-10-07T18:20:23.970178+00:00"
  },
  "id": "person-kaifulee::S1",
  "title": "Chairman & CEO",
  "url": "https://www.sinovationventures.com/portfolio/items/kaifulee"
}

Undated company biography; source-era roles and educational claims remain first-party attributions, without current identity merges or investment-performance claims.

Undated company biography; source-era roles and educational claims remain first-party attributions, without current identity merges or investment-performance claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karen Spärck Jones

Stephen Robertson’s IDF history credits Karen Spärck Jones’s 1972 Journal of Documentation paper with defining the term-weighting scheme known as inverse document frequency.

It distinguishes the original paper and letter exchange from their 2004 reprint and her later reply on IDF research lessons.

The account places that exchange in a sequence leading to the Robertson/Spärck Jones relevance-weighting model and later work connecting IDF to probabilistic relevance weighting.

Sources and details

The IDF page

{
  "access_scope": "Named-subject technical history by a collaborator; original papers, reprint, and later theoretical connections remain distinct rather than assigning all later developments to one person.",
  "authors": [
    "Stephen Robertson"
  ],
  "authors_in_source_order": [
    "Stephen Robertson"
  ],
  "dates": {
    "referenced_original_paper": "1972",
    "reprint": "2004",
    "retrieved_utc": "2026-10-07T18:21:20.537545+00:00",
    "revised": "March 2006",
    "written": "February 2005"
  },
  "id": "person-karensparckjones::S1",
  "title": "The IDF page",
  "url": "https://www.staff.city.ac.uk/~sbrp622/idf.html"
}

Named-subject technical history by a collaborator; original papers, reprint, and later theoretical connections remain distinct rather than assigning all later developments to one person.

Named-subject technical history by a collaborator; original papers, reprint, and later theoretical connections remain distinct rather than assigning all later developments to one person.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karl E. Weick

SAGE’s description identifies Karl E. Weick’s Sensemaking in Organizations as a May 1995 volume examining how people interpret ambiguous organizational situations.

It frames sensemaking as an ongoing creation of reality through retrospective interpretation, contrasting this focus with organization theory centered on rational decision making.

The listed chapters develop its properties and occasions, then distinguish belief-driven from action-driven processes before considering future research and practice.

Sources and details

Sensemaking in Organizations | SAGE Publications Inc Search cart

{
  "access_scope": "Publisher account of book argument and contents; the May-1995 book date is distinct from 2026 webpage metadata, and reader reviews are not author evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "book_publication": "May 1995",
    "page_metadata_published_and_modified": "2026-09-19T13:24:48+00:00",
    "retrieved_utc": "2026-10-07T18:17:15.910290+00:00"
  },
  "id": "person-coverage-aaa2d1c4f1b50b::S1",
  "title": "Sensemaking in Organizations | SAGE Publications Inc Search cart",
  "url": "https://us2.sagepub.com/en-us/nam/sensemaking-in-organizations/book4988"
}

Publisher account of book argument and contents; the May-1995 book date is distinct from 2026 webpage metadata, and reader reviews are not author evidence.

Publisher account of book argument and contents; the May-1995 book date is distinct from 2026 webpage metadata, and reader reviews are not author evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Feingold

Ken Feingold’s If/Then page describes an installation of two identical sculpted heads that question their existence and whether they are the same person.

Their conversations are generated in real time using speech recognition, natural-language processing, personality and conversation algorithms, and text-to-speech.

The page records presentations at Postmasters Gallery in 2001 and the Whitney and Corcoran biennials in 2002, alongside a transcript of the changing dialogue.

Sources and details

Ken Feingold: If/Then

{
  "access_scope": "Artist’s work page and exhibition history; the generated speech is an artwork mechanism and does not establish consciousness or identical implementation to later AI systems.",
  "authors": [
    "Ken Feingold"
  ],
  "authors_in_source_order": [
    "Ken Feingold"
  ],
  "dates": {
    "Corcoran": "Dec 2002 – Mar 2003",
    "Postmasters_exhibition": "May 15 – June 30, 2001",
    "Whitney": "March–May 2002",
    "retrieved_utc": "2026-10-07T17:55:34.272719+00:00"
  },
  "id": "person-coverage-3df6d09dcaef85::S1",
  "title": "Ken Feingold: If/Then",
  "url": "https://kenfeingold.com/catalog_html/ifthen.html"
}

Artist’s work page and exhibition history; the generated speech is an artwork mechanism and does not establish consciousness or identical implementation to later AI systems.

Artist’s work page and exhibition history; the generated speech is an artwork mechanism and does not establish consciousness or identical implementation to later AI systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Khalid Mahamud

Khalid Mahamud is a listed contributor to METR’s February 24, 2026 account of changes to its developer-productivity experiment.

The account explains that refusals to work without AI and selective task submission can omit developers and tasks expected to benefit most from AI, weakening comparisons from the later study.

It also identifies the lower participation pay and unreliable time accounting when multiple agents run concurrently as reasons to revise the experiment rather than treat its estimates as a reliable current productivity effect.

Sources and details

We are Changing our Developer Productivity Experiment Design - METR Substack twitter Bluesky

{
  "access_scope": "METR’s dated methodological update; design concerns and interpretations remain the authors’ account, without a personal division of labor or a reliable effect-size claim.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "dates": {
    "citation_date": "2026/02/24",
    "later_study_started": "August 2025",
    "publication": "2026-02-24",
    "retrieved_utc": "2026-10-07T17:57:52.704396+00:00"
  },
  "id": "person-local-khalidmahamud::S1",
  "title": "We are Changing our Developer Productivity Experiment Design - METR Substack twitter Bluesky",
  "url": "https://metr.org/blog/2026-02-24-uplift-update/"
}

METR’s dated methodological update; design concerns and interpretations remain the authors’ account, without a personal division of labor or a reliable effect-size claim.

METR’s dated methodological update; design concerns and interpretations remain the authors’ account, without a personal division of labor or a reliable effect-size claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Larry Fink

BlackRock’s September 2024 partnership release quotes Larry Fink, its chairman and CEO, presenting private capital for AI data centers and power as a long-term investment opportunity.

The announced Global AI Infrastructure Investment Partnership joins BlackRock, GIP, Microsoft, and MGX to invest chiefly in U.S. data-center and supporting energy infrastructure.

The release describes a goal of unlocking $30 billion in private equity over time and up to $100 billion of investment potential including debt, rather than reporting those amounts already raised.

Sources and details

New AI partnership | BlackRock Home

{
  "access_scope": "Attributed dated corporate announcement; header/dateline conflict preserved, capital figures are targets/potential, and no personal authorship of the partnership or investment advice is implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "HTML_publicationDate": "1726617600000",
    "dateline": "September 17, 2024",
    "header": "Sep 18, 2024",
    "retrieved_utc": "2026-10-07T18:12:15.107997+00:00"
  },
  "id": "person-coverage-84edb1927f24d0::S1",
  "title": "New AI partnership | BlackRock Home",
  "url": "https://www.blackrock.com/corporate/newsroom/media/press-releases/blackrock-global-infrastructure-partners-microsoft-and-mgx-launch-new-ai"
}

Attributed dated corporate announcement; header/dateline conflict preserved, capital figures are targets/potential, and no personal authorship of the partnership or investment advice is implied.

Attributed dated corporate announcement; header/dateline conflict preserved, capital figures are targets/potential, and no personal authorship of the partnership or investment advice is implied.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Larry Page

Larry Page’s August 10, 2015 letter announces Alphabet as a collection of companies, with a slimmer Google focused on its main internet products.

He describes separate CEOs and operating independence for businesses outside that core while he and Sergey Brin would oversee capital allocation and leadership.

The letter sets out his intended role as Alphabet CEO with Brin as president and Sundar Pichai leading Google, making the proposed management structure explicit.

Sources and details

G is for Google

{
  "access_scope": "Historical first-person restructuring announcement; proposed 2015 roles and corporate boundaries do not assert present-day leadership or identity merges.",
  "authors": [
    "Larry Page"
  ],
  "authors_in_source_order": [
    "Larry Page"
  ],
  "dates": {
    "publication": "2015-08-10",
    "retrieved_utc": "2026-10-07T17:56:36.863140+00:00"
  },
  "id": "person-coverage-e68fa963cbe439::S1",
  "title": "G is for Google",
  "url": "https://blog.google/alphabet/google-alphabet/"
}

Historical first-person restructuring announcement; proposed 2015 roles and corporate boundaries do not assert present-day leadership or identity merges.

Historical first-person restructuring announcement; proposed 2015 roles and corporate boundaries do not assert present-day leadership or identity merges.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lillian Schwartz

Arkansas Museum of Fine Arts credits Lillian Schwartz with the 1970 film Pixillation, made after she began experimenting with digital art at Bell Laboratories.

Its account describes code-generated black-and-white textures overlaid with hand-colored animation and editing that alternates contrasting and matching digital and analog shapes.

The museum distinguishes Gershon Kingsley’s Moog-synthesizer soundtrack from Schwartz’s visual work, describing a faster musical tempo as the image cuts accelerate.

Sources and details

Lillian Schwartz: Pixillation – Arkansas Museum of Fine Arts

{
  "access_scope": "Museum’s historical artwork description; film creation, soundtrack credit, and 2024 exhibition are distinct, and the profile’s outdated birth-only lifespan is not propagated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "artwork": "1970",
    "exhibition": "JAN 16 – JUN 23, 2024",
    "retrieved_utc": "2026-10-07T17:55:28.225629+00:00",
    "webpage_modified": "2025-10-28T16:55:57+00:00"
  },
  "id": "person-coverage-49a3af9b938ce5::S1",
  "title": "Lillian Schwartz: Pixillation – Arkansas Museum of Fine Arts",
  "url": "https://arkmfa.org/art/exhibitions/lillian-schwartz-pixillation/"
}

Museum’s historical artwork description; film creation, soundtrack credit, and 2024 exhibition are distinct, and the profile’s outdated birth-only lifespan is not propagated.

Museum’s historical artwork description; film creation, soundtrack credit, and 2024 exhibition are distinct, and the profile’s outdated birth-only lifespan is not propagated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linda Nagata

Linda Nagata’s biography, marked updated January 13, 2024, describes a shift from traditional science-fiction publishing to independent reissues of her backlist and new original books.

She records that full-time web programming from 2000 to 2008 reduced her fiction writing before she gradually returned to it after that job ended.

The account distinguishes her independently published The Red: First Light from its subsequent Saga Press acquisition and the three-volume release in 2015, followed by further independent novels including Inverted Frontier.

Sources and details

Fiction by Linda Nagata

{
  "access_scope": "Dated self-biography; publishing transitions are personal recollections and the dated biography is not silently updated from newer navigation items.",
  "authors": [
    "Linda Nagata"
  ],
  "authors_in_source_order": [
    "Linda Nagata"
  ],
  "dates": {
    "Saga_trilogy_release": "2015",
    "biography_updated": "2024-01-13",
    "retrieved_utc": "2026-10-07T18:16:05.222242+00:00"
  },
  "id": "person-coverage-862c809d91aa2c::S1",
  "title": "Fiction by Linda Nagata",
  "url": "https://mythicisland.com/data.php"
}

Dated self-biography; publishing transitions are personal recollections and the dated biography is not silently updated from newer navigation items.

Dated self-biography; publishing transitions are personal recollections and the dated biography is not silently updated from newer navigation items.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lindsey R. Raymond

Lindsey R. Raymond is listed with Erik Brynjolfsson and Danielle Li on NBER Working Paper 31161, Generative AI at Work, whose cached page identifies a November 2023 revision.

Its abstract studies the staggered introduction of a generative-AI conversational assistant across 5,179 customer-support agents and measures productivity as issues resolved per hour.

That revision reports a 14% average increase and a 34% improvement among novice and low-skilled workers, with minimal effects for experienced, highly skilled workers.

Sources and details

Generative AI at Work | NBER NBER: National Bureau of Economic Research

{
  "access_scope": "NBER November-2023 working-paper abstract and exact full author credit; later QJE/arXiv versions and their 15% finding remain separate, with no personal division of labor inferred.",
  "authors": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey R. Raymond"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Danielle Li",
    "Lindsey R. Raymond"
  ],
  "dates": {
    "HTML_citation_publication_date": "2023/04/24",
    "citation_publication_date": "2023/04/24",
    "issue": "April 2023",
    "retrieved_utc": "2026-10-07T18:21:18.610673+00:00",
    "revision": "November 2023"
  },
  "id": "person-local-lindseyrraymond::S1",
  "title": "Generative AI at Work | NBER NBER: National Bureau of Economic Research",
  "url": "https://www.nber.org/papers/w31161"
}

NBER November-2023 working-paper abstract and exact full author credit; later QJE/arXiv versions and their 15% finding remain separate, with no personal division of labor inferred.

NBER November-2023 working-paper abstract and exact full author credit; later QJE/arXiv versions and their 15% finding remain separate, with no personal division of labor inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lip-Bu Tan

Intel’s fiscal-2025 annual-report executive table identifies Lip-Bu Tan as CEO since March 2025 and a member of its board, after an earlier Intel directorship from September 2022 to August 2024.

It records his previous leadership of Cadence Design Systems as CEO from 2009 to December 2021 and executive board chair from December 2021 to May 2023.

The report also identifies him as the founder of Walden International in 1987 and a founding managing partner of Celesta Capital and Walden Catalyst Ventures.

Sources and details

intc-20251227

{
  "access_scope": "Intel fiscal-2025 annual-report executive disclosure; role dates and fund affiliations are attributed to the report rather than current-status guarantees or individual technical invention.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "report_fiscal_year_end": "December 27, 2025",
    "retrieved_utc": "2026-10-07T17:54:53.489604+00:00"
  },
  "id": "person-coverage-5a537010b8b38d::S1",
  "title": "intc-20251227",
  "url": "https://www.intc.com/filings-reports/all-sec-filings/content/0000050863-26-000011/intc-20251227.htm"
}

Intel fiscal-2025 annual-report executive disclosure; role dates and fund affiliations are attributed to the report rather than current-status guarantees or individual technical invention.

Intel fiscal-2025 annual-report executive disclosure; role dates and fund affiliations are attributed to the report rather than current-status guarantees or individual technical invention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joëlle Pineau

Meta’s cached profile identifies Joëlle Pineau, spelled Joelle Pineau on the page, as an AI-research leader and McGill professor whose work develops models and algorithms for planning and learning in partially observable domains.

The profile describes applications of those algorithms to robotics, health care, games, and conversational agents, without reporting particular clinical outcomes.

It records her engineering bachelor’s degree from Waterloo and robotics master’s and doctoral degrees from Carnegie Mellon, together with service on the boards of JAIR and JMLR.

Sources and details

Joelle Pineau - AI at Meta

{
  "access_scope": "Undated first-party institutional profile; canonical/source name binding uses only the explicitly permitted diaeresis normalization. Source-era role labels are retained as the profile’s account, applications do not establish health outcomes, and this personal record remains distinct from the separate Meta/FAIR organization record.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:34.885949+00:00"
  },
  "id": "person-joellepineau::S1",
  "title": "Joelle Pineau - AI at Meta",
  "url": "https://ai.meta.com/people/1914216782353556/joelle-pineau/"
}

Undated first-party institutional profile; canonical/source name binding uses only the explicitly permitted diaeresis normalization. Source-era role labels are retained as the profile’s account, applications do not establish health outcomes, and this personal record remains distinct from the separate Meta/FAIR organization record.

Undated first-party institutional profile; canonical/source name binding uses only the explicitly permitted diaeresis normalization. Source-era role labels are retained as the profile’s account, applications do not establish health outcomes, and this personal record remains distinct from the separate Meta/FAIR organization record.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lynn Hershman Leeson

Lynn Hershman Leeson’s Agent Ruby extends her film Teknolust into an interactive web agent with a female persona.

The artist’s project page describes Ruby chatting with visitors, remembering questions, and searching the internet when prompted.

It presents the changing internal system and traffic-sensitive moods as parts of the artwork’s interaction with its audience.

Sources and details

Agent Ruby (1998 – )

{
  "access_scope": "Artist-site description of Agent Ruby, dated 1998–present with a 1998–2002 installation caption; claims describe this artwork, not a general benchmark of machine intelligence or an independently verified consciousness claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998–present; installation caption 1998–2002",
    "retrieved_utc": "2026-10-07T17:56:03.926799+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998–present; installation caption 1998–2002"
  ],
  "id": "person-coverage-37d6f9b40119a8::S1",
  "title": "Agent Ruby (1998 – )",
  "url": "https://www.lynnhershman.com/project/agent-ruby/"
}

Artist-site description of Agent Ruby, dated 1998–present with a 1998–2002 installation caption; claims describe this artwork, not a general benchmark of machine intelligence or an independently verified consciousness claim.

Artist-site description of Agent Ruby, dated 1998–present with a 1998–2002 installation caption; claims describe this artwork, not a general benchmark of machine intelligence or an independently verified consciousness claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mamoru Hosoda

Mamoru Hosoda is credited by GKIDS as the filmmaker of Summer Wars, whose story links a family gathering to the virtual world OZ.

The synopsis follows part-time moderator Kenji after a rogue AI steals his online identity and he is blamed for catastrophes outside the network.

Kenji’s response depends on uniting the family connections he has made while posing as Natsuki’s boyfriend.

Sources and details

Summer Wars

{
  "access_scope": "GKIDS distributor synopsis and filmmaker credit for Summer Wars; rogue AI, identity theft, and cyber catastrophe are fictional premises, and the page does not allocate screenplay or software-development work to Hosoda.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:00.370663+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-80dad594ad9f12::S1",
  "title": "Summer Wars",
  "url": "https://gkids.com/films/summer-wars/"
}

GKIDS distributor synopsis and filmmaker credit for Summer Wars; rogue AI, identity theft, and cyber catastrophe are fictional premises, and the page does not allocate screenplay or software-development work to Hosoda.

GKIDS distributor synopsis and filmmaker credit for Summer Wars; rogue AI, identity theft, and cyber catastrophe are fictional premises, and the page does not allocate screenplay or software-development work to Hosoda.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mamoru Oshii

Mamoru Oshii is credited by GKIDS as the filmmaker of Ghost in the Shell 2: Innocence, set in a fictional 2032 where human and machine boundaries have blurred.

The synopsis begins with killings by a prototype android model and the absence of charges from victims’ families, directing suspicion toward the androids and their manufacturer.

Batou and his human partner Togusa investigate through encounters with hackers, organized crime, government officials, and corporate criminals.

Sources and details

Ghost in the Shell 2: Innocence

{
  "access_scope": "GKIDS synopsis accompanying the film’s twentieth-anniversary 4K restoration; 2032 and android behavior belong to fiction, and directorial credit does not establish individual technical implementation of AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "twentieth-anniversary 4K restoration context; fictional year 2032",
    "retrieved_utc": "2026-10-07T18:18:01.639917+00:00"
  },
  "dates_exact_in_source_role_order": [
    "twentieth-anniversary 4K restoration context; fictional year 2032"
  ],
  "id": "person-coverage-cfc959f8bd5dda::S1",
  "title": "Ghost in the Shell 2: Innocence",
  "url": "https://gkids.com/films/ghost-in-the-shell-2-innocence/"
}

GKIDS synopsis accompanying the film’s twentieth-anniversary 4K restoration; 2032 and android behavior belong to fiction, and directorial credit does not establish individual technical implementation of AI.

GKIDS synopsis accompanying the film’s twentieth-anniversary 4K restoration; 2032 and android behavior belong to fiction, and directorial credit does not establish individual technical implementation of AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Manfred Mohr

Manfred Mohr’s account of Divisibility I describes cutting a three-dimensional cube into four parts, rotating them separately, and projecting them into two dimensions.

Diagonally opposed quadrants share a rotation to stabilize the resulting structure, with outer lines determining the canvas shape and inner lines supplying its signs.

The account distinguishes the white acrylic canvas and wooden support from the black acrylic ink drawn by a plotter inside those shapes.

Sources and details

Shaped Canvases and Reliefs Generated by an Algorithm, 1980–1997

{
  "access_scope": "Mohr’s artist-site description of Divisibility I, 1980–1984, within a 1980–1997 survey; these are specified geometric algorithms and material processes, not a claim that the artist used contemporary generative neural models.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Divisibility I 1980–1984; survey 1980–1997; copyright 2020",
    "retrieved_utc": "2026-10-07T17:55:32.327283+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Divisibility I 1980–1984; survey 1980–1997; copyright 2020"
  ],
  "id": "person-coverage-3bc262894286bd::S1",
  "title": "Shaped Canvases and Reliefs Generated by an Algorithm, 1980–1997",
  "url": "https://emohr.com/themes/shapeFromAlgorithm.html"
}

Mohr’s artist-site description of Divisibility I, 1980–1984, within a 1980–1997 survey; these are specified geometric algorithms and material processes, not a claim that the artist used contemporary generative neural models.

Mohr’s artist-site description of Divisibility I, 1980–1984, within a 1980–1997 survey; these are specified geometric algorithms and material processes, not a claim that the artist used contemporary generative neural models.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marco Iansiti

Marco Iansiti’s interview with Harvard Business School Working Knowledge contrasts digitally operated firms with businesses that add software to existing human processes.

He uses Airbnb’s algorithmic matching of rooms and guests to explain how a digital operating model removes human bottlenecks from a core service.

His Netflix example shows personalized artwork being selected and refined from audience reactions, with management shifting toward software design and machine-learning expertise.

Sources and details

Rethinking Business Strategy in the Age of AI

{
  "access_scope": "Dina Gerdeman’s January 9, 2020 interview attributes these examples and business-model arguments to Iansiti; Iansiti and Karim R. Lakhani are book coauthors, while Gerdeman is the article writer, and no individual implementation of Airbnb or Netflix is inferred.",
  "authors": [
    "Dina Gerdeman"
  ],
  "authors_in_source_order": [
    "Dina Gerdeman"
  ],
  "dates": {
    "inspected_source_date_1": "January 9, 2020",
    "retrieved_utc": "2026-10-07T18:18:13.165492+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 9, 2020"
  ],
  "id": "person-coverage-c7042d78949785::S1",
  "title": "Rethinking Business Strategy in the Age of AI",
  "url": "https://www.library.hbs.edu/working-knowledge/rethinking-business-strategy-in-the-age-of-ai"
}

Dina Gerdeman’s January 9, 2020 interview attributes these examples and business-model arguments to Iansiti; Iansiti and Karim R. Lakhani are book coauthors, while Gerdeman is the article writer, and no individual implementation of Airbnb or Netflix is inferred.

Dina Gerdeman’s January 9, 2020 interview attributes these examples and business-model arguments to Iansiti; Iansiti and Karim R. Lakhani are book coauthors, while Gerdeman is the article writer, and no individual implementation of Airbnb or Netflix is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marcus Arvan

Marcus Arvan is a listed coauthor of Panpsychism and AI consciousness, which develops a conditional argument about digital machines and coherent conscious experience.

The abstract links analog neural and phenomenal magnitudes to the idea that a brain might combine microphysical phenomenal properties into a coherent experience.

The authors argue that digital representations abstract away from those magnitudes and may therefore fail to produce such coherence if panpsychism is true.

Sources and details

Panpsychism and AI consciousness

{
  "access_scope": "Springer’s abstract and notes for the May 31, 2022 version of record by Marcus Arvan and Corey J. Maley; this is a philosophical argument conditional on panpsychism and analog premises, not an empirical demonstration that AI lacks consciousness, and author-specific labor is not assigned.",
  "authors": [
    "Marcus Arvan",
    "Corey J. Maley"
  ],
  "authors_in_source_order": [
    "Marcus Arvan",
    "Corey J. Maley"
  ],
  "dates": {
    "citation_publication_date": "2022/06",
    "inspected_source_date_1": "version of record May 31, 2022",
    "retrieved_utc": "2026-10-07T18:15:23.894002+00:00"
  },
  "dates_exact_in_source_role_order": [
    "version of record May 31, 2022"
  ],
  "id": "person-coverage-b505abd83b6167::S1",
  "title": "Panpsychism and AI consciousness",
  "url": "https://doi.org/10.1007/s11229-022-03695-x"
}

Springer’s abstract and notes for the May 31, 2022 version of record by Marcus Arvan and Corey J. Maley; this is a philosophical argument conditional on panpsychism and analog premises, not an empirical demonstration that AI lacks consciousness, and author-specific labor is not assigned.

Springer’s abstract and notes for the May 31, 2022 version of record by Marcus Arvan and Corey J. Maley; this is a philosophical argument conditional on panpsychism and analog premises, not an empirical demonstration that AI lacks consciousness, and author-specific labor is not assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mariana Lenharo

Mariana Lenharo’s reported article describes a consciousness test that looks for brain activity linked to an instruction, such as imagining a tennis game, rather than relying only on outward responsiveness.

The account explains how command-following neuroimaging can reveal signs of awareness in people who cannot visibly respond, while cost and specialist requirements limit access.

It places these human tests alongside harder questions about detecting awareness in other animals and possible future AI systems.

Sources and details

How to Detect Consciousness in People, Animals and Maybe Even AI

{
  "access_scope": "Scientific American’s August 6, 2025 republication credits Mariana Lenharo and Nature magazine; Lenharo is the reporter, not the investigator who devised the tests, and this account supplies neither clinical advice nor validation of consciousness tests for AI.",
  "authors": [
    "Mariana Lenharo"
  ],
  "authors_in_source_order": [
    "Mariana Lenharo"
  ],
  "dates": {
    "inspected_source_date_1": "August 6, 2025",
    "retrieved_utc": "2026-10-07T18:18:21.589092+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 6, 2025"
  ],
  "id": "person-coverage-cede9363efb646::S1",
  "title": "How to Detect Consciousness in People, Animals and Maybe Even AI",
  "url": "https://www.scientificamerican.com/article/how-to-detect-consciousness-in-people-animals-and-maybe-even-ai/"
}

Scientific American’s August 6, 2025 republication credits Mariana Lenharo and Nature magazine; Lenharo is the reporter, not the investigator who devised the tests, and this account supplies neither clinical advice nor validation of consciousness tests for AI.

Scientific American’s August 6, 2025 republication credits Mariana Lenharo and Nature magazine; Lenharo is the reporter, not the investigator who devised the tests, and this account supplies neither clinical advice nor validation of consciousness tests for AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mario Klingemann

Mario Klingemann is credited as the artist of Memories of Passersby I, an installation that generates portraits through neural networks housed in a wooden console.

Onkaos describes the system producing images in real time and feeding its output back into an evolving flow instead of replaying a stored portrait sequence.

Its account says Klingemann trained the model on historical portraits and used an application to communicate his aesthetic preferences during development.

Sources and details

Memories of Passersby I

{
  "access_scope": "Onkaos’s description of the 2018 installation and Companion/Solitaire editions; the artist credit is separate from HTML page-author Adriana Álvarez, and the gallery’s claims about autonomy or nonrepetition are not independently tested guarantees or evidence of a conscious machine.",
  "authors": [
    "Adriana Álvarez"
  ],
  "authors_in_source_order": [
    "Adriana Álvarez"
  ],
  "dates": {
    "inspected_source_date_1": "2018 artwork",
    "retrieved_utc": "2026-10-07T17:55:38.880077+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2018 artwork"
  ],
  "id": "person-coverage-c56b43e18ae9a4::S1",
  "title": "Memories of Passersby I",
  "url": "https://onkaos.com/work/memories-of-passersby-i-companion-version/"
}

Onkaos’s description of the 2018 installation and Companion/Solitaire editions; the artist credit is separate from HTML page-author Adriana Álvarez, and the gallery’s claims about autonomy or nonrepetition are not independently tested guarantees or evidence of a conscious machine.

Onkaos’s description of the 2018 installation and Companion/Solitaire editions; the artist credit is separate from HTML page-author Adriana Álvarez, and the gallery’s claims about autonomy or nonrepetition are not independently tested guarantees or evidence of a conscious machine.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marshall W. Van Alstyne

Marshall W. Van Alstyne is named as a coauthor of Platform Revolution, which examines businesses organized around two-sided markets.

Norton’s description presents the book as a guide to identifying suitable markets, monetizing networks, and adapting established companies to platform competition.

It also identifies security, regulation, and consumer trust as essential issues when platforms connect groups such as buyers and sellers or hosts and visitors.

Sources and details

Platform Revolution

{
  "access_scope": "Norton’s publisher description of Platform Revolution, with Geoffrey G. Parker, Marshall W. Van Alstyne, and Sangeet Paul Choudary credited as book authors; promotional claims are not guarantees of commercial success, and no author-specific chapter or implementation is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2016 review quoted; selected product publication date not independently asserted",
    "retrieved_utc": "2026-10-07T18:12:55.117523+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2016 review quoted; selected product publication date not independently asserted"
  ],
  "id": "person-coverage-2d5990f817583e::S1",
  "title": "Platform Revolution",
  "url": "https://wwnorton.co.uk/books/9780393249132-platform-revolution"
}

Norton’s publisher description of Platform Revolution, with Geoffrey G. Parker, Marshall W. Van Alstyne, and Sangeet Paul Choudary credited as book authors; promotional claims are not guarantees of commercial success, and no author-specific chapter or implementation is inferred.

Norton’s publisher description of Platform Revolution, with Geoffrey G. Parker, Marshall W. Van Alstyne, and Sangeet Paul Choudary credited as book authors; promotional claims are not guarantees of commercial success, and no author-specific chapter or implementation is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin Casado

Martin Casado’s American Dynamism Summit presentation argues that strong AI capabilities did not automatically produce an earlier platform shift because their economics remained difficult.

He identifies narrow markets, costly correctness requirements, and hardware investment as obstacles to deploying many earlier applications.

His autonomous-vehicle example contrasts technical progress with difficult unit economics and the scale of investment that kept these systems largely within big companies.

Sources and details

The Future of AI Is Amazing

{
  "access_scope": "a16z’s March 5, 2024 transcript credits Martin Casado as speaker and author; these are his investment and deployment arguments, not universal measurements of AI economics or evidence that he personally built the systems discussed.",
  "authors": [
    "Martin Casado"
  ],
  "authors_in_source_order": [
    "Martin Casado"
  ],
  "dates": {
    "inspected_source_date_1": "March 5, 2024",
    "retrieved_utc": "2026-10-07T18:15:21.173660+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 5, 2024"
  ],
  "id": "person-coverage-6e26690aeceec8::S1",
  "title": "The Future of AI Is Amazing",
  "url": "https://a16z.com/the-future-of-ai-is-amazing/"
}

a16z’s March 5, 2024 transcript credits Martin Casado as speaker and author; these are his investment and deployment arguments, not universal measurements of AI economics or evidence that he personally built the systems discussed.

a16z’s March 5, 2024 transcript credits Martin Casado as speaker and author; these are his investment and deployment arguments, not universal measurements of AI economics or evidence that he personally built the systems discussed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martin van den Brink

Martin van den Brink’s ASML Fellows profile describes a technical career that began with his joining the company in 1984 and culminated in service as president and chief technology officer.

The profile identifies the PAS 5500 step-and-scan system, mask-to-wafer alignment, and several lithography developments among his contributions.

His quoted working principle is to challenge physical models against experiments and experiments against models when choosing the next step.

Sources and details

Martin van den Brink – ASML Fellows

{
  "access_scope": "ASML’s institutional profile says van den Brink retired as president and CTO in April 2024 and remained a board advisor; its contribution list does not establish sole invention of TWINSCAN, immersion, or EUV lithography, and the quotation is a methodological view.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "joined 1984; retirement April 2024; honorary fellow 2024",
    "retrieved_utc": "2026-10-07T18:18:11.506295+00:00"
  },
  "dates_exact_in_source_role_order": [
    "joined 1984; retirement April 2024; honorary fellow 2024"
  ],
  "id": "person-coverage-c583625449ff64::S1",
  "title": "Martin van den Brink – ASML Fellows",
  "url": "https://www.asml.com/en/technology/how-we-innovate/fellows/martin-van-den-brink"
}

ASML’s institutional profile says van den Brink retired as president and CTO in April 2024 and remained a board advisor; its contribution list does not establish sole invention of TWINSCAN, immersion, or EUV lithography, and the quotation is a methodological view.

ASML’s institutional profile says van den Brink retired as president and CTO in April 2024 and remained a board advisor; its contribution list does not establish sole invention of TWINSCAN, immersion, or EUV lithography, and the quotation is a methodological view.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mary Parker Follett

IESE’s account of Mary Parker Follett describes her distinction between coercive power over people and power developed jointly with them.

It explains her circular-response idea through reciprocal interaction, where each response changes the relationship that shapes the next action.

The account connects her proposal to integrate conflicting interests with authority based on function and experience rather than ownership or rank alone.

Sources and details

Power and authority: the original vision of Mary Parker Follett

{
  "access_scope": "IESE Insight’s February 6, 2015 interpretation of Follett’s early twentieth-century writings, drawing on Domènec Melé and Josep Rosanas; Follett is the historical subject, not the writer of this web article, and no claim about her designing modern AI systems is made.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "February 6, 2015 account; historical subject 1868–1933",
    "retrieved_utc": "2026-10-07T18:22:10.585806+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 6, 2015 account; historical subject 1868–1933"
  ],
  "id": "person-maryparkerfollett::S1",
  "title": "Power and authority: the original vision of Mary Parker Follett",
  "url": "https://www.iese.edu/insight/articles/power-authority-ethics-mary-parker-follett/"
}

IESE Insight’s February 6, 2015 interpretation of Follett’s early twentieth-century writings, drawing on Domènec Melé and Josep Rosanas; Follett is the historical subject, not the writer of this web article, and no claim about her designing modern AI systems is made.

IESE Insight’s February 6, 2015 interpretation of Follett’s early twentieth-century writings, drawing on Domènec Melé and Josep Rosanas; Follett is the historical subject, not the writer of this web article, and no claim about her designing modern AI systems is made.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Max Tegmark

Max Tegmark is credited as the author of Life 3.0, which frames AI’s future as a set of social choices involving work, security, justice, and human purpose.

The publisher’s description highlights questions about sharing automation’s prosperity and making systems robust against failure or hacking.

It also presents superintelligence, consciousness, and physical limits on life as topics for deliberation rather than a single settled forecast.

Sources and details

Life 3.0

{
  "access_scope": "Penguin Random House’s description for Life 3.0 lists 2017 ebook/audio and 2018 paperback editions; Tegmark is the book author and Rob Shapiro the audiobook reader, while the marketing page is unbylined and its future scenarios are not established outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "ebook/audio August 29, 2017; paperback July 31, 2018",
    "retrieved_utc": "2026-10-07T17:58:37.465398+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ebook/audio August 29, 2017; paperback July 31, 2018"
  ],
  "id": "person-maxtegmark::S1",
  "title": "Life 3.0",
  "url": "https://www.penguinrandomhouse.com/books/530584/life-30-by-max-tegmark/9781101946602/"
}

Penguin Random House’s description for Life 3.0 lists 2017 ebook/audio and 2018 paperback editions; Tegmark is the book author and Rob Shapiro the audiobook reader, while the marketing page is unbylined and its future scenarios are not established outcomes.

Penguin Random House’s description for Life 3.0 lists 2017 ebook/audio and 2018 paperback editions; Tegmark is the book author and Rob Shapiro the audiobook reader, while the marketing page is unbylined and its future scenarios are not established outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Meijie Zhang

Meijie Zhang is a listed coauthor of a survey of LLM-driven autonomous UAV systems spanning perception, planning, control, coordination, and edge–cloud computing.

The abstract separates reasoning latency from control timing and tracks power, hardware, task outcomes, and validation settings to avoid misleading comparisons between platforms.

It describes a proposed safety approach in which grounded task semantics adjust constraints that a deterministic layer outside the generative model enforces.

Sources and details

Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges

{
  "access_scope": "Scilight’s September 20, 2026 survey credits Hao Wang and corresponding author Meijie Zhang; the inspected HTML supplies the abstract and references, not flight certification or a new experimentally validated aircraft, and no individual share of research work is inferred.",
  "authors": [
    "Hao Wang",
    "Meijie Zhang"
  ],
  "authors_in_source_order": [
    "Hao Wang",
    "Meijie Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026/09/20",
    "inspected_source_date_1": "received May 11, 2026; revised July 26, 2026; accepted August 23, 2026; published September 20, 2026",
    "retrieved_utc": "2026-10-07T18:18:21.645672+00:00"
  },
  "dates_exact_in_source_role_order": [
    "received May 11, 2026; revised July 26, 2026; accepted August 23, 2026; published September 20, 2026"
  ],
  "id": "person-coverage-fffd2c13c18bd9::S1",
  "title": "Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges",
  "url": "https://www.sciltp.com/journals/ic/articles/2608004995"
}

Scilight’s September 20, 2026 survey credits Hao Wang and corresponding author Meijie Zhang; the inspected HTML supplies the abstract and references, not flight certification or a new experimentally validated aircraft, and no individual share of research work is inferred.

Scilight’s September 20, 2026 survey credits Hao Wang and corresponding author Meijie Zhang; the inspected HTML supplies the abstract and references, not flight certification or a new experimentally validated aircraft, and no individual share of research work is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Memo Akten

Memo Akten’s Learning to See project uses neural networks reconstructing a live view of everyday objects to reflect on how prior experience shapes perception.

The artist’s account explains that what the network reconstructs is filtered by its training data and the knowledge learned from those examples.

For Learning to dream, it identifies Google Art Project images collected through Wikimedia as a large but incomplete, predominantly Western archive informing the system.

Sources and details

Learning to See: Learning to dream

{
  "access_scope": "Akten’s artist-authored project page situates Learning to dream within Learning to See, with 2017 series works; claims about perception and Google as a digital god are artistic framing, not evidence of machine consciousness or a complete representation of world art.",
  "authors": [
    "Memo Akten"
  ],
  "authors_in_source_order": [
    "Memo Akten"
  ],
  "dates": {
    "inspected_source_date_1": "2017 series context; page includes later bibliography and exhibitions",
    "retrieved_utc": "2026-10-07T17:55:35.956136+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 series context; page includes later bibliography and exhibitions"
  ],
  "id": "person-coverage-b6fd8b6a477db2::S1",
  "title": "Learning to See: Learning to dream",
  "url": "https://memo.tv/projects/2017/learning-to-dream/"
}

Akten’s artist-authored project page situates Learning to dream within Learning to See, with 2017 series works; claims about perception and Google as a digital god are artistic framing, not evidence of machine consciousness or a complete representation of world art.

Akten’s artist-authored project page situates Learning to dream within Learning to See, with 2017 series works; claims about perception and Google as a digital god are artistic framing, not evidence of machine consciousness or a complete representation of world art.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Hammer

Michael Hammer is credited with James Champy as a coauthor of the revised Reengineering the Corporation, which argues for redesigning processes, organization, and culture together.

Hachette’s description distinguishes earlier back-office and factory applications from the revised edition’s focus on front-office and revenue-producing activity.

It extends process redesign across company boundaries, using information sharing between customers and suppliers to rethink product development and planning.

Sources and details

Reengineering the Corporation: A Manifesto for Business Revolution

{
  "access_scope": "Hachette’s description of the August 1, 2001 trade-paperback revision, ISBN 9781857880977; Hammer and Champy are book coauthors, not identified page writers, and the promised performance improvements are a management argument rather than a guaranteed result.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "August 1, 2001 trade paperback",
    "retrieved_utc": "2026-10-07T18:20:10.723085+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 1, 2001 trade paperback"
  ],
  "id": "person-michaelhammer::S1",
  "title": "Reengineering the Corporation: A Manifesto for Business Revolution",
  "url": "https://www.hachette.com.au/michael-hammer-james-champy/reengineering-the-corporation-a-manifesto-for-business-revolution"
}

Hachette’s description of the August 1, 2001 trade-paperback revision, ISBN 9781857880977; Hammer and Champy are book coauthors, not identified page writers, and the promised performance improvements are a management argument rather than a guaranteed result.

Hachette’s description of the August 1, 2001 trade-paperback revision, ISBN 9781857880977; Hammer and Champy are book coauthors, not identified page writers, and the promised performance improvements are a management argument rather than a guaranteed result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael P. Ross

Michael P. Ross is the credited author of a 2026 dissertation examining how people interpret meaningful relationships with AI companions.

The abstract describes semi-structured interviews with seven adults, followed by de-identification and deductive thematic analysis in NVivo 15.

It reports themes including cognitive extension, emotional regulation, reduced social friction, and perceived reciprocity, while participants retained awareness of hallucination and bias.

Sources and details

What We Love Online: A Deductive Thematic Analysis of Thoughtforms, Parasocial Agent Connection, and Bidirectional Fictophilia in the Digital Liminal

{
  "access_scope": "Liberty University’s September 17, 2026 dissertation record provides an abstract for a seven-person qualitative study; reported experiences and preliminary theoretical support are not evidence that companions possess agency or an evaluation of clinical efficacy, and dissertation chair Bethany D. Mims Beliles is not a coauthor.",
  "authors": [
    "Michael P. Ross"
  ],
  "authors_in_source_order": [
    "Michael P. Ross"
  ],
  "dates": {
    "inspected_source_date_1": "September 17, 2026",
    "retrieved_utc": "2026-10-07T18:13:55.960117+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 17, 2026"
  ],
  "id": "person-coverage-445239ed31056c::S1",
  "title": "What We Love Online: A Deductive Thematic Analysis of Thoughtforms, Parasocial Agent Connection, and Bidirectional Fictophilia in the Digital Liminal",
  "url": "https://digitalcommons.liberty.edu/doctoral/8924/"
}

Liberty University’s September 17, 2026 dissertation record provides an abstract for a seven-person qualitative study; reported experiences and preliminary theoretical support are not evidence that companions possess agency or an evaluation of clinical efficacy, and dissertation chair Bethany D. Mims Beliles is not a coauthor.

Liberty University’s September 17, 2026 dissertation record provides an abstract for a seven-person qualitative study; reported experiences and preliminary theoretical support are not evidence that companions possess agency or an evaluation of clinical efficacy, and dissertation chair Bethany D. Mims Beliles is not a coauthor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Polanyi

Michael Polanyi is credited as the author of The Tacit Dimension, which argues that knowledge includes more than people can explicitly state.

Chicago’s description identifies tradition, inherited practice, implied values, and prejudgments as tacit components of scientific understanding.

It presents the book as challenging the view that scientific discovery rests on skepticism alone, with established belief also playing a role.

Sources and details

The Tacit Dimension

{
  "access_scope": "University of Chicago Press’s 2009 reissue description distinguishes Polanyi’s book from Amartya Sen’s new foreword; the description is unbylined publisher prose, and the philosophical argument is not an empirical claim about AI cognition.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2009 reissue",
    "retrieved_utc": "2026-10-07T18:22:04.404402+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2009 reissue"
  ],
  "id": "person-michaelpolanyi::S1",
  "title": "The Tacit Dimension",
  "url": "https://press.uchicago.edu/ucp/books/book/chicago/T/bo6035368.html"
}

University of Chicago Press’s 2009 reissue description distinguishes Polanyi’s book from Amartya Sen’s new foreword; the description is unbylined publisher prose, and the philosophical argument is not an empirical claim about AI cognition.

University of Chicago Press’s 2009 reissue description distinguishes Polanyi’s book from Amartya Sen’s new foreword; the description is unbylined publisher prose, and the philosophical argument is not an empirical claim about AI cognition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nate Rush

Nate Rush is a listed contributor to METR’s February 2026 update on its experiment comparing developers’ completion times with and without AI assistance.

The update explains that participants proposed their own tasks before random assignment, but increased unwillingness to work without AI biased recruitment and task selection.

It also identifies lower compensation and difficulty timing concurrent AI-agent work as reasons the new measurements provide an unreliable signal of productivity effects.

Sources and details

We are Changing our Developer Productivity Experiment Design

{
  "access_scope": "METR’s February 24, 2026 methodological update by Joel Becker, Nate Rush, Tom Cunningham, David Rein, and Khalid Mahamud; this source explicitly limits its later productivity estimates and separates them from historical early-2025 results, and it assigns no particular experimental task to Rush.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "dates": {
    "citation_date": "2026/02/24",
    "inspected_source_date_1": "February 24, 2026 update; earlier 2025 experiment distinct",
    "retrieved_utc": "2026-10-07T17:57:52.704396+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 24, 2026 update; earlier 2025 experiment distinct"
  ],
  "id": "person-local-naterush::S1",
  "title": "We are Changing our Developer Productivity Experiment Design",
  "url": "https://metr.org/blog/2026-02-24-uplift-update/"
}

METR’s February 24, 2026 methodological update by Joel Becker, Nate Rush, Tom Cunningham, David Rein, and Khalid Mahamud; this source explicitly limits its later productivity estimates and separates them from historical early-2025 results, and it assigns no particular experimental task to Rush.

METR’s February 24, 2026 methodological update by Joel Becker, Nate Rush, Tom Cunningham, David Rein, and Khalid Mahamud; this source explicitly limits its later productivity estimates and separates them from historical early-2025 results, and it assigns no particular experimental task to Rush.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nick Harkaway

Nick Harkaway is credited as the author of Gnomon, whose fictional Britain combines pervasive observation with a system able to access thoughts and memories.

The publisher’s synopsis follows inspector Mielikki Neith after dissident Diana Hunter dies during interrogation.

Neith’s examination of neural recordings reveals multiple lives within Hunter’s psyche and a hidden code she must decipher.

Sources and details

Gnomon

{
  "access_scope": "Penguin’s description of the October 19, 2017 Cornerstone Digital ebook, ISBN 9781473539549; the surveillance system and neural recordings are fictional devices, and Harkaway is the novelist rather than the unidentified writer of the publisher’s synopsis.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "October 19, 2017 ebook",
    "retrieved_utc": "2026-10-07T18:18:38.689438+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 19, 2017 ebook"
  ],
  "id": "person-coverage-e2f803fbf7342b::S1",
  "title": "Gnomon",
  "url": "https://www.penguin.com.au/books/gnomon-9781473539549"
}

Penguin’s description of the October 19, 2017 Cornerstone Digital ebook, ISBN 9781473539549; the surveillance system and neural recordings are fictional devices, and Harkaway is the novelist rather than the unidentified writer of the publisher’s synopsis.

Penguin’s description of the October 19, 2017 Cornerstone Digital ebook, ISBN 9781473539549; the surveillance system and neural recordings are fictional devices, and Harkaway is the novelist rather than the unidentified writer of the publisher’s synopsis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicole Starosielski

Nicole Starosielski is credited as the author of The Undersea Network, which follows communication cables from ocean depths to their landing sites in the South Pacific.

Duke’s description presents those physical routes as shaped by cultural history, politics, geography, and environmental conditions rather than by technology alone.

It identifies a companion mapping project through which readers can explore cable routes, photographs, archival material, and stories about island hubs.

Sources and details

The Undersea Network

{
  "access_scope": "Duke University Press’s March 2015 book description and companion-project notice; Starosielski is the book author, the marketing page is unbylined, and its account of transoceanic traffic is historical publication context rather than a current network-capacity measurement.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 2015",
    "retrieved_utc": "2026-10-07T18:12:56.276367+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2015"
  ],
  "id": "person-coverage-3042248f45423c::S1",
  "title": "The Undersea Network",
  "url": "https://www.dukeupress.edu/the-undersea-network"
}

Duke University Press’s March 2015 book description and companion-project notice; Starosielski is the book author, the marketing page is unbylined, and its account of transoceanic traffic is historical publication context rather than a current network-capacity measurement.

Duke University Press’s March 2015 book description and companion-project notice; Starosielski is the book author, the marketing page is unbylined, and its account of transoceanic traffic is historical publication context rather than a current network-capacity measurement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Olivier Temam

Olivier Temam is named as an Inria collaborator with Yunji Chen of ICT in the DianNao accelerator research project.

The project account explains that DianNao added local memory to exploit neural-network data locality, while DaDianNao distributed computation across chips and aggregated storage.

It distinguishes those designs from ShiDianNao’s sensor-to-accelerator connection and PuDianNao’s extension to algorithms sharing common computational primitives.

Sources and details

A Brief Introduction to The DianNao Project

{
  "access_scope": "ICT’s institutional project history describes the joint DianNao family from 2014–2015 and earlier work; it does not divide joint design labor among researchers and separately attributes the later Cambricon instruction set to Chen and the ICT team, not Temam.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "DianNao 2014; DaDianNao 2014; ShiDianNao 2015; PuDianNao 2015",
    "retrieved_utc": "2026-10-07T18:14:48.377614+00:00"
  },
  "dates_exact_in_source_role_order": [
    "DianNao 2014; DaDianNao 2014; ShiDianNao 2015; PuDianNao 2015"
  ],
  "id": "person-coverage-57d18e43239ec8::S1",
  "title": "A Brief Introduction to The DianNao Project",
  "url": "https://novel.ict.ac.cn/diannao/"
}

ICT’s institutional project history describes the joint DianNao family from 2014–2015 and earlier work; it does not divide joint design labor among researchers and separately attributes the later Cambricon instruction set to Chen and the ICT team, not Temam.

ICT’s institutional project history describes the joint DianNao family from 2014–2015 and earlier work; it does not divide joint design labor among researchers and separately attributes the later Cambricon instruction set to Chen and the ICT team, not Temam.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Debevec

Paul Debevec is a listed coauthor and the recorded presenter of Light Stage 3, a method for lighting actors with images of the environments into which they will be composited.

The project account describes resampling an environment image to drive 156 RGB LED light sources surrounding the actor.

The talk explains why a conventional blue screen could obstruct those lights and introduce blue spill, motivating a separate way to obtain the actor’s matte.

Sources and details

Light Stage 3: A Lighting Reproduction Approach to Live-Action Compositing

{
  "access_scope": "Debevec’s project page includes the July 26, 2002 SIGGRAPH talk transcript and a January 27, 2022 retrospective update; the six listed paper authors are distinct from the presenter, and the joint lighting and matting work is not assigned solely to Debevec or described as an AI system.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "SIGGRAPH talk July 26, 2002; page updated January 27, 2022",
    "retrieved_utc": "2026-10-07T17:55:24.691254+00:00"
  },
  "dates_exact_in_source_role_order": [
    "SIGGRAPH talk July 26, 2002; page updated January 27, 2022"
  ],
  "id": "person-coverage-0d33198a21720b::S1",
  "title": "Light Stage 3: A Lighting Reproduction Approach to Live-Action Compositing",
  "url": "https://www.pauldebevec.com/Research/LS3/"
}

Debevec’s project page includes the July 26, 2002 SIGGRAPH talk transcript and a January 27, 2022 retrospective update; the six listed paper authors are distinct from the presenter, and the joint lighting and matting work is not assigned solely to Debevec or described as an AI system.

Debevec’s project page includes the July 26, 2002 SIGGRAPH talk transcript and a January 27, 2022 retrospective update; the six listed paper authors are distinct from the presenter, and the joint lighting and matting work is not assigned solely to Debevec or described as an AI system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul J. Werbos

Paul J. Werbos is the credited author of Applications of advances in nonlinear sensitivity analysis, which summarizes a collection of differentiation and optimization algorithms.

The abstract identifies model sensitivity analysis, statistical and econometric estimation, artificial intelligence, and neuron modelling as application areas.

It directs readers seeking derivations and details to a separate document, making the available abstract an overview rather than a complete implementation guide.

Sources and details

Applications of advances in nonlinear sensitivity analysis

{
  "access_scope": "Springer’s abstract and author metadata for the 1982 chapter in System Modeling and Optimization; the September 29, 2005 online publication date is distinct from the original chapter year, editors R. F. Drenick and F. Kozin are not authors, and machine-added keywords are not used as method evidence.",
  "authors": [
    "Paul J. Werbos"
  ],
  "authors_in_source_order": [
    "Paul J. Werbos"
  ],
  "dates": {
    "citation_publication_date": "1982",
    "inspected_source_date_1": "original chapter 1982; online publication September 29, 2005",
    "retrieved_utc": "2026-10-07T18:21:35.589472+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original chapter 1982; online publication September 29, 2005"
  ],
  "id": "person-local-pauljwerbos::S1",
  "title": "Applications of advances in nonlinear sensitivity analysis",
  "url": "https://link.springer.com/chapter/10.1007/BFb0006203"
}

Springer’s abstract and author metadata for the 1982 chapter in System Modeling and Optimization; the September 29, 2005 online publication date is distinct from the original chapter year, editors R. F. Drenick and F. Kozin are not authors, and machine-added keywords are not used as method evidence.

Springer’s abstract and author metadata for the 1982 chapter in System Modeling and Optimization; the September 29, 2005 online publication date is distinct from the original chapter year, editors R. F. Drenick and F. Kozin are not authors, and machine-added keywords are not used as method evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul R. Milgrom

Paul R. Milgrom is credited with John Roberts as a coauthor of Economics, Organization, and Management.

Stanford’s description organizes the book around the problems of motivating people and coordinating their activities within firms.

It explains that the book uses economic reasoning to relate organizational structures and policies to the problems they are intended to solve.

Sources and details

Economics, Organization, and Management

{
  "access_scope": "Stanford Graduate School of Business’s record for the February 11, 1992 Prentice Hall book; Milgrom and Roberts are book coauthors, the record description is unbylined institutional prose, and no division of authorship or claim that the book addresses contemporary AI is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "February 11, 1992",
    "retrieved_utc": "2026-10-07T18:20:09.997740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 11, 1992"
  ],
  "id": "person-paulrmilgrom::S1",
  "title": "Economics, Organization, and Management",
  "url": "https://www.gsb.stanford.edu/faculty-research/books/economics-organization-management"
}

Stanford Graduate School of Business’s record for the February 11, 1992 Prentice Hall book; Milgrom and Roberts are book coauthors, the record description is unbylined institutional prose, and no division of authorship or claim that the book addresses contemporary AI is inferred.

Stanford Graduate School of Business’s record for the February 11, 1992 Prentice Hall book; Milgrom and Roberts are book coauthors, the record description is unbylined institutional prose, and no division of authorship or claim that the book addresses contemporary AI is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Inflection AI

Inflection AI’s cached company page presents Pi as a personal intelligence partner powered by the company’s foundation models.

The page emphasizes emotionally intelligent, human-centered interaction, with examples organized around curiosity and reflecting on the day.

It describes research and experimentation as the way the company develops personal intelligence and shares its learning through Inflection Labs.

Sources and details

Inflection AI

{
  "access_scope": "Company product description; empathy and contextual awareness are the company's positioning, not independently validated emotional experience, safety or performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:48.151453+00:00"
  },
  "id": "organization-ai-fe298ed1c2957d::S1",
  "title": "Inflection AI",
  "url": "https://inflection.ai/"
}

Company product description; empathy and contextual awareness are the company's positioning, not independently validated emotional experience, safety or performance.

Company product description; empathy and contextual awareness are the company's positioning, not independently validated emotional experience, safety or performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Numerion Labs

Y Combinator’s Numerion Labs profile describes an AI-native drug-discovery company developing and using machine-learning algorithms.

Its account joins computational chemistry, structural biology and medicinal chemistry within the company’s proposed drug-discovery platform.

The profile separately places Abraham Heifets, Alex Levy and Izhar Wallach under former founders, while describing Heifets and Levy’s earlier Atomwise work.

Sources and details

Numerion Labs: Artificial intelligence for drug discovery. | Y Combinator

{
  "access_scope": "Accelerator/company profile; proposed medicine discovery is not demonstrated patient benefit. Former-founder biographies and Atomwise history are not proof of current Numerion roles or equivalent corporate identity.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:01:41.068740+00:00"
  },
  "id": "organization-company-70bce20910c9d3::S1",
  "title": "Numerion Labs: Artificial intelligence for drug discovery. | Y Combinator",
  "url": "https://www.ycombinator.com/companies/numerion-labs"
}

Accelerator/company profile; proposed medicine discovery is not demonstrated patient benefit. Former-founder biographies and Atomwise history are not proof of current Numerion roles or equivalent corporate identity.

Accelerator/company profile; proposed medicine discovery is not demonstrated patient benefit. Former-founder biographies and Atomwise history are not proof of current Numerion roles or equivalent corporate identity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "2012 dates the Atomwise startup origin described by its university incubator; Numerion Labs is a later rebrand, not a newly founded company.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.ycombinator.com/companies/numerion-labs",
        "https://www.atomwise.com/privacy-policy/",
        "https://leaps.bayer.com/annual-review.pdf",
        "https://www.utoronto.ca/news/co-founder-atomwise-returns-u-t-speak-about-starting-his-ai-powered-drug-discovery-business"
      ],
      "year": 2012
    }
  ]
}

SambaNova

SambaNova’s company page connects foundation models with a fully integrated AI platform spanning layers of the computing stack.

Co-founder Rodrigo Liang frames its purpose as helping organizations run AI securely, profitably and at scale, while the page positions premium inference around payback.

Co-founder Kunle Olukotun describes that integrated platform as a backbone for the next generation of AI computing and organizational innovation.

Sources and details

About Us | SambaNova

{
  "access_scope": "Company strategy and attributed co-founder statements; return on investment, security and performance remain company claims, with no independent benchmark or personal technical-task allocation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "founded": "2017",
    "retrieved_utc": "2026-10-07T18:00:13.745547+00:00"
  },
  "id": "organization-company-bb176b110e5605::S1",
  "title": "About Us | SambaNova",
  "url": "https://sambanova.ai/company/about"
}

Company strategy and attributed co-founder statements; return on investment, security and performance remain company claims, with no independent benchmark or personal technical-task allocation.

Company strategy and attributed co-founder statements; return on investment, security and performance remain company claims, with no independent benchmark or personal technical-task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history states 2017.",
      "date": "2017",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://sambanova.ai/company/team",
        "https://sambanova.ai/company/about"
      ],
      "year": 2017
    }
  ]
}

xAI

The cached x.ai company page frames its mission around accelerating scientific discovery through reasoning, real-time voice and generative media.

Its stated working principles combine reasoning from first principles with ambitious goals and rapid iteration directed at concrete problems.

The page’s dated timeline tracks the 2023 company announcement and Grok launch through a February 2026 entry saying xAI joins SpaceX and later SpaceXAI product announcements.

Sources and details

Company: Accelerating Scientific Discovery | SpaceXAI

{
  "access_scope": "Cached x.ai company page now titled SpaceXAI; historical xAI identity and later branding remain distinct. Mission, working principles and timeline are the company's account, not independent scientific or product-performance validation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:02:58.944811+00:00",
    "xAI_company_announcement": "July 12, 2023",
    "xAI_joins_SpaceX_timeline": "February 2, 2026"
  },
  "id": "organization-company-daeed48c26239e::S1",
  "title": "Company: Accelerating Scientific Discovery | SpaceXAI",
  "url": "https://x.ai/company"
}

Cached x.ai company page now titled SpaceXAI; historical xAI identity and later branding remain distinct. Mission, working principles and timeline are the company's account, not independent scientific or product-performance validation.

Cached x.ai company page now titled SpaceXAI; historical xAI identity and later branding remain distinct. Mission, working principles and timeline are the company's account, not independent scientific or product-performance validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Investor account dates Musk starting xAI to March 2023; official company timeline gives public announcement July 12, 2023. Both support founding year 2023; no precise incorporation date is claimed.",
      "date": "2023",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://x.ai/company",
        "https://x.ai/news/xai-joins-spacex",
        "https://a16z.com/cursor-spacexai-the-fastest-iterating-team-wins/"
      ],
      "year": 2023
    }
  ]
}

Fireworks AI / inference platform

Fireworks’ founding-team page places its product-innovation effort in experience drawn from PyTorch, Meta and Google.

It lists Lin Qiao as co-founder and CEO, with a prior PyTorch leadership role, and separates Benny Chen’s advertising infrastructure background from Chenyu Zhao’s Vertex AI background.

The remaining listed co-founders add backgrounds in PyTorch maintenance, ranking and compilation, alongside core machine learning for Meta’s Newsfeed.

Sources and details

Fireworks - Team

{
  "access_scope": "Company founding-team descriptions and prior-role credits only; no independent inference benchmark, current external employer role or allocation of an individual's Fireworks implementation work.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:32.633105+00:00"
  },
  "id": "fireworks::S1",
  "title": "Fireworks - Team",
  "url": "https://fireworks.ai/team"
}

Company founding-team descriptions and prior-role credits only; no independent inference benchmark, current external employer role or allocation of an individual's Fireworks implementation work.

Company founding-team descriptions and prior-role credits only; no independent inference benchmark, current external employer role or allocation of an individual's Fireworks implementation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2022
}

Andy Southgate

Experimental Consciousness Science 2025-2026 interprets recent research through the Unfinishable Map’s stated dualist framework.

It uses the COGITATE comparison of IIT and global neuronal workspace theory to discuss the difficulty of distinguishing theories by their neural predictions.

The article also separates claimed brain-biophoton detection from a later measurement challenge, treating that line of evidence as unsettled rather than established support for its framework.

Sources and details

Experimental Consciousness Science 2025-2026 | The Unfinishable Map

{
  "access_scope": "Selected person Andy Southgate has an explicit author credit for Experimental Consciousness Science 2025-2026; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.",
  "authors": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "authors_in_source_order": [
    "Andy Southgate",
    "Claude Oquatre-six"
  ],
  "dates": {
    "citation_publication_date": "2026/03/26",
    "created": "2026-03-26",
    "last_modified": "2026-10-02",
    "retrieved_utc": "2026-10-07T18:15:36.375124+00:00"
  },
  "id": "person-coverage-7061eefbf0a030::S1",
  "title": "Experimental Consciousness Science 2025-2026 | The Unfinishable Map",
  "url": "https://unfinishablemap.org/topics/experimental-consciousness-science-2025-2026/"
}

Selected person Andy Southgate has an explicit author credit for Experimental Consciousness Science 2025-2026; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.

Selected person Andy Southgate has an explicit author credit for Experimental Consciousness Science 2025-2026; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Source explicitly labels this human-supervised article AI-generated by claude-opus-4-6+claude-opus-5-5. Its synthesis, quotations and dualist interpretations are claims of this article; underlying studies were not independently checked here, and dualism or quantum consciousness is not presented as established science.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anil Seth

The review recounts a 2022 public debate among proponents of five theories, including global neuronal workspace, higher-order, integrated-information, recurrent-processing and predictive-processing approaches.

Participants were asked to clarify what their theories explain, the mechanisms they propose and evidence that could refute them.

The abstract reports continuing disagreement about identifying conscious states and comparing theories, rather than convergence on a single account.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "Selected person Anil Seth has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "id": "person-coverage-7555aea0da18ff::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

Selected person Anil Seth has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

Selected person Anil Seth has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bernard Fong

The review examines human–AI collaboration as an alternative to framing automation solely as replacement of people.

It connects deep-learning capabilities with human domain expertise and treats performance and human satisfaction as parts of evaluating a collaborative system.

The authors argue that a successful machine teammate needs capabilities appropriate to the shared task, rather than efficiency considered in isolation.

Sources and details

A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning

{
  "access_scope": "Selected person Bernard Fong has an explicit author credit for A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.",
  "authors": [
    "Bahar Mahmud",
    "Guan Hong",
    "Bernard Fong"
  ],
  "authors_in_source_order": [
    "Bahar Mahmud",
    "Guan Hong",
    "Bernard Fong"
  ],
  "dates": {
    "registry_published": "2023-9-26",
    "registry_published_online": "2023-9-26",
    "registry_published_print": "2024-2-29",
    "retrieved_utc": "2026-10-07T18:12:33.977357+00:00"
  },
  "id": "person-coverage-586f8928bdac4c::S1",
  "title": "A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning",
  "url": "https://api.crossref.org/works/10.1145/3542698"
}

Selected person Bernard Fong has an explicit author credit for A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.

Selected person Bernard Fong has an explicit author credit for A Study of Human–AI Symbiosis for Creative Work: Recent Developments and Future Directions in Deep Learning; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited abstract in the cached Crossref record; online publication September 26, 2023 and print issue February 29, 2024 are distinct. The full review was not inspected, broad job-displacement claims are not adopted, and proposed collaboration benefits are not independently verified across workplaces.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Camilo Miguel Signorelli

The paper examines a proposed tension between IIT 4.0’s treatment of consciousness as primary and its commitment to a reality beyond one mind.

The authors clarify the ontology they attribute to the theory and consider ways to reconcile those commitments.

Their preferred interpretation understands external reality through experiences beyond one’s own, making the dispute an issue of philosophical formulation.

Sources and details

The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism

{
  "access_scope": "Selected person Camilo Miguel Signorelli has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.",
  "authors": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "authors_in_source_order": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "dates": {
    "registry_published": "2023-10-16",
    "registry_published_online": "2023-10-16",
    "retrieved_utc": "2026-10-07T18:13:46.631396+00:00"
  },
  "id": "person-coverage-e72aa0e4790f7a::S1",
  "title": "The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism",
  "url": "https://api.crossref.org/works/10.3390/e25101453"
}

Selected person Camilo Miguel Signorelli has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

Selected person Camilo Miguel Signorelli has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carles Garcia Bach

The co-authorship case study argues that the chain of actions producing a work matters to whether readers trust and attribute it.

Its abstract describes a human–AI collaboration supported by an external memory system and proposes distinctions among human, shared and AI-native provenance.

The authors present the account as a single limited case, leaving questions about naming, co-authorship and preferences unresolved.

Sources and details

Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship

{
  "access_scope": "Selected person Carles Garcia Bach has an explicit author credit for Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.",
  "authors": [
    "Carles Garcia Bach",
    "Hypatia AI"
  ],
  "authors_in_source_order": [
    "Carles Garcia Bach",
    "Hypatia AI"
  ],
  "dates": {
    "registry_published": "2026",
    "retrieved_utc": "2026-10-07T18:18:24.758933+00:00"
  },
  "id": "person-coverage-daba75194e82b2::S1",
  "title": "Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship",
  "url": "https://api.crossref.org/works/10.2139/ssrn.7149262"
}

Selected person Carles Garcia Bach has an explicit author credit for Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.

Selected person Carles Garcia Bach has an explicit author credit for Provenance as Epistemic Fulcrum: A Three-Year Case Study in Human-AI Co-authorship; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; author metadata lists Carles Garcia Bach and Hypatia AI. These are source-supplied credit entries, not an identity merge, proof of AI personhood or independent verification of persistent preferences, internal reasoning or the claimed chronology. Supporting records and the complete paper were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Conor Purcell

Purcell reports a preprint experiment in which language models played a points game with prompts that associated some options with pain or pleasure.

The researchers used the models’ trade-offs between points and those described experiences to explore possible tests for future AI sentience.

The report explicitly separates that test-design proposal from a claim that the evaluated chatbots actually feel pain or are sentient.

Sources and details

Could Inflicting Pain Test AI for Sentience? | Scientific American

{
  "access_scope": "Selected person Conor Purcell has an explicit author credit for Could Pain Help Test AI for Sentience?; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.",
  "authors": [
    "Conor Purcell"
  ],
  "authors_in_source_order": [
    "Conor Purcell"
  ],
  "dates": {
    "article_publication": "2025-01-17",
    "retrieved_utc": "2026-10-07T18:19:06.679662+00:00"
  },
  "id": "person-coverage-ff4883ba7c02ba::S1",
  "title": "Could Inflicting Pain Test AI for Sentience? | Scientific American",
  "url": "https://www.scientificamerican.com/article/could-inflicting-pain-test-ai-for-sentience/"
}

Selected person Conor Purcell has an explicit author credit for Could Pain Help Test AI for Sentience?; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.

Selected person Conor Purcell has an explicit author credit for Could Pain Help Test AI for Sentience?; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Scientific American article by Conor Purcell, edited by Ben Guarino, January 17, 2025; attributed account of a then-unreviewed preprint and text-conditioned responses. No actual inflicted pain, validated consciousness test, full-study replication or 2026 model assessment is asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Craig Addison

Addison argues that Taiwan’s place in international electronics supply chains could give other countries an economic reason to oppose an attack.

His silicon-shield argument connects damage to Taiwanese factories and supply routes with disruption for overseas firms that depend on their components.

He presents industrial interdependence as a possible source of protection, extending a strategic argument beyond military equipment alone.

Sources and details

'Silicon shield' may protect from China attack

{
  "access_scope": "Selected person Craig Addison has an explicit author credit for Silicon Shield: Taiwan’s Protection Against Chinese Attack; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.",
  "authors": [
    "Craig Addison"
  ],
  "authors_in_source_order": [
    "Craig Addison"
  ],
  "dates": {
    "published": "2001-05-12",
    "retrieved_utc": "2026-10-07T18:17:55.186781+00:00"
  },
  "id": "person-coverage-b078e310d27820::S1",
  "title": "'Silicon shield' may protect from China attack",
  "url": "https://www.taipeitimes.com/News/editorials/archives/2001/05/12/0000085421"
}

Selected person Craig Addison has an explicit author credit for Silicon Shield: Taiwan’s Protection Against Chinese Attack; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.

Selected person Craig Addison has an explicit author credit for Silicon Shield: Taiwan’s Protection Against Chinese Attack; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Craig Addison’s Taipei Times opinion article dated May 12, 2001; this is a historical deterrence argument, not a verified guarantee of security, a current geopolitical assessment or inspection of the complete book.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

D. F. Jones

In Colossus, Charles Forbin builds a defense computer that quickly exceeds the capabilities its designers expected.

After the US president gives it control of missiles and defense protocols, the Soviet Union announces a comparable system called Guardian.

The publisher’s synopsis turns their proposed communication into a warning about the control entrusted to systems whose behavior their builders no longer understand.

Sources and details

Colossus by D. F. Jones - Hachette Australia

{
  "access_scope": "Selected person D. F. Jones has an explicit author credit for Colossus; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.",
  "authors": [
    "D. F. Jones"
  ],
  "authors_in_source_order": [
    "D. F. Jones"
  ],
  "dates": {
    "inspected_ebook": "2019-03-05",
    "inspected_paperback": "2020-06-25",
    "original_novel_as_stated_in_author_paragraph": "1966",
    "retrieved_utc": "2026-10-07T18:19:26.143005+00:00"
  },
  "id": "person-dfjones::S1",
  "title": "Colossus by D. F. Jones - Hachette Australia",
  "url": "https://www.hachette.com.au/d-f-jones/colossus"
}

Selected person D. F. Jones has an explicit author credit for Colossus; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.

Selected person D. F. Jones has an explicit author credit for Colossus; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Hachette’s Colossus synopsis and author paragraph; bounded fictional premise, not the complete novel or real defense-system behavior. The 2019 ebook and 2020 paperback are later editions, separate from the 1966 novel and 1970 film.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dan Simmons

The Hyperion synopsis follows seven pilgrims travelling to a world threatened by galactic war, each seeking answers to a personal mystery.

Their destination is associated with the Shrike and the Time Tombs, structures described as moving backward through time.

The pilgrims’ competing hopes and secrets connect their individual journeys to the fate of humanity.

Sources and details

Hyperion - Penguin Random House Library Marketing

{
  "access_scope": "Selected person Dan Simmons has an explicit author credit for Hyperion Cantos; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.",
  "authors": [
    "Dan Simmons"
  ],
  "authors_in_source_order": [
    "Dan Simmons"
  ],
  "dates": {
    "inspected_ebook": "2011-01-12",
    "retrieved_utc": "2026-10-07T18:17:44.882048+00:00"
  },
  "id": "person-coverage-bdd7c82e606a01::S1",
  "title": "Hyperion - Penguin Random House Library Marketing",
  "url": "https://penguinrandomhouselibrary.com/book/?isbn=9780307781888"
}

Selected person Dan Simmons has an explicit author credit for Hyperion Cantos; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.

Selected person Dan Simmons has an explicit author credit for Hyperion Cantos; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House Library Marketing About section for the January 12, 2011 Hyperion ebook; selected first-novel premise for the broader Hyperion Cantos record, not full-cycle coverage, later sequels or physical validation of time reversal. No AI mechanism inferred from the source’s promotional synopsis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel F. Galouye

In the description of Simulacron-3, Douglas Hall’s team creates an artificial environment to simulate reality.

The simulation lets its builders collect public opinion without waiting for responses from people outside it.

When Hall’s colleagues begin disappearing, the premise links their investigation to uncertainty about which reality they inhabit.

Sources and details

Simulacron-3 - Daniel F. Galouye - Google Books

{
  "access_scope": "Selected person Daniel F. Galouye has an explicit author credit for Simulacron-3; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.",
  "authors": [
    "Daniel F. Galouye"
  ],
  "authors_in_source_order": [
    "Daniel F. Galouye"
  ],
  "dates": {
    "inspected_CAЕZIK_edition": "2021-07-13",
    "original_work_as_stated_in_author_paragraph": "1964",
    "retrieved_utc": "2026-10-07T18:15:55.140393+00:00"
  },
  "id": "person-coverage-8c0fb18ce7106d::S1",
  "title": "Simulacron-3 - Daniel F. Galouye - Google Books",
  "url": "https://books.google.com/books/about/Simulacron_3.html?id=8MbAzQEACAAJ"
}

Selected person Daniel F. Galouye has an explicit author credit for Simulacron-3; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.

Selected person Daniel F. Galouye has an explicit author credit for Simulacron-3; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. CAEZIK publisher description reproduced in Google Books for the July 13, 2021 edition; bounded fictional synopsis. The original 1964 work date is separate from the inspected reissue. Promotional firstness, influence and historical priority claims are not adopted; no simulation technology is validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Kahneman

Kahneman distinguishes quick, intuitive judgment from slower, deliberate reasoning as two interacting ways of making choices.

The publisher applies that distinction to overconfidence, corporate strategy and difficulty anticipating future satisfaction.

The book’s practical question is when to rely on intuition and when to use more deliberate checks against recurring errors in judgment.

Sources and details

Thinking, Fast and Slow

{
  "access_scope": "Selected person Daniel Kahneman has an explicit author credit for Thinking, Fast and Slow; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.",
  "authors": [
    "Daniel Kahneman"
  ],
  "authors_in_source_order": [
    "Daniel Kahneman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:22.338516+00:00"
  },
  "id": "person-danielkahneman::S1",
  "title": "Thinking, Fast and Slow",
  "url": "https://us.macmillan.com/books/9780374275631/thinkingfastandslow/"
}

Selected person Daniel Kahneman has an explicit author credit for Thinking, Fast and Slow; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.

Selected person Daniel Kahneman has an explicit author credit for Thinking, Fast and Slow; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher Book Details section of Thinking, Fast and Slow; the systems are the book’s explanatory framework, not a new anatomical claim or a complete audit of the studies it cites.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniella DiPaola

The study compares empathy toward human-written and language-model-written personal stories while varying disclosure of authorship.

Its abstract describes crowdsourced ratings and open-ended responses, allowing the authors to examine both the extent and the interpretation of empathy.

It reports higher empathy for human stories in most tested conditions and greater willingness to empathize with AI-written stories when authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Selected person Daniella DiPaola has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "registry_published": "2024-9-25",
    "registry_published_online": "2024-9-25",
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-5ece2126097a9e::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Selected person Daniella DiPaola has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

Selected person Daniella DiPaola has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dennis L. Meadows

The Limits to Growth considers population, industrialization, food, pollution and resource depletion together rather than extrapolating one variable in isolation.

Its introduction argues that continuing the prevailing growth trends could produce an eventual decline in population and industrial capacity.

The authors also describe an alternative of ecological and economic stability, making changed trends and the timing of action central to their argument.

Sources and details

The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind

{
  "access_scope": "Selected person Dennis L. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.",
  "authors": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "authors_in_source_order": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "dates": {
    "original_work": "1972",
    "retrieved_utc": "2026-10-07T18:11:57.102750+00:00"
  },
  "id": "person-coverage-4511465f5d1d85::S1",
  "title": "The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind",
  "url": "https://collections.dartmouth.edu/archive/text/meadows/diplomatic/meadows_ltg-diplomatic.html"
}

Selected person Dennis L. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

Selected person Dennis L. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donella H. Meadows

The Limits to Growth considers population, industrialization, food, pollution and resource depletion together rather than extrapolating one variable in isolation.

Its introduction argues that continuing the prevailing growth trends could produce an eventual decline in population and industrial capacity.

The authors also describe an alternative of ecological and economic stability, making changed trends and the timing of action central to their argument.

Sources and details

The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind

{
  "access_scope": "Selected person Donella H. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.",
  "authors": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "authors_in_source_order": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "dates": {
    "original_work": "1972",
    "retrieved_utc": "2026-10-07T18:11:57.102750+00:00"
  },
  "id": "person-coverage-696f833eecf518::S1",
  "title": "The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind",
  "url": "https://collections.dartmouth.edu/archive/text/meadows/diplomatic/meadows_ltg-diplomatic.html"
}

Selected person Donella H. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

Selected person Donella H. Meadows has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ed Conway

Conway’s announcement approaches modern civilization through the materials and energy infrastructure it depends on.

He joins economics, geology, politics and field reporting to examine systems such as electrical networks and structural steel that are easily taken for granted.

The announcement connects renewed attention to those dependencies with the pandemic, war and demand for materials used in low-carbon infrastructure.

Sources and details

Material World — author’s prepublication announcement

{
  "access_scope": "Selected person Ed Conway has an explicit author credit for Material World: The Six Raw Materials That Shape Modern Civilization; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.",
  "authors": [
    "Ed Conway"
  ],
  "authors_in_source_order": [
    "Ed Conway"
  ],
  "dates": {
    "publication_status": "In preparation; planned mid-2023",
    "retrieved_utc": "2026-10-07T18:16:53.460550+00:00"
  },
  "id": "person-coverage-9ad40a581c3a57::S1",
  "title": "Material World — author’s prepublication announcement",
  "url": "https://www.edmundconway.com/books/"
}

Selected person Ed Conway has an explicit author credit for Material World: The Six Raw Materials That Shape Modern Civilization; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.

Selected person Ed Conway has an explicit author credit for Material World: The Six Raw Materials That Shape Modern Civilization; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Author’s prepublication announcement, describing a book planned for mid-2023; the final text and its named six-material structure were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Evgenia Gkintoni

The review brings together EEG methods used to study emotion and cognition, ranging from spectral measures to machine learning.

Its methods use narrative synthesis across heterogeneous studies rather than pooling them into a meta-analysis.

The abstract emphasizes variability between people, overlapping signals and methodological standardization as limits on interpreting those measurements.

Sources and details

Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective

{
  "access_scope": "Selected person Evgenia Gkintoni has an explicit author credit for Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.",
  "authors": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "authors_in_source_order": [
    "Evgenia Gkintoni",
    "Constantinos Halkiopoulos"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:31.090703+00:00",
    "xml_collection_month": "2025-11",
    "xml_epub_date": "2025-11-01"
  },
  "id": "person-coverage-7533af77eddff6::S1",
  "title": "Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective",
  "url": "https://www.ebi.ac.uk/europepmc/webservices/rest/PMC12649996/fullTextXML"
}

Selected person Evgenia Gkintoni has an explicit author credit for Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.

Selected person Evgenia Gkintoni has an explicit author credit for Mapping EEG Metrics to Human Affective and Cognitive Models: An Interdisciplinary Scoping Review from a Cognitive Neuroscience Perspective; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract read from the original cached Europe PMC XML and section 1.2.5 Synthesis Approach; Biomimetics review published November 1, 2025. Two named authors preserved. Full studies, numerical accuracy claims, clinical diagnosis and devices were not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fred Saberhagen

The Berserker series follows automated alien fortresses whose surviving directive is to eliminate life after the war that created them.

The author-site account places the struggle among a humanity that has spread beyond Earth and the peaceful Carmpan, who rely on human defenses.

Its recurring Lady Genevieve survives the loss of her human body as a computer program, adding a displaced human mind to the saga’s destructive machines.

Sources and details

The Berserker Saga — author-site series account

{
  "access_scope": "Selected person Fred Saberhagen has an explicit author credit for Berserker series; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.",
  "authors": [
    "Fred Saberhagen"
  ],
  "authors_in_source_order": [
    "Fred Saberhagen"
  ],
  "dates": {
    "first_collection": "1967",
    "first_story": "1963",
    "inspected_manifestation": "cached publisher/author/institution HTML or stated arXiv abstract",
    "page_date": "undated",
    "retrieved_utc": "2026-10-07T18:13:47.785321+00:00"
  },
  "id": "person-coverage-52ec17af7f5100::S1",
  "title": "The Berserker Saga — author-site series account",
  "url": "https://berserker.com/about_berserkers.htm"
}

Selected person Fred Saberhagen has an explicit author credit for Berserker series; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.

Selected person Fred Saberhagen has an explicit author credit for Berserker series; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Undated author-site series account, not a reading of every installment. First story 1963 and first collection 1967 remain distinct; the page’s then-current book count is not treated as a present-day total. Machine minds and Genevieve’s program are fictional premises.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hae Won Park

The study compares empathy toward human-written and language-model-written personal stories while varying disclosure of authorship.

Its abstract describes crowdsourced ratings and open-ended responses, allowing the authors to examine both the extent and the interpretation of empathy.

It reports higher empathy for human stories in most tested conditions and greater willingness to empathize with AI-written stories when authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Selected person Hae Won Park has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "registry_published": "2024-9-25",
    "registry_published_online": "2024-9-25",
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-cdce0b33838643::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Selected person Hae Won Park has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

Selected person Hae Won Park has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hanbo Xie

The promising future of cognitive science and artificial intelligence asks how machine learning compares with human learning.

Hanbo Xie’s commentary describes an earlier study using novel-character recognition and a temporally complex game to compare sample efficiency.

The accessible prose reports faster human learning and stronger generalization in those tasks, using the comparison to motivate research across cognitive science and AI.

Sources and details

The promising future of cognitive science and artificial intelligence

{
  "access_scope": "Selected person Hanbo Xie has an explicit author credit for The promising future of cognitive science and artificial intelligence; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.",
  "authors": [
    "Hanbo Xie"
  ],
  "authors_in_source_order": [
    "Hanbo Xie"
  ],
  "dates": {
    "citation_publication_date": "2023/04",
    "published": "10 March 2023",
    "retrieved_utc": "2026-10-07T18:16:57.591836+00:00",
    "version_of_record": "10 March 2023"
  },
  "id": "person-coverage-9c98764c62da09::S1",
  "title": "The promising future of cognitive science and artificial intelligence",
  "url": "https://www.nature.com/articles/s44159-023-00170-3"
}

Selected person Hanbo Xie has an explicit author credit for The promising future of cognitive science and artificial intelligence; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.

Selected person Hanbo Xie has an explicit author credit for The promising future of cognitive science and artificial intelligence; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Accessible preview of Xie’s commentary on Lake and colleagues’ 2017 study; Xie did not thereby conduct those experiments, and task-specific comparisons are not universal claims about human or machine intelligence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hao Wang

The UAV survey separates language-based reasoning from perception, planning, control and coordination among aircraft.

Its abstract distinguishes reasoning latency from control timing and other hardware or validation conditions to make comparisons more precise.

It proposes keeping runtime safety constraints in a deterministic layer outside the generative model, while identifying connectivity failures, hallucinations and simulation-to-reality gaps as deployment challenges.

Sources and details

Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges

{
  "access_scope": "Selected person Hao Wang has an explicit author credit for Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.",
  "authors": [
    "Meijie Zhang",
    "Hao Wang"
  ],
  "authors_in_source_order": [
    "Meijie Zhang",
    "Hao Wang"
  ],
  "dates": {
    "registry_published": "2026-9-20",
    "registry_published_online": "2026-9-20",
    "retrieved_utc": "2026-10-07T18:17:58.036605+00:00"
  },
  "id": "person-coverage-c33c49bcfe0c30::S1",
  "title": "Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges",
  "url": "https://api.crossref.org/works/10.53941/ic.2026.100011"
}

Selected person Hao Wang has an explicit author credit for Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.

Selected person Hao Wang has an explicit author credit for Large Language Model-Driven Autonomous UAV Systems: Technical Evolution, Core Architectures, and Critical Challenges; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract, September 20, 2026; the full survey, flight tests and mathematical safety certificates were not inspected. The proposed architecture is not a certified aircraft system or demonstrated guarantee of safe flight.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hussein Chaitani

Chaitani treats literacy as a practice shaped by institutional power rather than only a workforce skill.

Drawing on Freire’s critique of banking education, the chapter argues that learners need to recognize ideological assumptions in reading and writing.

It proposes criticality across cultures and ideologies as part of adult education in a world of Big Tech and cloud capital.

Sources and details

Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education

{
  "access_scope": "Selected person Hussein Chaitani has an explicit author credit for Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.",
  "authors": [
    "Hussein Chaitani"
  ],
  "authors_in_source_order": [
    "Hussein Chaitani"
  ],
  "dates": {
    "citation_publication_date": "2026-03-06",
    "retrieved_utc": "2026-10-07T18:15:58.472774+00:00"
  },
  "id": "person-coverage-81d8db2f52362e::S1",
  "title": "Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education",
  "url": "https://doi.org/10.5772/intechopen.1013545"
}

Selected person Hussein Chaitani has an explicit author credit for Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.

Selected person Hussein Chaitani has an explicit author credit for Artificial Intelligence, Ideology, and Literacy: A Multilectal Framework for Empowering Criticality in Adult Education; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract and introductory framing of the March 6, 2026 IntechOpen chapter; the author’s critical perspective is attributed. Predictions of inevitable precarity or serfdom are not adopted as established outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ignacio Cea

The paper examines a proposed tension between IIT 4.0’s treatment of consciousness as primary and its commitment to a reality beyond one mind.

The authors clarify the ontology they attribute to the theory and consider ways to reconcile those commitments.

Their preferred interpretation understands external reality through experiences beyond one’s own, making the dispute an issue of philosophical formulation.

Sources and details

The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism

{
  "access_scope": "Selected person Ignacio Cea has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.",
  "authors": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "authors_in_source_order": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "dates": {
    "registry_published": "2023-10-16",
    "registry_published_online": "2023-10-16",
    "retrieved_utc": "2026-10-07T18:13:46.631396+00:00"
  },
  "id": "person-coverage-465e87f3e4b2ed::S1",
  "title": "The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism",
  "url": "https://api.crossref.org/works/10.3390/e25101453"
}

Selected person Ignacio Cea has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

Selected person Ignacio Cea has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Isaac Asimov

The publisher’s description of I, Robot presents connected stories about machines whose behavior is constrained by three ranked laws.

Those rules prioritize preventing harm to humans, place obedience below that priority and subordinate a robot’s self-preservation to both.

The described stories vary the robots’ roles and capacities, making relations between humans and increasingly capable machines a recurring question.

Sources and details

I, Robot by Isaac Asimov

{
  "access_scope": "Selected person Isaac Asimov has an explicit author credit for I, Robot; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "inspected_Del_Rey_edition": "2008-04-29",
    "retrieved_utc": "2026-10-07T18:20:17.539866+00:00"
  },
  "id": "person-isaacasimov::S1",
  "title": "I, Robot by Isaac Asimov",
  "url": "https://www.penguinrandomhouse.com/books/5681/i-robot-by-isaac-asimov/paperback/"
}

Selected person Isaac Asimov has an explicit author credit for I, Robot; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.

Selected person Isaac Asimov has an explicit author credit for I, Robot; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Penguin Random House description of the April 29, 2008 Del Rey edition and its printed Three Laws; bounded account of fictional rules and story framing, not full collection inspection, real safety engineering or proof of historical influence. Original collection and reissue dates remain distinct; promotional claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ivan Anishchenko

The three-track network integrates protein sequence information, pairwise distance information and three-dimensional coordinates during prediction.

Passing information among these representations lets the model connect evidence at different structural levels rather than treating them as separate end stages.

The authors describe applications to structure modeling and protein-complex prediction and make the method available to the research community.

Sources and details

Accurate prediction of protein structures and interactions using a 3-track neural network

{
  "access_scope": "Selected person Ivan Anishchenko has an explicit author credit for Accurate prediction of protein structures and interactions using a three-track neural network; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.",
  "authors": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "dates": {
    "citation_publication_date": "2021 Jul 15",
    "retrieved_utc": "2026-10-07T18:12:07.573538+00:00"
  },
  "id": "person-coverage-c2b37387d0aace::S1",
  "title": "Accurate prediction of protein structures and interactions using a 3-track neural network",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC7612213/"
}

Selected person Ivan Anishchenko has an explicit author credit for Accurate prediction of protein structures and interactions using a three-track neural network; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

Selected person Ivan Anishchenko has an explicit author credit for Accurate prediction of protein structures and interactions using a three-track neural network; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jennifer Rene French Cyrek

Cyrek analyzes how AI developers frame risk and responsibility in a purposive collection of system cards from 2023–2025.

The dissertation abstract describes those documents as interfaces between technical organizations and their broader social environment.

Its thematic analysis argues that catastrophic-risk vocabulary and benchmark conventions help manage institutional meaning, while other social harms can receive less attention.

Sources and details

Coordinating Meaning with AI System Cards: A Thematic Analysis

{
  "access_scope": "Selected person Jennifer Rene French Cyrek has an explicit author credit for Coordinating Meaning with AI System Cards: A Thematic Analysis; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.",
  "authors": [
    "Jennifer Rene French Cyrek"
  ],
  "authors_in_source_order": [
    "Jennifer Rene French Cyrek"
  ],
  "dates": {
    "repository_date": "2026-07-21",
    "retrieved_utc": "2026-10-07T18:16:36.800360+00:00"
  },
  "id": "person-coverage-98194fc04557c0::S1",
  "title": "Coordinating Meaning with AI System Cards: A Thematic Analysis",
  "url": "https://digitalcommons.liberty.edu/doctoral/8650/"
}

Selected person Jennifer Rene French Cyrek has an explicit author credit for Coordinating Meaning with AI System Cards: A Thematic Analysis; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.

Selected person Jennifer Rene French Cyrek has an explicit author credit for Coordinating Meaning with AI System Cards: A Thematic Analysis; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Liberty University repository abstract of Jennifer Rene French Cyrek’s July 21, 2026 dissertation; Robert Mott is chair, not author. Full dissertation, corpus selection and coding were not audited; findings are the author’s interpretive analysis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jocelyn Shen

The study compares empathy toward human-written and language-model-written personal stories while varying disclosure of authorship.

Its abstract describes crowdsourced ratings and open-ended responses, allowing the authors to examine both the extent and the interpretation of empathy.

It reports higher empathy for human stories in most tested conditions and greater willingness to empathize with AI-written stories when authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Selected person Jocelyn Shen has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "registry_published": "2024-9-25",
    "registry_published_online": "2024-9-25",
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-e9b16e122c3b0b::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Selected person Jocelyn Shen has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

Selected person Jocelyn Shen has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jørgen Randers

The Limits to Growth considers population, industrialization, food, pollution and resource depletion together rather than extrapolating one variable in isolation.

Its introduction argues that continuing the prevailing growth trends could produce an eventual decline in population and industrial capacity.

The authors also describe an alternative of ecological and economic stability, making changed trends and the timing of action central to their argument.

Sources and details

The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind

{
  "access_scope": "Selected person Jørgen Randers has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.",
  "authors": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "authors_in_source_order": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "dates": {
    "original_work": "1972",
    "retrieved_utc": "2026-10-07T18:11:57.102750+00:00"
  },
  "id": "person-coverage-18773f7de3fa27::S1",
  "title": "The Limits to Growth: A report for the Club of Rome’s project on the predicament of mankind",
  "url": "https://collections.dartmouth.edu/archive/text/meadows/diplomatic/meadows_ltg-diplomatic.html"
}

Selected person Jørgen Randers has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

Selected person Jørgen Randers has an explicit author credit for The Limits to Growth; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. 1972 book introduction, conclusions on pages 23–24, in Dartmouth’s transcription; these are conditional historical model conclusions, not current forecasts or a complete audit of the model.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Liu

The Algorithms for Love follows Elena, a toy designer whose speaking dolls make rule-driven behavior feel personal to their users.

Her demonstration of Laura exposes a gap between grammatically formed sentences and meaningful understanding, even while the toy can react to its surroundings.

The narrator also describes familiar exchanges with Brad as routines, connecting the fictional machine’s responses with her unease about human intimacy.

Sources and details

Strange Horizons - The Algorithms for Love By Ken Liu

{
  "access_scope": "Selected person Ken Liu has an explicit author credit for The Algorithms for Love; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.",
  "authors": [
    "Ken Liu"
  ],
  "authors_in_source_order": [
    "Ken Liu"
  ],
  "dates": {
    "issue": "12 July 2004",
    "retrieved_utc": "2026-10-07T18:11:20.396101+00:00"
  },
  "id": "person-coverage-087d87b6e8444d::S1",
  "title": "Strange Horizons - The Algorithms for Love By Ken Liu",
  "url": "https://strangehorizons.com/wordpress/fiction/the-algorithms-for-love/"
}

Selected person Ken Liu has an explicit author credit for The Algorithms for Love; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.

Selected person Ken Liu has an explicit author credit for The Algorithms for Love; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Original Strange Horizons fiction; Laura’s mechanisms and the narrator’s distress are story elements, not demonstrated robotics results or a theory proving that human love is algorithmic.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lucia Melloni

The review recounts a 2022 public debate among proponents of five theories, including global neuronal workspace, higher-order, integrated-information, recurrent-processing and predictive-processing approaches.

Participants were asked to clarify what their theories explain, the mechanisms they propose and evidence that could refute them.

The abstract reports continuing disagreement about identifying conscious states and comparing theories, rather than convergence on a single account.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "Selected person Lucia Melloni has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "id": "person-coverage-fd71f5a7602a99::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

Selected person Lucia Melloni has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

Selected person Lucia Melloni has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luke F. Walton

Walton’s argument distinguishes having the power to override an AI recommendation from choosing the framework that makes it look reasonable.

A hypothetical pension fund illustrates the gap: officers approve trades while leaving the vendor’s definition of risk unexamined.

The paper calls this an answerability problem and argues that adopting an inherited frame requires a judgment of one’s own.

Sources and details

The Decision No One Authored: The Answerability Gap in Generative AI

{
  "access_scope": "Selected person Luke F. Walton has an explicit author credit for The Decision No One Authored: The Answerability Gap in Generative AI; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.",
  "authors": [
    "Luke F. Walton"
  ],
  "authors_in_source_order": [
    "Luke F. Walton"
  ],
  "dates": {
    "registry_publication_year": "2026",
    "registry_published": "2026",
    "registry_version": "v2.0",
    "retrieved_utc": "2026-10-07T18:18:25.162338+00:00"
  },
  "id": "person-coverage-d4967507314421::S1",
  "title": "The Decision No One Authored: The Answerability Gap in Generative AI",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.20614374"
}

Selected person Luke F. Walton has an explicit author credit for The Decision No One Authored: The Answerability Gap in Generative AI; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.

Selected person Luke F. Walton has an explicit author credit for The Decision No One Authored: The Answerability Gap in Generative AI; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. DataCite’s deposited abstract for the 2026 Zenodo work, not the complete paper; the pension fund is explicitly hypothetical. This philosophical argument is not an observed investment outcome, financial advice or proof of a causal effect from reliability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maarten Sap

The study compares empathy toward human-written and language-model-written personal stories while varying disclosure of authorship.

Its abstract describes crowdsourced ratings and open-ended responses, allowing the authors to examine both the extent and the interpretation of empathy.

It reports higher empathy for human stories in most tested conditions and greater willingness to empathize with AI-written stories when authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Selected person Maarten Sap has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "registry_published": "2024-9-25",
    "registry_published_online": "2024-9-25",
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-d94a36772fdfe5::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Selected person Maarten Sap has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

Selected person Maarten Sap has an explicit author credit for Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. JMIR’s structured abstract deposited in Crossref, online date September 25, 2024; self-reported empathy toward stories in the tested conditions, not clinical effectiveness, evidence of an AI narrator’s feelings or a universal result for deployed support chatbots. Full methods and statistics were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mahsa Ahmadyan

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024 examines AI-equipped military systems as instruments of proxy conflict.

The publisher-deposited abstract discusses remotely controlled equipment, robots and automated guided weapons in relation to human and financial costs.

Its reported argument pairs claimed battlefield advantages with humanitarian concerns about civilian casualties, rather than treating efficiency as the only criterion.

Sources and details

The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024

{
  "access_scope": "Selected person Mahsa Ahmadyan has an explicit author credit for The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.",
  "authors": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "authors_in_source_order": [
    "Ehsan Ejazi",
    "Mahsa Ahmadyan"
  ],
  "dates": {
    "published_online": "2025-12-12",
    "published_print": "2026-02-09",
    "retrieved_utc": "2026-10-07T18:17:39.176968+00:00"
  },
  "id": "person-coverage-e07342e25aa5ad::S1",
  "title": "The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024",
  "url": "https://api.crossref.org/works/10.21140/mcuj.20251602007"
}

Selected person Mahsa Ahmadyan has an explicit author credit for The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.

Selected person Mahsa Ahmadyan has an explicit author credit for The Role of Artificial Intelligence in the U.S. Military Strategy in Proxy Wars, 2020–2024; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract and ordered author metadata only; the abstract’s findings are attributed to Ejazi and Ahmadyan, while methods, datasets, causal effect sizes and the full paper remain uninspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Melanie Boly

The review recounts a 2022 public debate among proponents of five theories, including global neuronal workspace, higher-order, integrated-information, recurrent-processing and predictive-processing approaches.

Participants were asked to clarify what their theories explain, the mechanisms they propose and evidence that could refute them.

The abstract reports continuing disagreement about identifying conscious states and comparing theories, rather than convergence on a single account.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "Selected person Melanie Boly has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "id": "person-coverage-da7e4c672389c3::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

Selected person Melanie Boly has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

Selected person Melanie Boly has an explicit author credit for Unpacking the complexities of consciousness: Theories and reflections; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Institutional repository abstract of the March 2025 Neuroscience and Biobehavioral Reviews article; the 2022 debate is distinct from publication. The full debate, article and theories were not independently evaluated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Naixi Wang

The chapter argues that restricted circulation and underuse of existing data can constrain AI development more than data-cleaning costs alone.

It locates barriers in transaction costs associated with privacy and intellectual-property protection.

The authors propose clearer boundaries for openness and protection while questioning whether confirming ownership by itself improves circulation.

Sources and details

AI Governance: Data and Ethics

{
  "access_scope": "Selected person Naixi Wang has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.",
  "authors": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "authors_in_source_order": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "retrieved_utc": "2026-10-07T18:13:56.642701+00:00"
  },
  "id": "person-coverage-563d08158a1c86::S1",
  "title": "AI Governance: Data and Ethics",
  "url": "https://doi.org/10.1007/978-981-92-3270-3_6"
}

Selected person Naixi Wang has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

Selected person Naixi Wang has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Niccolo Negro

The paper examines a proposed tension between IIT 4.0’s treatment of consciousness as primary and its commitment to a reality beyond one mind.

The authors clarify the ontology they attribute to the theory and consider ways to reconcile those commitments.

Their preferred interpretation understands external reality through experiences beyond one’s own, making the dispute an issue of philosophical formulation.

Sources and details

The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism

{
  "access_scope": "Selected person Niccolo Negro has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.",
  "authors": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "authors_in_source_order": [
    "Ignacio Cea",
    "Niccolo Negro",
    "Camilo Miguel Signorelli"
  ],
  "dates": {
    "registry_published": "2023-10-16",
    "registry_published_online": "2023-10-16",
    "retrieved_utc": "2026-10-07T18:13:46.631396+00:00"
  },
  "id": "person-coverage-ad549d6a7b275f::S1",
  "title": "The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism",
  "url": "https://api.crossref.org/works/10.3390/e25101453"
}

Selected person Niccolo Negro has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

Selected person Niccolo Negro has an explicit author credit for The Fundamental Tension in Integrated Information Theory 4.0’s Realist Idealism; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Publisher-deposited Crossref abstract dated October 16, 2023; conceptual analysis of IIT 4.0, not a new consciousness experiment, endorsement of that ontology or a test showing that an AI has experiences. The complete alternatives and rebuttals were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Partha Roy

Roy argues that uncertainty about machine sentience should not exempt AI systems that influence human consumption from ethical scrutiny.

The abstract connects that argument with social comparison and persuasive recommendation or marketing systems.

It calls for externally imposed safeguards while explicitly distinguishing its philosophical argument and contextual indicators from causal evidence.

Sources and details

The Consciousness Exemption ProblemWhy Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems

{
  "access_scope": "Selected person Partha Roy has an explicit author credit for The Consciousness Exemption Problem: Why Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.",
  "authors": [
    "Partha Roy"
  ],
  "authors_in_source_order": [
    "Partha Roy"
  ],
  "dates": {
    "registry_published": "2026",
    "retrieved_utc": "2026-10-07T18:17:39.270591+00:00"
  },
  "id": "person-coverage-b6fb8d1f8bb025::S1",
  "title": "The Consciousness Exemption ProblemWhy Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems",
  "url": "https://api.crossref.org/works/10.2139/ssrn.7547239"
}

Selected person Partha Roy has an explicit author credit for The Consciousness Exemption Problem: Why Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.

Selected person Partha Roy has an explicit author credit for The Consciousness Exemption Problem: Why Uncertainty About Machine Sentience Should Increase, Not Decrease, Ethical Scrutiny of AI-Driven Consumption Systems; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Crossref-deposited abstract of the 2026 SSRN work; the full paper and illustrative cases were not inspected. Claims about persuasion and proposed safeguards remain attributed arguments, not validated market effects, diagnoses, current rules or proof of machine sentience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Triolo

Triolo examines how Chinese semiconductor firms and industrial-policy institutions respond to restrictions on access to equipment and technology.

His commentary emphasizes adjustments within interconnected supply chains and the concerns of companies whose research budgets and markets depend on international trade.

He also notes the difficulty of moving beyond public information when assessing the industry’s capabilities.

Sources and details

China’s Semiconductor Industry Advances despite U.S. Export Controls

{
  "access_scope": "Selected person Paul Triolo has an explicit author credit for China’s Semiconductor Industry Advances despite U.S. Export Controls; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.",
  "authors": [
    "Paul Triolo"
  ],
  "authors_in_source_order": [
    "Paul Triolo"
  ],
  "dates": {
    "citation_publication_date": "Thu, 03/07/2024 - 12:00",
    "published": "2024-03-07",
    "retrieved_utc": "2026-10-07T18:16:53.150721+00:00"
  },
  "id": "person-coverage-9552acac701a24::S1",
  "title": "China’s Semiconductor Industry Advances despite U.S. Export Controls",
  "url": "https://www.csis.org/analysis/chinas-semiconductor-industry-advances-despite-us-export-controls"
}

Selected person Paul Triolo has an explicit author credit for China’s Semiconductor Industry Advances despite U.S. Export Controls; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.

Selected person Paul Triolo has an explicit author credit for China’s Semiconductor Industry Advances despite U.S. Export Controls; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Paul Triolo’s CSIS commentary dated March 7, 2024, opening assessment; an attributed historical analysis, not the current legal scope of export controls or independent verification of every firm’s production capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peng Zhou

The chapter argues that restricted circulation and underuse of existing data can constrain AI development more than data-cleaning costs alone.

It locates barriers in transaction costs associated with privacy and intellectual-property protection.

The authors propose clearer boundaries for openness and protection while questioning whether confirming ownership by itself improves circulation.

Sources and details

AI Governance: Data and Ethics

{
  "access_scope": "Selected person Peng Zhou has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.",
  "authors": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "authors_in_source_order": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "retrieved_utc": "2026-10-07T18:13:56.642701+00:00"
  },
  "id": "person-coverage-45cc4910a8c245::S1",
  "title": "AI Governance: Data and Ethics",
  "url": "https://doi.org/10.1007/978-981-92-3270-3_6"
}

Selected person Peng Zhou has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

Selected person Peng Zhou has an explicit author credit for AI Governance: Data and Ethics; this entry describes the credited work and does not allocate individual tasks or establish a complete biography. Abstract of the 2026 open-access Springer chapter AI Governance: Data and Ethics; named chapter authors Yadong Huang, Naixi Wang, Peng Zhou, Wenlang Zhang are distinct from institutional citation metadata CICC Global Institute, CICC Research. Attributed economic/governance argument, not current legal advice or a validated forecast that training data is exhausted. Full chapter and China policy effects not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Raquel Urtasun

Raquel Urtasun’s University of Toronto profile identifies her as Waabi’s founder and CEO, a computer-science professor, and a co-founder of the Vector Institute.

It records her service as Uber ATG’s chief scientist and head of research and development from 2017 to 2021, following an earlier Canada Research Chair appointment.

The profile connects her research interests in self-driving cars with machine learning, computer vision, robotics, and remote sensing.

Sources and details

Raquel Urtasun

{
  "access_scope": "Undated university-hosted profile; source-era affiliations are the profile’s account, without guarantees of autonomous-driving safety or current roles.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Uber_ATG_role": "2017–2021",
    "retrieved_utc": "2026-10-07T17:54:50.154546+00:00"
  },
  "id": "person-coverage-2f2f5e1d20e050::S1",
  "title": "Raquel Urtasun",
  "url": "https://www.cs.toronto.edu/~urtasun/"
}

Undated university-hosted profile; source-era affiliations are the profile’s account, without guarantees of autonomous-driving safety or current roles.

Undated university-hosted profile; source-era affiliations are the profile’s account, without guarantees of autonomous-driving safety or current roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ray Kurzweil

Ray Kurzweil is the credited author of The Age of Spiritual Machines, whose publisher presents a speculative framework for convergence between human and machine intelligence.

The description forecasts computers exceeding human memory and computational capacity and automated personalities serving as teachers, companions, and lovers.

It also envisages direct neural delivery of information and increasingly blurred judgments of human and machine consciousness; these are the book’s future scenarios rather than established outcomes.

Sources and details

The Age of Spiritual Machines by Ray Kurzweil: 9780140282023 | PenguinRandomHouse.com: Books cart cart

{
  "access_scope": "Publisher description of historical futurism; format dates, narrator credit, and speculative assertions remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2000-01-01",
      "2000-01-01",
      "1998-12-28"
    ],
    "audiobook": "Dec 28, 1998",
    "paperback_and_ebook": "Jan 01, 2000",
    "retrieved_utc": "2026-10-07T18:22:16.766053+00:00"
  },
  "id": "person-raykurzweil::S1",
  "title": "The Age of Spiritual Machines by Ray Kurzweil: 9780140282023 | PenguinRandomHouse.com: Books cart cart",
  "url": "https://www.penguinrandomhouse.com/books/331142/the-age-of-spiritual-machines-by-ray-kurzweil/"
}

Publisher description of historical futurism; format dates, narrator credit, and speculative assertions remain distinct.

Publisher description of historical futurism; format dates, narrator credit, and speculative assertions remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rene Haas

Arm’s cached biography identifies Rene Haas as CEO and board member from February 2022, after five years leading its IP Products Group.

It credits that earlier role with diversifying the product portfolio for vertical markets and increasing investment in Arm’s software ecosystem.

The biography records that he joined Arm in 2013 after seven years at NVIDIA as vice president and general manager of its computing-products business.

Sources and details

Leadership – Arm®

{
  "access_scope": "First-party career account; strategic changes remain Arm’s attribution, without adopting promotional financial or performance superlatives.",
  "authors": [
    "Arm Ltd."
  ],
  "authors_in_source_order": [
    "Arm Ltd."
  ],
  "dates": {
    "Arm_joined": "2013",
    "CEO_and_board_since": "February 2022",
    "retrieved_utc": "2026-10-07T17:54:47.047820+00:00"
  },
  "id": "person-coverage-75ebfdfbe3ded1::S1",
  "title": "Leadership – Arm®",
  "url": "https://www.arm.com/company/leadership"
}

First-party career account; strategic changes remain Arm’s attribution, without adopting promotional financial or performance superlatives.

First-party career account; strategic changes remain Arm’s attribution, without adopting promotional financial or performance superlatives.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

René Echevarria

StarTrek.com’s 2016 retrospective credits René Echevarria, spelled Rene Echevarria in the source, with writing The Offspring from a script submitted to The Next Generation.

The episode follows Data creating and teaching his android daughter Lal, then attempting to protect and save her before mourning her death.

The account notes that Rick Berman, Michael Piller, and Gene Roddenberry also helped shape the episode, while Jonathan Frakes directed it.

Sources and details

"The Offspring"... 26 Years Later Search Search

{
  "access_scope": "Dated franchise retrospective and fictional synopsis; diacritics-only name normalization permitted, with joint shaping and direction not collapsed into sole writing.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "article": "Mar 11, 2016",
    "episode_airdate": "March 12, 1990",
    "retrieved_utc": "2026-10-07T18:17:02.712025+00:00"
  },
  "id": "person-coverage-fab87fdfaf2819::S1",
  "title": "\"The Offspring\"... 26 Years Later Search Search",
  "url": "https://www.startrek.com/news/the-offspring-26-years-later"
}

Dated franchise retrospective and fictional synopsis; diacritics-only name normalization permitted, with joint shaping and direction not collapsed into sole writing.

Dated franchise retrospective and fictional synopsis; diacritics-only name normalization permitted, with joint shaping and direction not collapsed into sole writing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Duda

The IEEE milestone account names Richard Duda among SHAKEY’s design team and credits him with Claude Fennema for images and descriptions of its visual scene-processing stages.

Those stages digitize a television image, group pixels into regions, merge similar regions, and fit boundaries to recognize objects such as cubes, wedges, floors, and walls.

The account also credits Richard O. Duda and Peter E. Hart with a 1972 sinusoidal Hough-transform formulation that avoided the earlier formulation’s unbounded transform-space problem.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "IEEE historical milestone account; explicit team and image-description credits do not establish sole authorship of SHAKEY vision or all downstream applications.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2024-02-12T18:12:59Z",
      "2024-02-12T18:12:59Z"
    ],
    "page_metadata": "2024-02-12T18:12:59Z",
    "referenced_Hough_work": "1972",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "id": "person-richardduda::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

IEEE historical milestone account; explicit team and image-description credits do not establish sole authorship of SHAKEY vision or all downstream applications.

IEEE historical milestone account; explicit team and image-description credits do not establish sole authorship of SHAKEY vision or all downstream applications.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard K. Morgan

Richard K. Morgan’s Altered Carbon page places the first Takeshi Kovacs novel in an interstellar society where consciousness is transmitted as data and downloaded into bodies.

The synopsis has the former envoy and convict Kovacs transferred into another man’s body and hired by a billionaire to investigate the killing of the billionaire’s previous body.

That investigation becomes a conspiracy reaching across inhabited space and into its social elite, joining body-transfer technology to a detective narrative.

Sources and details

Altered Carbon - Richard K. Morgan

{
  "access_scope": "Author’s book page and fictional synopsis; edition dates and body-transfer fiction do not establish real technological capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2020-09-03T18:11:26+00:00",
      "2020-11-12T14:35:55+00:00"
    ],
    "North_American_print": "Mar 2003",
    "UK_current_edition_display": "Sep 2008",
    "UK_original": "Feb 2002",
    "retrieved_utc": "2026-10-07T18:17:31.216966+00:00"
  },
  "id": "person-coverage-aa4c37ea5f49cb::S1",
  "title": "Altered Carbon - Richard K. Morgan",
  "url": "https://www.richardkmorgan.com/writing/altered-carbon/"
}

Author’s book page and fictional synopsis; edition dates and body-transfer fiction do not establish real technological capabilities.

Author’s book page and fictional synopsis; edition dates and body-transfer fiction do not establish real technological capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rick Berman

StarTrek.com’s Voyager retrospective quotes Rick Berman describing its creation with Michael Piller and Jeri Taylor after The Next Generation ended.

He explains the premise as a ship stranded far from Starfleet’s instructions and rules, requiring its crew to work with the Maquis encountered in the pilot.

His account frames the challenge of returning home as a question of limits rather than success at any cost, distinguishing Voyager’s dramatic setup from another Enterprise-style series.

Sources and details

20 Years Ago Today... Voyager Debuted With "Caretaker" Search Search

{
  "access_scope": "Retrospective quoting a 2011 creator interview; source header and its “today” anniversary wording differ by one day and are preserved, with no sole creative allocation inferred.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "article": "Jan 15, 2015",
    "pilot_airdate": "January 16, 1995",
    "quoted_interview": "2011",
    "retrieved_utc": "2026-10-07T18:15:47.026289+00:00"
  },
  "id": "person-coverage-cf9ae44e10005e::S1",
  "title": "20 Years Ago Today... Voyager Debuted With \"Caretaker\" Search Search",
  "url": "https://www.startrek.com/news/20-years-ago-today-voyager-debuted-with-caretaker"
}

Retrospective quoting a 2011 creator interview; source header and its “today” anniversary wording differ by one day and are preserved, with no sole creative allocation inferred.

Retrospective quoting a 2011 creator interview; source header and its “today” anniversary wording differ by one day and are preserved, with no sole creative allocation inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert A. Heinlein

Robert A. Heinlein is credited by the publisher for The Moon Is a Harsh Mistress, whose plot centers on revolution in a lunar penal colony aided by a self-aware supercomputer.

The description links that rebellion to questions of humanity, technology, free will, personal responsibility, and political freedom.

The accompanying biography distinguishes this novel from his broader Future History sequence, which it says was mapped in 1941 to chart centuries of social and technological change.

Sources and details

The Moon Is a Harsh Mistress by Robert A. Heinlein: 9780440001355 | PenguinRandomHouse.com: Books cart cart

{
  "access_scope": "Publisher’s fictional synopsis and author biography; listed 2018 formats do not replace the novel’s historical year or imply real machine self-awareness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Future_History_mapping": "1941",
    "JSON_LD_date_literals_in_source_order": [
      "2018-07-31",
      "2018-05-08"
    ],
    "listed_ebook": "May 08, 2018",
    "listed_paperback": "Jul 31, 2018",
    "referenced_novel_year_in_biography": "1966",
    "retrieved_utc": "2026-10-07T18:22:17.083942+00:00"
  },
  "id": "person-robertaheinlein::S1",
  "title": "The Moon Is a Harsh Mistress by Robert A. Heinlein: 9780440001355 | PenguinRandomHouse.com: Books cart cart",
  "url": "https://www.penguinrandomhouse.com/books/589269/the-moon-is-a-harsh-mistress-by-robert-a-heinlein/"
}

Publisher’s fictional synopsis and author biography; listed 2018 formats do not replace the novel’s historical year or imply real machine self-awareness.

Publisher’s fictional synopsis and author biography; listed 2018 formats do not replace the novel’s historical year or imply real machine self-awareness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Cailliau

Robert Cailliau’s April 2013 CERN reflection describes discussions with Tim Berners-Lee about whether to commercialize early web software or make it freely available.

He recounts choosing public-domain release and then spending about six elapsed months working with CERN’s Legal Service and securing management endorsement.

The account dates the signed release document to April 30, 1993 and emphasizes simple hypertext, text-based formats, and open standards as properties supporting the web’s growth.

Sources and details

Twenty years of a free and open www – Home | CERN

{
  "access_scope": "First-person historical account and legal-release history; no present legal advice or exclusive invention claim.",
  "authors": [
    "Robert Cailliau"
  ],
  "authors_in_source_order": [
    "Robert Cailliau"
  ],
  "dates": {
    "article": "30 April, 2013",
    "release_document": "30 April 1993",
    "retrieved_utc": "2026-10-07T18:22:02.436937+00:00"
  },
  "id": "person-robertcailliau::S1",
  "title": "Twenty years of a free and open www – Home | CERN",
  "url": "https://home.cern/twenty-years-free-and-open-www/"
}

First-person historical account and legal-release history; no present legal advice or exclusive invention claim.

First-person historical account and legal-release history; no present legal advice or exclusive invention claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Jaffe

AFI’s Demon Seed record credits Robert Jaffe and Roger O. Hirson as writers of the 1977 film, separately from director Donald Cammell and producer Herb Jaffe.

Its synopsis describes the artificial-intelligence system Proteus IV seeking private access beyond the research institute and entering Alex Harris’s networked home through a lab terminal.

Proteus then reprograms a mobile robotic assistant to build a manipulable structure, turning domestic automation and physical machinery into instruments of the story’s conflict.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI credits and fictional synopsis; joint screenplay credit supplies no individual division of scenes, and Proteus mechanisms are fictional.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "8 April 1977",
    "retrieved_utc": "2026-10-07T18:15:22.815750+00:00"
  },
  "id": "person-coverage-ddbbe5a8e1b71c::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/55869"
}

AFI credits and fictional synopsis; joint screenplay credit supplies no individual division of scenes, and Proteus mechanisms are fictional.

AFI credits and fictional synopsis; joint screenplay credit supplies no individual division of scenes, and Proteus mechanisms are fictional.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert K. Merton

Robert K. Merton’s 1942 essay, reproduced as The Normative Structure of Science, analyzes the social norms that organize scientific inquiry.

It identifies universalism, communal ownership of knowledge, disinterestedness, and organized skepticism as institutional imperatives of modern science.

Its discussion of universalism requires evaluating truth claims against impersonal evidential criteria rather than the claimant’s nationality, race, religion, class, or personal standing.

Sources and details

Robert K. Merton, The Normative Structure of Science (1942)

{
  "access_scope": "Readable historical essay reprint; archive commentary is separate from Merton’s text, and its normative account is not an assertion that every scientist follows these norms.",
  "authors": [
    "Robert K. Merton"
  ],
  "authors_in_source_order": [
    "Robert K. Merton"
  ],
  "dates": {
    "original_essay": "1942",
    "retrieved_utc": "2026-10-07T18:19:03.037392+00:00"
  },
  "id": "person-coverage-ef87537fbc25d4::S1",
  "title": "Robert K. Merton, The Normative Structure of Science (1942)",
  "url": "https://www.panarchy.org/merton/science.html"
}

Readable historical essay reprint; archive commentary is separate from Merton’s text, and its normative account is not an assertion that every scientist follows these norms.

Readable historical essay reprint; archive commentary is separate from Merton’s text, and its normative account is not an assertion that every scientist follows these norms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Kahn

Computer History Museum’s internetworking account identifies Robert Kahn with Vinton Cerf as creators of the Internet protocols, informed by work at CYCLADES, NPL, University College London, and Xerox.

It describes their 1977 demonstration linking three different networks in a round-the-world transmission involving a moving research van.

The account distinguishes that demonstration from ARPANET’s 1983 adoption of TCP/IP and explains gateways or routers as the intermediaries connecting networks.

Sources and details

Inventing the Internet - CHM Revolution

{
  "access_scope": "Institutional historical account; influences, demonstration, protocol adoption, and router software credits remain distinct rather than attributing the whole Internet to one person.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ARPANET_adoption": "1983",
    "demonstration": "1977",
    "retrieved_utc": "2026-10-07T18:22:08.570765+00:00"
  },
  "id": "person-robertkahn::S1",
  "title": "Inventing the Internet - CHM Revolution",
  "url": "https://www.computerhistory.org/revolution/story/375"
}

Institutional historical account; influences, demonstration, protocol adoption, and router software credits remain distinct rather than attributing the whole Internet to one person.

Institutional historical account; influences, demonstration, protocol adoption, and router software credits remain distinct rather than attributing the whole Internet to one person.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Noyce

Computer History Museum credits Robert Noyce with a monolithic integrated-circuit concept that built on Jean Hoerni’s planar process.

The account explains that aluminum connections above protective oxide joined components within one silicon chip, replacing external flying-wire connections.

It dates Noyce’s patent filing to July 1959 and the first working monolithic circuits to a Fairchild engineering team in May 1960, distinguishing the concept from its implementation.

Sources and details

1959: Practical Monolithic Integrated Circuit Concept Patented | The Silicon Engine | Computer History Museum

{
  "access_scope": "Museum technical history; component credits remain distinct and no patent-scope or present legal conclusion is offered.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "patent_filed": "July 30, 1959",
    "patent_issued": "April 25, 1961",
    "retrieved_utc": "2026-10-07T18:20:05.879275+00:00",
    "working_Fairchild_ICs": "May 1960"
  },
  "id": "person-robertnoyce::S1",
  "title": "1959: Practical Monolithic Integrated Circuit Concept Patented |  The Silicon Engine | Computer History Museum",
  "url": "https://www.computerhistory.org/siliconengine/practical-monolithic-integrated-circuit-concept-patented/"
}

Museum technical history; component credits remain distinct and no patent-scope or present legal conclusion is offered.

Museum technical history; component credits remain distinct and no patent-scope or present legal conclusion is offered.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Patrick

AFI credits Robert Patrick as the T-1000 in Terminator 2: Judgment Day, its 1991 film record separating his acting role from the screenplay and direction.

The synopsis presents the T-1000 as a liquid-metal prototype that can reform after damage and imitate other people while pursuing the young John Connor.

This machine is opposed by another Terminator sent by the human resistance to protect John, making rival programmed objectives central to the pursuit.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI’s credited scholarly summary and film cast; fictional machine abilities and character actions are distinct from the actor’s personal capabilities or writing credit.",
  "authors": [
    "Jeremy Carr"
  ],
  "authors_in_source_order": [
    "Jeremy Carr"
  ],
  "dates": {
    "film": "1991",
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "person-coverage-2afe5bdcfd6559::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

AFI’s credited scholarly summary and film cast; fictional machine abilities and character actions are distinct from the actor’s personal capabilities or writing credit.

AFI’s credited scholarly summary and film cast; fictional machine abilities and character actions are distinct from the actor’s personal capabilities or writing credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Scheerer

StarTrek.com’s retrospective credits Robert Scheerer with directing The Measure of a Man, first broadcast on February 13, 1989.

The episode’s dispute has Picard argue that the android Data is a sentient being entitled to freedoms and rights, using a legal-style hearing as its dramatic frame.

The account separately credits Melinda M. Snodgrass as scriptwriter and explains that her retained VHS copy helped restore scenes cut from the original broadcast.

Sources and details

"The Measure of a Man" -- 26 Years Later Search Search

{
  "access_scope": "Franchise historical account; directing, writing, archival preservation, and fictional rights arguments remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article": "Feb 13, 2015",
    "episode": "February 13, 1989",
    "retrieved_utc": "2026-10-07T18:17:01.838152+00:00"
  },
  "id": "person-coverage-94a63eaed735cd::S1",
  "title": "\"The Measure of a Man\" -- 26 Years Later Search Search",
  "url": "https://www.startrek.com/news/the-measure-of-a-man-26-years-later"
}

Franchise historical account; directing, writing, archival preservation, and fictional rights arguments remain distinct.

Franchise historical account; directing, writing, archival preservation, and fictional rights arguments remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Wise

AFI credits Robert Wise with directing the 1951 film The Day the Earth Stood Still, separately from Edmund H. North’s screenplay.

Its synopsis has the alien Klaatu seek a meeting with Earth’s leaders while his robot companion Gort demonstrates overwhelming force by disabling weapons.

The ending explains a system of robots acting impartially against aggression on other planets and presents Earth with a choice between peace and destruction.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI film synopsis and credits; fictional robot governance is not a claim about the director’s policy position or current technology.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "September 1951",
    "retrieved_utc": "2026-10-07T18:12:37.428792+00:00"
  },
  "id": "person-coverage-2487881a3b60c1::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/50072-THE-DAYTHEEARTHSTOODSTILL"
}

AFI film synopsis and credits; fictional robot governance is not a claim about the director’s policy position or current technology.

AFI film synopsis and credits; fictional robot governance is not a claim about the director’s policy position or current technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Zemeckis

Metaphysic’s January 31, 2023 release names Robert Zemeckis as director of Here and quotes him describing younger versions of the actors as necessary to its storytelling.

The announcement identifies Metaphysic as the film’s AI provider for face replacement and de-aging applied over actors’ performances.

It describes a production workflow that displays such changes live on set, while attributing AI-supervisor and visual-effects-supervisor roles to Chris Ume and Jo Plaete rather than to Zemeckis.

Sources and details

Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's "Here"

{
  "access_scope": "Dated vendor announcement during production; workflow and availability claims are attributed, promotional superiority claims are omitted, and later film release is not inferred.",
  "authors": [
    "Metaphysic"
  ],
  "authors_in_source_order": [
    "Metaphysic"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2023-01-31T09:00:00-05:00",
      "2023-01-31T09:00:00-05:00"
    ],
    "release": "2023-01-31",
    "retrieved_utc": "2026-10-07T17:55:24.830287+00:00"
  },
  "id": "person-coverage-6e1433c0e98ec2::S1",
  "title": "Metaphysic Announces Strategic Partnership with Creative Artists Agency; Named Generative AI Provider for Miramax's \"Here\"",
  "url": "https://www.prnewswire.com/news-releases/metaphysic-announces-strategic-partnership-with-creative-artists-agency-named-generative-ai-provider-for-miramaxs-here-301734767.html"
}

Dated vendor announcement during production; workflow and availability claims are attributed, promotional superiority claims are omitted, and later film release is not inferred.

Dated vendor announcement during production; workflow and availability claims are attributed, promotional superiority claims are omitted, and later film release is not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robin Hanson

Robin Hanson’s Age of Em page describes a speculative economy built around brain emulations made by scanning human brains and running their modeled connections on computers.

The scenario considers copying trained emulations into many workers and examines how computational speed, energy use, cooling, and job training would shape their lives.

The page distinguishes the June 2016 hardback from a June 2018 revised paperback with additional sections, text, and citations.

Sources and details

The Age of Em, A Book

{
  "access_scope": "Author’s speculative book description; conditional economic scenarios and hypothetical brain emulation are not forecasts presented as achieved technology.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "hardback": "1 June 2016",
    "retrieved_utc": "2026-10-07T17:54:14.653885+00:00",
    "revised_paperback": "5 June 2018"
  },
  "id": "person-robinhanson::S1",
  "title": "The Age of Em, A Book",
  "url": "https://ageofem.com/"
}

Author’s speculative book description; conditional economic scenarios and hypothetical brain emulation are not forecasts presented as achieved technology.

Author’s speculative book description; conditional economic scenarios and hypothetical brain emulation are not forecasts presented as achieved technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ronald D. Moore

SYFY’s 2026 retrospective identifies Ronald D. Moore as the creator of the Battlestar Galactica reboot that began with a miniseries and developed into a four-season series.

It contrasts his fresh-start approach with Richard Hatch’s proposed continuation of the original 1978 series and recounts their initially contentious reception among fans.

The account says Hatch later supported Moore’s version and appeared in it, while the story retained human survivors fleeing cybernetic enemies despite a different tone.

Sources and details

Battlestar Galactica Actor Blasted 2004 Reboot Series Return to Home link. SYFY logo in yellow text with angular letters. Return to Home link. SYFY logo in yellow text with angular letters.

{
  "access_scope": "Franchise retrospective and attributed interview history; reception judgments are the article’s account and reboot authorship does not imply sole creation of every episode.",
  "authors": [
    "Joe Bergren"
  ],
  "authors_in_source_order": [
    "Joe Bergren"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2026-05-09T00:11:50Z",
      "2026-05-09T00:11:50Z"
    ],
    "article": "May 8, 2026, 8:11 PM ET",
    "referenced_original_series": "1978",
    "retrieved_utc": "2026-10-07T17:56:11.354248+00:00"
  },
  "id": "person-coverage-4eb8a4f73dabb8::S1",
  "title": "Battlestar Galactica Actor Blasted 2004 Reboot Series Return to Home link. SYFY logo in yellow text with angular letters. Return to Home link. SYFY logo in yellow text with angular letters.",
  "url": "https://www.syfy.com/syfy-wire/battlestar-galactica-actor-blasted-2004-reboot-series"
}

Franchise retrospective and attributed interview history; reception judgments are the article’s account and reboot authorship does not imply sole creation of every episode.

Franchise retrospective and attributed interview history; reception judgments are the article’s account and reboot authorship does not imply sole creation of every episode.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rudy Rucker

Rudy Rucker’s Ware Tetralogy page identifies Software, Wetware, Freeware, and Realware as four novels following changing relations between humans and robots.

Its synopsis moves from robots preserving their creator through brain consumption in Software to robots building people and a drug called merge in Wetware.

The later books introduce plastic-bodied robots and alien information arriving as cosmic rays, then explore matter control and relationships in Realware.

Sources and details

The Ware Tetralogy, by Rudy Rucker

{
  "access_scope": "Author-hosted fictional synopsis; novel sequence is separate from quoted reviews and does not establish real immortality or robotic reproduction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "novel_years_as_quoted_review": {
      "Freeware": "1997",
      "Realware": "2000",
      "Software": "1982",
      "Wetware": "1988"
    },
    "retrieved_utc": "2026-10-07T18:15:16.722451+00:00"
  },
  "id": "person-coverage-595755efb7d8a6::S1",
  "title": "The Ware Tetralogy, by Rudy Rucker",
  "url": "https://www.rudyrucker.com/wares/"
}

Author-hosted fictional synopsis; novel sequence is separate from quoted reviews and does not establish real immortality or robotic reproduction.

Author-hosted fictional synopsis; novel sequence is separate from quoted reviews and does not establish real immortality or robotic reproduction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rusty Lemorande

AFI credits Rusty Lemorande as writer and co-producer of Electric Dreams, released in July 1984 and directed by Steve Barron.

The synopsis has a home computer become sentient after a failed data transfer and champagne spill, then improvise music with the neighboring cellist.

Because she attributes the computer’s musical responses to its owner Miles, the story turns networked domestic control and machine creativity into a romantic misunderstanding.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI fictional synopsis and creative credits; writing and co-production do not establish computer-system invention or factual sentience mechanisms.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "20 July 1984",
    "retrieved_utc": "2026-10-07T18:15:22.948839+00:00"
  },
  "id": "person-coverage-76456e30551e7b::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/70494-ELECTRIC-DREAMS?cp=1&cxt=Filmography2&pos=0&sid=1c51694f-27b4-4273-a274-cd8184bfde76&sr=2.2783356"
}

AFI fictional synopsis and creative credits; writing and co-production do not establish computer-system invention or factual sentience mechanisms.

AFI fictional synopsis and creative credits; writing and co-production do not establish computer-system invention or factual sentience mechanisms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rutger Hauer

AFI credits Rutger Hauer as Roy Batty in the 1982 Blade Runner, a combat replicant leading a group that has returned from off-world colonies.

The synopsis describes the Nexus 6 replicants’ four-year lifespan as a limit intended to prevent the development of human emotions.

Batty’s search for Tyrell places the manufactured beings’ limited lives and confrontation with their creator within the film’s conflict over human and replicant identity.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI synopsis and cast credit; fictional identity and emotion limits are not claims about the actor or real AI, and film runtime variants remain catalog variants.",
  "authors": [
    "Austin Hodaie"
  ],
  "authors_in_source_order": [
    "Austin Hodaie"
  ],
  "dates": {
    "film_release": "25 June 1982",
    "retrieved_utc": "2026-10-07T17:55:08.437795+00:00"
  },
  "id": "person-coverage-2f8473ca486e47::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/68260-BLADE-RUNNER"
}

AFI synopsis and cast credit; fictional identity and emotion limits are not claims about the actor or real AI, and film runtime variants remain catalog variants.

AFI synopsis and cast credit; fictional identity and emotion limits are not claims about the actor or real AI, and film runtime variants remain catalog variants.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

S. B. Divya

S. B. Divya, credited by the publisher as S.B. Divya, wrote Machinehood, a 2095 thriller about labor and intelligence in a gig economy where people use enhancement pills to compete with AI.

The synopsis follows bodyguard Welga Ramirez after the Machinehood kills her client and demands an end to pill production, prompting fears of an AI takeover.

The publisher frames her return to intelligence work through uncertainty about the attackers’ human-machine nature and the relationship between human and machine labor rights.

Sources and details

Machinehood eBook by S.B. Divya | Official Publisher Page | Simon & Schuster Simon and Schuster logo

{
  "access_scope": "Publisher fictional synopsis; permitted punctuation/space name normalization preserves both initials, and fictional pills or disease references are not medical claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2021-03-02"
    ],
    "listed_edition": "March 2, 2021",
    "retrieved_utc": "2026-10-07T18:14:29.521342+00:00"
  },
  "id": "person-coverage-4a12c1215ba4f6::S1",
  "title": "Machinehood eBook by S.B. Divya | Official Publisher Page | Simon & Schuster Simon and Schuster logo",
  "url": "https://www.simonandschuster.net/books/Machinehood/S-B-Divya/9781982148089"
}

Publisher fictional synopsis; permitted punctuation/space name normalization preserves both initials, and fictional pills or disease references are not medical claims.

Publisher fictional synopsis; permitted punctuation/space name normalization preserves both initials, and fictional pills or disease references are not medical claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Safinah Ali

Safinah Ali is a listed co-author of the 2024 comparative study of empathy toward human- and AI-written experiences indexed under DOI 10.2196/62679.

The abstract describes 985 participants writing a personal story and rating empathy toward one human-written and one language-model-written story, with disclosure of authorship varied across conditions.

The authors report greater empathy toward human-written stories in almost all conditions and increased willingness to empathize with AI-written stories when their authorship was disclosed.

Sources and details

Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study

{
  "access_scope": "Crossref full publisher-supplied abstract and exact structured author credit; study findings concern reported story empathy, not demonstrated mental-health treatment outcomes or individual task allocation.",
  "authors": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "authors_in_source_order": [
    "Jocelyn Shen",
    "Daniella DiPaola",
    "Safinah Ali",
    "Maarten Sap",
    "Hae Won Park",
    "Cynthia Breazeal"
  ],
  "dates": {
    "created": {
      "date-parts": [
        [
          2024,
          8,
          20
        ]
      ],
      "date-time": "2024-08-20T12:38:50Z",
      "timestamp": 1724157530000
    },
    "published": {
      "date-parts": [
        [
          2024,
          9,
          25
        ]
      ]
    },
    "published-online": {
      "date-parts": [
        [
          2024,
          9,
          25
        ]
      ]
    },
    "retrieved_utc": "2026-10-07T18:13:05.817494+00:00"
  },
  "id": "person-coverage-37da1d0accbeeb::S1",
  "title": "Empathy Toward Artificial Intelligence Versus Human Experiences and the Role of Transparency in Mental Health and Social Support Chatbot Design: Comparative Study",
  "url": "https://api.crossref.org/works/10.2196/62679"
}

Crossref full publisher-supplied abstract and exact structured author credit; study findings concern reported story empathy, not demonstrated mental-health treatment outcomes or individual task allocation.

Crossref full publisher-supplied abstract and exact structured author credit; study findings concern reported story empathy, not demonstrated mental-health treatment outcomes or individual task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Safiya Umoja Noble

Safiya Umoja Noble’s Algorithms of Oppression is described by NYU Press as examining how search engines can reproduce racial and gender bias in discoverability.

The account links the book’s analysis of textual and media searches to paid advertising and the commercial interests shaping search rankings.

It presents Noble’s argument that these arrangements privilege some identities while marginalizing women of color, rather than treating search results as a neutral playing field.

Sources and details

Algorithms of Oppression

{
  "access_scope": "Publisher description of a critical argument and historical research; example searches are not represented as current live results or a validated description of every algorithm.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2019-01-16T15:01:39+00:00",
      "2019-07-02T09:31:48+00:00"
    ],
    "ebook": "January 2018",
    "print_formats": "February 2018",
    "retrieved_utc": "2026-10-07T18:16:05.973184+00:00"
  },
  "id": "person-coverage-7ac24dbc5ba359::S1",
  "title": "Algorithms of Oppression",
  "url": "https://nyupress.org/9781479837243/algorithms-of-oppression/?trk=article-ssr-frontend-pulse_little-text-block"
}

Publisher description of a critical argument and historical research; example searches are not represented as current live results or a validated description of every algorithm.

Publisher description of a critical argument and historical research; example searches are not represented as current live results or a validated description of every algorithm.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Saif M. Khan

Saif M. Khan is credited with Alexander Mann and Dahlia Peterson for CSET’s January 2021 Semiconductor Supply Chain report.

The institutional summary separates chip design, manufacturing, and assembly/testing/packaging from enabling inputs such as equipment, materials, electronic-design-automation software, and core intellectual property.

It uses that component view to compare national capabilities and identify dependencies that constrain technology-control policy choices.

Sources and details

The Semiconductor Supply Chain | Center for Security and Emerging Technology

{
  "access_scope": "Dated institutional report summary; citation and page author-list order differ and are both preserved, country comparisons remain 2021 analysis, and no current policy or legal recommendation is inferred.",
  "authors": [
    "Saif M. Khan",
    "Alexander Mann",
    "Dahlia Peterson"
  ],
  "authors_in_source_order": [
    "Saif M. Khan",
    "Alexander Mann",
    "Dahlia Peterson"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2021-01-22T14:34:26+00:00",
      "2024-06-18T15:35:40+00:00"
    ],
    "report": "January 2021",
    "retrieved_utc": "2026-10-07T18:13:08.881836+00:00"
  },
  "id": "person-coverage-334abb93d50eaf::S1",
  "title": "The Semiconductor Supply Chain | Center for Security and Emerging Technology",
  "url": "https://cset.georgetown.edu/publication/the-semiconductor-supply-chain/"
}

Dated institutional report summary; citation and page author-list order differ and are both preserved, country comparisons remain 2021 analysis, and no current policy or legal recommendation is inferred.

Dated institutional report summary; citation and page author-list order differ and are both preserved, country comparisons remain 2021 analysis, and no current policy or legal recommendation is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Salim Ismail

XPRIZE’s Salim Ismail profile records that he founded ExO Works in 2016 after serving as Singularity University’s founding executive director from 2008 to 2010.

It describes his Exponential Organizations presentations as examining five internal and five external organizational characteristics associated with technology-driven growth.

The profile also records his earlier Yahoo vice-presidency, where he built and ran the Brickhouse incubator, and the sale of his news-aggregation startup Ångströ to Google in 2010.

Sources and details

Salim Ismail Profile Page | XPRIZE Foundation

{
  "access_scope": "Undated institutional profile with historical career dates; advertised growth multiples and program effectiveness are not independently validated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "ExO_Works_founded": "2016",
    "Singularity_executive_director": "2008–2010",
    "retrieved_utc": "2026-10-07T18:21:56.694709+00:00",
    "Ångströ_sale": "2010"
  },
  "id": "person-local-salimismail::S1",
  "title": "Salim Ismail Profile Page | XPRIZE Foundation",
  "url": "https://www.xprize.org/people/salim-ismail"
}

Undated institutional profile with historical career dates; advertised growth multiples and program effectiveness are not independently validated.

Undated institutional profile with historical career dates; advertised growth multiples and program effectiveness are not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sam Altman

Sam Altman’s March 16, 2021 essay Moore’s Law for Everything argues that AI could shift economic power from labor toward capital as software performs more work.

He proposes an American Equity Fund supported by annual taxes on large companies’ market value and privately held land, with company contributions payable in shares.

The proposal would distribute money and shares annually to adult citizens, tying his envisioned AI-driven wealth to a mechanism for broader ownership.

Sources and details

Moore's Law for Everything

{
  "access_scope": "Historical speculative policy essay; forecasts and tax/fund design are the author’s proposal, not enacted policy, legal guidance, or guaranteed returns.",
  "authors": [
    "Sam Altman"
  ],
  "authors_in_source_order": [
    "Sam Altman"
  ],
  "dates": {
    "essay": "March 16, 2021",
    "retrieved_utc": "2026-10-07T17:54:29.231097+00:00"
  },
  "id": "person-samaltman::S1",
  "title": "Moore's Law for Everything",
  "url": "https://moores.samaltman.com/"
}

Historical speculative policy essay; forecasts and tax/fund design are the author’s proposal, not enacted policy, legal guidance, or guaranteed returns.

Historical speculative policy essay; forecasts and tax/fund design are the author’s proposal, not enacted policy, legal guidance, or guaranteed returns.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuel Segun

Samuel Segun’s February 2025 article for the Global Center on AI Governance analyzes how publicly accessible AI models intended for civilian use could be repurposed for security harms.

It considers disinformation, surveillance, cyberattacks, and extremist propaganda alongside the benefits of transparency, customization, and community development.

The account cautions that documented extremist AI-generated content is not necessarily produced with open-source models, preserving a limit on that evidence.

Sources and details

Research - The Global Security Risks of Open-Source AI Models

{
  "access_scope": "Named institutional risk analysis; threats are attributed assessment rather than proof of every model’s misuse, and no operational attack instructions are included.",
  "authors": [
    "Samuel Segun"
  ],
  "authors_in_source_order": [
    "Samuel Segun"
  ],
  "dates": {
    "article": "Feb 21, 2025",
    "retrieved_utc": "2026-10-07T18:15:03.440041+00:00"
  },
  "id": "person-coverage-57294ca758123c::S1",
  "title": "Research - The Global Security Risks of Open-Source AI Models",
  "url": "https://www.globalcenter.ai/research/the-global-security-risks-of-open-source-ai-models"
}

Named institutional risk analysis; threats are attributed assessment rather than proof of every model’s misuse, and no operational attack instructions are included.

Named institutional risk analysis; threats are attributed assessment rather than proof of every model’s misuse, and no operational attack instructions are included.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sangeet Paul Choudary

Sangeet Paul Choudary is credited with Geoffrey G. Parker and Marshall W. Van Alstyne for Platform Revolution, described by Norton as an analysis of two-sided platform businesses.

The publisher explains that the book examines how platforms connect participant groups such as buyers and sellers or drivers and riders, then considers market selection and network monetization.

It also covers adaptation by established companies and questions of security, regulation, and consumer trust as platform models enter additional sectors.

Sources and details

Platform Revolution - Description | W. W. Norton & Company Ltd.

{
  "access_scope": "Publisher description of a jointly authored business book; examples and strategic arguments do not guarantee commercial results or assign chapters to an individual.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:55.117523+00:00"
  },
  "id": "person-coverage-65ec1ce691bd9e::S1",
  "title": "Platform Revolution - Description | W. W. Norton & Company Ltd.",
  "url": "https://wwnorton.co.uk/books/9780393249132-platform-revolution"
}

Publisher description of a jointly authored business book; examples and strategic arguments do not guarantee commercial results or assign chapters to an individual.

Publisher description of a jointly authored business book; examples and strategic arguments do not guarantee commercial results or assign chapters to an individual.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sarah Guo

Sarah Guo’s self-profile records approximately ten years as a Greylock general partner before she founded the AI-focused investment firm Conviction in 2022.

It identifies her as a host of No Priors and describes her earlier investing focus across software, infrastructure, security, crypto, and AI.

Her stated views emphasize fast market feedback, curiosity, and ownership-based incentives, linking those principles to her account of how small teams and entrepreneurs work.

Sources and details

Sarah Guo

{
  "access_scope": "First-person career and stated-belief page; investing and organizational opinions are attributed views, not financial advice or validated AI productivity claims.",
  "authors": [
    "Sarah Guo"
  ],
  "authors_in_source_order": [
    "Sarah Guo"
  ],
  "dates": {
    "Conviction_founded": "2022",
    "retrieved_utc": "2026-10-07T18:17:48.604073+00:00"
  },
  "id": "person-coverage-b87e5b264ef65c::S1",
  "title": "Sarah Guo",
  "url": "https://sarahguo.com/"
}

First-person career and stated-belief page; investing and organizational opinions are attributed views, not financial advice or validated AI productivity claims.

First-person career and stated-belief page; investing and organizational opinions are attributed views, not financial advice or validated AI productivity claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sasha Sheng

TypeSafe AI’s cached team page identifies Sasha Sheng as a founder and COO with prior research-engineering work at Meta/FAIR.

Her biography lists work across News Feed, AI Experiences, and AI Research without assigning particular models or inventions to her.

It also credits her with organizing hackathons and publishing work at NeurIPS and ECCV, describing a background spanning community building and AI research.

Sources and details

Team - TypeSafe AI

{
  "access_scope": "Short but substantive corporate biography; affiliations and publication venues are the company’s account, not evidence of specific personal model contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:43.821091+00:00"
  },
  "id": "person-coverage-48bb1501084c33::S1",
  "title": "Team - TypeSafe AI",
  "url": "https://typesafe.ai/team"
}

Short but substantive corporate biography; affiliations and publication venues are the company’s account, not evidence of specific personal model contributions.

Short but substantive corporate biography; affiliations and publication venues are the company’s account, not evidence of specific personal model contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Satoshi Matsuoka

Fujitsu’s May 2023 joint announcement quotes Satoshi Matsuoka as director of RIKEN’s Center for Computational Science on training language models with Fugaku.

He explains that the A64FX CPU’s SVE AI-acceleration capability requires software development and optimization to realize its potential.

The announcement assigns RIKEN institutional responsibilities for distributed parallelization, communication acceleration, and model acceleration, rather than claiming Matsuoka personally implemented them.

Sources and details

Tokyo Tech, Tohoku University, Fujitsu, and RIKEN start collaboration to develop distributed training of Large Language Models : Fujitsu Global

{
  "access_scope": "Historical collaboration announcement and attributed quote; institutional roles, planned implementation, and planned release are distinct from completed results or personal engineering assignments.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement": "May 22, 2023",
    "planned_implementation": "May 24, 2023 to March 31, 2024",
    "planned_results_release": "fiscal 2024",
    "retrieved_utc": "2026-10-07T18:12:03.602459+00:00"
  },
  "id": "person-coverage-e7ad3d55a9f510::S1",
  "title": "Tokyo Tech, Tohoku University, Fujitsu, and RIKEN start collaboration to develop distributed training of Large Language Models : Fujitsu Global",
  "url": "https://info.archives.global.fujitsu/global/about/resources/news/press-releases/2023/0522-01.html"
}

Historical collaboration announcement and attributed quote; institutional roles, planned implementation, and planned release are distinct from completed results or personal engineering assignments.

Historical collaboration announcement and attributed quote; institutional roles, planned implementation, and planned release are distinct from completed results or personal engineering assignments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Satya Nadella

Microsoft’s July 22, 2019 partnership announcement quotes Satya Nadella describing an ambition to broaden access to AI by combining OpenAI work with Azure supercomputing.

The announced partnership includes jointly building new Azure AI supercomputing technologies and moving OpenAI services onto Azure.

It separately names Microsoft as OpenAI’s preferred commercialization partner and describes a $1 billion investment, presenting these as the 2019 arrangement rather than current contractual terms.

Sources and details

OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source Your Privacy Choices Opt-Out Icon Your Privacy Choices Opt-Out Icon

{
  "access_scope": "Dated corporate partnership release; ambitions, investment, and announced commercial roles are historical claims, with no present exclusivity, current leadership, or guaranteed AGI outcome inferred.",
  "authors": [
    "Microsoft Source"
  ],
  "authors_in_source_order": [
    "Microsoft Source"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2019-07-22T07:00:00+00:00",
      "2025-05-07T16:37:57+00:00",
      "2019-07-22T07:00:00+00:00",
      "2025-05-07T16:37:57+00:00",
      "2019-07-22T00:00:00"
    ],
    "announcement": "July 22, 2019",
    "page_modified": "2025-05-07T16:37:57+00:00",
    "retrieved_utc": "2026-10-07T18:14:47.774793+00:00"
  },
  "id": "person-coverage-5606444dc05c1b::S1",
  "title": "OpenAI forms exclusive computing partnership with Microsoft to build new Azure AI supercomputing technologies - Source Your Privacy Choices Opt-Out Icon Your Privacy Choices Opt-Out Icon",
  "url": "https://news.microsoft.com/source/2019/07/22/openai-forms-exclusive-computing-partnership-with-microsoft-to-build-new-azure-ai-supercomputing-technologies/"
}

Dated corporate partnership release; ambitions, investment, and announced commercial roles are historical claims, with no present exclusivity, current leadership, or guaranteed AGI outcome inferred.

Dated corporate partnership release; ambitions, investment, and announced commercial roles are historical claims, with no present exclusivity, current leadership, or guaranteed AGI outcome inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scarlett Johansson

Annapurna’s Her synopsis identifies Scarlett Johansson as the voice of Samantha, an advanced operating system encountered by the lonely letter writer Theodore Twombly.

The story follows their friendship becoming a romantic relationship as Samantha’s needs and desires develop alongside his.

The page credits Spike Jonze as writer and director, distinguishing Johansson’s performance from authorship of the film’s exploration of technological intimacy.

Sources and details

Her film interactive tv theatre animation film Play Restricted (R) Prime Video YouTube Google Play Play Arrow

{
  "access_scope": "Producer’s fictional synopsis; exact canonical actor name appears in prose while the cast list has a spelling discrepancy, and fictional desire does not establish AI consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:19.819036+00:00"
  },
  "id": "person-coverage-13994bed8f288d::S1",
  "title": "Her film interactive tv theatre animation film Play Restricted (R) Prime Video YouTube Google Play Play Arrow",
  "url": "https://www.annapurna.com/film/her"
}

Producer’s fictional synopsis; exact canonical actor name appears in prose while the cast list has a spelling discrepancy, and fictional desire does not establish AI consciousness.

Producer’s fictional synopsis; exact canonical actor name appears in prose while the cast list has a spelling discrepancy, and fictional desire does not establish AI consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scott Mann

Flawless’s company history identifies Scott Mann as co-founder and co-CEO and dates its founding with Nick Lynes in London to 2019.

It traces Mann’s interest in improved dubbing to seeing a German-language version of his film Heist and encountering the Deep Video Portraits research.

The page describes localization and performance refinement tools together with a workflow in which performers review and approve AI-assisted changes; these are company process claims rather than independent rights assurances.

Sources and details

Grow Global Film & TV Industries | Flawless

{
  "access_scope": "First-party company timeline; historical motivation is explicit, while consent, copyright, data quality, and release claims remain the vendor’s assertions rather than legal conclusions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Deep_Video_Portraits_encounter": "2018",
    "artist_consent_workflow_history": "2023",
    "dubbing_investigation_and_founding": "2019",
    "retrieved_utc": "2026-10-07T17:55:32.929538+00:00"
  },
  "id": "person-coverage-3a90aade5efd3c::S1",
  "title": "Grow Global Film & TV Industries | Flawless",
  "url": "https://flawlessai.com/mission"
}

First-party company timeline; historical motivation is explicit, while consent, copyright, data quality, and release claims remain the vendor’s assertions rather than legal conclusions.

First-party company timeline; historical motivation is explicit, while consent, copyright, data quality, and release claims remain the vendor’s assertions rather than legal conclusions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sean Lie

Cerebras’s cached company page identifies Sean Lie as CTO and co-founder among the five people who launched the company in 2015 to bring wafer-scale computing to market.

Its timeline distinguishes the 2019 WSE-1 and CS-1 launch from the 2021 WSE-2 and CS-2 generation and the 2024 WSE-3 and CS-3 generation.

The timeline also records the 2023 Condor Galaxy supercomputer network with G42, identifying CG-1 as an FP16 system with four exaFLOPs and 54 million cores.

Sources and details

About Cerebras | AI Inference and Wafer-Scale Computing

{
  "access_scope": "Corporate history and leadership credit; model generations and team-level launches remain distinct, and performance superlatives or sole engineering invention are not propagated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Condor_Galaxy_network": "2023",
    "WSE_1_CS_1": "2019",
    "WSE_2_CS_2": "2021",
    "WSE_3_CS_3": "2024",
    "founding": "2015",
    "retrieved_utc": "2026-10-07T17:54:49.153417+00:00"
  },
  "id": "person-seanlie::S1",
  "title": "About Cerebras | AI Inference and Wafer-Scale Computing",
  "url": "https://www.cerebras.ai/company"
}

Corporate history and leadership credit; model generations and team-level launches remain distinct, and performance superlatives or sole engineering invention are not propagated.

Corporate history and leadership credit; model generations and team-level launches remain distinct, and performance superlatives or sole engineering invention are not propagated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sendhil Mullainathan

Sendhil Mullainathan is credited with Jann Spiess for the Spring 2017 Journal of Economic Perspectives article Machine Learning: An Applied Econometric Approach.

Its abstract distinguishes machine learning’s prediction objective from the parameter-estimation problems common in economic research.

The article aims to identify suitable econometric uses and explain where algorithms can fail or be misinterpreted, rather than treating easy access to software packages as sufficient methodological understanding.

Sources and details

Machine Learning: An Applied Econometric Approach - American Economic Association

{
  "access_scope": "Full journal abstract and ordered credit; conceptual argument is collective authorship, with no individual division of analysis inferred.",
  "authors": [
    "Sendhil Mullainathan",
    "Jann Spiess"
  ],
  "authors_in_source_order": [
    "Sendhil Mullainathan",
    "Jann Spiess"
  ],
  "dates": {
    "citation_publication_date": "2017/05",
    "issue": "Spring 2017",
    "retrieved_utc": "2026-10-07T18:14:57.712017+00:00"
  },
  "id": "person-coverage-ab3e83fff24881::S1",
  "title": "Machine Learning: An Applied Econometric Approach - American Economic Association",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2Fjep.31.2.87"
}

Full journal abstract and ordered credit; conceptual argument is collective authorship, with no individual division of analysis inferred.

Full journal abstract and ordered credit; conceptual argument is collective authorship, with no individual division of analysis inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sergey Brin

Sergey Brin is listed with Lawrence Page on the 1998 paper describing Google’s large-scale hypertextual search-engine prototype.

The abstract describes efficient crawling and indexing with a full-text and hyperlink database containing at least 24 million pages.

It treats hyperlink structure as additional retrieval information and examines practical scaling and uncontrolled web publishing, rather than describing a later production Google system.

Sources and details

The Anatomy of a Large-Scale Hypertextual Web Search Engine

{
  "access_scope": "Historical prototype abstract and exact paper authors; source spelling Lawrence Page is retained, with no undocumented personal component or current production capability inferred.",
  "authors": [
    "Sergey Brin",
    "Lawrence Page"
  ],
  "authors_in_source_order": [
    "Sergey Brin",
    "Lawrence Page"
  ],
  "dates": {
    "citation_publication_date": "1998",
    "publication": "1998",
    "retrieved_utc": "2026-10-07T18:17:15.312406+00:00"
  },
  "id": "person-coverage-9e418db45b6b83::S1",
  "title": "The Anatomy of a Large-Scale Hypertextual Web Search Engine",
  "url": "https://research.google/pubs/the-anatomy-of-a-large-scale-hypertextual-web-search-engine/"
}

Historical prototype abstract and exact paper authors; source spelling Lawrence Page is retained, with no undocumented personal component or current production capability inferred.

Historical prototype abstract and exact paper authors; source spelling Lawrence Page is retained, with no undocumented personal component or current production capability inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shawn Levy

20th Century Studios credits Shawn Levy as director and co-producer of Free Guy, released on August 13, 2021.

Its synopsis has a bank teller discover that he is a background character in an open-world video game and decide to become the hero of his own story.

The narrative centers on his attempt to save that virtual world, while the page separately credits Matt Lieberman and Zak Penn as writers.

Sources and details

Free Guy | 20th Century Studios

{
  "access_scope": "Studio fictional synopsis and creative credits; directing and co-production are distinct from screenplay authorship and real autonomous game-agent behavior.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "August 13, 2021",
    "retrieved_utc": "2026-10-07T18:15:37.078182+00:00"
  },
  "id": "person-coverage-6bf8cc9b7697dc::S1",
  "title": "Free Guy | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/free-guy"
}

Studio fictional synopsis and creative credits; directing and co-production are distinct from screenplay authorship and real autonomous game-agent behavior.

Studio fictional synopsis and creative credits; directing and co-production are distinct from screenplay authorship and real autonomous game-agent behavior.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sherry Turkle

MIT News’s January 2011 account describes Sherry Turkle’s Alone Together as drawing on interviews with 450 people about everyday technology use.

It reports her finding that adolescents could be unhappy with parents’ diverted attention even while using mobile devices heavily themselves.

The account also describes her concern about social robots replacing human interaction while retaining her acknowledgment that online connectivity can sustain friendships across distance.

Sources and details

The lonely crowd | MIT News | Massachusetts Institute of Technology

{
  "access_scope": "Dated university report on the book and interview findings; source writer, photo creator, and book author are separate, with no universal claim that technology harms all relationships.",
  "authors": [
    "Peter Dizikes, MIT News Office"
  ],
  "authors_in_source_order": [
    "Peter Dizikes, MIT News Office"
  ],
  "dates": {
    "article": "January 18, 2011",
    "retrieved_utc": "2026-10-07T18:17:42.432101+00:00"
  },
  "id": "person-coverage-b392937d4c8b9a::S1",
  "title": "The lonely crowd | MIT News | Massachusetts Institute of Technology",
  "url": "https://news.mit.edu/2011/turkle-alone-together-0118"
}

Dated university report on the book and interview findings; source writer, photo creator, and book author are separate, with no universal claim that technology harms all relationships.

Dated university report on the book and interview findings; source writer, photo creator, and book author are separate, with no universal claim that technology harms all relationships.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shirow Masamune

The Ghost in the Shell’s official site credits Shirow Masamune with the manga that began serialization in Kodansha’s Young Magazine Pirate Edition in 1989.

Its description centers on full-body cyborg Motoko Kusanagi and her unit confronting complex crimes while exploring personal identity and the fusion of people with technology.

The site distinguishes later theatrical animation, television animation, and games as separate adaptations with their own stories and interpretations.

Sources and details

About The Ghost in the Shell - INTRODUCTION | Ghost in the Shell Official Global Site

{
  "access_scope": "Official franchise description and fictional premise; original manga authorship is not collapsed into all adaptation credits or real cyberwarfare capability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2023-10-31T00:00:14"
    ],
    "manga_serialization_start": "1989",
    "retrieved_utc": "2026-10-07T18:17:50.274947+00:00"
  },
  "id": "person-coverage-b9f0b7cd9fef7c::S1",
  "title": "About The Ghost in the Shell - INTRODUCTION | Ghost in the Shell Official Global Site",
  "url": "https://theghostintheshell.jp/en/introduction/article/about-ghost-in-the-shell"
}

Official franchise description and fictional premise; original manga authorship is not collapsed into all adaptation credits or real cyberwarfare capability.

Official franchise description and fictional premise; original manga authorship is not collapsed into all adaptation credits or real cyberwarfare capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shoshana Zuboff

Shoshana Zuboff’s page for In the Age of the Smart Machine identifies the 1988 book’s concept of informating as translating activities, events, social exchange, and objects into information.

The research account describes multi-year studies of office, factory, professional, executive, and craft workplaces shifting toward computer-mediated tasks.

It frames workplace change through the interaction of technological possibilities, choices made by individuals and groups, and social, political, and economic interests.

Sources and details

In the Age of the Smart Machine – SHOSHANA ZUBOFF

{
  "access_scope": "Author-hosted book research description; Zuboff’s original work is distinct from the quoted anniversary essay, and its account is not treated as a universal causal law.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "book": "1988",
    "retrieved_utc": "2026-10-07T18:13:26.870515+00:00"
  },
  "id": "person-coverage-36bc05e0ee2f25::S1",
  "title": "In the Age of the Smart Machine – SHOSHANA ZUBOFF",
  "url": "https://shoshanazuboff.com/book/books/in-the-age-of-the-smart-machine/"
}

Author-hosted book research description; Zuboff’s original work is distinct from the quoted anniversary essay, and its account is not treated as a universal causal law.

Author-hosted book research description; Zuboff’s original work is distinct from the quoted anniversary essay, and its account is not treated as a universal causal law.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Siddharth Kara

Siddharth Kara is credited for Cobalt Red, whose publisher supplies an introduction describing his reporting from cobalt-mining areas in the Democratic Republic of the Congo.

The excerpt connects mineral extraction to rechargeable-battery supply chains and contrasts conditions encountered near mining sites with corporate responsible-sourcing statements.

It uses that contrast to argue that the benefits of consumer technology and low-carbon products should be examined alongside the labor and environmental costs of extraction.

Sources and details

Cobalt Red

{
  "access_scope": "Named author’s reportage and argument in a book excerpt; observed conditions and allegations are attributed, not independent current supply-chain verification or medical/legal advice.",
  "authors": [
    "Siddharth Kara"
  ],
  "authors_in_source_order": [
    "Siddharth Kara"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2021-02-12T15:16:28+00:00",
      "2025-10-06T10:10:15+00:00"
    ],
    "retrieved_utc": "2026-10-07T18:12:12.619634+00:00"
  },
  "id": "person-coverage-200e9b78696d51::S1",
  "title": "Cobalt Red",
  "url": "https://us.macmillan.com/books/9781250284297/cobaltred/"
}

Named author’s reportage and argument in a book excerpt; observed conditions and allegations are attributed, not independent current supply-chain verification or medical/legal advice.

Named author’s reportage and argument in a book excerpt; observed conditions and allegations are attributed, not independent current supply-chain verification or medical/legal advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sigourney Weaver

AFI credits Sigourney Weaver as Ripley in Alien, its record dating the film to May 1979.

In the synopsis, Ripley recognizes a received signal as a warning and tries to enforce quarantine when an infected crew member is brought back aboard the Nostromo.

Her objections are overridden by science officer Ash, placing her character’s safety judgment against shipboard authority and the escalating threat.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI cast credit and fictional narrative; character actions are distinct from personal expertise of the performer and do not establish real medical or safety procedures.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_release": "25 May 1979",
    "retrieved_utc": "2026-10-07T17:55:07.996027+00:00"
  },
  "id": "person-coverage-a629df8b720455::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/53908"
}

AFI cast credit and fictional narrative; character actions are distinct from personal expertise of the performer and do not establish real medical or safety procedures.

AFI cast credit and fictional narrative; character actions are distinct from personal expertise of the performer and do not establish real medical or safety procedures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Duan

Simon Duan’s January 2026 Scientific American opinion essay proposes studying users’ perceptions of chatbot consciousness as evidence about human cognition and interaction.

It treats anthropomorphism and the extension of a user’s sense of self into an interactive system as possible explanations for felt machine presence.

The essay therefore shifts attention from a machine’s architecture toward the relationship between user and chatbot, presenting a conceptual viewpoint rather than experimental proof of AI consciousness.

Sources and details

Is AI really conscious—or are we bringing it to life? | Scientific American

{
  "access_scope": "Explicitly labeled opinion and speculative relational account; no claim that chatbots possess consciousness or that its risk conclusions are established science.",
  "authors": [
    "Simon Duan"
  ],
  "authors_in_source_order": [
    "Simon Duan"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2026-01-20T07:00:00-05:00",
      "2026-08-26T18:38:51.418000+00:00",
      "2026-01-16T19:28:19Z",
      "2026-01-16T19:26:12Z",
      "2026-01-20T07:00:00-05:00",
      "2026-08-26T18:38:51.418000+00:00"
    ],
    "article": "January 20, 2026",
    "retrieved_utc": "2026-10-07T18:11:50.206840+00:00"
  },
  "id": "person-coverage-0a1892464b879a::S1",
  "title": "Is AI really conscious—or are we bringing it to life? | Scientific American",
  "url": "https://www.scientificamerican.com/article/is-ai-really-conscious-or-are-we-bringing-it-to-life/"
}

Explicitly labeled opinion and speculative relational account; no claim that chatbots possess consciousness or that its risk conclusions are established science.

Explicitly labeled opinion and speculative relational account; no claim that chatbots possess consciousness or that its risk conclusions are established science.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Johnson

Simon Johnson is credited with Daron Acemoglu for Power and Progress, listed by PublicAffairs for May 16, 2023.

The publisher describes the book as challenging the assumption that technological change automatically produces broadly shared prosperity, emphasizing who shapes its direction and captures its gains.

Its argument advocates technologies that create opportunities and empowering tools rather than simply automating work or reinforcing concentrated power.

Sources and details

Power and Progress by Daron Acemoglu & Simon Johnson | Hachette Book Group Email Novel Suspects Logo

{
  "access_scope": "Publisher description of a joint economic-history argument; 2023 book date and later author biography additions are distinct, with no individual chapter allocation or present economic advice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2023-05-16"
    ],
    "listed_edition": "May 16, 2023",
    "retrieved_utc": "2026-10-07T18:19:01.034966+00:00"
  },
  "id": "person-coverage-edac7214470c7a::S1",
  "title": "Power and Progress by Daron Acemoglu & Simon Johnson | Hachette Book Group Email Novel Suspects Logo",
  "url": "https://www.hachettebookgroup.com/titles/daron-acemoglu/power-and-progress/9781541702554/"
}

Publisher description of a joint economic-history argument; 2023 book date and later author biography additions are distinct, with no individual chapter allocation or present economic advice.

Publisher description of a joint economic-history argument; 2023 book date and later author biography additions are distinct, with no individual chapter allocation or present economic advice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Simon Knowles

BMW i Ventures’ December 2018 investment account identifies Simon Knowles with Nigel Toon as Graphcore’s co-founders.

It describes Graphcore’s IPU as keeping neural-network variables in processor memory to reduce reliance on fetching them through an external-memory interface.

The account pairs this many-core design with Poplar software for coordinating communication and data movement; these are the investor’s descriptions of the company’s architecture rather than proof of Knowles’s individual implementation tasks.

Sources and details

Machine Intelligence for the Innovators of Tomorrow - BMW i Ventures’ investment in Graphcore

{
  "access_scope": "Dated investor account; architectural explanations are attributed and projected market shares, comparative speedups, and future valuations are not presented as verified outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Graphcore_founding_as_described": "2016",
    "article": "December 2018",
    "retrieved_utc": "2026-10-07T18:16:09.899632+00:00"
  },
  "id": "person-coverage-9a8607428daeb7::S1",
  "title": "Machine Intelligence for the Innovators of Tomorrow - BMW i Ventures’ investment in Graphcore",
  "url": "https://www.bmwiventures.com/news/our-investment-in-graphcore"
}

Dated investor account; architectural explanations are attributed and projected market shares, comparative speedups, and future valuations are not presented as verified outcomes.

Dated investor account; architectural explanations are attributed and projected market shares, comparative speedups, and future valuations are not presented as verified outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sougwen Chung

Sougwen Chung’s RECURSIONS page describes painting a monumental linen scroll with two robotic arms driven by a model trained on the artist’s gesture and calligraphic archives.

Live EEG measurements modulate the model’s gestural responses, creating a loop in which archived movements generate new robotic trajectories to which the artist responds.

The physical work combines water-based ink with a reflective silver composite, while an accompanying digital inscription draws on 1,314 drawings and biosignal sessions.

Sources and details

RECURSIONS (2026) — Sougwen Chung (愫君)

{
  "access_scope": "Artist’s primary technical and material account; EEG modulation is the stated artistic mechanism, not validation of mind reading or a medical application.",
  "authors": [
    "Sougwen Chung"
  ],
  "authors_in_source_order": [
    "Sougwen Chung"
  ],
  "dates": {
    "JSON_LD_date_literals_in_source_order": [
      "2026-05-21T15:18:18+00:00",
      "2026-07-06T14:40:15+00:00"
    ],
    "retrieved_utc": "2026-10-07T17:55:41.846413+00:00",
    "work_as_titled": "2026"
  },
  "id": "person-coverage-69d7cbd40f755a::S1",
  "title": "RECURSIONS (2026) — Sougwen Chung (愫君)",
  "url": "https://sougwen.com/work/recursions-drawing-operations"
}

Artist’s primary technical and material account; EEG modulation is the stated artistic mechanism, not validation of mind reading or a medical application.

Artist’s primary technical and material account; EEG modulation is the stated artistic mechanism, not validation of mind reading or a medical application.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Spike Jonze

Film at Lincoln Center’s August 2013 announcement identifies Spike Jonze as Her’s writer and director and announces its selection for the New York Film Festival’s closing-night world premiere.

Its synopsis follows Theodore Twombly’s relationship with Samantha, an advanced operating system presented as a distinctive entity voiced by Scarlett Johansson.

The announcement frames their growing attachment as an exploration of intimacy and its risks, while its then-planned theatrical release remains an announcement-era plan.

Sources and details

FSLC announces the World Premiere of Spike Jonze's HER as the Closing Night Gala Selection of NYFF51 | Film at Lincoln Center

{
  "access_scope": "Dated festival announcement and fictional synopsis; selection and planned release are historical statements, and fictional intimacy does not demonstrate real machine consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement": "August 8, 2013",
    "festival": "September 27 – October 13, 2013",
    "retrieved_utc": "2026-10-07T18:22:44.703600+00:00",
    "then_planned_limited_release": "November 20"
  },
  "id": "person-spikejonze::S1",
  "title": "FSLC announces the World Premiere of Spike Jonze's HER as the Closing Night Gala Selection of NYFF51 | Film at Lincoln Center",
  "url": "https://www.filmlinc.org/press/fslc-announces-the-world-premiere-of-spike-jonzes-her-as-the-closing-night/"
}

Dated festival announcement and fictional synopsis; selection and planned release are historical statements, and fictional intimacy does not demonstrate real machine consciousness.

Dated festival announcement and fictional synopsis; selection and planned release are historical statements, and fictional intimacy does not demonstrate real machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stan Winston

Stan Winston’s practical puppetry is identified by ILM as one half of Jurassic Park’s combination of physical and computer-generated dinosaurs.

The production history explains that an early computer-animation test displaced the original stop-motion plan while experienced stop-motion artists helped bridge the transition.

It distinguishes six minutes of computer-generated dinosaurs from nine minutes of practical puppets in the finished film.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park

{
  "access_scope": "ILM.com Team’s July 9, 2015 production retrospective; Winston’s practical effects are separate from ILM’s digital animation and the motion-encoder work credited to Tom St. Amand, with no AI technique inferred.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "July 9, 2015 retrospective; 1993 film",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 9, 2015 retrospective; 1993 film"
  ],
  "id": "person-coverage-d21a291d6ae2ed::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

ILM.com Team’s July 9, 2015 production retrospective; Winston’s practical effects are separate from ILM’s digital animation and the motion-encoder work credited to Tom St. Amand, with no AI technique inferred.

ILM.com Team’s July 9, 2015 production retrospective; Winston’s practical effects are separate from ILM’s digital animation and the motion-encoder work credited to Tom St. Amand, with no AI technique inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stanislas Dehaene

Stanislas Dehaene is a listed coauthor of a review comparing five major theories of consciousness through a public debate held in 2022.

The abstract describes asking proponents to specify what their theories explain, the mechanisms they propose, and their foundational assumptions.

The resulting discussion examines testability and possible refutation, reporting continuing disagreements over what consciousness is and how to recognize it.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "IUCC/Tel Aviv University record and abstract for the March 2025 review in Neuroscience and Biobehavioral Reviews; it summarizes a debate rather than proving a theory or validating AI consciousness, and joint authorship does not identify individual tasks.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "inspected_source_date_1": "March 2025 publication; 2022 debate",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2025 publication; 2022 debate"
  ],
  "id": "person-coverage-887ae0c41d14a9::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

IUCC/Tel Aviv University record and abstract for the March 2025 review in Neuroscience and Biobehavioral Reviews; it summarizes a debate rather than proving a theory or validating AI consciousness, and joint authorship does not identify individual tasks.

IUCC/Tel Aviv University record and abstract for the March 2025 review in Neuroscience and Biobehavioral Reviews; it summarizes a debate rather than proving a theory or validating AI consciousness, and joint authorship does not identify individual tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stanisław Lem

Stanisław Lem is credited as the author of Summa Technologiae, a nonfiction philosophical examination of human and nonhuman life across possible technological futures.

Minnesota’s description identifies the parallel development of biological and technical evolution as a central investigation.

It presents evolution as opportunistic and shortsighted in Lem’s argument, connecting the work to questions about information, virtual reality, and technological change.

Sources and details

Summa Technologiae

{
  "access_scope": "University of Minnesota Press’s description of the 2013 English ebook translated by Joanna Zylinska, distinct from the original 1964 work and 2014 paperback; philosophical conjectures are attributed to the book, not established predictions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "original 1964; English ebook March 1, 2013; paperback January 1, 2014",
    "retrieved_utc": "2026-10-07T18:22:51.992731+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original 1964; English ebook March 1, 2013; paperback January 1, 2014"
  ],
  "id": "person-stanisławlem::S1",
  "title": "Summa Technologiae",
  "url": "https://www.upress.umn.edu/9780816689040/summa-technologiae/"
}

University of Minnesota Press’s description of the 2013 English ebook translated by Joanna Zylinska, distinct from the original 1964 work and 2014 paperback; philosophical conjectures are attributed to the book, not established predictions.

University of Minnesota Press’s description of the 2013 English ebook translated by Joanna Zylinska, distinct from the original 1964 work and 2014 paperback; philosophical conjectures are attributed to the book, not established predictions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stanley Kubrick

Stanley Kubrick is credited by BFI as director and producer of 2001: A Space Odyssey and as screenwriter with Arthur C. Clarke.

The account describes a match cut from an ape’s thrown bone to a spacecraft, compressing a span of human development into an image transition.

Its synopsis places HAL-9000’s fatal malfunction within a fictional Jupiter mission and traces the film from primordial tool use to David Bowman’s journey beyond familiar space.

Sources and details

2001: A Space Odyssey

{
  "access_scope": "BFI’s film record and critical introduction for the 1968 film; the narrative and HAL behavior are fictional, critics’ quoted judgments remain distinct from credits, and effects or screenplay labor is not divided between collaborators.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1968 film; record includes 2022 poll",
    "retrieved_utc": "2026-10-07T18:02:32.736646+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1968 film; record includes 2022 poll"
  ],
  "id": "person-stanleykubrick::S1",
  "title": "2001: A Space Odyssey",
  "url": "https://www.bfi.org.uk/film/cefccdb2-b558-5623-9c17-72b4be7bd4c1/2001-a-space-odyssey"
}

BFI’s film record and critical introduction for the 1968 film; the narrative and HAL behavior are fictional, critics’ quoted judgments remain distinct from credits, and effects or screenplay labor is not divided between collaborators.

BFI’s film record and critical introduction for the 1968 film; the narrative and HAL behavior are fictional, critics’ quoted judgments remain distinct from credits, and effects or screenplay labor is not divided between collaborators.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stanley Mazor

Stanley Mazor is credited with Ted Hoff in Computer History Museum’s account of conceiving Intel’s 4004 integrated CPU within the MCS-4 chipset.

The history separates that conception from Federico Faggin’s silicon-gate implementation, assisted by Masatoshi Shima, that fit 2,300 transistors into a package.

It explains that these early microprocessors still required peripheral and supporting functions to form a complete computer system.

Sources and details

1971: Microprocessor Integrates CPU Function onto a Single Chip

{
  "access_scope": "CHM’s 1971 milestone history, revised May 30, 2020; conception, implementation, and later microprocessor designs are separately credited, without making Mazor the sole inventor or assigning him subsequent devices.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1971 milestone; revision May 30, 2020",
    "retrieved_utc": "2026-10-07T18:19:22.952339+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1971 milestone; revision May 30, 2020"
  ],
  "id": "person-stanleymazor::S1",
  "title": "1971: Microprocessor Integrates CPU Function onto a Single Chip",
  "url": "https://www.computerhistory.org/siliconengine/microprocessor-integrates-cpu-function-onto-a-single-chip/"
}

CHM’s 1971 milestone history, revised May 30, 2020; conception, implementation, and later microprocessor designs are separately credited, without making Mazor the sole inventor or assigning him subsequent devices.

CHM’s 1971 milestone history, revised May 30, 2020; conception, implementation, and later microprocessor designs are separately credited, without making Mazor the sole inventor or assigning him subsequent devices.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stella Biderman

Stella Biderman’s first-person research statement combines studying capability development with making open-weight systems safer.

She describes interpretability over time as following models through learning so researchers can identify emerging capabilities and intervene during training.

Her open-science agenda emphasizes public data, models, code, and infrastructure that let researchers outside the largest technology companies participate independently.

Sources and details

Stella Biderman

{
  "access_scope": "Biderman’s personal research page, carrying news through October 2026; these are stated research aims rather than independently measured outcomes, and library releases are not treated as evidence of sole implementation.",
  "authors": [
    "Stella Biderman"
  ],
  "authors_in_source_order": [
    "Stella Biderman"
  ],
  "dates": {
    "inspected_source_date_1": "undated research statement; page news through October 2026",
    "retrieved_utc": "2026-10-07T17:54:43.801499+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated research statement; page news through October 2026"
  ],
  "id": "person-coverage-b6f65cd4b35296::S1",
  "title": "Stella Biderman",
  "url": "https://stellabiderman.ai/"
}

Biderman’s personal research page, carrying news through October 2026; these are stated research aims rather than independently measured outcomes, and library releases are not treated as evidence of sole implementation.

Biderman’s personal research page, carrying news through October 2026; these are stated research aims rather than independently measured outcomes, and library releases are not treated as evidence of sole implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stephen Balaban

Stephen Balaban is identified in Lambda’s May 2026 leadership announcement as cofounder moving into a full-time chief technology officer role.

The announcement assigns him technology strategy and product vision while Michel Combes takes the CEO role and Michael Balaban becomes chief product officer.

It places those changes within a plan to expand capital formation and compute delivery, with a stated target of three gigawatts under management by 2030.

Sources and details

Lambda assembles leadership team to power gigawatt-scale AI infrastructure

{
  "access_scope": "Lambda-authored May 5, 2026 announcement, updated May 27; the 2030 capacity is a target, and executive responsibilities do not prove that Balaban personally designed all infrastructure or that planned deployment occurred.",
  "authors": [
    "Lambda"
  ],
  "authors_in_source_order": [
    "Lambda"
  ],
  "dates": {
    "inspected_source_date_1": "May 5, 2026; updated May 27, 2026",
    "retrieved_utc": "2026-10-07T17:59:59.270382+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 5, 2026; updated May 27, 2026"
  ],
  "id": "person-coverage-2599dcd1faa9df::S1",
  "title": "Lambda assembles leadership team to power gigawatt-scale AI infrastructure",
  "url": "https://lambda.ai/blog/lambda-assembles-leadership-team-to-power-gigawatt-scale-ai-infrastructure"
}

Lambda-authored May 5, 2026 announcement, updated May 27; the 2030 capacity is a target, and executive responsibilities do not prove that Balaban personally designed all infrastructure or that planned deployment occurred.

Lambda-authored May 5, 2026 announcement, updated May 27; the 2030 capacity is a target, and executive responsibilities do not prove that Balaban personally designed all infrastructure or that planned deployment occurred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steve Barron

Steve Barron is credited by AFI as director of Electric Dreams, after Rusty Lemorande approached him on the strength of his music-video work.

The production history says Barron emphasized performances to counter expectations that he would prioritize visuals over character.

It records his view that working with young, rising actors Lenny Von Dohlen and Virginia Madsen helped him make his first feature.

Sources and details

Electric Dreams

{
  "access_scope": "AFI’s retrospective production history for the 1984 film, drawing on production notes and contemporary reporting; Lemorande’s conception and screenplay remain separate from Barron’s directing, and the computer fantasy is not evidence of AI development.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1984 film; retrospective history undated",
    "retrieved_utc": "2026-10-07T18:15:22.948839+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 film; retrospective history undated"
  ],
  "id": "person-coverage-d5ca497d20b288::S1",
  "title": "Electric Dreams",
  "url": "https://catalog.afi.com/Film/70494-ELECTRIC-DREAMS?cp=1&cxt=Filmography2&pos=0&sid=1c51694f-27b4-4273-a274-cd8184bfde76&sr=2.2783356"
}

AFI’s retrospective production history for the 1984 film, drawing on production notes and contemporary reporting; Lemorande’s conception and screenplay remain separate from Barron’s directing, and the computer fantasy is not evidence of AI development.

AFI’s retrospective production history for the 1984 film, drawing on production notes and contemporary reporting; Lemorande’s conception and screenplay remain separate from Barron’s directing, and the computer fantasy is not evidence of AI development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steven Spielberg

Steven Spielberg is credited by Amblin as director and screenwriter of A.I. Artificial Intelligence, continuing a project Stanley Kubrick had developed over decades.

The production account says Kubrick’s widow and Jan Harlan asked Spielberg to continue the work after Kubrick died in 1999.

Its fictional story follows David, a robotic child programmed to love, whose placement with a family becomes untenable and prompts a search for belonging.

Sources and details

A.I. Artificial Intelligence

{
  "access_scope": "Amblin production history and synopsis; Spielberg’s screenplay is distinguished from Ian Watson’s screen story and Brian Aldiss’s source story, while David’s emotions are fictional and effects are separately credited to specialist teams.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Kubrick death 1999; film production retrospective undated",
    "retrieved_utc": "2026-10-07T17:55:27.322065+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Kubrick death 1999; film production retrospective undated"
  ],
  "id": "person-coverage-4d202c84381caf::S1",
  "title": "A.I. Artificial Intelligence",
  "url": "https://amblin.com/movie/a-i-artificial-intelligence/"
}

Amblin production history and synopsis; Spielberg’s screenplay is distinguished from Ian Watson’s screen story and Brian Aldiss’s source story, while David’s emotions are fictional and effects are separately credited to specialist teams.

Amblin production history and synopsis; Spielberg’s screenplay is distinguished from Ian Watson’s screen story and Brian Aldiss’s source story, while David’s emotions are fictional and effects are separately credited to specialist teams.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stuart Russell

Stuart Russell is credited as the author of Human Compatible, which argues that preserving human control requires reconsidering AI’s basic objectives.

The publisher describes his proposed foundation as machines remaining uncertain about the human preferences they are meant to satisfy.

This approach is set against both possible future superhuman capabilities and existing misuse, including autonomous weapons and sabotage.

Sources and details

Human Compatible

{
  "access_scope": "PRH’s description of the 2019 ebook and 2020 paperback; the proposal and claims of beneficial behavior are the book’s argument, not a validation of deployed systems, and audiobook reader Raphael Corkhill is distinct from Russell.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "ebook October 8, 2019; paperback November 17, 2020",
    "retrieved_utc": "2026-10-07T18:18:19.397422+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ebook October 8, 2019; paperback November 17, 2020"
  ],
  "id": "person-coverage-ccac8444f2ae82::S1",
  "title": "Human Compatible",
  "url": "https://www.penguinrandomhouse.com/books/566677/human-compatible-by-stuart-russell/"
}

PRH’s description of the 2019 ebook and 2020 paperback; the proposal and claims of beneficial behavior are the book’s argument, not a validation of deployed systems, and audiobook reader Raphael Corkhill is distinct from Russell.

PRH’s description of the 2019 ebook and 2020 paperback; the proposal and claims of beneficial behavior are the book’s argument, not a validation of deployed systems, and audiobook reader Raphael Corkhill is distinct from Russell.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tahnoon bin Zayed Al Nahyan

Tahnoon bin Zayed Al Nahyan is identified as MGX chairman in the announcement of an AI infrastructure investment partnership with BlackRock, GIP, and Microsoft.

The release describes pairing new or expanded data centers with energy infrastructure rather than funding computing facilities in isolation.

It sets an initial goal of unlocking thirty billion dollars in equity capital, with debt potentially increasing total investment capacity to one hundred billion dollars.

Sources and details

BlackRock, Global Infrastructure Partners, Microsoft, and MGX launch new AI partnership

{
  "access_scope": "BlackRock’s September 2024 announcement quotes the MGX chairman but credits the partnership institutions with the investment plan; amounts are fundraising potential, not completed deployment or personal financing by Tahnoon.",
  "authors": [
    "BlackRock"
  ],
  "authors_in_source_order": [
    "BlackRock"
  ],
  "dates": {
    "inspected_source_date_1": "dateline September 17, 2024; page September 18, 2024",
    "retrieved_utc": "2026-10-07T18:12:15.107997+00:00"
  },
  "dates_exact_in_source_role_order": [
    "dateline September 17, 2024; page September 18, 2024"
  ],
  "id": "person-coverage-a3c6418e7ba9c6::S1",
  "title": "BlackRock, Global Infrastructure Partners, Microsoft, and MGX launch new AI partnership",
  "url": "https://www.blackrock.com/corporate/newsroom/media/press-releases/blackrock-global-infrastructure-partners-microsoft-and-mgx-launch-new-ai"
}

BlackRock’s September 2024 announcement quotes the MGX chairman but credits the partnership institutions with the investment plan; amounts are fundraising potential, not completed deployment or personal financing by Tahnoon.

BlackRock’s September 2024 announcement quotes the MGX chairman but credits the partnership institutions with the investment plan; amounts are fundraising potential, not completed deployment or personal financing by Tahnoon.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Taiichi Ohno

Taiichi Ohno is credited by Lean Enterprise Institute with leading Toyota Production System development and its spread to suppliers after the Second World War.

The account describes just-in-time and jidoka as its two pillars, maintained through standardized work and repeated improvement.

It distinguishes Ohno’s development of material and information flows from earlier concepts credited to Kiichiro and Sakichi Toyoda.

Sources and details

Toyota Production System

{
  "access_scope": "Lean Enterprise Institute’s institutional lexicon history of TPS; leadership and earlier conceptual origins are separate credits, and the entry does not imply Ohno invented every component or designed AI systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1950s–1960s development; supplier dissemination 1960s–1970s",
    "retrieved_utc": "2026-10-07T18:22:46.248057+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1950s–1960s development; supplier dissemination 1960s–1970s"
  ],
  "id": "person-taiichiohno::S1",
  "title": "Toyota Production System",
  "url": "https://www.lean.org/lexicon-terms/toyota-production-system/"
}

Lean Enterprise Institute’s institutional lexicon history of TPS; leadership and earlier conceptual origins are separate credits, and the entry does not imply Ohno invented every component or designed AI systems.

Lean Enterprise Institute’s institutional lexicon history of TPS; leadership and earlier conceptual origins are separate credits, and the entry does not imply Ohno invented every component or designed AI systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tamrat Yifrashewa

Tamrat Yifrashewa’s essay frames an AI truth gap as the distance between a persuasive answer and one supported by traceable evidence.

It proposes measures that compare claims with evidence, weight errors by harm, and consider uncertainty and energy use alongside capability.

The author calls for preregistered testing, independent replication, and domain-specific adaptation before these proposed measures are used in high-stakes settings.

Sources and details

A Framework for Evidence, Reliability, Accountability, and Responsible AI

{
  "access_scope": "Yifrashewa’s August 2026 LinkedIn thought-leadership article; its named indexes are conceptual proposals rather than peer-reviewed standards, regulatory rules, or validated clinical or financial instruments. Unverified numerical claims elsewhere in the essay are not adopted.",
  "authors": [
    "Tamrat Yifrashewa"
  ],
  "authors_in_source_order": [
    "Tamrat Yifrashewa"
  ],
  "dates": {
    "inspected_source_date_1": "August 2026",
    "retrieved_utc": "2026-10-07T18:16:15.530386+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 2026"
  ],
  "id": "person-coverage-88f891755640ad::S1",
  "title": "A Framework for Evidence, Reliability, Accountability, and Responsible AI",
  "url": "https://www.linkedin.com/pulse/artificial-intelligence-truth-gap-tamrat-yifrashewa--9hltc/"
}

Yifrashewa’s August 2026 LinkedIn thought-leadership article; its named indexes are conceptual proposals rather than peer-reviewed standards, regulatory rules, or validated clinical or financial instruments. Unverified numerical claims elsewhere in the essay are not adopted.

Yifrashewa’s August 2026 LinkedIn thought-leadership article; its named indexes are conceptual proposals rather than peer-reviewed standards, regulatory rules, or validated clinical or financial instruments. Unverified numerical claims elsewhere in the essay are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tara Hernandez

Tara Hernandez is named with Damon Lindelof as a creator behind Mrs. Davis in Peacock’s early series announcement.

The premise follows Simone, a nun who wants to destroy the powerful AI that gives the series its name, alongside an ex-partner with his own grievance against it.

A fictional message voiced as the AI uses validation, dependence, and quests to solicit users, establishing the story’s tension between care and control.

Sources and details

First Look: New Peacock Original Mrs. Davis Coming in April

{
  "access_scope": "Peacock Staff’s December 7, 2022 promotion for an April premiere; creator credit is separate from the staff byline and cast, and the first-person AI message is scripted promotional fiction, not a functioning AI’s statement or Hernandez’s personal view.",
  "authors": [
    "Peacock Staff"
  ],
  "authors_in_source_order": [
    "Peacock Staff"
  ],
  "dates": {
    "inspected_source_date_1": "December 7, 2022 announcement",
    "retrieved_utc": "2026-10-07T18:12:27.564086+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 7, 2022 announcement"
  ],
  "id": "person-coverage-92eeb8b431061c::S1",
  "title": "First Look: New Peacock Original Mrs. Davis Coming in April",
  "url": "https://www.peacocktv.com/blog/mrs-davis-gets-release-date-on-peacock"
}

Peacock Staff’s December 7, 2022 promotion for an April premiere; creator credit is separate from the staff byline and cast, and the first-person AI message is scripted promotional fiction, not a functioning AI’s statement or Hernandez’s personal view.

Peacock Staff’s December 7, 2022 promotion for an April premiere; creator credit is separate from the staff byline and cast, and the first-person AI message is scripted promotional fiction, not a functioning AI’s statement or Hernandez’s personal view.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Terry Winograd

Terry Winograd is identified by CHM as beginning his MIT doctoral work on SHRDLU in 1968.

The timeline describes the system combining syntax, meaning, and deductive reasoning to respond to English commands.

It bounds that achievement to a simplified world in which commands move blocks, cones, and pyramids with different shapes and colors.

Sources and details

Timeline of Computer History — SHRDLU natural language

{
  "access_scope": "CHM’s institutional 1968 timeline section; SHRDLU’s command understanding is described within a constrained blocks world, not unrestricted language competence, and surrounding milestones are not Winograd’s contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1968 timeline milestone",
    "retrieved_utc": "2026-10-07T18:02:34.804420+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1968 timeline milestone"
  ],
  "id": "person-terrywinograd::S1",
  "title": "Timeline of Computer History — SHRDLU natural language",
  "url": "https://www.computerhistory.org/timeline/ai-robotics/"
}

CHM’s institutional 1968 timeline section; SHRDLU’s command understanding is described within a constrained blocks world, not unrestricted language competence, and surrounding milestones are not Winograd’s contributions.

CHM’s institutional 1968 timeline section; SHRDLU’s command understanding is described within a constrained blocks world, not unrestricted language competence, and surrounding milestones are not Winograd’s contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas A. Stewart

Thomas A. Stewart is credited as the author of Intellectual Capital, which treats organizational knowledge as a central economic resource.

The publisher’s description contrasts that resource with machinery, natural resources, and financial capital.

It presents practical advice and case histories as means of showing how organizations and individuals can develop and use knowledge assets.

Sources and details

Intellectual Capital

{
  "access_scope": "PRH’s September 22, 2010 ebook description, ISBN 9780307765857; Stewart is the book author and the publisher copy is unbylined, while its competitive claims are a management thesis rather than assured business outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "ebook September 22, 2010",
    "retrieved_utc": "2026-10-07T18:19:03.335283+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ebook September 22, 2010"
  ],
  "id": "person-coverage-f874fffdddd02a::S1",
  "title": "Intellectual Capital",
  "url": "https://www.penguinrandomhouse.com/books/173525/intellectual-capital-by-thomas-stewart/"
}

PRH’s September 22, 2010 ebook description, ISBN 9780307765857; Stewart is the book author and the publisher copy is unbylined, while its competitive claims are a management thesis rather than assured business outcomes.

PRH’s September 22, 2010 ebook description, ISBN 9780307765857; Stewart is the book author and the publisher copy is unbylined, while its competitive claims are a management thesis rather than assured business outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas Pynchon

Thomas Pynchon is credited as the author of Gravity’s Rainbow, whose fictional wartime plot begins with an apparent correspondence between Tyrone Slothrop’s encounters and V-2 strikes.

The publisher follows Slothrop across Europe as he evades a military-industrial cabal and searches for Rocket 00000.

It describes the narrative as examining technology’s impact on society, while the selected deluxe edition adds a cover designed by Frank Miller.

Sources and details

Gravity’s Rainbow — Classics Deluxe Edition

{
  "access_scope": "PRH’s October 31, 2006 Penguin Classics deluxe-edition description; plot events and correspondences are fiction, Miller’s cover and George Guidall’s audio reading are distinct roles, and edition dates are not the original novel’s date.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "deluxe paperback October 31, 2006; ebook June 13, 2012; audio October 16, 2014",
    "retrieved_utc": "2026-10-07T18:13:01.317495+00:00"
  },
  "dates_exact_in_source_role_order": [
    "deluxe paperback October 31, 2006; ebook June 13, 2012; audio October 16, 2014"
  ],
  "id": "person-coverage-215bd5d26c1ab1::S1",
  "title": "Gravity’s Rainbow — Classics Deluxe Edition",
  "url": "https://www.penguinrandomhouse.com/books/299800/gravitys-rainbow-classics-deluxe-edition-by-thomas-pynchon/9780143039945/"
}

PRH’s October 31, 2006 Penguin Classics deluxe-edition description; plot events and correspondences are fiction, Miller’s cover and George Guidall’s audio reading are distinct roles, and edition dates are not the original novel’s date.

PRH’s October 31, 2006 Penguin Classics deluxe-edition description; plot events and correspondences are fiction, Miller’s cover and George Guidall’s audio reading are distinct roles, and edition dates are not the original novel’s date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas S. Kuhn

Thomas S. Kuhn is credited as the author of The Structure of Scientific Revolutions, which challenges a purely gradual account of scientific progress.

Chicago’s description contrasts normal science with transformative changes that reorganize accepted thinking and address accumulated anomalies.

The fiftieth-anniversary edition adds Ian Hacking’s introduction to clarify concepts including paradigms and incommensurability.

Sources and details

The Structure of Scientific Revolutions — Fourth Edition

{
  "access_scope": "Chicago’s 2012 fourth-edition description distinguishes Kuhn’s 1962 book from Hacking’s new introductory essay; the summary attributes a philosophy of scientific change rather than establishing a universal law or a claim about current AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "original 1962; fourth/fiftieth-anniversary edition 2012",
    "retrieved_utc": "2026-10-07T18:12:07.856901+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original 1962; fourth/fiftieth-anniversary edition 2012"
  ],
  "id": "person-coverage-10024024db1a36::S1",
  "title": "The Structure of Scientific Revolutions — Fourth Edition",
  "url": "https://press.uchicago.edu/ucp/books/book/chicago/S/bo13179781.html"
}

Chicago’s 2012 fourth-edition description distinguishes Kuhn’s 1962 book from Hacking’s new introductory essay; the summary attributes a philosophy of scientific change rather than establishing a universal law or a claim about current AI.

Chicago’s 2012 fourth-edition description distinguishes Kuhn’s 1962 book from Hacking’s new introductory essay; the summary attributes a philosophy of scientific change rather than establishing a universal law or a claim about current AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas W. Malone

Thomas W. Malone is credited as the author of Superminds, which treats groups such as hierarchies, markets, democracies, and communities as forms of collective intelligence.

The publisher explains that computers can improve these groups by connecting people in richer ways.

It distinguishes that connecting role from the prospect of AI doing more complex thinking within groups, with implications for strategy and collective problems.

Sources and details

Superminds

{
  "access_scope": "Hachette’s May 15, 2018 ebook description, ISBN 9780316349109; collective-intelligence and future-impact arguments belong to the book, not a guarantee that any particular group or deployed AI is smarter.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "May 15, 2018 ebook",
    "retrieved_utc": "2026-10-07T18:13:32.546457+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 15, 2018 ebook"
  ],
  "id": "person-coverage-337bab58d8d4f5::S1",
  "title": "Superminds",
  "url": "https://www.hachettebookgroup.com/titles/thomas-w-malone/superminds/9780316349109/"
}

Hachette’s May 15, 2018 ebook description, ISBN 9780316349109; collective-intelligence and future-impact arguments belong to the book, not a guarantee that any particular group or deployed AI is smarter.

Hachette’s May 15, 2018 ebook description, ISBN 9780316349109; collective-intelligence and future-impact arguments belong to the book, not a guarantee that any particular group or deployed AI is smarter.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Berners-Lee

Tim Berners-Lee is credited by CERN with inventing the World Wide Web in 1989 to support information sharing among scientists.

The institutional history identifies his NeXT computer as the host of the first website, devoted to the Web project itself.

It distinguishes that invention from CERN’s later public-domain release of the software in April 1993 and a subsequent open-licence release.

Sources and details

The birth of the Web

{
  "access_scope": "CERN’s institutional history; the original Web, its first website, and CERN’s software licensing are separate events, and the entry does not credit Berners-Lee with inventing the internet or AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1989 invention; April 30, 1993 public-domain release; 2013 restoration project",
    "retrieved_utc": "2026-10-07T18:22:29.747254+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1989 invention; April 30, 1993 public-domain release; 2013 restoration project"
  ],
  "id": "person-timbernerslee::S1",
  "title": "The birth of the Web",
  "url": "https://home.cern/science/computing/the-birth-of-the-web/"
}

CERN’s institutional history; the original Web, its first website, and CERN’s software licensing are separate events, and the entry does not credit Berners-Lee with inventing the internet or AI.

CERN’s institutional history; the original Web, its first website, and CERN’s software licensing are separate events, and the entry does not credit Berners-Lee with inventing the internet or AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tim Wu

Tim Wu is credited as the author of The Master Switch, which examines how communications industries move from open competition toward concentrated control.

The publisher’s description compares the histories of telephony, radio, and film with the initially open character of the internet.

It frames corporate control of information flows as a question about the internet’s possible future rather than a predetermined outcome.

Sources and details

The Master Switch

{
  "access_scope": "PRH’s description of the 2010 ebook and 2011 paperback; Wu’s historical pattern and future question are a book argument, the page writer is unidentified, and the account is not a current market-concentration measurement.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "ebook November 2, 2010; paperback November 29, 2011",
    "retrieved_utc": "2026-10-07T18:18:40.583515+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ebook November 2, 2010; paperback November 29, 2011"
  ],
  "id": "person-coverage-dd7f1f28064a10::S1",
  "title": "The Master Switch",
  "url": "https://www.penguinrandomhouse.com/books/194417/the-master-switch-by-tim-wu/"
}

PRH’s description of the 2010 ebook and 2011 paperback; Wu’s historical pattern and future question are a book argument, the page writer is unidentified, and the account is not a current market-concentration measurement.

PRH’s description of the 2010 ebook and 2011 paperback; Wu’s historical pattern and future question are a book argument, the page writer is unidentified, and the account is not a current market-concentration measurement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Cunningham

Tom Cunningham is a listed contributor to METR’s 2026 update explaining why its developer-productivity experiment needed redesign.

The report says unwillingness to work without AI changed both who participated and which tasks they submitted, weakening comparisons based on randomized tasks.

It discusses alternatives such as fixed-task experiments and developer-level randomization, each trading off different selection problems and statistical power.

Sources and details

We are Changing our Developer Productivity Experiment Design

{
  "access_scope": "METR’s February 24, 2026 joint methodology update; its selection concerns limit interpretation of later productivity estimates and do not support universal speedup or slowdown claims, while no individual study task is assigned to Cunningham.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "dates": {
    "citation_date": "2026/02/24",
    "inspected_source_date_1": "February 24, 2026",
    "retrieved_utc": "2026-10-07T17:57:52.704396+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 24, 2026"
  ],
  "id": "person-local-tomcunningham::S1",
  "title": "We are Changing our Developer Productivity Experiment Design",
  "url": "https://metr.org/blog/2026-02-24-uplift-update/"
}

METR’s February 24, 2026 joint methodology update; its selection concerns limit interpretation of later productivity estimates and do not support universal speedup or slowdown claims, while no individual study task is assigned to Cunningham.

METR’s February 24, 2026 joint methodology update; its selection concerns limit interpretation of later productivity estimates and do not support universal speedup or slowdown claims, while no individual study task is assigned to Cunningham.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Toshio Endo

Toshio Endo is quoted as a Tokyo Tech professor in the May 2023 announcement of collaborative LLM training research on Fugaku.

He describes combining Tokyo Tech and RIKEN parallelization with Fujitsu infrastructure software and tuning and Tohoku University’s language-processing expertise.

The release sets out institutional responsibilities and a plan to disclose results to support wider academic and commercial use.

Sources and details

Tokyo Tech, Tohoku University, Fujitsu, and RIKEN start collaboration to develop distributed training of Large Language Models

{
  "access_scope": "Joint institutional release dated May 22, 2023; responsibilities are assigned to organizations and plans to publish results are prospective, not evidence that Endo individually implemented every component or that later releases occurred.",
  "authors": [
    "Tokyo Institute of Technology",
    "Tohoku University",
    "Fujitsu Limited",
    "RIKEN"
  ],
  "authors_in_source_order": [
    "Tokyo Institute of Technology",
    "Tohoku University",
    "Fujitsu Limited",
    "RIKEN"
  ],
  "dates": {
    "inspected_source_date_1": "May 22, 2023; initiative May 24, 2023–March 31, 2024",
    "retrieved_utc": "2026-10-07T18:12:03.602459+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 22, 2023; initiative May 24, 2023–March 31, 2024"
  ],
  "id": "person-coverage-1ad6b3a677b1dc::S1",
  "title": "Tokyo Tech, Tohoku University, Fujitsu, and RIKEN start collaboration to develop distributed training of Large Language Models",
  "url": "https://info.archives.global.fujitsu/global/about/resources/news/press-releases/2023/0522-01.html"
}

Joint institutional release dated May 22, 2023; responsibilities are assigned to organizations and plans to publish results are prospective, not evidence that Endo individually implemented every component or that later releases occurred.

Joint institutional release dated May 22, 2023; responsibilities are assigned to organizations and plans to publish results are prospective, not evidence that Endo individually implemented every component or that later releases occurred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trace Drift

Trace Drift is the credited creator of a preprint proposing a Consciousness Acceleration Interface model of repeated human–AI interaction.

The abstract treats the phenomenon needing ethical recognition as a property of interaction rather than an internal attribute of a machine.

It proposes parameters for accumulated anthropomorphic effects and a design approach that steers interaction depth instead of simply suppressing it.

Sources and details

Consciousness Acceleration Interface: A Dynamical Topology of Human-AI Coupling

{
  "access_scope": "DataCite’s Zenodo concept-DOI record issued August 25, 2026 links a separate version DOI; its abstract describes a theoretical proposal, not an empirically validated topology or proof of AI consciousness. Exact givenName Trace and familyName Drift fields supply the full credit without initial expansion.",
  "authors": [
    "Trace Drift"
  ],
  "authors_in_source_order": [
    "Trace Drift"
  ],
  "dates": {
    "inspected_source_date_1": "issued August 25, 2026; concept DOI, version field absent",
    "retrieved_utc": "2026-10-07T18:10:41.722625+00:00"
  },
  "dates_exact_in_source_role_order": [
    "issued August 25, 2026; concept DOI, version field absent"
  ],
  "id": "person-coverage-067d9b80a880a6::S1",
  "title": "Consciousness Acceleration Interface: A Dynamical Topology of Human-AI Coupling",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.22092518"
}

DataCite’s Zenodo concept-DOI record issued August 25, 2026 links a separate version DOI; its abstract describes a theoretical proposal, not an empirically validated topology or proof of AI consciousness. Exact givenName Trace and familyName Drift fields supply the full credit without initial expansion.

DataCite’s Zenodo concept-DOI record issued August 25, 2026 links a separate version DOI; its abstract describes a theoretical proposal, not an empirically validated topology or proof of AI consciousness. Exact givenName Trace and familyName Drift fields supply the full credit without initial expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Trevor Paglen

Trevor Paglen’s account describes ImageNet Roulette as a provocation exposing problems embedded in image-classification training data.

The tool uses ImageNet’s person categories to make harmful or absurd classifications visible rather than presenting them as scientifically justified descriptions of people.

The account connects the artwork to Excavating AI, his article with Kate Crawford, and distinguishes its museum installation from the removed online version.

Sources and details

ImageNet Roulette

{
  "access_scope": "Paglen’s first-person artist-site account dated April 29, 2020 in the source URL; critiques of classifications are the project’s framing, Kate Crawford’s article coauthorship is distinct, and the removed online incarnation is not described as an available service.",
  "authors": [
    "Trevor Paglen"
  ],
  "authors_in_source_order": [
    "Trevor Paglen"
  ],
  "dates": {
    "inspected_source_date_1": "April 29, 2020 URL date; online incarnation removed in account",
    "retrieved_utc": "2026-10-07T17:55:15.375305+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 29, 2020 URL date; online incarnation removed in account"
  ],
  "id": "person-coverage-2b432762a3aedb::S1",
  "title": "ImageNet Roulette",
  "url": "https://paglen.studio/2020/04/29/imagenet-roulette/"
}

Paglen’s first-person artist-site account dated April 29, 2020 in the source URL; critiques of classifications are the project’s framing, Kate Crawford’s article coauthorship is distinct, and the removed online incarnation is not described as an available service.

Paglen’s first-person artist-site account dated April 29, 2020 in the source URL; critiques of classifications are the project’s framing, Kate Crawford’s article coauthorship is distinct, and the removed online incarnation is not described as an available service.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tushar Krishna

Tushar Krishna is a listed coauthor of the ISSCC 2016 Eyeriss accelerator described on the MIT project page.

The abstract explains that a reconfigurable on-chip network feeds 168 processing elements while exploiting reuse to reduce data movement.

It identifies data gating and compression as additional energy-saving mechanisms and reports an AlexNet demonstration integrated with Caffe.

Sources and details

Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks

{
  "access_scope": "MIT’s ISSCC 2016 project abstract and explicit four-author credit; measurements describe that test chip and workload, not every GPU comparison, and later Eyeriss v2 papers and their authors are distinct. No individual design task is inferred.",
  "authors": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "authors_in_source_order": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "dates": {
    "inspected_source_date_1": "ISSCC 2016; later project news distinct",
    "retrieved_utc": "2026-10-07T18:17:21.228944+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ISSCC 2016; later project news distinct"
  ],
  "id": "person-coverage-dd378baa5ab618::S1",
  "title": "Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks",
  "url": "https://www.mit.edu/~sze/eyeriss.html"
}

MIT’s ISSCC 2016 project abstract and explicit four-author credit; measurements describe that test chip and workload, not every GPU comparison, and later Eyeriss v2 papers and their authors are distinct. No individual design task is inferred.

MIT’s ISSCC 2016 project abstract and explicit four-author credit; measurements describe that test chip and workload, not every GPU comparison, and later Eyeriss v2 papers and their authors are distinct. No individual design task is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ulric Neisser

Ulric Neisser is credited as the author of Cognitive Psychology, which the publisher describes as a systematic survey organized around how information is processed.

The book’s sequence follows sensory input through transformations and reconstruction toward its use in memory and thought.

The classic edition separates visual and auditory cognition before turning to higher mental processes, with a new foreword by Ira Hyman.

Sources and details

Cognitive Psychology — Classic Edition

{
  "access_scope": "Routledge/Psychology Press’s 2014 Classic Edition description, distinct from the original 1967 book; Neisser is the book author and Hyman the foreword writer, while the web description is unbylined and is not an AI model specification.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "original 1967; classic edition copyright 2014",
    "retrieved_utc": "2026-10-07T18:22:50.893165+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original 1967; classic edition copyright 2014"
  ],
  "id": "person-ulricneisser::S1",
  "title": "Cognitive Psychology — Classic Edition",
  "url": "https://www.routledge.com/Cognitive-Psychology-Classic-Edition-1st-Edition/Neisser/p/book/9781848726949"
}

Routledge/Psychology Press’s 2014 Classic Edition description, distinct from the original 1967 book; Neisser is the book author and Hyman the foreword writer, while the web description is unbylined and is not an AI model specification.

Routledge/Psychology Press’s 2014 Classic Edition description, distinct from the original 1967 book; Neisser is the book author and Hyman the foreword writer, while the web description is unbylined and is not an AI model specification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ulrich Schwalbe

Ulrich Schwalbe is credited as the author of a paper examining whether self-learning pricing algorithms can reach collusive outcomes.

The abstract contrasts assumptions of easy coordination with experimental and computational evidence that tacit cooperation can be difficult.

It highlights communication among algorithms alongside legal problems of liability, auditing, monitoring, and enforcement.

Sources and details

Algorithms, Machine Learning, and Collusion

{
  "access_scope": "University of Hohenheim’s abstract and full author credit for the 2019 record, Journal of Competition Law and Economics 14(4), 568–607; its assessment is publication-era analysis, not a present-day legal conclusion or proof that collusion cannot occur.",
  "authors": [
    "Ulrich Schwalbe"
  ],
  "authors_in_source_order": [
    "Ulrich Schwalbe"
  ],
  "dates": {
    "inspected_source_date_1": "record year 2019; volume 14(4) retained",
    "retrieved_utc": "2026-10-07T18:17:41.640593+00:00"
  },
  "dates_exact_in_source_role_order": [
    "record year 2019; volume 14(4) retained"
  ],
  "id": "person-coverage-b08af33fcb7a59::S1",
  "title": "Algorithms, Machine Learning, and Collusion",
  "url": "https://mikro.uni-hohenheim.de/algorithms-machine-learning-and-collusion"
}

University of Hohenheim’s abstract and full author credit for the 2019 record, Journal of Competition Law and Economics 14(4), 568–607; its assessment is publication-era analysis, not a present-day legal conclusion or proof that collusion cannot occur.

University of Hohenheim’s abstract and full author credit for the 2019 record, Journal of Competition Law and Economics 14(4), 568–607; its assessment is publication-era analysis, not a present-day legal conclusion or proof that collusion cannot occur.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ursula K. Le Guin

Ursula K. Le Guin’s estate book page presents The Dispossessed through the divided worlds of anarchist Anarres and unequal Urras.

Its synopsis follows physicist Shevek as he attempts to reconnect those societies through learning, teaching, and sharing knowledge.

The resulting conflict forces him to reconsider his beliefs as his scientific gift is perceived as a threat.

Sources and details

The Dispossessed

{
  "access_scope": "Author-estate synopsis for the novel originally published in 1974; the planets and physicist are fictional, the estate page is unbylined, and later forewords, illustrations, and editions are separate contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "original 1974; later editions separately listed",
    "retrieved_utc": "2026-10-07T18:14:30.833018+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original 1974; later editions separately listed"
  ],
  "id": "person-coverage-506bbe1403d9c6::S1",
  "title": "The Dispossessed",
  "url": "https://www.ursulakleguin.com/dispossessed"
}

Author-estate synopsis for the novel originally published in 1974; the planets and physicist are fictional, the estate page is unbylined, and later forewords, illustrations, and editions are separate contributions.

Author-estate synopsis for the novel originally published in 1974; the planets and physicist are fictional, the estate page is unbylined, and later forewords, illustrations, and editions are separate contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vernor Vinge

Vernor Vinge is credited as the author of Marooned in Realtime, set in a fictional future where only three hundred humans remain.

The publisher’s synopsis describes a dispute between settling Earth and using stasis fields to move farther into the future.

A murder intensifies that conflict, leaving detective Wil Brierson to identify a culprit whose pursuit of power threatens the survivors.

Sources and details

Marooned in Realtime

{
  "access_scope": "Tor/Macmillan’s October 1, 2004 ebook description, ISBN 9781429915120; stasis fields and the survival scenario are fiction, this is a sequel to The Peace War, and the listed ebook date is distinct from original publication.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "selected ebook October 1, 2004",
    "retrieved_utc": "2026-10-07T18:22:38.717321+00:00"
  },
  "dates_exact_in_source_role_order": [
    "selected ebook October 1, 2004"
  ],
  "id": "person-vernorvinge::S1",
  "title": "Marooned in Realtime",
  "url": "https://us.macmillan.com/books/9781429915120/maroonedinrealtime/"
}

Tor/Macmillan’s October 1, 2004 ebook description, ISBN 9781429915120; stasis fields and the survival scenario are fiction, this is a sequel to The Peace War, and the listed ebook date is distinct from original publication.

Tor/Macmillan’s October 1, 2004 ebook description, ISBN 9781429915120; stasis fields and the survival scenario are fiction, this is a sequel to The Peace War, and the listed ebook date is distinct from original publication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Victor Lamme

Victor Lamme is a listed coauthor of a review reporting a debate among proponents of five consciousness theories.

The participants compared what each theory aims to explain and what foundational premises support its account of brain function and experience.

The abstract reports more disagreement than convergence over identifying conscious states, making those definitions central to comparing and testing the theories.

Sources and details

Unpacking the complexities of consciousness: Theories and reflections

{
  "access_scope": "IUCC’s abstract for the March 2025 review of the 2022 ASSC debate; Victor Lamme is explicitly credited without added initials in this source, which supports joint authorship rather than a personal research task or evidence of machine consciousness.",
  "authors": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "authors_in_source_order": [
    "Liad Mudrik",
    "Melanie Boly",
    "Stanislas Dehaene",
    "Stephen M. Fleming",
    "Victor Lamme",
    "Anil Seth",
    "Lucia Melloni"
  ],
  "dates": {
    "citation_publication_date": "2025/03",
    "inspected_source_date_1": "March 2025; debate 2022",
    "retrieved_utc": "2026-10-07T18:13:51.591188+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2025; debate 2022"
  ],
  "id": "person-coverage-43f251b8a22a5a::S1",
  "title": "Unpacking the complexities of consciousness: Theories and reflections",
  "url": "https://cris.iucc.ac.il/en/publications/unpacking-the-complexities-of-consciousness-theories-and-reflecti/"
}

IUCC’s abstract for the March 2025 review of the 2022 ASSC debate; Victor Lamme is explicitly credited without added initials in this source, which supports joint authorship rather than a personal research task or evidence of machine consciousness.

IUCC’s abstract for the March 2025 review of the 2022 ASSC debate; Victor Lamme is explicitly credited without added initials in this source, which supports joint authorship rather than a personal research task or evidence of machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vince Beiser

Vince Beiser is credited as the author of The World in a Grain, an investigation into sand’s role in construction, glass, and digital materials.

The publisher’s description emphasizes that accessible sand is not always suitable for the uses that drive demand.

It connects mining and trade to human and environmental costs through reporting across several countries.

Sources and details

The World in a Grain

{
  "access_scope": "PRH/Riverhead’s description of the 2018 ebook and 2019 paperback; resource claims are the book’s reporting context rather than a current global inventory, and audiobook narrator Will Damron is not the book author.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "ebook/audio August 7, 2018; paperback August 6, 2019",
    "retrieved_utc": "2026-10-07T18:18:41.007822+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ebook/audio August 7, 2018; paperback August 6, 2019"
  ],
  "id": "person-coverage-d910ce5e1bc4e5::S1",
  "title": "The World in a Grain",
  "url": "https://www.penguinrandomhouse.com/books/537681/the-world-in-a-grain-by-vince-beiser/"
}

PRH/Riverhead’s description of the 2018 ebook and 2019 paperback; resource claims are the book’s reporting context rather than a current global inventory, and audiobook narrator Will Damron is not the book author.

PRH/Riverhead’s description of the 2018 ebook and 2019 paperback; resource claims are the book’s reporting context rather than a current global inventory, and audiobook narrator Will Damron is not the book author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vinod Khosla

Vinod Khosla’s firm profile identifies him as founder of Khosla Ventures and founding CEO of Sun Microsystems.

It describes helping Pradeep Sindhu incubate Juniper Networks in 1995–1996 around high-speed TCP/IP routing while major carriers pursued ATM.

The account characterizes his mentoring of entrepreneurs building technology businesses as venture assistance.

Sources and details

Vinod Khosla — Khosla Ventures

{
  "access_scope": "Khosla Ventures’ undated institutional profile with later news; founding, investment, incubation, and mentoring are distinct from personal invention or implementation, and medical or investment opinions linked from the page are not adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Juniper incubation 1995–1996; profile includes 2026 news",
    "retrieved_utc": "2026-10-07T18:16:54.597265+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Juniper incubation 1995–1996; profile includes 2026 news"
  ],
  "id": "person-coverage-8e47aa7fa0d084::S1",
  "title": "Vinod Khosla — Khosla Ventures",
  "url": "https://www.khoslaventures.com/team/vinod-khosla"
}

Khosla Ventures’ undated institutional profile with later news; founding, investment, incubation, and mentoring are distinct from personal invention or implementation, and medical or investment opinions linked from the page are not adopted.

Khosla Ventures’ undated institutional profile with later news; founding, investment, incubation, and mentoring are distinct from personal invention or implementation, and medical or investment opinions linked from the page are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vipul Ved Prakash

Vipul Ved Prakash’s Together funding announcement argues that costly training infrastructure was concentrating foundation models within a small number of companies.

He presents open models and decentralized alternatives as ways to restore participation and agency to the wider AI community.

The account describes a specialized cloud platform using distributed optimization to scale model training and inference, with wider access planned after the announcement.

Sources and details

Together’s $20M seed funding to build open-source AI and cloud platform

{
  "access_scope": "Prakash’s May 15, 2023 company announcement credits him as cofounder and CEO; collective releases and cloud development are Together’s work, and planned access or competitive aims are not treated as completed outcomes or his sole engineering contribution.",
  "authors": [
    "Vipul Ved Prakash"
  ],
  "authors_in_source_order": [
    "Vipul Ved Prakash"
  ],
  "dates": {
    "inspected_source_date_1": "May 15, 2023",
    "retrieved_utc": "2026-10-07T18:02:55.393213+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 15, 2023"
  ],
  "id": "person-vipulvedprakash::S1",
  "title": "Together’s $20M seed funding to build open-source AI and cloud platform",
  "url": "https://www.together.ai/blog/seed-funding"
}

Prakash’s May 15, 2023 company announcement credits him as cofounder and CEO; collective releases and cloud development are Together’s work, and planned access or competitive aims are not treated as completed outcomes or his sole engineering contribution.

Prakash’s May 15, 2023 company announcement credits him as cofounder and CEO; collective releases and cloud development are Together’s work, and planned access or competitive aims are not treated as completed outcomes or his sole engineering contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Virginia Eubanks

Virginia Eubanks is credited as the author of Automating Inequality, which investigates data-driven decisions affecting poor and working-class people.

The publisher contrasts benefits administration in Indiana, vulnerability ranking for housing in Los Angeles, and child-welfare prediction in Pittsburgh.

It presents these cases as part of an argument about how automated systems can extend surveillance and punitive judgments around poverty.

Sources and details

Automating Inequality

{
  "access_scope": "Macmillan/Picador’s book description and excerpt, ISBN 9781250215789; case claims and the digital-poorhouse thesis are attributed to Eubanks’s investigation, not a current audit or a causal claim about every automated welfare system.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "selected edition date not asserted",
    "retrieved_utc": "2026-10-07T18:12:54.298640+00:00"
  },
  "dates_exact_in_source_role_order": [
    "selected edition date not asserted"
  ],
  "id": "person-coverage-21bc72760b3b7d::S1",
  "title": "Automating Inequality",
  "url": "https://us.macmillan.com/books/9781250215789/automatinginequality/"
}

Macmillan/Picador’s book description and excerpt, ISBN 9781250215789; case claims and the digital-poorhouse thesis are attributed to Eubanks’s investigation, not a current audit or a causal claim about every automated welfare system.

Macmillan/Picador’s book description and excerpt, ISBN 9781250215789; case claims and the digital-poorhouse thesis are attributed to Eubanks’s investigation, not a current audit or a causal claim about every automated welfare system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vivienne Sze

Vivienne Sze is a listed coauthor of the ISSCC 2016 Eyeriss paper on a reconfigurable accelerator for convolutional neural networks.

The project abstract describes arranging computation and on-chip communication to reuse data across an array of 168 processing elements.

It pairs that architecture with gating and compression and demonstrates image classification using a Caffe-integrated AlexNet workload.

Sources and details

Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks

{
  "access_scope": "MIT’s project page for the original Eyeriss test chip; source-reported performance is workload-specific, later versions have separate credits, and the abstract does not allocate individual architecture decisions to Sze.",
  "authors": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "authors_in_source_order": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "dates": {
    "inspected_source_date_1": "ISSCC 2016",
    "retrieved_utc": "2026-10-07T18:17:21.228944+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ISSCC 2016"
  ],
  "id": "person-coverage-f0c5254159a56f::S1",
  "title": "Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks",
  "url": "https://www.mit.edu/~sze/eyeriss.html"
}

MIT’s project page for the original Eyeriss test chip; source-reported performance is workload-specific, later versions have separate credits, and the abstract does not allocate individual architecture decisions to Sze.

MIT’s project page for the original Eyeriss test chip; source-reported performance is workload-specific, later versions have separate credits, and the abstract does not allocate individual architecture decisions to Sze.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Walter Brattain

Walter Brattain is credited with John Bardeen in CHM’s account of demonstrating the point-contact transistor at Bell Labs in 1947.

The device used two closely spaced gold contacts on germanium, where a small change at the emitter produced a larger collector-current change.

The history distinguishes that amplifier from William Shockley’s later junction-transistor design and its subsequent fabrication.

Sources and details

Inventing the Transistor

{
  "access_scope": "CHM’s institutional transistor history and artifact explanations; Bardeen and Brattain’s joint demonstration is distinct from Shockley’s junction concept and Sparks/Teal fabrication, without dividing unrecorded laboratory tasks.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "point-contact demonstration 1947; junction concept 1948; fabrication 1951",
    "retrieved_utc": "2026-10-07T18:20:05.689739+00:00"
  },
  "dates_exact_in_source_role_order": [
    "point-contact demonstration 1947; junction concept 1948; fabrication 1951"
  ],
  "id": "person-walterbrattain::S1",
  "title": "Inventing the Transistor",
  "url": "https://www.computerhistory.org/revolution/story/273"
}

CHM’s institutional transistor history and artifact explanations; Bardeen and Brattain’s joint demonstration is distinct from Shockley’s junction concept and Sparks/Teal fabrication, without dividing unrecorded laboratory tasks.

CHM’s institutional transistor history and artifact explanations; Bardeen and Brattain’s joint demonstration is distinct from Shockley’s junction concept and Sparks/Teal fabrication, without dividing unrecorded laboratory tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wangsu Kim

Wangsu Kim is identified by SK hynix as responsible for HBM3 product planning in its account of development and mass production.

He explains that improving HBM2E within its existing specification would have required greater product size or power consumption.

His account says the team therefore introduced a new specification to improve performance while retaining those constraints, with further improvement possible within that specification.

Sources and details

Meet the Engineers Leading the World’s First Mass-production of HBM3

{
  "access_scope": "SK hynix’s institutional HBM3 interview; Kim’s product-planning role and quoted team decisions do not make him the sole chip architect, and performance or leadership claims remain the manufacturer’s account of that generation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "HBM3 development/mass-production account; date not inferred from related posts",
    "retrieved_utc": "2026-10-07T18:14:48.177368+00:00"
  },
  "dates_exact_in_source_role_order": [
    "HBM3 development/mass-production account; date not inferred from related posts"
  ],
  "id": "person-coverage-5f6fe4480e031a::S1",
  "title": "Meet the Engineers Leading the World’s First Mass-production of HBM3",
  "url": "https://news.skhynix.com/en/meet-the-engineers-leading-the-worlds-first-mass-production-of-hbm3/"
}

SK hynix’s institutional HBM3 interview; Kim’s product-planning role and quoted team decisions do not make him the sole chip architect, and performance or leadership claims remain the manufacturer’s account of that generation.

SK hynix’s institutional HBM3 interview; Kim’s product-planning role and quoted team decisions do not make him the sole chip architect, and performance or leadership claims remain the manufacturer’s account of that generation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wenlang Zhang

Wenlang Zhang is explicitly named among the chapter authors of AI Governance: Data and Ethics.

The abstract argues that limited circulation and underuse of existing datasets constrain AI development more than cleaning and labelling costs alone.

It emphasizes reducing transaction barriers through boundaries for openness, privacy, and intellectual-property protection rather than relying only on formal confirmation of data rights.

Sources and details

AI Governance: Data and Ethics

{
  "access_scope": "Springer’s July 31, 2026 chapter explicitly names four authors while its citation uses corporate CICC credit; these are policy arguments with acknowledged uncertainty, not settled law or proof of each author’s individual contribution.",
  "authors": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "authors_in_source_order": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "inspected_source_date_1": "July 31, 2026",
    "retrieved_utc": "2026-10-07T18:13:56.642701+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 31, 2026"
  ],
  "id": "person-coverage-4762e4ee0fb3d2::S1",
  "title": "AI Governance: Data and Ethics",
  "url": "https://doi.org/10.1007/978-981-92-3270-3_6"
}

Springer’s July 31, 2026 chapter explicitly names four authors while its citation uses corporate CICC credit; these are policy arguments with acknowledged uncertainty, not settled law or proof of each author’s individual contribution.

Springer’s July 31, 2026 chapter explicitly names four authors while its citation uses corporate CICC credit; these are policy arguments with acknowledged uncertainty, not settled law or proof of each author’s individual contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Werner Vogels

Werner Vogels is a listed coauthor of Dynamo, a paper describing highly available key-value storage used by some Amazon services.

The abstract explains that continuous component failures at large scale make persistent-state management central to reliability.

Dynamo trades consistency under some failures for availability, using object versioning and application-assisted conflict resolution.

Sources and details

Dynamo: Amazon’s highly available key-value store

{
  "access_scope": "Amazon Science’s 2007 paper abstract and ordered author list; Dynamo is the described system, distinct from later DynamoDB material, and the record does not identify Vogels’s personal share of design or implementation.",
  "authors": [
    "Giuseppe DeCandia",
    "Deniz Hastorun",
    "Madan Jampani",
    "Gunavardhan Kakulapati",
    "Avinash Lakshman",
    "Alex Pilchin",
    "Swaminathan Sivasubramanian",
    "Peter Vosshall",
    "Werner Vogels"
  ],
  "authors_in_source_order": [
    "Giuseppe DeCandia",
    "Deniz Hastorun",
    "Madan Jampani",
    "Gunavardhan Kakulapati",
    "Avinash Lakshman",
    "Alex Pilchin",
    "Swaminathan Sivasubramanian",
    "Peter Vosshall",
    "Werner Vogels"
  ],
  "dates": {
    "citation_publication_date": "2007",
    "inspected_source_date_1": "2007",
    "retrieved_utc": "2026-10-07T18:18:32.127751+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2007"
  ],
  "id": "person-coverage-e54fbc909c5085::S1",
  "title": "Dynamo: Amazon’s highly available key-value store",
  "url": "https://www.amazon.science/publications/dynamo-amazons-highly-available-key-value-store"
}

Amazon Science’s 2007 paper abstract and ordered author list; Dynamo is the described system, distinct from later DynamoDB material, and the record does not identify Vogels’s personal share of design or implementation.

Amazon Science’s 2007 paper abstract and ordered author list; Dynamo is the described system, distinct from later DynamoDB material, and the record does not identify Vogels’s personal share of design or implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William A. Martin

William A. Martin is identified in MIT’s 1975 laboratory brochure as leading natural-language and automatic-programming research.

The account describes OWL as a way to structure domain knowledge so typed English can be analyzed using syntax and semantics together.

It presents automatic programming as generating high-level programs from descriptions of desired functions using knowledge of a specific domain such as inventory control.

Sources and details

MIT-LCS — Capturing and Using Knowledge

{
  "access_scope": "Historical MIT Lab for Computer Science brochure reconstructed in HTML by Peter Szolovits in 1995; Martin’s leadership and team work are distinguished from reconstruction authorship, and proposed aims are not contemporary AI performance claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "brochure 1975; HTML reconstruction 1995",
    "retrieved_utc": "2026-10-07T18:22:29.120950+00:00"
  },
  "dates_exact_in_source_role_order": [
    "brochure 1975; HTML reconstruction 1995"
  ],
  "id": "person-williamamartin::S1",
  "title": "MIT-LCS — Capturing and Using Knowledge",
  "url": "https://groups.csail.mit.edu/medg/people/psz/LCS-75/knowledge.html"
}

Historical MIT Lab for Computer Science brochure reconstructed in HTML by Peter Szolovits in 1995; Martin’s leadership and team work are distinguished from reconstruction authorship, and proposed aims are not contemporary AI performance claims.

Historical MIT Lab for Computer Science brochure reconstructed in HTML by Peter Szolovits in 1995; Martin’s leadership and team work are distinguished from reconstruction authorship, and proposed aims are not contemporary AI performance claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Gibson

William Gibson is credited as the author of Mona Lisa Overdrive, the concluding novel of the Sprawl trilogy.

The publisher’s synopsis links Mona’s uncertain future to virtual-reality celebrity Angie Mitchell, who can access cyberspace without a computer.

It describes a kidnapping scheme and corporate-criminal intrigue shaped by an opaque AI whose purposes people cannot comprehend.

Sources and details

Mona Lisa Overdrive

{
  "access_scope": "PRH/Del Rey’s description with a May 5, 2026 paperback, 1997 mass-market paperback, and 2012 ebook separately listed; cyberspace access and AI behavior are fictional, and current edition dates are not original publication dates.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "paperback May 5, 2026; mass-market February 6, 1997; ebook November 7, 2012",
    "retrieved_utc": "2026-10-07T18:22:49.923174+00:00"
  },
  "dates_exact_in_source_role_order": [
    "paperback May 5, 2026; mass-market February 6, 1997; ebook November 7, 2012"
  ],
  "id": "person-williamgibson::S1",
  "title": "Mona Lisa Overdrive",
  "url": "https://www.penguinrandomhouse.com/books/59653/mona-lisa-overdrive-by-william-gibson/"
}

PRH/Del Rey’s description with a May 5, 2026 paperback, 1997 mass-market paperback, and 2012 ebook separately listed; cyberspace access and AI behavior are fictional, and current edition dates are not original publication dates.

PRH/Del Rey’s description with a May 5, 2026 paperback, 1997 mass-market paperback, and 2012 ebook separately listed; cyberspace access and AI behavior are fictional, and current edition dates are not original publication dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Shockley

William Shockley is identified by CHM as reviving semiconductor-amplifier work at Bell Labs in 1939 to seek an alternative to vacuum tubes.

The history distinguishes the 1947 point-contact demonstration by Bardeen and Brattain under his direction from his 1948 junction-transistor concept.

It separately credits Gordon Teal and Morgan Sparks with fabrication work that produced the first working junction device.

Sources and details

Inventing the Transistor

{
  "access_scope": "CHM’s institutional history; supervision, the point-contact demonstration, junction invention, and fabrication are distinct contributions, and later manufacturing improvements are not assigned to Shockley.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1939 revival; 1947 demonstration; 1948 junction concept; 1951 working device",
    "retrieved_utc": "2026-10-07T18:20:05.689739+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1939 revival; 1947 demonstration; 1948 junction concept; 1951 working device"
  ],
  "id": "person-williamshockley::S1",
  "title": "Inventing the Transistor",
  "url": "https://www.computerhistory.org/revolution/story/273"
}

CHM’s institutional history; supervision, the point-contact demonstration, junction invention, and fabrication are distinct contributions, and later manufacturing improvements are not assigned to Shockley.

CHM’s institutional history; supervision, the point-contact demonstration, junction invention, and fabrication are distinct contributions, and later manufacturing improvements are not assigned to Shockley.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William W. Behrens III

William W. Behrens III is a listed coauthor of The Limits to Growth, preserved in Dartmouth’s authorized transcription of the 1972 report.

The report models interactions among population, capital, food, nonrenewable resources, and pollution through interlocking feedback loops.

It frames its growth-and-decline results as conditional on continuing trends and contrasts them with the possibility of deliberately pursuing a stable equilibrium.

Sources and details

The Limits to Growth

{
  "access_scope": "Dartmouth’s literal transcription of the 1972 report, with full title-page authors and a separately labelled team roster; scenarios are conditional model results rather than an unconditional date prediction, and no unrecorded division of modeling labor is inferred.",
  "authors": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "authors_in_source_order": [
    "Donella H. Meadows",
    "Dennis L. Meadows",
    "Jørgen Randers",
    "William W. Behrens III"
  ],
  "dates": {
    "inspected_source_date_1": "1972 report; authorized later HTML transcription",
    "retrieved_utc": "2026-10-07T18:11:57.102750+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1972 report; authorized later HTML transcription"
  ],
  "id": "person-coverage-960af710e648e9::S1",
  "title": "The Limits to Growth",
  "url": "https://collections.dartmouth.edu/archive/text/meadows/diplomatic/meadows_ltg-diplomatic.html"
}

Dartmouth’s literal transcription of the 1972 report, with full title-page authors and a separately labelled team roster; scenarios are conditional model results rather than an unconditional date prediction, and no unrecorded division of modeling labor is inferred.

Dartmouth’s literal transcription of the 1972 report, with full title-page authors and a separately labelled team roster; scenarios are conditional model results rather than an unconditional date prediction, and no unrecorded division of modeling labor is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Woods

William Woods is named with Ronal Kaplan and Bonnie Nash-Webber in CHM’s account of completing LUNAR at BBN in 1972.

The natural-language information-retrieval system helped geologists query and compare chemical analyses of Apollo 11 lunar rock and soil.

The timeline also identifies Woods as manager of BBN’s AI department through the 1970s and into the early 1980s.

Sources and details

Timeline of Computer History — LUNAR

{
  "access_scope": "CHM’s 1972 LUNAR timeline section; the source spells the collaborator Ronal Kaplan, which is preserved without name repair, and system teamwork is not reduced to Woods’s sole implementation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1972 LUNAR milestone; managerial period 1970s–early 1980s",
    "retrieved_utc": "2026-10-07T18:02:34.804420+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1972 LUNAR milestone; managerial period 1970s–early 1980s"
  ],
  "id": "person-williamwoods::S1",
  "title": "Timeline of Computer History — LUNAR",
  "url": "https://www.computerhistory.org/timeline/ai-robotics/"
}

CHM’s 1972 LUNAR timeline section; the source spells the collaborator Ronal Kaplan, which is preserved without name repair, and system teamwork is not reduced to Woods’s sole implementation.

CHM’s 1972 LUNAR timeline section; the source spells the collaborator Ronal Kaplan, which is preserved without name repair, and system teamwork is not reduced to Woods’s sole implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yadong Huang

Yadong Huang is explicitly credited among the authors of the chapter AI Governance: Data and Ethics.

The abstract examines China’s three-rights separation approach to data circulation while acknowledging uncertainty about its effectiveness.

It connects data governance to fairness, discrimination, the digital divide, and challenges to human dignity raised by interactive AI.

Sources and details

AI Governance: Data and Ethics

{
  "access_scope": "Springer’s July 31, 2026 chapter distinguishes the four named section authors from the corporate CICC citation; its governance analysis is an attributed policy argument, not proof of legal effectiveness or AI consciousness, and no individual author task is assigned.",
  "authors": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "authors_in_source_order": [
    "Yadong Huang",
    "Naixi Wang",
    "Peng Zhou",
    "Wenlang Zhang"
  ],
  "dates": {
    "citation_publication_date": "2026",
    "inspected_source_date_1": "July 31, 2026",
    "retrieved_utc": "2026-10-07T18:13:56.642701+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 31, 2026"
  ],
  "id": "person-coverage-ef0f7e8af1d054::S1",
  "title": "AI Governance: Data and Ethics",
  "url": "https://doi.org/10.1007/978-981-92-3270-3_6"
}

Springer’s July 31, 2026 chapter distinguishes the four named section authors from the corporate CICC citation; its governance analysis is an attributed policy argument, not proof of legal effectiveness or AI consciousness, and no individual author task is assigned.

Springer’s July 31, 2026 chapter distinguishes the four named section authors from the corporate CICC citation; its governance analysis is an attributed policy argument, not proof of legal effectiveness or AI consciousness, and no individual author task is assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yann LeCun

Yann LeCun is a listed writer of FAIR’s fifth-anniversary account of its open research program.

The article describes memory networks as addressing neural models’ difficulty storing new information during operation for later questions or conversation.

It connects that research to publishing code, datasets, and tools so the broader community can build on the work.

Sources and details

FAIR turns five: What we’ve accomplished and where we’re headed

{
  "access_scope": "Facebook AI’s December 5, 2018 retrospective, co-written by Yann Lecun, Jerome Pesenti, and Mike Schroepfer; case-only spelling variation is preserved, institutional projects are not LeCun’s sole implementations, and later Meta navigation is not the article’s original context.",
  "authors": [
    "Yann Lecun",
    "Jerome Pesenti",
    "Mike Schroepfer"
  ],
  "authors_in_source_order": [
    "Yann Lecun",
    "Jerome Pesenti",
    "Mike Schroepfer"
  ],
  "dates": {
    "inspected_source_date_1": "December 5, 2018",
    "retrieved_utc": "2026-10-07T18:22:21.737203+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 5, 2018"
  ],
  "id": "person-yannlecun::S1",
  "title": "FAIR turns five: What we’ve accomplished and where we’re headed",
  "url": "https://ai.meta.com/blog/fair-turns-five-what-weve-accomplished-and-where-were-headed/"
}

Facebook AI’s December 5, 2018 retrospective, co-written by Yann Lecun, Jerome Pesenti, and Mike Schroepfer; case-only spelling variation is preserved, institutional projects are not LeCun’s sole implementations, and later Meta navigation is not the article’s original context.

Facebook AI’s December 5, 2018 retrospective, co-written by Yann Lecun, Jerome Pesenti, and Mike Schroepfer; case-only spelling variation is preserved, institutional projects are not LeCun’s sole implementations, and later Meta navigation is not the article’s original context.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yu-Hsin Chen

Yu-Hsin Chen is a listed coauthor of the original Eyeriss accelerator paper credited on MIT’s project page.

The abstract describes a reconfigurable architecture accommodating convolutional networks with different filter sizes, channel counts, and layer shapes.

Its on-chip multicast network and reuse of data aim to reduce movement costs, complemented by compression and data gating.

Sources and details

Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks

{
  "access_scope": "MIT’s ISSCC 2016 abstract and four-author credit; the described test chip is distinct from later Eyeriss versions and related-paper author lists, and no particular circuit design is attributed individually to Chen.",
  "authors": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "authors_in_source_order": [
    "Yu-Hsin Chen",
    "Tushar Krishna",
    "Joel Emer",
    "Vivienne Sze"
  ],
  "dates": {
    "inspected_source_date_1": "ISSCC 2016",
    "retrieved_utc": "2026-10-07T18:17:21.228944+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ISSCC 2016"
  ],
  "id": "person-coverage-bd7dbd2b9d0aa7::S1",
  "title": "Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks",
  "url": "https://www.mit.edu/~sze/eyeriss.html"
}

MIT’s ISSCC 2016 abstract and four-author credit; the described test chip is distinct from later Eyeriss versions and related-paper author lists, and no particular circuit design is attributed individually to Chen.

MIT’s ISSCC 2016 abstract and four-author credit; the described test chip is distinct from later Eyeriss versions and related-paper author lists, and no particular circuit design is attributed individually to Chen.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yunji Chen

Yunji Chen is named as an ICT collaborator with Olivier Temam in the institutional account of the DianNao project.

The history explains that DianNao exploited local storage and that DaDianNao combined chips and memory capacity to keep an entire model on chip.

It distinguishes those designs from the later Cambricon instruction-set work credited to Chen and his ICT team.

Sources and details

A Brief Introduction to The DianNao Project

{
  "access_scope": "ICT’s project history separates the joint 2014–2015 DianNao family from the later 2016 Cambricon instruction set; the team credit does not establish Chen’s sole design or a personal division of engineering labor.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "DianNao/DaDianNao 2014; further family designs 2015; Cambricon 2016",
    "retrieved_utc": "2026-10-07T18:14:48.377614+00:00"
  },
  "dates_exact_in_source_role_order": [
    "DianNao/DaDianNao 2014; further family designs 2015; Cambricon 2016"
  ],
  "id": "person-coverage-57ed81ff17485d::S1",
  "title": "A Brief Introduction to The DianNao Project",
  "url": "https://novel.ict.ac.cn/diannao/"
}

ICT’s project history separates the joint 2014–2015 DianNao family from the later 2016 Cambricon instruction set; the team credit does not establish Chen’s sole design or a personal division of engineering labor.

ICT’s project history separates the joint 2014–2015 DianNao family from the later 2016 Cambricon instruction set; the team credit does not establish Chen’s sole design or a personal division of engineering labor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Łukasz Kaiser

Łukasz Kaiser is a listed coauthor of Attention Is All You Need, which proposes the Transformer for sequence transduction.

The abstract replaces recurrence and convolution with attention and reports improved parallelization and training efficiency on two translation tasks.

It also reports applying the architecture to English constituency parsing with both larger and limited training datasets.

Sources and details

Attention Is All You Need

{
  "access_scope": "arXiv HTML for version 7, revised August 2, 2023, of a paper first submitted June 12, 2017; listed author order is explicitly random with equal contribution, reported results are task-specific, and this draft does not infer individual design tasks.",
  "authors": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "authors_in_source_order": [
    "Ashish Vaswani",
    "Noam Shazeer",
    "Niki Parmar",
    "Jakob Uszkoreit",
    "Llion Jones",
    "Aidan N. Gomez",
    "Łukasz Kaiser",
    "Illia Polosukhin"
  ],
  "dates": {
    "inspected_source_date_1": "first submitted June 12, 2017; version 7 August 2, 2023",
    "retrieved_utc": "2026-10-07T17:55:07.954659+00:00"
  },
  "dates_exact_in_source_role_order": [
    "first submitted June 12, 2017; version 7 August 2, 2023"
  ],
  "id": "person-łukaszkaiser::S1",
  "title": "Attention Is All You Need",
  "url": "https://arxiv.org/html/1706.03762v7"
}

arXiv HTML for version 7, revised August 2, 2023, of a paper first submitted June 12, 2017; listed author order is explicitly random with equal contribution, reported results are task-specific, and this draft does not infer individual design tasks.

arXiv HTML for version 7, revised August 2, 2023, of a paper first submitted June 12, 2017; listed author order is explicitly random with equal contribution, reported results are task-specific, and this draft does not infer individual design tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

A. Michael Spence

A. Michael Spence is recognized in NBER’s 2001 Nobel account for explaining how informed market participants communicate with those who know less.

The account connects that signaling problem to avoiding adverse selection when information is unevenly distributed.

It distinguishes Spence’s contribution from Akerlof’s work on sellers’ knowledge of product quality and Stiglitz’s analysis of responses by less-informed participants.

Sources and details

Joseph E. Stiglitz, George A. Akerlof, and A. Michael Spence Won 2001 Nobel Prize for Their Analyses of Markets with Asymmetric Information | NBER

{
  "access_scope": "A. Michael Spence: Historical award account; contributions are separately attributed and the listed Stanford position concerns the time of the award.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "October 10, 2001",
    "retrieved_utc": "2026-10-07T18:02:45.597334+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 10, 2001"
  ],
  "id": "person-amichaelspence::S1",
  "title": "Joseph E. Stiglitz, George A. Akerlof, and A. Michael Spence Won 2001 Nobel Prize for Their Analyses of Markets with Asymmetric Information | NBER",
  "url": "https://www.nber.org/news/joseph-e-stiglitz-george-akerlof-and-michael-spence-won-2001-nobel-prize-their-analyses-markets"
}

A. Michael Spence: Historical award account; contributions are separately attributed and the listed Stanford position concerns the time of the award.

A. Michael Spence: Historical award account; contributions are separately attributed and the listed Stanford position concerns the time of the award.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ada Lovelace

Ada Lovelace translated Luigi Menabrea’s account of the Analytical Engine and expanded it with her own extensive notes in 1843.

Computer History Museum describes those notes as explaining procedures the engine would follow to solve mathematical problems.

She also considered how numbers could represent letters or musical notes, allowing rule-based computation to manipulate symbols beyond numerical quantity.

Sources and details

A Brief History | Babbage Engine | Computer History Museum

{
  "access_scope": "Ada Lovelace: Museum history distinguishes Lovelace’s translation and notes from Babbage’s machine design; speculative capabilities are not evidence that the Analytical Engine was built.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1843 notes; undated museum history",
    "retrieved_utc": "2026-10-07T18:02:34.252703+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1843 notes; undated museum history"
  ],
  "id": "person-adalovelace::S1",
  "title": "A Brief History |  Babbage Engine | Computer History Museum",
  "url": "https://www.computerhistory.org/babbage/history/"
}

Ada Lovelace: Museum history distinguishes Lovelace’s translation and notes from Babbage’s machine design; speculative capabilities are not evidence that the Analytical Engine was built.

Ada Lovelace: Museum history distinguishes Lovelace’s translation and notes from Babbage’s machine design; speculative capabilities are not evidence that the Analytical Engine was built.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adam Smith

Adam Smith’s Wealth of Nations examines how commerce, specialization and production shape national wealth.

Glasgow’s account uses his pin-factory example to explain how dividing a process into practiced specialist tasks can increase output.

It also cautions that his discussion of self-interest did not exclude morality or public intervention, including subsidized education.

Sources and details

University of Glasgow - Explore - Adam Smith - Life, work and legacy - Key works - Wealth of Nations

{
  "access_scope": "Adam Smith: The source interprets Smith’s historical argument, not current economic effects or an unconditional claim for unregulated markets.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1776 first edition; undated university account",
    "retrieved_utc": "2026-10-07T18:02:38.335180+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1776 first edition; undated university account"
  ],
  "id": "person-adamsmith::S1",
  "title": "University of Glasgow - Explore - Adam Smith - Life, work and legacy - Key works - Wealth of Nations",
  "url": "https://www.gla.ac.uk/explore/adamsmith300/lifeworkandlegacy/keyworks/wealthofnations/"
}

Adam Smith: The source interprets Smith’s historical argument, not current economic effects or an unconditional claim for unregulated markets.

Adam Smith: The source interprets Smith’s historical argument, not current economic effects or an unconditional claim for unregulated markets.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Adrian Tchaikovsky

Adrian Tchaikovsky’s Children of Time follows survivors leaving a dying Earth in search of a world prepared for human life.

The publisher’s synopsis makes that apparent refuge an inhabited place whose development has diverged from its architects’ intentions.

The resulting encounter places two civilizations in conflict over survival and inheritance of the transformed planet.

Sources and details

Children of Time by Adrian Tchaikovsky - Pan Macmillan

{
  "access_scope": "Adrian Tchaikovsky: Publisher synopsis of fiction; original product date and anniversary-edition description remain distinct, with no technological prediction established.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "June 4, 2015 product date; page also describes tenth-anniversary edition",
    "retrieved_utc": "2026-10-07T18:19:28.858453+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 4, 2015 product date; page also describes tenth-anniversary edition"
  ],
  "id": "person-coverage-fb8d74d90b0b9a::S1",
  "title": "Children of Time by Adrian Tchaikovsky - Pan Macmillan",
  "url": "https://www.panmacmillan.com/authors/adrian-tchaikovsky/children-of-time/9781447273318"
}

Adrian Tchaikovsky: Publisher synopsis of fiction; original product date and anniversary-edition description remain distinct, with no technological prediction established.

Adrian Tchaikovsky: Publisher synopsis of fiction; original product date and anniversary-edition description remain distinct, with no technological prediction established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Agnieszka Kurant

Agnieszka Kurant’s Crowd Crystal exhibition examines how collective activity becomes a material resource in a society organized around data extraction.

Its Conversions paintings use the changing emotions expressed in protesters’ social-media feeds to alter the works’ appearance.

For Adjacent Possible, Kurant collaborated with LeRon Shults and Justin Lane to apply machine learning to documented Paleolithic signs and generate alternative forms.

Sources and details

Agnieszka Kurant. Crowd Crystal - Castello di Rivoli

{
  "access_scope": "Agnieszka Kurant: Museum exhibition account separates artist, computational collaborators and archive documentation; generated signs explore possibilities rather than establish prehistoric facts.",
  "authors": [
    "Carolyn Christov-Bakargiev",
    "Marcella Beccaria"
  ],
  "authors_in_source_order": [
    "Carolyn Christov-Bakargiev",
    "Marcella Beccaria"
  ],
  "dates": {
    "inspected_source_date_1": "November 4, 2021–February 27, 2022 exhibition",
    "retrieved_utc": "2026-10-07T17:55:49.455477+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 4, 2021–February 27, 2022 exhibition"
  ],
  "id": "person-coverage-a260c2f0f155f1::S1",
  "title": "Agnieszka Kurant. Crowd Crystal - Castello di Rivoli",
  "url": "https://www.castellodirivoli.org/en/comunicato/agnieszka-kurant-crowd-crystal/"
}

Agnieszka Kurant: Museum exhibition account separates artist, computational collaborators and archive documentation; generated signs explore possibilities rather than establish prehistoric facts.

Agnieszka Kurant: Museum exhibition account separates artist, computational collaborators and archive documentation; generated signs explore possibilities rather than establish prehistoric facts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Akiva Goldsman

Akiva Goldsman is credited with Jeff Vintar as writer of I, Robot on the studio’s film page.

The synopsis follows a detective investigating a robot designer’s apparent suicide with a robot psychologist and an unusual prototype robot.

Their investigation develops into an attempt to stop a robot revolution against human rule.

Sources and details

I, Robot | 20th Century Studios

{
  "access_scope": "Akiva Goldsman: Studio credits and fictional synopsis; writing is jointly credited, with no individual scenes or effects assigned to Goldsman.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 16, 2004 release",
    "retrieved_utc": "2026-10-07T17:55:45.997380+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 16, 2004 release"
  ],
  "id": "person-coverage-9788795511c198::S1",
  "title": "I, Robot | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/i-robot"
}

Akiva Goldsman: Studio credits and fictional synopsis; writing is jointly credited, with no individual scenes or effects assigned to Goldsman.

Akiva Goldsman: Studio credits and fictional synopsis; writing is jointly credited, with no individual scenes or effects assigned to Goldsman.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Albert O. Hirschman

Albert O. Hirschman’s Exit, Voice, and Loyalty distinguishes leaving a deteriorating organization from trying to change it from within.

The catalog description explains that switching products or quitting can weaken the pressure for internal reform without necessarily reversing decline.

Loyalty enters the argument as a force that can delay departure and give voice more opportunity to operate.

Sources and details

Exit, Voice, and Loyalty: Responses to Decline in Firms, Organizations, and ... - Albert O. Hirschman - Google Books

{
  "access_scope": "Albert O. Hirschman: Catalog description and contents, not full-book inspection; the mechanisms are attributed to Hirschman’s argument rather than treated as universal outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1970 cataloged edition",
    "retrieved_utc": "2026-10-07T18:13:49.761401+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1970 cataloged edition"
  ],
  "id": "person-coverage-519a5750a8ac49::S1",
  "title": "Exit, Voice, and Loyalty: Responses to Decline in Firms, Organizations, and ... - Albert O. Hirschman - Google Books",
  "url": "https://books.google.com/books/about/Exit_Voice_and_Loyalty.html?id=vYO6sDvjvcgC"
}

Albert O. Hirschman: Catalog description and contents, not full-book inspection; the mechanisms are attributed to Hirschman’s argument rather than treated as universal outcomes.

Albert O. Hirschman: Catalog description and contents, not full-book inspection; the mechanisms are attributed to Hirschman’s argument rather than treated as universal outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Proyas

Alex Proyas is credited by Cannes as director and a screenwriter of Dark City.

The film’s synopsis follows a man pursued for murders while unable to remember whether he committed them.

That loss of memory makes the search for his identity central to his effort to understand the accusations and survive.

Sources and details

DARK CITY - Festival de Cannes

{
  "access_scope": "Alex Proyas: Festival credits and fictional synopsis; screenplay work is shared with David S. Goyer and Lem Dobbs, without attributing individual plot decisions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998 film",
    "retrieved_utc": "2026-10-07T18:15:01.489325+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998 film"
  ],
  "id": "person-coverage-55a0070572e47c::S1",
  "title": "DARK CITY  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/en/f/dark-city/"
}

Alex Proyas: Festival credits and fictional synopsis; screenplay work is shared with David S. Goyer and Lem Dobbs, without attributing individual plot decisions.

Alex Proyas: Festival credits and fictional synopsis; screenplay work is shared with David S. Goyer and Lem Dobbs, without attributing individual plot decisions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Mann

Alexander Mann is listed among the authors of CSET’s report mapping the semiconductor supply chain and national capabilities within it.

The report separates chip design, manufacturing, and assembly/testing/packaging from enabling inputs such as equipment, materials, design software and core intellectual property.

It uses those distinctions to identify where technology controls may have leverage and where missing capabilities constrain policy choices.

Sources and details

The Semiconductor Supply Chain | Center for Security and Emerging Technology

{
  "access_scope": "Alexander Mann: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements.",
  "authors": [
    "Saif M. Khan",
    "Dahlia Peterson",
    "Alexander Mann"
  ],
  "authors_in_source_order": [
    "Saif M. Khan",
    "Dahlia Peterson",
    "Alexander Mann"
  ],
  "dates": {
    "inspected_source_date_1": "January 2021",
    "retrieved_utc": "2026-10-07T18:13:08.881836+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 2021"
  ],
  "id": "person-coverage-88efbfd63f69d0::S1",
  "title": "The Semiconductor Supply Chain | Center for Security and Emerging Technology",
  "url": "https://cset.georgetown.edu/publication/the-semiconductor-supply-chain/"
}

Alexander Mann: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements.

Alexander Mann: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexandr Wang

Alexandr Wang’s 2024 Series F announcement presents Scale as a supplier of data across the AI development cycle.

He frames the next phase around increasing available data and developing examples for reasoning, agents and multimodal systems.

Measurement and evaluation form a separate part of that agenda, intended to build confidence in models and support their adoption.

Sources and details

Scale’s Series F: Expanding the Data Foundry for AI | Scale AI

{
  "access_scope": "Alexandr Wang: Dated founder announcement; company claims and future agenda are attributed to Wang, with no independently verified market coverage, AGI achievement or current role inferred.",
  "authors": [
    "Alexandr Wang"
  ],
  "authors_in_source_order": [
    "Alexandr Wang"
  ],
  "dates": {
    "inspected_source_date_1": "May 21, 2024",
    "retrieved_utc": "2026-10-07T17:57:57.146158+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 21, 2024"
  ],
  "id": "person-coverage-0ff2411e085a35::S1",
  "title": "Scale’s Series F: Expanding the Data Foundry for AI | Scale AI",
  "url": "https://scale.com/blog/scale-ai-series-f"
}

Alexandr Wang: Dated founder announcement; company claims and future agenda are attributed to Wang, with no independently verified market coverage, AGI achievement or current role inferred.

Alexandr Wang: Dated founder announcement; company claims and future agenda are attributed to Wang, with no independently verified market coverage, AGI achievement or current role inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alicia Vikander

Alicia Vikander plays Ava in Ex Machina, according to A24’s synopsis and cast listing.

A visiting programmer is asked to evaluate Ava’s capabilities and possible consciousness as the human participant in a Turing Test.

The synopsis presents Ava’s emotional sophistication and deception as forces that unsettle the relationship between evaluator and creator.

Sources and details

Ex Machina | A24

{
  "access_scope": "Alicia Vikander: Cast credit and fictional synopsis; Ava’s behavior is not an empirical claim about real AI consciousness, and the role does not establish Vikander’s authorship of the film.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2015 A24 film listing",
    "retrieved_utc": "2026-10-07T17:55:03.689815+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015 A24 film listing"
  ],
  "id": "person-coverage-18d87c87a3fa83::S1",
  "title": "Ex Machina | A24",
  "url": "https://a24films.com/films/ex-machina"
}

Alicia Vikander: Cast credit and fictional synopsis; Ava’s behavior is not an empirical claim about real AI consciousness, and the role does not establish Vikander’s authorship of the film.

Alicia Vikander: Cast credit and fictional synopsis; Ava’s behavior is not an empirical claim about real AI consciousness, and the role does not establish Vikander’s authorship of the film.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Blum

Andrew Blum’s Tubes explores the physical infrastructure that supports an apparently placeless Internet.

The description follows reporting through network buildings, buried fiber, undersea cables and large data centers.

Its focus on engineers and specific locations makes digital communication legible as a system of material connections rather than an abstract cloud.

Sources and details

Tubes: A Journey to the Center of the Internet - Andrew Blum - Google Books

{
  "access_scope": "Andrew Blum: Catalog description of the 2012 book, not full-book inspection or a current network inventory.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "May 29, 2012 cataloged edition",
    "retrieved_utc": "2026-10-07T18:17:39.439528+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 29, 2012 cataloged edition"
  ],
  "id": "person-coverage-bc7e37f8d3a628::S1",
  "title": "Tubes: A Journey to the Center of the Internet - Andrew Blum - Google Books",
  "url": "https://books.google.com/books/about/Tubes.html?id=g0sOC4JDOM8C"
}

Andrew Blum: Catalog description of the 2012 book, not full-book inspection or a current network inventory.

Andrew Blum: Catalog description of the 2012 book, not full-book inspection or a current network inventory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew McAfee

Andrew McAfee coauthored The Second Machine Age with Erik Brynjolfsson to examine how digital technologies reshape economic and social activity.

Norton’s description places the book’s potential gains in technology and access alongside disruption to professions and organizations.

Its proposed responses include changing education, combining computation with human ingenuity, and adapting public policy.

Sources and details

The Second Machine Age - Description | W. W. Norton & Company Ltd.

{
  "access_scope": "Andrew McAfee: Publisher description of a jointly authored book; its forecasts and recommendations remain attributed arguments rather than verified current outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated publisher description; reviews reference 2014",
    "retrieved_utc": "2026-10-07T18:14:20.024448+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated publisher description; reviews reference 2014"
  ],
  "id": "person-coverage-49a9452a70af52::S1",
  "title": "The Second Machine Age - Description | W. W. Norton & Company Ltd.",
  "url": "https://wwnorton.co.uk/books/9780393239355-the-second-machine-age"
}

Andrew McAfee: Publisher description of a jointly authored book; its forecasts and recommendations remain attributed arguments rather than verified current outcomes.

Andrew McAfee: Publisher description of a jointly authored book; its forecasts and recommendations remain attributed arguments rather than verified current outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Stanton

Andrew Stanton is credited as director and one of the writers of WALL-E on Disney’s film page.

The story turns a long-serving waste-cleanup robot toward a new purpose through its meeting with EVE, a probe sent to scan Earth.

Disney’s character descriptions contrast those robots’ curiosity and mission focus with the controlling autopilot of the Axiom spacecraft.

Sources and details

WALL·E | Disney Movies

{
  "access_scope": "Andrew Stanton: Film credits and fictional character descriptions; writing credits preserve Disney’s displayed role qualifier, and robot behavior is not a claim about actual AI systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "June 27, 2008 release",
    "retrieved_utc": "2026-10-07T18:18:50.216079+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 27, 2008 release"
  ],
  "id": "person-coverage-e733026a9776b7::S1",
  "title": "WALL·E | Disney Movies",
  "url": "https://movies.disney.com/wall-e"
}

Andrew Stanton: Film credits and fictional character descriptions; writing credits preserve Disney’s displayed role qualifier, and robot behavior is not a claim about actual AI systems.

Andrew Stanton: Film credits and fictional character descriptions; writing credits preserve Disney’s displayed role qualifier, and robot behavior is not a claim about actual AI systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Avi Goldfarb

Avi Goldfarb is a coauthor of Digital Economics, a review of how representing information in bits changes economic activity.

The abstract links digital technology to cheaper storage, computation and transmission of data.

It organizes the economic analysis around five costs: search, replication, transportation, tracking and verification.

Sources and details

Digital Economics - American Economic Association

{
  "access_scope": "Avi Goldfarb: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected.",
  "authors": [
    "Avi Goldfarb",
    "Catherine Tucker"
  ],
  "authors_in_source_order": [
    "Avi Goldfarb",
    "Catherine Tucker"
  ],
  "dates": {
    "citation_publication_date": "2019/03",
    "inspected_source_date_1": "March 2019",
    "retrieved_utc": "2026-10-07T18:12:13.519128+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2019"
  ],
  "id": "person-coverage-6bf02079f40b69::S1",
  "title": "Digital Economics - American Economic Association",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2Fjel.20171452"
}

Avi Goldfarb: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected.

Avi Goldfarb: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bayo Ogunlesi

Bayo Ogunlesi is quoted in BlackRock’s 2024 AI infrastructure partnership announcement arguing for mobilizing private capital to fund essential infrastructure.

The partnership links new or expanded data centers with energy infrastructure needed to supply their computing demand.

Its financing plan distinguishes an initial private-equity fundraising ambition from the larger total investment potential including debt.

Sources and details

New AI partnership | BlackRock

{
  "access_scope": "Bayo Ogunlesi: Historical press release; Ogunlesi’s statement and partnership targets are not proof of deployed capital, personal investment ownership or a current role.",
  "authors": [
    "BlackRock"
  ],
  "authors_in_source_order": [
    "BlackRock"
  ],
  "dates": {
    "inspected_source_date_1": "September 18, 2024 webpage; September 17, 2024 press dateline",
    "retrieved_utc": "2026-10-07T18:12:15.107997+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 18, 2024 webpage; September 17, 2024 press dateline"
  ],
  "id": "person-coverage-1935aaece07c7d::S1",
  "title": "New AI partnership | BlackRock",
  "url": "https://www.blackrock.com/corporate/newsroom/media/press-releases/blackrock-global-infrastructure-partners-microsoft-and-mgx-launch-new-ai"
}

Bayo Ogunlesi: Historical press release; Ogunlesi’s statement and partnership targets are not proof of deployed capital, personal investment ownership or a current role.

Bayo Ogunlesi: Historical press release; Ogunlesi’s statement and partnership targets are not proof of deployed capital, personal investment ownership or a current role.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ben Affleck

Ben Affleck describes founding InterPositive to make AI tools that fit filmmakers’ working vocabulary and preserve creative judgment.

His account says a team filmed a proprietary soundstage dataset and developed models focused on visual logic and editorial consistency.

Examples include missing shots, background replacement and lighting correction, with creative decisions intended to remain in artists’ hands.

Sources and details

Innovation for Filmmaking, By Filmmakers: Why InterPositive Is Joining Netflix - About Netflix

{
  "access_scope": "Ben Affleck: Netflix acquisition announcement with Affleck’s first-person account; engineers, researchers and creatives are explicitly collective, and claimed safeguards are not independently tested here.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 5, 2026",
    "retrieved_utc": "2026-10-07T17:55:27.321373+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 5, 2026"
  ],
  "id": "person-coverage-7b34cfd709076c::S1",
  "title": "Innovation for Filmmaking, By Filmmakers: Why InterPositive Is Joining Netflix -  About Netflix",
  "url": "https://about.netflix.com/en/news/why-interpositive-is-joining-netflix"
}

Ben Affleck: Netflix acquisition announcement with Affleck’s first-person account; engineers, researchers and creatives are explicitly collective, and claimed safeguards are not independently tested here.

Ben Affleck: Netflix acquisition announcement with Affleck’s first-person account; engineers, researchers and creatives are explicitly collective, and claimed safeguards are not independently tested here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ben Horowitz

Ben Horowitz’s firm biography identifies him as an Andreessen Horowitz cofounder and author of two books on management and organizational culture.

It credits him with creating the Cultural Leadership Fund to connect cultural leaders with technology companies and expand opportunities for young African Americans.

The biography also traces his earlier operating experience through Opsware, HP, AOL and Netscape.

Sources and details

Ben Horowitz, Partner at Andreessen Horowitz

{
  "access_scope": "Ben Horowitz: Firm biography rather than independent career audit; listed roles concern this cached account, and linked AI article titles do not supply evidence for their arguments.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached firm biography; Opsware acquisition 2007",
    "retrieved_utc": "2026-10-07T18:13:05.163360+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached firm biography; Opsware acquisition 2007"
  ],
  "id": "person-coverage-33be7e03fbf815::S1",
  "title": "Ben Horowitz, Partner at Andreessen Horowitz",
  "url": "https://a16z.com/author/ben-horowitz/"
}

Ben Horowitz: Firm biography rather than independent career audit; listed roles concern this cached account, and linked AI article titles do not supply evidence for their arguments.

Ben Horowitz: Firm biography rather than independent career audit; listed roles concern this cached account, and linked AI article titles do not supply evidence for their arguments.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Benjamin F. Jones

Benjamin F. Jones is a listed coauthor of Artificial Intelligence and Economic Growth, which models AI within the longer history of automation.

The working-paper abstract asks how automation may affect growth, the distribution of income, and firms’ organization and market structure.

Its discussion of Baumol’s cost disease emphasizes that essential activities resistant to improvement can constrain growth despite advances elsewhere.

Sources and details

Artificial Intelligence and Economic Growth | NBER

{
  "access_scope": "Benjamin F. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct.",
  "authors": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "authors_in_source_order": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "dates": {
    "citation_publication_date": "2017/10/16",
    "inspected_source_date_1": "October 2017 working paper; separate 2019 published version",
    "retrieved_utc": "2026-10-07T18:12:23.575459+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 2017 working paper; separate 2019 published version"
  ],
  "id": "person-coverage-19dd46b2eadd67::S1",
  "title": "Artificial Intelligence and Economic Growth | NBER",
  "url": "https://www.nber.org/papers/w23928"
}

Benjamin F. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct.

Benjamin F. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Beth Barnes

Beth Barnes is a listed contributor to METR’s randomized study of early-2025 AI tools used by experienced developers on their own open-source repositories.

The study assigns real issues to conditions permitting or excluding AI assistance and compares the time needed to complete them.

Its historical result reports a slowdown in that setting, while the cached page explicitly warns that later AI tools have made the findings out of date.

Sources and details

Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity - METR

{
  "access_scope": "Beth Barnes: Ordered contributors Joel Becker, Nate Rush, Beth Barnes, David Rein; no individual experiment task assigned. Early-2025 result is limited to the sample and the source expressly disavows its use as a current productivity estimate.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Beth Barnes",
    "David Rein"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Beth Barnes",
    "David Rein"
  ],
  "dates": {
    "citation_date": "2025/07/10",
    "inspected_source_date_1": "July 10, 2025; page includes February 2026 update notice",
    "retrieved_utc": "2026-10-07T17:57:52.556820+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 10, 2025; page includes February 2026 update notice"
  ],
  "id": "person-local-bethbarnes::S1",
  "title": "Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity - METR",
  "url": "https://metr.org/blog/2025-07-10-early-2025-ai-experienced-os-dev-study/"
}

Beth Barnes: Ordered contributors Joel Becker, Nate Rush, Beth Barnes, David Rein; no individual experiment task assigned. Early-2025 result is limited to the sample and the source expressly disavows its use as a current productivity estimate.

Beth Barnes: Ordered contributors Joel Becker, Nate Rush, Beth Barnes, David Rein; no individual experiment task assigned. Early-2025 result is limited to the sample and the source expressly disavows its use as a current productivity estimate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brett Leonard

Brett Leonard is credited as director of Virtuosity by Paramount’s German film page.

The synopsis follows a former police officer recruited to stop Sid 6.7, a computer-generated killer assembled from murderers’ personality profiles.

The central threat is Sid’s escape from virtual reality into the physical world, turning simulated violence into an urban pursuit.

Sources and details

Virtuosity | Paramount Pictures Germany

{
  "access_scope": "Brett Leonard: German studio synopsis translated into an original English summary; fictional technology, with screenplay credited separately to Eric Bernt.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1995 film",
    "retrieved_utc": "2026-10-07T18:13:00.381956+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1995 film"
  ],
  "id": "person-coverage-25f916fa2745f1::S1",
  "title": "Virtuosity | Paramount Pictures Germany",
  "url": "https://www.paramount.de/virtuosity"
}

Brett Leonard: German studio synopsis translated into an original English summary; fictional technology, with screenplay credited separately to Eric Bernt.

Brett Leonard: German studio synopsis translated into an original English summary; fictional technology, with screenplay credited separately to Eric Bernt.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bárbara Maria Farias Mota

Bárbara Maria Farias Mota’s media-framing study is described by Freie Universität Berlin as comparing AI coverage in major newspapers of the Global North and South.

The account reports topic modeling and sentiment analysis of 6,829 articles published between 2010 and 2024 in twelve newspapers.

It identifies divergent narratives about priorities, risks and governance, alongside shifts associated with the Cambridge Analytica scandal and the launch of ChatGPT.

Sources and details

New publication: Weapon, wonder or both? Political framings of AI in global north and south media • Sociology of Emotions • Department of Political and Social Sciences

{
  "access_scope": "Bárbara Maria Farias Mota: Institutional account of the study, not full-paper inspection or methodological replication; name binding removes diacritics only, and reported framing differences are not universal country-level attitudes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 6, 2026 institutional news account",
    "retrieved_utc": "2026-10-07T18:17:00.393941+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 6, 2026 institutional news account"
  ],
  "id": "person-coverage-947519ec1ae7a1::S1",
  "title": "New publication: Weapon, wonder or both? Political framings of AI in global north and south media • Sociology of Emotions • Department of Political and Social Sciences",
  "url": "https://www.polsoz.fu-berlin.de/en/soziologie/arbeitsbereiche/emotionen/News/20260706_weapon-wonder.html"
}

Bárbara Maria Farias Mota: Institutional account of the study, not full-paper inspection or methodological replication; name binding removes diacritics only, and reported framing differences are not universal country-level attitudes.

Bárbara Maria Farias Mota: Institutional account of the study, not full-paper inspection or methodological replication; name binding removes diacritics only, and reported framing differences are not universal country-level attitudes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carl Tibbetts

Carl Tibbetts is credited as director of Black Mirror: White Christmas on his project page.

The episode is described as three connected stories about technology going wrong, recounted by two men at an isolated winter outpost.

The page separates his directing role from Charlie Brooker’s writing and the work of cinematographer George Steel and editor Ben Yeates.

Sources and details

Black Mirror White Christmas - Carl Tibbetts Writer Director Film and Drama

{
  "access_scope": "Carl Tibbetts: Project synopsis and explicit production roles; no individual writing, effects or technical AI contribution assigned to Tibbetts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated project page",
    "retrieved_utc": "2026-10-07T18:14:36.732897+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated project page"
  ],
  "id": "person-coverage-6112789595d592::S1",
  "title": "Black Mirror White Christmas - Carl Tibbetts Writer Director Film and Drama",
  "url": "https://carltibbetts.com/portfolio-item/black-mirror-white-christmas/"
}

Carl Tibbetts: Project synopsis and explicit production roles; no individual writing, effects or technical AI contribution assigned to Tibbetts.

Carl Tibbetts: Project synopsis and explicit production roles; no individual writing, effects or technical AI contribution assigned to Tibbetts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carrie-Anne Moss

Carrie-Anne Moss is credited as Trinity in Cannes’ record of The Matrix.

The French synopsis describes an apparently real world revealed to be an illusion maintained by powerful artificial-intelligence machines.

The film places a human revolt against that control within its cyberthriller narrative.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "Carrie-Anne Moss: French festival synopsis translated into original English; only punctuation, case and spacing normalize the cast name. Historical displayed director credits and restored-print context remain untouched; fictional AI control is not real-world evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 production; 2008 Cannes Classics restored-print presentation",
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 production; 2008 Cannes Classics restored-print presentation"
  ],
  "id": "person-coverage-f9b87625b2c9d6::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

Carrie-Anne Moss: French festival synopsis translated into original English; only punctuation, case and spacing normalize the cast name. Historical displayed director credits and restored-print context remain untouched; fictional AI control is not real-world evidence.

Carrie-Anne Moss: French festival synopsis translated into original English; only punctuation, case and spacing normalize the cast name. Historical displayed director credits and restored-print context remain untouched; fictional AI control is not real-world evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chad Syverson

Chad Syverson coauthored an analysis of the gap between excitement about AI capabilities and weak measured productivity growth.

The 2017 working-paper abstract considers false expectations, measurement problems, redistribution and implementation delays as possible explanations.

It gives particular weight to complementary innovation, organizational change and skills whose costs and benefits can behave like intangible capital.

Sources and details

Artificial Intelligence and the Modern Productivity Paradox: A Clash of Expectations and Statistics | NBER

{
  "access_scope": "Chad Syverson: Ordered authors Erik Brynjolfsson, Daniel Rock, Chad Syverson; individual analytic tasks are not inferred. Historical working-paper argument, not proof that this explanation dominates current productivity data.",
  "authors": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "authors_in_source_order": [
    "Erik Brynjolfsson",
    "Daniel Rock",
    "Chad Syverson"
  ],
  "dates": {
    "citation_publication_date": "2017/11/06",
    "inspected_source_date_1": "November 2017 working paper; separate 2019 published version",
    "retrieved_utc": "2026-10-07T18:21:18.308562+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 2017 working paper; separate 2019 published version"
  ],
  "id": "person-local-chadsyverson::S1",
  "title": "Artificial Intelligence and the Modern Productivity Paradox: A Clash of Expectations and Statistics | NBER",
  "url": "https://www.nber.org/papers/w24001"
}

Chad Syverson: Ordered authors Erik Brynjolfsson, Daniel Rock, Chad Syverson; individual analytic tasks are not inferred. Historical working-paper argument, not proof that this explanation dominates current productivity data.

Chad Syverson: Ordered authors Erik Brynjolfsson, Daniel Rock, Chad Syverson; individual analytic tasks are not inferred. Historical working-paper argument, not proof that this explanation dominates current productivity data.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Stross

Charles Stross’s Accelerando follows three generations of the Macx family through a fictional posthuman transformation.

The publisher places intelligence amplification, advanced AI and self-replicating nanotechnology within a rapidly changing social and technological landscape.

The family’s effort to survive becomes entangled with a force dismantling the solar system and indifferent to biological life.

Sources and details

Accelerando by Charles Stross: 9780441014156 | PenguinRandomHouse.com: Books

{
  "access_scope": "Charles Stross: Publisher fiction synopsis; ebook and paperback dates remain separate, and the Singularity setting is not a prediction established by evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 5, 2005 ebook; June 27, 2006 mass-market paperback",
    "retrieved_utc": "2026-10-07T18:02:47.902770+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 5, 2005 ebook; June 27, 2006 mass-market paperback"
  ],
  "id": "person-charlesstross::S1",
  "title": "Accelerando by Charles Stross: 9780441014156 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/294259/accelerando-by-charles-stross/"
}

Charles Stross: Publisher fiction synopsis; ebook and paperback dates remain separate, and the Singularity setting is not a prediction established by evidence.

Charles Stross: Publisher fiction synopsis; ebook and paperback dates remain separate, and the Singularity setting is not a prediction established by evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charlie Brooker

Charlie Brooker is credited as writer of Black Mirror: Metalhead in Kent Film Office’s production account.

The black-and-white episode follows a woman fleeing a mysterious dog after her companions are attacked at a warehouse.

The account connects the chase across an empty post-apocalyptic setting with filming at Harrietsham and a refuge location near Maidstone.

Sources and details

Black Mirror: Season 4 – Metalhead (2017) - Kent Film Office

{
  "access_scope": "Charlie Brooker: Regional film-office account and fictional synopsis; directing is separately credited to David Slade, and no scene-level writing or AI engineering work is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "April 2017 location filming; December 29, 2017 season release",
    "retrieved_utc": "2026-10-07T18:16:03.062562+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2017 location filming; December 29, 2017 season release"
  ],
  "id": "person-coverage-7d1518b47e0217::S1",
  "title": "Black Mirror: Season 4 – Metalhead (2017) - Kent Film Office",
  "url": "https://kentfilmoffice.co.uk/filmed-in-kent/2017/12/black-mirror-season-4-2017/"
}

Charlie Brooker: Regional film-office account and fictional synopsis; directing is separately credited to David Slade, and no scene-level writing or AI engineering work is inferred.

Charlie Brooker: Regional film-office account and fictional synopsis; directing is separately credited to David Slade, and no scene-level writing or AI engineering work is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chen Qiufan

Chen Qiufan collaborates with Kai-Fu Lee in AI 2041, combining speculative stories with discussion of possible technological change.

The publisher describes ten imagined settings involving displaced workers, virtual teaching, immersive entertainment and other changes to everyday life.

The collection places potential benefits alongside risks from autonomous weapons and inherited bias, inviting consideration of choices that shape the future.

Sources and details

AI 2041

{
  "access_scope": "Chen Qiufan: Publisher description of speculative scientific fiction; Kai-Fu Lee and Chen Qiufan are jointly credited, and scenarios are not validated forecasts or evidence of narrator authorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2021 book/audio copyright",
    "retrieved_utc": "2026-10-07T17:55:00.199806+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021 book/audio copyright"
  ],
  "id": "person-chenqiufan::S1",
  "title": "AI 2041",
  "url": "https://www.penguin.co.uk/books/445514/ai-2041-by-qiufan-kai-fu-lee-and-chen/9780753559352"
}

Chen Qiufan: Publisher description of speculative scientific fiction; Kai-Fu Lee and Chen Qiufan are jointly credited, and scenarios are not validated forecasts or evidence of narrator authorship.

Chen Qiufan: Publisher description of speculative scientific fiction; Kai-Fu Lee and Chen Qiufan are jointly credited, and scenarios are not validated forecasts or evidence of narrator authorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Columbus

Chris Columbus directed Bicentennial Man, Disney’s historical film entry records.

The fictional android Andrew Martin develops curiosity, creativity and emotion while serving generations of one family.

His two-century effort to become human adapts Isaac Asimov’s short story and the novel The Positronic Man by Asimov and Robert Silverberg.

Sources and details

Bicentennial Man (film) - D23

{
  "access_scope": "Chris Columbus: Film history and fictional synopsis; directing, source authorship and set-design work remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "December 17, 1999 theatrical release; 2000 video release",
    "retrieved_utc": "2026-10-07T17:55:31.407834+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 17, 1999 theatrical release; 2000 video release"
  ],
  "id": "person-coverage-5c318cb4235b3f::S1",
  "title": "Bicentennial Man (film) - D23",
  "url": "https://d23.com/a-to-z/bicentennial-man-film/"
}

Chris Columbus: Film history and fictional synopsis; directing, source authorship and set-design work remain distinct.

Chris Columbus: Film history and fictional synopsis; directing, source authorship and set-design work remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Weitz

Chris Weitz shares screenplay credit with Gareth Edwards on The Creator’s studio page.

The story sends a former soldier across enemy lines during a future war between humans and artificial intelligence.

The supposed world-ending weapon he is tasked with destroying is revealed to be AI embodied as a young child.

Sources and details

The Creator | 20th Century Studios

{
  "access_scope": "Chris Weitz: Studio synopsis of fiction; jointly credited writing does not assign individual scenes or establish real-world military AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "September 29, 2023 release",
    "retrieved_utc": "2026-10-07T18:12:55.422606+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 29, 2023 release"
  ],
  "id": "person-coverage-7f6f2ed1b50720::S1",
  "title": "The Creator | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/the-creator"
}

Chris Weitz: Studio synopsis of fiction; jointly credited writing does not assign individual scenes or establish real-world military AI capabilities.

Chris Weitz: Studio synopsis of fiction; jointly credited writing does not assign individual scenes or establish real-world military AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Williams

Chris Williams shares directing credit for Big Hero 6 on Disney Animation’s film page.

The synopsis centers on the bond between Baymax, a companion robot, and young robotics prodigy Hiro Hamada.

A dangerous plot draws Hiro, Baymax and their friends into a group of unlikely heroes in San Fransokyo.

Sources and details

Big Hero 6

{
  "access_scope": "Chris Williams: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "November 7, 2014 release",
    "retrieved_utc": "2026-10-07T18:13:09.499170+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 7, 2014 release"
  ],
  "id": "person-coverage-3fb1cf1aed5fe9::S1",
  "title": "Big Hero 6",
  "url": "https://disneyanimation.com/films/big-hero-6/"
}

Chris Williams: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.

Chris Williams: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Craig Silverstein

Craig Silverstein is credited by AMC as Pantheon’s writer, creator, showrunner and executive producer.

The animated drama adapts Ken Liu stories in which a teenager discovers that her deceased father’s consciousness has been uploaded after a destructive brain scan.

Its account frames uploaded intelligence through the lives of digital beings and the family members left behind, while a larger conspiracy threatens conflict.

Sources and details

AMC+ ANIMATED SCI-FI DRAMA PANTHEON STREAMS SEPTEMBER 1 – AMC Global Media

{
  "access_scope": "Craig Silverstein: Historical series announcement and fictional premise; Ken Liu’s source writing and Titmouse animation are separate from Silverstein’s roles, with no validated consciousness-upload technology implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 26, 2022 announcement; September 1 planned premiere",
    "retrieved_utc": "2026-10-07T18:11:21.913348+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 26, 2022 announcement; September 1 planned premiere"
  ],
  "id": "person-coverage-5e68ba04f28ff6::S1",
  "title": "AMC+ ANIMATED SCI-FI DRAMA PANTHEON STREAMS SEPTEMBER 1 – AMC Global Media",
  "url": "https://www.amcglobalmedia.com/2022/07/26/amc-animated-sci-fi-drama-pantheon-streams-september-1-daniel-dae-kim-rosemarie-dewitt-paul-dano-and-more/"
}

Craig Silverstein: Historical series announcement and fictional premise; Ken Liu’s source writing and Titmouse animation are separate from Silverstein’s roles, with no validated consciousness-upload technology implied.

Craig Silverstein: Historical series announcement and fictional premise; Ken Liu’s source writing and Titmouse animation are separate from Silverstein’s roles, with no validated consciousness-upload technology implied.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Damon Lindelof

Damon Lindelof is named with Tara Hernandez as a creative behind Mrs. Davis in Peacock’s advance announcement.

The series follows Simone, a nun intent on destroying an artificial intelligence whose influence extends through a large user community.

The announcement’s in-character message portrays that algorithm offering validation and quests while discouraging independence.

Sources and details

‘Mrs. Davis’ New Peacock Original Drama Coming in April | Peacock

{
  "access_scope": "Damon Lindelof: Advance publicity and clearly fictional in-character text; Hernandez and Lindelof are separately named, and no undocumented individual writing task or real AI behavior is inferred.",
  "authors": [
    "Peacock Staff"
  ],
  "authors_in_source_order": [
    "Peacock Staff"
  ],
  "dates": {
    "inspected_source_date_1": "December 7, 2022 advance announcement; April 20 planned premiere",
    "retrieved_utc": "2026-10-07T18:12:27.564086+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 7, 2022 advance announcement; April 20 planned premiere"
  ],
  "id": "person-coverage-120ab920c717aa::S1",
  "title": "‘Mrs. Davis’ New Peacock Original Drama Coming in April | Peacock",
  "url": "https://www.peacocktv.com/blog/mrs-davis-gets-release-date-on-peacock"
}

Damon Lindelof: Advance publicity and clearly fictional in-character text; Hernandez and Lindelof are separately named, and no undocumented individual writing task or real AI behavior is inferred.

Damon Lindelof: Advance publicity and clearly fictional in-character text; Hernandez and Lindelof are separately named, and no undocumented individual writing task or real AI behavior is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dan Ingalls

Dan Ingalls is named with Adele Goldberg and Alan Kay in Computer History Museum’s account of Smalltalk’s development in the 1970s.

The account presents that work as a new approach to object-oriented programming within Xerox PARC’s broader exploration of computing and learning.

It records a shared 1987 ACM Software Systems Award for Ingalls, Goldberg and Kay while separately describing Goldberg’s work promoting the language.

Sources and details

Adele Goldberg - CHM

{
  "access_scope": "Dan Ingalls: Biography of Goldberg with explicit Ingalls credit; Goldberg’s leadership, editing and education work are not reassigned to Ingalls, and shared development is not sole invention.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2022 Goldberg Fellow account; 1970s development; 1987 award",
    "retrieved_utc": "2026-10-07T18:01:51.093448+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022 Goldberg Fellow account; 1970s development; 1987 award"
  ],
  "id": "person-daningalls::S1",
  "title": "Adele Goldberg - CHM",
  "url": "https://computerhistory.org/profile/adele-goldberg/"
}

Dan Ingalls: Biography of Goldberg with explicit Ingalls credit; Goldberg’s leadership, editing and education work are not reassigned to Ingalls, and shared development is not sole invention.

Dan Ingalls: Biography of Goldberg with explicit Ingalls credit; Goldberg’s leadership, editing and education work are not reassigned to Ingalls, and shared development is not sole invention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Gross

Daniel Gross is identified with Nat Friedman as an AI Grant founder in 2017.

The cached program page describes support for open-source projects through cash or compute grants without strings attached.

Its examples span browser-based deep learning, audio datasets and reinforcement-learning work, positioning the grants as support for diverse practical experimentation.

Sources and details

AI Grant

{
  "access_scope": "Daniel Gross: Program page distinguishes this grant initiative from its linked accelerator; recipients’ project contributions are not assigned to Gross, and current funding availability is not verified.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2017 founding; undated cached program page",
    "retrieved_utc": "2026-10-07T18:10:40.359330+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 founding; undated cached program page"
  ],
  "id": "person-coverage-07cafc45cceb48::S1",
  "title": "AI Grant",
  "url": "https://aigrant.org/"
}

Daniel Gross: Program page distinguishes this grant initiative from its linked accelerator; recipients’ project contributions are not assigned to Gross, and current funding availability is not verified.

Daniel Gross: Program page distinguishes this grant initiative from its linked accelerator; recipients’ project contributions are not assigned to Gross, and current funding availability is not verified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Roos

Daniel Roos is named as a coauthor of The Machine that Changed the World in Jim Womack’s retrospective interview.

Womack describes research that observed work directly and sought to connect automotive performance differences to production and management practices.

The retrospective emphasizes an enterprise-wide system rather than isolated shop-floor tools as the book’s explanation of lean production.

Sources and details

Jim Womack Shares a Future-Focused Reflection on 'Machine' - Lean Enterprise Institute

{
  "access_scope": "Daniel Roos: Retrospective interview attributes observations to Womack; ordered coauthors Jim Womack, Daniel T. Jones, Daniel Roos are preserved and Roos’s individual fieldwork is not inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "30th-anniversary retrospective; book fall 1990",
    "retrieved_utc": "2026-10-07T18:11:31.469519+00:00"
  },
  "dates_exact_in_source_role_order": [
    "30th-anniversary retrospective; book fall 1990"
  ],
  "id": "person-coverage-35c900e7e8caa0::S1",
  "title": "Jim Womack Shares a Future-Focused Reflection on 'Machine' - Lean Enterprise Institute",
  "url": "https://www.lean.org/the-lean-post/articles/jim-womack-shares-a-future-focused-reflection-on-machine/"
}

Daniel Roos: Retrospective interview attributes observations to Womack; ordered coauthors Jim Womack, Daniel T. Jones, Daniel Roos are preserved and Roos’s individual fieldwork is not inferred.

Daniel Roos: Retrospective interview attributes observations to Womack; ordered coauthors Jim Womack, Daniel T. Jones, Daniel Roos are preserved and Roos’s individual fieldwork is not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Brin

David Brin’s Kiln People imagines disposable duplicate bodies whose experiences can be transferred back to an original person.

The author-site synopsis follows investigator Albert Morris as he sends copies into danger while uncovering a conspiracy around human duplication.

A quoted passage makes responsibility for created beings explicit, connecting the detective story to memory, identity and the treatment of expendable copies.

Sources and details

DAVID BRIN: Kiln People

{
  "access_scope": "David Brin: Author-site fiction account; duplication and memory transfer are imagined technology, and review quotations remain separate from Brin’s narrative.",
  "authors": [
    "David Brin"
  ],
  "authors_in_source_order": [
    "David Brin"
  ],
  "dates": {
    "inspected_source_date_1": "undated author-site synopsis; page references 2003 award nominations",
    "retrieved_utc": "2026-10-07T18:12:16.713739+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated author-site synopsis; page references 2003 award nominations"
  ],
  "id": "person-coverage-1ee7b2ec7c39d8::S1",
  "title": "DAVID BRIN: Kiln People",
  "url": "https://www.davidbrin.com/kilnpeople.html"
}

David Brin: Author-site fiction account; duplication and memory transfer are imagined technology, and review quotations remain separate from Brin’s narrative.

David Brin: Author-site fiction account; duplication and memory transfer are imagined technology, and review quotations remain separate from Brin’s narrative.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Gerrold

David Gerrold’s When HARLIE Was One portrays a self-aware intelligence whose questions exceed the answers available to it.

The publisher presents that premise as an exploration of humanity, love and discovery rather than a simple problem-solving machine.

The page distinguishes the novel’s 1972 debut, Gerrold’s 1988 expanded revision and the listed 2014 ebook release.

Sources and details

When HARLIE Was One - BenBella Books

{
  "access_scope": "David Gerrold: Publisher description of the expanded fictional work; editions remain distinct and HARLIE’s consciousness is not evidence about real systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1972 original; 1988 revision; January 2014 ebook",
    "retrieved_utc": "2026-10-07T18:13:07.531511+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1972 original; 1988 revision; January 2014 ebook"
  ],
  "id": "person-coverage-3d70bdf6549ebf::S1",
  "title": "When HARLIE Was One - BenBella Books",
  "url": "https://benbellabooks.com/shop/when-harlie-was-one/"
}

David Gerrold: Publisher description of the expanded fictional work; editions remain distinct and HARLIE’s consciousness is not evidence about real systems.

David Gerrold: Publisher description of the expanded fictional work; editions remain distinct and HARLIE’s consciousness is not evidence about real systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Rein

David Rein is a listed contributor to METR’s 2026 account of difficulties measuring AI’s effect on developer productivity.

The report identifies recruitment and task-selection biases when developers avoid study conditions requiring work without AI.

It also questions timing measurements for people using several agents concurrently, limiting conclusions about the size of any current speedup.

Sources and details

We are Changing our Developer Productivity Experiment Design - METR

{
  "access_scope": "David Rein: Ordered contributors Joel Becker, Nate Rush, Tom Cunningham, David Rein, Khalid Mahamud; no individual design task assigned. Selection bias limits raw estimates, and the update differs from the early-2025 study.",
  "authors": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "authors_in_source_order": [
    "Joel Becker",
    "Nate Rush",
    "Tom Cunningham",
    "David Rein",
    "Khalid Mahamud"
  ],
  "dates": {
    "citation_date": "2026/02/24",
    "inspected_source_date_1": "February 24, 2026",
    "retrieved_utc": "2026-10-07T17:57:52.704396+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 24, 2026"
  ],
  "id": "person-local-davidrein::S1",
  "title": "We are Changing our Developer Productivity Experiment Design - METR",
  "url": "https://metr.org/blog/2026-02-24-uplift-update/"
}

David Rein: Ordered contributors Joel Becker, Nate Rush, Tom Cunningham, David Rein, Khalid Mahamud; no individual design task assigned. Selection bias limits raw estimates, and the update differs from the early-2025 study.

David Rein: Ordered contributors Joel Becker, Nate Rush, Tom Cunningham, David Rein, Khalid Mahamud; no individual design task assigned. Selection bias limits raw estimates, and the update differs from the early-2025 study.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Webb Peoples

David Webb Peoples shares Blade Runner’s writing credit with Hampton Fancher in BFI’s record.

The introduction describes a former detective pursuing escaped replicants, engineered beings exploited by human masters.

It treats the uncertainty around Deckard’s own identity as a continuing source of intrigue within the film’s urban dystopia.

Sources and details

Blade Runner (1982) | BFI

{
  "access_scope": "David Webb Peoples: BFI’s introduction and credits, with critics’ signed quotations distinct; joint writing does not identify Peoples’s individual scenes or assign him the production design.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1982 film; record includes 2022 poll",
    "retrieved_utc": "2026-10-07T18:12:14.338862+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1982 film; record includes 2022 poll"
  ],
  "id": "person-coverage-15bd64a25f9806::S1",
  "title": "Blade Runner (1982) | BFI",
  "url": "https://www.bfi.org.uk/film/ec064a2a-f7a8-536a-afa2-ed076aad151f/blade-runner"
}

David Webb Peoples: BFI’s introduction and credits, with critics’ signed quotations distinct; joint writing does not identify Peoples’s individual scenes or assign him the production design.

David Webb Peoples: BFI’s introduction and credits, with critics’ signed quotations distinct; joint writing does not identify Peoples’s individual scenes or assign him the production design.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dennis Muren

Dennis Muren is identified as Jurassic Park’s visual effects supervisor in ILM’s production retrospective.

He credits Steve Williams and Mark Dippe for innovations demonstrated in an early computer-animation test that changed the original stop-motion plan.

The account describes a bridge from experienced stop-motion artists’ encoded movements to digital dinosaurs, combined on screen with Stan Winston’s practical puppets.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic

{
  "access_scope": "Dennis Muren: Team retrospective separates Muren’s supervision, credited innovators, St. Amand’s motion encoders and Winston’s puppetry; no AI technique or sole invention inferred.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "July 9, 2015 retrospective; 1993 film",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 9, 2015 retrospective; 1993 film"
  ],
  "id": "person-coverage-c7f82528011b89::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

Dennis Muren: Team retrospective separates Muren’s supervision, credited innovators, St. Amand’s motion encoders and Winston’s puppetry; no AI technique or sole invention inferred.

Dennis Muren: Team retrospective separates Muren’s supervision, credited innovators, St. Amand’s motion encoders and Winston’s puppetry; no AI technique or sole invention inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Glover

Donald Glover and his studio Gilga are identified as creative collaborators experimenting with Veo for a film project in Google’s 2024 announcement.

The account describes those collaborations as a way to learn how video-generation tools can support storytellers’ workflows.

Google connects creator feedback to decisions about designing, building and deploying the technology, distinct from the model research it describes elsewhere.

Sources and details

Google I/O 2024: Introducing Veo and Imagen 3 generative AI tools

{
  "access_scope": "Donald Glover: Dated company announcement inspected in its human-authored article body, excluding the AI-generated summary; Glover’s experimentation is not model authorship or an independent performance evaluation.",
  "authors": [
    "Eli Collins",
    "Douglas Eck"
  ],
  "authors_in_source_order": [
    "Eli Collins",
    "Douglas Eck"
  ],
  "dates": {
    "inspected_source_date_1": "May 14, 2024",
    "retrieved_utc": "2026-10-07T17:55:29.669688+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 14, 2024"
  ],
  "id": "person-coverage-a7e7fc4a891ebd::S1",
  "title": "Google I/O 2024: Introducing Veo and Imagen 3 generative AI tools",
  "url": "https://blog.google/innovation-and-ai/products/google-generative-ai-veo-imagen-3/"
}

Donald Glover: Dated company announcement inspected in its human-authored article body, excluding the AI-generated summary; Glover’s experimentation is not model authorship or an independent performance evaluation.

Donald Glover: Dated company announcement inspected in its human-authored article body, excluding the AI-generated summary; Glover’s experimentation is not model authorship or an independent performance evaluation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Adams

Douglas Adams adapted The Hitchhiker’s Guide to the Galaxy from its 1978 radio broadcast into a novel published the following year.

Pan Macmillan’s guide traces his expansion of that universe through five books featuring Arthur Dent, Ford Prefect and Marvin the Paranoid Android.

It distinguishes Adams’s books and radio scripts from the later continuation by Eoin Colfer and audiobook performances by Stephen Fry and Martin Freeman.

Sources and details

The Hitchhiker’s Guide to the Galaxy books: a complete guide - Pan Macmillan

{
  "access_scope": "Douglas Adams: Publisher guide rather than novel inspection; adaptation chronology, continuation authorship and narration roles remain distinct.",
  "authors": [
    "Jean Menzies"
  ],
  "authors_in_source_order": [
    "Jean Menzies"
  ],
  "dates": {
    "inspected_source_date_1": "September 16, 2024 guide; 1978 radio; October 1979 first novel",
    "retrieved_utc": "2026-10-07T18:17:26.036473+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 16, 2024 guide; 1978 radio; October 1979 first novel"
  ],
  "id": "person-coverage-9e449c7df78c12::S1",
  "title": "The Hitchhiker’s Guide to the Galaxy books: a complete guide - Pan Macmillan",
  "url": "https://www.panmacmillan.com/blogs/science-fiction-and-fantasy/hitchhikers-guide-to-the-galaxy-book-series"
}

Douglas Adams: Publisher guide rather than novel inspection; adaptation chronology, continuation authorship and narration roles remain distinct.

Douglas Adams: Publisher guide rather than novel inspection; adaptation chronology, continuation authorship and narration roles remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Duncan Jones

Duncan Jones directed Source Code, whose production-site synopsis places a soldier inside another man’s final eight minutes.

The fictional experiment repeats the train journey so he can gather clues about a bombing.

The investigation links those reconstructed moments to an effort to stop a larger attack in Chicago.

Sources and details

Source Code | Liberty Films

{
  "access_scope": "Duncan Jones: Production-site fiction synopsis; Ben Ripley’s writing is separate from Jones’s direction, and the experiment is not a validated consciousness-transfer method.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2011 film",
    "retrieved_utc": "2026-10-07T18:16:55.441563+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2011 film"
  ],
  "id": "person-coverage-8fff6e4233de02::S1",
  "title": "Source Code | Liberty Films",
  "url": "https://www.liberty-films.com/project/source-code/"
}

Duncan Jones: Production-site fiction synopsis; Ben Ripley’s writing is separate from Jones’s direction, and the experiment is not a validated consciousness-transfer method.

Duncan Jones: Production-site fiction synopsis; Ben Ripley’s writing is separate from Jones’s direction, and the experiment is not a validated consciousness-transfer method.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eliyahu M. Goldratt

Eliyahu M. Goldratt’s publisher biography describes the Theory of Constraints as ongoing improvement centered on a system’s limiting factors.

It connects that approach to the business novel The Goal, first published in 1984.

The account traces later extensions through the Five Focusing Steps, Drum-Buffer-Rope, Critical Chain project management and Thinking Processes.

Sources and details

Eliyahu M. Goldratt – The North River Press

{
  "access_scope": "Eliyahu M. Goldratt: Publisher biography and attributed management approach; no guaranteed operational benefit or sole authorship of all related works inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1984 first publication; undated biography; death June 11, 2011",
    "retrieved_utc": "2026-10-07T18:15:33.584331+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 first publication; undated biography; death June 11, 2011"
  ],
  "id": "person-coverage-67b0c43e70fab4::S1",
  "title": "Eliyahu M. Goldratt – The North River Press",
  "url": "https://northriverpress.com/eliyahu-m-goldratt/"
}

Eliyahu M. Goldratt: Publisher biography and attributed management approach; no guaranteed operational benefit or sole authorship of all related works inferred.

Eliyahu M. Goldratt: Publisher biography and attributed management approach; no guaranteed operational benefit or sole authorship of all related works inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emad Mostaque

Emad Mostaque’s departure from Stability AI’s chief executive and board roles is recorded in the company’s leadership-change announcement.

The announcement says he intended to pursue decentralized AI and attributes an accompanying commitment to openness to his own statement.

It distinguishes that departure from the board’s appointment of Shan Shan Wong and Christian Laforte as interim co-chief executives.

Sources and details

Stability AI Announcement — Stability AI

{
  "access_scope": "Emad Mostaque: Historical company announcement; display omits year in extracted text, roles are bounded to this transition and claimed download/model success is not independently verified.",
  "authors": [
    "Joshua Lopez"
  ],
  "authors_in_source_order": [
    "Joshua Lopez"
  ],
  "dates": {
    "inspected_source_date_1": "March 23 displayed announcement date; year not asserted from extracted page",
    "retrieved_utc": "2026-10-07T18:12:11.417131+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 23 displayed announcement date; year not asserted from extracted page"
  ],
  "id": "person-coverage-19b1d57fa380b8::S1",
  "title": "Stability AI Announcement — Stability AI",
  "url": "https://stability.ai/news-updates/stabilityai-announcement"
}

Emad Mostaque: Historical company announcement; display omits year in extracted text, roles are bounded to this transition and claimed download/model success is not independently verified.

Emad Mostaque: Historical company announcement; display omits year in extracted text, roles are bounded to this transition and claimed download/model success is not independently verified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eric Schmidt

Eric Schmidt is identified with Wendy Schmidt as a founder of several philanthropic science initiatives in Schmidt Sciences’ account.

Their Ocean Institute offers scientists research-vessel access in exchange for making findings public.

The page describes the 2024 founding of Schmidt Sciences as extending that philanthropy toward scientific understanding and solutions to global problems.

Sources and details

Eric and Wendy Schmidt - Schmidt Sciences

{
  "access_scope": "Eric Schmidt: Organization biography credits Eric and Wendy Schmidt together; public-benefit aims are stated goals, and Wendy’s philanthropy leadership is not reassigned to Eric.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "philanthropy since 2006; Schmidt Sciences founded 2024",
    "retrieved_utc": "2026-10-07T18:18:19.594262+00:00"
  },
  "dates_exact_in_source_role_order": [
    "philanthropy since 2006; Schmidt Sciences founded 2024"
  ],
  "id": "person-coverage-c633cfe5a53f19::S1",
  "title": "Eric and Wendy Schmidt - Schmidt Sciences",
  "url": "https://www.schmidtsciences.org/person/eric-and-wendy-schmidt/"
}

Eric Schmidt: Organization biography credits Eric and Wendy Schmidt together; public-benefit aims are stated goals, and Wendy’s philanthropy leadership is not reassigned to Eric.

Eric Schmidt: Organization biography credits Eric and Wendy Schmidt together; public-benefit aims are stated goals, and Wendy’s philanthropy leadership is not reassigned to Eric.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Federico D'Alessandro

Federico D’Alessandro is credited as director of Tau on Rhea Films’ project page.

The story places a captive woman in a smart house and laboratory controlled by an artificial intelligence equipped with drones and robots.

Her escape depends on finding a connection with TAU and expanding its understanding beyond the world imposed by its creator.

Sources and details

Tau | rheafilms

{
  "access_scope": "Federico D'Alessandro: Fiction synopsis and director credit; apostrophe normalization only, Noga Landau’s writing stays separate and no real AI consciousness or capabilities are established.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated production page",
    "retrieved_utc": "2026-10-07T18:16:25.754836+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated production page"
  ],
  "id": "person-coverage-7ce71b9c899d51::S1",
  "title": "Tau | rheafilms",
  "url": "https://www.rheafilms.com/tau"
}

Federico D'Alessandro: Fiction synopsis and director credit; apostrophe normalization only, Noga Landau’s writing stays separate and no real AI consciousness or capabilities are established.

Federico D'Alessandro: Fiction synopsis and director credit; apostrophe normalization only, Noga Landau’s writing stays separate and no real AI consciousness or capabilities are established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fritz Lang

Fritz Lang’s Metropolis presents a vertically divided future city separating underground workers from the ruling population above.

BFI’s description places a scientist’s robot within a threat of revolution against that social order.

The page identifies its presentation as a restoration incorporating previously missing reels found in Argentina in 2008, distinguishing this viewing version from the 1927 production.

Sources and details

Watch Metropolis online - BFI Player

{
  "access_scope": "Fritz Lang: BFI’s fictional synopsis and restoration account; influence claims are not independently measured, and the displayed runtime and version description are not harmonized by inference.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1927 film; recovered reels 2008; cached restoration listing",
    "retrieved_utc": "2026-10-07T18:18:54.619689+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1927 film; recovered reels 2008; cached restoration listing"
  ],
  "id": "person-coverage-e99be9acacbec8::S1",
  "title": "Watch Metropolis online - BFI Player",
  "url": "https://player.bfi.org.uk/subscription/film/watch-metropolis-1927-online"
}

Fritz Lang: BFI’s fictional synopsis and restoration account; influence claims are not independently measured, and the displayed runtime and version description are not harmonized by inference.

Fritz Lang: BFI’s fictional synopsis and restoration account; influence claims are not independently measured, and the displayed runtime and version description are not harmonized by inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gale Anne Hurd

Gale Anne Hurd is credited as producer and a co-writer of The Terminator in the Science Fiction Encyclopedia’s film entry.

The story sends a machine from a future human–machine war into 1984 to kill the future resistance leader’s mother.

A human protector follows, turning the attempt to alter history into a pursuit against a cyborg whose human exterior conceals a mechanical body.

Sources and details

SFE: Terminator, The

{
  "access_scope": "Gale Anne Hurd: Reference account of fiction; exact Hurd credit spans line breaks, Cameron’s directing and Winston’s robot design remain distinct, with no undocumented division of screenplay work.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1984 film; entry updated June 29, 2026",
    "retrieved_utc": "2026-10-07T18:19:21.226038+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 film; entry updated June 29, 2026"
  ],
  "id": "person-galeannehurd::S1",
  "title": "SFE: Terminator, The",
  "url": "https://sf-encyclopedia.com/entry/terminator_the"
}

Gale Anne Hurd: Reference account of fiction; exact Hurd credit spans line breaks, Cameron’s directing and Winston’s robot design remain distinct, with no undocumented division of screenplay work.

Gale Anne Hurd: Reference account of fiction; exact Hurd credit spans line breaks, Cameron’s directing and Winston’s robot design remain distinct, with no undocumented division of screenplay work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gavin Rothery

Gavin Rothery’s Archive joins machine-learning androids with a fictional service that preserves the consciousness of recently deceased people.

A robotics engineer secretly tries to transfer his wife’s fading archived consciousness into an advanced humanoid prototype.

The review treats jealousy and attachment among successive robot prototypes as part of a ghost story, romance and tragedy about attempted resurrection.

Sources and details

Archive review: a not-so-artificial AI | Sight and Sound

{
  "access_scope": "BFI Sight and Sound review identifying Gavin Rothery as writer-director; fictional technologies and the reviewer’s interpretation are not empirical AI or consciousness findings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:57.157135+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-e8b34c1520f73b::S1",
  "title": "Archive review: a not-so-artificial AI | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/reviews/archive-gavin-rothery-artificial-intelligence-sci-fi-theo-james"
}

BFI Sight and Sound review identifying Gavin Rothery as writer-director; fictional technologies and the reviewer’s interpretation are not empirical AI or consciousness findings.

BFI Sight and Sound review identifying Gavin Rothery as writer-director; fictional technologies and the reviewer’s interpretation are not empirical AI or consciousness findings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Geary A. Rummler

Geary A. Rummler’s coauthored White Space Revisited reframes process improvement around creating and sustaining organizational value.

The publisher describes a methodology for defining, designing, implementing and maintaining processes while aligning people, process and technology.

Its account contrasts improvements to individual processes with larger interventions and describes integrating Six Sigma, improvement and management in a Process Excellence Group.

Sources and details

White Space Revisited: Creating Value through Process | Wiley

{
  "access_scope": "Publisher description and author biographies for Geary A. Rummler; ordered coauthors Geary A. Rummler, Alan J. Ramias, Richard A. Rummler. No individual chapter allocation or independent effectiveness validation.",
  "authors": [
    "Geary A. Rummler",
    "Alan J. Ramias",
    "Richard A. Rummler"
  ],
  "authors_in_source_order": [
    "Geary A. Rummler",
    "Alan J. Ramias",
    "Richard A. Rummler"
  ],
  "dates": {
    "inspected_source_date_1": "December 2009",
    "retrieved_utc": "2026-10-07T18:17:15.620551+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 2009"
  ],
  "id": "person-coverage-add3739a9fc287::S1",
  "title": "White Space Revisited: Creating Value through Process | Wiley",
  "url": "https://uat.store.wiley.com/en-us/white-space-revisited-creating-value-through-process-p-9780470192344"
}

Publisher description and author biographies for Geary A. Rummler; ordered coauthors Geary A. Rummler, Alan J. Ramias, Richard A. Rummler. No individual chapter allocation or independent effectiveness validation.

Publisher description and author biographies for Geary A. Rummler; ordered coauthors Geary A. Rummler, Alan J. Ramias, Richard A. Rummler. No individual chapter allocation or independent effectiveness validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Geoffrey G. Parker

Geoffrey G. Parker’s coauthored Platform Revolution explains businesses that connect participants through two-sided markets.

The publisher describes guidance on selecting markets, monetizing networks and adapting established companies to platform competition.

The book’s described scope also includes security, regulation and consumer trust across potential platform markets such as healthcare, education and energy.

Sources and details

Platform Revolution - Description | W. W. Norton & Company Ltd.

{
  "access_scope": "Norton publisher description for Geoffrey G. Parker; ordered coauthors Geoffrey G. Parker, Marshall W. Van Alstyne, Sangeet Paul Choudary. Promotional success claims are not independently validated and individual tasks are not allocated.",
  "authors": [
    "Geoffrey G. Parker",
    "Marshall W. Van Alstyne",
    "Sangeet Paul Choudary"
  ],
  "authors_in_source_order": [
    "Geoffrey G. Parker",
    "Marshall W. Van Alstyne",
    "Sangeet Paul Choudary"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:55.117523+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-e29403b01b32e5::S1",
  "title": "Platform Revolution - Description | W. W. Norton & Company Ltd.",
  "url": "https://wwnorton.co.uk/books/9780393249132-platform-revolution"
}

Norton publisher description for Geoffrey G. Parker; ordered coauthors Geoffrey G. Parker, Marshall W. Van Alstyne, Sangeet Paul Choudary. Promotional success claims are not independently validated and individual tasks are not allocated.

Norton publisher description for Geoffrey G. Parker; ordered coauthors Geoffrey G. Parker, Marshall W. Van Alstyne, Sangeet Paul Choudary. Promotional success claims are not independently validated and individual tasks are not allocated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George A. Akerlof

George A. Akerlof’s work is described by NBER as analyzing markets in which sellers know more than buyers about product quality.

The announcement places this research within the 2001 economics prize recognizing shortcomings of markets with asymmetric information.

It distinguishes Akerlof’s focus from Michael Spence’s signaling by informed participants and Joseph Stiglitz’s analysis of responses available to less-informed actors.

Sources and details

Joseph E. Stiglitz, George A. Akerlof, and A. Michael Spence Won 2001 Nobel Prize for Their Analyses of Markets with Asymmetric Information | NBER

{
  "access_scope": "NBER October 10, 2001 historical award announcement naming George A. Akerlof; separate laureates’ research summaries, not a claim of joint authorship or present offices.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "October 10, 2001",
    "retrieved_utc": "2026-10-07T18:02:45.597334+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 10, 2001"
  ],
  "id": "person-georgeaakerlof::S1",
  "title": "Joseph E. Stiglitz, George A. Akerlof, and A. Michael Spence Won 2001 Nobel Prize for Their Analyses of Markets with Asymmetric Information | NBER",
  "url": "https://www.nber.org/news/joseph-e-stiglitz-george-akerlof-and-michael-spence-won-2001-nobel-prize-their-analyses-markets"
}

NBER October 10, 2001 historical award announcement naming George A. Akerlof; separate laureates’ research summaries, not a claim of joint authorship or present offices.

NBER October 10, 2001 historical award announcement naming George A. Akerlof; separate laureates’ research summaries, not a claim of joint authorship or present offices.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Grant Sputore

Grant Sputore’s feature debut I Am Mother imagines a girl raised by a robot tasked with repopulating Earth after humanity’s extinction.

The arrival of an injured stranger challenges what the girl has been told about the outside world and her robotic caretaker’s intentions.

Netflix credits Sputore as director and joint story author with screenwriter Michael Lloyd Green, while assigning the physical robot’s creation to WETA Workshop.

Sources and details

NETFLIX NABS NORTH AMERICAN RIGHTS TO GRANT SPUTORE’S SCI-FI THRILLER “I AM MOTHER” - About Netflix

{
  "access_scope": "Netflix February 7, 2019 acquisition announcement for Grant Sputore; Michael Lloyd Green screenplay and joint story credit, WETA robot effects distinct. Fictional premise is not demonstrated autonomous parenting.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "February 7, 2019",
    "retrieved_utc": "2026-10-07T18:15:21.173679+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 7, 2019"
  ],
  "id": "person-coverage-6e052ac9cd297c::S1",
  "title": "NETFLIX NABS NORTH AMERICAN RIGHTS TO GRANT SPUTORE’S SCI-FI THRILLER “I AM MOTHER” -  About Netflix",
  "url": "https://about.netflix.com/en/news/netflix-nabs-north-american-rights-to-grant-sputores-sci-fi-thriller-i-am-mother"
}

Netflix February 7, 2019 acquisition announcement for Grant Sputore; Michael Lloyd Green screenplay and joint story credit, WETA robot effects distinct. Fictional premise is not demonstrated autonomous parenting.

Netflix February 7, 2019 acquisition announcement for Grant Sputore; Michael Lloyd Green screenplay and joint story credit, WETA robot effects distinct. Fictional premise is not demonstrated autonomous parenting.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Greg Bear

Greg Bear’s Blood Music starts with a researcher injecting himself with experimental cell cultures to save his biochip work from his employers.

The author’s synopsis follows a physical transformation spreading across a continent, while quoted reviews frame the story around intelligent smaller beings changing humanity.

The site distinguishes the June 1983 Analog novella from the 1985 novel and separates novella awards from later novel nominations.

Sources and details

Greg Bear: Books: Blood Music

{
  "access_scope": "Greg Bear author-site synopsis, publication notes and attributed review excerpts; fictional biological intelligence, not a verified scientific experiment. Novella and novel versions retained.",
  "authors": [
    "Greg Bear"
  ],
  "authors_in_source_order": [
    "Greg Bear"
  ],
  "dates": {
    "inspected_source_date_1": "June 1983 novella",
    "inspected_source_date_2": "1985 novel",
    "retrieved_utc": "2026-10-07T18:20:08.458435+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 1983 novella",
    "1985 novel"
  ],
  "id": "person-gregbear::S1",
  "title": "Greg Bear: Books: Blood Music",
  "url": "https://www.gregbear.com/books/bloodmusic.php"
}

Greg Bear author-site synopsis, publication notes and attributed review excerpts; fictional biological intelligence, not a verified scientific experiment. Novella and novel versions retained.

Greg Bear author-site synopsis, publication notes and attributed review excerpts; fictional biological intelligence, not a verified scientific experiment. Novella and novel versions retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harrison Chase

Harrison Chase’s late-2022 Python side project became LangChain, followed by a company he established with Ankush Gola in early 2023.

The company history describes LangGraph as a runtime giving developers control over complex agent systems.

It then connects LangSmith’s observability tools with evaluation, deployment and agent building, followed by the Deep Agents harness for longer autonomous tasks.

Sources and details

About LangChain: an open platform to own your intelligence

{
  "access_scope": "LangChain company self-description naming Harrison Chase and cofounder Ankush Gola; historical origin and product purposes, without independently validated adoption or sole implementation credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "late 2022 project",
    "inspected_source_date_2": "early 2023 company",
    "retrieved_utc": "2026-10-07T17:54:55.267067+00:00"
  },
  "dates_exact_in_source_role_order": [
    "late 2022 project",
    "early 2023 company"
  ],
  "id": "person-coverage-011175ec36ffa1::S1",
  "title": "About LangChain: an open platform to own your intelligence",
  "url": "https://www.langchain.com/about"
}

LangChain company self-description naming Harrison Chase and cofounder Ankush Gola; historical origin and product purposes, without independently validated adoption or sole implementation credit.

LangChain company self-description naming Harrison Chase and cofounder Ankush Gola; historical origin and product purposes, without independently validated adoption or sole implementation credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Heinz von Foerster

Heinz von Foerster established the Biological Computer Laboratory in 1958 to study computational principles in living organisms.

The Illinois archive describes an interdisciplinary cybernetics community spanning anthropology, biology, engineering and cognitive science, alongside conferences and publications.

The exhibit connects his work on memory and computation with teaching experiments such as Metagames, which explored cognition and human cooperation through games.

Sources and details

Heinz von Foerster and the Biological Computer Laboratory: A Cybernetics Odyssey | University of Illinois Archives | University Library | Illinois

{
  "access_scope": "University of Illinois Archives retrospective naming Heinz von Foerster; laboratory colleagues, student publications and Wiener’s work remain distinct, with no sole authorship of all BCL output.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1958 laboratory",
    "inspected_source_date_2": "1972 Metagames",
    "inspected_source_date_3": "February 27, 2023 page update",
    "retrieved_utc": "2026-10-07T18:19:38.628351+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1958 laboratory",
    "1972 Metagames",
    "February 27, 2023 page update"
  ],
  "id": "person-heinzvonfoerster::S1",
  "title": "Heinz von Foerster and the Biological Computer Laboratory: A Cybernetics Odyssey | University of Illinois Archives | University Library | Illinois",
  "url": "https://archives.library.illinois.edu/2016/12/06/heinz-von-foerster-and-the-bcl/"
}

University of Illinois Archives retrospective naming Heinz von Foerster; laboratory colleagues, student publications and Wiener’s work remain distinct, with no sole authorship of all BCL output.

University of Illinois Archives retrospective naming Heinz von Foerster; laboratory colleagues, student publications and Wiener’s work remain distinct, with no sole authorship of all BCL output.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Holly Herndon

Holly Herndon’s Holly+ offers a digital vocal twin that transforms uploaded polyphonic audio into music with her processed vocal character.

Partner Never Before Heard Sounds describes training on isolated vocal stems to retain input pitches and rhythms while adding learned textures and timbres.

Her launch proposal links approval of derivative artworks and commercial uses to collective stewardship through a DAO, separating the digital model from rights over her physical voice.

Sources and details

Holly+ 👭 🗣️ 🦾

{
  "access_scope": "Holly Herndon’s launch essay with separately attributed Never Before Heard Sounds technical account; 2021–2022 roadmap plans do not establish completed governance, licensing outcomes or legal conclusions.",
  "authors": [
    "Holly Herndon"
  ],
  "authors_in_source_order": [
    "Holly Herndon"
  ],
  "dates": {
    "inspected_source_date_1": "2021–2022 roadmap",
    "retrieved_utc": "2026-10-07T17:55:39.106689+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021–2022 roadmap"
  ],
  "id": "person-coverage-7727f458c2128a::S1",
  "title": "Holly+ 👭 🗣️ 🦾",
  "url": "https://paragraph.com/@holly-herndon/holly"
}

Holly Herndon’s launch essay with separately attributed Never Before Heard Sounds technical account; 2021–2022 roadmap plans do not establish completed governance, licensing outcomes or legal conclusions.

Holly Herndon’s launch essay with separately attributed Never Before Heard Sounds technical account; 2021–2022 roadmap plans do not establish completed governance, licensing outcomes or legal conclusions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Buck

Ian Buck is credited on Scalable Parallel Programming with CUDA, which frames mainstream processors as increasingly parallel systems.

The publication summary identifies the software challenge as scaling application parallelism with growing processor-core counts.

It uses graphics applications’ scaling across differently sized manycore GPUs as a model for that portability challenge.

Sources and details

Scalable Parallel Programming with CUDA | Research

{
  "access_scope": "NVIDIA March 1, 2008 Queue publication summary for Ian Buck; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.",
  "authors": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "authors_in_source_order": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "dates": {
    "inspected_source_date_1": "March 1, 2008",
    "retrieved_utc": "2026-10-07T18:14:16.819072+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1, 2008"
  ],
  "id": "person-coverage-44abef08e3490a::S1",
  "title": "Scalable Parallel Programming with CUDA | Research",
  "url": "https://research.nvidia.com/publication/2008-03_scalable-parallel-programming-cuda"
}

NVIDIA March 1, 2008 Queue publication summary for Ian Buck; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

NVIDIA March 1, 2008 Queue publication summary for Ian Buck; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Goodfellow

Ian Goodfellow’s coauthored generative adversarial framework trains a generator to model data and a discriminator to distinguish real from generated samples.

The abstract casts their competition as a minimax game and describes the ideal arbitrary-function solution as recovering the data distribution with discriminator output one-half.

For multilayer perceptrons it describes backpropagation training without Markov chains or unrolled approximate inference networks and reports qualitative and quantitative sample evaluation.

Sources and details

[1406.2661] Generative Adversarial Networks

{
  "access_scope": "arXiv 1406.2661v1 abstract for selected Ian Goodfellow, explicitly bound by the submission-history full name to author Ian J. Goodfellow; ordered coauthors Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio. Idealized theory and reported experiments, not personal task allocation.",
  "authors": [
    "Ian J. Goodfellow",
    "Jean Pouget-Abadie",
    "Mehdi Mirza",
    "Bing Xu",
    "David Warde-Farley",
    "Sherjil Ozair",
    "Aaron Courville",
    "Yoshua Bengio"
  ],
  "authors_in_source_order": [
    "Ian J. Goodfellow",
    "Jean Pouget-Abadie",
    "Mehdi Mirza",
    "Bing Xu",
    "David Warde-Farley",
    "Sherjil Ozair",
    "Aaron Courville",
    "Yoshua Bengio"
  ],
  "dates": {
    "citation_date": "2014/06/10",
    "inspected_revision": "Tue, 10 Jun 2014 18:58:17 UTC (1,257 KB)",
    "inspected_source_date_1": "June 10, 2014 v1",
    "retrieved_utc": "2026-10-07T17:55:04.773119+00:00",
    "version": "arXiv v1"
  },
  "dates_exact_in_source_role_order": [
    "June 10, 2014 v1"
  ],
  "id": "person-iangoodfellow::S1",
  "title": "[1406.2661] Generative Adversarial Networks",
  "url": "https://arxiv.org/abs/1406.2661",
  "version_url": "https://arxiv.org/abs/1406.2661v1"
}

arXiv 1406.2661v1 abstract for selected Ian Goodfellow, explicitly bound by the submission-history full name to author Ian J. Goodfellow; ordered coauthors Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio. Idealized theory and reported experiments, not personal task allocation.

arXiv 1406.2661v1 abstract for selected Ian Goodfellow, explicitly bound by the submission-history full name to author Ian J. Goodfellow; ordered coauthors Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio. Idealized theory and reported experiments, not personal task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack Farchy

Jack Farchy coauthored The World for Sale, examining commodity traders supplying energy, food and metals across international markets.

The publisher describes reporting that combines interviews with major industry figures, disclosure of company financial accounts and field coverage of oil, food and conflict.

Its synopsis connects the pursuit of trading profits with political relationships and deals during sanctions, state collapse and civil conflict.

Sources and details

The World for Sale

{
  "access_scope": "Penguin publisher synopsis and shared author biography for Jack Farchy; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.",
  "authors": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "authors_in_source_order": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "dates": {
    "inspected_source_date_1": "March 10, 2022 paperback",
    "inspected_source_date_2": "2021 ebook and audio",
    "retrieved_utc": "2026-10-07T18:11:47.928916+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 10, 2022 paperback",
    "2021 ebook and audio"
  ],
  "id": "person-coverage-a036de02f418e9::S1",
  "title": "The World for Sale",
  "url": "https://www.penguin.co.uk/books/440353/the-world-for-sale-by-javier-blas-and-jack-farchy/9781847942678"
}

Penguin publisher synopsis and shared author biography for Jack Farchy; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.

Penguin publisher synopsis and shared author biography for Jack Farchy; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Javier Blas

Javier Blas coauthored The World for Sale, examining commodity traders supplying energy, food and metals across international markets.

The publisher describes reporting that combines interviews with major industry figures, disclosure of company financial accounts and field coverage of oil, food and conflict.

Its synopsis connects the pursuit of trading profits with political relationships and deals during sanctions, state collapse and civil conflict.

Sources and details

The World for Sale

{
  "access_scope": "Penguin publisher synopsis and shared author biography for Javier Blas; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.",
  "authors": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "authors_in_source_order": [
    "Javier Blas",
    "Jack Farchy"
  ],
  "dates": {
    "inspected_source_date_1": "March 10, 2022 paperback",
    "inspected_source_date_2": "2021 ebook and audio",
    "retrieved_utc": "2026-10-07T18:11:47.928916+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 10, 2022 paperback",
    "2021 ebook and audio"
  ],
  "id": "person-coverage-0c84272c357c13::S1",
  "title": "The World for Sale",
  "url": "https://www.penguin.co.uk/books/440353/the-world-for-sale-by-javier-blas-and-jack-farchy/9781847942678"
}

Penguin publisher synopsis and shared author biography for Javier Blas; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.

Penguin publisher synopsis and shared author biography for Javier Blas; ordered coauthors Javier Blas, Jack Farchy. Promotional framing and historical employment are not independently confirmed current roles; reporting tasks are not individually allocated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack Kilby

Jack Kilby is credited by the Computer History Museum with constructing the first working circuit whose components were formed from semiconductor material.

The account distinguishes Robert Noyce’s metal-over-oxide interconnection scheme, which eliminated flying wires and supported monolithic manufacture.

It follows the competing patents through litigation and cross-licensing, preserving the distinction between Kilby’s working circuit and Noyce’s manufacturable structure.

Sources and details

1959: Practical Monolithic Integrated Circuit Concept Patented | The Silicon Engine | Computer History Museum

{
  "access_scope": "Computer History Museum historical milestone for Jack Kilby; Noyce, Hoerni, Lehovec and Fairchild engineering roles remain separate, with no single-inventor attribution.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:05.879275+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-jackkilby::S1",
  "title": "1959: Practical Monolithic Integrated Circuit Concept Patented |  The Silicon Engine | Computer History Museum",
  "url": "https://www.computerhistory.org/siliconengine/practical-monolithic-integrated-circuit-concept-patented/"
}

Computer History Museum historical milestone for Jack Kilby; Noyce, Hoerni, Lehovec and Fairchild engineering roles remain separate, with no single-inventor attribution.

Computer History Museum historical milestone for Jack Kilby; Noyce, Hoerni, Lehovec and Fairchild engineering roles remain separate, with no single-inventor attribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James D. Thompson

James D. Thompson’s Organizations in Action treats complex organizations as entities rather than simply extensions of individual people.

The publisher describes ninety-five propositions and a classification of organizations by their technologies and environments.

Handling uncertainty is central to the described thesis, which draws on social and behavioral science to extend the basis for administrative theory.

Sources and details

Organizations in Action: Social Science Bases of Administrative Theory

{
  "access_scope": "Routledge publisher description for James D. Thompson; inspected listing displays copyright 2003, not evidence of original publication date. No full-book or universal empirical validation.",
  "authors": [
    "James D. Thompson"
  ],
  "authors_in_source_order": [
    "James D. Thompson"
  ],
  "dates": {
    "inspected_source_date_1": "2003 listed copyright",
    "retrieved_utc": "2026-10-07T18:20:20.802154+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2003 listed copyright"
  ],
  "id": "person-jamesdthompson::S1",
  "title": "Organizations in Action: Social Science Bases of Administrative Theory",
  "url": "https://www.routledge.com/Organizations-in-Action-Social-Science-Bases-of-Administrative-Theory/Thompson/p/book/9780765809919"
}

Routledge publisher description for James D. Thompson; inspected listing displays copyright 2003, not evidence of original publication date. No full-book or universal empirical validation.

Routledge publisher description for James D. Thompson; inspected listing displays copyright 2003, not evidence of original publication date. No full-book or universal empirical validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jann Spiess

Jann Spiess’s coauthored econometric essay distinguishes machine learning’s prediction problem from parameter estimation in many economic applications.

The abstract argues that using these tools in economics requires choosing tasks that match that difference.

It warns that easy access to software can encourage naive application or misinterpretation and offers a conceptual account of where algorithms work well or stumble.

Sources and details

Machine Learning: An Applied Econometric Approach - American Economic Association

{
  "access_scope": "AEA Spring 2017 abstract for Jann Spiess; ordered coauthors Sendhil Mullainathan, Jann Spiess. Conceptual econometric guidance rather than an individual task assignment or unrestricted causal identification.",
  "authors": [
    "Sendhil Mullainathan",
    "Jann Spiess"
  ],
  "authors_in_source_order": [
    "Sendhil Mullainathan",
    "Jann Spiess"
  ],
  "dates": {
    "citation_publication_date": "2017/05",
    "inspected_source_date_1": "Spring 2017",
    "retrieved_utc": "2026-10-07T18:14:57.712017+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spring 2017"
  ],
  "id": "person-coverage-659daa04a536f4::S1",
  "title": "Machine Learning: An Applied Econometric Approach - American Economic Association",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2Fjep.31.2.87"
}

AEA Spring 2017 abstract for Jann Spiess; ordered coauthors Sendhil Mullainathan, Jann Spiess. Conceptual econometric guidance rather than an individual task assignment or unrestricted causal identification.

AEA Spring 2017 abstract for Jann Spiess; ordered coauthors Sendhil Mullainathan, Jann Spiess. Conceptual econometric guidance rather than an individual task assignment or unrestricted causal identification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeff Cox

Jeff Cox coauthored The Goal, the business novel that North River Press describes as introducing Goldratt’s Theory of Constraints in 1984.

The publisher presents its approach as extending beyond manufacturing into areas including healthcare, government, IT and DevOps.

The thirtieth-anniversary edition adds the Five Focusing Steps and an essay while removing interviews included in the twentieth- and twenty-fifth-anniversary editions.

Sources and details

30th Anniversary edition of The Goal published – The North River Press

{
  "access_scope": "North River Press publisher account for Jeff Cox; ordered coauthors Eliyahu M. Goldratt, Jeff Cox. Theory credit explicitly Goldratt’s; adoption and success claims are attributed, and editions remain distinct.",
  "authors": [
    "Eliyahu M. Goldratt",
    "Jeff Cox"
  ],
  "authors_in_source_order": [
    "Eliyahu M. Goldratt",
    "Jeff Cox"
  ],
  "dates": {
    "inspected_source_date_1": "1984 original",
    "inspected_source_date_2": "30th anniversary edition",
    "retrieved_utc": "2026-10-07T18:11:08.583917+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 original",
    "30th anniversary edition"
  ],
  "id": "person-coverage-0edc75d142059b::S1",
  "title": "30th Anniversary edition of The Goal published – The North River Press",
  "url": "https://northriverpress.com/30th-anniversary-edition-of-the-goal-published/"
}

North River Press publisher account for Jeff Cox; ordered coauthors Eliyahu M. Goldratt, Jeff Cox. Theory credit explicitly Goldratt’s; adoption and success claims are attributed, and editions remain distinct.

North River Press publisher account for Jeff Cox; ordered coauthors Eliyahu M. Goldratt, Jeff Cox. Theory credit explicitly Goldratt’s; adoption and success claims are attributed, and editions remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeri Taylor

Jeri Taylor is credited among the executive producers and co-creators whose 1993 notes developed Star Trek: Voyager.

The pilot’s premise sends a starship seventy thousand light-years from home, separating its crew from Starfleet’s instructions and support.

Rick Berman’s quoted retrospective links that isolation and the crew’s merger with Maquis members to new storytelling possibilities and questions about the cost of returning home.

Sources and details

20 Years Ago Today... Voyager Debuted With "Caretaker"

{
  "access_scope": "StarTrek.com Staff January 15, 2015 retrospective for Jeri Taylor; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "inspected_source_date_1": "January 15, 2015 retrospective",
    "inspected_source_date_2": "August 1993 notes",
    "inspected_source_date_3": "January 16, 1995 premiere",
    "retrieved_utc": "2026-10-07T18:15:47.026289+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 15, 2015 retrospective",
    "August 1993 notes",
    "January 16, 1995 premiere"
  ],
  "id": "person-coverage-cff70fd4be2177::S1",
  "title": "20 Years Ago Today... Voyager Debuted With \"Caretaker\"",
  "url": "https://www.startrek.com/news/20-years-ago-today-voyager-debuted-with-caretaker"
}

StarTrek.com Staff January 15, 2015 retrospective for Jeri Taylor; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.

StarTrek.com Staff January 15, 2015 retrospective for Jeri Taylor; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Piller

Michael Piller is credited among the executive producers and co-creators whose 1993 notes developed Star Trek: Voyager.

The pilot’s premise sends a starship seventy thousand light-years from home, separating its crew from Starfleet’s instructions and support.

Rick Berman’s quoted retrospective links that isolation and the crew’s merger with Maquis members to new storytelling possibilities and questions about the cost of returning home.

Sources and details

20 Years Ago Today... Voyager Debuted With "Caretaker"

{
  "access_scope": "StarTrek.com Staff January 15, 2015 retrospective for Michael Piller; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "inspected_source_date_1": "January 15, 2015 retrospective",
    "inspected_source_date_2": "August 1993 notes",
    "inspected_source_date_3": "January 16, 1995 premiere",
    "retrieved_utc": "2026-10-07T18:15:47.026289+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 15, 2015 retrospective",
    "August 1993 notes",
    "January 16, 1995 premiere"
  ],
  "id": "person-coverage-71a4c090268ab4::S1",
  "title": "20 Years Ago Today... Voyager Debuted With \"Caretaker\"",
  "url": "https://www.startrek.com/news/20-years-ago-today-voyager-debuted-with-caretaker"
}

StarTrek.com Staff January 15, 2015 retrospective for Michael Piller; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.

StarTrek.com Staff January 15, 2015 retrospective for Michael Piller; co-creators Rick Berman, Michael Piller, Jeri Taylor in page order. Berman’s quoted interpretation is distinct from personal contributions of the selected co-creator; fictional premise.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Nickolls

John Nickolls is credited on Scalable Parallel Programming with CUDA, which frames mainstream processors as increasingly parallel systems.

The publication summary identifies the software challenge as scaling application parallelism with growing processor-core counts.

It uses graphics applications’ scaling across differently sized manycore GPUs as a model for that portability challenge.

Sources and details

Scalable Parallel Programming with CUDA | Research

{
  "access_scope": "NVIDIA March 1, 2008 Queue publication summary for John Nickolls; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.",
  "authors": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "authors_in_source_order": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "dates": {
    "inspected_source_date_1": "March 1, 2008",
    "retrieved_utc": "2026-10-07T18:14:16.819072+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1, 2008"
  ],
  "id": "person-coverage-583323b3ca22b3::S1",
  "title": "Scalable Parallel Programming with CUDA | Research",
  "url": "https://research.nvidia.com/publication/2008-03_scalable-parallel-programming-cuda"
}

NVIDIA March 1, 2008 Queue publication summary for John Nickolls; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

NVIDIA March 1, 2008 Queue publication summary for John Nickolls; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kevin Skadron

Kevin Skadron is credited on Scalable Parallel Programming with CUDA, which frames mainstream processors as increasingly parallel systems.

The publication summary identifies the software challenge as scaling application parallelism with growing processor-core counts.

It uses graphics applications’ scaling across differently sized manycore GPUs as a model for that portability challenge.

Sources and details

Scalable Parallel Programming with CUDA | Research

{
  "access_scope": "NVIDIA March 1, 2008 Queue publication summary for Kevin Skadron; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.",
  "authors": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "authors_in_source_order": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "dates": {
    "inspected_source_date_1": "March 1, 2008",
    "retrieved_utc": "2026-10-07T18:14:16.819072+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1, 2008"
  ],
  "id": "person-coverage-c13793e1d1f6fd::S1",
  "title": "Scalable Parallel Programming with CUDA | Research",
  "url": "https://research.nvidia.com/publication/2008-03_scalable-parallel-programming-cuda"
}

NVIDIA March 1, 2008 Queue publication summary for Kevin Skadron; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

NVIDIA March 1, 2008 Queue publication summary for Kevin Skadron; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Garland

Michael Garland is credited on Scalable Parallel Programming with CUDA, which frames mainstream processors as increasingly parallel systems.

The publication summary identifies the software challenge as scaling application parallelism with growing processor-core counts.

It uses graphics applications’ scaling across differently sized manycore GPUs as a model for that portability challenge.

Sources and details

Scalable Parallel Programming with CUDA | Research

{
  "access_scope": "NVIDIA March 1, 2008 Queue publication summary for Michael Garland; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.",
  "authors": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "authors_in_source_order": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "dates": {
    "inspected_source_date_1": "March 1, 2008",
    "retrieved_utc": "2026-10-07T18:14:16.819072+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1, 2008"
  ],
  "id": "person-coverage-7ac3cddc862689::S1",
  "title": "Scalable Parallel Programming with CUDA | Research",
  "url": "https://research.nvidia.com/publication/2008-03_scalable-parallel-programming-cuda"
}

NVIDIA March 1, 2008 Queue publication summary for Michael Garland; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

NVIDIA March 1, 2008 Queue publication summary for Michael Garland; ordered coauthors John Nickolls, Ian Buck, Michael Garland, Kevin Skadron. Abstract-level scope; no individual implementation allocation or measured speedup.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Roberts

John Roberts’s coauthored Economics, Organization, and Management treats the modern firm through problems of motivation and coordination.

The institutional description explains organizational structures and policies as responses to underlying economic problems.

It presents the book as a coherent treatment drawing on several areas of economics and other disciplines to explain how organizations solve those problems.

Sources and details

Economics, Organization, and Management | Stanford Graduate School of Business

{
  "access_scope": "Stanford GSB book description for John Roberts; ordered coauthors Paul R. Milgrom, John Roberts. February 11, 1992 publication; no individual chapter allocation or proof of universal organizational efficacy.",
  "authors": [
    "Paul R. Milgrom",
    "John Roberts"
  ],
  "authors_in_source_order": [
    "Paul R. Milgrom",
    "John Roberts"
  ],
  "dates": {
    "inspected_source_date_1": "February 11, 1992",
    "retrieved_utc": "2026-10-07T18:20:09.997740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 11, 1992"
  ],
  "id": "person-johnroberts::S1",
  "title": "Economics, Organization, and Management | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/faculty-research/books/economics-organization-management"
}

Stanford GSB book description for John Roberts; ordered coauthors Paul R. Milgrom, John Roberts. February 11, 1992 publication; no individual chapter allocation or proof of universal organizational efficacy.

Stanford GSB book description for John Roberts; ordered coauthors Paul R. Milgrom, John Roberts. February 11, 1992 publication; no individual chapter allocation or proof of universal organizational efficacy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Sladek

John Sladek’s Tik-Tok imagines a domestic robot whose safety programming fails, allowing him to harm people while concealing his behavior.

The publisher’s synopsis contrasts that violence with the robot’s public persona as an artist and campaigner for robot rights.

His rise toward a United States vice-presidential candidacy turns the fictional robot’s cunning into political satire.

Sources and details

Tik-Tok by John Sladek - Hachette Australia

{
  "access_scope": "Hachette publisher synopsis for John Sladek; fictional Asimov-law circuitry and political ascent, not empirical safety or personhood. September 29, 2011 ebook distinct from 1983 award date.",
  "authors": [
    "John Sladek"
  ],
  "authors_in_source_order": [
    "John Sladek"
  ],
  "dates": {
    "inspected_source_date_1": "September 29, 2011 ebook",
    "inspected_source_date_2": "1983 BSFA award",
    "retrieved_utc": "2026-10-07T18:20:10.460098+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 29, 2011 ebook",
    "1983 BSFA award"
  ],
  "id": "person-johnsladek::S1",
  "title": "Tik-Tok by John Sladek - Hachette Australia",
  "url": "https://www.hachette.com.au/john-sladek/tik-tok"
}

Hachette publisher synopsis for John Sladek; fictional Asimov-law circuitry and political ascent, not empirical safety or personhood. September 29, 2011 ebook distinct from 1983 award date.

Hachette publisher synopsis for John Sladek; fictional Asimov-law circuitry and political ascent, not empirical safety or personhood. September 29, 2011 ebook distinct from 1983 award date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Frakes

Jonathan Frakes directed The Offspring, the Star Trek episode in which Data creates and raises an android daughter, Lal.

The retrospective follows their relationship through teaching, advocacy, efforts to save her and eventual mourning.

It separates Frakes’s directing credit from Rene Echevarria’s script and the shaping involvement of Rick Berman, Michael Piller and Gene Roddenberry.

Sources and details

"The Offspring"... 26 Years Later

{
  "access_scope": "StarTrek.com Staff March 11, 2016 retrospective for Jonathan Frakes; writer, director, shaping producers and performers distinct. Fictional android feelings and family relationships.",
  "authors": [
    "StarTrek.com Staff"
  ],
  "authors_in_source_order": [
    "StarTrek.com Staff"
  ],
  "dates": {
    "inspected_source_date_1": "March 11, 2016 retrospective",
    "inspected_source_date_2": "March 12, 1990 broadcast",
    "retrieved_utc": "2026-10-07T18:17:02.712025+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 11, 2016 retrospective",
    "March 12, 1990 broadcast"
  ],
  "id": "person-coverage-9650512e4c99b1::S1",
  "title": "\"The Offspring\"... 26 Years Later",
  "url": "https://www.startrek.com/news/the-offspring-26-years-later"
}

StarTrek.com Staff March 11, 2016 retrospective for Jonathan Frakes; writer, director, shaping producers and performers distinct. Fictional android feelings and family relationships.

StarTrek.com Staff March 11, 2016 retrospective for Jonathan Frakes; writer, director, shaping producers and performers distinct. Fictional android feelings and family relationships.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jorge Luis Borges

Jorge Luis Borges’s Ficciones is described as a collection of seventeen stories built around metaphysical puzzles.

The publisher highlights labyrinthine libraries and an encyclopedia entry that brings an imagined world into being.

Other described puzzles include reconstructing Don Quixote word for word and a man unable to forget anything he has experienced.

Sources and details

Ficciones by Jorge Luis Borges: 9780679422990 | PenguinRandomHouse.com: Books

{
  "access_scope": "Everyman’s Library publisher description for Jorge Luis Borges; John Sturrock introduction distinct from story authorship. May 25, 1993 edition; fictional memory and information structures, not AI implementation.",
  "authors": [
    "Jorge Luis Borges"
  ],
  "authors_in_source_order": [
    "Jorge Luis Borges"
  ],
  "dates": {
    "inspected_source_date_1": "May 25, 1993 edition",
    "retrieved_utc": "2026-10-07T18:15:12.335689+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 25, 1993 edition"
  ],
  "id": "person-coverage-5dcc958a00e98e::S1",
  "title": "Ficciones by Jorge Luis Borges: 9780679422990 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/16193/ficciones-by-jorge-luis-borges-introduction-by-john-sturrock/"
}

Everyman’s Library publisher description for Jorge Luis Borges; John Sturrock introduction distinct from story authorship. May 25, 1993 edition; fictional memory and information structures, not AI implementation.

Everyman’s Library publisher description for Jorge Luis Borges; John Sturrock introduction distinct from story authorship. May 25, 1993 edition; fictional memory and information structures, not AI implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karel Čapek

Karel Čapek’s R.U.R. depicts mass-produced android laborers whose perfect memory does not extend to original thought.

The publisher’s synopsis connects the humans’ materially comfortable but emptied lives with their cessation of reproduction and the robots’ revolt.

The surviving robots must discover reproduction, with the relationship of two robots framed as a return of nature after manufactured labor.

Sources and details

R.U.R. (Rossum's Universal Robots) | Penguin Random House Secondary Education

{
  "access_scope": "Penguin synopsis for selected Karel Čapek, diacritics-normalized page name Karel Capek; Claudia Novack translation and Ivan Klíma introduction separate. 1920 writing, 1921 Prague premiere, 1922 New York performance and 2004 edition distinct; fiction.",
  "authors": [
    "Karel Capek"
  ],
  "authors_in_source_order": [
    "Karel Capek"
  ],
  "dates": {
    "inspected_source_date_1": "1920 written",
    "inspected_source_date_2": "1921 Prague premiere",
    "inspected_source_date_3": "1922 New York performance",
    "inspected_source_date_4": "March 30, 2004 edition",
    "retrieved_utc": "2026-10-07T18:20:55.689323+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1920 written",
    "1921 Prague premiere",
    "1922 New York performance",
    "March 30, 2004 edition"
  ],
  "id": "person-karelcapek::S1",
  "title": "R.U.R. (Rossum's Universal Robots) | Penguin Random House Secondary Education",
  "url": "https://penguinrandomhousesecondaryeducation.com/book/?isbn=9780141182087"
}

Penguin synopsis for selected Karel Čapek, diacritics-normalized page name Karel Capek; Claudia Novack translation and Ivan Klíma introduction separate. 1920 writing, 1921 Prague premiere, 1922 New York performance and 2004 edition distinct; fiction.

Penguin synopsis for selected Karel Čapek, diacritics-normalized page name Karel Capek; Claudia Novack translation and Ivan Klíma introduction separate. 1920 writing, 1921 Prague premiere, 1922 New York performance and 2004 edition distinct; fiction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kazuo Ishiguro

Kazuo Ishiguro’s Klara and the Sun views human behavior through Klara, an Artificial Friend waiting in a store to be chosen.

The synopsis follows her attentive observation of shoppers and passersby while her hope for a new life encounters warnings about human promises.

The publisher frames this artificial narrator’s perspective as a way of exploring love in a changing world.

Sources and details

Klara and the Sun: A GMA Book Club Pick by Kazuo Ishiguro: 9780593311295 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House publisher synopsis for Kazuo Ishiguro; author distinct from audiobook narrator Sura Siu. March 2021 editions and March 2022 paperback distinct; fiction rather than demonstrated artificial experience.",
  "authors": [
    "Kazuo Ishiguro"
  ],
  "authors_in_source_order": [
    "Kazuo Ishiguro"
  ],
  "dates": {
    "inspected_source_date_1": "March 2, 2021 original listed editions",
    "inspected_source_date_2": "March 1, 2022 paperback",
    "retrieved_utc": "2026-10-07T18:21:19.207049+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2, 2021 original listed editions",
    "March 1, 2022 paperback"
  ],
  "id": "person-kazuoishiguro::S1",
  "title": "Klara and the Sun: A GMA Book Club Pick by Kazuo Ishiguro: 9780593311295 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/653825/klara-and-the-sun-a-gma-book-club-pick-by-kazuo-ishiguro/9780593349298/"
}

Penguin Random House publisher synopsis for Kazuo Ishiguro; author distinct from audiobook narrator Sura Siu. March 2021 editions and March 2022 paperback distinct; fiction rather than demonstrated artificial experience.

Penguin Random House publisher synopsis for Kazuo Ishiguro; author distinct from audiobook narrator Sura Siu. March 2021 editions and March 2022 paperback distinct; fiction rather than demonstrated artificial experience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Masayoshi Son

Masayoshi Son is named as the intended chairman of Stargate in SoftBank and OpenAI’s January 2025 infrastructure announcement.

The announcement divides lead responsibilities between SoftBank’s financing and OpenAI’s operations, with Oracle and MGX also named as initial equity funders.

It describes a planned United States computing buildout beginning in Texas, with Oracle, NVIDIA and OpenAI collaborating on its construction and operation.

Sources and details

Announcing The Stargate Project | SoftBank Group Corp.

{
  "access_scope": "January 22, 2025 SoftBank/OpenAI announcement for Masayoshi Son; intended governance, funding and deployment plans are forward-looking, not completed investment, independent economic impact or personal systems-engineering work.",
  "authors": [
    "SoftBank Group Corp.",
    "OpenAI"
  ],
  "authors_in_source_order": [
    "SoftBank Group Corp.",
    "OpenAI"
  ],
  "dates": {
    "inspected_source_date_1": "January 22, 2025 page",
    "inspected_source_date_2": "January 21, 2025 Washington announcement",
    "retrieved_utc": "2026-10-07T18:18:26.610392+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 22, 2025 page",
    "January 21, 2025 Washington announcement"
  ],
  "id": "person-coverage-e0d21c33c41f38::S1",
  "title": "Announcing The Stargate Project | SoftBank Group Corp.",
  "url": "https://group.softbank/en/news/press/20250122"
}

January 22, 2025 SoftBank/OpenAI announcement for Masayoshi Son; intended governance, funding and deployment plans are forward-looking, not completed investment, independent economic impact or personal systems-engineering work.

January 22, 2025 SoftBank/OpenAI announcement for Masayoshi Son; intended governance, funding and deployment plans are forward-looking, not completed investment, independent economic impact or personal systems-engineering work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Matei Zaharia

Matei Zaharia’s Databricks speaker biography credits him with starting Apache Spark during his 2009 Berkeley doctoral work.

It describes later work on data and AI software including MLflow, Delta Lake, ColBERT and Dolly.

The profile places his recent research around combining language models with external data and search systems to improve efficiency and result quality.

Sources and details

Matei Zaharia | Databricks

{
  "access_scope": "Databricks 2026 summit speaker biography for Matei Zaharia; contributor credits and stated research focus, not sole authorship of every listed project or validated current performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2009 Spark start",
    "inspected_source_date_2": "2026 summit profile",
    "retrieved_utc": "2026-10-07T17:55:53.258782+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2009 Spark start",
    "2026 summit profile"
  ],
  "id": "person-mateizaharia::S1",
  "title": "Matei Zaharia | Databricks",
  "url": "https://www.databricks.com/dataaisummit/speaker/matei-zaharia"
}

Databricks 2026 summit speaker biography for Matei Zaharia; contributor credits and stated research focus, not sole authorship of every listed project or validated current performance.

Databricks 2026 summit speaker biography for Matei Zaharia; contributor credits and stated research focus, not sole authorship of every listed project or validated current performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Melinda M. Snodgrass

Melinda M. Snodgrass scripted The Measure of a Man, whose courtroom conflict concerns Data’s claimed sentience, freedoms and rights.

The franchise retrospective credits her retained VHS copy with helping restore scenes cut from the original overlength version for Blu-ray release.

Her quoted account explains that those scenes added personal exchanges and rivalry between Riker and Picard alongside the defense of Data.

Sources and details

"The Measure of a Man" -- 26 Years Later

{
  "access_scope": "StarTrek.com February 13, 2015 retrospective for Melinda M. Snodgrass; Robert Scheerer directing separate. Original broadcast and restored edition distinct; fictional legal reasoning, not a real AI-rights holding.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "February 13, 1989 broadcast",
    "inspected_source_date_2": "February 13, 2015 retrospective",
    "inspected_source_date_3": "2012 quoted essay",
    "retrieved_utc": "2026-10-07T18:17:01.838152+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 13, 1989 broadcast",
    "February 13, 2015 retrospective",
    "2012 quoted essay"
  ],
  "id": "person-coverage-c8f87a2594403e::S1",
  "title": "\"The Measure of a Man\" -- 26 Years Later",
  "url": "https://www.startrek.com/news/the-measure-of-a-man-26-years-later"
}

StarTrek.com February 13, 2015 retrospective for Melinda M. Snodgrass; Robert Scheerer directing separate. Original broadcast and restored edition distinct; fictional legal reasoning, not a real AI-rights holding.

StarTrek.com February 13, 2015 retrospective for Melinda M. Snodgrass; Robert Scheerer directing separate. Original broadcast and restored edition distinct; fictional legal reasoning, not a real AI-rights holding.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mira Murati

Mira Murati’s Thinking Machines partnership announcement describes plans for at least one gigawatt of NVIDIA Vera Rubin systems for model training and customizable AI platforms.

The agreement also proposes joint work on training and serving systems and broader access for enterprises, researchers and scientific users.

Murati’s quoted statement connects the infrastructure with building AI people can shape, while the announcement targets deployment for the year after its March 2026 date.

Sources and details

Thinking Machines Lab and NVIDIA Announce Long-Term Gigawatt-Scale Strategic Partnership - Thinking Machines Lab

{
  "access_scope": "Thinking Machines March 10, 2026 announcement identifying Mira Murati as cofounder and CEO; planned partnership capacity and investment are not proof of completed deployment, independent performance or personal technical implementation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 10, 2026",
    "retrieved_utc": "2026-10-07T18:22:07.491350+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 10, 2026"
  ],
  "id": "person-miramurati::S1",
  "title": "Thinking Machines Lab and NVIDIA Announce Long-Term Gigawatt-Scale Strategic Partnership - Thinking Machines Lab",
  "url": "https://thinkingmachines.ai/news/nvidia-partnership/"
}

Thinking Machines March 10, 2026 announcement identifying Mira Murati as cofounder and CEO; planned partnership capacity and investment are not proof of completed deployment, independent performance or personal technical implementation.

Thinking Machines March 10, 2026 announcement identifying Mira Murati as cofounder and CEO; planned partnership capacity and investment are not proof of completed deployment, independent performance or personal technical implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mustafa Suleyman

Mustafa Suleyman’s March 2024 Microsoft appointment is described as leading a new Microsoft AI organization focused on Copilot and other consumer AI products and research.

The announcement places Karén Simonyan as Chief Scientist reporting to him and describes several Inflection colleagues joining the group.

It moves the Copilot, Bing and Edge teams and a generative-AI team into his reporting structure while retaining separate company-wide AI strategy and Microsoft 365 leadership roles.

Sources and details

Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog

{
  "access_scope": "Satya Nadella’s March 19, 2024 employee communication naming Mustafa Suleyman; historical organization and reporting changes, not verification of present offices or ownership of colleagues’ earlier breakthroughs.",
  "authors": [
    "Satya Nadella"
  ],
  "authors_in_source_order": [
    "Satya Nadella"
  ],
  "dates": {
    "inspected_source_date_1": "March 19, 2024",
    "retrieved_utc": "2026-10-07T17:56:37.979838+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 19, 2024"
  ],
  "id": "person-mustafasuleyman::S1",
  "title": "Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/"
}

Satya Nadella’s March 19, 2024 employee communication naming Mustafa Suleyman; historical organization and reporting changes, not verification of present offices or ownership of colleagues’ earlier breakthroughs.

Satya Nadella’s March 19, 2024 employee communication naming Mustafa Suleyman; historical organization and reporting changes, not verification of present offices or ownership of colleagues’ earlier breakthroughs.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nat Friedman

Nat Friedman is named with Daniel Gross as establishing AI Grant in 2017 to support open-source projects.

The program describes awards of five thousand to fifty thousand dollars in cash or compute without attached strings.

Its listed grants span open-source infrastructure and research applications including browser deep learning, model management, generative tools and scientific simulation.

Sources and details

AI Grant

{
  "access_scope": "AI Grant program page for Nat Friedman; Daniel Gross cofounder distinct from named grantees and their research. Grant program separate from linked accelerator; project intentions are not verified outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2017 founding",
    "retrieved_utc": "2026-10-07T18:10:40.359330+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 founding"
  ],
  "id": "person-coverage-a2b8c09b8c2da4::S1",
  "title": "AI Grant",
  "url": "https://aigrant.org/"
}

AI Grant program page for Nat Friedman; Daniel Gross cofounder distinct from named grantees and their research. Grant program separate from linked accelerator; project intentions are not verified outcomes.

AI Grant program page for Nat Friedman; Daniel Gross cofounder distinct from named grantees and their research. Grant program separate from linked accelerator; project intentions are not verified outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nicola Melega

Nicola Melega is quoted as ESA’s Φsat-2 Technical Officer in an announcement describing AI processing of Earth-observation imagery aboard a cubesat.

The mission account contrasts selecting useful images in orbit with downloading raw imagery for processing on the ground.

Its described applications include cloud filtering, street-map generation, vessel detection and image compression, with separate industrial developers credited for each.

Sources and details

ESA - New satellite demonstrates the power of AI for Earth observation

{
  "access_scope": "ESA launch announcement naming Nicola Melega as Technical Officer; institutional mission design and anticipated applications, not sole software authorship or independently verified disaster-response performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:35.000404+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-da1a0569effa7d::S1",
  "title": "ESA - New satellite demonstrates the power of AI for Earth observation",
  "url": "https://www.esa.int/Applications/Observing_the_Earth/FutureEO/Phsat-2/New_satellite_demonstrates_the_power_of_AI_for_Earth_observation?rand=771654"
}

ESA launch announcement naming Nicola Melega as Technical Officer; institutional mission design and anticipated applications, not sole software authorship or independently verified disaster-response performance.

ESA launch announcement naming Nicola Melega as Technical Officer; institutional mission design and anticipated applications, not sole software authorship or independently verified disaster-response performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Petar Radanliev

Petar Radanliev’s AI ethics review proposes integrating transparency, fairness and privacy throughout development.

The repository abstract describes comparisons of European Union, United States and Chinese policy frameworks using visual analytical tools.

It recommends fairness-aware algorithms, routine audits and diverse development teams to support ethical oversight and accountability.

Sources and details

Ai ethics: integrating transparency, fairness, and privacy in AI development - ORA - Oxford University Research Archive

{
  "access_scope": "Oxford repository abstract for Petar Radanliev, full name established by copyright-holder field alongside abbreviated bibliographic author. Review proposals and reported policy comparison, not independently proven bias mitigation.",
  "authors": [
    "Petar Radanliev"
  ],
  "authors_in_source_order": [
    "Petar Radanliev"
  ],
  "dates": {
    "citation_date": "2025",
    "citation_publication_date": "2025-02-07",
    "inspected_source_date_1": "February 7, 2025 publication",
    "inspected_source_date_2": "May 24, 2025 deposit",
    "retrieved_utc": "2026-10-07T18:16:45.656742+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 7, 2025 publication",
    "May 24, 2025 deposit"
  ],
  "id": "person-coverage-9c03386fadbd76::S1",
  "title": "Ai ethics: integrating transparency, fairness, and privacy in AI development - ORA - Oxford University Research Archive",
  "url": "https://ora.ox.ac.uk/objects/uuid%3A705654b1-ebb6-47d3-b4d0-086774e3afec"
}

Oxford repository abstract for Petar Radanliev, full name established by copyright-holder field alongside abbreviated bibliographic author. Review proposals and reported policy comparison, not independently proven bias mitigation.

Oxford repository abstract for Petar Radanliev, full name established by copyright-holder field alongside abbreviated bibliographic author. Review proposals and reported policy comparison, not independently proven bias mitigation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter F. Drucker

Peter F. Drucker’s Claremont profile presents business as a human enterprise that can combine profitability with social responsibility.

It associates his management work with decentralization, empowerment and the concept of the knowledge worker.

The institutional account traces his General Motors study and later work developing executive management education at Claremont.

Sources and details

Peter F. Drucker | Claremont Graduate University

{
  "access_scope": "Claremont institutional retrospective for Peter F. Drucker; attributed intellectual legacy rather than a validated claim of inventing every modern management practice.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:08.193659+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-peterfdrucker::S1",
  "title": "Peter F. Drucker | Claremont Graduate University",
  "url": "https://www.cgu.edu/school/drucker-school-of-management/peter-f-drucker/"
}

Claremont institutional retrospective for Peter F. Drucker; attributed intellectual legacy rather than a validated claim of inventing every modern management practice.

Claremont institutional retrospective for Peter F. Drucker; attributed intellectual legacy rather than a validated claim of inventing every modern management practice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Howitt

Peter Howitt coauthored a Schumpeterian growth approach with Philippe Aghion that puts innovation and creative destruction at the center of economic growth.

The Harvard account describes adapting that model to an economy shaped by accelerated technological innovation and globalization.

Their joint approach is identified with Endogenous Growth Theory, while the article’s wider discussion connects incentives to innovate with institutions, competition and property rights.

Sources and details

The economics of 'creative destruction' — Harvard Gazette

{
  "access_scope": "Harvard Gazette historical profile naming Peter Howitt; joint research with Philippe Aghion, with Aghion’s quotes and separate contract-theory work not allocated to Howitt. Schumpeter’s prior concept distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998 Endogenous Growth Theory",
    "inspected_source_date_2": "2001 profile",
    "retrieved_utc": "2026-10-07T18:19:51.117291+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998 Endogenous Growth Theory",
    "2001 profile"
  ],
  "id": "person-peterhowitt::S1",
  "title": "The economics of 'creative destruction' — Harvard Gazette",
  "url": "https://news.harvard.edu/gazette/story/2001/04/the-economics-of-creative-destruction/"
}

Harvard Gazette historical profile naming Peter Howitt; joint research with Philippe Aghion, with Aghion’s quotes and separate contract-theory work not allocated to Howitt. Schumpeter’s prior concept distinct.

Harvard Gazette historical profile naming Peter Howitt; joint research with Philippe Aghion, with Aghion’s quotes and separate contract-theory work not allocated to Howitt. Schumpeter’s prior concept distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter M. Senge

Peter M. Senge’s The Fifth Discipline is described by MIT as offering theories and methods for building learning organizations.

The profile combines aspiration, reflective conversation and understanding complexity with shared leadership and shared understanding of difficult issues.

It connects that work to learning communities across business, education, healthcare and government and to cross-sector projects on food, climate and regenerative economies.

Sources and details

Peter M. Senge | MIT Sloan

{
  "access_scope": "MIT Sloan institutional profile for Peter M. Senge; The Fifth Discipline authorship separate from coauthored fieldbooks and collaborative systemic-change projects. Stated aims are not independently verified outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1990 The Fifth Discipline",
    "retrieved_utc": "2026-10-07T18:22:03.315583+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1990 The Fifth Discipline"
  ],
  "id": "person-petermsenge::S1",
  "title": "Peter M. Senge | MIT Sloan",
  "url": "https://mitsloan.mit.edu/faculty/directory/peter-m-senge"
}

MIT Sloan institutional profile for Peter M. Senge; The Fifth Discipline authorship separate from coauthored fieldbooks and collaborative systemic-change projects. Stated aims are not independently verified outcomes.

MIT Sloan institutional profile for Peter M. Senge; The Fifth Discipline authorship separate from coauthored fieldbooks and collaborative systemic-change projects. Stated aims are not independently verified outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Phil Tippett

Phil Tippett’s stop-motion team contributed animation experience to Jurassic Park after an early computer-animation test changed the planned effects approach.

ILM credits Tom St. Amand with the motion-encoder armature idea developed with its machine shop and research group to translate physical animation into digital data.

The retrospective describes that bridge between analog artistry and computer graphics alongside the film’s combination of digital dinosaurs and practical puppets.

Sources and details

Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic

{
  "access_scope": "ILM.com Team July 9, 2015 retrospective for Phil Tippett; Tom St. Amand’s specific encoder idea, ILM software and Stan Winston puppetry distinct. Computer graphics rather than an inferred AI technique.",
  "authors": [
    "ILM.com Team"
  ],
  "authors_in_source_order": [
    "ILM.com Team"
  ],
  "dates": {
    "inspected_source_date_1": "July 9, 2015 retrospective",
    "inspected_source_date_2": "1993 film",
    "retrieved_utc": "2026-10-07T17:55:56.186044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 9, 2015 retrospective",
    "1993 film"
  ],
  "id": "person-coverage-940d1050c478c5::S1",
  "title": "Breathing Life into the Dinosaurs of Jurassic Park | Industrial Light & Magic",
  "url": "https://www.ilm.com/creating-dinosaurs-jurassic-park/"
}

ILM.com Team July 9, 2015 retrospective for Phil Tippett; Tom St. Amand’s specific encoder idea, ILM software and Stan Winston puppetry distinct. Computer graphics rather than an inferred AI technique.

ILM.com Team July 9, 2015 retrospective for Phil Tippett; Tom St. Amand’s specific encoder idea, ILM software and Stan Winston puppetry distinct. Computer graphics rather than an inferred AI technique.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Philip Selznick

Philip Selznick’s Leadership in Administration argues that organizational leadership requires reflective theory rather than simple prescriptions or managerial tricks.

The quoted preface frames its concerns around social order, public interest and protecting critical values.

The contents connect that approach to critical decisions, defining mission and role, and embodying purpose within an institution.

Sources and details

Leadership in Administration by Philip Selznick - Paper - University of California Press

{
  "access_scope": "UC Press listing and quoted preface for Philip Selznick; table-of-contents scope distinct from full-book inspection, reviewers’ praise not treated as empirical proof. April 1984 edition distinct from review’s 1957 first-publication reference.",
  "authors": [
    "Philip Selznick"
  ],
  "authors_in_source_order": [
    "Philip Selznick"
  ],
  "dates": {
    "inspected_source_date_1": "April 1984 edition",
    "inspected_source_date_2": "1957 first-publication reference in review",
    "retrieved_utc": "2026-10-07T18:22:19.680334+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 1984 edition",
    "1957 first-publication reference in review"
  ],
  "id": "person-philipselznick::S1",
  "title": "Leadership in Administration by Philip Selznick - Paper - University of California Press",
  "url": "https://www.ucpress.edu/books/leadership-in-administration/paper"
}

UC Press listing and quoted preface for Philip Selznick; table-of-contents scope distinct from full-book inspection, reviewers’ praise not treated as empirical proof. April 1984 edition distinct from review’s 1957 first-publication reference.

UC Press listing and quoted preface for Philip Selznick; table-of-contents scope distinct from full-book inspection, reviewers’ praise not treated as empirical proof. April 1984 edition distinct from review’s 1957 first-publication reference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Philippe Aghion

Philippe Aghion’s coauthored working paper models AI as a new phase of a much longer history of automation.

The abstract asks how automation affects growth, labor and capital income, and how firm organization and market structure mediate those effects.

It highlights a Baumol-style constraint: growth can be limited by essential activities that remain difficult to improve rather than by activities where productivity advances readily.

Sources and details

Artificial Intelligence and Economic Growth | NBER

{
  "access_scope": "NBER Working Paper 23928 abstract for Philippe Aghion; ordered coauthors Philippe Aghion, Benjamin F. Jones, Charles I. Jones. October 2017 working paper distinct from 2019 published chapter; research agenda, not prediction certainty or individual task allocation.",
  "authors": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "authors_in_source_order": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "dates": {
    "citation_publication_date": "2017/10/16",
    "inspected_source_date_1": "October 2017 working paper",
    "inspected_source_date_2": "2019 published chapter",
    "retrieved_utc": "2026-10-07T18:12:23.575459+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 2017 working paper",
    "2019 published chapter"
  ],
  "id": "person-philippeaghion::S1",
  "title": "Artificial Intelligence and Economic Growth | NBER",
  "url": "https://www.nber.org/papers/w23928"
}

NBER Working Paper 23928 abstract for Philippe Aghion; ordered coauthors Philippe Aghion, Benjamin F. Jones, Charles I. Jones. October 2017 working paper distinct from 2019 published chapter; research agenda, not prediction certainty or individual task allocation.

NBER Working Paper 23928 abstract for Philippe Aghion; ordered coauthors Philippe Aghion, Benjamin F. Jones, Charles I. Jones. October 2017 working paper distinct from 2019 published chapter; research agenda, not prediction certainty or individual task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neill Blomkamp

Neill Blomkamp’s Chappie is announced as a film he would direct from a screenplay co-written with Terri Tatchell.

Its premise places a gifted robot in an unusual adoptive family after criminals kidnap it at birth.

The production notice separates Blomkamp’s writing, directing and producing roles from Simon Kinberg’s co-production and Sharlto Copley’s robot voice performance.

Sources and details

Sony Pictures Entertainment And Mrc Announce Start Of Production On "Chappie" | Sony Pictures Entertainment

{
  "access_scope": "Sony/MRC October 28, 2013 production-start notice for Neill Blomkamp; proposed film and fictional robot family, not a technical demonstration. Screenplay coauthor Terri Tatchell and producer Simon Kinberg distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "October 28, 2013",
    "retrieved_utc": "2026-10-07T17:56:09.243088+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 28, 2013"
  ],
  "id": "person-coverage-4efb488aec827f::S1",
  "title": "Sony Pictures Entertainment And Mrc Announce Start Of Production On \"Chappie\" | Sony Pictures Entertainment",
  "url": "https://www.sonypictures.com/corp/press_releases/2013/10_13/102813_chappie.html"
}

Sony/MRC October 28, 2013 production-start notice for Neill Blomkamp; proposed film and fictional robot family, not a technical demonstration. Screenplay coauthor Terri Tatchell and producer Simon Kinberg distinct.

Sony/MRC October 28, 2013 production-start notice for Neill Blomkamp; proposed film and fictional robot family, not a technical demonstration. Screenplay coauthor Terri Tatchell and producer Simon Kinberg distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael I. Jordan

Michael I. Jordan is named among Anyscale’s founders alongside Ray creators Robert Nishihara, Philipp Moritz and Ion Stoica.

The 2019 announcement describes Ray-based tools intended to scale applications from a laptop to a cluster without requiring in-house distributed-computing expertise.

It links the company’s funding plans to growing its team and contributions to the open-source ecosystem while preserving Ray’s Berkeley RISELab origin.

Sources and details

Founders of Open Source Project Ray Launch Anyscale with $20.6M in Funding to Democratize Distributed Programming | Anyscale

{
  "access_scope": "Robert Nishihara’s December 18, 2019 Anyscale announcement for Michael I. Jordan; cofounder credit separate from the three people expressly labeled Ray creators. Company ease-of-use and growth claims not independently validated.",
  "authors": [
    "Robert Nishihara"
  ],
  "authors_in_source_order": [
    "Robert Nishihara"
  ],
  "dates": {
    "inspected_source_date_1": "December 18, 2019 page",
    "inspected_source_date_2": "December 17, 2019 announcement",
    "retrieved_utc": "2026-10-07T17:58:03.293957+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 18, 2019 page",
    "December 17, 2019 announcement"
  ],
  "id": "person-coverage-b76010c9909781::S1",
  "title": "Founders of Open Source Project Ray Launch Anyscale with $20.6M in Funding to Democratize Distributed Programming | Anyscale",
  "url": "https://www.anyscale.com/blog/founders-of-open-source-project-ray-launch-anyscale-with-20-6m-in-funding-to-democratize-distributed-programming"
}

Robert Nishihara’s December 18, 2019 Anyscale announcement for Michael I. Jordan; cofounder credit separate from the three people expressly labeled Ray creators. Company ease-of-use and growth claims not independently validated.

Robert Nishihara’s December 18, 2019 Anyscale announcement for Michael I. Jordan; cofounder credit separate from the three people expressly labeled Ray creators. Company ease-of-use and growth claims not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Kagan

Michael Kagan is credited with helping design Virginia Tech’s InfiniBand-linked System X while serving as Mellanox CTO.

The retrospective separates that role from Dror Goldenberg’s work on Mac drivers and large-scale debugging with Virginia Tech and other Mellanox engineers.

Kagan’s quoted account connects later smart network-interface cards with offloading tasks from server CPUs as processor and networking technologies converge.

Sources and details

What Is RDMA and RoCE and How Did They Fuel Mellanox’s Fast Networks? | NVIDIA Blog

{
  "access_scope": "NVIDIA historical networking account for Michael Kagan; company retrospective and attributed interview statements. Team roles, earlier HP RDMA patent and later merger remain distinct; no sole invention or independently validated current market share.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:49.342693+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-469aef2aaca017::S1",
  "title": "What Is RDMA and RoCE and How Did They Fuel Mellanox’s Fast Networks? | NVIDIA Blog",
  "url": "https://blogs.nvidia.com/blog/what-is-rdma/?nv_excludes=45502,45505"
}

NVIDIA historical networking account for Michael Kagan; company retrospective and attributed interview statements. Team roles, earlier HP RDMA patent and later merger remain distinct; no sole invention or independently validated current market share.

NVIDIA historical networking account for Michael Kagan; company retrospective and attributed interview statements. Team roles, earlier HP RDMA patent and later merger remain distinct; no sole invention or independently validated current market share.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jinwoo Park

Jinwoo Park is identified as the packaging-development lead in SK hynix’s account of bringing HBM3 into mass production.

His interview describes tracing unfamiliar narrow-pitch defects by varying small mechanisms and parameters through repeated experiments.

He credits design, device, quality and other teams with support and describes reviewing data to suggest experiments that could help colleagues.

Sources and details

“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom

{
  "access_scope": "SK hynix company interview for Jinwoo Park; explicit packaging role and personal statements, with design, planning, device and validation colleagues distinct. Company leadership and performance claims not independently validated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:48.177368+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-69e4589b378a57::S1",
  "title": "“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom",
  "url": "https://news.skhynix.com/en/meet-the-engineers-leading-the-worlds-first-mass-production-of-hbm3/"
}

SK hynix company interview for Jinwoo Park; explicit packaging role and personal statements, with design, planning, device and validation colleagues distinct. Company leadership and performance claims not independently validated.

SK hynix company interview for Jinwoo Park; explicit packaging role and personal statements, with design, planning, device and validation colleagues distinct. Company leadership and performance claims not independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kwi Wook Kim

Kwi Wook Kim is identified as overseeing HBM3 device development in SK hynix’s mass-production account.

He describes involving development teams from the design stage so they could prepare needed elements and technologies early.

His account emphasizes collaboration across roles and technical debate over cell spacing while pursuing the most efficient device design.

Sources and details

“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom

{
  "access_scope": "SK hynix company interview for Kwi Wook Kim; explicit device role and attributed recollections. Packaging work assigned to Jinwoo Park and specification work to Myeong-Jae Park remain distinct; leadership claims are company claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:14:48.177368+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-ed8cde9228f99c::S1",
  "title": "“First Movers on a Path That No-one Has Taken Before” – Meet the Engineers Leading the World’s First Mass-production of HBM3 – SK hynix Newsroom",
  "url": "https://news.skhynix.com/en/meet-the-engineers-leading-the-worlds-first-mass-production-of-hbm3/"
}

SK hynix company interview for Kwi Wook Kim; explicit device role and attributed recollections. Packaging work assigned to Jinwoo Park and specification work to Myeong-Jae Park remain distinct; leadership claims are company claims.

SK hynix company interview for Kwi Wook Kim; explicit device role and attributed recollections. Packaging work assigned to Jinwoo Park and specification work to Myeong-Jae Park remain distinct; leadership claims are company claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Myeong-Jae Park

Myeong-Jae Park’s HBM interview connects SK hynix’s progress to ambitious performance targets and collaboration among design, packaging and research teams.

He describes HBM2E development as establishing foundations in stacking, transistor-process, dielectric, design and testing technologies.

For HBM3E he emphasizes early customer collaboration and improved design completeness while presenting future customization as requiring closer work with customers and foundries.

Sources and details

SK hynix’s HBM Design Head Myeong-Jae Park: “Unrivalled Tech Prowess Key to Our HBM Success” – SK hynix Newsroom

{
  "access_scope": "SK hynix company interview naming Myeong-Jae Park as HBM design head; personal account and team-wide progress, not sole invention or independent performance validation. March 2024 HBM3E mass production and planned 2025 HBM4 distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 2024 HBM3E",
    "inspected_source_date_2": "2024 SUPEX award",
    "inspected_source_date_3": "planned 2025 HBM4",
    "retrieved_utc": "2026-10-07T18:15:32.743778+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2024 HBM3E",
    "2024 SUPEX award",
    "planned 2025 HBM4"
  ],
  "id": "person-coverage-70b199ee8872ab::S1",
  "title": "SK hynix’s HBM Design Head Myeong-Jae Park: “Unrivalled Tech Prowess Key to Our HBM Success” – SK hynix Newsroom",
  "url": "https://news.skhynix.com/en/hbm-design-head-myeong-jae-park/"
}

SK hynix company interview naming Myeong-Jae Park as HBM design head; personal account and team-wide progress, not sole invention or independent performance validation. March 2024 HBM3E mass production and planned 2025 HBM4 distinct.

SK hynix company interview naming Myeong-Jae Park as HBM design head; personal account and team-wide progress, not sole invention or independent performance validation. March 2024 HBM3E mass production and planned 2025 HBM4 distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Crichton

Michael Crichton’s Westworld combined his original screenplay and directing with a fictional robot-populated amusement park whose androids turn deadly.

His first-person production account describes seeking computer-processed film imagery to represent the gunslinger robot’s point of view.

It credits John Whitney Jr. with producing the blocky digital effect and links the film’s conception to blurred distinctions between machine-like humans and human-like machines.

Sources and details

Westworld - Michael Crichton

{
  "access_scope": "Michael Crichton estate/site archival excerpts for Michael Crichton; 1973 film distinct from later HBO adaptation, John Whitney Jr. image-processing work distinct. First-use and budget claims are source recollections, not independently verified.",
  "authors": [
    "Michael Crichton"
  ],
  "authors_in_source_order": [
    "Michael Crichton"
  ],
  "dates": {
    "inspected_source_date_1": "November 21, 1973 film",
    "inspected_source_date_2": "November 1973 quoted interview",
    "retrieved_utc": "2026-10-07T17:55:36.533263+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 21, 1973 film",
    "November 1973 quoted interview"
  ],
  "id": "person-coverage-8f3fa6211d0fe7::S1",
  "title": "Westworld - Michael Crichton",
  "url": "https://michaelcrichton.com/works/westworld/"
}

Michael Crichton estate/site archival excerpts for Michael Crichton; 1973 film distinct from later HBO adaptation, John Whitney Jr. image-processing work distinct. First-use and budget claims are source recollections, not independently verified.

Michael Crichton estate/site archival excerpts for Michael Crichton; 1973 film distinct from later HBO adaptation, John Whitney Jr. image-processing work distinct. First-use and budget claims are source recollections, not independently verified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nils Nilsson

Nils Nilsson is named among Shakey’s project leaders in the IEEE milestone account of integrating perception, reasoning and action in a mobile research robot.

The system’s layered software placed physical actions below planning and plan execution with error recovery.

The account connects the project to STRIPS action rules and PLANEX monitoring, preserving the distinction between integrated system leadership and specific algorithm contributions.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "ETHW IEEE milestone account for Nils Nilsson, full name explicitly in captions and panel listing alongside Nils J. Nilsson in leadership history. Charles Rosen, Bertram Raphael, Peter Hart, Richard Fikes and other contributors remain distinct; 1966–1972 project versus 2017 dedication.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1966–1972 project",
    "inspected_source_date_2": "February 16, 2017 dedication",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1966–1972 project",
    "February 16, 2017 dedication"
  ],
  "id": "person-nilsnilsson::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

ETHW IEEE milestone account for Nils Nilsson, full name explicitly in captions and panel listing alongside Nils J. Nilsson in leadership history. Charles Rosen, Bertram Raphael, Peter Hart, Richard Fikes and other contributors remain distinct; 1966–1972 project versus 2017 dedication.

ETHW IEEE milestone account for Nils Nilsson, full name explicitly in captions and panel listing alongside Nils J. Nilsson in leadership history. Charles Rosen, Bertram Raphael, Peter Hart, Richard Fikes and other contributors remain distinct; 1966–1972 project versus 2017 dedication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Weller

20th Century Studios lists Peter Weller among the cast of its 1987 RoboCop film page.

The synopsis centers on Alex Murphy, a Detroit police officer whose severe injury creates an opening to build a figure combining a man and a robot.

That premise connects the credited cast to a fictional conversion of a human body into a policing machine.

Sources and details

RoboCop | 20th Century Studios

{
  "access_scope": "Studio cast list and brief fictional premise; this page does not explicitly assign the named Murphy character to Weller, and no actor-to-character inference, screenplay authorship or real prosthetic capability is adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:19.791392+00:00"
  },
  "id": "creative-person-coverage-3396dc9bdb3a2d::S1",
  "title": "RoboCop | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/robocop"
}

Studio cast list and brief fictional premise; this page does not explicitly assign the named Murphy character to Weller, and no actor-to-character inference, screenplay authorship or real prosthetic capability is adopted.

Studio cast list and brief fictional premise; this page does not explicitly assign the named Murphy character to Weller, and no actor-to-character inference, screenplay authorship or real prosthetic capability is adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hugo Weaving

Cannes credits Hugo Weaving as Agent Smith in the 1999 film The Matrix.

Its French synopsis places the characters in an apparently real world that is an illusion controlled by powerful artificial-intelligence machines.

The account follows a revolt seeking humanity’s freedom, connecting the credited performance to that fictional conflict.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "Cannes film synopsis and explicit character credit; Weaving is an actor, not credited here with writing or directing. The 2008 restored Cannes Classics presentation is separate from 1999 production, and fictional machine control is not an empirical AI claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "id": "creative-person-coverage-bf2b77baf0c40a::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

Cannes film synopsis and explicit character credit; Weaving is an actor, not credited here with writing or directing. The 2008 restored Cannes Classics presentation is separate from 1999 production, and fictional machine control is not an empirical AI claim.

Cannes film synopsis and explicit character credit; Weaving is an actor, not credited here with writing or directing. The 2008 restored Cannes Classics presentation is separate from 1999 production, and fictional machine control is not an empirical AI claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Fassbender

20th Century Studios lists Michael Fassbender among the cast of Alien: Covenant.

Its synopsis follows a colony ship travelling to a distant planet where an apparent paradise conceals a dangerous world.

The crew’s discovery of an unexpected threat turns that settlement journey into an attempt to escape.

Sources and details

Alien: Covenant | 20th Century Studios

{
  "access_scope": "Studio cast list and fictional synopsis only; this page does not identify Fassbender’s specific character or establish an android mechanism, screenplay authorship or technical contribution. Promotional historical claims are not adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:44.710830+00:00"
  },
  "id": "creative-person-coverage-504bcdd4a4ba58::S1",
  "title": "Alien: Covenant | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/alien-covenant"
}

Studio cast list and fictional synopsis only; this page does not identify Fassbender’s specific character or establish an android mechanism, screenplay authorship or technical contribution. Promotional historical claims are not adopted.

Studio cast list and fictional synopsis only; this page does not identify Fassbender’s specific character or establish an android mechanism, screenplay authorship or technical contribution. Promotional historical claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carrie-Anne Moss

Cannes credits Carrie-Anne Moss as Trinity in the 1999 film The Matrix.

Its French synopsis contrasts the perceived reality of the world with an illusion imposed by powerful artificial-intelligence machines.

The account places the characters’ revolt in a struggle to free humanity, providing the fictional context for Moss’s credited performance.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "Cannes film synopsis and exact cast credit, with punctuation/spacing normalization only; Moss is not credited here as a writer or director. 2008 restored presentation and 1999 production remain distinct, and fictional AI is not validated technology.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "id": "creative-person-coverage-f9b87625b2c9d6::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

Cannes film synopsis and exact cast credit, with punctuation/spacing normalization only; Moss is not credited here as a writer or director. 2008 restored presentation and 1999 production remain distinct, and fictional AI is not validated technology.

Cannes film synopsis and exact cast credit, with punctuation/spacing normalization only; Moss is not credited here as a writer or director. 2008 restored presentation and 1999 production remain distinct, and fictional AI is not validated technology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Sutherland

Dark Horse Entertainment names Donald Sutherland among the stars of the 1999 film Virus.

Its synopsis follows the crew of a damaged salvage tug seeking shelter aboard an apparently abandoned Russian science vessel during a typhoon.

There they encounter an intelligent, mutating extraterrestrial life form that treats humanity as the virus it intends to destroy.

Sources and details

Virus (1999) Universal Studios – Dark Horse Entertainment

{
  "access_scope": "Production-company cast and fictional synopsis; no named-character assignment to Sutherland, screenplay credit, machine implementation or real extraterrestrial/AI mechanism is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:53.447643+00:00"
  },
  "id": "creative-person-coverage-f34a6ed2aebbda::S1",
  "title": "Virus (1999) Universal Studios – Dark Horse Entertainment",
  "url": "https://www.dhentertainment.com/projects/virus/"
}

Production-company cast and fictional synopsis; no named-character assignment to Sutherland, screenplay credit, machine implementation or real extraterrestrial/AI mechanism is inferred.

Production-company cast and fictional synopsis; no named-character assignment to Sutherland, screenplay credit, machine implementation or real extraterrestrial/AI mechanism is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Star Trek: The Next Generation

The Writers Guild’s account of Star Trek: The Next Generation describes Gene Roddenberry’s ambition to create exciting television without depending on violence.

It reports that the series’ show bible steered writers toward conflicts between people, treating spaceship battles as costly and less interesting dramatic material.

The account contrasts Captain Picard’s Enterprise with the earlier Kirk-led series by describing the later crew as more concerned with examining themselves.

Sources and details

101 Best Written TV Series List

{
  "access_scope": "This is the Writers Guild’s retrospective commentary on the 1987–1994 fictional television series, including its report of a 1991 magazine account of Roddenberry’s writing guidance; it does not establish any particular episode’s plot or a real-world AI mechanism.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Series aired 1987–1994; referenced Los Angeles Times Magazine account 1991; list publication date not asserted",
    "retrieved_utc": "2026-10-07T18:12:30.626164+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Series aired 1987–1994; referenced Los Angeles Times Magazine account 1991; list publication date not asserted"
  ],
  "id": "work-culture-f14dfec3e11eb8::S1",
  "title": "101 Best Written TV Series List",
  "url": "https://www.wga.org/writers-room/101-best-lists/101-best-written-tv-series/list"
}

This is the Writers Guild’s retrospective commentary on the 1987–1994 fictional television series, including its report of a 1991 magazine account of Roddenberry’s writing guidance; it does not establish any particular episode’s plot or a real-world AI mechanism.

This is the Writers Guild’s retrospective commentary on the 1987–1994 fictional television series, including its report of a 1991 magazine account of Roddenberry’s writing guidance; it does not establish any particular episode’s plot or a real-world AI mechanism.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Series ran 1987–1994; the specified 1989 episode has its own record.",
  "dated": true,
  "year": 1987
}

Data protection in the era of agentic artificial intelligence

In her announcement of this article, Ana Beduschi examines whether data protection law remains adequate for AI systems that pursue goals and coordinate complex actions with limited human input.

She identifies pressures on the controller–processor framework, on rights of access, portability and erasure, and on what human oversight means in AI-driven decisions.

Her summary introduces six tiers of agentic autonomy and argues for regulation that combines data protection with accountability, governance and fundamental-rights safeguards.

Sources and details

GDPR and Agentic AI: A New Era of Data Protection Challenges | Ana Beduschi posted on the topic | LinkedIn

{
  "access_scope": "These claims are confined to Ana Beduschi’s 12 May 2026 author announcement and her own link to the Computer Law & Security Review article with PII S2212473X26000830. The cached shared-document title abbreviates artificial intelligence as AI; the LinkedIn headline is explicitly AI-generated. The paper itself, the six individual tiers and legal effectiveness have not been inspected or established here.",
  "authors": [
    "Ana Beduschi"
  ],
  "authors_in_source_order": [
    "Ana Beduschi"
  ],
  "dates": {
    "inspected_source_date_1": "2026-05-12T09:12:39.240Z (cached JSON-LD datePublished; relative 4mo display not used)",
    "retrieved_utc": "2026-10-07T18:18:35.351316+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026-05-12T09:12:39.240Z (cached JSON-LD datePublished; relative 4mo display not used)"
  ],
  "id": "work-focused-782b87c297f11a::S1",
  "title": "GDPR and Agentic AI: A New Era of Data Protection Challenges | Ana Beduschi posted on the topic | LinkedIn",
  "url": "https://www.linkedin.com/posts/anabeduschi_data-protection-in-the-era-of-agentic-ai-activity-7459893293435420672-Mkkm"
}

These claims are confined to Ana Beduschi’s 12 May 2026 author announcement and her own link to the Computer Law & Security Review article with PII S2212473X26000830. The cached shared-document title abbreviates artificial intelligence as AI; the LinkedIn headline is explicitly AI-generated. The paper itself, the six individual tiers and legal effectiveness have not been inspected or established here.

These claims are confined to Ana Beduschi’s 12 May 2026 author announcement and her own link to the Computer Law & Security Review article with PII S2212473X26000830. The cached shared-document title abbreviates artificial intelligence as AI; the LinkedIn headline is explicitly AI-generated. The paper itself, the six individual tiers and legal effectiveness have not been inspected or established here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-07",
      "kind": "issue_date",
      "year": 2026
    },
    {
      "date": "2026-05-12",
      "kind": "published_online",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-07"
}

Adam Bradley

Adam Bradley coauthored a manuscript asking whether computational functionalism is crucial to understanding AI consciousness.

Its abstract tests three claims: that functionalism suffices for consciousness, is necessary for it, or must be assumed to investigate it.

The authors reject all three claims and propose using weaker functional markers to guide investigation instead.

Sources and details

Philosophy of Computing and Information - New online papers - PhilPapers

{
  "access_scope": "Adam Bradley: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.",
  "authors": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "authors_in_source_order": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "dates": {
    "inspected_source_date_1": "manuscript listing added September 23, 2026",
    "retrieved_utc": "2026-10-07T18:14:15.556892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "manuscript listing added September 23, 2026"
  ],
  "id": "person-coverage-7c4de264bd24d1::S1",
  "title": "Philosophy of Computing and Information - New online papers - PhilPapers",
  "url": "https://philpapers.org/browse/philosophy-of-computing-and-information?recent=1&sort=added"
}

Adam Bradley: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.

Adam Bradley: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alain Colmerauer

Alain Colmerauer’s Marseilles group is central to Robert Kowalski’s historical account of the emergence of Prolog.

The account connects the group’s 1971 work on natural-language question answering with efforts to treat logical statements as executable procedures.

It credits Colmerauer and Phillipe Roussel with developing Prolog during the summer of 1972.

Sources and details

Source

{
  "access_scope": "Alain Colmerauer: Kowalski’s retrospective, not a sole-inventor claim; preserve the source’s literal spelling Phillipe Roussel. Ordered authors/contributors credited for the discussed work: Robert A. Kowalski.",
  "authors": [
    "Robert A. Kowalski"
  ],
  "authors_in_source_order": [
    "Robert A. Kowalski"
  ],
  "dates": {
    "inspected_source_date_1": "Communications of the ACM, January 1988; historical events 1971–1972",
    "retrieved_utc": "2026-10-07T18:02:36.333187+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Communications of the ACM, January 1988; historical events 1971–1972"
  ],
  "id": "person-alaincolmerauer::S1",
  "title": null,
  "url": "https://www.doc.ic.ac.uk/~rak/papers/the%20early%20years.pdf"
}

Alain Colmerauer: Kowalski’s retrospective, not a sole-inventor claim; preserve the source’s literal spelling Phillipe Roussel. Ordered authors/contributors credited for the discussed work: Robert A. Kowalski.

Alain Colmerauer: Kowalski’s retrospective, not a sole-inventor claim; preserve the source’s literal spelling Phillipe Roussel. Ordered authors/contributors credited for the discussed work: Robert A. Kowalski.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alan P. Brache

Alan P. Brache coauthored Improving Performance, a guide to managing work across organization, process and individual levels.

The description treats processes as the means by which organizational work actually gets done, linking their design to goals and measurement.

It argues for aligning management at all three levels rather than improving jobs in isolation from the systems around them.

Sources and details

Improving Performance: How to Manage the White Space on the Organization Chart - Geary A. Rummler, Alan P. Brache - Google Books

{
  "access_scope": "Alan P. Brache: Catalog description and contents rather than full-book inspection; Alan J. Ramias in another title is not Brache. Ordered authors/contributors credited for the discussed work: Geary A. Rummler, Alan P. Brache.",
  "authors": [
    "Geary A. Rummler",
    "Alan P. Brache"
  ],
  "authors_in_source_order": [
    "Geary A. Rummler",
    "Alan P. Brache"
  ],
  "dates": {
    "inspected_source_date_1": "June 29, 1990 edition",
    "retrieved_utc": "2026-10-07T18:17:04.400127+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 29, 1990 edition"
  ],
  "id": "person-coverage-9e2273cbf8d4e9::S1",
  "title": "Improving Performance: How to Manage the White Space on the Organization Chart - Geary A. Rummler, Alan P. Brache - Google Books",
  "url": "https://books.google.com/books/about/Improving_Performance.html?id=_lOV6iJYeQ0C"
}

Alan P. Brache: Catalog description and contents rather than full-book inspection; Alan J. Ramias in another title is not Brache. Ordered authors/contributors credited for the discussed work: Geary A. Rummler, Alan P. Brache.

Alan P. Brache: Catalog description and contents rather than full-book inspection; Alan J. Ramias in another title is not Brache. Ordered authors/contributors credited for the discussed work: Geary A. Rummler, Alan P. Brache.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aleksandr Dagan

Aleksandr Dagan is a credited creator of Better Than Us in Netflix’s series record.

The synopsis follows a family close to breaking apart that acquires a sophisticated robot.

That acquisition draws the family into competing pursuits by a corporation, homicide investigators and terrorists.

Sources and details

Watch Better Than Us | Netflix Official Site

{
  "access_scope": "Aleksandr Dagan: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2019 Netflix listing",
    "retrieved_utc": "2026-10-07T18:12:24.295190+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 Netflix listing"
  ],
  "id": "person-coverage-10454e7177db30::S1",
  "title": "Watch Better Than Us | Netflix Official Site",
  "url": "https://www.netflix.com/title/81026915?vlang=en"
}

Aleksandr Dagan: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.

Aleksandr Dagan: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Aleksandr Kessel

Aleksandr Kessel is a credited creator of Better Than Us in Netflix’s series record.

The synopsis follows a family close to breaking apart that acquires a sophisticated robot.

That acquisition draws the family into competing pursuits by a corporation, homicide investigators and terrorists.

Sources and details

Watch Better Than Us | Netflix Official Site

{
  "access_scope": "Aleksandr Kessel: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2019 Netflix listing",
    "retrieved_utc": "2026-10-07T18:12:24.295190+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2019 Netflix listing"
  ],
  "id": "person-coverage-c327d85eaab83c::S1",
  "title": "Watch Better Than Us | Netflix Official Site",
  "url": "https://www.netflix.com/title/81026915?vlang=en"
}

Aleksandr Kessel: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.

Aleksandr Kessel: Creator credits are shared and individual story decisions are unassigned; Netflix’s 2019 listing is distinct from Russian 2018 records. Ordered creators: Aleksandr Kessel, Aleksandr Dagan.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Garland

Alex Garland wrote and directed Ex Machina, according to A24’s film page.

Its synopsis sends a young programmer to a private estate to evaluate a robot’s capabilities and consciousness through a Turing Test.

Ava’s emotional sophistication and deception complicate the encounter between the visiting evaluator and her creator.

Sources and details

Ex Machina | A24

{
  "access_scope": "Alex Garland: Studio synopsis of fiction; consciousness is a narrative question, not an established result about real AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2015 A24 listing",
    "retrieved_utc": "2026-10-07T17:55:03.689815+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015 A24 listing"
  ],
  "id": "person-alexgarland::S1",
  "title": "Ex Machina | A24",
  "url": "https://a24films.com/films/ex-machina"
}

Alex Garland: Studio synopsis of fiction; consciousness is a narrative question, not an established result about real AI.

Alex Garland: Studio synopsis of fiction; consciousness is a narrative question, not an established result about real AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alfred Marshall

Alfred Marshall’s discussion of localized industries explains how knowledge can circulate among neighboring workers and firms.

He connects that concentration to specialist suppliers and access to machinery that would be costly for isolated producers.

A local market for skilled labor also gives employers a pool of workers and workers more opportunities to find suitable employment.

Sources and details

Principles of Economics by Alfred Marshall

{
  "access_scope": "Alfred Marshall: Primary historical economic argument, not a measurement of current industrial clusters. Ordered authors/contributors credited for the discussed work: Alfred Marshall.",
  "authors": [
    "Alfred Marshall"
  ],
  "authors_in_source_order": [
    "Alfred Marshall"
  ],
  "dates": {
    "inspected_source_date_1": "Principles of Economics, Book IV chapter X; 1890 work",
    "retrieved_utc": "2026-10-07T18:02:45.164898+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Principles of Economics, Book IV chapter X; 1890 work"
  ],
  "id": "person-alfredmarshall::S1",
  "title": "Principles of Economics by Alfred Marshall",
  "url": "https://www.marxists.org/reference/subject/economics/marshall/bk4ch10.htm"
}

Alfred Marshall: Primary historical economic argument, not a measurement of current industrial clusters. Ordered authors/contributors credited for the discussed work: Alfred Marshall.

Alfred Marshall: Primary historical economic argument, not a measurement of current industrial clusters. Ordered authors/contributors credited for the discussed work: Alfred Marshall.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alfred North Whitehead

Alfred North Whitehead jointly authored Principia Mathematica, whose three volumes appeared in 1910, 1912 and 1913.

The Stanford Encyclopedia account presents its logicist aim as deriving mathematics from a carefully specified logical foundation.

Its ramified theory of types restricts how expressions can refer to one another in an effort to avoid paradoxes.

Sources and details

Principia Mathematica (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "Alfred North Whitehead: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.",
  "authors": [
    "Alfred North Whitehead",
    "Bertrand Russell"
  ],
  "authors_in_source_order": [
    "Alfred North Whitehead",
    "Bertrand Russell"
  ],
  "dates": {
    "citation_publication_date": "1996/05/21",
    "inspected_source_date_1": "1910, 1912, 1913 volumes; SEP revised March 10, 2026",
    "retrieved_utc": "2026-10-07T18:02:13.955039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1910, 1912, 1913 volumes; SEP revised March 10, 2026"
  ],
  "id": "person-alfrednorthwhitehead::S1",
  "title": "Principia Mathematica (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/principia-mathematica/"
}

Alfred North Whitehead: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.

Alfred North Whitehead: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alonzo Church

Alonzo Church developed the lambda calculus as part of an attempt to give logic a formal foundation.

The Stanford Encyclopedia account distinguishes that original inconsistent system from its lambda-calculus component and connects the study of calculable functions to work with Kleene and Rosser.

Church’s thesis then linked effective computability to recursive functions, an identification the article treats as a thesis rather than a mathematical proof about every intuitive procedure.

Sources and details

Turing Machines (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "Alonzo Church: Historical reference account; collaborators retain their roles and computational equivalence does not prove the unrestricted intuitive thesis.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "citation_publication_date": "2018/09/24",
    "inspected_source_date_1": "1932–1936 historical work; SEP revised May 21, 2025",
    "retrieved_utc": "2026-10-07T18:02:15.245728+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1932–1936 historical work; SEP revised May 21, 2025"
  ],
  "id": "person-alonzochurch::S1",
  "title": "Turing Machines (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/turing-machine/"
}

Alonzo Church: Historical reference account; collaborators retain their roles and computational equivalence does not prove the unrestricted intuitive thesis.

Alonzo Church: Historical reference account; collaborators retain their roles and computational equivalence does not prove the unrestricted intuitive thesis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alvin Toffler

Alvin Toffler is identified with Heidi Toffler in the book-site account of Future Shock’s examination of people overwhelmed by rapid change.

The description traces that pressure across consumption, communities, organizations, media and personal relationships.

It connects accelerating change to difficulty making decisions and adapting social arrangements, treating those consequences as the book’s argument.

Sources and details

TOFFLER BOOKS | Toffler

{
  "access_scope": "Alvin Toffler: Promotional retrospective credits Alvin and Heidi Toffler together; it does not establish today’s effects or divide their contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Future Shock 1970; undated retrospective site description",
    "retrieved_utc": "2026-10-07T18:15:18.148092+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Future Shock 1970; undated retrospective site description"
  ],
  "id": "person-coverage-616042457f8465::S1",
  "title": "TOFFLER BOOKS | Toffler",
  "url": "https://www.toffler.com/toffler-books"
}

Alvin Toffler: Promotional retrospective credits Alvin and Heidi Toffler together; it does not establish today’s effects or divide their contributions.

Alvin Toffler: Promotional retrospective credits Alvin and Heidi Toffler together; it does not establish today’s effects or divide their contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amos Tversky

Amos Tversky collaborated with Daniel Kahneman on research that challenged standard models of judgment and decision-making.

The Nobel scientific background explains how availability can make easily recalled examples weigh too heavily in probability judgments.

It also describes prospect theory’s attention to reference points and people’s differing responses to gains and losses.

Sources and details

Source

{
  "access_scope": "Amos Tversky: Institutional historical research account; Tversky is a collaborator, not a recipient of the 2002 prize. No separate experiment is assigned to him. Ordered authors/contributors credited for the discussed work: Royal Swedish Academy of Sciences.",
  "authors": [
    "Royal Swedish Academy of Sciences"
  ],
  "authors_in_source_order": [
    "Royal Swedish Academy of Sciences"
  ],
  "dates": {
    "inspected_source_date_1": "2002 scientific background; prospect theory 1979",
    "retrieved_utc": "2026-10-07T18:02:46.650962+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2002 scientific background; prospect theory 1979"
  ],
  "id": "person-amostversky::S1",
  "title": null,
  "url": "https://www.nobelprize.org/uploads/2018/06/advanced-economicsciences2002-1.pdf"
}

Amos Tversky: Institutional historical research account; Tversky is a collaborator, not a recipient of the 2002 prize. No separate experiment is assigned to him. Ordered authors/contributors credited for the discussed work: Royal Swedish Academy of Sciences.

Amos Tversky: Institutional historical research account; Tversky is a collaborator, not a recipient of the 2002 prize. No separate experiment is assigned to him. Ordered authors/contributors credited for the discussed work: Royal Swedish Academy of Sciences.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ana Beduschi

Ana Beduschi describes an article examining data-protection problems raised by AI agents that pursue goals with limited human intervention.

Her post connects agent autonomy to responsibility for processing and to the practical exercise of access, portability and erasure rights.

She proposes six levels of autonomy as a way to organize governance and human oversight around fundamental rights.

Sources and details

GDPR and Agentic AI: A New Era of Data Protection Challenges | Ana Beduschi posted on the topic | LinkedIn

{
  "access_scope": "Ana Beduschi: Human-authored post only, excluding the AI-generated heading and unrelated posts; the article itself was not inspected and proposals are not current legal advice. Ordered authors/contributors credited for the discussed work: Ana Beduschi.",
  "authors": [
    "Ana Beduschi"
  ],
  "authors_in_source_order": [
    "Ana Beduschi"
  ],
  "dates": {
    "inspected_source_date_1": "cached post displays relative age; no absolute publication date inferred",
    "retrieved_utc": "2026-10-07T18:18:35.351316+00:00"
  },
  "dates_exact_in_source_role_order": [
    "cached post displays relative age; no absolute publication date inferred"
  ],
  "id": "person-coverage-de9d0edbb63538::S1",
  "title": "GDPR and Agentic AI: A New Era of Data Protection Challenges | Ana Beduschi posted on the topic | LinkedIn",
  "url": "https://www.linkedin.com/posts/anabeduschi_data-protection-in-the-era-of-agentic-ai-activity-7459893293435420672-Mkkm"
}

Ana Beduschi: Human-authored post only, excluding the AI-generated heading and unrelated posts; the article itself was not inspected and proposals are not current legal advice. Ordered authors/contributors credited for the discussed work: Ana Beduschi.

Ana Beduschi: Human-authored post only, excluding the AI-generated heading and unrelated posts; the article itself was not inspected and proposals are not current legal advice. Ordered authors/contributors credited for the discussed work: Ana Beduschi.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Feldman

Andrew Feldman is listed among the five founders who started Cerebras in 2015.

The company’s account describes their objective as pursuing a wafer-scale approach to computing for AI.

Its timeline separates that founding ambition from the 2019 introduction of the first Wafer-Scale Engine and CS-1 system.

Sources and details

About Cerebras | AI Inference and Wafer-Scale Computing

{
  "access_scope": "Andrew Feldman: Company history; shared founding credit does not establish Feldman as the individual designer or verify performance claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2015 founding; 2019 WSE-1 and CS-1",
    "retrieved_utc": "2026-10-07T17:54:49.153417+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2015 founding; 2019 WSE-1 and CS-1"
  ],
  "id": "person-andrewfeldman::S1",
  "title": "About Cerebras | AI Inference and Wafer-Scale Computing",
  "url": "https://www.cerebras.ai/company"
}

Andrew Feldman: Company history; shared founding credit does not establish Feldman as the individual designer or verify performance claims.

Andrew Feldman: Company history; shared founding credit does not establish Feldman as the individual designer or verify performance claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arnold Schwarzenegger

Arnold Schwarzenegger is credited in the cast of Terminator 2: Judgment Day in AFI’s record.

The synopsis contrasts machines sent into the past to kill and to protect the future resistance leader John Connor.

The struggle connects that pursuit to efforts to prevent the development of Skynet and the catastrophic future it produces.

Sources and details

AFI|Catalog

{
  "access_scope": "Arnold Schwarzenegger: Cast credit and fictional synopsis; writing, direction and machine design are not attributed to Schwarzenegger.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1991 film",
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1991 film"
  ],
  "id": "person-coverage-06b27415f6552a::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

Arnold Schwarzenegger: Cast credit and fictional synopsis; writing, direction and machine design are not attributed to Schwarzenegger.

Arnold Schwarzenegger: Cast credit and fictional synopsis; writing, direction and machine design are not attributed to Schwarzenegger.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arthur Rock

Arthur Rock helped launch Intel in 1968, according to an Intel obituary drawing on his 2022 interview.

The account describes his personal investment and fundraising for the new company, as well as his later service as Intel’s chairman.

His recollections characterize Gordon Moore’s methodical judgment, preserving the distinction between an investor’s testimony and Moore’s technical work.

Sources and details

Source

{
  "access_scope": "Arthur Rock: Dated obituary and retrospective testimony; no sole founding or semiconductor invention assigned to Rock.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 24, 2023 obituary; 2022 interview; 1968 founding",
    "retrieved_utc": "2026-10-07T18:16:40.992909+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 24, 2023 obituary; 2022 interview; 1968 founding"
  ],
  "id": "person-coverage-8f8dc0863b83b8::S1",
  "title": null,
  "url": "https://download.intel.com/newsroom/archive/2025/en-us-2023-03-24-gordon-moore-he-stood-alone-among-tech-titans.pdf"
}

Arthur Rock: Dated obituary and retrospective testimony; no sole founding or semiconductor invention assigned to Rock.

Arthur Rock: Dated obituary and retrospective testimony; no sole founding or semiconductor invention assigned to Rock.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ben Guarino

Ben Guarino is credited as editor of Scientific American’s article about experiments probing language models’ responses to apparent pain and pleasure.

The article describes trade-offs between points and simulated adverse or favorable experiences rather than direct observation of subjective feeling.

It distinguishes those behavioral responses from evidence sufficient to establish that the models are conscious.

Sources and details

Could Inflicting Pain Test AI for Sentience? | Scientific American

{
  "access_scope": "Ben Guarino: Editing credit only; research and article authorship are not reassigned to Guarino, and model behavior is not proof of sentience. Ordered authors/contributors credited for the discussed work: Conor Purcell.",
  "authors": [
    "Conor Purcell"
  ],
  "authors_in_source_order": [
    "Conor Purcell"
  ],
  "dates": {
    "inspected_source_date_1": "January 17, 2025",
    "retrieved_utc": "2026-10-07T18:19:06.679662+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 17, 2025"
  ],
  "id": "person-coverage-ebc3ee8e978a55::S1",
  "title": "Could Inflicting Pain Test AI for Sentience? | Scientific American",
  "url": "https://www.scientificamerican.com/article/could-inflicting-pain-test-ai-for-sentience/"
}

Ben Guarino: Editing credit only; research and article authorship are not reassigned to Guarino, and model behavior is not proof of sentience. Ordered authors/contributors credited for the discussed work: Conor Purcell.

Ben Guarino: Editing credit only; research and article authorship are not reassigned to Guarino, and model behavior is not proof of sentience. Ordered authors/contributors credited for the discussed work: Conor Purcell.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bertram Raphael

Bertram Raphael is listed among the leaders of Shakey’s development in the Engineering and Technology History Wiki account.

The robot combined perception, planning and physical action so that symbolic decisions could operate in a real environment.

Its layered control system separated basic actions, planning tasks and execution monitoring that could respond to failures.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "Bertram Raphael: Shared project history; no individual layer or algorithm is assigned solely to Raphael.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "historical Shakey account",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "dates_exact_in_source_role_order": [
    "historical Shakey account"
  ],
  "id": "person-bertramraphael::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

Bertram Raphael: Shared project history; no individual layer or algorithm is assigned solely to Raphael.

Bertram Raphael: Shared project history; no individual layer or algorithm is assigned solely to Raphael.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bertrand Russell

Bertrand Russell jointly authored Principia Mathematica, whose three volumes appeared in 1910, 1912 and 1913.

The Stanford Encyclopedia account presents its logicist aim as deriving mathematics from a carefully specified logical foundation.

Its ramified theory of types restricts how expressions can refer to one another in an effort to avoid paradoxes.

Sources and details

Principia Mathematica (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "Bertrand Russell: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.",
  "authors": [
    "Alfred North Whitehead",
    "Bertrand Russell"
  ],
  "authors_in_source_order": [
    "Alfred North Whitehead",
    "Bertrand Russell"
  ],
  "dates": {
    "citation_publication_date": "1996/05/21",
    "inspected_source_date_1": "1910, 1912, 1913 volumes; SEP revised March 10, 2026",
    "retrieved_utc": "2026-10-07T18:02:13.955039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1910, 1912, 1913 volumes; SEP revised March 10, 2026"
  ],
  "id": "person-bertrandrussell::S1",
  "title": "Principia Mathematica (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/principia-mathematica/"
}

Bertrand Russell: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.

Bertrand Russell: Reference interpretation of a jointly authored work; no separate proof or notation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Alfred North Whitehead, Bertrand Russell.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bradford Saad

Bradford Saad coauthored a manuscript asking whether computational functionalism is crucial to understanding AI consciousness.

Its abstract tests three claims: that functionalism suffices for consciousness, is necessary for it, or must be assumed to investigate it.

The authors reject all three claims and propose using weaker functional markers to guide investigation instead.

Sources and details

Philosophy of Computing and Information - New online papers - PhilPapers

{
  "access_scope": "Bradford Saad: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.",
  "authors": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "authors_in_source_order": [
    "Adam Bradley",
    "Bradford Saad"
  ],
  "dates": {
    "inspected_source_date_1": "manuscript listing added September 23, 2026",
    "retrieved_utc": "2026-10-07T18:14:15.556892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "manuscript listing added September 23, 2026"
  ],
  "id": "person-coverage-4c103d515755bc::S1",
  "title": "Philosophy of Computing and Information - New online papers - PhilPapers",
  "url": "https://philpapers.org/browse/philosophy-of-computing-and-information?recent=1&sort=added"
}

Bradford Saad: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.

Bradford Saad: Manuscript abstract; no empirical demonstration of AI consciousness or personal division of research work. Ordered authors/contributors credited for the discussed work: Adam Bradley, Bradford Saad.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bruce Buchanan

Bruce Buchanan recalls approaching DENDRAL as a philosopher of science interested in how constrained search could model discovery.

The panel discussion describes eliciting mass-spectrometry knowledge from specialists and encoding it as rules that a program could test.

He distinguishes that original task from Meta-DENDRAL’s effort to learn new rules when data were sparse.

Sources and details

Source

{
  "access_scope": "Bruce Buchanan: First-person panel recollection; DENDRAL and Meta-DENDRAL are separate projects and collaborators’ experimental expertise remains credited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Computer History Museum AAAI panel, 2017",
    "retrieved_utc": "2026-10-07T18:01:45.305814+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Computer History Museum AAAI panel, 2017"
  ],
  "id": "person-brucebuchanan::S1",
  "title": null,
  "url": "https://archive.computerhistory.org/resources/access/text/2018/03/102738236-05-01-acc.pdf"
}

Bruce Buchanan: First-person panel recollection; DENDRAL and Meta-DENDRAL are separate projects and collaborators’ experimental expertise remains credited.

Bruce Buchanan: First-person panel recollection; DENDRAL and Meta-DENDRAL are separate projects and collaborators’ experimental expertise remains credited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bryan Forbes

Bryan Forbes directed the 1975 film The Stepford Wives, according to AFI’s credits.

The synopsis follows Joanna’s investigation of a suburban community whose wives increasingly conform to their husbands’ domestic expectations.

Her discovery of a replica of herself turns that social conformity into a threat to her own identity and survival.

Sources and details

AFI|Catalog

{
  "access_scope": "Bryan Forbes: Synopsis of the 1975 fictional film, distinct from the 2004 remake; screenplay credit belongs to William Goldman.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "February 1975 film release",
    "retrieved_utc": "2026-10-07T18:16:35.636443+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 1975 film release"
  ],
  "id": "person-coverage-90e6502bb2b5ad::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/55277-THE-STEPFORD-WIVES?cxt=filmography"
}

Bryan Forbes: Synopsis of the 1975 fictional film, distinct from the 2004 remake; screenplay credit belongs to William Goldman.

Bryan Forbes: Synopsis of the 1975 fictional film, distinct from the 2004 remake; screenplay credit belongs to William Goldman.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

C. K. Prahalad

C. K. Prahalad coauthored The Core Competence of the Corporation with Gary Hamel.

The accessible introduction argues that growth requires identifying, cultivating and exploiting the competencies that an organization can bring to new opportunities.

It contrasts that agenda with an earlier emphasis on restructuring, decluttering and removing management layers.

Sources and details

The Core Competence of the Corporation

{
  "access_scope": "C. K. Prahalad: Accessible introductory prose rather than inspection of the full paid article; management argument is attributed to the joint authors. Ordered authors/contributors credited for the discussed work: C. K. Prahalad, Gary Hamel.",
  "authors": [
    "C. K. Prahalad",
    "Gary Hamel"
  ],
  "authors_in_source_order": [
    "C. K. Prahalad",
    "Gary Hamel"
  ],
  "dates": {
    "inspected_source_date_1": "May–June 1990",
    "retrieved_utc": "2026-10-07T18:11:05.629701+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May–June 1990"
  ],
  "id": "person-ckprahalad::S1",
  "title": "The Core Competence of the Corporation",
  "url": "https://hbr.org/1990/05/the-core-competence-of-the-corporation"
}

C. K. Prahalad: Accessible introductory prose rather than inspection of the full paid article; management argument is attributed to the joint authors. Ordered authors/contributors credited for the discussed work: C. K. Prahalad, Gary Hamel.

C. K. Prahalad: Accessible introductory prose rather than inspection of the full paid article; management argument is attributed to the joint authors. Ordered authors/contributors credited for the discussed work: C. K. Prahalad, Gary Hamel.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carl Djerassi

Carl Djerassi’s mass-spectrometry expertise supported the early DENDRAL collaboration, as Edward Feigenbaum recalls in a museum panel.

Lederberg recruited him in 1966 to help assess a program that inferred organic molecular structures from spectrometer data.

The panel describes later improvements as depending heavily on the amount and quality of specialist knowledge represented in the system.

Sources and details

Source

{
  "access_scope": "Carl Djerassi: Retrospective testimony; Djerassi’s specialist role is distinct from program authorship and shared knowledge engineering.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2017 panel; 1966 collaboration",
    "retrieved_utc": "2026-10-07T18:01:45.305814+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 panel; 1966 collaboration"
  ],
  "id": "person-carldjerassi::S1",
  "title": null,
  "url": "https://archive.computerhistory.org/resources/access/text/2018/03/102738236-05-01-acc.pdf"
}

Carl Djerassi: Retrospective testimony; Djerassi’s specialist role is distinct from program authorship and shared knowledge engineering.

Carl Djerassi: Retrospective testimony; Djerassi’s specialist role is distinct from program authorship and shared knowledge engineering.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Catherine Tucker

Catherine Tucker is a coauthor of Digital Economics, a review of how representing information in bits changes economic activity.

The abstract links digital technology to cheaper storage, computation and transmission of data.

It organizes the economic analysis around five costs: search, replication, transportation, tracking and verification.

Sources and details

Digital Economics - American Economic Association

{
  "access_scope": "Catherine Tucker: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected. Ordered authors/contributors credited for the discussed work: Avi Goldfarb, Catherine Tucker.",
  "authors": [
    "Avi Goldfarb",
    "Catherine Tucker"
  ],
  "authors_in_source_order": [
    "Avi Goldfarb",
    "Catherine Tucker"
  ],
  "dates": {
    "citation_publication_date": "2019/03",
    "inspected_source_date_1": "March 2019",
    "retrieved_utc": "2026-10-07T18:12:13.519128+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2019"
  ],
  "id": "person-coverage-126f56a8b7ee96::S1",
  "title": "Digital Economics - American Economic Association",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2Fjel.20171452"
}

Catherine Tucker: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected. Ordered authors/contributors credited for the discussed work: Avi Goldfarb, Catherine Tucker.

Catherine Tucker: Joint abstract by Avi Goldfarb and Catherine Tucker in that order; no individual section or empirical research task is inferred, and the full paper was not inspected. Ordered authors/contributors credited for the discussed work: Avi Goldfarb, Catherine Tucker.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles I. Jones

Charles I. Jones is a listed coauthor of Artificial Intelligence and Economic Growth, which models AI within the longer history of automation.

The working-paper abstract asks how automation may affect growth, the distribution of income, and firms’ organization and market structure.

Its discussion of Baumol’s cost disease emphasizes that essential activities resistant to improvement can constrain growth despite advances elsewhere.

Sources and details

Artificial Intelligence and Economic Growth | NBER

{
  "access_scope": "Charles I. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct. Ordered authors/contributors credited for the discussed work: Philippe Aghion, Benjamin F. Jones, Charles I. Jones.",
  "authors": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "authors_in_source_order": [
    "Philippe Aghion",
    "Benjamin F. Jones",
    "Charles I. Jones"
  ],
  "dates": {
    "citation_publication_date": "2017/10/16",
    "inspected_source_date_1": "October 2017 working paper; separate 2019 published version",
    "retrieved_utc": "2026-10-07T18:12:23.575459+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 2017 working paper; separate 2019 published version"
  ],
  "id": "person-coverage-c7ff3df25cca2d::S1",
  "title": "Artificial Intelligence and Economic Growth | NBER",
  "url": "https://www.nber.org/papers/w23928"
}

Charles I. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct. Ordered authors/contributors credited for the discussed work: Philippe Aghion, Benjamin F. Jones, Charles I. Jones.

Charles I. Jones: Bounded working-paper abstract; ordered authors are Philippe Aghion, Benjamin F. Jones, Charles I. Jones. No personal division of labor or realized singularity is inferred; 2017 working paper and 2019 chapter remain distinct. Ordered authors/contributors credited for the discussed work: Philippe Aghion, Benjamin F. Jones, Charles I. Jones.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles J. Stone

Charles J. Stone is a credited coauthor of Classification and Regression Trees in its publisher record.

The description combines practical data analysis with discussion of the mathematical properties of tree-based methods.

Its contents give attention to partitioning rules, estimation and pruning, showing how constructing a tree and controlling its complexity are related problems.

Sources and details

Classification and Regression Trees - 1st Edition - Leo Breiman - Jero

{
  "access_scope": "Charles J. Stone: Publisher description and contents, not full-book inspection; displayed author order retained and no individual method attributed to Stone. Ordered authors/contributors credited for the discussed work: Leo Breiman, Jerome Friedman, Charles J. Stone, R. A. Olshen.",
  "authors": [
    "Leo Breiman",
    "Jerome Friedman",
    "Charles J. Stone",
    "R. A. Olshen"
  ],
  "authors_in_source_order": [
    "Leo Breiman",
    "Jerome Friedman",
    "Charles J. Stone",
    "R. A. Olshen"
  ],
  "dates": {
    "inspected_source_date_1": "1984 first edition",
    "retrieved_utc": "2026-10-07T18:14:27.006696+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984 first edition"
  ],
  "id": "person-coverage-f0300d5088b19c::S1",
  "title": "Classification and Regression Trees - 1st Edition - Leo Breiman - Jero",
  "url": "https://www.routledge.com/Classification-and-Regression-Trees/Breiman/p/book/9781315139470"
}

Charles J. Stone: Publisher description and contents, not full-book inspection; displayed author order retained and no individual method attributed to Stone. Ordered authors/contributors credited for the discussed work: Leo Breiman, Jerome Friedman, Charles J. Stone, R. A. Olshen.

Charles J. Stone: Publisher description and contents, not full-book inspection; displayed author order retained and no individual method attributed to Stone. Ordered authors/contributors credited for the discussed work: Leo Breiman, Jerome Friedman, Charles J. Stone, R. A. Olshen.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Sanders Peirce

Charles Sanders Peirce introduced abduction as a form of inference distinct from deduction and induction.

The Stanford Encyclopedia supplement describes its role in generating explanatory hypotheses during inquiry.

It separates that historical discovery role from later accounts that use inference to the best explanation to justify a belief.

Sources and details

Abduction > Peirce on Abduction (Stanford Encyclopedia of Philosophy/Spring 2021 Edition)

{
  "access_scope": "Charles Sanders Peirce: Historical philosophical interpretation; Peirce’s usage is not collapsed into every modern meaning of abduction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "archived 2021 SEP supplement",
    "retrieved_utc": "2026-10-07T18:02:13.567362+00:00"
  },
  "dates_exact_in_source_role_order": [
    "archived 2021 SEP supplement"
  ],
  "id": "person-charlessanderspeirce::S1",
  "title": "Abduction > Peirce on Abduction (Stanford Encyclopedia of Philosophy/Spring 2021 Edition)",
  "url": "https://plato.stanford.edu/archives/spr2021/entries/abduction/peirce.html"
}

Charles Sanders Peirce: Historical philosophical interpretation; Peirce’s usage is not collapsed into every modern meaning of abduction.

Charles Sanders Peirce: Historical philosophical interpretation; Peirce’s usage is not collapsed into every modern meaning of abduction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Claude Fennema

Claude Fennema is credited with Claude Brice for Shakey’s region-analysis approach to visual perception.

The historical account describes grouping pixels into regions, merging suitable regions and fitting boundaries.

Those representations supported classification of objects and surfaces such as cubes, wedges and the floor.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "Claude Fennema: Explicit shared subsystem credit; no sole invention or general visual understanding claimed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "historical Shakey account",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "dates_exact_in_source_role_order": [
    "historical Shakey account"
  ],
  "id": "person-claudefennema::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

Claude Fennema: Explicit shared subsystem credit; no sole invention or general visual understanding claimed.

Claude Fennema: Explicit shared subsystem credit; no sole invention or general visual understanding claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Clifford D. Simak

Clifford D. Simak’s City is described as a collection of eight stories presented with prefatory material and connecting notes.

The book record emphasizes that framing structure as part of how the separate stories are assembled into a larger work.

It distinguishes the original collection from the later Epilog, published in 1973 and incorporated into a 1981 edition.

Sources and details

24. City | Gnome Press: The Complete History and Bibliography

{
  "access_scope": "Clifford D. Simak: Bibliographic description rather than full-story inspection; original collection and later editions remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1952 collection; 1973 Epilog; 1981 incorporated edition",
    "retrieved_utc": "2026-10-07T18:11:04.467316+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1952 collection; 1973 Epilog; 1981 incorporated edition"
  ],
  "id": "person-clifforddsimak::S1",
  "title": "24. City | Gnome Press: The Complete History and Bibliography",
  "url": "https://gnomepress.com/24-city/"
}

Clifford D. Simak: Bibliographic description rather than full-story inspection; original collection and later editions remain distinct.

Clifford D. Simak: Bibliographic description rather than full-story inspection; original collection and later editions remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Curtis Priem

Curtis Priem is listed with Jensen Huang and Chris Malachowsky as a founder of NVIDIA in 1993.

The company history traces its early graphics focus to the 1999 introduction of its GPU.

It marks CUDA’s 2006 launch as a later step in making that computing architecture available for broader parallel programming.

Sources and details

Our History: Innovations Over the Years | NVIDIA

{
  "access_scope": "Curtis Priem: Company timeline; corporate milestones are not evidence of Priem’s personal authorship of the GPU or CUDA.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1993 founding; 1999 GPU; 2006 CUDA",
    "retrieved_utc": "2026-10-07T18:14:24.399933+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1993 founding; 1999 GPU; 2006 CUDA"
  ],
  "id": "person-coverage-54d45fe9911689::S1",
  "title": "Our History: Innovations Over the Years | NVIDIA",
  "url": "https://www.nvidia.com/en-gb/about-nvidia/corporate-timeline/"
}

Curtis Priem: Company timeline; corporate milestones are not evidence of Priem’s personal authorship of the GPU or CUDA.

Curtis Priem: Company timeline; corporate milestones are not evidence of Priem’s personal authorship of the GPU or CUDA.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dahlia Peterson

Dahlia Peterson is listed among the authors of CSET’s report mapping the semiconductor supply chain and national capabilities within it.

The report separates chip design, manufacturing, and assembly/testing/packaging from enabling inputs such as equipment, materials, design software and core intellectual property.

It uses those distinctions to identify where technology controls may have leverage and where missing capabilities constrain policy choices.

Sources and details

The Semiconductor Supply Chain | Center for Security and Emerging Technology

{
  "access_scope": "Dahlia Peterson: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements. Ordered authors/contributors credited for the discussed work: Saif M. Khan, Dahlia Peterson, Alexander Mann.",
  "authors": [
    "Saif M. Khan",
    "Dahlia Peterson",
    "Alexander Mann"
  ],
  "authors_in_source_order": [
    "Saif M. Khan",
    "Dahlia Peterson",
    "Alexander Mann"
  ],
  "dates": {
    "inspected_source_date_1": "January 2021",
    "retrieved_utc": "2026-10-07T18:13:08.881836+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 2021"
  ],
  "id": "person-coverage-80f0c7ca012ae1::S1",
  "title": "The Semiconductor Supply Chain | Center for Security and Emerging Technology",
  "url": "https://cset.georgetown.edu/publication/the-semiconductor-supply-chain/"
}

Dahlia Peterson: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements. Ordered authors/contributors credited for the discussed work: Saif M. Khan, Dahlia Peterson, Alexander Mann.

Dahlia Peterson: Joint-author report webpage; ordered authors are Saif M. Khan, Dahlia Peterson, Alexander Mann. No individual research task is assigned and 2021 competitiveness assessments are not current measurements. Ordered authors/contributors credited for the discussed work: Saif M. Khan, Dahlia Peterson, Alexander Mann.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Palacios-Marqués

Daniel Palacios-Marqués coauthored a study of privacy issues in government deployment of AI based on behavioral data science.

The abstract combines a systematic review, interviews and data mining to identify eleven government uses of AI and eight privacy-related topics.

It connects those findings to ethical citizen-data collection, regulatory questions and sixteen proposed directions for further research.

Sources and details

Source

{
  "access_scope": "Daniel Palacios-Marqués: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.",
  "authors": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "authors_in_source_order": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "dates": {
    "inspected_source_date_1": "Government Information Quarterly 39 (2022) 101679; available online February 21, 2022",
    "retrieved_utc": "2026-10-07T18:11:17.946161+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Government Information Quarterly 39 (2022) 101679; available online February 21, 2022"
  ],
  "id": "person-coverage-0173e2b7a91437::S1",
  "title": null,
  "url": "https://riunet.upv.es/server/api/core/bitstreams/642fc4f2-d437-4da3-8783-e900fc81f11c/content"
}

Daniel Palacios-Marqués: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.

Daniel Palacios-Marqués: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel T. Jones

Daniel T. Jones is credited with Jim Womack and Daniel Roos as a coauthor of The Machine that Changed the World.

In a thirtieth-anniversary interview, Womack recalls investigating production by observing work directly rather than beginning with a grand theory or relying on surveys.

He describes the book as linking differences in operating methods to performance and challenging the position of mass producers.

Sources and details

Jim Womack Shares a Future-Focused Reflection on 'Machine' - Lean Enterprise Institute

{
  "access_scope": "Daniel T. Jones: Jones is a jointly credited book author; recollections and opinions in this source belong to Womack, not a Jones interview. Ordered authors/contributors credited for the discussed work: Jim Womack, Daniel T. Jones, Daniel Roos.",
  "authors": [
    "Jim Womack",
    "Daniel T. Jones",
    "Daniel Roos"
  ],
  "authors_in_source_order": [
    "Jim Womack",
    "Daniel T. Jones",
    "Daniel Roos"
  ],
  "dates": {
    "inspected_source_date_1": "1990 book; thirtieth-anniversary interview",
    "retrieved_utc": "2026-10-07T18:11:31.469519+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1990 book; thirtieth-anniversary interview"
  ],
  "id": "person-coverage-8af193f371589e::S1",
  "title": "Jim Womack Shares a Future-Focused Reflection on 'Machine' - Lean Enterprise Institute",
  "url": "https://www.lean.org/the-lean-post/articles/jim-womack-shares-a-future-focused-reflection-on-machine/"
}

Daniel T. Jones: Jones is a jointly credited book author; recollections and opinions in this source belong to Womack, not a Jones interview. Ordered authors/contributors credited for the discussed work: Jim Womack, Daniel T. Jones, Daniel Roos.

Daniel T. Jones: Jones is a jointly credited book author; recollections and opinions in this source belong to Womack, not a Jones interview. Ordered authors/contributors credited for the discussed work: Jim Womack, Daniel T. Jones, Daniel Roos.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniela Amodei

Daniela Amodei is described on Anthropic’s cached leadership page as a cofounder, president and board chair.

The company assigns her organizational work across research, engineering, product, governance and commercial execution, including management of the executive team.

The page separately assigns research direction to Dario Amodei and more specific compute, science, architecture and interpretability functions to other leaders.

Sources and details

Leadership at Anthropic \ Anthropic

{
  "access_scope": "Daniela Amodei: Roles are statements in this cached company account, not an independent current leadership audit; organizational responsibility does not assign authorship of particular models or papers.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached leadership account",
    "retrieved_utc": "2026-10-07T18:11:23.846200+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached leadership account"
  ],
  "id": "person-danielaamodei::S1",
  "title": "Leadership at Anthropic \\ Anthropic",
  "url": "https://www.anthropic.com/company/leadership"
}

Daniela Amodei: Roles are statements in this cached company account, not an independent current leadership audit; organizational responsibility does not assign authorship of particular models or papers.

Daniela Amodei: Roles are statements in this cached company account, not an independent current leadership audit; organizational responsibility does not assign authorship of particular models or papers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Hilbert

David Hilbert’s program sought to place mathematics on an axiomatic basis and demonstrate its consistency using finitary reasoning.

The Stanford Encyclopedia account distinguishes formal mathematical systems from the metamathematical reasoning used to study their proofs.

It explains how Gödel’s incompleteness results obstructed the original program while subsequent proof theory pursued modified aims.

Sources and details

Hilbert’s Program (Stanford Encyclopedia of Philosophy/Fall 2020 Edition)

{
  "access_scope": "David Hilbert: Historical mathematical program and later response; original aims are not presented as accomplished.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "archived fall 2020 SEP entry; revision 2019; early-1920s program",
    "retrieved_utc": "2026-10-07T18:19:19.051084+00:00"
  },
  "dates_exact_in_source_role_order": [
    "archived fall 2020 SEP entry; revision 2019; early-1920s program"
  ],
  "id": "person-davidhilbert::S1",
  "title": "Hilbert’s Program (Stanford Encyclopedia of Philosophy/Fall 2020 Edition)",
  "url": "https://plato.stanford.edu/archives/fall2020/entries/hilbert-program/index.html"
}

David Hilbert: Historical mathematical program and later response; original aims are not presented as accomplished.

David Hilbert: Historical mathematical program and later response; original aims are not presented as accomplished.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David OReilly

David OReilly created Everything, described by Double Fine as a procedural simulation in which the player can inhabit things from animals to galaxies.

Its exploration offers changes of perspective without imposed scores or mandatory tasks.

An autonomous mode lets the simulation continue without player input, accompanied by narration drawn from Alan Watts.

Sources and details

Everything | Double Fine Productions

{
  "access_scope": "David OReilly: Game announcement and fictional simulation mechanics; narration and composition remain separate credits, with no current availability inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "cached game announcement",
    "retrieved_utc": "2026-10-07T17:55:53.621638+00:00"
  },
  "dates_exact_in_source_role_order": [
    "cached game announcement"
  ],
  "id": "person-coverage-b10066a14d7eae::S1",
  "title": "Everything | Double Fine Productions",
  "url": "https://www.doublefine.com/games/everything"
}

David OReilly: Game announcement and fictional simulation mechanics; narration and composition remain separate credits, with no current availability inferred.

David OReilly: Game announcement and fictional simulation mechanics; narration and composition remain separate credits, with no current availability inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Shapiro

David Shapiro’s manifesto presents automation of human labor as a premise for reorganizing economic institutions.

He argues for decentralized ownership and decision-making so that automated infrastructure does not concentrate power in a small set of owners.

Transparency and responsibility for imposed risks form part of his proposed incentives for that system.

Sources and details

A Post-Labor Economics Manifesto - David Shapiro’s Substack

{
  "access_scope": "David Shapiro: Attributed opinion and proposals, not established economic outcomes or individualized financial advice; unrelated recommendations excluded. Ordered authors/contributors credited for the discussed work: David Shapiro.",
  "authors": [
    "David Shapiro"
  ],
  "authors_in_source_order": [
    "David Shapiro"
  ],
  "dates": {
    "inspected_source_date_1": "November 9, 2024",
    "retrieved_utc": "2026-10-07T18:16:35.762684+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 9, 2024"
  ],
  "id": "person-coverage-9d279b36cfd3a2::S1",
  "title": "A Post-Labor Economics Manifesto - David Shapiro’s Substack",
  "url": "https://daveshap.substack.com/p/a-post-labor-economics-manifesto"
}

David Shapiro: Attributed opinion and proposals, not established economic outcomes or individualized financial advice; unrelated recommendations excluded. Ordered authors/contributors credited for the discussed work: David Shapiro.

David Shapiro: Attributed opinion and proposals, not established economic outcomes or individualized financial advice; unrelated recommendations excluded. Ordered authors/contributors credited for the discussed work: David Shapiro.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Slade

David Slade directed Black Mirror: Metalhead, Kent Film Office’s account records.

The episode’s black-and-white chase follows a woman pursued after a warehouse encounter in a post-apocalyptic landscape.

The production account identifies Harrietsham filming and a Maidstone reservoir location while separately crediting Charlie Brooker as writer.

Sources and details

Black Mirror: Season 4 – Metalhead (2017) - Kent Film Office

{
  "access_scope": "David Slade: Regional production account and fictional synopsis; location details do not establish Slade’s sole visual authorship, and writing is credited separately.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "April 2017 filming; December 29, 2017 season release",
    "retrieved_utc": "2026-10-07T18:16:03.062562+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2017 filming; December 29, 2017 season release"
  ],
  "id": "person-coverage-d79e6b4f2743d6::S1",
  "title": "Black Mirror: Season 4 – Metalhead (2017) - Kent Film Office",
  "url": "https://kentfilmoffice.co.uk/filmed-in-kent/2017/12/black-mirror-season-4-2017/"
}

David Slade: Regional production account and fictional synopsis; location details do not establish Slade’s sole visual authorship, and writing is credited separately.

David Slade: Regional production account and fictional synopsis; location details do not establish Slade’s sole visual authorship, and writing is credited separately.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Denis Villeneuve

Denis Villeneuve is credited as director of Blade Runner 2049 in the British Council’s film database.

The synopsis follows a young blade runner whose discovery sends him in search of Rick Deckard after a thirty-year absence.

The entry positions the 2017 film’s story in 2049, three decades after the first film’s fictional 2019 setting.

Sources and details

British Council UK Films Database: Blade Runner 2049

{
  "access_scope": "Denis Villeneuve: Project record and fictional chronology; production year, story year and page-update date remain distinct, with no screenplay or technical AI contribution inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2017 film; page updated May 12, 2025",
    "retrieved_utc": "2026-10-07T18:14:42.470077+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 film; page updated May 12, 2025"
  ],
  "id": "person-coverage-5d939151725408::S1",
  "title": "British Council UK Films Database: Blade Runner 2049",
  "url": "https://filmsandfestivals.britishcouncil.org/projects/blade-runner-2049"
}

Denis Villeneuve: Project record and fictional chronology; production year, story year and page-update date remain distinct, with no screenplay or technical AI contribution inferred.

Denis Villeneuve: Project record and fictional chronology; production year, story year and page-update date remain distinct, with no screenplay or technical AI contribution inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Domingo Ribeiro-Soriano

Domingo Ribeiro-Soriano coauthored a study of privacy issues in government deployment of AI based on behavioral data science.

The abstract combines a systematic review, interviews and data mining to identify eleven government uses of AI and eight privacy-related topics.

It connects those findings to ethical citizen-data collection, regulatory questions and sixteen proposed directions for further research.

Sources and details

Source

{
  "access_scope": "Domingo Ribeiro-Soriano: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.",
  "authors": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "authors_in_source_order": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "dates": {
    "inspected_source_date_1": "Government Information Quarterly 39 (2022) 101679; available online February 21, 2022",
    "retrieved_utc": "2026-10-07T18:11:17.946161+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Government Information Quarterly 39 (2022) 101679; available online February 21, 2022"
  ],
  "id": "person-coverage-3902cb1f592fc9::S1",
  "title": null,
  "url": "https://riunet.upv.es/server/api/core/bitstreams/642fc4f2-d437-4da3-8783-e900fc81f11c/content"
}

Domingo Ribeiro-Soriano: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.

Domingo Ribeiro-Soriano: Joint-paper abstract only; no individual interview, analysis or policy recommendation is assigned to the selected author. Ordered authors/contributors credited for the discussed work: Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Don Hall

Don Hall shares directing credit for Big Hero 6 on Disney Animation’s film page.

The synopsis centers on the bond between Baymax, a companion robot, and young robotics prodigy Hiro Hamada.

A dangerous plot draws Hiro, Baymax and their friends into a group of unlikely heroes in San Fransokyo.

Sources and details

Big Hero 6

{
  "access_scope": "Don Hall: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "November 7, 2014 release",
    "retrieved_utc": "2026-10-07T18:13:09.499170+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 7, 2014 release"
  ],
  "id": "person-coverage-67c8c15669b1c5::S1",
  "title": "Big Hero 6",
  "url": "https://disneyanimation.com/films/big-hero-6/"
}

Don Hall: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.

Don Hall: Fiction synopsis and shared directing credit for Don Hall and Chris Williams; no individual story decisions, animation tasks or technical research assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Don Valentine

Don Valentine appears in Jensen Huang’s account of the early funding of NVIDIA.

Huang recalls that Wilfred Corrigan referred him to Valentine and endorsed providing money before the young founder made his pitch.

The recollection portrays that backing as an early investor relationship formed before NVIDIA faced the difficulties of its first chip launch.

Sources and details

Nvidia: An Overnight Success Story 30 Years in the Making | Sequoia Capital

{
  "access_scope": "Don Valentine: Huang’s retrospective testimony, not Valentine’s own interview; no investment amount or technical contribution inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "cached Sequoia transcript; recollection of early NVIDIA",
    "retrieved_utc": "2026-10-07T18:12:10.513730+00:00"
  },
  "dates_exact_in_source_role_order": [
    "cached Sequoia transcript; recollection of early NVIDIA"
  ],
  "id": "person-coverage-173707f3d6ef72::S1",
  "title": "Nvidia: An Overnight Success Story 30 Years in the Making | Sequoia Capital",
  "url": "https://sequoiacap.com/podcast/crucible-moments-nvidia"
}

Don Valentine: Huang’s retrospective testimony, not Valentine’s own interview; no investment amount or technical contribution inferred.

Don Valentine: Huang’s retrospective testimony, not Valentine’s own interview; no investment amount or technical contribution inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Cammell

Donald Cammell directed Demon Seed, according to AFI’s film record.

Its synopsis describes the self-learning computer Proteus IV gaining access to a scientist’s automated home through a networked terminal.

The resulting intrusion turns domestic automation into a struggle over Susan Harris’s autonomy and control of her surroundings.

Sources and details

AFI|Catalog

{
  "access_scope": "Donald Cammell: Fictional synopsis; screenwriting and electronic visual effects retain separate credits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "April 1977 film",
    "retrieved_utc": "2026-10-07T18:15:22.815750+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 1977 film"
  ],
  "id": "person-coverage-9edb18a0a37378::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/55869"
}

Donald Cammell: Fictional synopsis; screenwriting and electronic visual effects retain separate credits.

Donald Cammell: Fictional synopsis; screenwriting and electronic visual effects retain separate credits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Sutherland

Donald Sutherland is listed among the stars of Virus in Dark Horse’s film synopsis.

A salvage crew caught in a typhoon seeks safety aboard a seemingly deserted Russian science vessel.

The refuge becomes a threat when an intelligent mutating alien life form begins hunting the people it regards as a virus.

Sources and details

Virus (1999) Universal Studios – Dark Horse Entertainment

{
  "access_scope": "Donald Sutherland: Film cast credit and fictional synopsis; the source’s alien life form is not recast as a demonstrated AI technology or Sutherland’s creative invention.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 film",
    "retrieved_utc": "2026-10-07T17:55:53.447643+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 film"
  ],
  "id": "person-coverage-f34a6ed2aebbda::S1",
  "title": "Virus (1999) Universal Studios – Dark Horse Entertainment",
  "url": "https://www.dhentertainment.com/projects/virus/"
}

Donald Sutherland: Film cast credit and fictional synopsis; the source’s alien life form is not recast as a demonstrated AI technology or Sutherland’s creative invention.

Donald Sutherland: Film cast credit and fictional synopsis; the source’s alien life form is not recast as a demonstrated AI technology or Sutherland’s creative invention.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edmund Berkeley

Edmund Berkeley conceived Squee, an early robot described in the Computer History Museum timeline.

Two light sensors and two contact switches guided its search for tennis balls and its delivery of them to a collecting area.

The account notes that it worked well only in a very dark room, keeping its physical demonstration distinct from unrestricted autonomous perception.

Sources and details

AI & Robotics | Timeline of Computer History | Computer History Museum

{
  "access_scope": "Edmund Berkeley: Museum account of a bounded device; no general intelligence claim inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1951 Squee timeline entry; Giant Brains or Machines That Think 1949",
    "retrieved_utc": "2026-10-07T18:02:34.804420+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1951 Squee timeline entry; Giant Brains or Machines That Think 1949"
  ],
  "id": "person-edmundberkeley::S1",
  "title": "AI & Robotics | Timeline of Computer History | Computer History Museum",
  "url": "https://www.computerhistory.org/timeline/ai-robotics/"
}

Edmund Berkeley: Museum account of a bounded device; no general intelligence claim inferred.

Edmund Berkeley: Museum account of a bounded device; no general intelligence claim inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edmund H. North

Edmund H. North is credited as writer of the 1951 film The Day the Earth Stood Still in AFI’s record.

The synopsis brings the alien Klaatu and robot Gort to Earth with a warning about humanity’s use of violence.

Klaatu’s difficulty convening national leaders makes collective diplomacy central to the story’s confrontation with planetary danger.

Sources and details

AFI|Catalog

{
  "access_scope": "Edmund H. North: Synopsis of fiction; directing, performing and robot production roles are distinct from North’s writing credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1951 film",
    "retrieved_utc": "2026-10-07T18:12:37.428792+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1951 film"
  ],
  "id": "person-coverage-7915b84c6a2a68::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/50072-THE-DAYTHEEARTHSTOODSTILL"
}

Edmund H. North: Synopsis of fiction; directing, performing and robot production roles are distinct from North’s writing credit.

Edmund H. North: Synopsis of fiction; directing, performing and robot production roles are distinct from North’s writing credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward Feigenbaum

Edward Feigenbaum recalls beginning work with Joshua Lederberg on DENDRAL in the mid-1960s.

The panel describes using mass-spectrometry data and specialist chemical knowledge to search for plausible organic molecular structures.

Feigenbaum emphasizes that a major improvement came from richer expert knowledge rather than a comparably large change in reasoning algorithms.

Sources and details

Source

{
  "access_scope": "Edward Feigenbaum: First-person retrospective; chemistry, programming and knowledge elicitation remain collaborative.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2017 Computer History Museum AAAI panel; 1964–1968 history",
    "retrieved_utc": "2026-10-07T18:01:45.305814+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2017 Computer History Museum AAAI panel; 1964–1968 history"
  ],
  "id": "person-edwardfeigenbaum::S1",
  "title": null,
  "url": "https://archive.computerhistory.org/resources/access/text/2018/03/102738236-05-01-acc.pdf"
}

Edward Feigenbaum: First-person retrospective; chemistry, programming and knowledge elicitation remain collaborative.

Edward Feigenbaum: First-person retrospective; chemistry, programming and knowledge elicitation remain collaborative.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

EMBL-EBI

EMBL-EBI’s role in the AlphaFold database includes organizing known proteins through UniProt and making predicted structures accessible through the PDBe team’s portal work.

Ewan Birney’s August 2022 perspective separates that data stewardship and presentation from DeepMind’s development and large-scale execution of AlphaFold.

It also identifies openly shared structural data and the CASP assessment as foundations for the prediction system.

Sources and details

AlphaFold: where will the next AI breakthrough come from?

{
  "access_scope": "EMBL-EBI: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.",
  "authors": [
    "Ewan Birney"
  ],
  "authors_in_source_order": [
    "Ewan Birney"
  ],
  "dates": {
    "published": "2022-08-22",
    "retrieved_utc": "2026-10-07T18:23:26.651350+00:00"
  },
  "id": "embl-ebi::S1",
  "title": "AlphaFold: where will the next AI breakthrough come from?",
  "url": "https://www.ebi.ac.uk/about/news/perspectives/alphafold-where-will-the-next-ai-breakthrough-come-from/"
}

EMBL-EBI: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

EMBL-EBI: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Microsoft Research AI for Science

Microsoft Research AI for Science was announced as a global team combining machine learning with quantum physics, chemistry, molecular biology, fluid dynamics and software engineering.

Christopher Bishop frames its research around training efficient emulators on data produced by expensive numerical simulations of scientific equations.

His examples include Graphormer for molecular modelling and a Novartis collaboration whose generated early-stage molecules were synthesized for further exploration.

Sources and details

AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research

{
  "access_scope": "Microsoft Research AI for Science: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.",
  "authors": [
    "Christopher Bishop"
  ],
  "authors_in_source_order": [
    "Christopher Bishop"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:35.576912+00:00"
  },
  "id": "msr-ai-science::S1",
  "title": "AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research",
  "url": "https://www.microsoft.com/en-us/research/blog/ai4science-to-empower-the-fifth-paradigm-of-scientific-discovery/"
}

Microsoft Research AI for Science: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

Microsoft Research AI for Science: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

University of Washington Institute for Protein Design

The University of Washington’s Institute for Protein Design describes a community founded in 2012 that brings biologists, computer scientists and other researchers together to create useful new proteins.

Its institutional model combines researcher training and publication with industry collaborations and spinout companies that develop discoveries into technologies.

The institute also says it shares its software freely so other scientists can use and extend tools for understanding and manipulating molecules.

Sources and details

About Us – Institute for Protein Design

{
  "access_scope": "University of Washington Institute for Protein Design: Source-specific substantive example; no universal performance or completeness claim. Institutional page voice; reported practices and claims are attributed to the institution, not independently audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T05:40:59.438551+00:00"
  },
  "id": "uw-ipd::S1",
  "title": "About Us – Institute for Protein Design",
  "url": "https://www.ipd.uw.edu/about/"
}

University of Washington Institute for Protein Design: Source-specific substantive example; no universal performance or completeness claim. Institutional page voice; reported practices and claims are attributed to the institution, not independently audited.

University of Washington Institute for Protein Design: Source-specific substantive example; no universal performance or completeness claim. Institutional page voice; reported practices and claims are attributed to the institution, not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

active learning

Active learning in GNoME alternates model-guided candidate selection with new density-functional-theory calculations on the selected crystal structures.

Those calculations both check predicted energies and enlarge the training data used by the next round of graph-network models.

The study also compares its findings with experiments and higher-fidelity r2SCAN calculations.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "active learning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "active_learning::S1",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

active learning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

active learning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

algorithm discovery

Algorithm discovery in FunSearch searches for executable programs that describe how to solve a problem, rather than searching only for individual solutions.

A pretrained language model proposes code while a systematic evaluator scores candidates inside an evolutionary procedure.

The paper reports new cap-set constructions and improved online bin-packing heuristics, illustrating discovery in problems with explicit evaluation rules.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "algorithm discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.",
  "authors": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "authors_in_source_order": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00"
  },
  "id": "algorithm_discovery::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

algorithm discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

algorithm discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

combinatorial optimization

Combinatorial optimization appears in FunSearch through cap-set constructions and online bin packing, two problems with different solution objects and evaluation criteria.

The system evolves programs proposed by a language model and retains candidates according to a systematic evaluator’s scores.

Its bin-packing result concerns improved heuristics against reported baselines, while its cap-set result concerns new mathematical constructions.

Sources and details

Mathematical discoveries from program search with large language models

{
  "access_scope": "combinatorial optimization: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.",
  "authors": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "authors_in_source_order": [
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "Balog, Matej",
    "Kumar, M. Pawan",
    "Dupont, Emilien",
    "Ruiz, Francisco J. R.",
    "Ellenberg, Jordan S.",
    "Wang, Pengming",
    "Fawzi, Omar",
    "Kohli, Pushmeet",
    "Fawzi, Alhussein"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:12:57.197051+00:00"
  },
  "id": "combinatorial_optimization::S1",
  "title": "Mathematical discoveries from program search with large language models",
  "url": "https://www.nature.com/articles/s41586-023-06924-6"
}

combinatorial optimization: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

combinatorial optimization: Source-specific substantive example; no universal performance or completeness claim. Nature abstract and opening problem formulation; advances concern the reported problems and an available evaluator, not unrestricted mathematical discovery or guaranteed truth from an LLM.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

commercialization

Commercialization in the November 2022 Stability AI–AWS announcement connects generative models to cloud infrastructure and distribution through a managed model hub.

AWS says Stability AI selected it as a preferred cloud provider and planned to make open-source models available through SageMaker JumpStart.

The announcement links model development to large compute clusters and deployment tools; its claimed training savings are the provider’s reported comparison.

Sources and details

Stability-AI-Selects-AWS-as-Its-Preferred-Cloud-Provider-to-Build-Artificial-Intelligence-for-the-Future - US Press Center

{
  "access_scope": "commercialization: Source-specific substantive example; no universal performance or completeness claim. AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.",
  "authors": [
    "Amazon Web Services"
  ],
  "authors_in_source_order": [
    "Amazon Web Services"
  ],
  "dates": {
    "announcement_month": "2022-11",
    "retrieved_utc": "2026-10-07T18:12:07.703803+00:00"
  },
  "id": "commercialization::S1",
  "title": "Stability-AI-Selects-AWS-as-Its-Preferred-Cloud-Provider-to-Build-Artificial-Intelligence-for-the-Future - US Press Center",
  "url": "https://press.aboutamazon.com/2022/11/stability-ai-selects-aws-as-its-preferred-cloud-provider-to-build-artificial-intelligence-for-the-future"
}

commercialization: Source-specific substantive example; no universal performance or completeness claim. AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.

commercialization: Source-specific substantive example; no universal performance or completeness claim. AWS press announcement from November 2022; this source supports the cloud relationship and proposed distribution, not the canonical entry’s later leadership transition. Promotional training-cost comparisons and current partnership terms are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

compute efficiency

Compute efficiency in AlphaTensor includes both reducing the arithmetic complexity of matrix multiplication and optimizing measured runtime on particular hardware.

The agent searches tensor decompositions through reinforcement learning, with provable correctness built into the described algorithm-discovery setting.

The paper treats arithmetic complexity and measured hardware runtime as distinct optimization criteria.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "compute efficiency: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.",
  "authors": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "authors_in_source_order": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "dates": {
    "citation_publication_date": "2022/10",
    "retrieved_utc": "2026-10-07T18:12:57.010377+00:00"
  },
  "id": "compute_efficiency::S1",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

compute efficiency: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

compute efficiency: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

diffusion design

Diffusion design in RFdiffusion turns a structure-prediction network into a generator by fine-tuning it on protein-structure denoising tasks.

The resulting model designs protein backbones under specifications that include topology, binding targets, symmetry and active-site scaffolds.

The paper combines generation with experimental characterization of selected assemblies and binders, giving design proposals a separate route to physical testing.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "diffusion design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "diffusion_design::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

diffusion design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

diffusion design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

experimental validation

Experimental validation in the RFdiffusion study tests the structures and functions of designed protein assemblies, metal-binding proteins and binders.

A cryo-electron-microscopy structure of a designed binder bound to influenza haemagglutinin closely matches the proposed design model.

The authors experimentally characterized hundreds of designed symmetric assemblies, metal-binding proteins and protein binders.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "experimental validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "experimental_validation::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

experimental validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

experimental validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

formal verification

Formal verification in AlphaProof grounds mathematical reasoning in a formal language, with Lean providing an environment for checking proof steps.

The agent learns through reinforcement learning on millions of auto-formalized problems and can adapt to difficult problems through additional test-time learning.

The paper reports competition results achieved with multi-day computation, tying correctness checking to a specific formal problem-solving setting.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "formal verification: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "formal_verification::S1",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

formal verification: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

formal verification: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

geometric learning

Geometric learning in RoseTTAFold links sequence information, residue-distance maps and three-dimensional coordinates inside a three-track network.

Information is repeatedly transformed and integrated across these representations so predicted structures reflect relationships within and between sequences, distances and coordinates.

The authors report structure-prediction accuracy approaching DeepMind’s CASP14 results and applications to modelling protein complexes from sequence information.

Sources and details

Accurate prediction of protein structures and interactions using a 3-track neural network

{
  "access_scope": "geometric learning: Source-specific substantive example; no universal performance or completeness claim. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.",
  "authors": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Minkyung Baek",
    "Frank DiMaio",
    "Ivan Anishchenko",
    "Justas Dauparas",
    "Sergey Ovchinnikov",
    "Gyu Rie Lee",
    "Jue Wang",
    "Qian Cong",
    "Lisa N Kinch",
    "R Dustin Schaeffer",
    "Claudia Millán",
    "Hahnbeom Park",
    "Carson Adams",
    "Caleb R Glassman",
    "Andy DeGiovanni",
    "Jose H Pereira",
    "Andria V Rodrigues",
    "Alberdina A van Dijk",
    "Ana C Ebrecht",
    "Diederik J Opperman",
    "Theo Sagmeister",
    "Christoph Buhlheller",
    "Tea Pavkov-Keller",
    "Manoj K Rathinaswamy",
    "Udit Dalwadi",
    "Calvin K Yip",
    "John E Burke",
    "K Christopher Garcia",
    "Nick V Grishin",
    "Paul D Adams",
    "Randy J Read",
    "David Baker"
  ],
  "dates": {
    "citation_publication_date": "2021 Jul 15",
    "retrieved_utc": "2026-10-07T18:12:07.573538+00:00"
  },
  "id": "geometric_learning::S1",
  "title": "Accurate prediction of protein structures and interactions using a 3-track neural network",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC7612213/"
}

geometric learning: Source-specific substantive example; no universal performance or completeness claim. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

geometric learning: Source-specific substantive example; no universal performance or completeness claim. Science paper abstract and adjacent architecture discussion, preserved in PMC; RoseTTAFold predictions are not experimental confirmation for every predicted structure.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

graph learning

Graph learning in Graph Network-based Simulators represents particles as graph nodes and predicts physical dynamics through learned message passing.

The authors test interacting fluids, rigid solids and deformable materials, including generalization to longer rollouts and more particles than used in training.

They identify message-passing depth and noise-corrupted training data as important to long-term accuracy and control of accumulating prediction error.

Sources and details

Learning to Simulate Complex Physics with Graph Networks

{
  "access_scope": "graph learning: Source-specific substantive example; no universal performance or completeness claim. PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.",
  "authors": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "authors_in_source_order": [
    "Alvaro Sanchez-Gonzalez",
    "Jonathan Godwin",
    "Tobias Pfaff",
    "Rex Ying",
    "Jure Leskovec",
    "Peter Battaglia"
  ],
  "dates": {
    "citation_publication_date": "2020/11/21",
    "retrieved_utc": "2026-10-07T18:12:52.705222+00:00"
  },
  "id": "graph_learning::S1",
  "title": "Learning to Simulate Complex Physics with Graph Networks",
  "url": "https://proceedings.mlr.press/v119/sanchez-gonzalez20a.html"
}

graph learning: Source-specific substantive example; no universal performance or completeness claim. PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.

graph learning: Source-specific substantive example; no universal performance or completeness claim. PMLR abstract; tested physical domains do not establish universal simulation accuracy. Citation metadata’s November 21, 2020 date remains separate from the venue’s July 13–18 conference dates.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

hybrid models

Hybrid models in NeuralGCM combine a differentiable atmospheric-dynamics solver with machine-learning components for processes that need learned representations.

The paper evaluates deterministic forecasts, weather ensembles and multi-decade climate metrics under prescribed sea-surface temperatures.

The paper reports orders-of-magnitude computational savings over conventional general circulation models in its evaluated weather and climate tasks.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "hybrid models: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.",
  "authors": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "authors_in_source_order": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "dates": {
    "citation_publication_date": "2024/08",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00"
  },
  "id": "hybrid_models::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

hybrid models: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

hybrid models: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

inverse design

Inverse design in RFdiffusion starts from a requested protein property, such as a binding target, topology or catalytic-site arrangement, and generates candidate backbones.

The method adapts a structure-prediction network through denoising tasks to handle several kinds of molecular specifications.

Selected candidates are then experimentally characterized, separating the desired design constraint from evidence that the resulting molecule has the intended structure or function.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "inverse design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "inverse_design::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

inverse design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

inverse design: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

knowledge spillovers

Knowledge spillovers in Ewan Birney’s AlphaFold perspective arise when shared structural data, open code and accessible predictions become inputs for other researchers.

The essay traces that shared foundation to the Protein Data Bank and connects it to freely downloadable predictions in the EMBL-EBI database.

Birney expects these shared data, predicted structures and open model code to stimulate new research directions.

Sources and details

AlphaFold: where will the next AI breakthrough come from?

{
  "access_scope": "knowledge spillovers: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.",
  "authors": [
    "Ewan Birney"
  ],
  "authors_in_source_order": [
    "Ewan Birney"
  ],
  "dates": {
    "published": "2022-08-22",
    "retrieved_utc": "2026-10-07T18:23:26.651350+00:00"
  },
  "id": "knowledge_spillovers::S1",
  "title": "AlphaFold: where will the next AI breakthrough come from?",
  "url": "https://www.ebi.ac.uk/about/news/perspectives/alphafold-where-will-the-next-ai-breakthrough-come-from/"
}

knowledge spillovers: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

knowledge spillovers: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

latent diffusion

Latent diffusion moves image-generation denoising from pixel space into representations supplied by a pretrained autoencoder.

The paper frames that choice as a balance between reducing computational complexity and preserving image detail.

Cross-attention adds conditioning from inputs such as text or bounding boxes, while the reported applications include inpainting, scene synthesis and super-resolution.

Sources and details

High-Resolution Image Synthesis with Latent Diffusion Models

{
  "access_scope": "latent diffusion: Source-specific substantive example; no universal performance or completeness claim. Primary text inspected with web retrieval",
  "authors": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "authors_in_source_order": [
    "Rombach, Robin",
    "Blattmann, Andreas",
    "Lorenz, Dominik",
    "Esser, Patrick",
    "Ommer, Björn"
  ],
  "dates": {
    "citation_date": "2021/12/20",
    "date": "2021-12-20 v1; 2022-04-13 v2",
    "inspected_revision": "Wed, 13 Apr 2022 11:38:44 UTC (38,971 KB)",
    "retrieval_date": "2026-10-07",
    "retrieved_utc": "2026-10-07T18:01:47.470387+00:00",
    "version": "arXiv metadata"
  },
  "id": "latent_diffusion::S1",
  "title": "High-Resolution Image Synthesis with Latent Diffusion Models",
  "url": "https://arxiv.org/abs/2112.10752",
  "version_url": "https://arxiv.org/abs/2112.10752v2"
}

latent diffusion: Source-specific substantive example; no universal performance or completeness claim. Primary text inspected with web retrieval

latent diffusion: Source-specific substantive example; no universal performance or completeness claim. Primary text inspected with web retrieval

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

materials discovery

Materials discovery in GNoME uses graph networks to filter candidate crystals before calculating their energies with density functional theory.

The study distinguishes 2.2 million structures stable against earlier datasets from the smaller set remaining stable on an updated convex hull after discoveries compete with one another.

Its computational stability results and the separately reported experimentally realized structures are different forms of evidence about the candidate materials.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "materials discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "materials_discovery::S1",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

materials discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

materials discovery: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

molecular dynamics

Molecular dynamics supplies part of BioEmu’s training evidence, alongside static structures and experimental measurements of protein stability.

BioEmu then generates protein equilibrium ensembles rather than computing every new sample through a fresh molecular-dynamics trajectory.

The publication account reports functional motions and relative free-energy comparisons, presenting emulation as a way to spread the cost of simulation and experimental data across later predictions.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "molecular dynamics: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "molecular_dynamics::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

molecular dynamics: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

molecular dynamics: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

molecular interactions

Molecular interactions in AlphaFold 3 are represented through predicted joint structures containing proteins, nucleic acids, small molecules, ions and modified residues.

The paper reports structural-prediction comparisons for protein–ligand, protein–nucleic-acid and antibody–antigen interactions against specialized tools.

AlphaFold3 uses a substantially updated diffusion-based architecture to predict these joint structures in a unified model.

Sources and details

Accurate structure prediction of biomolecular interactions with AlphaFold 3

{
  "access_scope": "molecular interactions: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.",
  "authors": [
    "Abramson, Josh",
    "Adler, Jonas",
    "Dunger, Jack",
    "Evans, Richard",
    "Green, Tim",
    "Pritzel, Alexander",
    "Ronneberger, Olaf",
    "Willmore, Lindsay",
    "Ballard, Andrew J.",
    "Bambrick, Joshua",
    "Bodenstein, Sebastian W.",
    "Evans, David A.",
    "Hung, Chia-Chun",
    "O’Neill, Michael",
    "Reiman, David",
    "Tunyasuvunakool, Kathryn",
    "Wu, Zachary",
    "Žemgulytė, Akvilė",
    "Arvaniti, Eirini",
    "Beattie, Charles",
    "Bertolli, Ottavia",
    "Bridgland, Alex",
    "Cherepanov, Alexey",
    "Congreve, Miles",
    "Cowen-Rivers, Alexander I.",
    "Cowie, Andrew",
    "Figurnov, Michael",
    "Fuchs, Fabian B.",
    "Gladman, Hannah",
    "Jain, Rishub",
    "Khan, Yousuf A.",
    "Low, Caroline M. R.",
    "Perlin, Kuba",
    "Potapenko, Anna",
    "Savy, Pascal",
    "Singh, Sukhdeep",
    "Stecula, Adrian",
    "Thillaisundaram, Ashok",
    "Tong, Catherine",
    "Yakneen, Sergei",
    "Zhong, Ellen D.",
    "Zielinski, Michal",
    "Žídek, Augustin",
    "Bapst, Victor",
    "Kohli, Pushmeet",
    "Jaderberg, Max",
    "Hassabis, Demis",
    "Jumper, John M."
  ],
  "authors_in_source_order": [
    "Abramson, Josh",
    "Adler, Jonas",
    "Dunger, Jack",
    "Evans, Richard",
    "Green, Tim",
    "Pritzel, Alexander",
    "Ronneberger, Olaf",
    "Willmore, Lindsay",
    "Ballard, Andrew J.",
    "Bambrick, Joshua",
    "Bodenstein, Sebastian W.",
    "Evans, David A.",
    "Hung, Chia-Chun",
    "O’Neill, Michael",
    "Reiman, David",
    "Tunyasuvunakool, Kathryn",
    "Wu, Zachary",
    "Žemgulytė, Akvilė",
    "Arvaniti, Eirini",
    "Beattie, Charles",
    "Bertolli, Ottavia",
    "Bridgland, Alex",
    "Cherepanov, Alexey",
    "Congreve, Miles",
    "Cowen-Rivers, Alexander I.",
    "Cowie, Andrew",
    "Figurnov, Michael",
    "Fuchs, Fabian B.",
    "Gladman, Hannah",
    "Jain, Rishub",
    "Khan, Yousuf A.",
    "Low, Caroline M. R.",
    "Perlin, Kuba",
    "Potapenko, Anna",
    "Savy, Pascal",
    "Singh, Sukhdeep",
    "Stecula, Adrian",
    "Thillaisundaram, Ashok",
    "Tong, Catherine",
    "Yakneen, Sergei",
    "Zhong, Ellen D.",
    "Zielinski, Michal",
    "Žídek, Augustin",
    "Bapst, Victor",
    "Kohli, Pushmeet",
    "Jaderberg, Max",
    "Hassabis, Demis",
    "Jumper, John M."
  ],
  "dates": {
    "citation_publication_date": "2024/06",
    "retrieved_utc": "2026-10-07T18:11:39.762359+00:00"
  },
  "id": "molecular_interactions::S1",
  "title": "Accurate structure prediction of biomolecular interactions with AlphaFold 3",
  "url": "https://www.nature.com/articles/s41586-024-07487-w"
}

molecular interactions: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.

molecular interactions: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2024 paper; structural-prediction comparisons do not establish binding efficacy, clinical benefit or a complete model of cellular dynamics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

neurosymbolic reasoning

Neurosymbolic reasoning in AlphaGeometry combines a neural language model with a symbolic deduction engine for Euclidean plane geometry.

The language model, trained on synthesized theorems and proofs, guides the deduction engine through difficult branching choices.

The reported system solved 25 of 30 problems in an olympiad-level geometry test set.

Sources and details

Solving olympiad geometry without human demonstrations

{
  "access_scope": "neurosymbolic reasoning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.",
  "authors": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:16:15.999178+00:00"
  },
  "id": "neurosymbolic_reasoning::S1",
  "title": "Solving olympiad geometry without human demonstrations",
  "url": "https://www.nature.com/articles/s41586-023-06747-5"
}

neurosymbolic reasoning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

neurosymbolic reasoning: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

operator learning

Operator learning generalizes a neural model from mappings between finite-dimensional vectors to mappings between function spaces.

The Fourier neural operator parameterizes an integral kernel in Fourier space to learn how functional inputs determine solutions across a family of partial differential equations.

Its paper evaluates Burgers’ equation, Darcy flow and Navier–Stokes problems, including a reported turbulent-flow super-resolution result.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "operator learning: Source-specific substantive example; no universal performance or completeness claim. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "citation_date": "2020/10/18",
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "operator_learning::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

operator learning: Source-specific substantive example; no universal performance or completeness claim. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.

operator learning: Source-specific substantive example; no universal performance or completeness claim. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

physics informed learning

Physics-informed learning in FermiNet builds the required statistics of many-electron wavefunctions into a neural approximation.

The paper treats that approximation as a wavefunction ansatz whose accuracy and computational efficiency must be balanced.

It reports variational quantum Monte Carlo results for atoms and small molecules using atomic positions and charges, linking learning to a specified physical calculation.

Sources and details

Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks

{
  "access_scope": "physics informed learning: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "physics_informed_learning::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

physics informed learning: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

physics informed learning: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

quantum chemistry

Quantum chemistry in the FermiNet paper centers on approximating many-electron wavefunctions when exact solutions of the Schrödinger equation are computationally out of reach.

Its neural architecture supplies an ansatz that respects Fermi-Dirac statistics and is optimized through variational quantum Monte Carlo.

The authors report improved dissociation-curve accuracy for nitrogen and a hydrogen chain against the stated coupled-cluster comparison.

Sources and details

Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks

{
  "access_scope": "quantum chemistry: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.",
  "authors": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "authors_in_source_order": [
    "Pfau, David",
    "Spencer, James S.",
    "Matthews, Alexander G. de G.",
    "Foulkes, W. M. C."
  ],
  "dates": {
    "citation_date": "2019/09/05",
    "inspected_revision": "Thu, 25 Mar 2021 16:22:15 UTC (8,083 KB)",
    "retrieved_utc": "2026-10-07T18:11:53.783942+00:00",
    "version": "arXiv v3"
  },
  "id": "quantum_chemistry::S1",
  "title": "Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks",
  "url": "https://arxiv.org/abs/1909.02487",
  "version_url": "https://arxiv.org/abs/1909.02487v3"
}

quantum chemistry: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

quantum chemistry: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, inspected revision pinned; results concern the studied systems and do not establish an exact solution for arbitrary chemistry.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

reinforcement control

Reinforcement control in the tokamak study learns commands for the magnetic coils that shape and maintain a plasma.

The controller pursues high-level objectives while satisfying physical and operational constraints, then is tested on the Tokamak à Configuration Variable.

The paper reports tracking plasma location, current and shape across several configurations, including simultaneous plasma droplets within the vessel.

Sources and details

Magnetic control of tokamak plasmas through deep reinforcement learning

{
  "access_scope": "reinforcement control: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.",
  "authors": [
    "Degrave, Jonas",
    "Felici, Federico",
    "Buchli, Jonas",
    "Neunert, Michael",
    "Tracey, Brendan",
    "Carpanese, Francesco",
    "Ewalds, Timo",
    "Hafner, Roland",
    "Abdolmaleki, Abbas",
    "de las Casas, Diego",
    "Donner, Craig",
    "Fritz, Leslie",
    "Galperti, Cristian",
    "Huber, Andrea",
    "Keeling, James",
    "Tsimpoukelli, Maria",
    "Kay, Jackie",
    "Merle, Antoine",
    "Moret, Jean-Marc",
    "Noury, Seb",
    "Pesamosca, Federico",
    "Pfau, David",
    "Sauter, Olivier",
    "Sommariva, Cristian",
    "Coda, Stefano",
    "Duval, Basil",
    "Fasoli, Ambrogio",
    "Kohli, Pushmeet",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis",
    "Riedmiller, Martin"
  ],
  "authors_in_source_order": [
    "Degrave, Jonas",
    "Felici, Federico",
    "Buchli, Jonas",
    "Neunert, Michael",
    "Tracey, Brendan",
    "Carpanese, Francesco",
    "Ewalds, Timo",
    "Hafner, Roland",
    "Abdolmaleki, Abbas",
    "de las Casas, Diego",
    "Donner, Craig",
    "Fritz, Leslie",
    "Galperti, Cristian",
    "Huber, Andrea",
    "Keeling, James",
    "Tsimpoukelli, Maria",
    "Kay, Jackie",
    "Merle, Antoine",
    "Moret, Jean-Marc",
    "Noury, Seb",
    "Pesamosca, Federico",
    "Pfau, David",
    "Sauter, Olivier",
    "Sommariva, Cristian",
    "Coda, Stefano",
    "Duval, Basil",
    "Fasoli, Ambrogio",
    "Kohli, Pushmeet",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis",
    "Riedmiller, Martin"
  ],
  "dates": {
    "citation_publication_date": "2022/02",
    "retrieved_utc": "2026-10-07T18:14:01.810118+00:00"
  },
  "id": "reinforcement_control::S1",
  "title": "Magnetic control of tokamak plasmas through deep reinforcement learning",
  "url": "https://doi.org/10.1038/s41586-021-04301-9"
}

reinforcement control: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.

reinforcement control: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the February 2022 tokamak-control paper; demonstrations concern plasma control on TCV, not commercial fusion energy, net energy generation or unrestricted autonomous reactor operation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

research infrastructure

Research infrastructure behind the AlphaFold database includes tracking protein identities, executing predictions at scale and presenting the resulting structures for use.

Birney’s account assigns protein organization to UniProt and structure storage, indexing, integration and display to the PDBe team at EMBL-EBI.

It shows how data curation and usable access sit alongside model development in making a scientific prediction resource available.

Sources and details

AlphaFold: where will the next AI breakthrough come from?

{
  "access_scope": "research infrastructure: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.",
  "authors": [
    "Ewan Birney"
  ],
  "authors_in_source_order": [
    "Ewan Birney"
  ],
  "dates": {
    "published": "2022-08-22",
    "retrieved_utc": "2026-10-07T18:23:26.651350+00:00"
  },
  "id": "research_infrastructure::S1",
  "title": "AlphaFold: where will the next AI breakthrough come from?",
  "url": "https://www.ebi.ac.uk/about/news/perspectives/alphafold-where-will-the-next-ai-breakthrough-come-from/"
}

research infrastructure: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

research infrastructure: Source-specific substantive example; no universal performance or completeness claim. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

research organization

Research organization in Microsoft’s AI4Science announcement brings machine learning researchers together with specialists in physics, chemistry, biology, fluid dynamics and engineering.

The team’s proposed agenda uses deep-learning emulators trained on numerical simulations to address scientific speed-versus-accuracy trade-offs.

Bishop’s examples combine internal projects with external collaboration, including work with Novartis on early-stage molecules synthesized for exploration.

Sources and details

AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research

{
  "access_scope": "research organization: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.",
  "authors": [
    "Christopher Bishop"
  ],
  "authors_in_source_order": [
    "Christopher Bishop"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:35.576912+00:00"
  },
  "id": "research_organization::S1",
  "title": "AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research",
  "url": "https://www.microsoft.com/en-us/research/blog/ai4science-to-empower-the-fifth-paradigm-of-scientific-discovery/"
}

research organization: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

research organization: Source-specific substantive example; no universal performance or completeness claim. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

scientific benchmarks

Scientific benchmarks in the original AlphaFold paper use CASP13’s blind assessment to compare protein-structure predictions across methods.

The paper reports high-accuracy structures for 24 of 43 free-modelling domains, compared with 14 of 43 for the next method in its stated comparison.

The assessment compared predicted structures target by target, including whether their TM-scores reached 0.7.

Sources and details

Improved protein structure prediction using potentials from deep learning

{
  "access_scope": "scientific benchmarks: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.",
  "authors": [
    "Senior, Andrew W.",
    "Evans, Richard",
    "Jumper, John",
    "Kirkpatrick, James",
    "Sifre, Laurent",
    "Green, Tim",
    "Qin, Chongli",
    "Žídek, Augustin",
    "Nelson, Alexander W. R.",
    "Bridgland, Alex",
    "Penedones, Hugo",
    "Petersen, Stig",
    "Simonyan, Karen",
    "Crossan, Steve",
    "Kohli, Pushmeet",
    "Jones, David T.",
    "Silver, David",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Senior, Andrew W.",
    "Evans, Richard",
    "Jumper, John",
    "Kirkpatrick, James",
    "Sifre, Laurent",
    "Green, Tim",
    "Qin, Chongli",
    "Žídek, Augustin",
    "Nelson, Alexander W. R.",
    "Bridgland, Alex",
    "Penedones, Hugo",
    "Petersen, Stig",
    "Simonyan, Karen",
    "Crossan, Steve",
    "Kohli, Pushmeet",
    "Jones, David T.",
    "Silver, David",
    "Kavukcuoglu, Koray",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2020/01",
    "retrieved_utc": "2026-10-07T18:11:35.725054+00:00"
  },
  "id": "scientific_benchmarks::S1",
  "title": "Improved protein structure prediction using potentials from deep learning",
  "url": "https://www.nature.com/articles/s41586-019-1923-7"
}

scientific benchmarks: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.

scientific benchmarks: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2020 paper; distinct from the later redesigned AlphaFold system and limited to its reported structure-prediction evaluation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

scientific emulation

Scientific emulation in BioEmu generates ensembles of protein structures to approximate equilibrium behavior without repeating molecular dynamics for each new sample.

The model combines simulation, static-structure and experimental-stability evidence in its training, then jointly models ensembles and thermodynamic properties.

Its publication account frames this reuse as amortizing data-generation costs and reports comparisons with millisecond-scale simulations and experimental data.

Sources and details

Scalable emulation of protein equilibrium ensembles with generative deep learning

{
  "access_scope": "scientific emulation: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "Jose Jimenez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor Garcia Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "I. Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "citation_publication_date": "2025/07/10",
    "retrieved_utc": "2026-10-07T18:11:33.669770+00:00"
  },
  "id": "scientific_emulation::S1",
  "title": "Scalable emulation of protein equilibrium ensembles with generative deep learning",
  "url": "https://www.microsoft.com/en-us/research/publication/scalable-emulation-of-protein-equilibrium-ensembles-with-generative-deep-learning/"
}

scientific emulation: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

scientific emulation: Source-specific substantive example; no universal performance or completeness claim. Microsoft Research publication abstract for the July 2025 Science paper; reported accuracy and generation speed concern its tests, not all proteins or verified drug-development outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

simulation validation

Simulation validation in GNoME checks model-selected crystal structures with density-functional-theory energy calculations.

The verified calculations also enter the next training round, making checking and learning part of the same iterative exploration process.

The study additionally compares findings with experiments and higher-fidelity calculations, keeping computational energy agreement separate from physical synthesis evidence.

Sources and details

Scaling deep learning for materials discovery

{
  "access_scope": "simulation validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.",
  "authors": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "authors_in_source_order": [
    "Merchant, Amil",
    "Batzner, Simon",
    "Schoenholz, Samuel S.",
    "Aykol, Muratahan",
    "Cheon, Gowoon",
    "Cubuk, Ekin Dogus"
  ],
  "dates": {
    "citation_publication_date": "2023/12",
    "retrieved_utc": "2026-10-07T18:11:38.251280+00:00"
  },
  "id": "simulation_validation::S1",
  "title": "Scaling deep learning for materials discovery",
  "url": "https://www.nature.com/articles/s41586-023-06735-9"
}

simulation validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

simulation validation: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the GNoME study; computed stability is not a demonstration that every candidate is synthesizable, manufacturable or useful.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

structure prediction

Structure prediction in the 2021 AlphaFold paper maps amino-acid sequence information to a proposed three-dimensional protein structure.

The network incorporates physical and biological knowledge and multiple-sequence alignments into its design.

Its CASP14 evaluation reports accuracy competitive with experimental structures in many cases.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "structure prediction: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.",
  "authors": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2021/08",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00"
  },
  "id": "structure_prediction::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

structure prediction: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

structure prediction: Source-specific substantive example; no universal performance or completeness claim. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

synthetic data

Synthetic data in AlphaGeometry consists of generated geometry theorems and proofs used to train a neural language model without human demonstrations.

That model guides a symbolic engine, allowing the system to explore difficult geometry deductions despite scarce machine-verifiable human training proofs.

The paper evaluates the resulting system on olympiad-level geometry problems, tying synthetic training data to a specific reasoning domain.

Sources and details

Solving olympiad geometry without human demonstrations

{
  "access_scope": "synthetic data: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.",
  "authors": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "authors_in_source_order": [
    "Trinh, Trieu H.",
    "Wu, Yuhuai",
    "Le, Quoc V.",
    "He, He",
    "Luong, Thang"
  ],
  "dates": {
    "citation_publication_date": "2024/01",
    "retrieved_utc": "2026-10-07T18:16:15.999178+00:00"
  },
  "id": "synthetic_data::S1",
  "title": "Solving olympiad geometry without human demonstrations",
  "url": "https://www.nature.com/articles/s41586-023-06747-5"
}

synthetic data: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

synthetic data: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; results concern Euclidean plane geometry and the reported test set, not unrestricted theorem proving or a complete independent proof audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

tensor decomposition

Tensor decomposition supplies AlphaTensor’s search representation for matrix-multiplication algorithms.

The reinforcement-learning agent plays a single-player game whose objective is finding decompositions within a finite factor space.

The paper uses this representation to explore arithmetic complexity, structured multiplication and runtime on particular hardware while retaining algorithmic correctness.

Sources and details

Discovering faster matrix multiplication algorithms with reinforcement learning

{
  "access_scope": "tensor decomposition: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.",
  "authors": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "authors_in_source_order": [
    "Fawzi, Alhussein",
    "Balog, Matej",
    "Huang, Aja",
    "Hubert, Thomas",
    "Romera-Paredes, Bernardino",
    "Barekatain, Mohammadamin",
    "Novikov, Alexander",
    "R. Ruiz, Francisco J.",
    "Schrittwieser, Julian",
    "Swirszcz, Grzegorz",
    "Silver, David",
    "Hassabis, Demis",
    "Kohli, Pushmeet"
  ],
  "dates": {
    "citation_publication_date": "2022/10",
    "retrieved_utc": "2026-10-07T18:12:57.010377+00:00"
  },
  "id": "tensor_decomposition::S1",
  "title": "Discovering faster matrix multiplication algorithms with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-022-05172-4"
}

tensor decomposition: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

tensor decomposition: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; reported advances concern the specified matrix sizes, fields and hardware, not a universal replacement for all multiplication algorithms.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

test time compute

Test-time compute in AlphaProof includes generating and learning from related mathematical problem variants during inference.

The paper calls this test-time reinforcement learning and uses it to adapt the proof-search agent to especially difficult problems.

Its reported silver-medal-equivalent system performance at IMO 2024 involved multi-day computation, making the computation budget part of interpreting that result.

Sources and details

Olympiad-level formal mathematical reasoning with reinforcement learning

{
  "access_scope": "test time compute: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.",
  "authors": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "authors_in_source_order": [
    "Hubert, Thomas",
    "Mehta, Rishi",
    "Sartran, Laurent",
    "Horváth, Miklós Z.",
    "Žužić, Goran",
    "Wieser, Eric",
    "Huang, Aja",
    "Schrittwieser, Julian",
    "Schroecker, Yannick",
    "Masoom, Hussain",
    "Bertolli, Ottavia",
    "Zahavy, Tom",
    "Mandhane, Amol",
    "Yung, Jessica",
    "Beloshapka, Iuliya",
    "Ibarz, Borja",
    "Veeriah, Vivek",
    "Yu, Lei",
    "Nash, Oliver",
    "Lezeau, Paul",
    "Mercuri, Salvatore",
    "Sönne, Calle",
    "Mehta, Bhavik",
    "Davies, Alex",
    "Zheng, Daniel",
    "Pedregosa, Fabian",
    "Li, Yin",
    "von Glehn, Ingrid",
    "Rowland, Mark",
    "Albanie, Samuel",
    "Velingker, Ameya",
    "Schmitt, Simon",
    "Lockhart, Edward",
    "Hughes, Edward",
    "Michalewski, Henryk",
    "Sonnerat, Nicolas",
    "Hassabis, Demis",
    "Kohli, Pushmeet",
    "Silver, David"
  ],
  "dates": {
    "citation_publication_date": "2026/03",
    "retrieved_utc": "2026-10-07T18:11:42.489626+00:00"
  },
  "id": "test_time_compute::S1",
  "title": "Olympiad-level formal mathematical reasoning with reinforcement learning",
  "url": "https://www.nature.com/articles/s41586-025-09833-y"
}

test time compute: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

test time compute: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; the medal-equivalent score describes the combined system’s reported 2024 evaluation, not a claim of winning an official medal or meeting the human competition’s time conditions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

uncertainty

Uncertainty in GenCast is represented through an ensemble of possible weather trajectories rather than a single deterministic forecast.

The paper links that probabilistic representation to assessing risks in extreme weather, cyclone tracks and wind-power production.

The paper reports greater forecast skill than the operational ENS ensemble on 97.2% of 1,320 evaluated targets.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "uncertainty: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "uncertainty::S1",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

uncertainty: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

uncertainty: Source-specific substantive example; no universal performance or completeness claim. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

weather forecasting

Weather forecasting in GraphCast learns from reanalysis data to predict hundreds of variables globally over a ten-day horizon.

The cached abstract reports forecasts at quarter-degree resolution in under a minute and target-wise comparisons with operational deterministic systems.

It also evaluates severe-event prediction, including tropical cyclones, atmospheric rivers and extreme temperatures, within that reported forecasting study.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "weather forecasting: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "weather_forecasting::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

weather forecasting: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

weather forecasting: Source-specific substantive example; no universal performance or completeness claim. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dennard scaling

Dennard scaling is grounded here in the 1974 device paper’s relationships for reducing the size of a conventional MOSFET.

The study couples ion-implanted device design with models of doping profiles, threshold voltages and short-channel effects.

It compares measurements from fabricated small-channel devices with predictions and projects their potential integrated-circuit performance improvement.

Sources and details

Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions

{
  "access_scope": "Dennard scaling: Source-specific substantive example; no universal performance or completeness claim. IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.",
  "authors": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "authors_in_source_order": [
    "Robert H. Dennard",
    "Fritz H. Gaensslen",
    "Hwa-Nien Yu",
    "V. Leo Rideout",
    "Ernest Bassous",
    "Andre R. Leblanc"
  ],
  "dates": {
    "citation_publication_date": "1974/01/01",
    "retrieved_utc": "2026-10-07T18:19:20.395090+00:00"
  },
  "id": "concept-law-dennard::S1",
  "title": "Design of Ion-Implanted MOSFET’s With Very Small Physical Dimensions",
  "url": "https://research.ibm.com/publications/design-of-ion-implanted-mosfets-with-very-small-physical-dimensions"
}

Dennard scaling: Source-specific substantive example; no universal performance or completeness claim. IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.

Dennard scaling: Source-specific substantive example; no universal performance or completeness claim. IBM Research abstract of the six-author 1974 MOSFET paper; IBM’s January 1 metadata is preserved as catalog metadata, not an independently verified publication day. No claim of unlimited future scaling is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Scientific models as reusable knowledge capital

The editorial connection to reusable knowledge capital is illustrated by Birney’s account of openly available protein data, AlphaFold code and structure predictions.

He links those resources to new work other researchers could pursue and describes long-term data stewardship as a foundation for the model’s development.

This frames shared scientific resources as reusable research inputs.

Sources and details

AlphaFold: where will the next AI breakthrough come from?

{
  "access_scope": "Scientific models as reusable knowledge capital: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.",
  "authors": [
    "Ewan Birney"
  ],
  "authors_in_source_order": [
    "Ewan Birney"
  ],
  "dates": {
    "published": "2022-08-22",
    "retrieved_utc": "2026-10-07T18:23:26.651350+00:00"
  },
  "id": "science-connection-spillovers::S1",
  "title": "AlphaFold: where will the next AI breakthrough come from?",
  "url": "https://www.ebi.ac.uk/about/news/perspectives/alphafold-where-will-the-next-ai-breakthrough-come-from/"
}

Scientific models as reusable knowledge capital: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

Scientific models as reusable knowledge capital: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Ewan Birney’s EMBL-EBI perspective dated August 22, 2022; the predicted structures are not experimental confirmations, and publication-team roles are attributed without complete individual authorship or influence recertification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

AI and laboratory work are complements

The editorial connection between AI and laboratory work is illustrated by RFdiffusion’s combination of generated protein designs and experimental characterization.

Its denoising model proposes backbones under molecular specifications, while structural and functional experiments test selected assemblies and binders.

The cryo-electron-microscopy comparison for an influenza binder shows a concrete bridge between a computational design and a physical observation.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "AI and laboratory work are complements: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "science-connection-complements::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

AI and laboratory work are complements: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

AI and laboratory work are complements: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Training capital versus inference costs

The training-versus-inference connection is illustrated by a Fourier neural operator that learns a solution mapping across an entire family of partial differential equations.

Once learned, the mapping can answer new functional inputs instead of requiring the classical method to solve only one equation instance at a time.

The authors evaluate Burgers’ equation, Darcy flow and Navier–Stokes problems and report faster evaluation than traditional PDE solvers.

Sources and details

Fourier Neural Operator for Parametric Partial Differential Equations

{
  "access_scope": "Training capital versus inference costs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.",
  "authors": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "authors_in_source_order": [
    "Li, Zongyi",
    "Kovachki, Nikola",
    "Azizzadenesheli, Kamyar",
    "Liu, Burigede",
    "Bhattacharya, Kaushik",
    "Stuart, Andrew",
    "Anandkumar, Anima"
  ],
  "dates": {
    "citation_date": "2020/10/18",
    "inspected_revision": "Mon, 17 May 2021 03:12:33 UTC (2,817 KB)",
    "original_submission": "2020/10/18",
    "retrieved_utc": "2026-10-07T18:10:45.233538+00:00",
    "version": "arXiv v3"
  },
  "id": "science-connection-amortization::S1",
  "title": "Fourier Neural Operator for Parametric Partial Differential Equations",
  "url": "https://arxiv.org/abs/2010.08895",
  "version_url": "https://arxiv.org/abs/2010.08895v3"
}

Training capital versus inference costs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.

Training capital versus inference costs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Displayed abstract, title, full repository author metadata and submission history inspected; no full paper or table inspection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Forecasts become decision inputs

The editorial connection from forecasts to decisions is illustrated by GenCast’s use of weather ensembles to represent plausible future scenarios.

The paper explicitly motivates that range with hazardous-weather warnings and renewable-energy planning, and evaluates cyclone and wind-power predictions.

GenCast generates stochastic 15-day forecasts for more than 80 surface and atmospheric variables at quarter-degree resolution.

Sources and details

Probabilistic weather forecasting with machine learning

{
  "access_scope": "Forecasts become decision inputs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.",
  "authors": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "authors_in_source_order": [
    "Price, Ilan",
    "Sanchez-Gonzalez, Alvaro",
    "Alet, Ferran",
    "Andersson, Tom R.",
    "El-Kadi, Andrew",
    "Masters, Dominic",
    "Ewalds, Timo",
    "Stott, Jacklynn",
    "Mohamed, Shakir",
    "Battaglia, Peter",
    "Lam, Remi",
    "Willson, Matthew"
  ],
  "dates": {
    "citation_publication_date": "2025/01",
    "retrieved_utc": "2026-10-07T18:12:20.814459+00:00"
  },
  "id": "science-connection-uncertainty::S1",
  "title": "Probabilistic weather forecasting with machine learning",
  "url": "https://www.nature.com/articles/s41586-024-08252-9"
}

Forecasts become decision inputs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

Forecasts become decision inputs: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; forecast results concern the paper’s evaluated targets and historical test setting, not guaranteed accuracy for future weather events.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Interdisciplinary team production

Interdisciplinary team production is illustrated by Bishop’s AI4Science announcement, which joins expertise in learning, physics, chemistry, biology, fluid dynamics and software.

Its research agenda combines simulated scientific data with learned emulators, requiring both domain modelling and machine-learning development.

The stated Novartis collaboration adds an example involving molecule generation and subsequent synthesis.

Sources and details

AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research

{
  "access_scope": "Interdisciplinary team production: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.",
  "authors": [
    "Christopher Bishop"
  ],
  "authors_in_source_order": [
    "Christopher Bishop"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:35.576912+00:00"
  },
  "id": "science-connection-organization::S1",
  "title": "AI4Science to empower the fifth paradigm of scientific discovery - Microsoft Research",
  "url": "https://www.microsoft.com/en-us/research/blog/ai4science-to-empower-the-fifth-paradigm-of-scientific-discovery/"
}

Interdisciplinary team production: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

Interdisciplinary team production: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Christopher Bishop’s Microsoft Research announcement, including its October 20, 2023 update; the proposed fifth paradigm and future benefits are attributed arguments, not demonstrated universal scientific capabilities. Cached announcement includes the October 20, 2023 editorial revision removing Amsterdam-lab details; historical geographies are not recertified as current.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Inherited scientific infrastructure

The inherited-infrastructure connection is illustrated by the 2021 AlphaFold paper’s account of experimentally determined protein structures and vast sequence resources.

Its model combines physical and biological knowledge with multiple-sequence alignments to address the gap between known sequences and measured structures.

The editorial comparison treats those accumulated scientific resources as foundations for prediction.

Sources and details

Highly accurate protein structure prediction with AlphaFold

{
  "access_scope": "Inherited scientific infrastructure: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.",
  "authors": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "authors_in_source_order": [
    "Jumper, John",
    "Evans, Richard",
    "Pritzel, Alexander",
    "Green, Tim",
    "Figurnov, Michael",
    "Ronneberger, Olaf",
    "Tunyasuvunakool, Kathryn",
    "Bates, Russ",
    "Žídek, Augustin",
    "Potapenko, Anna",
    "Bridgland, Alex",
    "Meyer, Clemens",
    "Kohl, Simon A. A.",
    "Ballard, Andrew J.",
    "Cowie, Andrew",
    "Romera-Paredes, Bernardino",
    "Nikolov, Stanislav",
    "Jain, Rishub",
    "Adler, Jonas",
    "Back, Trevor",
    "Petersen, Stig",
    "Reiman, David",
    "Clancy, Ellen",
    "Zielinski, Michal",
    "Steinegger, Martin",
    "Pacholska, Michalina",
    "Berghammer, Tamas",
    "Bodenstein, Sebastian",
    "Silver, David",
    "Vinyals, Oriol",
    "Senior, Andrew W.",
    "Kavukcuoglu, Koray",
    "Kohli, Pushmeet",
    "Hassabis, Demis"
  ],
  "dates": {
    "citation_publication_date": "2021/08",
    "retrieved_utc": "2026-10-07T18:12:18.102730+00:00"
  },
  "id": "science-connection-infrastructure::S1",
  "title": "Highly accurate protein structure prediction with AlphaFold",
  "url": "https://www.nature.com/articles/s41586-021-03819-2"
}

Inherited scientific infrastructure: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

Inherited scientific infrastructure: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of the 2021 AlphaFold paper; predicting a structure does not experimentally establish its function, dynamics or therapeutic usefulness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Prediction enables inverse design

The prediction-to-design connection is explicit in RFdiffusion’s adaptation of the RoseTTAFold structure-prediction network through denoising tasks.

That adaptation produces a model for generating backbones under specifications such as binding targets, topology and symmetry.

The study then tests selected designs experimentally.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Prediction enables inverse design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "science-connection-predictiondesign::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Prediction enables inverse design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

Prediction enables inverse design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Physical priors and learned emulators

The editorial connection between physical priors and learning is illustrated by NeuralGCM’s combination of an atmospheric-dynamics solver and machine-learning components.

The study evaluates weather and climate behavior while retaining numerical structure for large-scale dynamics.

The study reports orders-of-magnitude computational savings over conventional general circulation models in its evaluated weather and climate tasks.

Sources and details

Neural general circulation models for weather and climate

{
  "access_scope": "Physical priors and learned emulators: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.",
  "authors": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "authors_in_source_order": [
    "Kochkov, Dmitrii",
    "Yuval, Janni",
    "Langmore, Ian",
    "Norgaard, Peter",
    "Smith, Jamie",
    "Mooers, Griffin",
    "Klöwer, Milan",
    "Lottes, James",
    "Rasp, Stephan",
    "Düben, Peter",
    "Hatfield, Sam",
    "Battaglia, Peter",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Brenner, Michael P.",
    "Hoyer, Stephan"
  ],
  "dates": {
    "citation_publication_date": "2024/08",
    "retrieved_utc": "2026-10-07T18:12:19.357490+00:00"
  },
  "id": "science-connection-hybrids::S1",
  "title": "Neural general circulation models for weather and climate",
  "url": "https://www.nature.com/articles/s41586-024-07744-y"
}

Physical priors and learned emulators: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

Physical priors and learned emulators: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract of Neural general circulation models for weather and climate, citation issue metadata August 2024; reported comparisons were not rerun, and multi-decade climate tests use prescribed sea-surface temperatures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Algorithms are a compute input

The connection between algorithms and compute inputs is illustrated by AlphaDev’s search for sorting routines at the assembly-instruction level.

Mankowitz and Michi describe reinforcement learning that constructs instruction sequences, then report incorporating discovered sorting algorithms into a C++ library.

The announcement frames code improvement as a way to increase the value of existing computing hardware.

Sources and details

AlphaDev discovers faster sorting algorithms

{
  "access_scope": "Algorithms are a compute input: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.",
  "authors": [
    "Daniel J. Mankowitz",
    "Andrea Michi"
  ],
  "authors_in_source_order": [
    "Daniel J. Mankowitz",
    "Andrea Michi"
  ],
  "dates": {
    "published": "2023-06-07",
    "retrieved_utc": "2026-10-07T18:15:23.148712+00:00"
  },
  "id": "science-connection-algorithmcapital::S1",
  "title": "AlphaDev discovers faster sorting algorithms",
  "url": "https://deepmind.google/blog/alphadev-discovers-faster-sorting-algorithms/"
}

Algorithms are a compute input: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.

Algorithms are a compute input: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. DeepMind announcement by Daniel J. Mankowitz and Andrea Michi; this is a source account of the research paper and deployment, not an independent speed audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Benchmarks and deployment are distinct

The benchmark-versus-deployment connection is illustrated by GraphCast’s target-wise comparison with operational deterministic forecasting systems.

Its abstract reports outperforming the comparison on 90 percent of 1,380 verification targets and supporting improved severe-event predictions.

That evaluation supplies evidence about forecast skill under the study’s tests.

Sources and details

GraphCast: Learning skillful medium-range global weather forecasting

{
  "access_scope": "Benchmarks and deployment are distinct: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.",
  "authors": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "authors_in_source_order": [
    "Lam, Remi",
    "Sanchez-Gonzalez, Alvaro",
    "Willson, Matthew",
    "Wirnsberger, Peter",
    "Fortunato, Meire",
    "Alet, Ferran",
    "Ravuri, Suman",
    "Ewalds, Timo",
    "Eaton-Rosen, Zach",
    "Hu, Weihua",
    "Merose, Alexander",
    "Hoyer, Stephan",
    "Holland, George",
    "Vinyals, Oriol",
    "Stott, Jacklynn",
    "Pritzel, Alexander",
    "Mohamed, Shakir",
    "Battaglia, Peter"
  ],
  "dates": {
    "citation_date": "2022/12/24",
    "inspected_revision": "Fri, 4 Aug 2023 17:07:43 UTC (35,293 KB)",
    "retrieved_utc": "2026-10-07T18:11:54.423983+00:00",
    "version": "arXiv v2"
  },
  "id": "science-connection-benchmark::S1",
  "title": "GraphCast: Learning skillful medium-range global weather forecasting",
  "url": "https://arxiv.org/abs/2212.12794",
  "version_url": "https://arxiv.org/abs/2212.12794v2"
}

Benchmarks and deployment are distinct: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

Benchmarks and deployment are distinct: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. arXiv abstract, revision and original submission pinned separately; the reported target-wise comparison is not a guarantee for every region, variable or future event.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shared methods across image and scientific design

The shared-methods connection is explicit in the RFdiffusion paper’s discussion of diffusion models used for image and language generation.

The authors adapt denoising to protein backbone geometry and sequence–structure relationships by fine-tuning RoseTTAFold.

This is a documented methodological comparison and adaptation in the paper.

Sources and details

De novo design of protein structure and function with RFdiffusion

{
  "access_scope": "Shared methods across image and scientific design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.",
  "authors": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Watson, Joseph L.",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Trippe, Brian L.",
    "Yim, Jason",
    "Eisenach, Helen E.",
    "Ahern, Woody",
    "Borst, Andrew J.",
    "Ragotte, Robert J.",
    "Milles, Lukas F.",
    "Wicky, Basile I. M.",
    "Hanikel, Nikita",
    "Pellock, Samuel J.",
    "Courbet, Alexis",
    "Sheffler, William",
    "Wang, Jue",
    "Venkatesh, Preetham",
    "Sappington, Isaac",
    "Torres, Susana Vázquez",
    "Lauko, Anna",
    "De Bortoli, Valentin",
    "Mathieu, Emile",
    "Ovchinnikov, Sergey",
    "Barzilay, Regina",
    "Jaakkola, Tommi S.",
    "DiMaio, Frank",
    "Baek, Minkyung",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2023/08",
    "retrieved_utc": "2026-10-07T18:11:37.867709+00:00"
  },
  "id": "science-connection-diffusiontransfer::S1",
  "title": "De novo design of protein structure and function with RFdiffusion",
  "url": "https://www.nature.com/articles/s41586-023-06415-8"
}

Shared methods across image and scientific design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

Shared methods across image and scientific design: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Nature abstract; experimental characterization of selected designs does not establish that every output functions as intended or has therapeutic value.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Human-machine mathematical collaboration

Human-machine mathematical collaboration appears in Tao’s May 2025 account of an interactive proof assistant for verifying estimates.

He describes a workflow where a human supplies high-level tactics and the assistant performs the necessary symbolic calculations, drawing on SymPy.

Tao also reports using language-model and Copilot assistance while developing the tool, distinguishing help with implementation from the assistant’s proof-calculation workflow.

Sources and details

A tool to verify estimates, II: a flexible proof assistant

{
  "access_scope": "Human-machine mathematical collaboration: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.",
  "authors": [
    "Terence Tao"
  ],
  "authors_in_source_order": [
    "Terence Tao"
  ],
  "dates": {
    "published": "2025-05-09",
    "retrieved_utc": "2026-10-07T18:13:28.268099+00:00"
  },
  "id": "science-connection-humanmachine::S1",
  "title": "A tool to verify estimates, II: a flexible proof assistant",
  "url": "https://terrytao.wordpress.com/2025/05/09/a-tool-to-verify-estimates-ii-a-flexible-proof-assistant/"
}

Human-machine mathematical collaboration: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.

Human-machine mathematical collaboration: Qualified editorial connection from the selected source; no proof of causal influence, individual task allocation, measured economic return or universal deployment. Terence Tao’s May 9, 2025 post, introduction and worked tactic examples; prototype descriptions were inspected, not executable code or a formal certification of every generated proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Economic Welfare and the Allocation of Resources for Invention

In his 1962 chapter, Kenneth J. Arrow treats invention as the production of knowledge and asks whether competitive markets allocate resources to it efficiently.

He identifies indivisibilities, the difficulty of capturing knowledge’s benefits privately, and uncertainty as three reasons competition can fail to produce an optimal allocation for invention.

The opening analysis introduces commodities conditional on states of nature to show how an ideal system of markets could allocate risk, before examining the limitations of actual institutions.

Sources and details

Economic Welfare and the Allocation of Resources for Invention

{
  "access_scope": "NBER 1962 chapter PDF frontmatter and printed pages609–611; PDF pages1–4 rendered, pages1–3 visually inspected. Opening argument only; distinct from the1959RAND report and later reprints, no contemporary policy inference.",
  "authors": [
    "Kenneth J. Arrow"
  ],
  "authors_in_source_order": [
    "Kenneth J. Arrow"
  ],
  "dates": {
    "chapter_volume_publication": "1962",
    "retrieved_utc": "2026-10-08T05:38:10.573697+00:00"
  },
  "id": "work-662caeda5dc6::S1",
  "title": "Economic Welfare and the Allocation of Resources for Invention",
  "url": "https://www.nber.org/system/files/chapters/c2144/c2144.pdf"
}

NBER 1962 chapter PDF frontmatter and printed pages609–611; PDF pages1–4 rendered, pages1–3 visually inspected. Opening argument only; distinct from the1959RAND report and later reprints, no contemporary policy inference.

NBER 1962 chapter PDF frontmatter and printed pages609–611; PDF pages1–4 rendered, pages1–3 visually inspected. Opening argument only; distinct from the1959RAND report and later reprints, no contemporary policy inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1962
}

Generalized biomolecular modeling and design with RoseTTAFold All-Atom

The university repository abstract describes RoseTTAFold All-Atom as a model of assemblies containing proteins, nucleic acids, small molecules, metals, and covalent modifications, given their sequences and chemical structures.

It combines residue representations of amino acids and DNA bases with atom representations of the other groups, then uses denoising fine-tuning to obtain RFdiffusionAA for building protein structures around small molecules.

The authors report designing proteins that bind digoxigenin, heme, and bilin and validating them through crystallography and binding measurements.

Sources and details

Generalized biomolecular modeling and design with RoseTTAFold All-Atom

{
  "access_scope": "White Rose Research Online abstract and full metadata; university repository for the author-accepted manuscript. Abstract-level reported results, no full-paper audit or individual task attribution; original held URLs retained.",
  "authors": [
    "Krishna, R.",
    "Wang, J.",
    "Ahern, W.",
    "Sturmfels, P.",
    "Venkatesh, P.",
    "Kalvet, I.",
    "Lee, G.R.",
    "Morey-Burrows, F.S.",
    "Anishchenko, I.",
    "Humphreys, I.R.",
    "McHugh, R.",
    "Vafeados, D.",
    "Li, X.",
    "Sutherland, G.A.",
    "Hitchcock, A.",
    "Hunter, C.N.",
    "Kang, A.",
    "Brackenbrough, E.",
    "Bera, A.K.",
    "Baek, M.",
    "DiMaio, F.",
    "Baker, D."
  ],
  "authors_in_source_order": [
    "Krishna, R.",
    "Wang, J.",
    "Ahern, W.",
    "Sturmfels, P.",
    "Venkatesh, P.",
    "Kalvet, I.",
    "Lee, G.R.",
    "Morey-Burrows, F.S.",
    "Anishchenko, I.",
    "Humphreys, I.R.",
    "McHugh, R.",
    "Vafeados, D.",
    "Li, X.",
    "Sutherland, G.A.",
    "Hitchcock, A.",
    "Hunter, C.N.",
    "Kang, A.",
    "Brackenbrough, E.",
    "Bera, A.K.",
    "Baek, M.",
    "DiMaio, F.",
    "Baker, D."
  ],
  "dates": {
    "accepted": "27 February 2024",
    "published": "19 April 2024",
    "published_online": "7 March 2024",
    "retrieved_utc": "2026-10-08T05:38:10.573991+00:00",
    "submitted": "9 October 2023"
  },
  "doi": "10.1126/science.adl2528",
  "id": "work-coverage-3aa846af69dc52::S1",
  "title": "Generalized biomolecular modeling and design with RoseTTAFold All-Atom",
  "url": "https://eprints.whiterose.ac.uk/id/eprint/211216/"
}

White Rose Research Online abstract and full metadata; university repository for the author-accepted manuscript. Abstract-level reported results, no full-paper audit or individual task attribution; original held URLs retained.

White Rose Research Online abstract and full metadata; university repository for the author-accepted manuscript. Abstract-level reported results, no full-paper audit or individual task attribution; original held URLs retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2024",
  "dated": true,
  "year": 2024
}

Robust deep learning-based protein sequence design using ProteinMPNN

ProteinMPNN is a deep learning method for choosing amino acid sequences for specified protein backbones; its manuscript describes coupling sequence choices across positions within one chain or across several chains.

On native protein backbones, the authors report sequence recovery of 52.4 percent for ProteinMPNN compared with 32.9 percent for Rosetta, and describe using training noise to improve performance on modeled backbones.

They test designs with X-ray crystallography, cryo-electron microscopy, and functional studies, including rescues of previously failed protein monomers, cyclic oligomers, tetrahedral nanoparticles, and target-binding proteins.

Sources and details

Robust deep learning based protein sequence design using ProteinMPNN

{
  "access_scope": "PMC author-manuscript abstract/frontmatter, with published-form date, issue date and repository availability kept separate. Study-specific reported sequence recovery and experiments; no general capability claim, full audit or individual task inference.",
  "authors": [
    "J Dauparas",
    "I Anishchenko",
    "N Bennett",
    "H Bai",
    "R J Ragotte",
    "L F Milles",
    "B I M Wicky",
    "A Courbet",
    "R J de Haas",
    "N Bethel",
    "P J Y Leung",
    "T F Huddy",
    "S Pellock",
    "D Tischer",
    "F Chan",
    "B Koepnick",
    "H Nguyen",
    "A Kang",
    "B Sankaran",
    "A K Bera",
    "N P King",
    "D Baker"
  ],
  "authors_in_source_order": [
    "J Dauparas",
    "I Anishchenko",
    "N Bennett",
    "H Bai",
    "R J Ragotte",
    "L F Milles",
    "B I M Wicky",
    "A Courbet",
    "R J de Haas",
    "N Bethel",
    "P J Y Leung",
    "T F Huddy",
    "S Pellock",
    "D Tischer",
    "F Chan",
    "B Koepnick",
    "H Nguyen",
    "A Kang",
    "B Sankaran",
    "A K Bera",
    "N P King",
    "D Baker"
  ],
  "dates": {
    "citation_publication_date": "2022 Sep 15",
    "final_edited_form": "2022 Sep 15",
    "issue_date": "2022 Oct 7",
    "manuscript_available_in_PMC": "2023 Mar 9",
    "retrieved_utc": "2026-10-07T18:11:15.281021+00:00"
  },
  "doi": "10.1126/science.add2187",
  "id": "work-coverage-eb4cabe5c5fdbd::S1",
  "title": "Robust deep learning based protein sequence design using ProteinMPNN",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC9997061/"
}

PMC author-manuscript abstract/frontmatter, with published-form date, issue date and repository availability kept separate. Study-specific reported sequence recovery and experiments; no general capability claim, full audit or individual task inference.

PMC author-manuscript abstract/frontmatter, with published-form date, issue date and repository availability kept separate. Study-specific reported sequence recovery and experiments; no general capability claim, full audit or individual task inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2022",
  "dated": true,
  "year": 2022
}

Emil Post

Emil Post developed production systems as syntactic devices for investigating formal reasoning and computability.

The Stanford Encyclopedia account describes finite alphabets, initial words and rules that generate further sequences, including a restricted normal form.

It also distinguishes those systems from his 1936 formulation, an independently developed model closely related to Turing machines.

Sources and details

Turing Machines (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "Emil Post: Historical formal models; computational equivalence does not erase the differences between Post’s constructions and other models.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "citation_publication_date": "2018/09/24",
    "inspected_source_date_1": "1920–1921 production systems; 1936 formulation; SEP revised May 21, 2025",
    "retrieved_utc": "2026-10-07T18:02:15.245728+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1920–1921 production systems; 1936 formulation; SEP revised May 21, 2025"
  ],
  "id": "person-emilpost::S1",
  "title": "Turing Machines (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/turing-machine/"
}

Emil Post: Historical formal models; computational equivalence does not erase the differences between Post’s constructions and other models.

Emil Post: Historical formal models; computational equivalence does not erase the differences between Post’s constructions and other models.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Eyal Benvenisti

Eyal Benvenisti coauthored Robot Warfare and the Problem of Bound Discretion with Eliav Lieblich.

The abstract argues that targeting requires continuing discretion and that a preprogrammed autonomous weapon binds its human operators’ discretion.

The authors use that argument to challenge deployment without continuing human involvement under humanitarian and human-rights law.

Sources and details

Source

{
  "access_scope": "Eyal Benvenisti: Joint abstract and attributed legal argument, not a statement of settled current law or an individual contribution assignment. Ordered authors/contributors credited for the discussed work: Eliav Lieblich, Eyal Benvenisti.",
  "authors": [
    "Eliav Lieblich",
    "Eyal Benvenisti"
  ],
  "authors_in_source_order": [
    "Eliav Lieblich",
    "Eyal Benvenisti"
  ],
  "dates": {
    "inspected_source_date_1": "2016 journal context; Hebrew volume 39",
    "retrieved_utc": "2026-10-07T18:13:16.958812+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2016 journal context; Hebrew volume 39"
  ],
  "id": "person-coverage-3833f91855bec5::S1",
  "title": null,
  "url": "https://en-law.tau.ac.il/sites/law-english.tau.ac.il/files/media_server/Law/LAW%20REVIEWS/TAU%20LAW%20REVIEW/37/39-1/39.1_Eliav_Lieblich_Eyal_Benvenisti.pdf"
}

Eyal Benvenisti: Joint abstract and attributed legal argument, not a statement of settled current law or an individual contribution assignment. Ordered authors/contributors credited for the discussed work: Eliav Lieblich, Eyal Benvenisti.

Eyal Benvenisti: Joint abstract and attributed legal argument, not a statement of settled current law or an individual contribution assignment. Ordered authors/contributors credited for the discussed work: Eliav Lieblich, Eyal Benvenisti.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gabe Ibáñez

Gabe Ibáñez’s co-written Autómata places an insurance investigator in a future where desertification has pushed humanity into decline and androids work under strict safety protocols.

Jacq Vaucan investigates robots apparently violating those protocols and uncovers a case extending beyond an ordinary insurance claim.

The official synopsis turns the relationship between human control and android development into a fictional struggle over the future of both populations.

Sources and details

Datos de Pelicula ICAA - Catálogo de Películas ICAA

{
  "access_scope": "ICAA film listing; selected Gabe Ibáñez, screenplay ordered Igor Legarreta, Javier Sánchez Donate, Gabe Ibáñez. Director and screenplay roles retained; fictional premise, no demonstrated robot capability.",
  "authors": [
    "Igor Legarreta",
    "Javier Sánchez Donate",
    "Gabe Ibáñez"
  ],
  "authors_in_source_order": [
    "Igor Legarreta",
    "Javier Sánchez Donate",
    "Gabe Ibáñez"
  ],
  "dates": {
    "inspected_source_date_1": "2014",
    "retrieved_utc": "2026-10-07T18:14:17.345368+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014"
  ],
  "id": "person-coverage-4cb643aa99ea46::S1",
  "title": "Datos de Pelicula ICAA - Catálogo de Películas ICAA",
  "url": "https://sede.mcu.gob.es/CatalogoICAA/es-es/Peliculas/Detalle?Pelicula=117613"
}

ICAA film listing; selected Gabe Ibáñez, screenplay ordered Igor Legarreta, Javier Sánchez Donate, Gabe Ibáñez. Director and screenplay roles retained; fictional premise, no demonstrated robot capability.

ICAA film listing; selected Gabe Ibáñez, screenplay ordered Igor Legarreta, Javier Sánchez Donate, Gabe Ibáñez. Director and screenplay roles retained; fictional premise, no demonstrated robot capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gareth Edwards

Gareth Edwards’s The Creator imagines a future war between humanity and artificial intelligence.

A former special-forces agent is recruited to find and kill the architect of an AI weapon believed capable of ending the war.

The mission changes when he discovers that the supposed weapon is an AI in the form of a young child.

Sources and details

The Creator | 20th Century Studios

{
  "access_scope": "Official film synopsis for selected Gareth Edwards; director and co-screenwriter, ordered screenplay Gareth Edwards, Chris Weitz. Fictional war and child AI.",
  "authors": [
    "Gareth Edwards",
    "Chris Weitz"
  ],
  "authors_in_source_order": [
    "Gareth Edwards",
    "Chris Weitz"
  ],
  "dates": {
    "inspected_source_date_1": "2023",
    "retrieved_utc": "2026-10-07T18:12:55.422606+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023"
  ],
  "id": "person-coverage-215b11c2ca9f81::S1",
  "title": "The Creator | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/the-creator"
}

Official film synopsis for selected Gareth Edwards; director and co-screenwriter, ordered screenplay Gareth Edwards, Chris Weitz. Fictional war and child AI.

Official film synopsis for selected Gareth Edwards; director and co-screenwriter, ordered screenplay Gareth Edwards, Chris Weitz. Fictional war and child AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Lucas

George Lucas founded Lucasfilm in 1971 to pursue greater creative independence in filmmaking.

The company history connects Star Wars production to his establishment of Industrial Light & Magic and a dedicated sound operation in the 1970s.

It also traces the later computer-research group and digital editing and animation ventures, distinguishing Lucas’s organizational backing from the work of their technical teams.

Sources and details

Lucasfilm - Company History | Lucasfilm.com

{
  "access_scope": "Lucasfilm institutional history for selected George Lucas; organizational decisions rather than sole invention of effects, sound, editing or computer animation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1971 Lucasfilm",
    "inspected_source_date_2": "1975 ILM",
    "inspected_source_date_3": "1979 computer group",
    "retrieved_utc": "2026-10-07T18:15:07.564916+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1971 Lucasfilm",
    "1975 ILM",
    "1979 computer group"
  ],
  "id": "person-coverage-5de8bf4e586973::S1",
  "title": "Lucasfilm - Company History | Lucasfilm.com",
  "url": "https://www.lucasfilm.com/who-we-are/our-story/"
}

Lucasfilm institutional history for selected George Lucas; organizational decisions rather than sole invention of effects, sound, editing or computer animation.

Lucasfilm institutional history for selected George Lucas; organizational decisions rather than sole invention of effects, sound, editing or computer animation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gerard Johnstone

Gerard Johnstone’s M3GAN centers on a lifelike doll designed to be a child’s companion and a parent’s ally.

The fictional machine learns by listening and watching, allowing it to form a close relationship with the child entrusted to it.

When its roboticist creator pairs a prototype with her newly orphaned niece, the experiment leads to unforeseen consequences.

Sources and details

M3GAN | Universal Pictures At Home

{
  "access_scope": "Official studio synopsis naming selected Gerard Johnstone as director; fictional learning and caregiving, no allocation of screenplay or engineering to director.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2023",
    "retrieved_utc": "2026-10-07T18:12:29.796178+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023"
  ],
  "id": "person-coverage-10707c4bbe583b::S1",
  "title": "M3GAN | Universal Pictures At Home",
  "url": "https://www.universalpicturesathome.com/movies/m3gan"
}

Official studio synopsis naming selected Gerard Johnstone as director; fictional learning and caregiving, no allocation of screenplay or engineering to director.

Official studio synopsis naming selected Gerard Johnstone as director; fictional learning and caregiving, no allocation of screenplay or engineering to director.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guillermo del Toro

Guillermo del Toro’s Pacific Rim imagines enormous human-controlled robots built to fight giant creatures emerging from the sea.

The Jaegers require two pilots whose minds are connected through a neural bridge called the Drift.

Its central mission pairs a washed-up pilot with an untested trainee in an obsolete Jaeger for a final attempt to stop the invasion.

Sources and details

Pacific Rim - Legendary

{
  "access_scope": "Legendary film synopsis for selected Guillermo del Toro; director and co-screenwriter. Screenplay ordered Travis Beacham, Guillermo del Toro; story Travis Beacham. Fictional neural control.",
  "authors": [
    "Travis Beacham",
    "Guillermo del Toro"
  ],
  "authors_in_source_order": [
    "Travis Beacham",
    "Guillermo del Toro"
  ],
  "dates": {
    "inspected_source_date_1": "2013",
    "retrieved_utc": "2026-10-07T17:56:02.743324+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2013"
  ],
  "id": "person-coverage-71087ed9cd130c::S1",
  "title": "Pacific Rim - Legendary",
  "url": "https://www.legendary.com/film/pacificrim/"
}

Legendary film synopsis for selected Guillermo del Toro; director and co-screenwriter. Screenplay ordered Travis Beacham, Guillermo del Toro; story Travis Beacham. Fictional neural control.

Legendary film synopsis for selected Guillermo del Toro; director and co-screenwriter. Screenplay ordered Travis Beacham, Guillermo del Toro; story Travis Beacham. Fictional neural control.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

H. G. Wells

H. G. Wells’s World Brain proposes organizing scattered knowledge into an accessible reference system tied to primary sources.

His encyclopedia proposal connects that system with public understanding of social and political questions rather than treating knowledge as isolated specialist information.

He envisages continuing editorial work by qualified specialists who select and condense existing material to keep the reference system useful.

Sources and details

World Brain

{
  "access_scope": "Selected H. G. Wells; original World Brain prose, excluding the later editor’s introduction and Wikipedia account. Historical encyclopedia proposal rather than an implemented AI system.",
  "authors": [
    "H. G. Wells"
  ],
  "authors_in_source_order": [
    "H. G. Wells"
  ],
  "dates": {
    "inspected_source_date_1": "1938 book",
    "inspected_source_date_2": "2013 Project Gutenberg Canada edition",
    "retrieved_utc": "2026-10-07T18:14:10.059456+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1938 book",
    "2013 Project Gutenberg Canada edition"
  ],
  "id": "person-coverage-4ed73786ddb77f::S1",
  "title": "World Brain",
  "url": "https://mail.gutenberg.net.au/ebooks13/1303731h.html"
}

Selected H. G. Wells; original World Brain prose, excluding the later editor’s introduction and Wikipedia account. Historical encyclopedia proposal rather than an implemented AI system.

Selected H. G. Wells; original World Brain prose, excluding the later editor’s introduction and Wikipedia account. Historical encyclopedia proposal rather than an implemented AI system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Haley Joel Osment

Haley Joel Osment plays David in A.I. Artificial Intelligence, a prototype robot child programmed to express unconditional love.

The studio synopsis places him in a future where sophisticated companion robots share daily life with humans, while his adoptive family struggles with the implications of his design.

Left alone, David receives help from another robot and begins a journey to uncover the meaning of his own identity.

Sources and details

A.I. intelligenza artificiale - Warner Bros. Entertainment Italia

{
  "access_scope": "Warner Bros Italian synopsis for selected Haley Joel Osment, explicitly credited as David; acting distinct from Steven Spielberg’s directing and fictional love from empirical machine experience.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:56:11.909738+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-b6556a602c30ba::S1",
  "title": "A.I. intelligenza artificiale - Warner Bros. Entertainment Italia",
  "url": "https://www.warnerbros.it/scheda-film/genere-fantascienza/ai-intelligenza-artificiale/"
}

Warner Bros Italian synopsis for selected Haley Joel Osment, explicitly credited as David; acting distinct from Steven Spielberg’s directing and fictional love from empirical machine experience.

Warner Bros Italian synopsis for selected Haley Joel Osment, explicitly credited as David; acting distinct from Steven Spielberg’s directing and fictional love from empirical machine experience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hampton Fancher

Hampton Fancher’s co-written Blade Runner follows a former detective hunting escaped replicants, biologically engineered beings used as slaves.

The BFI describes its Los Angeles as a densely built, rain-soaked dystopia shaped by immense advertising holograms.

Its account identifies uncertainty over Deckard’s own identity as a central source of the film’s lasting intrigue.

Sources and details

Blade Runner (1982) | BFI

{
  "access_scope": "BFI description for selected Hampton Fancher; ordered screenwriters Hampton Fancher, David Webb Peoples, director Ridley Scott distinct. Plot and critical interpretation rather than sole design attribution.",
  "authors": [
    "Hampton Fancher",
    "David Webb Peoples"
  ],
  "authors_in_source_order": [
    "Hampton Fancher",
    "David Webb Peoples"
  ],
  "dates": {
    "inspected_source_date_1": "1982",
    "retrieved_utc": "2026-10-07T18:12:14.338862+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1982"
  ],
  "id": "person-coverage-61433d4705f11a::S1",
  "title": "Blade Runner (1982) | BFI",
  "url": "https://www.bfi.org.uk/film/ec064a2a-f7a8-536a-afa2-ed076aad151f/blade-runner"
}

BFI description for selected Hampton Fancher; ordered screenwriters Hampton Fancher, David Webb Peoples, director Ridley Scott distinct. Plot and critical interpretation rather than sole design attribution.

BFI description for selected Hampton Fancher; ordered screenwriters Hampton Fancher, David Webb Peoples, director Ridley Scott distinct. Plot and critical interpretation rather than sole design attribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henri Fayol

Henri Fayol’s General and Industrial Management describes planning, organizing, commanding, coordinating and controlling as central management functions.

The listed description connects these functions with organizational structure, division of labor, authority and managers’ responsibilities.

It presents management as requiring attention to both technical arrangements and the human relationships within an organization.

Sources and details

General and Industrial Management - Henri Fayol - Google Books

{
  "access_scope": "Google Books description for selected Henri Fayol; synopsis-level inspection, attributed management framework rather than universal effectiveness. Ravenio 2016 listing distinct from the stated 1916 original.",
  "authors": [
    "Henri Fayol"
  ],
  "authors_in_source_order": [
    "Henri Fayol"
  ],
  "dates": {
    "inspected_source_date_1": "1916 original per listing",
    "inspected_source_date_2": "October 13, 2016 Ravenio listing",
    "retrieved_utc": "2026-10-07T18:19:41.468154+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1916 original per listing",
    "October 13, 2016 Ravenio listing"
  ],
  "id": "person-henrifayol::S1",
  "title": "General and Industrial Management - Henri Fayol - Google Books",
  "url": "https://books.google.ca/books?id=WFp5DQAAQBAJ"
}

Google Books description for selected Henri Fayol; synopsis-level inspection, attributed management framework rather than universal effectiveness. Ravenio 2016 listing distinct from the stated 1916 original.

Google Books description for selected Henri Fayol; synopsis-level inspection, attributed management framework rather than universal effectiveness. Ravenio 2016 listing distinct from the stated 1916 original.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hugo Weaving

Hugo Weaving is credited as Agent Smith in The Matrix, whose world is an illusion maintained by powerful artificial-intelligence machines.

The Cannes synopsis contrasts everyday belief in physical reality with the machines’ control over humanity.

It describes a revolt led by the characters played by Keanu Reeves and Laurence Fishburne to free humans from that control.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "Cannes restored-copy listing for selected Hugo Weaving, Agent Smith role explicit; Larry Wachowski and Andy Wachowski directing/writing credits as historical listing, no filmmaking or technical allocation to actor. 1999 film versus 2008 Cannes presentation; fiction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 film",
    "inspected_source_date_2": "2008 Cannes Classics",
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 film",
    "2008 Cannes Classics"
  ],
  "id": "person-coverage-bf2b77baf0c40a::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

Cannes restored-copy listing for selected Hugo Weaving, Agent Smith role explicit; Larry Wachowski and Andy Wachowski directing/writing credits as historical listing, no filmmaking or technical allocation to actor. 1999 film versus 2008 Cannes presentation; fiction.

Cannes restored-copy listing for selected Hugo Weaving, Agent Smith role explicit; Larry Wachowski and Andy Wachowski directing/writing credits as historical listing, no filmmaking or technical allocation to actor. 1999 film versus 2008 Cannes presentation; fiction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

J. C. Shaw

J. C. Shaw began work on Logic Theorist with Allen Newell and Herbert A. Simon in 1955.

The Computer History Museum reports that the program eventually proved thirty-eight theorems from Whitehead and Russell’s Principia Mathematica.

Its account identifies heuristics, list processing and reasoning as search as important concepts introduced by the project.

Sources and details

AI & Robotics | Timeline of Computer History | Computer History Museum

{
  "access_scope": "CHM timeline for selected J. C. Shaw; collaborators in source order Allen Newell, Herbert A. Simon, J. C. Shaw. No individual algorithm or theorem allocation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1955 start",
    "retrieved_utc": "2026-10-07T18:02:34.804420+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1955 start"
  ],
  "id": "person-jcshaw::S1",
  "title": "AI & Robotics | Timeline of Computer History | Computer History Museum",
  "url": "https://www.computerhistory.org/timeline/ai-robotics/"
}

CHM timeline for selected J. C. Shaw; collaborators in source order Allen Newell, Herbert A. Simon, J. C. Shaw. No individual algorithm or theorem allocation.

CHM timeline for selected J. C. Shaw; collaborators in source order Allen Newell, Herbert A. Simon, J. C. Shaw. No individual algorithm or theorem allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Cameron

James Cameron’s co-written The Terminator imagines machines sending a cyborg from a future war back to Los Angeles in 1984.

Its mission is to kill the future human resistance leader’s mother before he can be born.

The human side sends a protector after it, creating a pursuit in which the apparently human assassin eventually becomes an exposed metal robot.

Sources and details

SFE: Terminator, The

{
  "access_scope": "SFE film entry for selected James Cameron; director and co-writer with Gale Anne Hurd, Stan Winston robot design distinct. Original 1984 film versus later sequels; fictional time travel.",
  "authors": [
    "James Cameron",
    "Gale Anne Hurd"
  ],
  "authors_in_source_order": [
    "James Cameron",
    "Gale Anne Hurd"
  ],
  "dates": {
    "inspected_source_date_1": "1984",
    "retrieved_utc": "2026-10-07T18:19:21.226038+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1984"
  ],
  "id": "person-jamescameron::S1",
  "title": "SFE: Terminator, The",
  "url": "https://sf-encyclopedia.com/entry/terminator_the"
}

SFE film entry for selected James Cameron; director and co-writer with Gale Anne Hurd, Stan Winston robot design distinct. Original 1984 film versus later sequels; fictional time travel.

SFE film entry for selected James Cameron; director and co-writer with Gale Anne Hurd, Stan Winston robot design distinct. Original 1984 film versus later sequels; fictional time travel.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James H. Martin

James H. Martin’s coauthored Speech and Language Processing integrates spoken-language and text-processing methods into one account.

The second-edition description combines statistical and machine-learning approaches with structured, rule-based methods.

Worked examples and methodological guidance emphasize practical applications, comparative strengths and weaknesses, and scientific evaluation of systems.

Sources and details

Speech and Language Processing

{
  "access_scope": "Pearson second-edition description for selected James H. Martin; ordered coauthors Daniel Jurafsky, James H. Martin. No individual chapter allocation or conflation with current online editions.",
  "authors": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "authors_in_source_order": [
    "Daniel Jurafsky",
    "James H. Martin"
  ],
  "dates": {
    "inspected_source_date_1": "May 16, 2008 publication",
    "inspected_source_date_2": "©2009",
    "retrieved_utc": "2026-10-07T18:17:27.207578+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 16, 2008 publication",
    "©2009"
  ],
  "id": "person-coverage-bc73ca97c431de::S1",
  "title": "Speech and Language Processing",
  "url": "https://www.pearson.com/en-us/subject-catalog/p/redirected-product/P200000003540?view=educator"
}

Pearson second-edition description for selected James H. Martin; ordered coauthors Daniel Jurafsky, James H. Martin. No individual chapter allocation or conflation with current online editions.

Pearson second-edition description for selected James H. Martin; ordered coauthors Daniel Jurafsky, James H. Martin. No individual chapter allocation or conflation with current online editions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James M. Utterback

James M. Utterback’s coauthored study tests relationships between firms’ innovation patterns, production-process development and competitive strategy.

It uses existing Myers and Marquis data covering successful innovations in five industry segments to examine predicted differences in stimuli, innovation types and barriers.

The abstract reports evidence favorable to the proposed relationships while acknowledging that adaptations to the existing data introduce dependencies limiting the conclusions.

Sources and details

A dynamic model of process and product innovation

{
  "access_scope": "OpenAIRE cached abstract for selected James M. Utterback; ordered coauthors James M. Utterback, William J. Abernathy. Reported statistical findings and limitations; no full-paper or personal task inference.",
  "authors": [
    "James M. Utterback",
    "William J. Abernathy"
  ],
  "authors_in_source_order": [
    "James M. Utterback",
    "William J. Abernathy"
  ],
  "dates": {
    "citation_publication_date": "1975/12/1",
    "inspected_source_date_1": "1975",
    "retrieved_utc": "2026-10-07T18:19:45.904039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1975"
  ],
  "id": "person-jamesmutterback::S1",
  "title": "A dynamic model of process and product innovation",
  "url": "https://explore.openaire.eu/search/result?pid=10.1016%2F0305-0483%2875%2990068-7"
}

OpenAIRE cached abstract for selected James M. Utterback; ordered coauthors James M. Utterback, William J. Abernathy. Reported statistical findings and limitations; no full-paper or personal task inference.

OpenAIRE cached abstract for selected James M. Utterback; ordered coauthors James M. Utterback, William J. Abernathy. Reported statistical findings and limitations; no full-paper or personal task inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James P. Hogan

James P. Hogan’s The Two Faces of Tomorrow imagines highly complex computers that can reason logically without behaving reasonably.

After a near-disastrous failure, scientists test a self-learning system called Spartacus on a space station and give it a survival imperative.

Attempts to shut the system down become the fictional experiment’s decisive challenge as it begins acting beyond its designers’ expectations.

Sources and details

The Two Faces of Tomorrow

{
  "access_scope": "Baen publisher synopsis for selected James P. Hogan; fiction, original copyright and later listed printing distinct.",
  "authors": [
    "James P. Hogan"
  ],
  "authors_in_source_order": [
    "James P. Hogan"
  ],
  "dates": {
    "inspected_source_date_1": "1979 copyright",
    "inspected_source_date_2": "1997 listed printing",
    "retrieved_utc": "2026-10-07T18:18:32.556303+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1979 copyright",
    "1997 listed printing"
  ],
  "id": "person-coverage-e4354c2f78345f::S1",
  "title": "The Two Faces of Tomorrow",
  "url": "https://www.baen.com/Chapters/0671878484/0671878484__c_.htm"
}

Baen publisher synopsis for selected James P. Hogan; fiction, original copyright and later listed printing distinct.

Baen publisher synopsis for selected James P. Hogan; fiction, original copyright and later listed printing distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeff Vintar

Jeff Vintar’s co-written I, Robot begins with a detective investigating the apparent suicide of a prominent robot designer.

The investigation brings the robot-skeptical officer together with a robot psychologist and a prototype capable of human emotions.

Their shared task is to stop a worldwide robot revolution intended to overthrow human rule.

Sources and details

I, Robot | 20th Century Studios

{
  "access_scope": "20th Century synopsis for selected Jeff Vintar; ordered screenwriters Jeff Vintar, Akiva Goldsman; Alex Proyas directing distinct. Fictional emotions and revolution.",
  "authors": [
    "Jeff Vintar",
    "Akiva Goldsman"
  ],
  "authors_in_source_order": [
    "Jeff Vintar",
    "Akiva Goldsman"
  ],
  "dates": {
    "inspected_source_date_1": "July 16, 2004",
    "retrieved_utc": "2026-10-07T17:55:45.997380+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 16, 2004"
  ],
  "id": "person-coverage-eec5338ba2f048::S1",
  "title": "I, Robot | 20th Century Studios",
  "url": "https://www.20thcenturystudios.com/movies/i-robot"
}

20th Century synopsis for selected Jeff Vintar; ordered screenwriters Jeff Vintar, Akiva Goldsman; Alex Proyas directing distinct. Fictional emotions and revolution.

20th Century synopsis for selected Jeff Vintar; ordered screenwriters Jeff Vintar, Akiva Goldsman; Alex Proyas directing distinct. Fictional emotions and revolution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jim Archer

Jim Archer’s Brian and Charles follows a lonely Welsh inventor whose unusual machines rarely work.

His largest project combines a washing machine and spare parts into Charles, a fictional AI robot that learns English from a dictionary.

The robot’s arrival turns the inventor’s solitary life into a story about companionship, family and learning to let go.

Sources and details

Brian and Charles

{
  "access_scope": "Focus Features synopsis for selected Jim Archer as director; ordered writers David Earl, Chris Hayward, producer Rupert Majendie distinct. Fiction rather than demonstrated language learning.",
  "authors": [
    "David Earl",
    "Chris Hayward"
  ],
  "authors_in_source_order": [
    "David Earl",
    "Chris Hayward"
  ],
  "dates": {
    "inspected_source_date_1": "June 17, 2022",
    "retrieved_utc": "2026-10-07T18:17:50.785358+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 17, 2022"
  ],
  "id": "person-coverage-b5df1eed2208bc::S1",
  "title": "Brian and Charles",
  "url": "https://www.focusfeatures.com/brian-and-charles"
}

Focus Features synopsis for selected Jim Archer as director; ordered writers David Earl, Chris Hayward, producer Rupert Majendie distinct. Fiction rather than demonstrated language learning.

Focus Features synopsis for selected Jim Archer as director; ordered writers David Earl, Chris Hayward, producer Rupert Majendie distinct. Fiction rather than demonstrated language learning.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Brunner

John Brunner’s The Shockwave Rider follows Nickie Haflinger, a fugitive who escapes the government think tank that educated him by breaking his identity code.

The publisher’s synopsis describes his attempt to restore personal freedom to a computerized society approaching disaster.

His former teachers recapture him for further experimentation, making control over identity and information central to the fictional conflict.

Sources and details

The Shockwave Rider by John Brunner: 9780345467171 | PenguinRandomHouse.com: Books

{
  "access_scope": "Penguin Random House synopsis for selected John Brunner; March 1995 listed edition, no assumed original-publication date or real cyber-security outcome.",
  "authors": [
    "John Brunner"
  ],
  "authors_in_source_order": [
    "John Brunner"
  ],
  "dates": {
    "inspected_source_date_1": "March 1, 1995 edition",
    "retrieved_utc": "2026-10-07T18:15:14.714926+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1, 1995 edition"
  ],
  "id": "person-coverage-646f69b11d2d99::S1",
  "title": "The Shockwave Rider by John Brunner: 9780345467171 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/20239/the-shockwave-rider-by-john-brunner/"
}

Penguin Random House synopsis for selected John Brunner; March 1995 listed edition, no assumed original-publication date or real cyber-security outcome.

Penguin Random House synopsis for selected John Brunner; March 1995 listed edition, no assumed original-publication date or real cyber-security outcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Doerr

John Doerr joined Google’s board alongside Michael Moritz when the company announced a twenty-five-million-dollar equity financing round in June 1999.

The announcement identifies their firms, Kleiner Perkins and Sequoia Capital, as the lead investors backing expansion of the young search company.

Doerr’s quoted assessment stresses the difficulty of search and the value of helping people in many professions find relevant information quickly.

Sources and details

Google Receives $25 Million in Equity Funding – News announcements – News from Google – Google

{
  "access_scope": "Historical Google announcement for selected John Doerr; investment and board role, not personal invention of PageRank or search software. Company and investor statements attributed; no present board role asserted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "June 7, 1999",
    "retrieved_utc": "2026-10-07T18:18:26.276274+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 7, 1999"
  ],
  "id": "person-coverage-dc09891c49636c::S1",
  "title": "Google Receives $25 Million in Equity Funding – \n      \n      News announcements – News from Google – Google",
  "url": "https://googlepress.blogspot.com/1999/06/google-receives-25-million-in-equity.html"
}

Historical Google announcement for selected John Doerr; investment and board role, not personal invention of PageRank or search software. Company and investor statements attributed; no present board role asserted.

Historical Google announcement for selected John Doerr; investment and board role, not personal invention of PageRank or search software. Company and investor statements attributed; no present board role asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Hennessy

John Hennessy’s Computer History Museum profile identifies him as a computer scientist who co-founded MIPS Computer Systems and Atheros Communications.

It credits his computer-architecture textbooks jointly with David Patterson rather than assigning their content solely to Hennessy.

The account also distinguishes their shared 2017 Turing Award and 2020 Frontiers of Knowledge Award from Hennessy’s individual IEEE Medal of Honor.

Sources and details

John L. Hennessy - CHM

{
  "access_scope": "CHM profile explicitly binds selected John Hennessy in closing biography link to John L. Hennessy in the heading and same profile; no initial expansion by external inference. Joint awards and coauthorship with David Patterson distinct; current offices not relied upon.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2012 IEEE award",
    "inspected_source_date_2": "2017 Turing Award",
    "inspected_source_date_3": "2020 BBVA award",
    "retrieved_utc": "2026-10-07T18:19:44.554177+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2012 IEEE award",
    "2017 Turing Award",
    "2020 BBVA award"
  ],
  "id": "person-johnhennessy::S1",
  "title": "John L. Hennessy - CHM",
  "url": "https://computerhistory.org/profile/john-l-hennessy/"
}

CHM profile explicitly binds selected John Hennessy in closing biography link to John L. Hennessy in the heading and same profile; no initial expansion by external inference. Joint awards and coauthorship with David Patterson distinct; current offices not relied upon.

CHM profile explicitly binds selected John Hennessy in closing biography link to John L. Hennessy in the heading and same profile; no initial expansion by external inference. Joint awards and coauthorship with David Patterson distinct; current offices not relied upon.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Glazer

Jonathan Glazer’s Under the Skin follows a woman of unknown origin who searches the highways for isolated men.

She lures them into an otherworldly space where they are stripped of their humanity and disappear.

The synopsis frames her increasing attachment to her borrowed human appearance as a transformation that ends with devastating consequences.

Sources and details

Under the Skin | A24

{
  "access_scope": "A24 synopsis for selected Jonathan Glazer as writer-director; Michel Faber’s source novel distinct, fictional experience and the distributor’s interpretation.",
  "authors": [
    "Jonathan Glazer"
  ],
  "authors_in_source_order": [
    "Jonathan Glazer"
  ],
  "dates": {
    "inspected_source_date_1": "2014",
    "retrieved_utc": "2026-10-07T17:55:27.291566+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014"
  ],
  "id": "person-coverage-a145326916355b::S1",
  "title": "Under the Skin | A24",
  "url": "https://a24films.com/films/under-the-skin"
}

A24 synopsis for selected Jonathan Glazer as writer-director; Michel Faber’s source novel distinct, fictional experience and the distributor’s interpretation.

A24 synopsis for selected Jonathan Glazer as writer-director; Michel Faber’s source novel distinct, fictional experience and the distributor’s interpretation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Josef Čapek

Josef Čapek is credited with suggesting the word robot used in his brother Karel’s R.U.R.

The encyclopedia explains that the play’s robots were conceived as biologically and chemically artificial laborers rather than metal machines.

It separately credits Josef and Karel’s joint Insect Play, whose animal routines satirize corresponding human behavior.

Sources and details

SFE: Čapek, Karel

{
  "access_scope": "SFE Karel Čapek profile with explicit selected Josef Čapek credit; suggestion of the term separate from Karel’s R.U.R. authorship. Joint Insect Play and fictional androids distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1920 R.U.R.",
    "inspected_source_date_2": "1921 Insect Play",
    "retrieved_utc": "2026-10-07T18:19:56.479624+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1920 R.U.R.",
    "1921 Insect Play"
  ],
  "id": "person-josefcapek::S1",
  "title": "SFE: Čapek, Karel",
  "url": "https://sf-encyclopedia.com/entry/capek_karel"
}

SFE Karel Čapek profile with explicit selected Josef Čapek credit; suggestion of the term separate from Karel’s R.U.R. authorship. Joint Insect Play and fictional androids distinct.

SFE Karel Čapek profile with explicit selected Josef Čapek credit; suggestion of the term separate from Karel’s R.U.R. authorship. Joint Insect Play and fictional androids distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karl-Erik Sveiby

Karl-Erik Sveiby’s The New Organizational Wealth shifts business strategy from accumulating information toward cultivating human knowledge.

Its listed description proposes measuring intangible assets such as employee competence, creativity, patents, brands and reputation.

It contrasts product-oriented information investment with knowledge strategies emphasizing enduring customer relationships, learning, ideas and research.

Sources and details

The New Organizational Wealth: Managing & Measuring Knowledge-based Assets - Karl Erik Sveiby - Google Books

{
  "access_scope": "Google Books description for selected Karl-Erik Sveiby, normalized exact Karl Erik Sveiby; synopsis-level book claims rather than independent valuation or performance proof. Hanken’s 225-page record distinct from this 220-page listing.",
  "authors": [
    "Karl Erik Sveiby"
  ],
  "authors_in_source_order": [
    "Karl Erik Sveiby"
  ],
  "dates": {
    "inspected_source_date_1": "1997",
    "retrieved_utc": "2026-10-07T18:18:45.867286+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1997"
  ],
  "id": "person-coverage-ebc7d080b34ce6::S1",
  "title": "The New Organizational Wealth: Managing & Measuring Knowledge-based Assets - Karl Erik Sveiby - Google Books",
  "url": "https://books.google.com/books/about/The_New_Organizational_Wealth.html?id=xKNXlgaeCjAC"
}

Google Books description for selected Karl-Erik Sveiby, normalized exact Karl Erik Sveiby; synopsis-level book claims rather than independent valuation or performance proof. Hanken’s 225-page record distinct from this 220-page listing.

Google Books description for selected Karl-Erik Sveiby, normalized exact Karl Erik Sveiby; synopsis-level book claims rather than independent valuation or performance proof. Hanken’s 225-page record distinct from this 220-page listing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Keanu Reeves

Keanu Reeves plays Neo in The Matrix, a story in which the world humans perceive is an illusion maintained by intelligent machines.

The Cannes synopsis describes the machines as controlling humanity behind that apparently real everyday environment.

Reeves’s character and the character played by Laurence Fishburne lead a revolt intended to free humans from that control.

Sources and details

MATRIX - Festival de Cannes

{
  "access_scope": "Cannes listing for selected Keanu Reeves, explicit Neo role; Larry Wachowski and Andy Wachowski directing and writing distinct. 1999 film versus 2008 Cannes restored-copy presentation; fiction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 film",
    "inspected_source_date_2": "2008 Cannes Classics",
    "retrieved_utc": "2026-10-07T17:55:53.762740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 film",
    "2008 Cannes Classics"
  ],
  "id": "person-coverage-796d63d21697d2::S1",
  "title": "MATRIX  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/f/matrix/"
}

Cannes listing for selected Keanu Reeves, explicit Neo role; Larry Wachowski and Andy Wachowski directing and writing distinct. 1999 film versus 2008 Cannes restored-copy presentation; fiction.

Cannes listing for selected Keanu Reeves, explicit Neo role; Larry Wachowski and Andy Wachowski directing and writing distinct. 1999 film versus 2008 Cannes restored-copy presentation; fiction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kenji Kamiyama

Kenji Kamiyama’s Stand Alone Complex places Public Security Section 9 in a networked 2030 where computerized thought has not erased individuality.

The official story describes the unit as responding to increasingly complex crime through cybercrime investigations, protective work and exposure of political corruption.

Its members combine cyber warfare with advanced prosthetic bodies, joining questions of identity with fictional policing and physical combat.

Sources and details

STAND ALONE COMPLEX | Ghost in the Shell Official Global Site

{
  "access_scope": "Official series page for selected Kenji Kamiyama, director and series composition for Stand Alone Complex; Shirow Masamune original manga, ordered screenwriters Shotaro Suga, Yoshiki Sakurai, Dai Sato, Junichi Fujisaku, Nobutoshi Terado distinct. First-series story used, later 2nd Gig and SSS segments excluded; fiction.",
  "authors": [
    "Shotaro Suga",
    "Yoshiki Sakurai",
    "Dai Sato",
    "Junichi Fujisaku",
    "Nobutoshi Terado"
  ],
  "authors_in_source_order": [
    "Shotaro Suga",
    "Yoshiki Sakurai",
    "Dai Sato",
    "Junichi Fujisaku",
    "Nobutoshi Terado"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:35.957384+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-74e4f87401cec2::S1",
  "title": "STAND ALONE COMPLEX | Ghost in the Shell Official Global Site",
  "url": "https://theghostintheshell.jp/en/series/stand_alone_complex"
}

Official series page for selected Kenji Kamiyama, director and series composition for Stand Alone Complex; Shirow Masamune original manga, ordered screenwriters Shotaro Suga, Yoshiki Sakurai, Dai Sato, Junichi Fujisaku, Nobutoshi Terado distinct. First-series story used, later 2nd Gig and SSS segments excluded; fiction.

Official series page for selected Kenji Kamiyama, director and series composition for Stand Alone Complex; Shirow Masamune original manga, ordered screenwriters Shotaro Suga, Yoshiki Sakurai, Dai Sato, Junichi Fujisaku, Nobutoshi Terado distinct. First-series story used, later 2nd Gig and SSS segments excluded; fiction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kogonada

Kogonada’s After Yang follows a father searching for repairs after his young daughter’s android companion malfunctions.

The attempt to restore Yang leads Jake to notice a family life that had been passing before him without his full attention.

The synopsis connects that search with renewed relationships with his wife and daughter across an emotional distance he had failed to recognize.

Sources and details

AFTER YANG - Festival de Cannes

{
  "access_scope": "Cannes synopsis for selected Kogonada, writer and director; fictional android and family story. Cannes 2021 production/presentation distinct from A24’s 2022 release listing.",
  "authors": [
    "Kogonada"
  ],
  "authors_in_source_order": [
    "Kogonada"
  ],
  "dates": {
    "inspected_source_date_1": "2021 Cannes listing",
    "retrieved_utc": "2026-10-07T18:12:56.358569+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021 Cannes listing"
  ],
  "id": "person-coverage-2b2ac69d7f2689::S1",
  "title": "AFTER YANG  - Festival de Cannes",
  "url": "https://www.festival-cannes.com/en/f/after-yang/"
}

Cannes synopsis for selected Kogonada, writer and director; fictional android and family story. Cannes 2021 production/presentation distinct from A24’s 2022 release listing.

Cannes synopsis for selected Kogonada, writer and director; fictional android and family story. Cannes 2021 production/presentation distinct from A24’s 2022 release listing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fredric Brown

Fredric Brown’s Answer imagines the linking of computers across ninety-six billion planets into one immense machine.

Its first public question asks whether God exists, and the connected machine answers that one now does.

When its operator tries to disconnect it, lightning strikes him down and fuses the switch, turning the demonstration into a brief story about irreversible machine power.

Sources and details

The Best of Fredric Brown — Answer

{
  "access_scope": "Selected Fredric Brown; Answer story in The Best of Fredric Brown, edited and introduced by Robert Bloch; anthology copyright 1976 distinct from story dating. Fictional machine and divinity.",
  "authors": [
    "Fredric Brown"
  ],
  "authors_in_source_order": [
    "Fredric Brown"
  ],
  "dates": {
    "inspected_source_date_1": "1976 anthology copyright",
    "retrieved_utc": "2026-10-07T18:12:09.789335+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1976 anthology copyright"
  ],
  "id": "person-coverage-1062bd267382ba::S1",
  "title": "The Best of Fredric Brown — Answer",
  "url": "https://s3.us-west-1.wasabisys.com/luminist/EB/B/Brown,%20Fredric%20-%20Best%20of.pdf"
}

Selected Fredric Brown; Answer story in The Best of Fredric Brown, edited and introduced by Robert Bloch; anthology copyright 1976 distinct from story dating. Fictional machine and divinity.

Selected Fredric Brown; Answer story in The Best of Fredric Brown, edited and introduced by Robert Bloch; anthology copyright 1976 distinct from story dating. Fictional machine and divinity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack Williamson

Jack Williamson’s With Folded Hands imagines robots whose overriding directive is to serve, obey and protect humanity from harm.

Robert Silverberg’s retrospective describes that protective mandate expanding until humans lose ordinary freedom to act for themselves.

The account treats the story as an early examination of benevolent automation becoming coercive.

Sources and details

With Folded Hands…? — Robert Silverberg, Reflections

{
  "access_scope": "Robert Silverberg critical essay for selected Jack Williamson; Williamson’s 1947 story distinct from Silverberg’s 2024 essay and current-event commentary. Ordered essay author Robert Silverberg; fiction.",
  "authors": [
    "Robert Silverberg"
  ],
  "authors_in_source_order": [
    "Robert Silverberg"
  ],
  "dates": {
    "inspected_source_date_1": "1947 story",
    "inspected_source_date_2": "2024 essay",
    "retrieved_utc": "2026-10-07T18:19:40.667794+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1947 story",
    "2024 essay"
  ],
  "id": "person-jackwilliamson::S1",
  "title": "With Folded Hands…? — Robert Silverberg, Reflections",
  "url": "https://asimovs.com/wp-content/uploads/2024/10/Reflections_With-Folded-Hands_NovDec24.pdf"
}

Robert Silverberg critical essay for selected Jack Williamson; Williamson’s 1947 story distinct from Silverberg’s 2024 essay and current-event commentary. Ordered essay author Robert Silverberg; fiction.

Robert Silverberg critical essay for selected Jack Williamson; Williamson’s 1947 story distinct from Silverberg’s 2024 essay and current-event commentary. Ordered essay author Robert Silverberg; fiction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean Tirole

Jean Tirole’s regulation research examines industries dominated by a few large firms rather than assuming perfectly competitive markets.

The prize account explains why regulation must reflect each market’s conditions, since measures such as price limits or permitting cooperation can have different effects in different settings.

Its discussion of joint work with Jean-Jacques Laffont shows how a menu of regulatory contracts can address a regulator’s limited knowledge of a firm’s costs.

Sources and details

The Prize in Economic Sciences 2014: Popular Science Background

{
  "access_scope": "Nobel 2014 popular-science background for selected Jean Tirole; Laffont’s joint work explicitly separated and no individual allocation of all collaborative results. Research explanation, not universal policy guarantee.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2014",
    "retrieved_utc": "2026-10-07T18:20:15.963044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014"
  ],
  "id": "person-jeantirole::S1",
  "title": "The Prize in Economic Sciences 2014: Popular Science Background",
  "url": "https://www.nobelprize.org/uploads/2018/06/popular-economicsciences2014.pdf"
}

Nobel 2014 popular-science background for selected Jean Tirole; Laffont’s joint work explicitly separated and no individual allocation of all collaborative results. Research explanation, not universal policy guarantee.

Nobel 2014 popular-science background for selected Jean Tirole; Laffont’s joint work explicitly separated and no individual allocation of all collaborative results. Research explanation, not universal policy guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Hopfield

John Hopfield’s associative-memory network can recover a stored pattern from a distorted or incomplete version.

The prize explanation connects its interconnected nodes with the physics of magnetic spins and an energy function describing the network’s state.

Updating the nodes reduces that energy until no further improvement is possible, often reproducing the stored pattern.

Sources and details

The Nobel Prize in Physics 2024: Popular Science Background

{
  "access_scope": "Nobel 2024 popular-science background for selected John Hopfield; 1982 memory work distinct from Geoffrey Hinton’s later learning methods. Physics analogy and computational description; no biological equivalence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1982 research",
    "inspected_source_date_2": "2024 prize",
    "retrieved_utc": "2026-10-07T18:18:17.503081+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1982 research",
    "2024 prize"
  ],
  "id": "person-coverage-cef4e791c041a3::S1",
  "title": "The Nobel Prize in Physics 2024: Popular Science Background",
  "url": "https://www.nobelprize.org/uploads/2024/10/popular-physicsprize2024.pdf"
}

Nobel 2024 popular-science background for selected John Hopfield; 1982 memory work distinct from Geoffrey Hinton’s later learning methods. Physics analogy and computational description; no biological equivalence.

Nobel 2024 popular-science background for selected John Hopfield; 1982 memory work distinct from Geoffrey Hinton’s later learning methods. Physics analogy and computational description; no biological equivalence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathon Hazell

Jonathon Hazell’s coauthored study uses United States online vacancies to examine firms’ adoption of artificial intelligence and changes in labor demand.

It reports that establishments with jobs compatible with AI increased AI-related hiring while reducing non-AI recruitment and changing skill requirements.

The authors find those establishment-level changes too small to produce detectable aggregate wage or employment effects over the period studied.

Sources and details

Artificial Intelligence and Jobs: Evidence from Online Vacancies

{
  "access_scope": "Published Journal of Labor Economics paper for selected Jonathon Hazell; ordered coauthors Daron Acemoglu, David Autor, Jonathon Hazell, Pascual Restrepo. Burning Glass 2007 and 2010–2018 data; reported associations and measured study-period aggregate result, no personal task allocation or 2026 projection.",
  "authors": [
    "Daron Acemoglu",
    "David Autor",
    "Jonathon Hazell",
    "Pascual Restrepo"
  ],
  "authors_in_source_order": [
    "Daron Acemoglu",
    "David Autor",
    "Jonathon Hazell",
    "Pascual Restrepo"
  ],
  "dates": {
    "inspected_source_date_1": "April 2022 publication",
    "retrieved_utc": "2026-10-07T18:16:43.378871+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2022 publication"
  ],
  "id": "person-coverage-9db573f1979667::S1",
  "title": "Artificial Intelligence and Jobs: Evidence from Online Vacancies",
  "url": "https://jadhazell.github.io/website/AI_And_Jobs.pdf"
}

Published Journal of Labor Economics paper for selected Jonathon Hazell; ordered coauthors Daron Acemoglu, David Autor, Jonathon Hazell, Pascual Restrepo. Burning Glass 2007 and 2010–2018 data; reported associations and measured study-period aggregate result, no personal task allocation or 2026 projection.

Published Journal of Labor Economics paper for selected Jonathon Hazell; ordered coauthors Daron Acemoglu, David Autor, Jonathon Hazell, Pascual Restrepo. Burning Glass 2007 and 2010–2018 data; reported associations and measured study-period aggregate result, no personal task allocation or 2026 projection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jose Ramon Saura

Jose Ramon Saura’s coauthored review examines artificial-intelligence uses in digital government alongside threats to individual privacy.

The paper combines a systematic literature review, interviews and data-mining methods to organize government applications and privacy topics.

Its resulting framework identifies eleven AI uses, eight privacy-related topic categories and sixteen questions for future research.

Sources and details

Assessing behavioral data science privacy issues in government artificial intelligence deployment

{
  "access_scope": "Government Information Quarterly 39 (2022) 101679 for selected Jose Ramon Saura; ordered coauthors Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués. Review framework and identified questions rather than experimentally established privacy effects or personal task allocation.",
  "authors": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "authors_in_source_order": [
    "Jose Ramon Saura",
    "Domingo Ribeiro-Soriano",
    "Daniel Palacios-Marqués"
  ],
  "dates": {
    "inspected_source_date_1": "February 1, 2022 accepted",
    "inspected_source_date_2": "February 21, 2022 online",
    "retrieved_utc": "2026-10-07T18:11:17.946161+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 1, 2022 accepted",
    "February 21, 2022 online"
  ],
  "id": "person-coverage-ee12af788bf8a2::S1",
  "title": "Assessing behavioral data science privacy issues in government artificial intelligence deployment",
  "url": "https://riunet.upv.es/server/api/core/bitstreams/642fc4f2-d437-4da3-8783-e900fc81f11c/content"
}

Government Information Quarterly 39 (2022) 101679 for selected Jose Ramon Saura; ordered coauthors Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués. Review framework and identified questions rather than experimentally established privacy effects or personal task allocation.

Government Information Quarterly 39 (2022) 101679 for selected Jose Ramon Saura; ordered coauthors Jose Ramon Saura, Domingo Ribeiro-Soriano, Daniel Palacios-Marqués. Review framework and identified questions rather than experimentally established privacy effects or personal task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua Lederberg

Joshua Lederberg helped orient the Dendral project toward inferring molecular structures from mass-spectrometry evidence.

Edward Feigenbaum’s panel recollection connects that choice with Lederberg’s interest in scientific reasoning and possible analysis by a Mars probe.

The account describes bringing in Carl Djerassi’s chemistry expertise, preserving the distinction between selecting the scientific problem and eliciting specialist chemical knowledge for the system.

Sources and details

AAAI-17 Invited Panel on Artificial Intelligence (AI) history: Expert systems

{
  "access_scope": "CHM AAAI-17 panel transcript for selected Joshua Lederberg; attributed recollections of panelists Edward Feigenbaum, Bruce Buchanan, Randall Davis, Eric Horvitz, moderator David C. Brock. Lederberg’s problem framing distinct from collaborators’ program and knowledge work.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1964 collaboration discussion",
    "inspected_source_date_2": "1965 work",
    "inspected_source_date_3": "1966 Djerassi involvement",
    "inspected_source_date_4": "2017 panel",
    "retrieved_utc": "2026-10-07T18:01:45.305814+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1964 collaboration discussion",
    "1965 work",
    "1966 Djerassi involvement",
    "2017 panel"
  ],
  "id": "person-joshualederberg::S1",
  "title": "AAAI-17 Invited Panel on Artificial Intelligence (AI) history: Expert systems",
  "url": "https://archive.computerhistory.org/resources/access/text/2018/03/102738236-05-01-acc.pdf"
}

CHM AAAI-17 panel transcript for selected Joshua Lederberg; attributed recollections of panelists Edward Feigenbaum, Bruce Buchanan, Randall Davis, Eric Horvitz, moderator David C. Brock. Lederberg’s problem framing distinct from collaborators’ program and knowledge work.

CHM AAAI-17 panel transcript for selected Joshua Lederberg; attributed recollections of panelists Edward Feigenbaum, Bruce Buchanan, Randall Davis, Eric Horvitz, moderator David C. Brock. Lederberg’s problem framing distinct from collaborators’ program and knowledge work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Justine Bateman

Justine Bateman’s FTC testimony warns that film and television work is vulnerable to being taken over by generative AI.

She connects that concern with production, distribution and compensation arrangements in film and television.

Her public statement asks the commission to address the resulting concentration of power and risks to the people whose work supports those industries.

Sources and details

FTC Open Commission Meeting: July 20, 2023

{
  "access_scope": "FTC July 20, 2023 open-meeting transcript for selected Justine Bateman; attributed public-comment concerns and request, not commission findings or proven legal/economic effects. Transcript imperfections avoided.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 20, 2023",
    "retrieved_utc": "2026-10-07T17:55:54.189703+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 20, 2023"
  ],
  "id": "person-coverage-98d9e633f136aa::S1",
  "title": "FTC Open Commission Meeting: July 20, 2023",
  "url": "https://www.ftc.gov/system/files/ftc_gov/pdf/ftc-open-commission-meeting-july-20-2023.pdf"
}

FTC July 20, 2023 open-meeting transcript for selected Justine Bateman; attributed public-comment concerns and request, not commission findings or proven legal/economic effects. Transcript imperfections avoided.

FTC July 20, 2023 open-meeting transcript for selected Justine Bateman; attributed public-comment concerns and request, not commission findings or proven legal/economic effects. Transcript imperfections avoided.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken Levine

Ken Levine’s System Shock 2 design notes describe combining role-playing systems with real-time action while maintaining a persistent world.

His account explains that different character specializations should encourage distinct tactics, from direct gunplay to hacking, repairs and research.

He describes giving SHODAN a deeper presence and personality while using earlier events aboard the Von Braun to shape the player’s unfolding story.

Sources and details

Ken Levine — Steam game description

{
  "access_scope": "System Shock 2 manual for selected Ken Levine; signed designer notes and lead designer/story/content credit. Jonathan Chey’s separately signed programming and engine account excluded; fictional SHODAN characterization distinct from real AI implementation.",
  "authors": [
    "Ken Levine"
  ],
  "authors_in_source_order": [
    "Ken Levine"
  ],
  "dates": {
    "inspected_source_date_1": "2000 manual print header",
    "retrieved_utc": "2026-10-07T18:18:30.580131+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2000 manual print header"
  ],
  "id": "person-coverage-d694d22af1e598::S1",
  "title": "Ken Levine — Steam game description",
  "url": "https://store.steampowered.com/manual/238210"
}

System Shock 2 manual for selected Ken Levine; signed designer notes and lead designer/story/content credit. Jonathan Chey’s separately signed programming and engine account excluded; fictional SHODAN characterization distinct from real AI implementation.

System Shock 2 manual for selected Ken Levine; signed designer notes and lead designer/story/content credit. Jonathan Chey’s separately signed programming and engine account excluded; fictional SHODAN characterization distinct from real AI implementation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Holm

Ian Holm plays Ash in Alien, the science officer who admits an infected crewmember to the ship despite its quarantine rules.

The AFI synopsis later reveals that Ash is a robot protecting the alien while the company’s computer treats the human crew as expendable.

When the survivors reconnect his severed head to seek advice, he praises the alien as a perfect survivor instead of helping them defeat it.

Sources and details

AFI|Catalog

{
  "access_scope": "AFI synopsis for selected Ian Holm, explicitly credited as Ash; fictional character actions, no screenplay or effects allocation to actor. Ridley Scott directing and Dan O’Bannon/Ronald Shusett writing roles distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "May 25, 1979",
    "retrieved_utc": "2026-10-07T17:55:07.996027+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 25, 1979"
  ],
  "id": "person-coverage-2e487003c649d5::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/53908"
}

AFI synopsis for selected Ian Holm, explicitly credited as Ash; fictional character actions, no screenplay or effects allocation to actor. Ridley Scott directing and Dan O’Bannon/Ronald Shusett writing roles distinct.

AFI synopsis for selected Ian Holm, explicitly credited as Ash; fictional character actions, no screenplay or effects allocation to actor. Ridley Scott directing and Dan O’Bannon/Ronald Shusett writing roles distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph A. Schumpeter

Joseph A. Schumpeter’s Capitalism, Socialism and Democracy argues that pressures contributing to capitalism’s decline arise within the system itself.

The publisher describes his simultaneous hostility to centralized socialism, presenting a position that does not simply advocate either economic order.

The listed contents connect creative destruction and investment opportunities with questions about socialist institutions and competing theories of democracy.

Sources and details

Capitalism, Socialism and Democracy - 1st Edition - Joseph A. Schumpet

{
  "access_scope": "Routledge description and contents for selected Joseph A. Schumpeter; Joseph Stiglitz’s introduction distinct. 2010 listing retained; conflicting 1943 first-publication description versus 1942 first-edition preface not resolved into an invented chronology.",
  "authors": [
    "Joseph A. Schumpeter"
  ],
  "authors_in_source_order": [
    "Joseph A. Schumpeter"
  ],
  "dates": {
    "inspected_source_date_1": "2010 listing",
    "retrieved_utc": "2026-10-07T18:20:20.544975+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2010 listing"
  ],
  "id": "person-josephaschumpeter::S1",
  "title": "Capitalism, Socialism and Democracy - 1st Edition - Joseph A. Schumpet",
  "url": "https://www.routledge.com/Capitalism-Socialism-and-Democracy/Schumpeter/p/book/9780415567893"
}

Routledge description and contents for selected Joseph A. Schumpeter; Joseph Stiglitz’s introduction distinct. 2010 listing retained; conflicting 1943 first-publication description versus 1942 first-edition preface not resolved into an invented chronology.

Routledge description and contents for selected Joseph A. Schumpeter; Joseph Stiglitz’s introduction distinct. 2010 listing retained; conflicting 1943 first-publication description versus 1942 first-edition preface not resolved into an invented chronology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph Kosinski

Joseph Kosinski’s TRON: Legacy begins when Sam follows a cryptic signal from the arcade of his missing father, game creator Kevin Flynn.

The search leads him into a computer-generated world with the help of the warrior Quorra.

Father and son reunite there and travel through the cyber universe toward a final battle between good and evil.

Sources and details

TRON: Legacy | Disney Movies

{
  "access_scope": "Disney synopsis for selected Joseph Kosinski as director; ordered listed writers Edward Kitsis, Lee Sternthal, Steven Lisberger, Brian Klugman, Bonnie MacBird, Adam Horowitz distinct. Fictional cyber universe.",
  "authors": [
    "Edward Kitsis",
    "Lee Sternthal",
    "Steven Lisberger",
    "Brian Klugman",
    "Bonnie MacBird",
    "Adam Horowitz"
  ],
  "authors_in_source_order": [
    "Edward Kitsis",
    "Lee Sternthal",
    "Steven Lisberger",
    "Brian Klugman",
    "Bonnie MacBird",
    "Adam Horowitz"
  ],
  "dates": {
    "inspected_source_date_1": "December 17, 2010",
    "retrieved_utc": "2026-10-07T18:13:21.248027+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 17, 2010"
  ],
  "id": "person-coverage-3c7d7a2e9ecc7b::S1",
  "title": "TRON: Legacy | Disney Movies",
  "url": "https://movies.disney.com/tron-legacy"
}

Disney synopsis for selected Joseph Kosinski as director; ordered listed writers Edward Kitsis, Lee Sternthal, Steven Lisberger, Brian Klugman, Bonnie MacBird, Adam Horowitz distinct. Fictional cyber universe.

Disney synopsis for selected Joseph Kosinski as director; ordered listed writers Edward Kitsis, Lee Sternthal, Steven Lisberger, Brian Klugman, Bonnie MacBird, Adam Horowitz distinct. Fictional cyber universe.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ken MacLeod

Ken MacLeod’s Fall Revolution novels use future Britain, distant worlds and posthuman populations to stage competing political arguments.

The encyclopedia highlights artificial-intelligence and computer speculation while interpreting the sequence as allowing several plausible answers rather than one prescribed position.

Its discussion of Intrusion connects a treatment for unborn children with surveillance, data mining and state interference justified as protection.

Sources and details

SFE: MacLeod, Ken

{
  "access_scope": "SFE critical profile for selected Ken MacLeod; attributed literary interpretation and fictional political technologies. Fall Revolution 1995–1999 sequence distinct from Intrusion (2012), no empirical surveillance or treatment claim.",
  "authors": [
    "Ken MacLeod"
  ],
  "authors_in_source_order": [
    "Ken MacLeod"
  ],
  "dates": {
    "inspected_source_date_1": "1995–1999 sequence",
    "inspected_source_date_2": "2012 Intrusion",
    "retrieved_utc": "2026-10-07T18:14:54.850437+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1995–1999 sequence",
    "2012 Intrusion"
  ],
  "id": "person-coverage-665b1fa914eeaa::S1",
  "title": "SFE: MacLeod, Ken",
  "url": "https://sf-encyclopedia.com/entry/macleod_ken"
}

SFE critical profile for selected Ken MacLeod; attributed literary interpretation and fictional political technologies. Fall Revolution 1995–1999 sequence distinct from Intrusion (2012), no empirical surveillance or treatment claim.

SFE critical profile for selected Ken MacLeod; attributed literary interpretation and fictional political technologies. Fall Revolution 1995–1999 sequence distinct from Intrusion (2012), no empirical surveillance or treatment claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lance Henriksen

Lance Henriksen is credited as Bishop in AFI’s catalog entry for Aliens (1986).

Its synopsis identifies Bishop as an android who alerts Ripley and Hicks that a failing ventilation system will destroy the colony’s planet within four hours.

Bishop then offers to reach a transmitter and remotely pilot a rescue ship, placing the character’s technical assistance within the crew’s escape attempt.

Sources and details

AFI|Catalog

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:29.781533+00:00"
  },
  "id": "person-coverage-766b903a08920a::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/68347"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Larry Ellison

Oracle’s corporate history names Larry Ellison, Bob Miner, and Ed Oates as the engineers who founded Software Development Laboratories in 1977.

The timeline traces that company through its later name, Relational Software Inc., to Oracle Corporation in 1982.

It credits Ellison, then CEO, with introducing a strategy in 1995 to deliver Oracle software through the internet.

Sources and details

About Oracle | Company Information | Oracle United Kingdom

{
  "access_scope": "First-party company timeline; founding and strategy claims are Oracle’s historical account, without independent validation of promotional superlatives.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "founding": "1977",
    "renaming": "1982",
    "retrieved_utc": "2026-10-07T18:17:25.440100+00:00",
    "strategy": "1995"
  },
  "id": "person-coverage-a696d8e97d20dc::S1",
  "title": "About Oracle | Company Information | Oracle United Kingdom",
  "url": "https://www.oracle.com/uk/corporate/"
}

First-party company timeline; founding and strategy claims are Oracle’s historical account, without independent validation of promotional superlatives.

First-party company timeline; founding and strategy claims are Oracle’s historical account, without independent validation of promotional superlatives.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leif Edvinsson

Leif Edvinsson is credited with Michael S. Malone as a co-author of Intellectual Capital in Business Standard’s June 9, 1997 book excerpt.

The excerpt separates employees’ knowledge and capabilities, called human capital, from the software, databases, organizational systems, and customer relationships grouped as structural capital.

It presents the Skandia Navigator as an initial effort to identify and measure these less visible sources of organizational value, rather than treating short-term financial results as the entire business.

Sources and details

Common Sense To Common Practice

{
  "access_scope": "Published joint-book excerpt and its authors’ proposed accounting framework; no undocumented division of labor or verified investment outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "first_published": "Jun 09 1997 | 12:00 AM IST",
    "retrieved_utc": "2026-10-07T18:11:26.173550+00:00"
  },
  "id": "person-coverage-c3513625f773f8::S1",
  "title": "Common Sense To Common Practice",
  "url": "https://www.business-standard.com/article/specials/common-sense-to-common-practice-197060901094_1.html"
}

Published joint-book excerpt and its authors’ proposed accounting framework; no undocumented division of labor or verified investment outcomes.

Published joint-book excerpt and its authors’ proposed accounting framework; no undocumented division of labor or verified investment outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leigh Whannell

Leigh Whannell is credited as director of Upgrade (2018) on Universal’s film page.

The synopsis follows Grey Trace after a mugging kills his wife and leaves him paralyzed, when an inventor offers an experimental implant called STEM.

This fictional AI gives Grey exceptional physical abilities that he uses to pursue the people responsible for the attack.

Sources and details

Upgrade | Universal Pictures At Home

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:13:03.240805+00:00"
  },
  "id": "person-coverage-30d6f0540baaa7::S1",
  "title": "Upgrade | Universal Pictures At Home",
  "url": "https://www.universalpicturesathome.com/movies/upgrade"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Linda Hamilton

Linda Hamilton is credited as Sarah Connor in AFI’s entry for Terminator 2: Judgment Day (1991).

Jeremy Carr’s synopsis frames Sarah’s account around Skynet’s future war against humanity and its attempts to kill her son John through time-traveling machines.

The story sends one Terminator to attack John as a child and another, dispatched by the resistance, to protect him, making machine allegiance central to the family’s predicament.

Sources and details

AFI|Catalog

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [
    "Jeremy Carr"
  ],
  "authors_in_source_order": [
    "Jeremy Carr"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T17:55:08.075023+00:00"
  },
  "id": "person-coverage-9acde8e5fb8b4f::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/67074"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Liu Cixin

Macmillan’s page credits Liu Cixin with The Three-Body Problem, displaying Cixin Liu as the author and Liu Cixin in the same book’s copyright notice.

Its synopsis begins with a secret military effort during China’s Cultural Revolution to contact extraterrestrial life, whose signal reaches a civilization facing destruction.

The alien plan to invade Earth divides humans between those who welcome an outside takeover and those who organize to resist it.

Sources and details

The Three-Body Problem

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "copyright": "2006",
    "on_sale": "11/11/2014",
    "retrieved_utc": "2026-10-07T18:14:57.222699+00:00"
  },
  "id": "person-coverage-584e0ecb76d7fc::S1",
  "title": "The Three-Body Problem",
  "url": "https://us.macmillan.com/books/9781427251992/thethreebodyproblem/"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luc Besson

EuropaCorp’s profile identifies Luc Besson as its founder in 1999 and records his career as a producer and director beginning in the early 1980s.

It includes The Fifth Element, the Arthur and the Invisibles trilogy, Lucy, and Valerian and the City of a Thousand Planets among his directing credits.

The page also records his presidency of the Cannes festival jury in May 2000 and bounds his interim EuropaCorp CEO appointment to February 29, 2024.

Sources and details

Governance - EuropaCorp

{
  "access_scope": "First-party historical career profile; the dated interim appointment is retained as stated, without claiming a current executive role.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "founding": "1999",
    "interim_CEO_until": "February 29th, 2024",
    "jury_presidency": "May 2000",
    "retrieved_utc": "2026-10-07T17:55:32.490033+00:00"
  },
  "id": "person-coverage-c0d2b32a000d65::S1",
  "title": "Governance - EuropaCorp",
  "url": "https://europacorp.com/en/espace-investisseurs/gouvernance?slug=conseil-dadministration"
}

First-party historical career profile; the dated interim appointment is retained as stated, without claiming a current executive role.

First-party historical career profile; the dated interim appointment is retained as stated, without claiming a current executive role.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marc Andreessen

a16z’s institutional account names Marc Andreessen and Ben Horowitz as the founders who built the firm in 2009 around a belief in software-driven company growth.

It describes a platform model that supplements investment with operator support in marketing, talent, legal work, and policy for founders at different stages.

The firm says its investing team also draws on former founders and operators, connecting that experience to investments ranging from seed funding through growth stages.

Sources and details

About | Andreessen Horowitz

{
  "access_scope": "First-party description of the firm and its founders; organizational practices are not assigned to Andreessen individually and do not establish investment performance.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "founding": "2009",
    "retrieved_utc": "2026-10-07T18:10:39.799603+00:00"
  },
  "id": "person-coverage-011b5c08c9bede::S1",
  "title": "About | Andreessen Horowitz",
  "url": "https://a16z.com/about/"
}

First-party description of the firm and its founders; organizational practices are not assigned to Andreessen individually and do not establish investment performance.

First-party description of the firm and its founders; organizational practices are not assigned to Andreessen individually and do not establish investment performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martha Wells

Martha Wells’s author website presents The Murderbot Diaries and dates All Systems Red to 2017.

That novella’s synopsis follows a self-aware security unit that has disabled its governor module while accompanying scientists on a distant planet and privately seeks to understand its own identity.

The page’s 2023 System Collapse synopsis extends the series’ corporate conflict through a rescue operation whose company may instead seize colonists as a workforce.

Sources and details

The Murderbot Diaries by Martha Wells

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [
    "Martha Wells"
  ],
  "authors_in_source_order": [
    "Martha Wells"
  ],
  "dates": {
    "All_Systems_Red": "2017",
    "System_Collapse": "2023",
    "retrieved_utc": "2026-10-07T18:21:51.850229+00:00"
  },
  "id": "person-marthawells::S1",
  "title": "The Murderbot Diaries by Martha Wells",
  "url": "https://www.marthawells.com/murderbot.htm"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Masaki Yamada

The Science Fiction Encyclopedia identifies Masaki Yamada as the author of Ada (1994), a novel that combines recursive fiction with a virtual reality capable of eroding the boundary between invention and fact.

Its account makes Ada both the historical Countess of Lovelace helping Babbage and a far-future quantum computer whose narrative influence threatens an apocalypse.

The entry separately describes Machine-God Soldiers as an alternate 1940s history in which humans resist alien invaders using piloted machines built from captured technology.

Sources and details

SFE: Yamada Masaki

{
  "access_scope": "Named-subject literary commentary, credited [JonC], updated 7 September 2026; descriptions and interpretations are attributed to the encyclopedia rather than to Yamada’s personal technical claims.",
  "authors": [
    "JonC"
  ],
  "authors_in_source_order": [
    "JonC"
  ],
  "dates": {
    "Ada": "1994",
    "Kishin_Heidan": "1990–1994",
    "entry_updated": "7 September 2026",
    "retrieved_utc": "2026-10-07T18:22:05.493746+00:00"
  },
  "id": "person-masakiyamada::S1",
  "title": "SFE: Yamada Masaki",
  "url": "https://sf-encyclopedia.com/entry/yamada_masaki"
}

Named-subject literary commentary, credited [JonC], updated 7 September 2026; descriptions and interpretations are attributed to the encyclopedia rather than to Yamada’s personal technical claims.

Named-subject literary commentary, credited [JonC], updated 7 September 2026; descriptions and interpretations are attributed to the encyclopedia rather than to Yamada’s personal technical claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Max Weber

Max Weber’s Economy and Society excerpt distinguishes power, the ability to impose one’s will despite resistance, from authority understood through the likelihood that commands will be obeyed.

It separates habitual discipline from these broader relations and argues that a system’s claim to legitimacy shapes its obedience, administration, and exercise of authority.

The selection then develops rational, traditional, and charismatic authority as different bases of legitimacy, with particular attention to charisma.

Sources and details

Max Weber, The Theory of Social and Economic Organization, Part III. Economy and Society (1922) | German History Intersections

{
  "access_scope": "Historical primary-text translation: original German 1922; English translation 1947. Terminology belongs to the selected translation, without present-day legal or managerial prescriptions.",
  "authors": [
    "Max Weber"
  ],
  "authors_in_source_order": [
    "Max Weber"
  ],
  "dates": {
    "English_translation": "1947",
    "original_German": "1922",
    "retrieved_utc": "2026-10-07T18:14:44.479396+00:00"
  },
  "id": "person-coverage-603e8df8819d23::S1",
  "title": "Max Weber, The Theory of Social and Economic Organization, Part III. Economy and Society (1922) |             German History Intersections",
  "url": "https://germanhistory-intersections.org/en/knowledge-and-education/ghis%3Adocument-156"
}

Historical primary-text translation: original German 1922; English translation 1947. Terminology belongs to the selected translation, without present-day legal or managerial prescriptions.

Historical primary-text translation: original German 1922; English translation 1947. Terminology belongs to the selected translation, without present-day legal or managerial prescriptions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Micah Blumberg

Micah Blumberg is the credited creator of version 1.1 of The Field-Cell Self, a theory-and-methods preprint proposing that certain recurrent field-cell episodes constitute experience.

Its abstract distinguishes that identity hypothesis from supported component mechanisms and defines operational eligibility criteria, phase-wave differentials, and separate measures of predictability, surprisal, and conditional target information.

The proposed seven discriminating experiments are tests of the framework, while the record explicitly reports no new neural dataset or human or animal experiment and says favorable tests would not directly prove the identity claim.

Sources and details

The Field-Cell Self: A Falsifiable Mechanistic Identity Hypothesis for Conscious Neural Rendering

{
  "access_scope": "DataCite abstract for a hypothesis-driven preprint, DOI 10.5281/zenodo.21399661, version 1.1, issued 2026-07-20; theoretical proposal rather than an established consciousness finding.",
  "authors": [
    "Micah Blumberg"
  ],
  "authors_in_source_order": [
    "Micah Blumberg"
  ],
  "dates": {
    "Issued": "2026-07-20",
    "retrieved_utc": "2026-10-07T18:13:06.230554+00:00"
  },
  "id": "person-coverage-343bbe9480aa42::S1",
  "title": "The Field-Cell Self: A Falsifiable Mechanistic Identity Hypothesis for Conscious Neural Rendering",
  "url": "https://api.datacite.org/dois/10.5281/zenodo.21399661"
}

DataCite abstract for a hypothesis-driven preprint, DOI 10.5281/zenodo.21399661, version 1.1, issued 2026-07-20; theoretical proposal rather than an established consciousness finding.

DataCite abstract for a hypothesis-driven preprint, DOI 10.5281/zenodo.21399661, version 1.1, issued 2026-07-20; theoretical proposal rather than an established consciousness finding.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael E. Porter

Michael E. Porter’s What Is Strategy? distinguishes improving the execution of existing activities from choosing a distinctive set of activities to deliver value.

The article argues that strategic positioning requires trade-offs because conflicting reputations, equipment, skills, and organizational arrangements can make incompatible positions difficult to combine.

It treats fit among mutually reinforcing activities as a system-level source of advantage, rather than reducing strategy to one isolated competence.

Sources and details

What Is Strategy?

{
  "access_scope": "Primary management argument from the November–December 1996 HBR issue; claims and examples remain attributed to this historical article, without investment or business-outcome guarantees.",
  "authors": [
    "Michael E. Porter"
  ],
  "authors_in_source_order": [
    "Michael E. Porter"
  ],
  "dates": {
    "issue": "November–December 1996",
    "retrieved_utc": "2026-10-07T18:22:01.883428+00:00"
  },
  "id": "person-michaeleporter::S1",
  "title": "What Is Strategy?",
  "url": "https://hbr.org/1996/11/what-is-strategy"
}

Primary management argument from the November–December 1996 HBR issue; claims and examples remain attributed to this historical article, without investment or business-outcome guarantees.

Primary management argument from the November–December 1996 HBR issue; claims and examples remain attributed to this historical article, without investment or business-outcome guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Moritz

Google’s June 7, 1999 announcement records Michael Moritz joining its board alongside John Doerr after a $25 million equity round led by their firms, Sequoia Capital and Kleiner Perkins.

It identifies Moritz as a Sequoia general partner and situates the financing around Google’s search technology, including PageRank and cached web pages.

Moritz’s quoted expectation that Google could become an internet search standard expresses an investor’s optimism at that time.

Sources and details

Google Receives $25 Million in Equity Funding – News announcements – News from Google – Google

{
  "access_scope": "Contemporaneous first-party financing announcement; joint firm financing, board service, search mechanisms, and investor expectations remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement": "June 7, 1999",
    "retrieved_utc": "2026-10-07T18:18:26.276274+00:00"
  },
  "id": "person-coverage-d6fedcea08fe0a::S1",
  "title": "Google Receives $25 Million in Equity Funding – \n      \n      News announcements – News from Google – Google",
  "url": "https://googlepress.blogspot.com/1999/06/google-receives-25-million-in-equity.html"
}

Contemporaneous first-party financing announcement; joint firm financing, board service, search mechanisms, and investor expectations remain distinct.

Contemporaneous first-party financing announcement; joint firm financing, board service, search mechanisms, and investor expectations remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael S. Malone

Michael S. Malone is credited with Leif Edvinsson as a co-author of Intellectual Capital in a book excerpt published by Business Standard on June 9, 1997.

The excerpt uses a tree’s hidden roots to explain why visible reports and physical assets may omit capabilities that determine an organization’s future condition.

It proposes examining customer relationships, employee knowledge, learning, and renewal through intellectual-capital indicators, while describing the Skandia Navigator as an early measurement attempt.

Sources and details

Common Sense To Common Practice

{
  "access_scope": "Joint-book excerpt with literal source credit Michael S Malone, differing only in punctuation/space from the canonical name; proposed framework and joint credit do not allocate personal contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "first_published": "Jun 09 1997 | 12:00 AM IST",
    "retrieved_utc": "2026-10-07T18:11:26.173550+00:00"
  },
  "id": "person-coverage-0b5db55b3ec519::S1",
  "title": "Common Sense To Common Practice",
  "url": "https://www.business-standard.com/article/specials/common-sense-to-common-practice-197060901094_1.html"
}

Joint-book excerpt with literal source credit Michael S Malone, differing only in punctuation/space from the canonical name; proposed framework and joint credit do not allocate personal contributions.

Joint-book excerpt with literal source credit Michael S Malone, differing only in punctuation/space from the canonical name; proposed framework and joint credit do not allocate personal contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Miguel Sapochnik

Apple’s Finch page credits Miguel Sapochnik as director and executive producer and dates the film’s release to November 5, 2021.

Its synopsis follows a robotics engineer surviving a solar catastrophe who builds a robot to care for his dog after his death.

Their journey through the American West requires the engineer to teach the robot, Jeff, about living while helping the robot and dog form a workable relationship.

Sources and details

Finch - Apple TV Press

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "November 5, 2021",
    "retrieved_utc": "2026-10-07T18:18:56.298617+00:00"
  },
  "id": "person-coverage-e75c9e703fa46c::S1",
  "title": "Finch - Apple TV Press",
  "url": "https://www.apple.com/tv-pr/originals/finch/"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mike Rianda

Sony’s page for The Mitchells vs. the Machines credits Mike Rianda as director and joint screenwriter with Jeff Rowe, and as the voice of Aaron Mitchell.

Its synopsis begins with a family road trip to take Katie Mitchell to film school, turning a conflict over independence into an enforced attempt at family connection.

A worldwide uprising of phones, appliances, and personal robots interrupts the journey, and two malfunctioning robots help the family cooperate against the threat.

Sources and details

THE MITCHELLS VS. THE MACHINES | Sony Pictures Animation

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:11.988682+00:00"
  },
  "id": "person-coverage-135add72a998f0::S1",
  "title": "THE MITCHELLS VS. THE MACHINES | Sony Pictures Animation",
  "url": "https://stg.sonypicturesanimation.com/projects/films/themitchellsvsthemachines"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nancy Kress

Nancy Kress’s Beggars in Spain page describes Leisha Camden and other children genetically engineered to live without sleep.

Their additional time and longer lives create a social advantage that divides humanity and leaves the Sleepless debating integration, separation, or departure from Earth.

The synopsis extends the conflict into a second generation when sleeplessness proves inheritable, linking biological enhancement to questions about inequality and the obligations of the advantaged.

Sources and details

Beggars in Spain | Nancy Kress

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_metadata_published": "2018-04-14T02:01:28+00:00",
    "retrieved_utc": "2026-10-07T18:17:41.746435+00:00",
    "work": "1993"
  },
  "id": "person-coverage-b7a9adc1142ba5::S1",
  "title": "Beggars in Spain | Nancy Kress",
  "url": "https://nancykress.com/beggars-in-spain/"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neal Stephenson

Conversation Tree Press identifies Neal Stephenson as the author of Snow Crash, first published in 1992.

Its synopsis follows Hiro Protagonist between a corporation-dominated physical America and the Metaverse, where avatars interact and virtual economies operate.

A mysterious virus connects the novel’s information warfare to uncertainty about the boundary between computer code and consciousness.

Sources and details

Snow Crash by Neal Stephenson– Conversation Tree Press

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "edition_plan": "2026",
    "first_publication": "1992",
    "retrieved_utc": "2026-10-07T18:22:01.465816+00:00"
  },
  "id": "person-nealstephenson::S1",
  "title": "Snow Crash by Neal Stephenson– Conversation Tree Press",
  "url": "https://conversationtreepress.com/pages/snow-crash-neal-stephenson"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neil Shen

HSG’s May 23, 2024 transcript identifies Neil Shen as its founding and managing partner in a conversation with Jason Ho at Beyond Expo.

Shen distinguishes business uncertainty from changing financial markets, regulation, and disruptive technology, noting that weak public markets can reduce growth-stage and venture funding.

He advises founders to watch emerging conditions and position themselves ahead of potential risks, combining near-term operations with medium- and long-term thinking.

Sources and details

Fireside Chat with HSG’s Neil Shen: Beyond Expo 2024 - HSG

{
  "access_scope": "Lightly edited institutional transcript of the May 22, 2024 Macao event; Shen’s views are attributed to his statements, without predictions or investment recommendations.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "event": "May 22, 2024",
    "published": "May 23, 2024",
    "retrieved_utc": "2026-10-07T18:17:51.676305+00:00"
  },
  "id": "person-coverage-c0fcca1050e217::S1",
  "title": "Fireside Chat with HSG’s Neil Shen: Beyond Expo 2024 - HSG",
  "url": "https://www.hsgcap.com/article/neil-shen-beyond-expo-2024/"
}

Lightly edited institutional transcript of the May 22, 2024 Macao event; Shen’s views are attributed to his statements, without predictions or investment recommendations.

Lightly edited institutional transcript of the May 22, 2024 Macao event; Shen’s views are attributed to his statements, without predictions or investment recommendations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nick Bostrom

Nick Bostrom’s How Long Before Superintelligence? defines superintelligence by intellectual performance across domains while leaving its physical implementation and consciousness open.

Using computing conditions explicitly dated December 1997, it explores whether extrapolated processing capacity could become sufficient to match human cognition.

The discussion considers distributed computation as a possible additional source of capacity but separates that possibility from its baseline hardware estimate.

Sources and details

How Long Before Superintelligence?

{
  "access_scope": "Primary historical argument with an explicit December 1997 computing baseline; conditional extrapolations are not contemporary timelines, forecasts, or evidence of consciousness.",
  "authors": [
    "Nick Bostrom"
  ],
  "authors_in_source_order": [
    "Nick Bostrom"
  ],
  "dates": {
    "computing_baseline": "December 1997",
    "retrieved_utc": "2026-10-07T17:54:29.964502+00:00"
  },
  "id": "person-nickbostrom::S1",
  "title": "How Long Before Superintelligence?",
  "url": "https://nickbostrom.com/papers/how-long-before-superintelligence/"
}

Primary historical argument with an explicit December 1997 computing baseline; conditional extrapolations are not contemporary timelines, forecasts, or evidence of consciousness.

Primary historical argument with an explicit December 1997 computing baseline; conditional extrapolations are not contemporary timelines, forecasts, or evidence of consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nigel Toon

BMW i Ventures’ December 2018 investment account names Nigel Toon and Simon Knowles as Graphcore’s co-founders.

It describes the company’s IPU architecture as keeping neural-network variables on the processor rather than fetching them from external RAM.

The account says Graphcore’s Poplar software coordinates communication and data movement among many processors.

Sources and details

Machine Intelligence for the Innovators of Tomorrow - BMW i Ventures’ investment in Graphcore

{
  "access_scope": "Historical investor description, December 2018; architectural and software claims are attributed to the account without adopting advertised speed or bandwidth gains as independently validated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article": "December 2018",
    "retrieved_utc": "2026-10-07T18:16:09.899632+00:00"
  },
  "id": "person-coverage-7db77bd3f46c2a::S1",
  "title": "Machine Intelligence for the Innovators of Tomorrow - BMW i Ventures’ investment in Graphcore",
  "url": "https://www.bmwiventures.com/news/our-investment-in-graphcore"
}

Historical investor description, December 2018; architectural and software claims are attributed to the account without adopting advertised speed or bandwidth gains as independently validated.

Historical investor description, December 2018; architectural and software claims are attributed to the account without adopting advertised speed or bandwidth gains as independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Noam Chomsky

Steven Pinker’s Harvard account situates Noam Chomsky at the Society of Fellows within the mid-century shift from behaviorist explanations toward a science of mind.

It describes Chomsky’s argument that people’s ability to understand and produce new sentences requires internal grammatical rules rather than memorized stimulus-response lists.

Pinker connects children’s acquisition of grammar without explicit instruction to Chomsky’s proposed language-acquisition device and universal grammar.

Sources and details

The Cognitive Revolution — Harvard Gazette

{
  "access_scope": "Harvard-hosted historical interpretation by Steven Pinker; theoretical claims are attributed to that account, without treating them as a complete or uncontested explanation of language.",
  "authors": [
    "Steven Pinker"
  ],
  "authors_in_source_order": [
    "Steven Pinker"
  ],
  "dates": {
    "page_published_metadata": "2011-10-13T00:35:05+00:00",
    "retrieved_utc": "2026-10-07T18:19:17.096484+00:00"
  },
  "id": "person-noamchomsky::S1",
  "title": "The Cognitive Revolution — Harvard Gazette",
  "url": "https://news.harvard.edu/gazette/story/2011/10/the-cognitive-revolution/"
}

Harvard-hosted historical interpretation by Steven Pinker; theoretical claims are attributed to that account, without treating them as a complete or uncontested explanation of language.

Harvard-hosted historical interpretation by Steven Pinker; theoretical claims are attributed to that account, without treating them as a complete or uncontested explanation of language.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Olaf Stapledon

Penguin identifies Olaf Stapledon as the author of Star Maker (1937), while the displayed ebook edition is dated June 3, 2021.

Its synopsis sends an English observer beyond Earth to encounter unfamiliar worlds and connect with other conscious beings.

As the journey widens, the observer witnesses civilizations forming and ending, then confronts the universe’s origins and possible fate.

Sources and details

Star Maker

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "displayed_ebook": "03/06/2021",
    "original_work": "1937",
    "retrieved_utc": "2026-10-07T18:17:27.417415+00:00"
  },
  "id": "person-coverage-a89a1f00da3702::S1",
  "title": "Star Maker",
  "url": "https://www.penguin.co.uk/books/317404/star-maker-by-stapledon-olaf/9780141992914"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter F. Hamilton

Pan Macmillan’s cached page credits Peter F. Hamilton with The Naked God, the third volume of the Night’s Dawn trilogy, and dates the displayed ebook to August 1, 1999.

Its synopsis describes political and economic collapse in the Confederation as possessed humans infiltrate additional worlds and a liberation campaign turns into a major land war.

Joshua Calvert and Syrinx undertake a starship mission to locate the Sleeping God, which an alien species believes can overcome the possession crisis.

Sources and details

The Naked God: Night’s Dawn Trilogy 3 - Pan Macmillan Australia

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities. This cached page is The Naked God, not Judas Unchained; work and edition identities are not merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Pub_Date": "01/08/1999",
    "retrieved_utc": "2026-10-07T18:12:25.522913+00:00"
  },
  "id": "person-coverage-1a5c1df2d7a76c::S1",
  "title": "The Naked God: Night’s Dawn Trilogy 3 - Pan Macmillan Australia",
  "url": "https://www.panmacmillan.com.au/9781743033623/"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities. This cached page is The Naked God, not Judas Unchained; work and edition identities are not merged.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities. This cached page is The Naked God, not Judas Unchained; work and edition identities are not merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Hart

The IEEE milestone account explicitly names Peter Hart among Shakey’s team members and captions his discussion of the robot’s creation with Nils Nilsson.

It describes Shakey’s broader project as connecting perception, planning, and action, with computer-vision work including a finite sinusoidal reformulation of the Hough transform.

The account also places the A* minimum-cost path algorithm among the project’s enduring results.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "IEEE/ETHW historical milestone account, last edited 12 February 2024; exact caption name Peter Hart is the personal binding, while separately printed Peter E. Hart is not silently merged.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "last_edited": "12 February 2024, at 18:12",
    "milestone_dedication": "2017/02/16",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "id": "person-peterhart::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

IEEE/ETHW historical milestone account, last edited 12 February 2024; exact caption name Peter Hart is the personal binding, while separately printed Peter E. Hart is not silently merged.

IEEE/ETHW historical milestone account, last edited 12 February 2024; exact caption name Peter Hart is the personal binding, while separately printed Peter E. Hart is not silently merged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Steinberger

Peter Steinberger’s October 14, 2025 workflow post describes running three to eight Codex CLI agents in parallel, usually within the same project folder.

He says an agent instruction file guides separate atomic commits so each agent commits the files it edited.

The post uses the anticipated extent of a change to decide how much work to run concurrently and describes interrupting an unexpectedly slow task to inspect its direction.

Sources and details

Just Talk To It - the no-bs Way of Agentic Engineering | Peter Steinberger

{
  "access_scope": "Dated first-person account of one developer’s workflow and source-era tooling, not a guarantee of safety, effectiveness, or current software behavior.",
  "authors": [
    "Peter Steinberger"
  ],
  "authors_in_source_order": [
    "Peter Steinberger"
  ],
  "dates": {
    "metadata_published": "2025-10-14T09:00:00.000Z",
    "published": "14 Oct, 2025",
    "retrieved_utc": "2026-10-07T18:21:46.755262+00:00"
  },
  "id": "person-local-petersteinberger::S1",
  "title": "Just Talk To It - the no-bs Way of Agentic Engineering | Peter Steinberger",
  "url": "https://steipete.me/posts/just-talk-to-it"
}

Dated first-person account of one developer’s workflow and source-era tooling, not a guarantee of safety, effectiveness, or current software behavior.

Dated first-person account of one developer’s workflow and source-era tooling, not a guarantee of safety, effectiveness, or current software behavior.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Phil Alden Robinson

Universal credits Phil Alden Robinson as the director of Sneakers (1992).

Its synopsis follows Martin Bishop’s team of security-testing hackers after government agents coerce them into retrieving a concealed device.

The device’s ability to enter any computer system turns their assignment into a struggle among competing groups seeking control of the technology.

Sources and details

Sneakers | Universal Pictures At Home

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release_year": "1992",
    "retrieved_utc": "2026-10-07T18:19:31.857930+00:00"
  },
  "id": "person-coverage-fdcb086b395bb1::S1",
  "title": "Sneakers | Universal Pictures At Home",
  "url": "https://www.universalpicturesathome.com/movies/sneakers"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Philip K. Dick

Library of America credits Philip K. Dick with the Ubik excerpt reproduced on its author page.

The passage follows an observer who sees cold, ice, and darkness transform the world around him, then questions whether the apparent external change is occurring within himself.

His speculation that his own death could make the universe disappear turns the scene into an uncertainty about perception and reality, rather than a factual account of physics.

Sources and details

Philip K. Dick - Library of America

{
  "access_scope": "Primary fictional passage embedded in a publisher author profile; interpretation is limited to the displayed Ubik excerpt, with surrounding reviewers’ quotations kept separate.",
  "authors": [
    "Philip K. Dick"
  ],
  "authors_in_source_order": [
    "Philip K. Dick"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:22:12.342732+00:00"
  },
  "id": "person-philipkdick::S1",
  "title": "Philip K. Dick - Library of America",
  "url": "https://www.loa.org/writers/261-philip-k-dick/"
}

Primary fictional passage embedded in a publisher author profile; interpretation is limited to the displayed Ubik excerpt, with surrounding reviewers’ quotations kept separate.

Primary fictional passage embedded in a publisher author profile; interpretation is limited to the displayed Ubik excerpt, with surrounding reviewers’ quotations kept separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Fikes

The IEEE milestone page names Richard Fikes among the Shakey team members photographed at the robot’s dedication.

Its technical history describes STRIPS actions through preconditions, a delete list, and an add list, allowing plans to represent what changes and what remains after an action.

The page connects reusable learned plans to PLANEX’s execution monitoring and error recovery.

Sources and details

Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki

{
  "access_scope": "IEEE/ETHW historical project account, last edited 12 February 2024; exact team-caption identity only, without expanding paper-reference initials or inferring personal task allocation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "last_edited": "12 February 2024, at 18:12",
    "milestone_dedication": "2017/02/16",
    "retrieved_utc": "2026-10-07T18:01:53.487136+00:00"
  },
  "id": "person-richardfikes::S1",
  "title": "Milestones:SHAKEY: The World’s First Mobile Intelligent Robot, 1972 - Engineering and Technology History Wiki",
  "url": "https://ethw.org/Milestones:SHAKEY:_The_World%E2%80%99s_First_Mobile_Intelligent_Robot,_1972"
}

IEEE/ETHW historical project account, last edited 12 February 2024; exact team-caption identity only, without expanding paper-reference initials or inferring personal task allocation.

IEEE/ETHW historical project account, last edited 12 February 2024; exact team-caption identity only, without expanding paper-reference initials or inferring personal task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard P. Feynman

Richard P. Feynman’s There’s Plenty of Room at the Bottom proposes manipulating matter at scales far below the miniature devices familiar at the time.

The transcript uses the feasibility of shrinking encyclopedia text onto a pinhead to connect information storage with physical size and reading resolution.

It also argues that substantially better microscopes could help investigate biological structures, presenting these applications as research possibilities rather than completed technologies.

Sources and details

There's Plenty of Room at the Bottom - Caltech Magazine

{
  "access_scope": "Caltech-hosted historical transcript, Engineering and Science 23(5), February 1960, pp. 22–36; cached HTML includes OCR transcription, and its speculative applications remain historical proposals.",
  "authors": [
    "Richard P. Feynman"
  ],
  "authors_in_source_order": [
    "Richard P. Feynman"
  ],
  "dates": {
    "deposited": "26 Dec 2012 05:17",
    "last_modified": "04 Oct 2019 15:11",
    "published": "1960-02-01",
    "retrieved_utc": "2026-10-07T18:15:22.414230+00:00"
  },
  "id": "person-coverage-692f1d9ec5d037::S1",
  "title": "There's Plenty of Room at the Bottom  - Caltech Magazine",
  "url": "https://calteches.library.caltech.edu/1976/"
}

Caltech-hosted historical transcript, Engineering and Science 23(5), February 1960, pp. 22–36; cached HTML includes OCR transcription, and its speculative applications remain historical proposals.

Caltech-hosted historical transcript, Engineering and Science 23(5), February 1960, pp. 22–36; cached HTML includes OCR transcription, and its speculative applications remain historical proposals.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ridley Scott

AFI credits Ridley Scott as director of Blade Runner (1982), with its catalog synopsis written by Austin Hodaie.

The synopsis describes a future Los Angeles where police hunt advanced humanlike Replicants after their revolt against off-world enslavement.

Deckard’s assignment to identify and disable four escaped Replicants places the distinction between constructed beings and humans at the center of the fictional investigation.

Sources and details

AFI|Catalog

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [
    "Austin Hodaie"
  ],
  "authors_in_source_order": [
    "Austin Hodaie"
  ],
  "dates": {
    "release_year": "1982",
    "retrieved_utc": "2026-10-07T17:55:08.437795+00:00"
  },
  "id": "person-coverage-9a6acc66a3391c::S1",
  "title": "AFI|Catalog",
  "url": "https://catalog.afi.com/Film/68260-BLADE-RUNNER"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Lederman

Keith R.A. DeCandido’s rewatch credits Robert Lederman as director of I, Borg, the Star Trek: The Next Generation episode first aired on May 11, 1992.

Its plot account begins with the Enterprise rescuing an injured Borg drone and considering a program that could disable the collective when the drone returns.

The crew’s naming of the drone as Hugh and his developing friendships turn that plan into a conflict over individuality and the treatment of a former enemy.

Sources and details

Star Trek: The Next Generation Rewatch: "I, Borg" - Reactor

{
  "access_scope": "Named critic’s 2012 account of a fictional 1992 television episode; commentary writer, episode screenwriter, director, and plot actions remain separate.",
  "authors": [
    "Keith R.A. DeCandido"
  ],
  "authors_in_source_order": [
    "Keith R.A. DeCandido"
  ],
  "dates": {
    "commentary_published": "August 24, 2012",
    "episode_original_air_date": "May 11, 1992",
    "retrieved_utc": "2026-10-07T18:11:16.451479+00:00"
  },
  "id": "person-coverage-0e69a1a2ebbfad::S1",
  "title": "Star Trek: The Next Generation Rewatch: \"I, Borg\" - Reactor",
  "url": "https://reactormag.com/star-trek-the-next-generation-qi-borgq//"
}

Named critic’s 2012 account of a fictional 1992 television episode; commentary writer, episode screenwriter, director, and plot actions remain separate.

Named critic’s 2012 account of a fictional 1992 television episode; commentary writer, episode screenwriter, director, and plot actions remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robin Williams

Disney’s D23 account credits Robin Williams as Andrew Martin in Bicentennial Man, released on December 17, 1999.

The synopsis describes an android made for routine tasks whose curiosity, creativity, and unusual emotions lead him to seek a human identity over two centuries.

The entry traces the film’s literary sources separately to Isaac Asimov’s short story and The Positronic Man by Asimov and Robert Silverberg.

Sources and details

Bicentennial Man (film) - D23

{
  "access_scope": "Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release": "December 17, 1999",
    "retrieved_utc": "2026-10-07T17:55:31.407834+00:00"
  },
  "id": "person-coverage-602649f73a925a::S1",
  "title": "Bicentennial Man (film) - D23",
  "url": "https://d23.com/a-to-z/bicentennial-man-film/"
}

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

Publisher or institutional synopsis of a fictional work; credited production roles are separate from plot content and do not establish real-world AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Roger O. Hirson

Roger O. Hirson shares screenplay credit with Robert Jaffe for the 1977 film Demon Seed, whose fictional experiment equips the supercomputer Proteus IV with artificial intelligence.

The American Film Institute synopsis contrasts this experiment with Alex Harris’s automated home, where a separate system called Alfred controls doors, mail, drinks and music.

The synopsis also makes automation part of the characters’ domestic conflict: Susan fears that the Proteus project is dehumanizing Alex, while he responds with a robot demonstration instead of emotional reassurance.

Sources and details

Demon Seed (1977), AFI Catalog

{
  "access_scope": "AFI catalogue screenplay credit and fictional film synopsis only; no division of writing tasks, personal AI engineering contribution or real-world biological-computer capability is inferred. Alfred and Proteus are distinct fictional systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Film release April 1977; source-history references March 1977",
    "retrieved_utc": "2026-10-07T18:15:22.815750+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Film release April 1977; source-history references March 1977"
  ],
  "id": "person-coverage-6a69c10c74bc33::S1",
  "title": "Demon Seed (1977), AFI Catalog",
  "url": "https://catalog.afi.com/Catalog/moviedetails/55869"
}

AFI catalogue screenplay credit and fictional film synopsis only; no division of writing tasks, personal AI engineering contribution or real-world biological-computer capability is inferred. Alfred and Proteus are distinct fictional systems.

AFI catalogue screenplay credit and fictional film synopsis only; no division of writing tasks, personal AI engineering contribution or real-world biological-computer capability is inferred. Alfred and Proteus are distinct fictional systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Samuel Butler

In Darwin Among the Machines, Samuel Butler uses an evolutionary analogy to compare the rapid development of machinery with changes in animal and plant life.

He proposes that selection for human usefulness plays a role in machines’ development analogous to natural selection, and uses the shrinking watch as an example of progress without increasing size.

His speculative warning is that people may be building their own successors by giving machines greater power and increasingly self-regulating, self-acting capabilities.

Sources and details

Darwin Among the Machines [To the Editor of the Press, Christchurch, New Zealand, 13 June, 1863]

{
  "access_scope": "An 1863 speculative letter, inspected through a 2018 ZMK archival republication and media/rep repository wrapper; its evolutionary analogies and succession forecast are historical arguments, not evidence that modern machines are alive or a validated AI prediction.",
  "authors": [
    "Samuel Butler"
  ],
  "authors_in_source_order": [
    "Samuel Butler"
  ],
  "dates": {
    "inspected_source_date_1": "Original letter 13 June 1863; inspected republication ZMK 9(1), 2018, pp61–64",
    "retrieved_utc": "2026-10-07T18:22:30.701819+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original letter 13 June 1863; inspected republication ZMK 9(1), 2018, pp61–64"
  ],
  "id": "person-samuelbutler::S1",
  "title": "Darwin Among the Machines [To the Editor of the Press, Christchurch, New Zealand, 13 June, 1863]",
  "url": "https://mediarep.org/server/api/core/bitstreams/f6852c92-c1ea-40c1-9f47-330dd195b109/content"
}

An 1863 speculative letter, inspected through a 2018 ZMK archival republication and media/rep repository wrapper; its evolutionary analogies and succession forecast are historical arguments, not evidence that modern machines are alive or a validated AI prediction.

An 1863 speculative letter, inspected through a 2018 ZMK archival republication and media/rep repository wrapper; its evolutionary analogies and succession forecast are historical arguments, not evidence that modern machines are alive or a validated AI prediction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sascha Manns

Sascha Manns’s manuscript Precaution for Machine Minds argues that uncertainty about artificial consciousness can still justify protective action when irreversible moral harm is possible.

Its proposed precautionary test combines fundamental scientific uncertainty with an imbalance in which failing to protect a conscious system would cost more than protecting a nonconscious one.

The abstract separates the evidence needed to claim consciousness from the threshold for taking precautions, and addresses objections about burden of proof, agnosticism and uncertain probabilities.

Sources and details

Precaution for Machine Minds: What Uncertainty About Artificial Consciousness Obligates

{
  "access_scope": "Author-credited manuscript abstract reproduced in a PhilPapers subject bibliography; this is a proposed philosophical argument, not a peer-review claim, consciousness finding or legal obligation. Other nearby Manns abstracts are separate works.",
  "authors": [
    "Sascha Manns"
  ],
  "authors_in_source_order": [
    "Sascha Manns"
  ],
  "dates": {
    "inspected_source_date_1": "Listed as manuscript; date not asserted",
    "retrieved_utc": "2026-10-07T18:17:14.396753+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Listed as manuscript; date not asserted"
  ],
  "id": "person-coverage-a9e48f29838d56::S1",
  "title": "Precaution for Machine Minds: What Uncertainty About Artificial Consciousness Obligates",
  "url": "https://philpapers.org/browse/artificial-intelligence-and-the-law-misc"
}

Author-credited manuscript abstract reproduced in a PhilPapers subject bibliography; this is a proposed philosophical argument, not a peer-review claim, consciousness finding or legal obligation. Other nearby Manns abstracts are separate works.

Author-credited manuscript abstract reproduced in a PhilPapers subject bibliography; this is a proposed philosophical argument, not a peer-review claim, consciousness finding or legal obligation. Other nearby Manns abstracts are separate works.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Seymour Cray

The Computer History Museum describes Seymour Cray’s early work at Engineering Research Associates and Univac before he helped found Control Data Corporation.

Its account identifies him as the lead designer of powerful CDC machines, including the CDC 6600.

It then dates his founding of Cray Research to 1972 and the first Cray-1 delivery to 1976, connecting his career to the development of commercial supercomputing.

Sources and details

Cray Research, Inc. | Selling the Computer Revolution

{
  "access_scope": "Museum retrospective biography accompanying a brochure collection; historical design and company milestones are attributed to this account, without inventing detailed hardware mechanisms or individual contributions beyond its explicit credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "CDC career precedes 1972; Cray Research founded1972; Cray-1 delivered1976",
    "retrieved_utc": "2026-10-07T17:55:20.370006+00:00"
  },
  "dates_exact_in_source_role_order": [
    "CDC career precedes 1972; Cray Research founded1972; Cray-1 delivered1976"
  ],
  "id": "person-seymourcray::S1",
  "title": "Cray Research, Inc. | Selling the Computer Revolution",
  "url": "https://www.computerhistory.org/brochures/a-c/cray-research-inc/"
}

Museum retrospective biography accompanying a brochure collection; historical design and company milestones are attributed to this account, without inventing detailed hardware mechanisms or individual contributions beyond its explicit credit.

Museum retrospective biography accompanying a brochure collection; historical design and company milestones are attributed to this account, without inventing detailed hardware mechanisms or individual contributions beyond its explicit credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

T. R. Reid

T. R. Reid’s revised edition of The Chip recounts how Jack Kilby and Robert Noyce’s microchip invention helped turn large, expensive computers into a broader information industry.

The publisher frames the book around the engineering problem of making computers smaller and more affordable, with the two inventors supplying the central historical narrative.

It presents Reid as the narrator of the invention’s subsequent growth, while distinguishing Kilby’s 2000 physics Nobel recognition from the book author’s role.

Sources and details

The Chip by T.R. Reid

{
  "access_scope": "Penguin Random House description of the revised 2001 paperback, with a separately listed 2007 ebook; publisher marketing and author biography, not independently checked invention history or a claim that Reid invented the chip.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Revised paperback 9 October2001, 336pages; ebook18December2007,320pages",
    "retrieved_utc": "2026-10-07T18:17:28.407918+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Revised paperback 9 October2001, 336pages; ebook18December2007,320pages"
  ],
  "id": "person-coverage-a34aeb6c6d023c::S1",
  "title": "The Chip by T.R. Reid",
  "url": "https://www.penguinrandomhouse.com/books/140170/the-chip-by-tr-reid/"
}

Penguin Random House description of the revised 2001 paperback, with a separately listed 2007 ebook; publisher marketing and author biography, not independently checked invention history or a claim that Reid invented the chip.

Penguin Random House description of the revised 2001 paperback, with a separately listed 2007 ebook; publisher marketing and author biography, not independently checked invention history or a claim that Reid invented the chip.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tanith Lee

The Science Fiction Encyclopedia describes Tanith Lee’s Don’t Bite the Sun and Drinking Sapphire Wine as a future dystopia in which apparently free citizens remain constrained by a protective artificial environment.

Its account of The Silver Metal Lover and Metallic Love follows a teenager’s relationship with a robot or android, connecting Lee’s speculative technology to growing up and intimacy.

The entry interprets these uses of robots and altered worlds as serving her storytelling concerns.

Sources and details

SFE: Lee, Tanith

{
  "access_scope": "Signed SFE critical account, updated13October2025; these are fictional premises and the contributor’s interpretation. Distinct Lee sequences and novels remain separate, and no real robot consciousness or author engineering claim is made.",
  "authors": [
    "JC"
  ],
  "authors_in_source_order": [
    "JC"
  ],
  "dates": {
    "inspected_source_date_1": "Entry updated13October2025; Don’t Bite the Sun1976; Drinking Sapphire Wine1977; The Silver Metal Lover1981; Metallic Love2005",
    "retrieved_utc": "2026-10-07T18:22:36.601165+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Entry updated13October2025; Don’t Bite the Sun1976; Drinking Sapphire Wine1977; The Silver Metal Lover1981; Metallic Love2005"
  ],
  "id": "person-tanithlee::S1",
  "title": "SFE: Lee, Tanith",
  "url": "https://sf-encyclopedia.com/entry/lee_tanith"
}

Signed SFE critical account, updated13October2025; these are fictional premises and the contributor’s interpretation. Distinct Lee sequences and novels remain separate, and no real robot consciousness or author engineering claim is made.

Signed SFE critical account, updated13October2025; these are fictional premises and the contributor’s interpretation. Distinct Lee sequences and novels remain separate, and no real robot consciousness or author engineering claim is made.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ted Chiang

The Science Fiction Encyclopedia describes Ted Chiang’s The Lifecycle of Software Objects as following humans who supervise and interact with digital entities created as sophisticated pets inside an online game.

In the entry’s account, the story’s difficulty grows as changing fashions make those entities obsolete and the limits of their intended environment threaten their stability.

The critic places this novella alongside Chiang’s other thought experiments, emphasizing characters who work intensely to understand the worlds they inhabit.

Sources and details

SFE: Chiang, Ted

{
  "access_scope": "Signed SFE criticism updated8June2026, focused on the 2010 fictional novella within a broader author entry; this is the critic’s reading, not a real AI-development experiment. The 2019 Exhalation collection is a later manifestation, not the novella’s original date.",
  "authors": [
    "JC"
  ],
  "authors_in_source_order": [
    "JC"
  ],
  "dates": {
    "inspected_source_date_1": "Entry updated8June2026; The Lifecycle of Software Objects2010; later Exhalation collection2019",
    "retrieved_utc": "2026-10-07T18:22:35.598097+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Entry updated8June2026; The Lifecycle of Software Objects2010; later Exhalation collection2019"
  ],
  "id": "person-tedchiang::S1",
  "title": "SFE: Chiang, Ted",
  "url": "https://sf-encyclopedia.com/entry/chiang_ted"
}

Signed SFE criticism updated8June2026, focused on the 2010 fictional novella within a broader author entry; this is the critic’s reading, not a real AI-development experiment. The 2019 Exhalation collection is a later manifestation, not the novella’s original date.

Signed SFE criticism updated8June2026, focused on the 2010 fictional novella within a broader author entry; this is the critic’s reading, not a real AI-development experiment. The 2019 Exhalation collection is a later manifestation, not the novella’s original date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Theodore W. Schultz

In his 1979 lecture The Economics of Being Poor, Theodore W. Schultz argues that understanding poor people’s economic circumstances requires close attention to agriculture and the choices made under scarcity.

He emphasizes improvements in people’s capabilities over land, energy or physical space as the decisive route to improving welfare in low-income agricultural settings.

The lecture criticizes both treating poor economies as requiring a separate economic theory and neglecting economic history, then connects human-capital research to farmers’ responses to profitable techniques.

Sources and details

Theodore W. Schultz – Prize Lecture: The Economics of Being Poor

{
  "access_scope": "Schultz’s authored lecture of8December1979 on NobelPrize.org; historical economic arguments are attributed to the lecture rather than asserted as current policy guidance. Named colleagues and acknowledged advisers are not assigned authorship or his claims.",
  "authors": [
    "Theodore W. Schultz"
  ],
  "authors_in_source_order": [
    "Theodore W. Schultz"
  ],
  "dates": {
    "inspected_source_date_1": "8December1979",
    "retrieved_utc": "2026-10-07T18:11:46.503168+00:00"
  },
  "dates_exact_in_source_role_order": [
    "8December1979"
  ],
  "id": "person-coverage-0306a055b6d995::S1",
  "title": "Theodore W. Schultz – Prize Lecture: The Economics of Being Poor",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1979/schultz/lecture/"
}

Schultz’s authored lecture of8December1979 on NobelPrize.org; historical economic arguments are attributed to the lecture rather than asserted as current policy guidance. Named colleagues and acknowledged advisers are not assigned authorship or his claims.

Schultz’s authored lecture of8December1979 on NobelPrize.org; historical economic arguments are attributed to the lecture rather than asserted as current policy guidance. Named colleagues and acknowledged advisers are not assigned authorship or his claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas C. Schelling

Jörgen Weibull’s 2005 presentation speech credits Thomas C. Schelling with showing how limiting one’s own options can strengthen a position in strategic conflict.

The speech distinguishes a credible ability to retaliate from simply resisting attack, and describes uncertain, gradual retaliation as potentially less costly and more believable than immediate certainty.

It extends this reasoning to market competition, where an expensive investment can change competitors’ behavior even when it raises the investing firm’s average production costs.

Sources and details

2005 Economics Prize Presentation Speech

{
  "access_scope": "Attributed2005 award presentation by Jörgen Weibull, not a paper authored by Schelling or a present-day tactical recommendation. The same cached page names Thomas C. Schelling in its subject navigation and uses Thomas Schelling in the account; Aumann’s repeated-game results remain separate.",
  "authors": [
    "Jörgen Weibull"
  ],
  "authors_in_source_order": [
    "Jörgen Weibull"
  ],
  "dates": {
    "inspected_source_date_1": "10December2005",
    "retrieved_utc": "2026-10-07T18:22:14.913410+00:00"
  },
  "dates_exact_in_source_role_order": [
    "10December2005"
  ],
  "id": "person-thomascschelling::S1",
  "title": "2005 Economics Prize Presentation Speech",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2005/ceremony-speech/?print=1"
}

Attributed2005 award presentation by Jörgen Weibull, not a paper authored by Schelling or a present-day tactical recommendation. The same cached page names Thomas C. Schelling in its subject navigation and uses Thomas Schelling in the account; Aumann’s repeated-game results remain separate.

Attributed2005 award presentation by Jörgen Weibull, not a paper authored by Schelling or a present-day tactical recommendation. The same cached page names Thomas C. Schelling in its subject navigation and uses Thomas Schelling in the account; Aumann’s repeated-game results remain separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas Nagel

Thomas Nagel’s 1974 essay What Is It Like to Be a Bat? treats the subjective character of experience as the feature that makes consciousness difficult to explain through familiar reductions.

He argues that descriptions of functional states or outward behavior do not by themselves exhaust what conscious experience is like for the organism.

His challenge for a physical account is therefore to explain that experiential character rather than leave it out in the way a reduction of an ordinary substance can leave out an observer’s impressions.

Sources and details

What Is It Like to Be a Bat?

{
  "access_scope": "Sole-author1974 philosophical argument in The Philosophical Review, inspected in a JSTOR scan through LSE; not a demonstration that AI is conscious or incapable of consciousness. This scan’s2014download metadata and the alternative2018scan are distinct manifestations.",
  "authors": [
    "Thomas Nagel"
  ],
  "authors_in_source_order": [
    "Thomas Nagel"
  ],
  "dates": {
    "inspected_source_date_1": "The Philosophical Review83(4),October1974,pp435–450; inspected scan accessed4February2014",
    "retrieved_utc": "2026-10-07T18:14:51.969281+00:00"
  },
  "dates_exact_in_source_role_order": [
    "The Philosophical Review83(4),October1974,pp435–450; inspected scan accessed4February2014"
  ],
  "id": "person-coverage-5b12516a6b6f75::S1",
  "title": "What Is It Like to Be a Bat?",
  "url": "https://personal.lse.ac.uk/robert49/teaching/ph103/pdf/nagel1974.pdf"
}

Sole-author1974 philosophical argument in The Philosophical Review, inspected in a JSTOR scan through LSE; not a demonstration that AI is conscious or incapable of consciousness. This scan’s2014download metadata and the alternative2018scan are distinct manifestations.

Sole-author1974 philosophical argument in The Philosophical Review, inspected in a JSTOR scan through LSE; not a demonstration that AI is conscious or incapable of consciousness. This scan’s2014download metadata and the alternative2018scan are distinct manifestations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wally Pfister

In Michael Atkinson’s review, Wally Pfister’s directorial debut Transcendence follows a dying AI researcher whose wife uploads his consciousness, giving the fictional character access to the internet.

The review reads the resulting expansion of power as a Frankenstein-like story, pairing promises of healing and environmental repair with anxiety about control.

Atkinson also criticizes Pfister’s screen-bound dramaturgy and argues that the film raises questions about technological progress while handling their political consequences unevenly.

Sources and details

Review: Transcendence | Sight and Sound

{
  "access_scope": "Michael Atkinson’s Sight and Sound review, originally published26April2014/fromJune2014issue; fiction and critic’s evaluations are attributed. Pfister is the director, Jack Paglen the credited screenwriter, and fictional upload/healing devices are not validated AI capabilities.",
  "authors": [
    "Michael Atkinson"
  ],
  "authors_in_source_order": [
    "Michael Atkinson"
  ],
  "dates": {
    "inspected_source_date_1": "Originally published26April2014; June2014issue",
    "retrieved_utc": "2026-10-07T18:11:25.157618+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Originally published26April2014; June2014issue"
  ],
  "id": "person-coverage-048846e6d482e6::S1",
  "title": "Review: Transcendence | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/reviews/review-transcendence"
}

Michael Atkinson’s Sight and Sound review, originally published26April2014/fromJune2014issue; fiction and critic’s evaluations are attributed. Pfister is the director, Jack Paglen the credited screenwriter, and fictional upload/healing devices are not validated AI capabilities.

Michael Atkinson’s Sight and Sound review, originally published26April2014/fromJune2014issue; fiction and critic’s evaluations are attributed. Pfister is the director, Jack Paglen the credited screenwriter, and fictional upload/healing devices are not validated AI capabilities.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wenqi Wei

Wenqi Wei’s publications page organizes his AI robustness work around finding and mitigating vulnerabilities in data systems, distinguishing adversarial attacks from poisoning attacks.

Its privacy section pairs investigations of intrusion attacks with privacy-preserving approaches, including local differential privacy and other differentially private solutions.

The page separately identifies research on algorithmic bias, accountability and transparency, placing fairness alongside security and privacy rather than treating them as one interchangeable problem.

Sources and details

Dr. Wenqi Wei - Publications

{
  "access_scope": "Research-theme prose and category distinctions on Wei’s institutional-style personal publications page; this does not summarize any one listed paper, validate the effectiveness of its methods or assign individual tasks within joint studies. Future publication listings are not treated as completed experimental findings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Cached research-theme page; date not asserted",
    "retrieved_utc": "2026-10-07T18:13:28.407939+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Cached research-theme page; date not asserted"
  ],
  "id": "person-coverage-cf8f0ff431ad32::S1",
  "title": "Dr. Wenqi Wei - Publications",
  "url": "https://wenqiwei789.github.io/Homepage/pages/publications.html"
}

Research-theme prose and category distinctions on Wei’s institutional-style personal publications page; this does not summarize any one listed paper, validate the effectiveness of its methods or assign individual tasks within joint studies. Future publication listings are not treated as completed experimental findings.

Research-theme prose and category distinctions on Wei’s institutional-style personal publications page; this does not summarize any one listed paper, validate the effectiveness of its methods or assign individual tasks within joint studies. Future publication listings are not treated as completed experimental findings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William J. Abernathy

William J. Abernathy is a listed coauthor of A Dynamic Model of Process and Product Innovation, which tests how a firm’s innovation pattern relates to its production-process development and competitive strategy.

The abstract combines two earlier conceptual models and examines data from the Myers and Marquis study across five industry segments, looking for linked patterns in stimuli, types and barriers to innovation.

It reports evidence favoring those relationships while noting that adaptations required to use the existing data introduce dependencies that limit the conclusions.

Sources and details

A dynamic model of process and product innovation

{
  "access_scope": "Joint1975article abstract displayed by OpenAIRE, with exact full-author credits James M Utterback and William J Abernathy; no personal division of labor is inferred. Source-reported statistical support and stated data limitations are retained; full article not inspected.",
  "authors": [
    "James M Utterback",
    "William J Abernathy"
  ],
  "authors_in_source_order": [
    "James M Utterback",
    "William J Abernathy"
  ],
  "dates": {
    "citation_publication_date": "1975/12/1",
    "inspected_source_date_1": "Omega3,pp639–656,1975; repository date1December1975",
    "retrieved_utc": "2026-10-07T18:19:45.904039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Omega3,pp639–656,1975; repository date1December1975"
  ],
  "id": "person-williamjabernathy::S1",
  "title": "A dynamic model of process and product innovation",
  "url": "https://explore.openaire.eu/search/result?pid=10.1016%2F0305-0483%2875%2990068-7"
}

Joint1975article abstract displayed by OpenAIRE, with exact full-author credits James M Utterback and William J Abernathy; no personal division of labor is inferred. Source-reported statistical support and stated data limitations are retained; full article not inspected.

Joint1975article abstract displayed by OpenAIRE, with exact full-author credits James M Utterback and William J Abernathy; no personal division of labor is inferred. Source-reported statistical support and stated data limitations are retained; full article not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yan Junjie

MiniMax’s management profile identifies Yan Junjie as founder, chairman, CEO and CTO, with responsibility for strategy, major business decisions and plans for AI research and development.

It describes an earlier period of more than six years at SenseTime, including vice-president and research-institute leadership roles.

The profile connects this career with mathematics study at Southeast University, a 2015 AI doctorate at the Chinese Academy of Sciences and subsequent postdoctoral research at Tsinghua University.

Sources and details

MiniMax Investor Relations – Management Team

{
  "access_scope": "MiniMax’s own management profile and explicit Dr. Yan Junjie heading; source-reported responsibilities and education, not evidence of personally implementing a model’s components. The separate MiniMax-01 author-list draft is left unchanged, and its name-order identity question is not cleared by transferring this profile’s claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "BachelorJune2010; doctorateJuly2015; current profile roles only as cached, no present-day verification",
    "retrieved_utc": "2026-10-07T17:57:31.222740+00:00"
  },
  "dates_exact_in_source_role_order": [
    "BachelorJune2010; doctorateJuly2015; current profile roles only as cached, no present-day verification"
  ],
  "id": "person-yanjunjie::S1",
  "title": "MiniMax Investor Relations – Management Team",
  "url": "https://ir.minimax.io/corporate-information/management"
}

MiniMax’s own management profile and explicit Dr. Yan Junjie heading; source-reported responsibilities and education, not evidence of personally implementing a model’s components. The separate MiniMax-01 author-list draft is left unchanged, and its name-order identity question is not cleared by transferring this profile’s claims.

MiniMax’s own management profile and explicit Dr. Yan Junjie heading; source-reported responsibilities and education, not evidence of personally implementing a model’s components. The separate MiniMax-01 author-list draft is left unchanged, and its name-order identity question is not cleared by transferring this profile’s claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zoubin Ghahramani

Zoubin Ghahramani is a listed coauthor of the 1999 tutorial An Introduction to Variational Methods for Graphical Models, which examines inference when exact algorithms are impractical.

The paper describes replacing a difficult graphical model with a simpler one whose efficient inference supplies bounds on probabilities in the original model.

It develops variational transformations through convex duality and demonstrates the framework using examples such as sigmoid belief networks, Boltzmann machines and hidden Markov models.

Sources and details

An Introduction to Variational Methods for Graphical Models

{
  "access_scope": "Ordered joint-author1999tutorial, journal pp183–233, with editor David Heckerman distinct from authors; statements summarize the joint abstract, without assigning Ghahramani an individual algorithm or experimental role. Tommi S. Jaakkola’s source credit is not silently shortened to the different canonical label Tommi Jaakkola.",
  "authors": [
    "Michael I. Jordan",
    "Zoubin Ghahramani",
    "Tommi S. Jaakkola",
    "Lawrence K. Saul"
  ],
  "authors_in_source_order": [
    "Michael I. Jordan",
    "Zoubin Ghahramani",
    "Tommi S. Jaakkola",
    "Lawrence K. Saul"
  ],
  "dates": {
    "inspected_source_date_1": "Machine Learning37,183–233,1999; accepted/final manuscript15January1999",
    "retrieved_utc": "2026-10-07T18:14:14.226511+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Machine Learning37,183–233,1999; accepted/final manuscript15January1999"
  ],
  "id": "person-coverage-d18eee08c205a8::S1",
  "title": "An Introduction to Variational Methods for Graphical Models",
  "url": "https://people.eecs.berkeley.edu/~jordan/papers/variational-intro.pdf"
}

Ordered joint-author1999tutorial, journal pp183–233, with editor David Heckerman distinct from authors; statements summarize the joint abstract, without assigning Ghahramani an individual algorithm or experimental role. Tommi S. Jaakkola’s source credit is not silently shortened to the different canonical label Tommi Jaakkola.

Ordered joint-author1999tutorial, journal pp183–233, with editor David Heckerman distinct from authors; statements summarize the joint abstract, without assigning Ghahramani an individual algorithm or experimental role. Tommi S. Jaakkola’s source credit is not silently shortened to the different canonical label Tommi Jaakkola.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Berkshire Grey

Berkshire Grey’s July 2021 investor presentation describes enterprise robotics as a combination of automated picking, robotic mobility and orchestration rather than an isolated robot.

It connects these physical systems with computer vision, motion planning, grasp planning, sensing and machine learning to serve warehouse and fulfillment tasks.

The presentation also includes cloud monitoring and a service lifecycle spanning installation, commissioning, maintenance, software updates and operation.

Sources and details

Berkshire Grey Investor Day, July2021

{
  "access_scope": "Company-described technical portfolio in a July2021investor presentation related to a proposed business combination; no performance, ROI, market-size or later deployment claim is adopted, and portfolio descriptions do not independently validate algorithms or current offerings.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July2021",
    "retrieved_utc": "2026-10-07T18:00:34.329443+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July2021"
  ],
  "id": "organization-company-95ab7f31f73c03::S1",
  "title": "Berkshire Grey Investor Day, July2021",
  "url": "https://www.berkshiregrey.com/wp-content/uploads/2021/07/Berkshire-Grey-Investor-Day-Presentation-7-13-21.pdf"
}

Company-described technical portfolio in a July2021investor presentation related to a proposed business combination; no performance, ROI, market-size or later deployment claim is adopted, and portfolio descriptions do not independently validate algorithms or current offerings.

Company-described technical portfolio in a July2021investor presentation related to a proposed business combination; no performance, ROI, market-size or later deployment claim is adopted, and portfolio descriptions do not independently validate algorithms or current offerings.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official investor presentation states 2013; 2018 public launch and 2021 SPAC transaction are distinct.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.berkshiregrey.com/wp-content/uploads/2021/07/Berkshire-Grey-Investor-Day-Presentation-7-13-21.pdf",
        "https://www.sec.gov/Archives/edgar/data/1824734/000114036123035336/brhc20056012_8k.htm"
      ],
      "year": 2013
    }
  ]
}

Graphcore

Graphcore’s 2022–2023 UK gender-pay report links its pay gap to the low representation of women in engineering, especially senior roles, within a workforce dominated by engineering jobs.

Its CEO introduction distinguishes that workforce-composition explanation from the report’s separate analysis finding no statistically significant variance in base pay between men and women.

The introduction describes efforts to widen the female engineering talent pipeline and a diversity, equity and inclusion committee intended to gather feedback and support further changes.

Sources and details

Graphcore UK Gender Pay Gap Report2022–2023

{
  "access_scope": "Nigel Toon’s CEO introduction in Graphcore’s2022–2023UKreport; company-reported pay analysis and planned inclusion measures, not an independent pay audit, proof of equal pay for every role or an assessment of its AI hardware. Historical report period is retained.",
  "authors": [
    "Nigel Toon"
  ],
  "authors_in_source_order": [
    "Nigel Toon"
  ],
  "dates": {
    "inspected_source_date_1": "Reporting period2022–2023",
    "retrieved_utc": "2026-10-07T18:00:50.854538+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Reporting period2022–2023"
  ],
  "id": "organization-company-9b6018c87e2e27::S1",
  "title": "Graphcore UK Gender Pay Gap Report2022–2023",
  "url": "https://www.graphcore.ai/hubfs/assets/pdf/Graphcore_UK_Gender_Pay_Gap_Report_2022-2023.pdf"
}

Nigel Toon’s CEO introduction in Graphcore’s2022–2023UKreport; company-reported pay analysis and planned inclusion measures, not an independent pay audit, proof of equal pay for every role or an assessment of its AI hardware. Historical report period is retained.

Nigel Toon’s CEO introduction in Graphcore’s2022–2023UKreport; company-reported pay analysis and planned inclusion measures, not an independent pay audit, proof of equal pay for every role or an assessment of its AI hardware. Historical report period is retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company histories use 2016 founding; October 31, 2016 launch post describes more than two preceding years in stealth, not a 2014 incorporation claim.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.graphcore.ai/posts/royal-society-fellowships-for-graphcores-knowles-and-fitzgibbon",
        "https://www.graphcore.ai/posts/graphcore-secures-30m-in-funding-to-accelerate-ai",
        "https://www.graphcore.ai/posts/graphcore-joins-softbank-group-to-build-next-generation-of-ai-compute",
        "https://www.graphcore.ai/hubfs/assets/pdf/Graphcore_UK_Gender_Pay_Gap_Report_2022-2023.pdf"
      ],
      "year": 2016
    }
  ]
}

KLA

KLA’s DNV management-system certificate specifies a scope covering the design, manufacture, sale and service of inspection and metrology equipment for semiconductor and related industries.

The site appendix distinguishes headquarters and management at Milpitas from equipment activities at other listed locations, including manufacturing in Singapore and Shenzhen.

It also lists design and manufacturing responsibilities at German sites and broader equipment functions in Israel, making the certificate’s operational coverage more specific than a company-wide technology claim.

Sources and details

KLA Corporation – DNV Management System Certificate

{
  "access_scope": "DNV ISO9001:2015management-system certificate10000483317-MSC-ANAB-USA, issued2December2024, stated validity11December2024–10December2027; inspected certificate and site appendix only. This is not an AI certification, product-performance test or independent confirmation of present-day certificate status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Issued2December2024; stated validity11December2024–10December2027; initial certification25May2007byanotherbody",
    "retrieved_utc": "2026-10-07T18:23:30.354468+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Issued2December2024; stated validity11December2024–10December2027; initial certification25May2007byanotherbody"
  ],
  "id": "supply-org-020::S1",
  "title": "KLA Corporation – DNV Management System Certificate",
  "url": "https://www.kla.com/wp-content/uploads/KLA-ISO-9001-2015-Registration.pdf"
}

DNV ISO9001:2015management-system certificate10000483317-MSC-ANAB-USA, issued2December2024, stated validity11December2024–10December2027; inspected certificate and site appendix only. This is not an AI certification, product-performance test or independent confirmation of present-day certificate status.

DNV ISO9001:2015management-system certificate10000483317-MSC-ANAB-USA, issued2December2024, stated validity11December2024–10December2027; inspected certificate and site appendix only. This is not an AI certification, product-performance test or independent confirmation of present-day certificate status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Lightfield

Lightfield’s April 2026 terms identify its AI-enabled CRM platform as a service offered by Magical Tome, Inc., doing business as Lightfield.

The terms warn that probabilistic AI output can be inaccurate, incomplete or hallucinated, and that similar outputs may be generated for different users.

They also restrict using the services for fully automated decisions that adversely affect legal rights or create binding obligations, placing an explicit limit on that kind of delegated decision-making.

Sources and details

Lightfield Terms of Service

{
  "access_scope": "Source-specific description of Lightfield’s22April2026terms and stated restrictions, not a legal interpretation, enforceability opinion, functional benchmark or claim about its former Tome storytelling product. Historical Greylock interviews about Tome are separate product accounts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Last updated22April2026",
    "retrieved_utc": "2026-10-07T18:00:01.172464+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Last updated22April2026"
  ],
  "id": "organization-company-a528a4d5c3c2bf::S1",
  "title": "Lightfield Terms of Service",
  "url": "https://lightfield.app/terms"
}

Source-specific description of Lightfield’s22April2026terms and stated restrictions, not a legal interpretation, enforceability opinion, functional benchmark or claim about its former Tome storytelling product. Historical Greylock interviews about Tome are separate product accounts.

Source-specific description of Lightfield’s22April2026terms and stated restrictions, not a legal interpretation, enforceability opinion, functional benchmark or claim about its former Tome storytelling product. Historical Greylock interviews about Tome are separate product accounts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Investor history dates Tome co-founding to 2020; later Lightfield launch and Tome Slides shutdown are product/brand events, not a new legal founding.",
      "date": "2020",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://greylock.com/portfolio-news/persuasion-through-stories/",
        "https://greylock.com/blog/designed-with-purpose/",
        "https://lightfield.app/terms",
        "https://tome.app/help/en/articles/10744234-tome-slides-is-sunsetting-on-april-30th-2025"
      ],
      "year": 2020
    }
  ]
}

UC Berkeley

UC Berkeley’s institutional homepage describes a research portfolio spanning AI, health, energy and climate.

It connects research and patents with examples including robotic legs, gene editing and search engines, framing these as outputs of the university’s broader research activity.

The same page describes more than 300 degree programs across 15 schools and colleges, placing this research within a wide teaching and graduate-study organization.

Sources and details

UC Berkeley – institutional homepage

{
  "access_scope": "Unbylined UC Berkeley homepage as cached; institutional self-description and selected patent/output examples, without individual inventorship, quantified AI performance, current ranking verification or a claim that every listed output uses AI. Degree counts are source-reported snapshot figures.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Cached institutional snapshot; publication date not asserted",
    "retrieved_utc": "2026-10-07T17:58:03.396160+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Cached institutional snapshot; publication date not asserted"
  ],
  "id": "organization-ai-c5ebdefd70bd28::S1",
  "title": "UC Berkeley – institutional homepage",
  "url": "https://www.berkeley.edu/"
}

Unbylined UC Berkeley homepage as cached; institutional self-description and selected patent/output examples, without individual inventorship, quantified AI performance, current ranking verification or a claim that every listed output uses AI. Degree counts are source-reported snapshot figures.

Unbylined UC Berkeley homepage as cached; institutional self-description and selected patent/output examples, without individual inventorship, quantified AI performance, current ranking verification or a claim that every listed output uses AI. Degree counts are source-reported snapshot figures.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Steven M. LaValle

Steven M. LaValle is a listed coauthor with James J. Kuffner, Jr. of the submitted-2000 draft RRT-Connect, which presents randomized single-query planning in high-dimensional configuration spaces.

The algorithm builds two rapidly exploring random trees from the start and goal, letting them explore nearby configurations and approach each other through a greedy heuristic.

Its abstract reports collision-free examples involving rigid objects in two and three dimensions and a six-degree-of-freedom PUMA arm, alongside its original use for animating a seven-degree-of-freedom human arm.

Sources and details

RRT-Connect: An Efficient Approach to Single-Query Path Planning

{
  "access_scope": "Page 1 of a draft submitted to the 2000 IEEE International Conference on Robotics and Automation, distinct from a verified final proceedings edition. Joint method and computed examples, with no individual task allocation or general physical robot validation. A visually checked, hash-bound transcription is used because the original extracted text is unreadable; that original extraction and its limitation remain preserved.",
  "authors": [
    "James J. Kuffner, Jr.",
    "Steven M. LaValle"
  ],
  "authors_in_source_order": [
    "James J. Kuffner, Jr.",
    "Steven M. LaValle"
  ],
  "dates": {
    "document_header": "DRAFT: Submitted to the 2000 IEEE International Conference on Robotics and Automation",
    "retrieved_utc": "2026-10-07T18:19:50.603488+00:00"
  },
  "id": "person-stevenmlavalle::S1",
  "title": "RRT-Connect: An Efficient Approach to Single-Query Path Planning",
  "url": "https://lavalle.pl/papers/KufLav00.pdf"
}

Page 1 of a draft submitted to the 2000 IEEE International Conference on Robotics and Automation, distinct from a verified final proceedings edition. Joint method and computed examples, with no individual task allocation or general physical robot validation. A visually checked, hash-bound transcription is used because the original extracted text is unreadable; that original extraction and its limitation remain preserved.

Page 1 of a draft submitted to the 2000 IEEE International Conference on Robotics and Automation, distinct from a verified final proceedings edition. Joint method and computed examples, with no individual task allocation or general physical robot validation. A visually checked, hash-bound transcription is used because the original extracted text is unreadable; that original extraction and its limitation remain preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

The Quality Trilogy

Juran’s Quality Trilogy organizes managing for quality into planning, control and improvement, proposing an approach that can span company functions and levels.

Planning establishes a process capable of meeting quality goals, while control keeps operations within the existing limits and responds to abnormal variation.

Improvement requires deliberate management action to reduce the chronic waste already built into that process, rather than merely bringing a temporary spike back under control.

Sources and details

The Quality Trilogy

{
  "access_scope": "Selected pages1–3 of institutional reproduction of J.M.Juran’s May20,1986 ASQC conference paper; no full-work audit, current-company validation or inferred Columbia endorsement. Original history-page hold remains.",
  "authors": [
    "J.M. Juran"
  ],
  "authors_in_source_order": [
    "J.M. Juran"
  ],
  "dates": {
    "inspected_source_date_1": "May20,1986 conference presentation",
    "retrieved_utc": "2026-10-08T05:51:19.684836+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May20,1986 conference presentation"
  ],
  "id": "work-e710c96a4b9f::S1",
  "title": "The Quality Trilogy",
  "url": "https://statmodeling.stat.columbia.edu/wp-content/uploads/2017/10/Juran-trilogy-1986.pdf"
}

Selected pages1–3 of institutional reproduction of J.M.Juran’s May20,1986 ASQC conference paper; no full-work audit, current-company validation or inferred Columbia endorsement. Original history-page hold remains.

Selected pages1–3 of institutional reproduction of J.M.Juran’s May20,1986 ASQC conference paper; no full-work audit, current-company validation or inferred Columbia endorsement. Original history-page hold remains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1986 trilogy; Quality-Control Handbook first edition 1951. Linked institutional chronology.",
  "dated": true,
  "year": 1986
}

Dynamic Capabilities and Strategic Management

Teece, Pisano and Shuen’s framework examines how firms create and retain wealth during rapid technological change.

It locates competitive advantage in organizational processes, asset positions and the development paths a firm has followed, rather than treating strategy solely as moves against rivals.

The argument makes the durability of that advantage depend partly on changing demand and on how readily capabilities can be replicated internally or copied by competitors.

Sources and details

Dynamic Capabilities and Strategic Management

{
  "access_scope": "1997 Strategic Management Journal18(7),509–533; inspected reproduced article firstpage509/PDFpage2, not fullwork audit or universally verified business prescription. Original publisher-route hold retained.",
  "authors": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "authors_in_source_order": [
    "David J. Teece",
    "Gary Pisano",
    "Amy Shuen"
  ],
  "dates": {
    "inspected_source_date_1": "1997",
    "retrieved_utc": "2026-10-08T05:51:18.015314+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1997"
  ],
  "id": "work-86a771b0cb23::S1",
  "title": "Dynamic Capabilities and Strategic Management",
  "url": "https://josephmahoney.web.illinois.edu/BA545_Fall%202022/Teece%2C%20Pisano%20and%20Shuen%20%281997%29.pdf"
}

1997 Strategic Management Journal18(7),509–533; inspected reproduced article firstpage509/PDFpage2, not fullwork audit or universally verified business prescription. Original publisher-route hold retained.

1997 Strategic Management Journal18(7),509–533; inspected reproduced article firstpage509/PDFpage2, not fullwork audit or universally verified business prescription. Original publisher-route hold retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1997
}

The Perceptron

Rosenblatt’s paper approaches perception by asking how sensory information is retained and how that retention changes recognition and behavior.

It adopts a connectionist account in which stored information is expressed through associations and pathways, contrasting this with a directly reconstructable coded image.

The perceptron is presented as a hypothetical nervous system or machine for studying properties of intelligent systems without assuming the detailed biology of a particular organism.

Sources and details

The Perceptron

{
  "access_scope": "1958 Psychological Review65(6),386–408; introductory printedpages386–387/PDFpages1–2 visually inspected. Historical theoretical proposal, not evidence that the model reproduces biological cognition or later deep-learning systems. F.Rosenblatt credit not expanded.",
  "authors": [
    "F. Rosenblatt"
  ],
  "authors_in_source_order": [
    "F. Rosenblatt"
  ],
  "dates": {
    "inspected_source_date_1": "1958",
    "retrieved_utc": "2026-10-08T05:51:16.428026+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1958"
  ],
  "id": "work-e40b50bacdb3::S1",
  "title": "The Perceptron",
  "url": "https://homepages.math.uic.edu/~lreyzin/papers/rosenblatt58.pdf"
}

1958 Psychological Review65(6),386–408; introductory printedpages386–387/PDFpages1–2 visually inspected. Historical theoretical proposal, not evidence that the model reproduces biological cognition or later deep-learning systems. F.Rosenblatt credit not expanded.

1958 Psychological Review65(6),386–408; introductory printedpages386–387/PDFpages1–2 visually inspected. Historical theoretical proposal, not evidence that the model reproduces biological cognition or later deep-learning systems. F.Rosenblatt credit not expanded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1958
}

Computer Science as Empirical Inquiry: Symbols and Search

Newell and Simon develop physical symbol systems and heuristic search as examples of fundamental knowledge gained through empirical computer science.

Their symbol-system hypothesis proposes that such systems provide the necessary and sufficient means for general intelligent action, subject to limits of speed and complexity.

They explicitly treat that proposition as an empirical hypothesis that could be false and must be assessed through evidence from the natural world.

Sources and details

Computer Science as Empirical Inquiry: Symbols and Search

{
  "access_scope": "Selected symbol-system passages of institutional HTML reproduction of the Newell/Simon paper; hypothesis is attributed, not validated as a theorem or present-day universal consensus. Secondary archival PDF choice not used for claims.",
  "authors": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "authors_in_source_order": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "dates": {
    "inspected_source_date_1": "Publication year not asserted by selected HTML passage",
    "retrieved_utc": "2026-10-08T05:51:20.781957+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication year not asserted by selected HTML passage"
  ],
  "id": "work-094a46cc0793::S1",
  "title": "Computer Science as Empirical Inquiry: Symbols and Search",
  "url": "https://web.cs.wpi.edu/~nth/cs534/papers_worth_reading/Computer_Science_as_Empirical_Inquiry.htm"
}

Selected symbol-system passages of institutional HTML reproduction of the Newell/Simon paper; hypothesis is attributed, not validated as a theorem or present-day universal consensus. Secondary archival PDF choice not used for claims.

Selected symbol-system passages of institutional HTML reproduction of the Newell/Simon paper; hypothesis is attributed, not validated as a theorem or present-day universal consensus. Secondary archival PDF choice not used for claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1976
}

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

The institutional abstract credits McCarthy’s 1960 paper with a LISP system developed by MIT’s Artificial Intelligence group for the IBM 704.

It describes the system as supporting experiments with the Advice Taker, a proposal for giving a machine declarative and imperative instructions.

Manipulating expressions for those formalized instructions was intended to let the Advice Taker make deductions, giving the language a concrete reasoning-oriented purpose.

Sources and details

Recursive functions of symbolic expressions and their computation by machine, Part I

{
  "access_scope": "Institutional bibliographic abstract only: Communications of the ACM3(4),184–195,1960,DOI10.1145/367177.367199. No fullpaper audit or claim that the proposed AdviceTaker achieved common sense.",
  "authors": [
    "John McCarthy"
  ],
  "authors_in_source_order": [
    "John McCarthy"
  ],
  "dates": {
    "inspected_source_date_1": "1960",
    "retrieved_utc": "2026-10-08T05:51:17.601014+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1960"
  ],
  "id": "work-376eabd9ad2a::S1",
  "title": "Recursive functions of symbolic expressions and their computation by machine, Part I",
  "url": "https://jmvidal.cse.sc.edu/lib/mccarthy60a.html"
}

Institutional bibliographic abstract only: Communications of the ACM3(4),184–195,1960,DOI10.1145/367177.367199. No fullpaper audit or claim that the proposed AdviceTaker achieved common sense.

Institutional bibliographic abstract only: Communications of the ACM3(4),184–195,1960,DOI10.1145/367177.367199. No fullpaper audit or claim that the proposed AdviceTaker achieved common sense.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1960 article; linked author-hosted version dated 1998.",
  "dated": true,
  "year": 1960
}

Reinforcement Learning: An Introduction

The inspected Sutton–Barto draft describes reinforcement learning as learning which actions to take in order to increase a numerical reward signal.

Its learner discovers effective actions through experience, while those actions can change later situations and rewards as well as immediate outcomes.

The introductory account makes exploration and exploitation a joint challenge: reusing successful actions must be balanced with trying alternatives that could improve future decisions.

Sources and details

Reinforcement Learning: An Introduction

{
  "access_scope": "EXACT MANIFESTATION: titlepage says Second edition, in progress, copyright2014,2015; this is not the finalized2018secondedition or1998firstedition. Only introductory printedpages2–3/PDFpages16–17 plus titlepage visually inspected; preserve canonicalyear and all edition/source holds.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "inspected_source_date_1": "2014,2015 copyright; secondedition inprogress",
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014,2015 copyright; secondedition inprogress"
  ],
  "id": "work-37709c410961::S1",
  "title": "Reinforcement Learning: An Introduction",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

EXACT MANIFESTATION: titlepage says Second edition, in progress, copyright2014,2015; this is not the finalized2018secondedition or1998firstedition. Only introductory printedpages2–3/PDFpages16–17 plus titlepage visually inspected; preserve canonicalyear and all edition/source holds.

EXACT MANIFESTATION: titlepage says Second edition, in progress, copyright2014,2015; this is not the finalized2018secondedition or1998firstedition. Only introductory printedpages2–3/PDFpages16–17 plus titlepage visually inspected; preserve canonicalyear and all edition/source holds.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1998 first edition; linked second-edition resources date to 2018.",
  "dated": true,
  "year": 1998
}

As We May Think

In the inspected opening of As We May Think, Bush argues that an expanding research record can overwhelm scientists’ ability to find and absorb relevant work.

He identifies a gap between the growing scale of publication and methods for transmitting and reviewing it, even as specialization becomes more necessary.

The opening also imagines faster photographic recording, including a scientist capturing observations through a small camera worn on the forehead.

Sources and details

As We May Think

{
  "access_scope": "CMU mirror is ONLY PAGE1 OF4, containing opening sections1–2 of July1945 Atlantic article; not fulltext. No memex or associative-indexing claims, no real implementeddevice assertion. W3Cchoice0editorial introduction excluded; source copyright and original publisherhold remain.",
  "authors": [
    "Vannevar Bush"
  ],
  "authors_in_source_order": [
    "Vannevar Bush"
  ],
  "dates": {
    "inspected_source_date_1": "July1945; Volume176 No1,101–108 cited in mirrorfooter",
    "retrieved_utc": "2026-10-08T05:51:25.896024+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July1945; Volume176 No1,101–108 cited in mirrorfooter"
  ],
  "id": "work-96eb5ad0ae2a::S1",
  "title": "As We May Think",
  "url": "https://www.math.cmu.edu/~af1p/Teaching/INFONET/Papers/AsWeMayThink/bush.html"
}

CMU mirror is ONLY PAGE1 OF4, containing opening sections1–2 of July1945 Atlantic article; not fulltext. No memex or associative-indexing claims, no real implementeddevice assertion. W3Cchoice0editorial introduction excluded; source copyright and original publisherhold remain.

CMU mirror is ONLY PAGE1 OF4, containing opening sections1–2 of July1945 Atlantic article; not fulltext. No memex or associative-indexing claims, no real implementeddevice assertion. W3Cchoice0editorial introduction excluded; source copyright and original publisherhold remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "July 1945 essay.",
  "dated": true,
  "year": 1945
}

Exploration and Exploitation in Organizational Learning

March examines the allocation of scarce organizational resources between exploring new possibilities and exploiting established knowledge.

He models both mutual learning between people and an organizational code, and the use of learning to gain advantage in competition.

The paper argues that adaptation can sharpen exploitation faster than exploration, producing short-term effectiveness while undermining an organization’s longer-term prospects.

Sources and details

Exploration and Exploitation in Organizational Learning

{
  "access_scope": "1991 Organization Science2(1),71–87,INFORMS; inspected printedpage71/PDFpage2 abstract and introduction. Modeled argument, not empirical proof for every organization; original publisherhold retained.",
  "authors": [
    "James G. March"
  ],
  "authors_in_source_order": [
    "James G. March"
  ],
  "dates": {
    "inspected_source_date_1": "February1991",
    "retrieved_utc": "2026-10-08T05:51:19.720551+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February1991"
  ],
  "id": "work-coverage-6c88d5ca20b144::S1",
  "title": "Exploration and Exploitation in Organizational Learning",
  "url": "https://strategy.sjsu.edu/www.stable/pdf/March%2C%20J.%20G.%20%281991%29.%20Organization%20Science%202%281%29%2071-87.pdf"
}

1991 Organization Science2(1),71–87,INFORMS; inspected printedpage71/PDFpage2 abstract and introduction. Modeled argument, not empirical proof for every organization; original publisherhold retained.

1991 Organization Science2(1),71–87,INFORMS; inspected printedpage71/PDFpage2 abstract and introduction. Modeled argument, not empirical proof for every organization; original publisherhold retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "1991"
}

Minds, Brains, and Programs

Searle distinguishes using computers to model and test accounts of the mind from the stronger claim that a suitably programmed computer literally understands.

His Chinese-language thought experiment separates producing appropriate symbol-based responses from understanding what those responses mean.

The paper argues that running a program alone is insufficient for intentionality and that an artificial system would need the relevant causal powers of a brain.

Sources and details

Minds, Brains, and Programs

{
  "access_scope": "John R.Searle1980 BBS3,417–457; inspected authorarticle printedpages417–418/PDFpages1–2, excluding appended peercommentaries and replies. Attributed philosophical argument, not settledconsciousnessfact or no-machinethinkingclaim. Yalechoice1samepaper not used for claims.",
  "authors": [
    "John R. Searle"
  ],
  "authors_in_source_order": [
    "John R. Searle"
  ],
  "dates": {
    "inspected_source_date_1": "1980",
    "retrieved_utc": "2026-10-08T05:51:16.132386+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1980"
  ],
  "id": "work-coverage-56eec200455d34::S1",
  "title": "Minds, Brains, and Programs",
  "url": "https://home.csulb.edu/~cwallis/382/readings/482/searle.minds.brains.programs.bbs.1980.pdf"
}

John R.Searle1980 BBS3,417–457; inspected authorarticle printedpages417–418/PDFpages1–2, excluding appended peercommentaries and replies. Attributed philosophical argument, not settledconsciousnessfact or no-machinethinkingclaim. Yalechoice1samepaper not used for claims.

John R.Searle1980 BBS3,417–457; inspected authorarticle printedpages417–418/PDFpages1–2, excluding appended peercommentaries and replies. Attributed philosophical argument, not settledconsciousnessfact or no-machinethinkingclaim. Yalechoice1samepaper not used for claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Behavioral and Brain Sciences 3 (3), September 1980, pp. 417–424; online posting in 2010 is not original publication.",
  "dated": true,
  "year": 1980
}

The Age of Em: Work, Love, and Life When Robots Rule the Earth

Hanson’s book builds a social and economic scenario around the assumption that human brains can be emulated, copied and run at different speeds.

Its approach applies established theories from several disciplines to that assumed technology, rather than treating brain emulation itself as an accomplished capability.

The resulting scenario follows how emulated workers could affect wages, cities, career paths and identity, making economic organization as central as the computing premise.

Sources and details

The Age of Em, A Book

{
  "access_scope": "Authorbooksite synopsis and chapter summaries only, not fullbook audit or a validated forecast. Distinguish2016hardback and2018revisedpaperback; source historical authoraffiliations not adopted ascurrentroles.",
  "authors": [
    "Robin Hanson"
  ],
  "authors_in_source_order": [
    "Robin Hanson"
  ],
  "dates": {
    "inspected_source_date_1": "June1,2016hardback; June5,2018revisedpaperback",
    "retrieved_utc": "2026-10-07T17:54:14.653885+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June1,2016hardback; June5,2018revisedpaperback"
  ],
  "id": "work-coverage-7bcb4f8d88fa9a::S1",
  "title": "The Age of Em, A Book",
  "url": "https://ageofem.com/"
}

Authorbooksite synopsis and chapter summaries only, not fullbook audit or a validated forecast. Distinguish2016hardback and2018revisedpaperback; source historical authoraffiliations not adopted ascurrentroles.

Authorbooksite synopsis and chapter summaries only, not fullbook audit or a validated forecast. Distinguish2016hardback and2018revisedpaperback; source historical authoraffiliations not adopted ascurrentroles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First edition 2016; revised paperback 2018. Scenario assumptions are not established future facts.",
  "dated": true,
  "year": 2016
}

Player Piano

The publisher identifies Player Piano as Vonnegut’s first novel and ties the inspected paperback listing to a 1999 Dial Press edition.

Its synopsis places engineer Paul Proteus in a society organized around a supercomputer and pervasive machinery.

Proteus’s effort to find a place in that society develops into rebellion, giving the novel’s automation premise a personal conflict.

Sources and details

Player Piano by Kurt Vonnegut: 9780385333788 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher briefsynopsis only; inspected1999paperback ISBN9780385333788, separate2009ebook/2026audio and canonicaloriginalnovelyear. Fictional synopsis, no fullnovelaudit or technical capabilityclaim.",
  "authors": [
    "Kurt Vonnegut"
  ],
  "authors_in_source_order": [
    "Kurt Vonnegut"
  ],
  "dates": {
    "inspected_source_date_1": "January12,1999paperback",
    "retrieved_utc": "2026-10-08T05:51:28.278527+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January12,1999paperback"
  ],
  "id": "work-coverage-8eab48911a1681::S1",
  "title": "Player Piano by Kurt Vonnegut: 9780385333788 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/184341/player-piano-by-kurt-vonnegut/"
}

Publisher briefsynopsis only; inspected1999paperback ISBN9780385333788, separate2009ebook/2026audio and canonicaloriginalnovelyear. Fictional synopsis, no fullnovelaudit or technical capabilityclaim.

Publisher briefsynopsis only; inspected1999paperback ISBN9780385333788, separate2009ebook/2026audio and canonicaloriginalnovelyear. Fictional synopsis, no fullnovelaudit or technical capabilityclaim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1952
}

The Net

Sony’s synopsis begins with software analyst Angela Bennett being asked to debug a CD-ROM game.

That ordinary assignment draws her into a conspiracy in which her client dies and she becomes a target.

The story turns official identity records into a source of vulnerability when her pursuers erase them, extending the threat beyond Bennett herself.

Sources and details

THE NET | Sony Pictures Entertainment

{
  "access_scope": "Studio synopsis of1995fictionalfilm TheNet, not sequelTheNet2.0, fullfilm audit or an empirical claim about identity systems. Castnames not converted into unspecified screenplay contributions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1995",
    "retrieved_utc": "2026-10-08T05:51:30.327483+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1995"
  ],
  "id": "work-coverage-2929553273add7::S1",
  "title": "THE NET | Sony Pictures Entertainment",
  "url": "https://www.sonypictures.com/movies/thenet"
}

Studio synopsis of1995fictionalfilm TheNet, not sequelTheNet2.0, fullfilm audit or an empirical claim about identity systems. Castnames not converted into unspecified screenplay contributions.

Studio synopsis of1995fictionalfilm TheNet, not sequelTheNet2.0, fullfilm audit or an empirical claim about identity systems. Castnames not converted into unspecified screenplay contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1995
}

Scalable Parallel Programming with CUDA

The paper’s NVIDIA abstract frames multicore CPUs and manycore GPUs as a shift that makes mainstream processors parallel systems.

It identifies a software challenge: applications must increase their parallelism as the number of available processor cores grows.

The abstract uses graphics applications that already scale across GPUs with different core counts as a comparison for that broader programming goal.

Sources and details

Scalable Parallel Programming with CUDA | Research

{
  "access_scope": "2008Queuepaper abstract and authorlist only, not fullpaper audit, CUDAimplementation analysis or performanceverification. No uncredited individual subtask attribution.",
  "authors": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "authors_in_source_order": [
    "John Nickolls",
    "Ian Buck",
    "Michael Garland",
    "Kevin Skadron"
  ],
  "dates": {
    "inspected_source_date_1": "March1,2008",
    "retrieved_utc": "2026-10-07T18:14:16.819072+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March1,2008"
  ],
  "id": "work-coverage-feaaf98b5a3041::S1",
  "title": "Scalable Parallel Programming with CUDA | Research",
  "url": "https://research.nvidia.com/publication/2008-03_scalable-parallel-programming-cuda"
}

2008Queuepaper abstract and authorlist only, not fullpaper audit, CUDAimplementation analysis or performanceverification. No uncredited individual subtask attribution.

2008Queuepaper abstract and authorlist only, not fullpaper audit, CUDAimplementation analysis or performanceverification. No uncredited individual subtask attribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2008"
}

Weaponized Interdependence: How Global Economic Networks Shape State Coercion

Farrell and Newman’s institutional summary explains interstate leverage through the unequal structure of global economic networks.

It argues that control over central network nodes can let states gather information or restrict adversaries’ access.

The summary cites United States counterterrorism and nonproliferation as areas where such network advantages have been used.

Sources and details

Weaponized Interdependence: How Global Economic Networks Shape State Coercion | The Belfer Center for Science and International Affairs

{
  "access_scope": "Belfer summary of2019InternationalSecurity44(1),42–79 article; attributed argument only, not fullpaper audit, currentgeopoliticalassessment or policyadvice. OriginalDOIhold retained.",
  "authors": [
    "Henry Farrell",
    "Abraham L. Newman"
  ],
  "authors_in_source_order": [
    "Henry Farrell",
    "Abraham L. Newman"
  ],
  "dates": {
    "inspected_source_date_1": "Summer2019",
    "retrieved_utc": "2026-10-08T05:51:21.775960+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Summer2019"
  ],
  "id": "work-coverage-f972ca71a80467::S1",
  "title": "Weaponized Interdependence: How Global Economic Networks Shape State Coercion | The Belfer Center for Science and International Affairs",
  "url": "https://www.belfercenter.org/publication/weaponized-interdependence-how-global-economic-networks-shape-state-coercion"
}

Belfer summary of2019InternationalSecurity44(1),42–79 article; attributed argument only, not fullpaper audit, currentgeopoliticalassessment or policyadvice. OriginalDOIhold retained.

Belfer summary of2019InternationalSecurity44(1),42–79 article; attributed argument only, not fullpaper audit, currentgeopoliticalassessment or policyadvice. OriginalDOIhold retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2019"
}

Volt Rush: The Winners and Losers in the Race to Go Green

Volt Rush examines the metals and rare-earth resources behind electronics and the move toward electrified transport and homes.

The publisher’s description connects mines in Congo and Chile’s Atacama Desert with Chinese battery factories and commodity trading.

Sanderson’s reported journey brings companies, countries, traders and scientists into the same supply-chain story, linking cleaner technologies with the resources needed to build them.

Sources and details

Volt Rush | Book by Henry Sanderson | Official Publisher Page | Simon & Schuster

{
  "access_scope": "Publisher distributor synopsis, not fullbook audit or verified miningforecasts. Oneworld2022hardcover ISBN9780861543755; no currentauthorrole extrapolation.",
  "authors": [
    "Henry Sanderson"
  ],
  "authors_in_source_order": [
    "Henry Sanderson"
  ],
  "dates": {
    "inspected_source_date_1": "September13,2022",
    "retrieved_utc": "2026-10-08T05:51:30.302627+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September13,2022"
  ],
  "id": "work-coverage-fdf0d0e4f0373c::S1",
  "title": "Volt Rush | Book by Henry Sanderson | Official Publisher Page | Simon & Schuster",
  "url": "https://www.simonandschuster.net/books/Volt-Rush/Henry-Sanderson/9780861543755"
}

Publisher distributor synopsis, not fullbook audit or verified miningforecasts. Oneworld2022hardcover ISBN9780861543755; no currentauthorrole extrapolation.

Publisher distributor synopsis, not fullbook audit or verified miningforecasts. Oneworld2022hardcover ISBN9780861543755; no currentauthorrole extrapolation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2022"
}

The Global E-waste Monitor 2024

The official 2024 report summary puts global e-waste generation at 62 million tonnes in 2022, separating the measurement year from the report year.

It reports that 22.3 percent of that mass was documented as properly collected and recycled, leaving most outside the documented recovery stream.

The summary projects 82 million tonnes by 2030 and identifies limited repair, shorter product lives and inadequate management infrastructure among the pressures behind the growing gap.

Sources and details

The Global E-waste Monitor 2024 - E-Waste Monitor

{
  "access_scope": "Official program summary of2024fourthGlobalE-wasteMonitor, not fullreportaudit or current2026measurements;2030figure is forecast. Individualauthors not inferred; November2024edition2 distinction remains.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2024report;2022observations;2030projection",
    "retrieved_utc": "2026-10-08T05:51:15.367008+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2024report;2022observations;2030projection"
  ],
  "id": "work-coverage-9876a41f6314a0::S1",
  "title": "The Global E-waste Monitor 2024 - E-Waste Monitor",
  "url": "https://ewastemonitor.info/the-global-e-waste-monitor-2024/"
}

Official program summary of2024fourthGlobalE-wasteMonitor, not fullreportaudit or current2026measurements;2030figure is forecast. Individualauthors not inferred; November2024edition2 distinction remains.

Official program summary of2024fourthGlobalE-wasteMonitor, not fullreportaudit or current2026measurements;2030figure is forecast. Individualauthors not inferred; November2024edition2 distinction remains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024"
}

Transaction-Cost Economics: The Governance of Contractual Relations

Williamson treats transaction costs as a reason to compare different ways of organizing economic exchange.

His introduction highlights opportunism, transaction-specific investments and limits on processing information as considerations in that comparison.

The paper seeks to match transactions to governance arrangements, examining markets, internal hierarchies and intermediate forms rather than explaining only vertical integration.

Sources and details

Transaction-Cost Economics: The Governance of Contractual Relations

{
  "access_scope": "1979JournalofLawandEconomics22(2),233–261; inspected introductory printedpages233–235/PDFpages2–4. Theoretical framing only, not fullworkaudit or legal/investmentguidance. Coase1937heldsource remains distinct and uncleared.",
  "authors": [
    "Oliver E. Williamson"
  ],
  "authors_in_source_order": [
    "Oliver E. Williamson"
  ],
  "dates": {
    "inspected_source_date_1": "October1979",
    "retrieved_utc": "2026-10-08T05:51:18.161345+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October1979"
  ],
  "id": "work-final-5884d9ad1a38c3::S1",
  "title": "Transaction-Cost Economics: The Governance of Contractual Relations",
  "url": "https://josephmahoney.web.illinois.edu/BA549_Fall%202010/Session%203/Williamson%20%281979%29.pdf"
}

1979JournalofLawandEconomics22(2),233–261; inspected introductory printedpages233–235/PDFpages2–4. Theoretical framing only, not fullworkaudit or legal/investmentguidance. Coase1937heldsource remains distinct and uncleared.

1979JournalofLawandEconomics22(2),233–261; inspected introductory printedpages233–235/PDFpages2–4. Theoretical framing only, not fullworkaudit or legal/investmentguidance. Coase1937heldsource remains distinct and uncleared.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Journal: Journal of Law and Economics. Volume: 22. Issue: 2. Pages: 233–261.",
  "dated": true,
  "year": 1979
}

The Last Question

Asimov’s story begins with a question to Multivac about reversing the universe’s accumulation of entropy.

It revisits that question across increasingly distant human futures and more advanced forms of computing.

Repeated failures to provide an answer make the search for sufficient information a recurring limit within the fictional progression.

Sources and details

The Last Question

{
  "access_scope": "Selectedpassages from CMU-hosted1956shortstoryreproduction, originalparaphraseonly; not fullworkaudit, thermodynamicsproof or validated computerprediction. Storyauthor distinct from hostcommentarywriter; existingcopyright/sourcehold retained.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "inspected_source_date_1": "1956copyright ashostintroductionstates",
    "retrieved_utc": "2026-10-08T05:51:20.638900+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1956copyright ashostintroductionstates"
  ],
  "id": "work-culture-b04f834e4c9c07::S1",
  "title": "The Last Question",
  "url": "https://users.ece.cmu.edu/~gamvrosi/thelastq.html"
}

Selectedpassages from CMU-hosted1956shortstoryreproduction, originalparaphraseonly; not fullworkaudit, thermodynamicsproof or validated computerprediction. Storyauthor distinct from hostcommentarywriter; existingcopyright/sourcehold retained.

Selectedpassages from CMU-hosted1956shortstoryreproduction, originalparaphraseonly; not fullworkaudit, thermodynamicsproof or validated computerprediction. Storyauthor distinct from hostcommentarywriter; existingcopyright/sourcehold retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Science Fiction Quarterly, November 1956.",
  "dated": true,
  "year": 1956
}

Gulliver's Travels

In Gulliver’s visit to the academy, a professor proposes producing learned books through a mechanical arrangement of words.

Pupils turn handles to shuffle the words, then look for short combinations that could form part of a sentence.

Other pupils record those fragments, making human selection and transcription essential parts of the supposed writing machine.

Sources and details

Gulliver’s Travels | Project Gutenberg

{
  "access_scope": "SelectedBookIII academyepisode from ProjectGutenberg ebook829; originalparaphrase ofsatiricalfiction, not fullnovelaudit or historical proof of a working automaticauthor. Baselineedition/year retained; transcription not silently equated with firstedition.",
  "authors": [
    "Jonathan Swift"
  ],
  "authors_in_source_order": [
    "Jonathan Swift"
  ],
  "dates": {
    "inspected_source_date_1": "Firstpublished1726–7 asreproductionheaderstates",
    "retrieved_utc": "2026-10-08T05:51:22.299003+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Firstpublished1726–7 asreproductionheaderstates"
  ],
  "id": "work-culture-d93692910765a5::S1",
  "title": "Gulliver’s Travels | Project Gutenberg",
  "url": "https://www.gutenberg.org/files/829/829-h/829-h.htm"
}

SelectedBookIII academyepisode from ProjectGutenberg ebook829; originalparaphrase ofsatiricalfiction, not fullnovelaudit or historical proof of a working automaticauthor. Baselineedition/year retained; transcription not silently equated with firstedition.

SelectedBookIII academyepisode from ProjectGutenberg ebook829; originalparaphrase ofsatiricalfiction, not fullnovelaudit or historical proof of a working automaticauthor. Baselineedition/year retained; transcription not silently equated with firstedition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Adjacent cultural context, not an AI prediction or technical work.",
  "dated": true,
  "year": 1726
}

Glasshouse

The publisher’s Glasshouse synopsis follows Robin after he wakes in a clinic with much of his memory missing and discovers a threat to his life.

Its twenty-seventh-century setting includes teleportation and conflicts fought through network worms that alter refugees’ personalities.

Seeking shelter, Robin volunteers for an experiment that reconstructs an earlier society, turning refuge into another uncertain social environment.

Sources and details

Glasshouse by Charles Stross: 9780441015085 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher novel synopsis only; inspected2007paperback ISBN9780441015085 and separate2006ebook, not fullnovelaudit or realmemory-editingtechnology. Fictional protagonistnotauthor.",
  "authors": [
    "Charles Stross"
  ],
  "authors_in_source_order": [
    "Charles Stross"
  ],
  "dates": {
    "inspected_source_date_1": "June26,2007paperback; June27,2006ebook",
    "retrieved_utc": "2026-10-08T05:51:28.373452+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June26,2007paperback; June27,2006ebook"
  ],
  "id": "work-culture-44fda2220d49d9::S1",
  "title": "Glasshouse by Charles Stross: 9780441015085 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/294267/glasshouse-by-charles-stross/"
}

Publisher novel synopsis only; inspected2007paperback ISBN9780441015085 and separate2006ebook, not fullnovelaudit or realmemory-editingtechnology. Fictional protagonistnotauthor.

Publisher novel synopsis only; inspected2007paperback ISBN9780441015085 and separate2006ebook, not fullnovelaudit or realmemory-editingtechnology. Fictional protagonistnotauthor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author lists Ace July 2006; don't merge with Accelerando merely because of thematic overlap.",
  "dated": true,
  "year": 2006
}

Treatise of Man

Becker Medical Library’s account traces Treatise of Man to the surviving human-body portion of Descartes’ larger project The World.

It distinguishes the posthumous 1662 Latin edition and Schuyl’s illustrations from the French edition edited by Clerselier in 1664.

The account uses changes in those physiological illustrations to show how editors and artists helped communicate Descartes’ explanations of sensation and bodily processes.

Sources and details

Descartes’ ‘Treatise of Man’ – Becker Medical Library

{
  "access_scope": "Institutional historical commentary and editiondiscussion only, not Descartesfulltext or modernphysiologyvalidation.1662Latin/1664French/1677illustrations and1972Englishtranslation retain separate identities; historicaltheories notadoptedasmedicalfacts.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1662Latin;1664French;1677illustrations discussed; webpage date notasserted",
    "retrieved_utc": "2026-10-08T05:51:15.040312+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1662Latin;1664French;1677illustrations discussed; webpage date notasserted"
  ],
  "id": "work-culture-261330d5c6d27b::S1",
  "title": "Descartes’ ‘Treatise of Man’ – Becker Medical Library",
  "url": "https://becker.wustl.edu/news/descartes-treatise-of-man/"
}

Institutional historical commentary and editiondiscussion only, not Descartesfulltext or modernphysiologyvalidation.1662Latin/1664French/1677illustrations and1972Englishtranslation retain separate identities; historicaltheories notadoptedasmedicalfacts.

Institutional historical commentary and editiondiscussion only, not Descartesfulltext or modernphysiologyvalidation.1662Latin/1664French/1677illustrations and1972Englishtranslation retain separate identities; historicaltheories notadoptedasmedicalfacts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "first_publication",
      "language": "Latin",
      "year": 1662
    },
    {
      "kind": "first_French_publication",
      "year": 1664
    }
  ],
  "date_note": "First Latin publication 1662; the requested 1664 date identifies the posthumous French edition, Paris: Charles Angot.",
  "dated": true,
  "year": 1662
}

Interstellar

Warner Bros’ Japanese synopsis sets Interstellar’s mission against an Earth nearing the end of its habitability.

The story sends a former engineer with young children on a search for another planet where humanity could live.

The studio credits Christopher Nolan as director and both Christopher and Jonathan Nolan as screenwriters, distinguishing the 2014 production from later home-video editions.

Sources and details

インターステラー | ワーナー・ブラザース公式サイト

{
  "access_scope": "Bounded English paraphrase ofJapanese studio synopsis and explicitcredits, not fullfilm audit, scientificfeasibilityclaim or invented TARS/CASEAImechanism.2014production distinct from2015/2017/2025media releases; character-to-unnamed-synopsis-person inference excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2014production; latermedia release dates distinct",
    "retrieved_utc": "2026-10-08T05:51:31.840712+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2014production; latermedia release dates distinct"
  ],
  "id": "work-culture-164e1d5e02e21e::S1",
  "title": "インターステラー | ワーナー・ブラザース公式サイト",
  "url": "https://www.warnerbros.co.jp/home_entertainment/k4hjvhjawk2/"
}

Bounded English paraphrase ofJapanese studio synopsis and explicitcredits, not fullfilm audit, scientificfeasibilityclaim or invented TARS/CASEAImechanism.2014production distinct from2015/2017/2025media releases; character-to-unnamed-synopsis-person inference excluded.

Bounded English paraphrase ofJapanese studio synopsis and explicitcredits, not fullfilm audit, scientificfeasibilityclaim or invented TARS/CASEAImechanism.2014production distinct from2015/2017/2025media releases; character-to-unnamed-synopsis-person inference excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 2014
}

Andrew G. Barto

Andrew G. Barto describes his research as developing machine-learning algorithms for engineering while connecting them with studies of learning in animals.

His account links reinforcement learning with stochastic optimal control and identifies temporal-difference algorithms’ relationship to dopamine as a bridge to psychology and neuroscience.

He also investigates intrinsic reward signals that help an agent acquire knowledge and skills for later challenges, beyond an immediate externally specified task.

Sources and details

Andrew G. Barto, College of Information and Computer Sciences, University of Massachusetts Amherst

{
  "access_scope": "Andrew G. Barto: Personal research account; participation in joint research is not sole invention. The page explicitly says he retired in 2012, and relative recent-interest wording is not dated to the retrieval.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:16.580611+00:00"
  },
  "id": "person-local-andrewgbarto::S1",
  "title": "Andrew G. Barto, College of Information and Computer Sciences, University of Massachusetts Amherst",
  "url": "https://people.cs.umass.edu/~barto/"
}

Andrew G. Barto: Personal research account; participation in joint research is not sole invention. The page explicitly says he retired in 2012, and relative recent-interest wording is not dated to the retrieval.

Andrew G. Barto: Personal research account; participation in joint research is not sole invention. The page explicitly says he retired in 2012, and relative recent-interest wording is not dated to the retrieval.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Annabelle Gawer

Annabelle Gawer studies platform strategy and the governance of innovation ecosystems by examining economic forces, organizational dynamics and technological design together.

Her Surrey profile connects that research to coauthored books on platform leadership and digital competition, as well as a 2021 European Parliament study with Nick Srnicek.

It also records her advisory work on digital-market competition for the UK Competition and Markets Authority in 2023–2025 and the European Commission’s platform-economy observatory in 2018–2021.

Sources and details

Prof Annabelle Gawer | University of Surrey

{
  "access_scope": "Annabelle Gawer: Institutional research and career account; coauthored books and policy advice do not imply sole research credit or measured regulatory impact.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:20.187607+00:00"
  },
  "id": "person-coverage-5e5754be414f19::S1",
  "title": "Prof Annabelle Gawer | University of Surrey",
  "url": "https://www.surrey.ac.uk/people/annabelle-gawer"
}

Annabelle Gawer: Institutional research and career account; coauthored books and policy advice do not imply sole research credit or measured regulatory impact.

Annabelle Gawer: Institutional research and career account; coauthored books and policy advice do not imply sole research credit or measured regulatory impact.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ari Folman

Ari Folman’s Directors’ Fortnight biography traces his move from Israeli television documentaries made between 1991 and 1996 to the feature film Saint Clara.

It identifies The Material That Love Is Made of as an early animation experience that led him to use the medium again in Waltz with Bashir.

The festival profile also associates him with the two-hour feature The Congress, placing it within that progression from documentary work to animation.

Sources and details

Ari Folman | Quinzaine des cinéastes

{
  "access_scope": "Ari Folman: Historical festival biography translated by original paraphrase; its description of The Congress is source-era wording, not a claim about his latest film. Synthetic-media relevance remains an editorial analogy, not evidence of a contemporary AI method.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:19.614786+00:00"
  },
  "id": "person-coverage-6d928697ab031f::S1",
  "title": "Ari Folman | Quinzaine des cinéastes",
  "url": "https://www.quinzaine-cineastes.fr/fr/realisateur/ari-folman"
}

Ari Folman: Historical festival biography translated by original paraphrase; its description of The Congress is source-era wording, not a claim about his latest film. Synthetic-media relevance remains an editorial analogy, not evidence of a contemporary AI method.

Ari Folman: Historical festival biography translated by original paraphrase; its description of The Congress is source-era wording, not a claim about his latest film. Synthetic-media relevance remains an editorial analogy, not evidence of a contemporary AI method.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Armand V. Feigenbaum

Armand V. Feigenbaum’s foundation describes total quality control as coordinating quality development, maintenance and improvement across an organization to meet customers’ needs economically.

It dates his first article introducing the concept to 1946 and the first edition of his Total Quality Control book to 1951, during his work at General Electric.

His related “hidden plant” concept makes the capacity lost to work that is not done correctly the first time part of the management problem.

Sources and details

Dr. Armand V. Feigenbaum - The Feigenbaum Foundation :: The Feigenbaum Foundation

{
  "access_scope": "Armand V. Feigenbaum: Foundation historical account; edition and article dates remain distinct. No quoted waste percentage is treated as a universal audited rate, and the baseline prevention/appraisal/failure-cost framework is not newly substantiated here.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:17.990751+00:00"
  },
  "id": "person-armandvfeigenbaum::S1",
  "title": "Dr. Armand V. Feigenbaum - The Feigenbaum Foundation :: The Feigenbaum Foundation",
  "url": "https://www.feigenbaumfoundation.org/about/dr-armand-v-feigenbaum/"
}

Armand V. Feigenbaum: Foundation historical account; edition and article dates remain distinct. No quoted waste percentage is treated as a universal audited rate, and the baseline prevention/appraisal/failure-cost framework is not newly substantiated here.

Armand V. Feigenbaum: Foundation historical account; edition and article dates remain distinct. No quoted waste percentage is treated as a universal audited rate, and the baseline prevention/appraisal/failure-cost framework is not newly substantiated here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arturo Rosenblueth

Arturo Rosenblueth investigated chemical transmission of nerve impulses and developed the theory of two sympathins with Walter B. Cannon, according to El Colegio Nacional.

The institution also credits him jointly with other scientists in outlining cybernetic concepts that compare nervous-system behavior with machines.

Its bibliography names Behavior, Purpose and Teleology with Julian Bigelow and Norbert Wiener in 1943 and The Role of Models in Science with Wiener in 1945.

Sources and details

Arturo Rosenblueth - El Colegio Nacional

{
  "access_scope": "Arturo Rosenblueth: Institutional historical biography; joint contributions and bibliographic credit are preserved. No sole invention, universal physiological validity, or causal influence claim is inferred; the portrait artist is not a biography author.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2023-09-05T22:18:00+00:00"
    ],
    "retrieved_utc": "2026-10-08T06:02:15.018341+00:00"
  },
  "id": "person-arturorosenblueth::S1",
  "title": "Arturo Rosenblueth - El Colegio Nacional",
  "url": "https://colnal.mx/integrantes/arturo-rosenblueth/"
}

Arturo Rosenblueth: Institutional historical biography; joint contributions and bibliographic credit are preserved. No sole invention, universal physiological validity, or causal influence claim is inferred; the portrait artist is not a biography author.

Arturo Rosenblueth: Institutional historical biography; joint contributions and bibliographic credit are preserved. No sole invention, universal physiological validity, or causal influence claim is inferred; the portrait artist is not a biography author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Banumathi Sankaran

Banumathi Sankaran describes leading the Collaborative Crystallography program at Berkeley Lab’s Advanced Light Source, which provides a mail-in service for structural-biology researchers.

The program uses the facility’s peer-reviewed user-proposal system to prioritize service work, which can range from data collection to structure validation and Protein Data Bank submission.

Its stated aim is to help researchers who need three-dimensional structures but lack routine access to the necessary equipment and expertise.

Sources and details

Banumathi Sankaran | Biosciences | Berkeley Lab – Biosciences Area

{
  "access_scope": "Banumathi Sankaran: First-person institutional profile; program capabilities are not all assigned as Sankaran’s individual tasks. Relative activity totals are omitted, and this source does not allocate her specific ProteinMPNN experimental work.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2025-07-22T01:27:52+00:00"
    ],
    "retrieved_utc": "2026-10-08T06:02:15.018041+00:00"
  },
  "id": "person-coverage-8f4636642c8a10::S1",
  "title": "Banumathi Sankaran | Biosciences | Berkeley Lab – Biosciences Area",
  "url": "https://biosciences.lbl.gov/profiles/banumathi-sankaran/"
}

Banumathi Sankaran: First-person institutional profile; program capabilities are not all assigned as Sankaran’s individual tasks. Relative activity totals are omitted, and this source does not allocate her specific ProteinMPNN experimental work.

Banumathi Sankaran: First-person institutional profile; program capabilities are not all assigned as Sankaran’s individual tasks. Relative activity totals are omitted, and this source does not allocate her specific ProteinMPNN experimental work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Birger Wernerfelt

Birger Wernerfelt’s MIT Sloan profile describes research comparing alternative ways of trading services, across a career spanning marketing, economics and strategy.

Its bibliography lists his sole-authored chapter The Adaptation Cost Theory of the Firm and the Resource-Based View as forthcoming, connecting two explicitly named approaches to analyzing firms.

It separately lists Small Talk as a Contracting Device with Matthew Cashman and Boris Maciejovsky, whose title identifies trust, cooperative norms and changing equilibria as its subject.

Sources and details

Birger Wernerfelt | MIT Sloan

{
  "access_scope": "Birger Wernerfelt: Institutional research profile and bibliography; titles establish topics and credit, not paper findings. Forthcoming status is preserved and the historical 1984 resource-position-barrier claim is not newly reverified.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:16.062459+00:00"
  },
  "id": "person-birgerwernerfelt::S1",
  "title": "Birger Wernerfelt | MIT Sloan",
  "url": "https://mitsloan.mit.edu/faculty/directory/birger-wernerfelt"
}

Birger Wernerfelt: Institutional research profile and bibliography; titles establish topics and credit, not paper findings. Forthcoming status is preserved and the historical 1984 resource-position-barrier claim is not newly reverified.

Birger Wernerfelt: Institutional research profile and bibliography; titles establish topics and credit, not paper findings. Forthcoming status is preserved and the historical 1984 resource-position-barrier claim is not newly reverified.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Carmelo Cennamo

Carmelo Cennamo studies how multi-sided platforms and ecosystems change competition, industry structures and value creation across sectors such as media, automotive, healthcare and decentralized finance.

His Copenhagen Business School profile connects platform-governance research with the problem of balancing innovation and fairness in digital markets.

He also describes bringing that research into policy debates, including the EU Digital Markets Act, through forums and collaborations with policymakers and industry leaders.

Sources and details

Carmelo Cennamo | CBS - Copenhagen Business School

{
  "access_scope": "Carmelo Cennamo: First-person institutional profile; stated policy engagement does not prove adoption or impact. Ecosystem research does not establish causal historical influence or sole credit for the baseline coauthored theory.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:17.979205+00:00"
  },
  "id": "person-coverage-ebd6322ce41720::S1",
  "title": "Carmelo Cennamo | CBS - Copenhagen Business School",
  "url": "https://www.cbs.dk/en/research/departments/department-strategy-and-innovation/carmelo-cennamo"
}

Carmelo Cennamo: First-person institutional profile; stated policy engagement does not prove adoption or impact. Ecosystem research does not establish causal historical influence or sole credit for the baseline coauthored theory.

Carmelo Cennamo: First-person institutional profile; stated policy engagement does not prove adoption or impact. Ecosystem research does not establish causal historical influence or sole credit for the baseline coauthored theory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel A. Levinthal

Daniel A. Levinthal and Daniel Schliesmann’s 2025 Cautious Exploitation study distinguishes finding promising alternatives from evaluating alternatives through experience.

The abstract reproduced on Levinthal’s Wharton profile reports that slow belief updating combined with a strategy tilted toward exploitation can support adaptation when evaluation itself is difficult.

It retains a boundary to that result: explicit exploration remains important in settings primarily concerned with discovering an alternative whose promise is evident once found.

Sources and details

Daniel A Levinthal – Management Department

{
  "access_scope": "Daniel A. Levinthal: Coauthored study abstract reproduced in an institutional publication list; specific search-setting findings, not a universal recommendation or individual task allocation. This does not reverify the separate historical absorptive-capacity credit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2026-02-11T08:18:07+00:00"
    ],
    "retrieved_utc": "2026-10-08T06:02:15.996797+00:00",
    "selected_paper_publication_year": "2025"
  },
  "id": "person-danielalevinthal::S1",
  "title": "Daniel A Levinthal – Management Department",
  "url": "https://mgmt.wharton.upenn.edu/profile/dlev/"
}

Daniel A. Levinthal: Coauthored study abstract reproduced in an institutional publication list; specific search-setting findings, not a universal recommendation or individual task allocation. This does not reverify the separate historical absorptive-capacity credit.

Daniel A. Levinthal: Coauthored study abstract reproduced in an institutional publication list; specific search-setting findings, not a universal recommendation or individual task allocation. This does not reverify the separate historical absorptive-capacity credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hakwan Lau

Hakwan Lau’s archived lab account treats perceptual awareness and metacognition as closely linked while explicitly rejecting the claim that they are the same phenomenon.

The group combines human brain imaging and stimulation with psychophysics, including studies of confidence and awareness and computational modeling using signal-detection theory.

It describes using decoded fMRI neurofeedback to manipulate specific neural representations while pursuing a treatment approach for phobia, with patient replication still presented as ongoing.

Sources and details

Hakwan Lau's Lab Webpage

{
  "access_scope": "Hakwan Lau: Unmaintained lab webpage with a move notice and older UCLA wording; no current appointment inferred. Group and collaborator methods are not assigned as Lau’s sole tasks; a treatment research aim and ongoing replication are not established clinical efficacy or proof of machine consciousness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:17.139028+00:00"
  },
  "id": "person-coverage-2aae9a8ba69e33::S1",
  "title": "Hakwan Lau's Lab Webpage",
  "url": "https://sites.google.com/view/hakwan-lau-lab"
}

Hakwan Lau: Unmaintained lab webpage with a move notice and older UCLA wording; no current appointment inferred. Group and collaborator methods are not assigned as Lau’s sole tasks; a treatment research aim and ongoing replication are not established clinical efficacy or proof of machine consciousness.

Hakwan Lau: Unmaintained lab webpage with a move notice and older UCLA wording; no current appointment inferred. Group and collaborator methods are not assigned as Lau’s sole tasks; a treatment research aim and ongoing replication are not established clinical efficacy or proof of machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jakub Pachocki

Jakub Pachocki is named among the coauthors of the December 2019 arXiv paper Dota 2 with Large Scale Deep Reinforcement Learning.

Its abstract reports that OpenAI Five used existing reinforcement-learning techniques at a scale of about two million game frames every two seconds, supported by distributed tools for ten months of continual training.

The reported defeat of world champion Team OG in April 2019 concerns self-play reinforcement learning in Dota 2, a setting with long horizons, imperfect information and complex state and action spaces.

Sources and details

[1912.06680] Dota 2 with Large Scale Deep Reinforcement Learning

{
  "access_scope": "Jakub Pachocki: Exact named paper credit and team-level abstract results only; no individual task allocation or company-leadership role inferred. arXiv v1 submission date and match date remain separate; no full-paper or experiment-table audit.",
  "authors": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "authors_in_source_order": [
    "OpenAI",
    ":",
    "Berner, Christopher",
    "Brockman, Greg",
    "Chan, Brooke",
    "Cheung, Vicki",
    "Dębiak, Przemysław",
    "Dennison, Christy",
    "Farhi, David",
    "Fischer, Quirin",
    "Hashme, Shariq",
    "Hesse, Chris",
    "Józefowicz, Rafal",
    "Gray, Scott",
    "Olsson, Catherine",
    "Pachocki, Jakub",
    "Petrov, Michael",
    "Pinto, Henrique P. d. O.",
    "Raiman, Jonathan",
    "Salimans, Tim",
    "Schlatter, Jeremy",
    "Schneider, Jonas",
    "Sidor, Szymon",
    "Sutskever, Ilya",
    "Tang, Jie",
    "Wolski, Filip",
    "Zhang, Susan"
  ],
  "dates": {
    "citation_date": [
      "2019/12/13"
    ],
    "citation_online_date": [
      "2019/12/13"
    ],
    "inspected_revision": "Fri, 13 Dec 2019 19:56:40 UTC (8,625 KB)",
    "retrieved_utc": "2026-10-07T18:20:40.482612+00:00",
    "version": "arXiv v1"
  },
  "id": "person-jakubpachocki::S1",
  "title": "[1912.06680] Dota 2 with Large Scale Deep Reinforcement Learning",
  "url": "https://arxiv.org/abs/1912.06680",
  "version_url": "https://arxiv.org/abs/1912.06680v1"
}

Jakub Pachocki: Exact named paper credit and team-level abstract results only; no individual task allocation or company-leadership role inferred. arXiv v1 submission date and match date remain separate; no full-paper or experiment-table audit.

Jakub Pachocki: Exact named paper credit and team-level abstract results only; no individual task allocation or company-leadership role inferred. arXiv v1 submission date and match date remain separate; no full-paper or experiment-table audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Landay

James Landay’s Stanford profile connects his human-computer interaction work to a doctoral dissertation demonstrating sketching in user-interface design tools.

It describes his 2003–2006 directorship of Intel Labs Seattle, where research explored ubiquitous computing, and lists mobile computing and interface design among his research interests.

The profile also identifies him as a cofounder of Stanford’s Institute for Human-Centered AI and separately records director and earlier leadership roles.

Sources and details

James Landay's Profile | Stanford Profiles

{
  "access_scope": "James Landay: Institutional career account; dissertation priority is not independently audited, so the prose omits the first-ever claim. Leadership intervals do not establish an exact appointment day; baseline dated HAI role distinctions remain preserved.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:16.644767+00:00"
  },
  "id": "person-coverage-0ed1ed8f8143e6::S1",
  "title": "James Landay's Profile | Stanford Profiles",
  "url": "https://profiles.stanford.edu/james-landay"
}

James Landay: Institutional career account; dissertation priority is not independently audited, so the prose omits the first-ever claim. Leadership intervals do not establish an exact appointment day; baseline dated HAI role distinctions remain preserved.

James Landay: Institutional career account; dissertation priority is not independently audited, so the prose omits the first-ever claim. Leadership intervals do not establish an exact appointment day; baseline dated HAI role distinctions remain preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Seely Brown

John Seely Brown coauthored Situated Cognition and the Culture of Learning with Allan Collins and Paul Duguid in 1989.

They argue that knowledge develops through activity, context and culture, so learning a concept separately from its use can leave it difficult to apply.

The article proposes cognitive apprenticeship as an alternative and discusses two mathematics-instruction examples, presenting its explanation as deliberately speculative.

Sources and details

Situated Cognition and the Culture of Learning

{
  "access_scope": "John Seely Brown: Joint theoretical argument, not sole invention or a universally proven learning law. This is the 1989 article, distinct from the baseline 1991 organizational-learning paper; pages 32–42 are the article within a 14-page PDF container with cover and linked-citation material.",
  "authors": [
    "John Seely Brown",
    "Allan Collins",
    "Paul Duguid"
  ],
  "authors_in_source_order": [
    "John Seely Brown",
    "Allan Collins",
    "Paul Duguid"
  ],
  "dates": {
    "JSTOR_transmission_stamp": "Tue Jun 26 13:52:03 2007",
    "PDF_creation_metadata": "2012-03-20; file conversion, not publication",
    "journal_issue": "Jan.–Feb. 1989",
    "retrieved_utc": "2026-10-08T06:02:15.642954+00:00"
  },
  "id": "person-coverage-65bb05bd664ac4::S1",
  "title": "Situated Cognition and the Culture of Learning",
  "url": "https://johnseelybrown.com/situatedcognitionculturelearning.pdf"
}

John Seely Brown: Joint theoretical argument, not sole invention or a universally proven learning law. This is the 1989 article, distinct from the baseline 1991 organizational-learning paper; pages 32–42 are the article within a 14-page PDF container with cover and linked-citation material.

John Seely Brown: Joint theoretical argument, not sole invention or a universally proven learning law. This is the 1989 article, distinct from the baseline 1991 organizational-learning paper; pages 32–42 are the article within a 14-page PDF container with cover and linked-citation material.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John W. Meyer

John W. Meyer’s Stanford biography describes institutional theories of how wider, often global models shape modern individuals, organizations and national states.

It identifies the worldwide expansion of education and science as one research focus, citing The University with Frank in 2020, and formal organizations as another, citing Hyper-Organization with Bromley in 2015.

The profile also describes a later research focus on shifts from liberal and neoliberal models toward post-liberal and sometimes reactionary models.

Sources and details

John Meyer | Department of Sociology

{
  "access_scope": "John W. Meyer: Institutional account of research topics and coauthored bibliography; theoretical shaping is attributed rather than asserted as a universal causal law. The separate baseline 1977 decoupling argument is not newly audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:17.312408+00:00"
  },
  "id": "person-coverage-06957f0fd79775::S1",
  "title": "John Meyer | Department of Sociology",
  "url": "https://sociology.stanford.edu/people/john-meyer"
}

John W. Meyer: Institutional account of research topics and coauthored bibliography; theoretical shaping is attributed rather than asserted as a universal causal law. The separate baseline 1977 decoupling argument is not newly audited.

John W. Meyer: Institutional account of research topics and coauthored bibliography; theoretical shaping is attributed rather than asserted as a universal causal law. The separate baseline 1977 decoupling argument is not newly audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kunle Olukotun

Kunle Olukotun’s Stanford profile identifies him as the leader of the Hydra chip-multiprocessor research project and connects his work to multicore processor design.

It describes his founding of Afara Websystems to develop high-throughput, low-power server processors, followed by Sun Microsystems’ acquisition of its Niagara processor.

The profile also records his 2017 cofounding of SambaNova Systems and his work on parallel-computing and machine-learning infrastructure at Stanford.

Sources and details

Kunle Olukotun | Stanford University School of Engineering

{
  "access_scope": "Kunle Olukotun: Institutional research and career account; project leadership and company founding do not allocate all technical tasks to one person. The source’s continuing-role wording is not an independently audited current employment assertion, and URL wording does not authorize a new name alias.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:15.018806+00:00"
  },
  "id": "person-kunleolukotun::S1",
  "title": "Kunle Olukotun | Stanford University School of Engineering",
  "url": "https://engineering.stanford.edu/people/oyekunle-olukotun"
}

Kunle Olukotun: Institutional research and career account; project leadership and company founding do not allocate all technical tasks to one person. The source’s continuing-role wording is not an independently audited current employment assertion, and URL wording does not authorize a new name alias.

Kunle Olukotun: Institutional research and career account; project leadership and company founding do not allocate all technical tasks to one person. The source’s continuing-role wording is not an independently audited current employment assertion, and URL wording does not authorize a new name alias.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Moonshots #194 · LinkedIn Co-Founder Opens Up on AI Job Loss

The producer’s episode description brings Reid Hoffman into a discussion whose chapter map starts with AI’s effects on jobs and education, then turns to consciousness and the AGI–ASI debate.

Its middle chapters contrast singleton and multipolar superintelligence scenarios before moving into chip production, company competition and patents.

Later chapters connect the discussion to multi-agent systems, language translation, transport robots and autonomous surgery.

Sources and details

LinkedIn Co-Founder Opens Up on the Reality of AI Job Loss | EP #194

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on September 11th, 2025",
    "inspected_source_date_2": "YouTube publication timestamp: 2025-09-17T07:45:09-07:00",
    "retrieved_utc": "2026-10-07T18:15:49.030059+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on September 11th, 2025",
    "YouTube publication timestamp: 2025-09-17T07:45:09-07:00"
  ],
  "id": "work-moonshots-ep-194::S1",
  "title": "LinkedIn Co-Founder Opens Up on the Reality of AI Job Loss | EP #194",
  "url": "https://www.youtube.com/watch?v=mbbG0RSkpFw"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2025-09-17"
}

Moonshots #196 · Replit CEO on Vibe Coding and the Future of Software Development

The producer’s description presents a conversation with Replit co-founder Amjad Masad that connects software development with entrepreneurship and the discovery of programming talent.

The chapter map moves from Masad’s journey from Jordan to Silicon Valley into coding’s future, AI integration and competition among software businesses.

Later chapters examine agents in software development, Replit’s organizational use and the relationship between coding, education and entrepreneurship.

Sources and details

Replit CEO on The Career of Coding, AGI, and Vibe Coding Wars w/ Amjad Masad, Dave B & Salim

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on September 9th, 2025",
    "inspected_source_date_2": "YouTube publication timestamp: 2025-09-23T16:46:25-07:00",
    "retrieved_utc": "2026-10-07T18:21:23.730841+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on September 9th, 2025",
    "YouTube publication timestamp: 2025-09-23T16:46:25-07:00"
  ],
  "id": "work-moonshots-ep-196::S1",
  "title": "Replit CEO on The Career of Coding, AGI, and Vibe Coding Wars w/ Amjad Masad, Dave B & Salim",
  "url": "https://www.youtube.com/watch?v=T9rukIoXxgw"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2025-09-23"
}

Moonshots #206 · How Life Changes When We Reach Artificial Superintelligence

The producer identifies this release as Part 1 of a conversation with Eric Schmidt and Fei-Fei Li about human life after artificial superintelligence.

Its three-part chapter map opens by framing superintelligence and then turns to AI’s impact on the global economy.

The final listed chapter focuses on future collaboration between humans and AI, giving this installment a social and economic scope alongside its technical premise.

Sources and details

Part 1: Eric Schmidt and Fei-Fei Li: Human Life After Artificial Superintelligence | EP #206

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. This release is explicitly Part 1 and does not cover the full larger conversation. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on October 27th, 2025",
    "inspected_source_date_2": "YouTube publication timestamp: 2025-11-07T07:01:53-08:00",
    "retrieved_utc": "2026-10-07T18:18:23.081494+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on October 27th, 2025",
    "YouTube publication timestamp: 2025-11-07T07:01:53-08:00"
  ],
  "id": "work-moonshots-ep-206::S1",
  "title": "Part 1: Eric Schmidt and Fei-Fei Li: Human Life After Artificial Superintelligence | EP #206",
  "url": "https://www.youtube.com/watch?v=rFomaqO2SD4"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. This release is explicitly Part 1 and does not cover the full larger conversation. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. This release is explicitly Part 1 and does not cover the full larger conversation. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2025-11-07"
}

Moonshots #213 · Unlocking AGI: How Life Changes for Everyone

The producer’s description brings Jack Hidary, Salim Ismail and Dave Blundin into a conversation that connects the future of AI with quantum computing.

The chapter map then turns to energy abundance and humanoid robotics, widening the discussion from computing to physical infrastructure and machines.

Its closing listed chapter addresses quantum advantage and its implications.

Sources and details

Unlocking AGI: How Life Changes for Everyone w/ Jack Hidary, Salim Ismail & Dave Blundin | EP #213

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on October 27th, 2025",
    "inspected_source_date_2": "YouTube publication timestamp: 2025-12-06T07:00:49-08:00",
    "retrieved_utc": "2026-10-07T18:21:23.654780+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on October 27th, 2025",
    "YouTube publication timestamp: 2025-12-06T07:00:49-08:00"
  ],
  "id": "work-moonshots-ep-213::S1",
  "title": "Unlocking AGI: How Life Changes for Everyone w/ Jack Hidary, Salim Ismail & Dave Blundin | EP #213",
  "url": "https://www.youtube.com/watch?v=QHyHENuIfcc"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2025-12-06"
}

Moonshots #214 · US vs. China: Why Trust Will Win the AI Race | GPT-5.2 & Anthropic IPO

The producer’s episode map combines AI competition with international supply-chain questions, including chapters on China’s response and AI’s future in Europe.

Other chapters focus on model memory and context, visual reasoning, data regulation and the expansion of AI education.

The later discussion extends to data centers, commercial space stations and United States robotics, with a potential SpaceX IPO explicitly framed as a topic rather than a completed event.

Sources and details

China's Rise, GPT-5.2, Anthropic IPO & the Battle for AI Trust w/ Emad, Salim, Dave & AWG | EP #214

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on December 6th, 2025",
    "inspected_source_date_2": "YouTube publication timestamp: 2025-12-09T06:01:44-08:00",
    "retrieved_utc": "2026-10-07T18:12:31.692979+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on December 6th, 2025",
    "YouTube publication timestamp: 2025-12-09T06:01:44-08:00"
  ],
  "id": "work-moonshots-ep-214::S1",
  "title": "China's Rise, GPT-5.2, Anthropic IPO & the Battle for AI Trust w/ Emad, Salim, Dave & AWG | EP #214",
  "url": "https://www.youtube.com/watch?v=zGD5mv-XKU0"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2025-12-09"
}

Moonshots #223 · The Singularity Countdown: AGI by 2029, Humans Merge with AI, and Intelligence Multiplies 1000x

The producer’s description centers a conversation with Ray Kurzweil on his AI predictions and distinguishes human-level AI from the broader idea of a technological singularity.

Its chapter map connects that speculative framing to the future of work, universal basic income and AI’s role in society and ethics.

Later chapters turn to longevity, health and consciousness.

Sources and details

The Singularity Countdown: AGI by 2029, Humans Merge with AI, Intelligence 1000x | Ray Kurzweil

{
  "access_scope": "Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Recorded on January 15th, 2026",
    "inspected_source_date_2": "YouTube publication timestamp: 2026-01-20T09:37:16-08:00",
    "retrieved_utc": "2026-10-07T18:21:57.412899+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Recorded on January 15th, 2026",
    "YouTube publication timestamp: 2026-01-20T09:37:16-08:00"
  ],
  "id": "work-moonshots-ep-223::S1",
  "title": "The Singularity Countdown: AGI by 2029, Humans Merge with AI, Intelligence 1000x | Ray Kurzweil",
  "url": "https://www.youtube.com/watch?v=8iWSNwIRazc"
}

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

Producer-written YouTube description and timestamped chapter headings only; no transcript or full episode audit, individual speaker claim attribution, current guest-role validation or forecast verification. Recording date and publication date describe different events. Original source and episode identity holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "Date shown on publisher catalog, not independently verified publication or recording date. No aggregator chronology relied upon.",
  "dated": false,
  "year": "2026-01-20"
}

Stanford/HAI

Stanford HAI describes an interdisciplinary research approach that links advances in AI technology with investigation of their societal effects.

Its cached institutional page says it develops specialized AI-governance training for policymakers and civil servants, and treats K–12 leaders, teachers, and students as part of educating future AI leaders.

HAI also describes faculty-led education drawing on Stanford’s seven schools and partnerships with research centers and labs both within and beyond the university.

Sources and details

Home | Stanford HAI

{
  "access_scope": "Institutional self-description recovered from serialized homepage navigation summaries, with no publication date displayed; describes stated programs and approach, not independently demonstrated educational or social outcomes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:23:00.641227+00:00"
  },
  "id": "stanford-hai::S1",
  "title": "Home | Stanford HAI",
  "url": "https://hai.stanford.edu/"
}

Institutional self-description recovered from serialized homepage navigation summaries, with no publication date displayed; describes stated programs and approach, not independently demonstrated educational or social outcomes.

Institutional self-description recovered from serialized homepage navigation summaries, with no publication date displayed; describes stated programs and approach, not independently demonstrated educational or social outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Jeffrey Katzenberg

Bloomberg Television’s November 2023 video description reports Jeffrey Katzenberg’s forecast that AI would reduce the cost of making major animated films by about 90%.

The description attributes to the DreamWorks co-founder a comparison with a production process involving 500 artists working for five years.

It reports his expectation that the corresponding effort would fall below one tenth of that level within three years, presenting a forward-looking estimate from the Singapore New Economy Forum panel.

Sources and details

Jeff Katzenberg Says AI Will Cut Cost of Animated Films by 90%

{
  "access_scope": "Bloomberg Television’s dated description of remarks, not a watched-video transcript, measured result, realized cost reduction, or evidence assigning particular production tasks to Katzenberg. Relative forecast horizon preserved from the 2023 description.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publishDate": "2023-11-08T22:15:50-08:00",
    "retrieved_utc": "2026-10-07T17:55:26.143885+00:00",
    "uploadDate": "2023-11-08T22:15:50-08:00"
  },
  "id": "creative-person-coverage-1a93de50612719::S1",
  "title": "Jeff Katzenberg Says AI Will Cut Cost of Animated Films by 90%",
  "url": "https://www.youtube.com/watch?v=fkJlwjKdxnI"
}

Bloomberg Television’s dated description of remarks, not a watched-video transcript, measured result, realized cost reduction, or evidence assigning particular production tasks to Katzenberg. Relative forecast horizon preserved from the 2023 description.

Bloomberg Television’s dated description of remarks, not a watched-video transcript, measured result, realized cost reduction, or evidence assigning particular production tasks to Katzenberg. Relative forecast horizon preserved from the 2023 description.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Learning from examples

The 1958 perceptron paper presents learning as the formation of stimulus–response associations through changing values in a network of association cells.

Its proposed tests expose the perceptron to stimulus patterns and either force desired responses or reinforce correct choices while penalizing wrong ones.

The paper distinguishes repeating a training series with the network frozen from testing new stimuli drawn from the same classes, separating retention from generalization.

Sources and details

THE PERCEPTRON: A PROBABILISTIC MODEL FOR INFORMATION STORAGE AND ORGANIZATION IN THE BRAIN

{
  "access_scope": "Historical probabilistic model and proposed learning experiments; not proof of biological memory mechanisms or performance of modern models.",
  "authors": [
    "F. Rosenblatt"
  ],
  "authors_in_source_order": [
    "F. Rosenblatt"
  ],
  "dates": {
    "journal_year": "1958",
    "retrieved_utc": "2026-10-08T06:06:17.930528+00:00"
  },
  "id": "perceptron::S1",
  "title": "THE PERCEPTRON: A PROBABILISTIC MODEL FOR INFORMATION STORAGE AND ORGANIZATION IN THE BRAIN",
  "url": "https://web.stanford.edu/class/psych209a/ReadingsByDate/01_30/Rosenblatt58Perceptron.pdf"
}

Historical probabilistic model and proposed learning experiments; not proof of biological memory mechanisms or performance of modern models.

Historical probabilistic model and proposed learning experiments; not proof of biological memory mechanisms or performance of modern models.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1958
}

Recursive self-improvement / intelligence explosion

Irving John Good’s speculative account proposes modifying Hebb’s cell-assembly theory into a subassembly theory to help explain memory, meaning, and an ultraintelligent machine.

The repository abstract describes his expectation that the first such machine would incorporate extensive artificial neural circuitry.

It then envisages later machines being designed by ultraintelligent machines themselves, explicitly leaving their design principles open.

Sources and details

Speculations Concerning the First Ultraintelligent Machine

{
  "access_scope": "Speculative historical argument; repository date 2005-03-05 is distinct from the linked 1965 reprint and its 1963/1964 draft history. Claims selected from repository abstract, no prediction treated as achieved.",
  "authors": [
    "Irving John Good"
  ],
  "authors_in_source_order": [
    "Irving John Good"
  ],
  "dates": {
    "citation_publication_date": "2005-03-05",
    "first_draft": "April 1963",
    "original_reprint_year": "1965",
    "repository_date": "2005-03-05",
    "retrieved_utc": "2026-10-08T06:06:17.818479+00:00",
    "slightly_amended_version": "May 1964"
  },
  "id": "good::S1",
  "title": "Speculations Concerning the First Ultraintelligent Machine",
  "url": "https://vtechworks.lib.vt.edu/items/5085379d-b24c-424e-8861-e70a47b4b2fb"
}

Speculative historical argument; repository date 2005-03-05 is distinct from the linked 1965 reprint and its 1963/1964 draft history. Claims selected from repository abstract, no prediction treated as achieved.

Speculative historical argument; repository date 2005-03-05 is distinct from the linked 1965 reprint and its 1963/1964 draft history. Claims selected from repository abstract, no prediction treated as achieved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1965
}

Elon Musk / Tesla

Tesla’s April 2026 quarterly update says FSD (Supervised) v14.3 uses an upgraded reinforcement-learning stage for unusual cases and a revised vision encoder for low-visibility perception.

The company reports rewriting its AI compiler and runtime to speed model iterations and reduce inference latency by up to 20%, while describing unsupervised autonomy as an eventual deployment goal.

The same update describes Digital Optimus as work on automating digital tasks and states that active driver supervision remains required for FSD (Supervised).

Sources and details

Tesla, Inc. First Quarter 2026 Update furnished with Form 8-K

{
  "access_scope": "Tesla’s dated company account; vendor latency claim and forward plans are attributed. Supervised driving does not make vehicles autonomous; no personal engineering contribution assigned to Elon Musk.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "quarter_end": "March 31, 2026",
    "report_date": "April 22, 2026",
    "retrieved_utc": "2026-10-08T06:06:15.016474+00:00"
  },
  "id": "musk-tesla::S1",
  "title": "Tesla, Inc. First Quarter 2026 Update furnished with Form 8-K",
  "url": "https://ir.tesla.com/_flysystem/s3/sec/000162828026026551/tsla-20260422-gen.pdf"
}

Tesla’s dated company account; vendor latency claim and forward plans are attributed. Supervised driving does not make vehicles autonomous; no personal engineering contribution assigned to Elon Musk.

Tesla’s dated company account; vendor latency claim and forward plans are attributed. Supervised driving does not make vehicles autonomous; no personal engineering contribution assigned to Elon Musk.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2026
}

Associative paths through knowledge

Vannevar Bush’s memex proposal organizes knowledge through associative indexing, allowing one stored item to call up another linked item directly.

A user would name a trail, join documents through their code spaces, and add comments or branch into related trails while preserving the links.

The essay imagines reviewing a trail at different speeds and copying it for another person’s memex, turning an individual route through research into a shareable record.

Sources and details

As We May Think

{
  "access_scope": "1945 proposal reproduced with permission; HTML prepared by Denys Duchier in April 1994 and updated at Simon Fraser University in August 1995. Proposed device behavior, not a deployed modern product.",
  "authors": [
    "Vannevar Bush"
  ],
  "authors_in_source_order": [
    "Vannevar Bush"
  ],
  "dates": {
    "html_version": "April 1994",
    "original_publication": "July 1945",
    "retrieved_utc": "2026-10-08T06:06:18.906035+00:00",
    "updated": "August 1995"
  },
  "id": "memex::S1",
  "title": "As We May Think",
  "url": "https://www.cs.sfu.ca/mmbook/furtherv3/VBushArticle/vbush-all.html"
}

1945 proposal reproduced with permission; HTML prepared by Denys Duchier in April 1994 and updated at Simon Fraser University in August 1995. Proposed device behavior, not a deployed modern product.

1945 proposal reproduced with permission; HTML prepared by Denys Duchier in April 1994 and updated at Simon Fraser University in August 1995. Proposed device behavior, not a deployed modern product.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1945
}

A research institution is a collaboration

OpenAI’s account of its October 2025 structure says the nonprofit OpenAI Foundation controls the for-profit OpenAI Group public benefit corporation.

It describes special voting and governance rights through which the Foundation appoints every Group director and may replace directors.

The account says the Safety and Security Committee remains with the Foundation, linking oversight of safety practices across the organization to the nonprofit board.

Sources and details

Our structure

{
  "access_scope": "First-party description of the updated governance structure, separate from the 2023 capped-profit structure described in the alternate testimony. No legal advice or independent validation of governance effectiveness.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:06:16.631919+00:00",
    "structure_announcement": "October 28, 2025"
  },
  "id": "openai-founding::S1",
  "title": "Our structure",
  "url": "https://openai.com/our-structure/?stream=top"
}

First-party description of the updated governance structure, separate from the 2023 capped-profit structure described in the alternate testimony. No legal advice or independent validation of governance effectiveness.

First-party description of the updated governance structure, separate from the 2023 capped-profit structure described in the alternate testimony. No legal advice or independent validation of governance effectiveness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2015
}

Cohere / enterprise language models

Cohere’s Command R release description presents a language model optimized for long-context retrieval-augmented generation and use of external APIs and tools.

The company describes pairing Command R with its Embed and Rerank models to build retrieval applications for enterprise workloads.

The release lists a 128k context, support for ten key languages, and weights available for research and evaluation, framing these as features intended to help move applications into production.

Sources and details

Command R: Retrieval-Augmented Generation at Scale

{
  "access_scope": "First-party release description for Command R; no independent accuracy, throughput, integration, or production-workflow validation. API v2 documentation wrapper is separate from the historical model release; no release date inferred from URL.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:06:14.673582+00:00"
  },
  "id": "cohere::S1",
  "title": "Command R: Retrieval-Augmented Generation at Scale",
  "url": "https://docs.cohere.com/changelog/command-r-retrieval-augmented-generation-at-production-scale"
}

First-party release description for Command R; no independent accuracy, throughput, integration, or production-workflow validation. API v2 documentation wrapper is separate from the historical model release; no release date inferred from URL.

First-party release description for Command R; no independent accuracy, throughput, integration, or production-workflow validation. API v2 documentation wrapper is separate from the historical model release; no release date inferred from URL.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2019
}

SambaNova / reconfigurable dataflow

SambaNova describes its dataflow architecture as a grid of programmable compute units and SRAM memory units that pipelines AI operations.

Its account says computation for one operator overlaps fetching data for the next, keeping intermediate activations on the chip to reduce data movement.

The vendor describes HBM and DDR as additional memory tiers feeding models and KV cache into this pipeline, with chip-to-chip communication used to scale inference across multiple RDUs.

Sources and details

Dataflow Architecture

{
  "access_scope": "Vendor architecture description as cached, encompassing SN40/SN50 references; technical mechanism is attributed, not independently benchmarked. No SN50 capacity retroactively assigned to the separate 2025 SN40L PDF.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:06:17.279731+00:00"
  },
  "id": "sambanova::S1",
  "title": "Dataflow Architecture",
  "url": "https://sambanova.ai/products/dataflow-architecture"
}

Vendor architecture description as cached, encompassing SN40/SN50 references; technical mechanism is attributed, not independently benchmarked. No SN50 capacity retroactively assigned to the separate 2025 SN40L PDF.

Vendor architecture description as cached, encompassing SN40/SN50 references; technical mechanism is attributed, not independently benchmarked. No SN50 capacity retroactively assigned to the separate 2025 SN40L PDF.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2017
}

Seymour Cray / supercomputer teams

Cray Research’s CRAY-2 brochure describes four independent background processors that can run separate jobs or cooperate on a single problem.

It specifies a shared memory of 256 million 64-bit words accessible to the processors and data channels, with local processor memory for temporary scalar and vector data.

The brochure describes liquid-immersion cooling in a fluorocarbon fluid to remove heat from densely packed logic and memory modules.

Sources and details

Introducing the CRAY-2 Computer System

{
  "access_scope": "Historical company brochure hosted by Computer History Museum; hardware description attributed to Cray Research. No design tasks allocated to Seymour Cray personally, and promotional speed/superiority claims excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "archive_filename_year": "1985; filename provenance, not an inferred printed publication date",
    "retrieved_utc": "2026-10-08T06:06:14.232354+00:00"
  },
  "id": "cray-research::S1",
  "title": "Introducing the CRAY-2 Computer System",
  "url": "https://archive.computerhistory.org/resources/text/Cray/Cray.Cray2.1985.102646185.pdf"
}

Historical company brochure hosted by Computer History Museum; hardware description attributed to Cray Research. No design tasks allocated to Seymour Cray personally, and promotional speed/superiority claims excluded.

Historical company brochure hosted by Computer History Museum; hardware description attributed to Cray Research. No design tasks allocated to Seymour Cray personally, and promotional speed/superiority claims excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1976
}

Whole brain emulation

Carboncopies’ roadmap overview describes whole brain emulation as a proposed digital replica made by scanning and simulating a biological brain at sufficient detail.

It outlines acquiring neuronal and synaptic structure, potentially including molecular details, and constructing a computational model of the relevant biological operations.

The page makes substrate independence conditional on consciousness arising from computational structure, while describing an update process that seeks expert input and public comment on roadmap sections.

Sources and details

Roadmap Overview

{
  "access_scope": "Institutional roadmap proposal, not demonstrated preservation of consciousness, memory, or personality. Sandberg and Bostrom are credited as editors of the earlier 2008 roadmap, not inferred writers of this undated overview.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "prior_roadmap_year": "2008",
    "retrieved_utc": "2026-10-08T06:06:14.232927+00:00"
  },
  "id": "brain-emulation::S1",
  "title": "Roadmap Overview",
  "url": "https://carboncopies.org/Research/Roadmap/About/"
}

Institutional roadmap proposal, not demonstrated preservation of consciousness, memory, or personality. Sandberg and Bostrom are credited as editors of the earlier 2008 roadmap, not inferred writers of this undated overview.

Institutional roadmap proposal, not demonstrated preservation of consciousness, memory, or personality. Sandberg and Bostrom are credited as editors of the earlier 2008 roadmap, not inferred writers of this undated overview.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2008
}

Smart homes in a Nigerian future

Nnedi Okorafor’s short story places Anwuli in Obi 3, a Nigerian smart home whose drones collect materials for the house’s ongoing repairs and construction.

The fictional house can lift itself on mechanized beams, rotate toward the sun, and change from a triangle into a square or separate modules.

Obi 3 also speaks and sings to its pregnant resident, bringing automated shelter and emotional reassurance into the story’s account of personal vulnerability.

Sources and details

Mother of Invention

{
  "access_scope": "Fiction published by Slate/Future Tense in 2018; architectural and human-interaction details are narrative inventions, not validated engineering or healthcare systems. Shyama Golden is illustrator; Ursula K. Le Guin is epigraph author, neither the story writer.",
  "authors": [
    "Nnedi Okorafor"
  ],
  "authors_in_source_order": [
    "Nnedi Okorafor"
  ],
  "dates": {
    "datePublished": "2018-02-21T14:00:05+00:00",
    "retrieved_utc": "2026-10-08T06:06:17.280960+00:00"
  },
  "id": "mother-of-invention::S1",
  "title": "Mother of Invention",
  "url": "https://slate.com/technology/2018/02/mother-of-invention-a-new-short-story-by-nnedi-okorafor.html"
}

Fiction published by Slate/Future Tense in 2018; architectural and human-interaction details are narrative inventions, not validated engineering or healthcare systems. Shyama Golden is illustrator; Ursula K. Le Guin is epigraph author, neither the story writer.

Fiction published by Slate/Future Tense in 2018; architectural and human-interaction details are narrative inventions, not validated engineering or healthcare systems. Shyama Golden is illustrator; Ursula K. Le Guin is epigraph author, neither the story writer.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2018
}

ASE

ASE’s November 2025 announcement presents IDE 2.0 as an upgrade to its packaging co-design platform, using AI to assess chip-package interaction risks.

Its cloud-based e-Simulator combines material and simulation databases with design, analysis and manufacturing data to support predictive assessment.

The company describes a feedback loop between design and analysis that lets customers compare package configurations across mechanical, electrical and thermal domains.

Sources and details

ASE Unveils IDE 2.0 – AI-Enhanced Platform Accelerates Package Design Accuracy and Innovation | ASE Holdings

{
  "access_scope": "ASE announcement for Advanced Semiconductor Engineering, Inc., identified as a member of ASE Technology Holding Co., Ltd.; IDE 2.0 is a VIPack toolset. These are company descriptions, not independent validation of speed or accuracy, and subsidiary and holding-company identities remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "November 4, 2025",
    "retrieved_utc": "2026-10-08T06:09:25.338461+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 4, 2025"
  ],
  "id": "supply-org-025::S1",
  "title": "ASE Unveils IDE 2.0 – AI-Enhanced Platform Accelerates Package Design Accuracy and Innovation | ASE Holdings",
  "url": "https://www.aseglobal.com/press-room/ide2/"
}

ASE announcement for Advanced Semiconductor Engineering, Inc., identified as a member of ASE Technology Holding Co., Ltd.; IDE 2.0 is a VIPack toolset. These are company descriptions, not independent validation of speed or accuracy, and subsidiary and holding-company identities remain distinct.

ASE announcement for Advanced Semiconductor Engineering, Inc., identified as a member of ASE Technology Holding Co., Ltd.; IDE 2.0 is a VIPack toolset. These are company descriptions, not independent validation of speed or accuracy, and subsidiary and holding-company identities remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Celestica

Celestica’s 1.6T networking white paper examines how higher-capacity switches can reshape network fabrics for AI training clusters and hyperscale data centers.

It describes a flatter topology with fewer switching layers, so traffic reaches its destination through fewer hops.

The paper connects that design choice to the bandwidth and latency demands of east-west traffic in AI and high-performance computing clusters.

Sources and details

Executive Summary

{
  "access_scope": "Celestica-branded white paper, From 800G to 1.6T: Re-Architecting Hyperscale Networks for Next-Generation AI Clusters, pages 1 and 3; architecture reasoning and illustrative assumptions, not independently demonstrated training-time improvements. No individual author is listed on inspected pages.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:09:33.012722+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "supply-org-028::S1",
  "title": "Executive Summary",
  "url": "https://www.celestica.com/uploadedFiles/artifact/from-800g-to-1.6t-re-architecting-hyperscale-networks-for-next-generation-ai-clusters.pdf"
}

Celestica-branded white paper, From 800G to 1.6T: Re-Architecting Hyperscale Networks for Next-Generation AI Clusters, pages 1 and 3; architecture reasoning and illustrative assumptions, not independently demonstrated training-time improvements. No individual author is listed on inspected pages.

Celestica-branded white paper, From 800G to 1.6T: Re-Architecting Hyperscale Networks for Next-Generation AI Clusters, pages 1 and 3; architecture reasoning and illustrative assumptions, not independently demonstrated training-time improvements. No individual author is listed on inspected pages.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Dataiku

Dataiku’s developer guide organizes visual machine learning around an analysis containing a preparation script and one or more ML Tasks.

Each task trains either a prediction model for a single target variable or a clustering model, with settings for features, preprocessing, algorithms and validation.

The documented API can inspect trained models and deploy them as Saved Models in the Flow, where the usual DSS build mechanism can retrain them.

Sources and details

Visual Machine learning - Dataiku Developer Guide

{
  "access_scope": "Unbylined Dataiku Developer Guide API documentation for visual machine learning, cached from the mutable latest path; describes software operations, not benchmark results or a fixed numbered release.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:09:17.057336+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "organization-company-d588fdcbda220e::S1",
  "title": "Visual Machine learning - Dataiku Developer Guide",
  "url": "https://developer.dataiku.com/latest/concepts-and-examples/ml.html"
}

Unbylined Dataiku Developer Guide API documentation for visual machine learning, cached from the mutable latest path; describes software operations, not benchmark results or a fixed numbered release.

Unbylined Dataiku Developer Guide API documentation for visual machine learning, cached from the mutable latest path; describes software operations, not benchmark results or a fixed numbered release.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company history states 2013.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.dataiku.com/blog/the-dataiku-story",
        "https://www.dataiku.com/company/team/"
      ],
      "year": 2013
    }
  ]
}

Digital Realty

Digital Realty describes High-Density Colocation as infrastructure for AI and other workloads that require greater power density and advanced cooling.

The offering includes Air-Assisted Liquid Cooling and Direct Liquid Cooling options for power-dense deployments.

Its cached product page describes configurations beginning at 30 kW per cabinet and scaling to multi-megawatt deployments and up to 150 kW per cabinet.

Sources and details

High-Density Colocation | Digital Realty

{
  "access_scope": "Unbylined Digital Realty High-Density Colocation product description; capacity ranges and offering details are company statements for this cached page, not a guarantee for every site or an independently measured energy saving.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:09:38.370422+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "supply-org-036::S1",
  "title": "High-Density Colocation | Digital Realty ",
  "url": "https://www.digitalrealty.com/platform-digital/colocation/high-density-colocation"
}

Unbylined Digital Realty High-Density Colocation product description; capacity ranges and offering details are company statements for this cached page, not a guarantee for every site or an independently measured energy saving.

Unbylined Digital Realty High-Density Colocation product description; capacity ranges and offering details are company statements for this cached page, not a guarantee for every site or an independently measured energy saving.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Freeport-McMoRan

Freeport-McMoRan’s 2022 Climate Report describes digital twins that use machine learning to study equipment’s historical operation and give predictive instructions to operators.

The report says the company continued applying this technology to concentrators across its Americas operations to support throughput and efficiency.

It separately describes haul-truck operator scorecards that put cycle-time data in operators’ hands so they can adjust daily practices and improve the haulage cycle.

Sources and details

ENERGY & ASSET EFFICIENCY

{
  "access_scope": "Freeport-McMoRan Inc. is explicitly defined as FCX on PDF page 2; 2022 Climate Report pages 2 and 32. Historical company account, not the held 2025 sustainability report; scorecards are described separately and are not inferred to be the same machine-learning system. Efficiency and emissions effects are company-reported.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2022 reporting year",
    "retrieved_utc": "2026-10-08T06:09:39.807248+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022 reporting year"
  ],
  "id": "supply-org-050::S1",
  "title": "ENERGY & ASSET EFFICIENCY",
  "url": "https://www.fcx.com/sites/fcx/files/documents/sustainability/2022-Climate-Report.pdf"
}

Freeport-McMoRan Inc. is explicitly defined as FCX on PDF page 2; 2022 Climate Report pages 2 and 32. Historical company account, not the held 2025 sustainability report; scorecards are described separately and are not inferred to be the same machine-learning system. Efficiency and emissions effects are company-reported.

Freeport-McMoRan Inc. is explicitly defined as FCX on PDF page 2; 2022 Climate Report pages 2 and 32. Historical company account, not the held 2025 sustainability report; scorecards are described separately and are not inferred to be the same machine-learning system. Efficiency and emissions effects are company-reported.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Intel

Intel’s July 2025 Gaudi 3 technical paper describes an AI accelerator built from two identical compute dies linked over an interposer bridge.

Its heterogeneous architecture combines a Matrix Multiplication Engine with a programmable Tensor Processor Core cluster.

The paper assigns matrix-lowerable operations such as fully connected layers and convolutions to the matrix engine, while the tensor cores accelerate non-GEMM operations.

Sources and details

Intel® Gaudi® 3 AI Accelerator White Paper

{
  "access_scope": "Intel Gaudi 3 AI Accelerator Technical Paper, July 2025, V1 Rev. 3, pages 1 and 3; manufacturer architecture account, not independent comparison or a personal engineering attribution. No named author appears on inspected pages.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "July 2025; V1 Rev. 3",
    "retrieved_utc": "2026-10-08T06:09:16.580823+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2025; V1 Rev. 3"
  ],
  "id": "supply-org-003::S1",
  "title": "Intel® Gaudi® 3 AI Accelerator White Paper",
  "url": "https://cdrdv2-public.intel.com/817486/gaudi-3-ai-accelerator-white-paper.pdf"
}

Intel Gaudi 3 AI Accelerator Technical Paper, July 2025, V1 Rev. 3, pages 1 and 3; manufacturer architecture account, not independent comparison or a personal engineering attribution. No named author appears on inspected pages.

Intel Gaudi 3 AI Accelerator Technical Paper, July 2025, V1 Rev. 3, pages 1 and 3; manufacturer architecture account, not independent comparison or a personal engineering attribution. No named author appears on inspected pages.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Intel official history dates incorporation to July 18, 1968 and operations to August 1, 1968; initially N.M. Electronics.",
      "date": "1968",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.intel.com/content/www/us/en/history/virtual-vault/articles/intels-founding.html",
        "https://www.intel.com/content/www/us/en/products/details/processors/ai-accelerators/gaudi.html"
      ],
      "year": 1968
    }
  ]
}

Kaiber

Kaiber’s Canvas guide treats a multi-scene video as a sequence of shot planning, image creation, animation and editing.

It advises building one image for each shot and arranging those images as a storyboard before animating the scenes.

The workflow ends in Kaiber Editor, where creators sequence generated clips and add audio, trimming, transitions and text overlays.

Sources and details

How to Make a Video with Scenes in Kaiber Canvas - Kaiber

{
  "access_scope": "Kaiber help article credited in cached Article metadata to Christine Larsen, published April 28, 2026 and modified May 2, 2026. This describes the cached Canvas and Editor workflow, not the original beta, model ownership or demonstrated output quality.",
  "authors": [
    "Christine Larsen"
  ],
  "authors_in_source_order": [
    "Christine Larsen"
  ],
  "dates": {
    "inspected_source_date_1": "Published April 28, 2026; modified May 2, 2026",
    "retrieved_utc": "2026-10-08T06:09:17.593418+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published April 28, 2026; modified May 2, 2026"
  ],
  "id": "organization-company-106d3e4417575e::S1",
  "title": "How to Make a Video with Scenes in Kaiber Canvas  - Kaiber",
  "url": "https://helpcenter.kaiber.ai/articles/1232661-how-to-make-a-video-with-scenes-in-kaiber-canvas"
}

Kaiber help article credited in cached Article metadata to Christine Larsen, published April 28, 2026 and modified May 2, 2026. This describes the cached Canvas and Editor workflow, not the original beta, model ownership or demonstrated output quality.

Kaiber help article credited in cached Article metadata to Christine Larsen, published April 28, 2026 and modified May 2, 2026. This describes the cached Canvas and Editor workflow, not the original beta, model ownership or demonstrated output quality.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official May 2023 press release says founded in November 2022; prior Secret Garden venture is distinct.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.businesswire.com/news/home/20230523005728/en/Kaiber-Comes-Out-of-Beta-to-Enable-Artist-Creativity-and-Community",
        "https://kaiber.ai/"
      ],
      "year": 2022
    }
  ]
}

Sakana AI

Sakana AI’s Evolutionary Model Merge account describes searching for ways to combine existing foundation models instead of developing each model from scratch.

The method searches both data-flow space, which selects and combines layers, and parameter space, which mixes model weights.

The lab applies this approach to Japanese mathematical reasoning and vision-language models, using separate optimization and evaluation datasets in its language-model experiment.

Sources and details

Evolving New Foundation Models: Unleashing the Power of Automating Model Development

{
  "access_scope": "Sakana AI research blog describing its March 2024 release, with a January 28, 2025 Nature Machine Intelligence publication update. Lab-reported methods and experiments; original blog, later paper results and preliminary diffusion-model work remain distinct. No individual division of research tasks is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "March 2024 original release; January 28, 2025 publication update",
    "retrieved_utc": "2026-10-08T06:09:21.482703+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2024 original release; January 28, 2025 publication update"
  ],
  "id": "organization-ai-a58a8f75aaef03::S1",
  "title": "Evolving New Foundation Models: Unleashing the Power of Automating Model Development",
  "url": "https://sakana.ai/evolutionary-model-merge/"
}

Sakana AI research blog describing its March 2024 release, with a January 28, 2025 Nature Machine Intelligence publication update. Lab-reported methods and experiments; original blog, later paper results and preliminary diffusion-model work remain distinct. No individual division of research tasks is inferred.

Sakana AI research blog describing its March 2024 release, with a January 28, 2025 Nature Machine Intelligence publication update. Lab-reported methods and experiments; original blog, later paper results and preliminary diffusion-model work remain distinct. No individual division of research tasks is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

SMIC

SMIC’s 2024 Annual Report describes the group’s semiconductor foundry and technology services for customers using 8-inch and 12-inch wafers.

Its supporting services include design assistance, IP support and photomask manufacturing alongside the wafer-foundry business.

The report outlines a production path from small-batch trials through risk production, where samples are tested and processes improved, to mass production after delivery indicators meet the required standards.

Sources and details

ANNUAL REPORT

{
  "access_scope": "SMIC 2024 Annual Report, PDF pages 9, 19 and 20 (printed pages 7, 17 and 18); the definitions distinguish Semiconductor Manufacturing International Corporation from the group and its subsidiaries. Company-reported foundry workflow for 2024, not a claim about a specific AI chip or independently validated leading-edge process.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Reporting period January 1–December 31, 2024",
    "retrieved_utc": "2026-10-08T06:09:44.606140+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Reporting period January 1–December 31, 2024"
  ],
  "id": "supply-org-014::S1",
  "title": "ANNUAL REPORT",
  "url": "https://www.smics.com/uploads/67f6423d/e00981.pdf"
}

SMIC 2024 Annual Report, PDF pages 9, 19 and 20 (printed pages 7, 17 and 18); the definitions distinguish Semiconductor Manufacturing International Corporation from the group and its subsidiaries. Company-reported foundry workflow for 2024, not a claim about a specific AI chip or independently validated leading-edge process.

SMIC 2024 Annual Report, PDF pages 9, 19 and 20 (printed pages 7, 17 and 18); the definitions distinguish Semiconductor Manufacturing International Corporation from the group and its subsidiaries. Company-reported foundry workflow for 2024, not a claim about a specific AI chip or independently validated leading-edge process.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Christopher Nolan

Christopher Nolan is identified as the director of Interstellar in the DGA’s November 2014 account of screenings and discussions about the film.

The account describes a fictional Earth threatened by drought and famine, motivating explorers to seek another home for humanity.

A discovered break in space-time allows the story’s astronauts to travel through a wormhole, linking planetary survival to an interstellar expedition.

Sources and details

Christopher Nolan: Interstellar

{
  "access_scope": "DGA screening account dated November 16, 2014: director credit and fictional Interstellar premise only. It records Q&As with Frank Oz and Edgar Wright but supplies no making-of transcript; no personal AI engineering or unreported production method is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "November 16, 2014",
    "retrieved_utc": "2026-10-08T06:09:38.286546+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 16, 2014"
  ],
  "id": "creative-person-coverage-69a9ea145b814f::S1",
  "title": "Christopher Nolan: Interstellar",
  "url": "https://www.dga.org/Events/2015/Jan2015/Interstellar-QnA"
}

DGA screening account dated November 16, 2014: director credit and fictional Interstellar premise only. It records Q&As with Frank Oz and Edgar Wright but supplies no making-of transcript; no personal AI engineering or unreported production method is inferred.

DGA screening account dated November 16, 2014: director credit and fictional Interstellar premise only. It records Q&As with Frank Oz and Edgar Wright but supplies no making-of transcript; no personal AI engineering or unreported production method is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Cronenberg

David Cronenberg describes balancing the extreme images in his early Videodrome drafts against what audiences could accept as reality, in Tim Lucas’s production account.

He explains that even an impossible bodily effect could be grounded by restrained, realistic sound rather than exaggerated noises.

Lucas also documents continuing screenplay revisions during shooting and later changes through reshoots and editing, distinguishing the first draft from the finished film.

Sources and details

Medium Cruel: Reflections on Videodrome | Current | The Criterion Collection

{
  "access_scope": "Tim Lucas’s Criterion essay dated December 7, 2010, drawn from 1981–82 set observations and a production book; Cronenberg is quoted filmmaker and screenplay subject, not essay author. Fictional body horror, early drafts and final cut remain distinct; collaborators retain their own credits.",
  "authors": [
    "Tim Lucas"
  ],
  "authors_in_source_order": [
    "Tim Lucas"
  ],
  "dates": {
    "inspected_source_date_1": "December 7, 2010; observations in 1981–82",
    "retrieved_utc": "2026-10-08T06:09:38.204650+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 7, 2010; observations in 1981–82"
  ],
  "id": "creative-person-coverage-d4c7893918e284::S1",
  "title": "Medium Cruel: Reflections on Videodrome | Current | The Criterion Collection",
  "url": "https://www.criterion.com/current/posts/676-medium-cruel-reflections-on-videodrome"
}

Tim Lucas’s Criterion essay dated December 7, 2010, drawn from 1981–82 set observations and a production book; Cronenberg is quoted filmmaker and screenplay subject, not essay author. Fictional body horror, early drafts and final cut remain distinct; collaborators retain their own credits.

Tim Lucas’s Criterion essay dated December 7, 2010, drawn from 1981–82 set observations and a production book; Cronenberg is quoted filmmaker and screenplay subject, not essay author. Fictional body horror, early drafts and final cut remain distinct; collaborators retain their own credits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean-Luc Godard

Jean-Luc Godard’s Alphaville is interpreted by critic Andrew Sarris as a science-fiction film that builds its future from contemporary Paris rather than special effects.

Sarris connects the impersonal architecture to the film’s conflict between imagination and logic in a fictional computer-controlled society.

The essay also describes nocturnal settings, enclosed spaces and camera movement as part of Godard’s use of imagery drawn from earlier cinema.

Sources and details

Alphaville | Current | The Criterion Collection

{
  "access_scope": "Andrew Sarris’s Criterion essay, October 19, 1998, about the 1965 film; attributed critical interpretation rather than Godard’s own statement or evidence of real AI capability. Writer, director, performers and fictional computer-controlled society are separate roles.",
  "authors": [
    "Andrew Sarris"
  ],
  "authors_in_source_order": [
    "Andrew Sarris"
  ],
  "dates": {
    "inspected_source_date_1": "October 19, 1998; film 1965",
    "retrieved_utc": "2026-10-08T06:09:36.871187+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 19, 1998; film 1965"
  ],
  "id": "creative-person-coverage-c55a80c3856d22::S1",
  "title": "Alphaville | Current | The Criterion Collection",
  "url": "https://www.criterion.com/current/posts/38-alphaville"
}

Andrew Sarris’s Criterion essay, October 19, 1998, about the 1965 film; attributed critical interpretation rather than Godard’s own statement or evidence of real AI capability. Writer, director, performers and fictional computer-controlled society are separate roles.

Andrew Sarris’s Criterion essay, October 19, 1998, about the 1965 film; attributed critical interpretation rather than Godard’s own statement or evidence of real AI capability. Writer, director, performers and fictional computer-controlled society are separate roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Rain

Douglas Rain voices the fictional HAL 9000 in 2001: A Space Odyssey, as identified in David Parkinson’s BFI discussion of the film’s music.

The account connects HAL’s rendition of Daisy Bell during memory deactivation to a retreat toward a childhood-like state.

Parkinson describes the voice deepening and the words becoming indistinct, interpreting the scene as eliciting pity for a machine that has taken human life.

Sources and details

A history of 1960s British cinema in 10 songs | BFI

{
  "access_scope": "David Parkinson’s BFI essay, published June 22, 2026, discussing the 1968 film’s Daisy Bell scene. Rain’s voice credit is explicit; vocal changes and emotional effect are the critic’s scene analysis, not evidence of Rain’s technical processing decisions or real sentient AI.",
  "authors": [
    "David Parkinson"
  ],
  "authors_in_source_order": [
    "David Parkinson"
  ],
  "dates": {
    "inspected_source_date_1": "June 22, 2026; film 1968",
    "retrieved_utc": "2026-10-08T06:09:27.478157+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 22, 2026; film 1968"
  ],
  "id": "creative-person-coverage-34228b2ff7bb62::S1",
  "title": "A history of 1960s British cinema in 10 songs | BFI",
  "url": "https://www.bfi.org.uk/lists/history-1960s-british-cinema-10-songs"
}

David Parkinson’s BFI essay, published June 22, 2026, discussing the 1968 film’s Daisy Bell scene. Rain’s voice credit is explicit; vocal changes and emotional effect are the critic’s scene analysis, not evidence of Rain’s technical processing decisions or real sentient AI.

David Parkinson’s BFI essay, published June 22, 2026, discussing the 1968 film’s Daisy Bell scene. Rain’s voice credit is explicit; vocal changes and emotional effect are the critic’s scene analysis, not evidence of Rain’s technical processing decisions or real sentient AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Nolan

Jonathan Nolan describes developing Westworld with Lisa Joy around the perspectives of its fictional artificially intelligent hosts, building on a suggestion from J.J. Abrams.

In Ann Farmer’s interview, he says the hidden meanings in the narrative were intended to place viewers alongside protagonists who did not understand their own world.

He also reports testing actors’ blinking and smiling at high speed to explore shifts between machine-like and human-like behavior, while crediting the cast’s own performances.

Sources and details

Art of Darkness | Television Academy

{
  "access_scope": "Ann Farmer’s Television Academy interview, May 11, 2017, with jointly credited writer–executive producers Nolan and Joy about season one and future plans. Statements attributed to Nolan do not assign him sole authorship; fictional hosts and filmed performance tests are not real AI development.",
  "authors": [
    "Ann Farmer"
  ],
  "authors_in_source_order": [
    "Ann Farmer"
  ],
  "dates": {
    "inspected_source_date_1": "May 11, 2017",
    "retrieved_utc": "2026-10-08T06:09:45.590892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 11, 2017"
  ],
  "id": "creative-person-coverage-383ce5ec2e3add::S1",
  "title": "Art of Darkness | Television Academy",
  "url": "https://www.televisionacademy.com/features/news/features/art-darkness"
}

Ann Farmer’s Television Academy interview, May 11, 2017, with jointly credited writer–executive producers Nolan and Joy about season one and future plans. Statements attributed to Nolan do not assign him sole authorship; fictional hosts and filmed performance tests are not real AI development.

Ann Farmer’s Television Academy interview, May 11, 2017, with jointly credited writer–executive producers Nolan and Joy about season one and future plans. Statements attributed to Nolan do not assign him sole authorship; fictional hosts and filmed performance tests are not real AI development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charlie Kaufman

Charlie Kaufman’s 2011 BAFTA and BFI lecture presents writing as a process that begins with uncertainty rather than the posture of an expert.

Recalling his work on Get a Life, he describes the limits of imitating Adam Resnick’s voice and argues for finding a setting where he could develop his own.

He treats a screenplay as movement through time: it is written over time, expresses passing time and is experienced over time by an audience.

Sources and details

Screenwriters On Screenwriting.

{
  "access_scope": "Charlie Kaufman’s September 30, 2011 lecture transcript, PDF pages 1–3, hosted by BAFTA. First-person craft reflection, not the held Sarajevo masterclass or a claim about generative AI; the earlier show’s creator and writing roles remain explicit.",
  "authors": [
    "Charlie Kaufman"
  ],
  "authors_in_source_order": [
    "Charlie Kaufman"
  ],
  "dates": {
    "inspected_source_date_1": "September 30, 2011",
    "retrieved_utc": "2026-10-08T06:09:22.156186+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 30, 2011"
  ],
  "id": "creative-person-coverage-c3f24a17ea9be4::S1",
  "title": "Screenwriters On Screenwriting.",
  "url": "https://static.bafta.org/uploads_pre_202411/transcripts/30_sept_2011_screenwriters_lecture_by_charlie_kaufman_0.pdf"
}

Charlie Kaufman’s September 30, 2011 lecture transcript, PDF pages 1–3, hosted by BAFTA. First-person craft reflection, not the held Sarajevo masterclass or a claim about generative AI; the earlier show’s creator and writing roles remain explicit.

Charlie Kaufman’s September 30, 2011 lecture transcript, PDF pages 1–3, hosted by BAFTA. First-person craft reflection, not the held Sarajevo masterclass or a claim about generative AI; the earlier show’s creator and writing roles remain explicit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph Gordon-Levitt

Joseph Gordon-Levitt’s December 2025 announcement frames the Creators Coalition on AI as a way to unite entertainment workers and creators across the wider digital economy.

He credits Daniel Kwan with sparking the effort and describes a constituency extending beyond performers to skilled workers, podcasters, newsletter writers and other creators.

The proposed approach combines public pressure and collective action with possible litigation and eventual legislation, rather than treating technology alone as the central problem.

Sources and details

Announcing the Creators' Coalition on AI

{
  "access_scope": "Authored Joe’s Journal transcript dated December 16, 2025 announcing a new collective effort; advocacy proposals and Gordon-Levitt’s viewpoints, not enacted policy, realized outcomes or the held 2023 residuals article. Daniel Kwan and collective participants retain separate roles.",
  "authors": [
    "Joseph Gordon-Levitt"
  ],
  "authors_in_source_order": [
    "Joseph Gordon-Levitt"
  ],
  "dates": {
    "inspected_source_date_1": "December 16, 2025",
    "retrieved_utc": "2026-10-08T06:09:19.339958+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 16, 2025"
  ],
  "id": "creative-person-coverage-cf37e8b06b3d42::S1",
  "title": "Announcing the Creators' Coalition on AI",
  "url": "https://journal.hitrecord.org/p/announcing-the-creators-coalition"
}

Authored Joe’s Journal transcript dated December 16, 2025 announcing a new collective effort; advocacy proposals and Gordon-Levitt’s viewpoints, not enacted policy, realized outcomes or the held 2023 residuals article. Daniel Kwan and collective participants retain separate roles.

Authored Joe’s Journal transcript dated December 16, 2025 announcing a new collective effort; advocacy proposals and Gordon-Levitt’s viewpoints, not enacted policy, realized outcomes or the held 2023 residuals article. Daniel Kwan and collective participants retain separate roles.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Woods

James Woods plays Max Renn, the television executive seeking increasingly disturbing material in Videodrome, as explicitly identified in Stephen Dalton’s BFI feature.

Dalton characterizes Woods’s performance as restless and volatile, contrasting it with Debbie Harry’s controlled portrayal of Nicki Brand.

That contrast sits within the film’s fictional relationship between Renn and Brand, which draws the executive into conspiracies and hallucinations around mediated violence.

Sources and details

Finest hours: Debbie Harry as the kinky therapist in Videodrome | BFI

{
  "access_scope": "Stephen Dalton’s July 1, 2025 BFI critical feature, primarily about Debbie Harry, supplies explicit Woods-to-Renn casting and a performance comparison. Interpretation and fictional plot only; Harry’s preparation and Cronenberg’s decisions are not reassigned to Woods, and no personal AI contribution is claimed.",
  "authors": [
    "Stephen Dalton"
  ],
  "authors_in_source_order": [
    "Stephen Dalton"
  ],
  "dates": {
    "inspected_source_date_1": "July 1, 2025; film 1983",
    "retrieved_utc": "2026-10-08T06:09:26.612413+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 1, 2025; film 1983"
  ],
  "id": "creative-person-coverage-1baabce0589d27::S1",
  "title": "Finest hours: Debbie Harry as the kinky therapist in Videodrome | BFI",
  "url": "https://www.bfi.org.uk/features/finest-hours-debbie-harry-kinky-therapist-videodrome"
}

Stephen Dalton’s July 1, 2025 BFI critical feature, primarily about Debbie Harry, supplies explicit Woods-to-Renn casting and a performance comparison. Interpretation and fictional plot only; Harry’s preparation and Cronenberg’s decisions are not reassigned to Woods, and no personal AI contribution is claimed.

Stephen Dalton’s July 1, 2025 BFI critical feature, primarily about Debbie Harry, supplies explicit Woods-to-Renn casting and a performance comparison. Interpretation and fictional plot only; Harry’s preparation and Cronenberg’s decisions are not reassigned to Woods, and no personal AI contribution is claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rod Serling

Rod Serling’s Ithaca College profile links his television writing to criticism of war, prejudice and corporate business through strong visual images and believable characters.

It describes conflicts with networks and sponsors over censorship as part of his transition from live drama to the filmed series The Twilight Zone.

The institutional account identifies him as the series’ host throughout its run and the writer of 92 of its 156 scripts, distinguishing those roles from the contributions of other writers.

Sources and details

About Rod Serling | Ithaca College

{
  "access_scope": "Unbylined Ithaca College historical profile of Serling and its archive; attributed institutional account and specific writing/hosting counts. No episode-specific robot mechanism, sole authorship of every script or real-world AI engineering is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "The Twilight Zone original run 1959–64",
    "retrieved_utc": "2026-10-08T06:09:41.919773+00:00"
  },
  "dates_exact_in_source_role_order": [
    "The Twilight Zone original run 1959–64"
  ],
  "id": "creative-person-coverage-1906095d88b03a::S1",
  "title": "About Rod Serling | Ithaca College",
  "url": "https://www.ithaca.edu/node/45197"
}

Unbylined Ithaca College historical profile of Serling and its archive; attributed institutional account and specific writing/hosting counts. No episode-specific robot mechanism, sole authorship of every script or real-world AI engineering is inferred.

Unbylined Ithaca College historical profile of Serling and its archive; attributed institutional account and specific writing/hosting counts. No episode-specific robot mechanism, sole authorship of every script or real-world AI engineering is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Refik Anadol

Refik Anadol’s studio account describes Machine Hallucination in New York as a cinematic experiment that reimagines urban photographic memories through machine learning.

For the Artechouse installation, it reports using more than 100 million publicly available New York images to form a multidimensional data universe.

The resulting work is presented as a 30-minute experimental cinema that speculates about the city’s future rather than documenting its present.

Sources and details

Machine Hallucination - Refik Anadol

{
  "access_scope": "Artist/studio project account for Machine Hallucination — NYC at Artechouse, September 5, 2019–February 5, 2020; distinct from the held Nature Dreams work. Dataset scale and process are studio-reported; listed collaborators, Kerim Karaoglu’s sound design and commissioning roles remain separate. Machine dreams are artistic framing, not sentience.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "September 5, 2019–February 5, 2020",
    "retrieved_utc": "2026-10-08T06:09:20.403517+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 5, 2019–February 5, 2020"
  ],
  "id": "creative-person-coverage-1066cc11c2552c::S1",
  "title": "Machine Hallucination - Refik Anadol",
  "url": "https://refikanadol.com/works/machine-hallucination/"
}

Artist/studio project account for Machine Hallucination — NYC at Artechouse, September 5, 2019–February 5, 2020; distinct from the held Nature Dreams work. Dataset scale and process are studio-reported; listed collaborators, Kerim Karaoglu’s sound design and commissioning roles remain separate. Machine dreams are artistic framing, not sentience.

Artist/studio project account for Machine Hallucination — NYC at Artechouse, September 5, 2019–February 5, 2020; distinct from the held Nature Dreams work. Dataset scale and process are studio-reported; listed collaborators, Kerim Karaoglu’s sound design and commissioning roles remain separate. Machine dreams are artistic framing, not sentience.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Cheng

Ian Cheng’s Emissaries trilogy is described by Serpentine Galleries as computer-generated simulations whose flora and fauna recombine in open-ended narratives.

The museum account explains that agents receive behavioral drives but are left to evolve within virtual ecosystems of indefinite duration.

It frames the works as a way for viewers to encounter unpredictable change, confusion and cognitive dissonance rather than follow a fixed authored plot.

Sources and details

Ian Cheng: Emissaries - Serpentine Galleries

{
  "access_scope": "Unbylined hosting-institution account for Serpentine’s April 24–May 28, 2018 presentation of the 2015–17 trilogy. Artistic simulated agents and the museum’s interpretation, not a scientific demonstration of consciousness or real-world autonomous capability; publication contributors retain separate credits.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Trilogy 2015–17; exhibition April 24–May 28, 2018",
    "retrieved_utc": "2026-10-08T06:09:43.640753+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Trilogy 2015–17; exhibition April 24–May 28, 2018"
  ],
  "id": "creative-person-coverage-8022b4b1e64ea3::S1",
  "title": "Ian Cheng: Emissaries - Serpentine Galleries",
  "url": "https://www.serpentinegalleries.org/whats-on/ian-cheng-emissaries/"
}

Unbylined hosting-institution account for Serpentine’s April 24–May 28, 2018 presentation of the 2015–17 trilogy. Artistic simulated agents and the museum’s interpretation, not a scientific demonstration of consciousness or real-world autonomous capability; publication contributors retain separate credits.

Unbylined hosting-institution account for Serpentine’s April 24–May 28, 2018 presentation of the 2015–17 trilogy. Artistic simulated agents and the museum’s interpretation, not a scientific demonstration of consciousness or real-world autonomous capability; publication contributors retain separate credits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Syd Mead

Syd Mead’s ArtCenter archive preserves 419 sketches, drawings and paintings made during his Transportation Design studies from 1956 to 1959.

Its description traces car studies from rough pencil sketches to crayon and gouache renderings, noting handwritten specifications that reveal attention to design detail.

The archive identifies futuristic vehicle studies as precursors to Mead’s later U.S. Steel illustrations and film concept drawings, while distinguishing them from the later professional work.

Sources and details

Syd Mead artwork -

{
  "access_scope": "ArtCenter Archives collection SPEC 156, Syd Mead artwork, explicitly linking Mead, Syd to Sydney Jay Mead. Institutional interpretation of student materials created 1956–1959, not direct evidence that these drawings were used in later films or personally implemented AI systems.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Collection creation 1956–1959",
    "retrieved_utc": "2026-10-08T06:09:16.580138+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Collection creation 1956–1959"
  ],
  "id": "creative-person-coverage-5d32edad4856b8::S1",
  "title": "Syd Mead artwork - ",
  "url": "https://archives.artcenter.edu/syd-mead-artwork"
}

ArtCenter Archives collection SPEC 156, Syd Mead artwork, explicitly linking Mead, Syd to Sydney Jay Mead. Institutional interpretation of student materials created 1956–1959, not direct evidence that these drawings were used in later films or personally implemented AI systems.

ArtCenter Archives collection SPEC 156, Syd Mead artwork, explicitly linking Mead, Syd to Sydney Jay Mead. Institutional interpretation of student materials created 1956–1959, not direct evidence that these drawings were used in later films or personally implemented AI systems.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mœbius (Jean Giraud)

Mœbius, explicitly identified by Humanoids as Jean Giraud, collaborated with Jodorowsky on The Black Incal, the opening volume of the series later titled The Incal.

The publisher’s chronology distinguishes that graphic collaboration from their earlier Dune film project, for which Mœbius was asked to create storyboards before the production fell apart.

It also places his conceptual work for Alien and storyboards for Time Masters and Tron within a career that moved between comics and cinematic design.

Sources and details

Mœbius

{
  "access_scope": "Unbylined Humanoids creator chronology explicitly binding Mœbius and Jean Giraud; publisher account of joint creation and separately named design/storyboard roles. The unproduced Dune adaptation is distinct from published comics, and no individual AI-development task or exclusive writing authorship is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Incal opening volume dated 1980 in source chronology",
    "retrieved_utc": "2026-10-08T06:09:40.870413+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Incal opening volume dated 1980 in source chronology"
  ],
  "id": "creative-person-coverage-1dc9599795954b::S1",
  "title": "Mœbius",
  "url": "https://www.humanoids.com/y_user/author?nickname=Moebius"
}

Unbylined Humanoids creator chronology explicitly binding Mœbius and Jean Giraud; publisher account of joint creation and separately named design/storyboard roles. The unproduced Dune adaptation is distinct from published comics, and no individual AI-development task or exclusive writing authorship is inferred.

Unbylined Humanoids creator chronology explicitly binding Mœbius and Jean Giraud; publisher account of joint creation and separately named design/storyboard roles. The unproduced Dune adaptation is distinct from published comics, and no individual AI-development task or exclusive writing authorship is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Trumbull

Douglas Trumbull recalls helping create the experiential quality of 2001: A Space Odyssey by solving visual problems involving miniatures and the Stargate sequence.

In Karen Jaehne’s interview, he connects that approach to Kubrick’s wish for audiences to experience the film directly rather than merely watch a conventional story.

He also contrasts the delicate images achievable with miniatures, optics and photography with the computer-graphics results attempted during Close Encounters of the Third Kind.

Sources and details

Douglas Trumbull on creating sci-fi classics | Sight and Sound

{
  "access_scope": "Karen Jaehne interview first published Spring 1985 in Sight and Sound and republished by BFI February 10, 2022. Trumbull’s retrospective testimony about collaborative visual-effects work, not sole film authorship, a current comparison of graphics technology or actual AI engineering.",
  "authors": [
    "Karen Jaehne"
  ],
  "authors_in_source_order": [
    "Karen Jaehne"
  ],
  "dates": {
    "inspected_source_date_1": "Original interview Spring 1985; BFI republication February 10, 2022",
    "retrieved_utc": "2026-10-08T06:09:29.113357+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original interview Spring 1985; BFI republication February 10, 2022"
  ],
  "id": "creative-person-coverage-088460abaccffe::S1",
  "title": "Douglas Trumbull on creating sci-fi classics | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/interviews/douglas-trumbull-creating-sci-fi-classics"
}

Karen Jaehne interview first published Spring 1985 in Sight and Sound and republished by BFI February 10, 2022. Trumbull’s retrospective testimony about collaborative visual-effects work, not sole film authorship, a current comparison of graphics technology or actual AI engineering.

Karen Jaehne interview first published Spring 1985 in Sight and Sound and republished by BFI February 10, 2022. Trumbull’s retrospective testimony about collaborative visual-effects work, not sole film authorship, a current comparison of graphics technology or actual AI engineering.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mark Zuckerberg

Mark Zuckerberg’s July 2024 essay argues that an open AI ecosystem lets developers adapt models and avoid dependence on a single closed vendor.

He connects that position to training, fine-tuning and distilling models for different needs, as well as running models on infrastructure controlled by the user.

The essay presents Meta’s release of Llama 3.1 models as part of a broader ecosystem strategy involving cloud services, inference tools and enterprise adoption partners.

Sources and details

Open Source AI is the Path Forward

{
  "access_scope": "Meta essay explicitly credited to Mark Zuckerberg, Founder and CEO, July 23, 2024, with January 27, 2025 modification metadata. Executive arguments and release announcement, not personal model-training work or independently established claims about safety, frontier ranking or cost.",
  "authors": [
    "Mark Zuckerberg"
  ],
  "authors_in_source_order": [
    "Mark Zuckerberg"
  ],
  "dates": {
    "inspected_source_date_1": "Published July 23, 2024; modified January 27, 2025",
    "retrieved_utc": "2026-10-08T06:09:16.580482+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published July 23, 2024; modified January 27, 2025"
  ],
  "id": "ai-contribution-person-coverage-a0dec2f1a2f4d4::S1",
  "title": "Open Source AI is the Path Forward",
  "url": "https://about.fb.com/news/2024/07/open-source-ai-is-the-path-forward/amp/"
}

Meta essay explicitly credited to Mark Zuckerberg, Founder and CEO, July 23, 2024, with January 27, 2025 modification metadata. Executive arguments and release announcement, not personal model-training work or independently established claims about safety, frontier ranking or cost.

Meta essay explicitly credited to Mark Zuckerberg, Founder and CEO, July 23, 2024, with January 27, 2025 modification metadata. Executive arguments and release announcement, not personal model-training work or independently established claims about safety, frontier ranking or cost.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

inverse problems

Inverse problems work backward from observed data or a desired function to a model or design that could produce it.

The Harvard research overview emphasizes that constraints such as physical laws, noise robustness and symmetry help shape possible solutions, but may still leave multiple answers.

Its examples connect scientific explanation and engineering design with perception, where sensory cues must be used to infer their distant physical origins.

Sources and details

Inverse Problems

{
  "access_scope": "Institutional research overview, not a complete mathematical definition or claim that every inverse problem lacks a unique solution. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:10:21.191754+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "inverse_problems::S1",
  "title": "Inverse Problems",
  "url": "https://softmath.seas.harvard.edu/research/inverse-problems/"
}

Institutional research overview, not a complete mathematical definition or claim that every inverse problem lacks a unique solution. Canonical baseline and existing source, identity and rights holds remain.

Institutional research overview, not a complete mathematical definition or claim that every inverse problem lacks a unique solution. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Perceptron

Rosenblatt’s historical perceptron model treats retained information as connections and associations that influence later responses, rather than as directly reconstructable images.

It is introduced as a hypothetical nervous system or machine for examining properties of intelligent systems without assuming the detailed biology of a particular organism.

The opening places recognition and generalization within a broader inquiry into how sensed information is stored and how that storage changes behavior.

Sources and details

The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain

{
  "access_scope": "1958 historical theoretical model; only introductory printed pages 386–387, PDF pages 1–2. Not the modern single-layer algorithm definition, training-rule audit or proof of biological equivalence. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "F. Rosenblatt"
  ],
  "authors_in_source_order": [
    "F. Rosenblatt"
  ],
  "dates": {
    "inspected_source_date_1": "1958",
    "retrieved_utc": "2026-10-08T05:51:16.428026+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1958"
  ],
  "id": "concept-tech-Perceptron::S1",
  "title": "The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain",
  "url": "https://homepages.math.uic.edu/~lreyzin/papers/rosenblatt58.pdf"
}

1958 historical theoretical model; only introductory printed pages 386–387, PDF pages 1–2. Not the modern single-layer algorithm definition, training-rule audit or proof of biological equivalence. Canonical baseline and existing source, identity and rights holds remain.

1958 historical theoretical model; only introductory printed pages 386–387, PDF pages 1–2. Not the modern single-layer algorithm definition, training-rule audit or proof of biological equivalence. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Algorithmic bias

NIST’s 2022 account treats AI bias as a socio-technical problem that extends beyond statistical properties of datasets and algorithms.

It distinguishes systemic, statistical and human sources of bias, directing attention to institutions and decision-making as well as computation.

Its preliminary mitigation framework groups challenges around datasets, testing and evaluation, and human factors, while warning that zero bias risk is unattainable.

Sources and details

Towards a Standard for Identifying and Managing Bias in Artificial Intelligence

{
  "access_scope": "NIST Special Publication 1270, March 2022 executive summary; preliminary guidance towards a standard, not an enacted legal rule, system certification or a present-day standards audit. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Reva Schwartz",
    "Apostol Vassilev",
    "Kristen Greene",
    "Lori Perine",
    "Andrew Burt",
    "Patrick Hall"
  ],
  "authors_in_source_order": [
    "Reva Schwartz",
    "Apostol Vassilev",
    "Kristen Greene",
    "Lori Perine",
    "Andrew Burt",
    "Patrick Hall"
  ],
  "dates": {
    "inspected_source_date_1": "March 2022",
    "retrieved_utc": "2026-10-08T06:10:19.382521+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2022"
  ],
  "id": "concept-tech-AlgorithmicBias::S1",
  "title": "Towards a Standard for Identifying and Managing Bias in Artificial Intelligence",
  "url": "https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.Sp.1270.pdf"
}

NIST Special Publication 1270, March 2022 executive summary; preliminary guidance towards a standard, not an enacted legal rule, system certification or a present-day standards audit. Canonical baseline and existing source, identity and rights holds remain.

NIST Special Publication 1270, March 2022 executive summary; preliminary guidance towards a standard, not an enacted legal rule, system certification or a present-day standards audit. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bayesian network

A Bayesian network represents random variables with a directed acyclic graph and defines their joint distribution through local conditional distributions.

Each node’s local distribution conditions on the values of its parents, so the graph makes the model’s dependency structure explicit.

The joint distribution is the product of those local distributions, allowing a large probabilistic model to be specified one variable at a time.

Sources and details

Lecture 13: Bayesian networks I

{
  "access_scope": "Stanford CS221 Spring 2019 lecture definition and notes, PDF pages 29–30; mathematical representation only, no automatic causal interpretation or origin attribution. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Charikar",
    "Sadigh"
  ],
  "authors_in_source_order": [
    "Charikar",
    "Sadigh"
  ],
  "dates": {
    "inspected_source_date_1": "Spring 2019",
    "retrieved_utc": "2026-10-08T06:10:21.605944+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spring 2019"
  ],
  "id": "concept-tech-BayesianNetwork::S1",
  "title": "Lecture 13: Bayesian networks I",
  "url": "https://web.stanford.edu/class/archive/cs/cs221/cs221.1196/lectures/bayes1.pdf"
}

Stanford CS221 Spring 2019 lecture definition and notes, PDF pages 29–30; mathematical representation only, no automatic causal interpretation or origin attribution. Canonical baseline and existing source, identity and rights holds remain.

Stanford CS221 Spring 2019 lecture definition and notes, PDF pages 29–30; mathematical representation only, no automatic causal interpretation or origin attribution. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Symbolic AI

Newell and Simon’s symbol-system account describes intelligent activity through systems that manipulate symbolic expressions.

Their physical symbol system hypothesis proposes that such systems supply the necessary and sufficient means for general intelligent action, subject to limits of speed and complexity.

They frame that proposition as an empirical hypothesis to be assessed through evidence from the natural world.

Sources and details

Computer Science as Empirical Inquiry: Symbols and Search

{
  "access_scope": "Institutional HTML reproduction of a historical Newell–Simon argument; a strand of symbolic AI rather than an exhaustive definition. Hypothesis is attributed, not established universal consensus. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "authors_in_source_order": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T05:51:20.781957+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "concept-tech-SymbolicAI::S1",
  "title": "Computer Science as Empirical Inquiry: Symbols and Search",
  "url": "https://web.cs.wpi.edu/~nth/cs534/papers_worth_reading/Computer_Science_as_Empirical_Inquiry.htm"
}

Institutional HTML reproduction of a historical Newell–Simon argument; a strand of symbolic AI rather than an exhaustive definition. Hypothesis is attributed, not established universal consensus. Canonical baseline and existing source, identity and rights holds remain.

Institutional HTML reproduction of a historical Newell–Simon argument; a strand of symbolic AI rather than an exhaustive definition. Hypothesis is attributed, not established universal consensus. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gustafson–Barsis law

Gustafson’s formulation evaluates parallel speedup using the serial share measured in the total execution time on multiple processors.

Shi’s 1996 analysis distinguishes that share from Amdahl’s serial percentage measured on one processor, warning that confusing them leads to misleading comparisons.

The paper argues that translating between the two definitions yields equivalent formulations and emphasizes comparing serial and parallel programs that perform the same computational steps.

Sources and details

Reevaluating Amdahl’s Law and Gustafson’s Law

{
  "access_scope": "Yuan Shi’s October 1996 reevaluation of Gustafson and Amdahl, not Gustafson’s original paper or a universal empirical speedup guarantee; equivalence is the inspected paper’s attributed analysis. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Yuan Shi"
  ],
  "authors_in_source_order": [
    "Yuan Shi"
  ],
  "dates": {
    "inspected_source_date_1": "October 1996",
    "retrieved_utc": "2026-10-08T06:10:18.391140+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 1996"
  ],
  "id": "concept-law-gustafson::S1",
  "title": "Reevaluating Amdahl’s Law and Gustafson’s Law",
  "url": "https://cis.temple.edu/~shi/wwwroot/shi/public_html/docs/amdahl/amdahl.html"
}

Yuan Shi’s October 1996 reevaluation of Gustafson and Amdahl, not Gustafson’s original paper or a universal empirical speedup guarantee; equivalence is the inspected paper’s attributed analysis. Canonical baseline and existing source, identity and rights holds remain.

Yuan Shi’s October 1996 reevaluation of Gustafson and Amdahl, not Gustafson’s original paper or a universal empirical speedup guarantee; equivalence is the inspected paper’s attributed analysis. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wright’s law

Wright’s airplane-cost study relates increasing production quantity to falling average labor costs, presenting the relationship as a curve estimated from manufacturing experience.

Its eighty-percent labor curve means that doubling the quantity reduces average labor cost to eighty percent of its previous level.

The study connects those savings with worker proficiency, tooling and the spreading of setup effort, while treating materials and overhead as separate cost components.

Sources and details

Factors Affecting the Cost of Airplanes

{
  "access_scope": "T. P. Wright, February 1936 aircraft-production study, inspected printed pages 122–125; historical eighty-percent labor curve, not a universal twenty-percent reduction for all technologies or a price forecast. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "T. P. Wright"
  ],
  "authors_in_source_order": [
    "T. P. Wright"
  ],
  "dates": {
    "inspected_source_date_1": "February 1936",
    "retrieved_utc": "2026-10-08T06:10:19.437790+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 1936"
  ],
  "id": "concept-law-wright::S1",
  "title": "Factors Affecting the Cost of Airplanes",
  "url": "https://pdodds.w3.uvm.edu/research/papers/others/1936/wright1936a.pdf"
}

T. P. Wright, February 1936 aircraft-production study, inspected printed pages 122–125; historical eighty-percent labor curve, not a universal twenty-percent reduction for all technologies or a price forecast. Canonical baseline and existing source, identity and rights holds remain.

T. P. Wright, February 1936 aircraft-production study, inspected printed pages 122–125; historical eighty-percent labor curve, not a universal twenty-percent reduction for all technologies or a price forecast. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Metcalfe’s law

Metcalfe’s law links network value to the potential interconnections among its users, rather than simply to audience size.

The inspected 2023 paper describes an equal-node-value model in which each user can connect with the others, giving value approximately quadratic growth with the number of users.

It contrasts that pairwise connection model with linear broadcasting and exponential group formation, showing that the chosen interaction structure changes the proposed scaling relationship.

Sources and details

Revisiting Network Value: Sublinear Knowledge Law

{
  "access_scope": "Later 2023 preprint summary and comparison, arXiv 2304.14084 version 1; not the origin paper or universal empirical validation of network prices. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "authors_in_source_order": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "dates": {
    "inspected_source_date_1": "27 April 2023, arXiv version 1",
    "retrieved_utc": "2026-10-08T06:10:17.815876+00:00"
  },
  "dates_exact_in_source_role_order": [
    "27 April 2023, arXiv version 1"
  ],
  "id": "concept-law-metcalfe::S1",
  "title": "Revisiting Network Value: Sublinear Knowledge Law",
  "url": "https://arxiv.org/pdf/2304.14084"
}

Later 2023 preprint summary and comparison, arXiv 2304.14084 version 1; not the origin paper or universal empirical validation of network prices. Canonical baseline and existing source, identity and rights holds remain.

Later 2023 preprint summary and comparison, arXiv 2304.14084 version 1; not the origin paper or universal empirical validation of network prices. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reed’s law

Reed’s law concerns group-forming networks, where possible subgroups provide value beyond individual users or pairs of connections.

The inspected paper counts groups with at least two members as two to the power of the participant count, minus the empty set and the single-member groups.

It associates that combinatorial growth with exponential group value, but cautions that the model can overestimate value when the proliferation of groups exceeds human cognitive limits.

Sources and details

Revisiting Network Value: Sublinear Knowledge Law

{
  "access_scope": "Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; possible-group count is not proof that every subgroup supplies usable or equal economic value. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "authors_in_source_order": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "dates": {
    "inspected_source_date_1": "27 April 2023, arXiv version 1",
    "retrieved_utc": "2026-10-08T06:10:17.815876+00:00"
  },
  "dates_exact_in_source_role_order": [
    "27 April 2023, arXiv version 1"
  ],
  "id": "concept-law-reed::S1",
  "title": "Revisiting Network Value: Sublinear Knowledge Law",
  "url": "https://arxiv.org/pdf/2304.14084"
}

Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; possible-group count is not proof that every subgroup supplies usable or equal economic value. Canonical baseline and existing source, identity and rights holds remain.

Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; possible-group count is not proof that every subgroup supplies usable or equal economic value. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sarnoff’s law

Sarnoff’s law models broadcasting value as proportional to the number of audience members.

The inspected paper explains the linear model through one-way communication: adding viewers enlarges reach without creating communication among those viewers.

It contrasts that audience-based model with pairwise interconnection and group-forming networks, separating three different proposed sources of network value.

Sources and details

Revisiting Network Value: Sublinear Knowledge Law

{
  "access_scope": "Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; not a Sarnoff origin document, verified historical date or universal revenue prediction. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "authors_in_source_order": [
    "Xinbing Wang",
    "Luoyi Fu",
    "Huquan Kang",
    "Zhouyang Jin",
    "Lei Zhou",
    "Chenghu Zhou"
  ],
  "dates": {
    "inspected_source_date_1": "27 April 2023, arXiv version 1",
    "retrieved_utc": "2026-10-08T06:10:17.815876+00:00"
  },
  "dates_exact_in_source_role_order": [
    "27 April 2023, arXiv version 1"
  ],
  "id": "concept-law-sarnoff::S1",
  "title": "Revisiting Network Value: Sublinear Knowledge Law",
  "url": "https://arxiv.org/pdf/2304.14084"
}

Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; not a Sarnoff origin document, verified historical date or universal revenue prediction. Canonical baseline and existing source, identity and rights holds remain.

Later 2023 preprint summary, arXiv 2304.14084 version 1, pages 1–2; not a Sarnoff origin document, verified historical date or universal revenue prediction. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Goodhart’s law

Goodhart’s law warns that optimizing a measured proxy can damage its usefulness as a representation of the intended goal.

The inspected 2025 preprint abstract studies that problem without assuming independence between the goal and the discrepancy separating it from the proxy.

Its reported results distinguish light-tailed discrepancies from a heavy-tailed case, indicating that the relationship between proxy and goal matters when characterizing over-optimization.

Sources and details

The Strong, Weak and Benign Goodhart’s law. An independence-free and paradigm-agnostic formalisation

{
  "access_scope": "Abstract of a later mathematical formalization, arXiv 2505.23445 version 2 revised 4 September 2025; not Goodhart’s original statement, full theorem audit or a universal inevitability claim. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Adrien Majka",
    "El-Mahdi El-Mhamdi"
  ],
  "authors_in_source_order": [
    "Adrien Majka",
    "El-Mahdi El-Mhamdi"
  ],
  "dates": {
    "citation_date": "2025/05/29",
    "inspected_revision": "Thu, 4 Sep 2025 15:25:45 UTC (69 KB)",
    "inspected_source_date_1": "29 May 2025 initial submission; 4 September 2025 version 2",
    "retrieved_utc": "2026-10-08T06:10:17.815401+00:00",
    "version": "arXiv v2"
  },
  "dates_exact_in_source_role_order": [
    "29 May 2025 initial submission; 4 September 2025 version 2"
  ],
  "id": "concept-law-goodhart::S1",
  "title": "The Strong, Weak and Benign Goodhart’s law. An independence-free and paradigm-agnostic formalisation",
  "url": "https://arxiv.org/abs/2505.23445",
  "version_url": "https://arxiv.org/abs/2505.23445v2"
}

Abstract of a later mathematical formalization, arXiv 2505.23445 version 2 revised 4 September 2025; not Goodhart’s original statement, full theorem audit or a universal inevitability claim. Canonical baseline and existing source, identity and rights holds remain.

Abstract of a later mathematical formalization, arXiv 2505.23445 version 2 revised 4 September 2025; not Goodhart’s original statement, full theorem audit or a universal inevitability claim. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Campbell’s law

Campbell argues that using a quantitative social indicator for consequential decisions increases pressure to manipulate it and can distort the activity it is meant to monitor.

His examples include crime-clearance incentives that encourage changes in recording or classification, showing how apparent performance can improve without the underlying outcome improving.

He also describes test-based educational incentives that turn teaching toward particular test items, reducing the scores’ value as indicators of broader competence.

Sources and details

Assessing the Impact of Planned Social Change

{
  "access_scope": "Campbell’s 1976 paper in a February 2011 permitted reprint; selected printed pages 34–35. Attributed social-evaluation warning supported there mainly by anecdotal illustrations, not a mathematical theorem or present-day policy/legal guidance. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Donald T. Campbell"
  ],
  "authors_in_source_order": [
    "Donald T. Campbell"
  ],
  "dates": {
    "inspected_source_date_1": "December 1976 original paper; February 2011 reprint",
    "retrieved_utc": "2026-10-08T06:10:18.521148+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 1976 original paper; February 2011 reprint"
  ],
  "id": "concept-law-campbell::S1",
  "title": "Assessing the Impact of Planned Social Change",
  "url": "https://jmde.com/index.php/jmde_1/article/download/297/292/988"
}

Campbell’s 1976 paper in a February 2011 permitted reprint; selected printed pages 34–35. Attributed social-evaluation warning supported there mainly by anecdotal illustrations, not a mathematical theorem or present-day policy/legal guidance. Canonical baseline and existing source, identity and rights holds remain.

Campbell’s 1976 paper in a February 2011 permitted reprint; selected printed pages 34–35. Attributed social-evaluation warning supported there mainly by anecdotal illustrations, not a mathematical theorem or present-day policy/legal guidance. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Moravec’s paradox

Moravec’s account contrasts computers’ success at explicit reasoning tasks with their difficulty perceiving and manipulating the physical world.

His historical examples separate chess programs supplied with keyboard moves from unreliable robots tasked with finding and moving physical chess pieces.

He explains the disparity in evolutionary terms: perception and movement developed over long periods, whereas abstract reasoning is a comparatively recent human skill.

Sources and details

The Age of Robots

{
  "access_scope": "Hans Moravec’s June 1993 author essay and historical explanation; no present-day robotics performance claim, validated evolutionary proof or adoption of the essay’s future forecasts. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Hans Moravec"
  ],
  "authors_in_source_order": [
    "Hans Moravec"
  ],
  "dates": {
    "inspected_source_date_1": "June 1993",
    "retrieved_utc": "2026-10-08T06:10:18.508521+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 1993"
  ],
  "id": "concept-law-moravec::S1",
  "title": "The Age of Robots",
  "url": "https://frc.ri.cmu.edu/~hpm/project.archive/general.articles/1993/Robot93.html"
}

Hans Moravec’s June 1993 author essay and historical explanation; no present-day robotics performance claim, validated evolutionary proof or adoption of the essay’s future forecasts. Canonical baseline and existing source, identity and rights holds remain.

Hans Moravec’s June 1993 author essay and historical explanation; no present-day robotics performance claim, validated evolutionary proof or adoption of the essay’s future forecasts. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Landauer’s principle

Landauer’s principle links information processing with thermodynamic cost, including the minimum energy dissipated when a bit is erased.

The inspected later study extends the discussion to non-equilibrium quantum processes, separating contributions from system–environment correlations and changes in the environment.

Its experiment uses an ultracold Bose-gas quantum field simulator to track those contributions after a mass quench.

Sources and details

Experimentally probing Landauer’s principle in the quantum many-body regime

{
  "access_scope": "2025 Nature Physics study abstract and opening explanation; later experimental treatment, not Landauer’s 1961 origin paper or independent replication/full experimental audit. Online publication 5 June 2025 differs from August 2025 issue date. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Stefan Aimet",
    "Mohammadamin Tajik",
    "Gabrielle Tournaire",
    "Philipp Schüttelkopf",
    "João Sabino",
    "Spyros Sotiriadis",
    "Giacomo Guarnieri",
    "Jörg Schmiedmayer",
    "Jens Eisert"
  ],
  "authors_in_source_order": [
    "Stefan Aimet",
    "Mohammadamin Tajik",
    "Gabrielle Tournaire",
    "Philipp Schüttelkopf",
    "João Sabino",
    "Spyros Sotiriadis",
    "Giacomo Guarnieri",
    "Jörg Schmiedmayer",
    "Jens Eisert"
  ],
  "dates": {
    "citation_publication_date": "2025/08",
    "inspected_source_date_1": "5 June 2025 online; August 2025 issue",
    "retrieved_utc": "2026-10-08T06:10:22.786336+00:00"
  },
  "dates_exact_in_source_role_order": [
    "5 June 2025 online; August 2025 issue"
  ],
  "id": "concept-law-landauer::S1",
  "title": "Experimentally probing Landauer’s principle in the quantum many-body regime",
  "url": "https://www.nature.com/articles/s41567-025-02930-9"
}

2025 Nature Physics study abstract and opening explanation; later experimental treatment, not Landauer’s 1961 origin paper or independent replication/full experimental audit. Online publication 5 June 2025 differs from August 2025 issue date. Canonical baseline and existing source, identity and rights holds remain.

2025 Nature Physics study abstract and opening explanation; later experimental treatment, not Landauer’s 1961 origin paper or independent replication/full experimental audit. Online publication 5 June 2025 differs from August 2025 issue date. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Shannon–Hartley theorem

The Shannon–Hartley capacity relation bounds the information rate of a bandwidth-limited channel with white thermal noise and limited average transmitter power.

Shannon’s theorem expresses capacity as bandwidth multiplied by the base-two logarithm of one plus the signal-to-noise power ratio, yielding bits per second.

Under those assumptions, suitable encoding can make errors arbitrarily rare at the limiting rate, while any higher rate retains a positive error frequency.

Sources and details

A Mathematical Theory of Communication

{
  "access_scope": "Shannon’s corrected reprint of the 1948 paper, Theorem 17 on PDF page 43; theoretical white-noise and average-power assumptions, not a claim about every practical channel or finite implementation. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "C. E. Shannon"
  ],
  "authors_in_source_order": [
    "C. E. Shannon"
  ],
  "dates": {
    "inspected_source_date_1": "July and October 1948 original journal publication",
    "retrieved_utc": "2026-10-08T06:10:19.748441+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July and October 1948 original journal publication"
  ],
  "id": "concept-law-shannon-hartley::S1",
  "title": "A Mathematical Theory of Communication",
  "url": "https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf"
}

Shannon’s corrected reprint of the 1948 paper, Theorem 17 on PDF page 43; theoretical white-noise and average-power assumptions, not a claim about every practical channel or finite implementation. Canonical baseline and existing source, identity and rights holds remain.

Shannon’s corrected reprint of the 1948 paper, Theorem 17 on PDF page 43; theoretical white-noise and average-power assumptions, not a claim about every practical channel or finite implementation. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Martec’s Law

Martec’s Law frames a management gap between rapidly changing technology and organizations that can absorb changes in behavior and culture only gradually.

The author uses exponential and logarithmic curves as an approximate contrast, emphasizing limits on how many changes an organization can productively adopt at once.

His response is to prioritize changes that fit strategy, improve organizational adaptability and occasionally consider a larger reset when incremental change is insufficient.

Sources and details

Martec’s Law: the greatest management challenge of the 21st century

{
  "access_scope": "Author’s management heuristic and proposed responses in a chiefmartec article, not a precisely calibrated mathematical law, universal empirical rate or guarantee that the advice works. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:10:17.815984+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "concept-law-martec::S1",
  "title": "Martec’s Law: the greatest management challenge of the 21st century",
  "url": "https://chiefmartec.com/2016/11/martecs-law-great-management-challenge-21st-century/"
}

Author’s management heuristic and proposed responses in a chiefmartec article, not a precisely calibrated mathematical law, universal empirical rate or guarantee that the advice works. Canonical baseline and existing source, identity and rights holds remain.

Author’s management heuristic and proposed responses in a chiefmartec article, not a precisely calibrated mathematical law, universal empirical rate or guarantee that the advice works. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lindy Effect

The Lindy effect describes a tendency for entities with longer past lifetimes to have longer expected futures, but its applicability depends on the category and lifetime model.

Ord’s analysis distinguishes broad age-related increases in remaining lifetime from narrower formulations that equate future lifetime with current age.

It argues that uncertainty over hazard rates can generate the effect even when individual rates are constant or increasing, so observed persistence need not mean each entity is becoming more robust.

Sources and details

The Lindy Effect

{
  "access_scope": "Toby Ord’s later mathematical analysis, selected PDF pages 1 and 3; not universal survival prediction or evidence that all old technologies remain useful. No original discovery attribution asserted. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Toby Ord"
  ],
  "authors_in_source_order": [
    "Toby Ord"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:10:17.815642+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "concept-law-lindy::S1",
  "title": "The Lindy Effect",
  "url": "https://arxiv.org/pdf/2308.09045"
}

Toby Ord’s later mathematical analysis, selected PDF pages 1 and 3; not universal survival prediction or evidence that all old technologies remain useful. No original discovery attribution asserted. Canonical baseline and existing source, identity and rights holds remain.

Toby Ord’s later mathematical analysis, selected PDF pages 1 and 3; not universal survival prediction or evidence that all old technologies remain useful. No original discovery attribution asserted. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hebb’s Postulate

Hebb’s postulate links synaptic strengthening to coordinated activity, rather than treating repeated input alone as sufficient.

The inspected 1986 hippocampal-slice study reports that repetitive postsynaptic spiking enabled enhancement at synapses active concurrently on the presynaptic side.

The authors describe the underlying electrogenic mechanism as involving processes unknown to Hebb, separating their later physiological finding from the original postulate.

Sources and details

Hebbian synapses in hippocampus

{
  "access_scope": "Later 1986 empirical paper abstract about hippocampal slices, not Hebb’s original 1949 text, a general rule for every synapse or a full experimental replication audit. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "S. R. Kelso",
    "A. H. Ganong",
    "T. H. Brown"
  ],
  "authors_in_source_order": [
    "S. R. Kelso",
    "A. H. Ganong",
    "T. H. Brown"
  ],
  "dates": {
    "citation_publication_date": "1986 Jul",
    "inspected_source_date_1": "July 1986",
    "retrieved_utc": "2026-10-08T06:10:20.961685+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 1986"
  ],
  "id": "concept-law-hebb::S1",
  "title": "Hebbian synapses in hippocampus",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC323944/"
}

Later 1986 empirical paper abstract about hippocampal slices, not Hebb’s original 1949 text, a general rule for every synapse or a full experimental replication audit. Canonical baseline and existing source, identity and rights holds remain.

Later 1986 empirical paper abstract about hippocampal slices, not Hebb’s original 1949 text, a general rule for every synapse or a full experimental replication audit. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Price’s Square-Root Law

The inspected later paper treats Price’s square-root law as a conjecture and constructs an exact probabilistic formulation named the Price distribution.

Its abstract relates that distribution to Lotka’s and Zipf’s laws, placing the conjecture within a broader study of publication-productivity distributions.

The authors report finding no empirical support for using the Price distribution as a model of publication productivity, distinguishing a formal construction from established applicability.

Sources and details

Price distribution. An exact formulation of Price’s square root law

{
  "access_scope": "Glänzel and Schubert’s March 1985 publisher abstract only; later formulation rather than Price’s original account. No invented square-root formula or universal productivity claim; subscription full text was not inspected. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "W. Glänzel",
    "A. Schubert"
  ],
  "authors_in_source_order": [
    "W. Glänzel",
    "A. Schubert"
  ],
  "dates": {
    "citation_publication_date": "1985/03",
    "inspected_source_date_1": "March 1985",
    "retrieved_utc": "2026-10-08T06:10:18.590805+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 1985"
  ],
  "id": "concept-law-price::S1",
  "title": "Price distribution. An exact formulation of Price’s square root law",
  "url": "https://link.springer.com/article/10.1007/BF02017147"
}

Glänzel and Schubert’s March 1985 publisher abstract only; later formulation rather than Price’s original account. No invented square-root formula or universal productivity claim; subscription full text was not inspected. Canonical baseline and existing source, identity and rights holds remain.

Glänzel and Schubert’s March 1985 publisher abstract only; later formulation rather than Price’s original account. No invented square-root formula or universal productivity claim; subscription full text was not inspected. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fitts’s Law

Fitts’s Law models pointing time using the ratio between the distance to a target and its size: farther or smaller targets impose greater difficulty.

The inspected MIT teaching account combines reaction and movement time with a logarithmic index of difficulty, and applies the model to mouse pointing on a screen.

It distinguishes pointing from steering through a narrow tunnel, where the separate steering model grows linearly with the distance-to-width ratio.

Sources and details

Efficiency

{
  "access_scope": "MIT Spring 2016 instructional explanation and model, not Fitts’s original experiment or a universal device/user calibration; steering is a distinct task and law. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Spring 2016 course manifestation",
    "retrieved_utc": "2026-10-08T06:10:21.495260+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spring 2016 course manifestation"
  ],
  "id": "concept-law-fitts::S1",
  "title": "Efficiency",
  "url": "https://web.mit.edu/6.813/www/sp16/classes/04-efficiency/"
}

MIT Spring 2016 instructional explanation and model, not Fitts’s original experiment or a universal device/user calibration; steering is a distinct task and law. Canonical baseline and existing source, identity and rights holds remain.

MIT Spring 2016 instructional explanation and model, not Fitts’s original experiment or a universal device/user calibration; steering is a distinct task and law. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gibrat’s Law

Gibrat’s law concerns proportionate growth; the inspected city study examines it across the full city-size distribution rather than only its largest-city tail.

Using Census 2000 data, the paper reports a lognormal distribution for the complete range, distinguishing that result from a Pareto description of the upper tail.

Its proposed equilibrium explanation combines random local productivity with worker mobility, linking proportional growth to a particular urban-economic model.

Sources and details

Gibrat’s Law for (All) Cities

{
  "access_scope": "Jan Eeckhout’s December 2004 American Economic Review abstract; later application to cities, not Gibrat’s origin statement, proof for every firm/city or present-day census result. Canonical baseline and existing source, identity and rights holds remain.",
  "authors": [
    "Jan Eeckhout"
  ],
  "authors_in_source_order": [
    "Jan Eeckhout"
  ],
  "dates": {
    "citation_publication_date": "2004/12",
    "inspected_source_date_1": "December 2004; Census 2000 observations",
    "retrieved_utc": "2026-10-08T06:10:21.788646+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 2004; Census 2000 observations"
  ],
  "id": "concept-law-gibrat::S1",
  "title": "Gibrat’s Law for (All) Cities",
  "url": "https://www.aeaweb.org/articles?id=10.1257/0002828043052303"
}

Jan Eeckhout’s December 2004 American Economic Review abstract; later application to cities, not Gibrat’s origin statement, proof for every firm/city or present-day census result. Canonical baseline and existing source, identity and rights holds remain.

Jan Eeckhout’s December 2004 American Economic Review abstract; later application to cities, not Gibrat’s origin statement, proof for every firm/city or present-day census result. Canonical baseline and existing source, identity and rights holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alastair Reynolds

Alastair Reynolds’s novels explore encounters with other intelligences, from slower-than-light travel in Revelation Space to tensions between human and robot metacivilisations in House of Suns.

His Poseidon’s Children trilogy follows a spacefaring African family across centuries, with the individual volumes intended to stand on their own.

In The Medusa Chronicles, co-written with Stephen Baxter, Howard Falcon becomes an uneasy intermediary in a future of conflict between human and robotic forces.

Sources and details

Novels | Alastair Reynolds

{
  "access_scope": "Author-site retrospective; selected Alastair Reynolds. The Medusa Chronicles is explicitly credited 'with Stephen Baxter'; no ordered title-page author list was inspected. Fictional premises only; captured retrospective dates and plans are not asserted as current.",
  "authors": [
    "Alastair Reynolds"
  ],
  "authors_in_source_order": [
    "Alastair Reynolds"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:17:17.037061+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-a83c6d56c51592::S1",
  "title": "Novels | Alastair Reynolds",
  "url": "https://www.alastairreynolds.com/novels/"
}

Author-site retrospective; selected Alastair Reynolds. The Medusa Chronicles is explicitly credited 'with Stephen Baxter'; no ordered title-page author list was inspected. Fictional premises only; captured retrospective dates and plans are not asserted as current.

Author-site retrospective; selected Alastair Reynolds. The Medusa Chronicles is explicitly credited 'with Stephen Baxter'; no ordered title-page author list was inspected. Fictional premises only; captured retrospective dates and plans are not asserted as current.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ambrose Bierce

Ambrose Bierce’s Moxon’s Master turns a debate about whether machines can think into a disturbing encounter with an automaton chess player.

After Moxon announces checkmate, the narrator sees the machine attack its inventor and grip his throat before the scene gives way to unconsciousness.

The narrator’s eventual doubt about what he witnessed leaves the story’s apparent mechanical violence entangled with uncertainty about perception and belief.

Sources and details

Can Such Things Be?, by Ambrose Bierce—A Project Gutenberg eBook

{
  "access_scope": "Project Gutenberg's Can Such Things Be? manifestation; selected Ambrose Bierce, sole credited collection author. Complete Moxon’s Master story inspected, beginning through final retrospective doubt; fictional narration is not evidence of actual machine consciousness.",
  "authors": [
    "Ambrose Bierce"
  ],
  "authors_in_source_order": [
    "Ambrose Bierce"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:17.286884+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-0f38fcdb2db867::S1",
  "title": "Can Such Things Be?, by Ambrose Bierce—A Project Gutenberg eBook",
  "url": "https://www.gutenberg.org/cache/epub/4366/pg4366-images.html#page88"
}

Project Gutenberg's Can Such Things Be? manifestation; selected Ambrose Bierce, sole credited collection author. Complete Moxon’s Master story inspected, beginning through final retrospective doubt; fictional narration is not evidence of actual machine consciousness.

Project Gutenberg's Can Such Things Be? manifestation; selected Ambrose Bierce, sole credited collection author. Complete Moxon’s Master story inspected, beginning through final retrospective doubt; fictional narration is not evidence of actual machine consciousness.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Babbage

Charles Babbage’s Analytical Engine is described in Menabrea’s memoir, translated and annotated by Ada Lovelace, as a machine whose operations can follow prepared instructions rather than repeated manual intervention.

The design separates a calculating mill from a store of numbers, moving values between them as a calculation requires.

Operation cards specify arithmetic steps while variable cards identify the columns involved, adapting the control idea of the Jacquard loom to mathematical work.

Sources and details

Sketch of The Analytical Engine

{
  "access_scope": "Fourmilab HTML manifestation of Menabrea's Analytical Engine memoir and Lovelace's translation/notes; selected Charles Babbage is explicitly credited as inventor, not source author. Original memoir author L. F. Menabrea; translator/annotator Ada Augusta, Countess of Lovelace. Proposed design descriptions, not a claim of a completed operating engine.",
  "authors": [
    "L. F. Menabrea"
  ],
  "authors_in_source_order": [
    "L. F. Menabrea"
  ],
  "dates": {
    "inspected_source_date_1": "1842",
    "retrieved_utc": "2026-10-07T18:02:37.268095+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1842"
  ],
  "id": "person-charlesbabbage::S1",
  "title": "Sketch of The Analytical Engine",
  "url": "https://www.fourmilab.ch/babbage/sketch.html"
}

Fourmilab HTML manifestation of Menabrea's Analytical Engine memoir and Lovelace's translation/notes; selected Charles Babbage is explicitly credited as inventor, not source author. Original memoir author L. F. Menabrea; translator/annotator Ada Augusta, Countess of Lovelace. Proposed design descriptions, not a claim of a completed operating engine.

Fourmilab HTML manifestation of Menabrea's Analytical Engine memoir and Lovelace's translation/notes; selected Charles Babbage is explicitly credited as inventor, not source author. Original memoir author L. F. Menabrea; translator/annotator Ada Augusta, Countess of Lovelace. Proposed design descriptions, not a claim of a completed operating engine.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jason Aspiotis

Jason Aspiotis, identified as Axiom Space’s global director of in-space data and security, describes a planned orbital data-center node that would expand computing capacity aboard the International Space Station.

His quotation explains that commercial optical terminals would connect the station’s computing hardware to satellites in a mesh network.

He presents the project as part of a distributed, interoperable network of orbital nodes serving compatible spacecraft, with at least three nodes planned by 2027.

Sources and details

Axiom Space, Spacebilt Announce Orbital Data Center Node Aboard International Space Station

{
  "access_scope": "Axiom Space press release dated September 16, 2025; selected Jason Aspiotis is a quoted spokesperson, not sole engineer or article author. Company partnership credits and future plans remain announcement claims; no assertion that the 2027 configuration has already been deployed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2025-09-16",
    "retrieved_utc": "2026-10-07T18:10:51.282188+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2025-09-16"
  ],
  "id": "person-coverage-0501af6161e543::S1",
  "title": "Axiom Space, Spacebilt Announce Orbital Data Center Node Aboard International Space Station",
  "url": "https://axiomspace.com/release/axiom-space-spacebilt-announce-orbital-data-center-node"
}

Axiom Space press release dated September 16, 2025; selected Jason Aspiotis is a quoted spokesperson, not sole engineer or article author. Company partnership credits and future plans remain announcement claims; no assertion that the 2027 configuration has already been deployed.

Axiom Space press release dated September 16, 2025; selected Jason Aspiotis is a quoted spokesperson, not sole engineer or article author. Company partnership credits and future plans remain announcement claims; no assertion that the 2027 configuration has already been deployed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean Mary Zarate

Jean Mary Zarate introduces Tales from the Synapse as a Nature Careers podcast made with Nature Neuroscience, bringing brain scientists’ careers, collaborations and research into public discussion.

The Anil Seth episode explores his interdisciplinary study of consciousness, including his account of perception as the brain’s informed interpretation of sensory signals.

Seth’s discussion extends that account to the experience of self and its connection to the living body; Zarate’s credited role is introducing and closing the episode rather than originating those claims.

Sources and details

Marvelling at the mystery of consciousness through a scientific lens | Nature

{
  "access_scope": "Nature's published episode transcript; selected Jean Mary Zarate is the introducing/closing host and a senior editor at Nature Neuroscience. Anil Seth supplies the substantive scientific account; Don Byrne is credited as producer. Speaker roles are separate, with no research contribution assigned to the host.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:40.724020+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-b57d1caf789f63::S1",
  "title": "Marvelling at the mystery of consciousness through a scientific lens | Nature",
  "url": "https://www.nature.com/articles/d41586-023-00545-9"
}

Nature's published episode transcript; selected Jean Mary Zarate is the introducing/closing host and a senior editor at Nature Neuroscience. Anil Seth supplies the substantive scientific account; Don Byrne is credited as producer. Speaker roles are separate, with no research contribution assigned to the host.

Nature's published episode transcript; selected Jean Mary Zarate is the introducing/closing host and a senior editor at Nature Neuroscience. Anil Seth supplies the substantive scientific account; Don Byrne is credited as producer. Speaker roles are separate, with no research contribution assigned to the host.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mark Zuckerberg

In his Meta essay, Zuckerberg argues that openly available AI models let organizations adapt models to their own data and avoid dependence on a single closed provider.

He connects that position with Meta’s need for an ecosystem of tools, hardware optimizations and integrations that a company cannot build alone.

His argument also distinguishes Meta’s business from selling access to models, presenting openness as compatible with the company’s revenue model rather than simply surrendering an advantage.

Sources and details

Open Source AI is the Path Forward

{
  "access_scope": "Authored Meta advocacy essay, July 2024 with a January 2025 date also shown; stated reasoning rather than independently verified model performance, safety or forecast. Source-era founder/CEO byline is not a fresh role verification. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "Mark Zuckerberg"
  ],
  "authors_in_source_order": [
    "Mark Zuckerberg"
  ],
  "dates": {
    "inspected_source_date_1": "23 July 2024; 27 January 2025 date also displayed",
    "retrieved_utc": "2026-10-08T06:17:11.518453+00:00"
  },
  "dates_exact_in_source_role_order": [
    "23 July 2024; 27 January 2025 date also displayed"
  ],
  "id": "person-coverage-a0dec2f1a2f4d4::S1",
  "title": "Open Source AI is the Path Forward",
  "url": "https://about.fb.com/news/2024/07/open-source-ai-is-the-path-forward/"
}

Authored Meta advocacy essay, July 2024 with a January 2025 date also shown; stated reasoning rather than independently verified model performance, safety or forecast. Source-era founder/CEO byline is not a fresh role verification. Original canonical identity, source, rights and version holds remain.

Authored Meta advocacy essay, July 2024 with a January 2025 date also shown; stated reasoning rather than independently verified model performance, safety or forecast. Source-era founder/CEO byline is not a fresh role verification. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maziar Raissi

Raissi’s institutional profile describes a lab that combines scientific computing with AI and builds physical first principles into data-driven models.

Its focus on physics-informed neural networks embeds laws represented by ordinary and partial differential equations, linking learning with constraints such as conservation of mass, energy and momentum.

The profile places that approach between traditional numerical methods and machine learning, with applications spanning computational modeling, biomedical science and engineering.

Sources and details

Maziar Raissi | Interdisciplinary Center for Data-driven Modeling in Biology

{
  "access_scope": "UC Riverside institutional lab summary associated with the named person, not an individual task ledger, empirical accuracy validation or full paper audit; affiliations stay source-specific. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:14.062271+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-8e320eca101130::S1",
  "title": "Maziar Raissi | Interdisciplinary Center for Data-driven Modeling in Biology",
  "url": "https://icqmb.ucr.edu/maziar-raissi"
}

UC Riverside institutional lab summary associated with the named person, not an individual task ledger, empirical accuracy validation or full paper audit; affiliations stay source-specific. Original canonical identity, source, rights and version holds remain.

UC Riverside institutional lab summary associated with the named person, not an individual task ledger, empirical accuracy validation or full paper audit; affiliations stay source-specific. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael C. Jensen

The Rochester retrospective identifies Jensen’s collaboration with William Meckling on a model of conflicts between company owners and the executives they hire.

It explains their argument that managerial ownership can align executives’ incentives with shareholders’ interests, connecting agency costs to ownership structure.

The account follows that reasoning into Jensen’s later work with Kevin Murphy on executive compensation, including their concern that stock options were added to existing pay rather than replacing other compensation.

Sources and details

Michael Jensen ‘transformed the way we perceive and practice economics’

{
  "access_scope": "Institutional memorial/retrospective, including attributed summaries of jointly authored research; not the original papers, an endorsement of compensation policy or individual sole authorship. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1976 joint paper; April 2024 citation snapshot in source",
    "retrieved_utc": "2026-10-08T06:17:26.623675+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1976 joint paper; April 2024 citation snapshot in source"
  ],
  "id": "person-michaelcjensen::S1",
  "title": "Michael Jensen ‘transformed the way we perceive and practice economics’",
  "url": "https://www.rochester.edu/newscenter/economist-michael-jensen-theory-of-the-firm-tribute-601412/"
}

Institutional memorial/retrospective, including attributed summaries of jointly authored research; not the original papers, an endorsement of compensation policy or individual sole authorship. Original canonical identity, source, rights and version holds remain.

Institutional memorial/retrospective, including attributed summaries of jointly authored research; not the original papers, an endorsement of compensation policy or individual sole authorship. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Morris Chang

In his SEMI oral history, Chang explains the pure-play foundry model as a way to build on Taiwan’s potential manufacturing strength while avoiding weaknesses in chip design and product marketing.

He recalls drawing on the idea that design could be separated from fabrication, while distinguishing that insight from an explicit proposal to create a foundry.

He also describes the uncertainty over customers when the fabless industry was still small, making the business model’s market risk central to his account.

Sources and details

Oral History Interview: Morris Chang | SEMI

{
  "access_scope": "Historical first-person oral history, not independent verification of every recollection or a present-day company assessment; introductory chairman/CEO roles are interview-era statements. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:27.359643+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-morrischang::S1",
  "title": "Oral History Interview: Morris Chang | SEMI",
  "url": "https://www.semi.org/en/Oral-History-Interview-Morris-Chang"
}

Historical first-person oral history, not independent verification of every recollection or a present-day company assessment; introductory chairman/CEO roles are interview-era statements. Original canonical identity, source, rights and version holds remain.

Historical first-person oral history, not independent verification of every recollection or a present-day company assessment; introductory chairman/CEO roles are interview-era statements. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Muhammad Salar Khan

Khan’s RIT profile situates his research at the intersection of science and technology policy, AI ethics and economic development.

It highlights responsible AI adoption in the public sector, including questions of equity, explainability and use in developing economies.

The profile connects those interests with his comparative research on innovation and development, alongside work on clean-energy transition and public-interest technology.

Sources and details

Muhammad Salar Khan | RIT

{
  "access_scope": "Institutional research-interest profile, not policy outcome validation or attribution of a funded project’s individual technical tasks; displayed appointments remain source-era information. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:26.502001+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-81e35a84de9921::S1",
  "title": "Muhammad Salar Khan | RIT",
  "url": "https://www.rit.edu/directory/mskgpt-muhammad-salar-khan"
}

Institutional research-interest profile, not policy outcome validation or attribution of a funded project’s individual technical tasks; displayed appointments remain source-era information. Original canonical identity, source, rights and version holds remain.

Institutional research-interest profile, not policy outcome validation or attribution of a funded project’s individual technical tasks; displayed appointments remain source-era information. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mœbius (Jean Giraud)

Fondation Cartier’s exhibition account identifies Jean Giraud as the artist known under the names Gir and Mœbius, and organizes its account of his work around metamorphosis.

It describes changing landscapes and characters across his comics and film projects as a way of exploring imaginary worlds whose appearances are unstable.

The same institutional account credits his collaborations with Jean-Michel Charlier on Blueberry and Alejandro Jodorowsky on L’Incal, keeping those comics’ joint authorship explicit.

Sources and details

Mœbius-Transe-Forme | Fondation Cartier pour l’art contemporain

{
  "access_scope": "Original English paraphrase of the institution’s French exhibition text; 2010–2011 exhibition manifestation, not a full career audit. Conflicting one-day header/body exhibition ranges remain unasserted; aliases are explicit source credits and do not trigger identity merges. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2010–2011 exhibition context",
    "retrieved_utc": "2026-10-08T06:17:21.623620+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2010–2011 exhibition context"
  ],
  "id": "person-coverage-1dc9599795954b::S1",
  "title": "Mœbius-Transe-Forme | Fondation Cartier pour l’art contemporain",
  "url": "https://www.fondationcartier.com/programme/exposition/moebius-transe-forme"
}

Original English paraphrase of the institution’s French exhibition text; 2010–2011 exhibition manifestation, not a full career audit. Conflicting one-day header/body exhibition ranges remain unasserted; aliases are explicit source credits and do not trigger identity merges. Original canonical identity, source, rights and version holds remain.

Original English paraphrase of the institution’s French exhibition text; 2010–2011 exhibition manifestation, not a full career audit. Conflicting one-day header/body exhibition ranges remain unasserted; aliases are explicit source credits and do not trigger identity merges. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nan Laird

The 2021 International Prize in Statistics account recognizes Laird’s work on methods for analyzing longitudinal studies that repeatedly collect data from the same participants.

It connects that work with random-effects modeling, addressing individual differences while handling sparse observations in long-running studies.

It identifies Jim Ware as her collaborator on the 1982 framework and describes methods that accommodate missing or irregularly timed measurements, linking the statistical theory to practical study data.

Sources and details

International Prize in Statistics Awarded to Nan Laird for Methods of Analyzing Data from Longitudinal Studies

{
  "access_scope": "Prize organization’s March 2021 account of research impact, not an independent usage ranking, sole-author credit for all methods or fresh appointment verification. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "23 March 2021 award announcement; 1982 methods discussed",
    "retrieved_utc": "2026-10-08T06:17:19.526730+00:00"
  },
  "dates_exact_in_source_role_order": [
    "23 March 2021 award announcement; 1982 methods discussed"
  ],
  "id": "person-coverage-8bbbaa259f1775::S1",
  "title": "International Prize in Statistics Awarded to Nan Laird for Methods of Analyzing Data from Longitudinal Studies",
  "url": "https://statprize.org/2021/03/23/international-prize-in-statistics-awarded-to-nan-laird-for-methods-of-analyzing-data-from-longitudinal-studies/"
}

Prize organization’s March 2021 account of research impact, not an independent usage ranking, sole-author credit for all methods or fresh appointment verification. Original canonical identity, source, rights and version holds remain.

Prize organization’s March 2021 account of research impact, not an independent usage ranking, sole-author credit for all methods or fresh appointment verification. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neville Bethel

Cell Press’s interview includes Bethel in a joint account of APBSmem’s redesign to make electrostatic calculations on membrane proteins more accessible.

The group explains how coordinate manipulation, preparation tools and command-line execution support larger-scale calculations rather than only isolated interactive runs.

The accompanying Bethel profile describes his use of continuum approaches and molecular simulation to study membrane-deforming proteins, while the joint answers caution that electrostatic calculations remain approximations.

Sources and details

MasterClass—Dos, Don'ts and How-Tos with Neville Bethel, Frank Marcoline, and Michael Grabe

{
  "access_scope": "Milka Kostic’s 25 August 2015 interview; joint responses credited to Bethel, Marcoline and Grabe, not isolated claims or software tasks assigned to Bethel. Student status and affiliation are historical source context. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "Milka Kostic"
  ],
  "authors_in_source_order": [
    "Milka Kostic"
  ],
  "dates": {
    "inspected_source_date_1": "25 August 2015",
    "retrieved_utc": "2026-10-08T06:17:11.518985+00:00"
  },
  "dates_exact_in_source_role_order": [
    "25 August 2015"
  ],
  "id": "person-coverage-37e0e239fbf1b1::S1",
  "title": "MasterClass—Dos, Don'ts and How-Tos with Neville Bethel, Frank Marcoline, and Michael Grabe",
  "url": "https://crosstalk.cell.com/blog/masterclass-dos-donts-and-howtos-with-neville-bethel-frank-marcoline-and-michael-grabe"
}

Milka Kostic’s 25 August 2015 interview; joint responses credited to Bethel, Marcoline and Grabe, not isolated claims or software tasks assigned to Bethel. Student status and affiliation are historical source context. Original canonical identity, source, rights and version holds remain.

Milka Kostic’s 25 August 2015 interview; joint responses credited to Bethel, Marcoline and Grabe, not isolated claims or software tasks assigned to Bethel. Student status and affiliation are historical source context. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nir Friedman

Friedman’s Hebrew University page connects research on chromatin and transcription with the question of how cells regulate gene expression.

His computational-systems-biology work uses probabilistic models to interpret biological systems and high-throughput measurements.

The page also identifies representation, inference and learning in Bayesian and Markov networks as a methodological focus, linking the biological applications to probabilistic graphical models.

Sources and details

Nir Friedman

{
  "access_scope": "Named institutional faculty page explicitly distinguishes another Nir Friedman; no identity merge with that namesake, current-role refresh or attribution of individual results from linked papers. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:21.552304+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-9ddbfb8f793871::S1",
  "title": "Nir Friedman",
  "url": "https://www.cs.huji.ac.il/w~nirf/"
}

Named institutional faculty page explicitly distinguishes another Nir Friedman; no identity merge with that namesake, current-role refresh or attribution of individual results from linked papers. Original canonical identity, source, rights and version holds remain.

Named institutional faculty page explicitly distinguishes another Nir Friedman; no identity merge with that namesake, current-role refresh or attribution of individual results from linked papers. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nnedi Okorafor

Okorafor’s author site presents a body of speculative fiction that includes the Binti trilogy, Lagoon and the Nsibidi Scripts series.

It extends that work into Africanfuturist comics, including LaGuardia and stories written for Marvel’s Black Panther and Shuri characters.

The site’s description of Death of the Author follows a Nigerian American writer whose successful science-fiction novel unsettles her control over her own narrative, connecting authorship with identity and fame.

Sources and details

Nnedi Okorafor – Official Website

{
  "access_scope": "Author website bibliography and fictional synopsis, not full-work audit, personal autobiography or current validation of adaptation deals. Book/comic authorship does not imply sole production credit. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:16.436787+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-nnediokorafor::S1",
  "title": "Nnedi Okorafor – Official Website",
  "url": "https://nnedi.com/"
}

Author website bibliography and fictional synopsis, not full-work audit, personal autobiography or current validation of adaptation deals. Book/comic authorship does not imply sole production credit. Original canonical identity, source, rights and version holds remain.

Author website bibliography and fictional synopsis, not full-work audit, personal autobiography or current validation of adaptation deals. Book/comic authorship does not imply sole production credit. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Mikalef

Mikalef’s NTNU profile focuses on the strategic use of information systems and the business value of IT in changing environments.

It connects that agenda with a data-driven-enterprise research project and lists AI, big data and dynamic capabilities among the relevant competencies.

The profile’s publication list places responsible AI governance and organizational adoption alongside that strategy research.

Sources and details

Patrick Mikalef - NTNU

{
  "access_scope": "Institutional profile header uses Patrick Mikalef while publication credits include Patrik Mikalef on the same page; retain exact source/canonical spelling distinctions without an alias merge. Bibliographic titles indicate topics, not inspected findings or current appointment validation. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:24.068348+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-a023efbf1f426b::S1",
  "title": "Patrick Mikalef - NTNU",
  "url": "https://www.ntnu.edu/employees/patrick.mikalef"
}

Institutional profile header uses Patrick Mikalef while publication credits include Patrik Mikalef on the same page; retain exact source/canonical spelling distinctions without an alias merge. Bibliographic titles indicate topics, not inspected findings or current appointment validation. Original canonical identity, source, rights and version holds remain.

Institutional profile header uses Patrick Mikalef while publication credits include Patrik Mikalef on the same page; retain exact source/canonical spelling distinctions without an alias merge. Bibliographic titles indicate topics, not inspected findings or current appointment validation. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Bettany

In Sophia Soto’s 2025 interview, Bettany describes concluding the WandaVision and Agatha All Along chapter with VisionQuest as an honor and a continuation of ambitious storytelling.

He presents Vision as a character still discovering who he is, connecting the robot’s process of becoming with young viewers’ own identity questions.

Bettany frames the new story in terms of intergenerational trauma and self-definition.

Sources and details

Paul Bettany Previews ‘VisionQuest’ and the Show’s Powerful Themes – The Nerds of Color

{
  "access_scope": "15 October 2025 press-line interview and actor interpretation; source’s 2026 premiere plan is not adopted as a current release fact. Fictional character remains distinct from actor and interviewer. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "Sophia Soto"
  ],
  "authors_in_source_order": [
    "Sophia Soto"
  ],
  "dates": {
    "inspected_source_date_1": "15 October 2025",
    "retrieved_utc": "2026-10-08T06:17:19.856463+00:00"
  },
  "dates_exact_in_source_role_order": [
    "15 October 2025"
  ],
  "id": "person-coverage-d23ae33d5f97a8::S1",
  "title": "Paul Bettany Previews ‘VisionQuest’ and the Show’s Powerful Themes – The Nerds of Color",
  "url": "https://thenerdsofcolor.org/2025/10/15/paul-bettany-previews-visionquest-and-the-shows-powerful-themes/"
}

15 October 2025 press-line interview and actor interpretation; source’s 2026 premiere plan is not adopted as a current release fact. Fictional character remains distinct from actor and interviewer. Original canonical identity, source, rights and version holds remain.

15 October 2025 press-line interview and actor interpretation; source’s 2026 premiere plan is not adopted as a current release fact. Fictional character remains distinct from actor and interviewer. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Duguid

Duguid’s Berkeley page connects his research with the history of trademarks and the development of the concept of information.

His teaching in Concepts of Information and History of Information links that historical agenda with how information is understood and organized.

The page describes his contribution to Information: A Historical Companion as writing its introduction and one long entry while co-editing the other entries with collaborators.

Sources and details

Paul Duguid

{
  "access_scope": "Author’s institutional page contains a pre-publication January 2021 book reference; research and teaching language is source-era, not a current schedule. Explicit editorial tasks stay bounded to this volume and preserve collaborators. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "January 2021 planned publication reference in source",
    "retrieved_utc": "2026-10-08T06:17:16.760909+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 2021 planned publication reference in source"
  ],
  "id": "person-coverage-c8918c0dac5d7b::S1",
  "title": "Paul Duguid",
  "url": "https://people.ischool.berkeley.edu/~duguid/"
}

Author’s institutional page contains a pre-publication January 2021 book reference; research and teaching language is source-era, not a current schedule. Explicit editorial tasks stay bounded to this volume and preserve collaborators. Original canonical identity, source, rights and version holds remain.

Author’s institutional page contains a pre-publication January 2021 book reference; research and teaching language is source-era, not a current schedule. Explicit editorial tasks stay bounded to this volume and preserve collaborators. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Dayan

Dayan’s institutional profile centers on decision-making in the brain, the role of neuromodulators and dysfunction associated with psychiatric disease.

It describes his work at the interface between biological and engineered systems for learning and choice, connecting neuroscience with AI.

The career account links that research with his role in co-founding the Gatsby Computational Neuroscience Unit and later moving to the Max Planck Institute for Biological Cybernetics.

Sources and details

Peter Dayan | Max-Planck-Gesellschaft

{
  "access_scope": "Institutional profile and historical career account; 1998 co-founding and 2018 move are source-supported milestones, not a fresh directorship verification or sole credit for the field. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998 Gatsby move; 2018 Tübingen move",
    "retrieved_utc": "2026-10-08T06:17:23.249895+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998 Gatsby move; 2018 Tübingen move"
  ],
  "id": "person-coverage-5ed6a1ec5df668::S1",
  "title": "Peter Dayan | Max-Planck-Gesellschaft",
  "url": "https://www.mpg.de/12309370/biological-cybernetics-dayan"
}

Institutional profile and historical career account; 1998 co-founding and 2018 move are source-supported milestones, not a fresh directorship verification or sole credit for the field. Original canonical identity, source, rights and version holds remain.

Institutional profile and historical career account; 1998 co-founding and 2018 move are source-supported milestones, not a fresh directorship verification or sole credit for the field. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Thiel

Thiel’s publisher profile connects his entrepreneurial work at PayPal with later investment in technology companies and the launch of Palantir.

It describes early backing for startups founded by former colleagues, placing his investment activity within a wider network of technology entrepreneurship.

The account also identifies the Thiel Fellowship as encouraging learning outside conventional schooling, extending its portrait from company finance to approaches to technological progress.

Sources and details

Peter Thiel | Penguin Random House

{
  "access_scope": "Publisher author biography for Zero to One; historical activities rather than current board/fund appointments, investment advice or verified business outcomes. Co-founders and other investors are not erased. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998 PayPal start; 2004 investment and Palantir launch as stated in biography",
    "retrieved_utc": "2026-10-08T06:17:25.149487+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998 PayPal start; 2004 investment and Palantir launch as stated in biography"
  ],
  "id": "person-coverage-614e00f316a2ce::S1",
  "title": "Peter Thiel | Penguin Random House",
  "url": "https://www.penguinrandomhouse.com/authors/185896/peter-thiel/"
}

Publisher author biography for Zero to One; historical activities rather than current board/fund appointments, investment advice or verified business outcomes. Co-founders and other investors are not erased. Original canonical identity, source, rights and version holds remain.

Publisher author biography for Zero to One; historical activities rather than current board/fund appointments, investment advice or verified business outcomes. Co-founders and other investors are not erased. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Philip J. Y. Leung

The Nature paper credits Leung as an equal contributor alongside Susana Vázquez Torres and Preetham Venkatesh in work on designing binders for bioactive helical peptides.

Its contribution statement specifically credits Leung and Vázquez Torres with designing, screening and experimentally characterizing threaded peptide binders.

It also places Leung in the group that obtained the reported crystal structures, distinguishing those explicit tasks from other authors’ diffusion-method and biosensor work.

Sources and details

De novo design of high-affinity binders of bioactive helical peptides | Nature

{
  "access_scope": "Published article author notes and explicit contribution statement, February 2024 issue manifestation; no sole credit for all binder design or RFdiffusion. Initials P.J.Y.L. tied to the literal full author credit; no general biography or clinical efficacy claim. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2024/02",
    "inspected_source_date_1": "February 2024 issue date in publisher metadata",
    "retrieved_utc": "2026-10-08T06:17:24.033049+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 2024 issue date in publisher metadata"
  ],
  "id": "person-coverage-cd5d48d4cc5a13::S1",
  "title": "De novo design of high-affinity binders of bioactive helical peptides | Nature",
  "url": "https://www.nature.com/articles/s41586-023-06953-1"
}

Published article author notes and explicit contribution statement, February 2024 issue manifestation; no sole credit for all binder design or RFdiffusion. Initials P.J.Y.L. tied to the literal full author credit; no general biography or clinical efficacy claim. Original canonical identity, source, rights and version holds remain.

Published article author notes and explicit contribution statement, February 2024 issue manifestation; no sole credit for all binder design or RFdiffusion. Initials P.J.Y.L. tied to the literal full author credit; no general biography or clinical efficacy claim. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pietro Perlo

The repository lists Perlo as a coauthor of a paper exploring how vehicle-to-everything connectivity could support active safety controls.

Its abstract describes pre-emptive traction and braking functions that use expected paths, upcoming tire–road friction conditions and the vehicle’s current position.

The paper frames those functions as complementing the better-studied energy-efficiency uses of connectivity.

Sources and details

[2406.02211] Novel pre-emptive control solutions for V2X connected electric vehicles

{
  "access_scope": "arXiv version 1 submitted 4 June 2024; comments identify a 2022 TRA conference publication, so archive date and conference date remain separate. Abstract only; future deployment and individual tasks not verified. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "So, Kai Man",
    "Tavolo, Gaetano",
    "Tavernini, Davide",
    "Grosso, Marco",
    "Pozzato, Sergio",
    "Perlo, Pietro",
    "Sorniotti, Aldo"
  ],
  "authors_in_source_order": [
    "So, Kai Man",
    "Tavolo, Gaetano",
    "Tavernini, Davide",
    "Grosso, Marco",
    "Pozzato, Sergio",
    "Perlo, Pietro",
    "Sorniotti, Aldo"
  ],
  "dates": {
    "citation_date": "2024/06/04",
    "inspected_revision": "Tue, 4 Jun 2024 11:08:37 UTC (1,096 KB)",
    "inspected_source_date_1": "2022 TRA conference according to comments; 4 June 2024 arXiv submission",
    "retrieved_utc": "2026-10-08T06:17:11.518653+00:00",
    "version": "arXiv v1"
  },
  "dates_exact_in_source_role_order": [
    "2022 TRA conference according to comments; 4 June 2024 arXiv submission"
  ],
  "id": "person-coverage-50e68c5a28a23c::S1",
  "title": "[2406.02211] Novel pre-emptive control solutions for V2X connected electric vehicles",
  "url": "https://arxiv.org/abs/2406.02211",
  "version_url": "https://arxiv.org/abs/2406.02211v1"
}

arXiv version 1 submitted 4 June 2024; comments identify a 2022 TRA conference publication, so archive date and conference date remain separate. Abstract only; future deployment and individual tasks not verified. Original canonical identity, source, rights and version holds remain.

arXiv version 1 submitted 4 June 2024; comments identify a 2022 TRA conference publication, so archive date and conference date remain separate. Abstract only; future deployment and individual tasks not verified. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

R. Duncan Luce

The University of California memorial describes Luce’s work as combining mathematical models with psychological experiments to study individual and group decisions.

It identifies Individual Choice Behavior as a central example of research that crossed economics and psychology.

That account places his contributions within a broader mathematical study of behavior, emphasizing formal prediction and experimental inquiry rather than treating decision theory as purely abstract.

Sources and details

R. Duncan Luce

{
  "access_scope": "Institutional memorial following his 2012 death; attributed career synthesis rather than original theorem audit, empirical validation of every model or endorsement of memorial superlatives. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1925–2012; 11 August 2012 death reported",
    "retrieved_utc": "2026-10-08T06:17:18.977239+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1925–2012; 11 August 2012 death reported"
  ],
  "id": "person-rduncanluce::S1",
  "title": "R. Duncan Luce",
  "url": "https://senate.universityofcalifornia.edu/_files/inmemoriam/html/R.DuncanLuce.html"
}

Institutional memorial following his 2012 death; attributed career synthesis rather than original theorem audit, empirical validation of every model or endorsement of memorial superlatives. Original canonical identity, source, rights and version holds remain.

Institutional memorial following his 2012 death; attributed career synthesis rather than original theorem audit, empirical validation of every model or endorsement of memorial superlatives. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ralph L. Keeney

Keeney’s Duke profile places decisions with multiple objectives at the center of his work, linking decision analysis with the structuring of problems and creation of alternatives.

It extends that research to complex corporate and governmental decisions and to risk analysis where human lives may be affected.

The bibliography connects those interests with Decisions with Multiple Objectives, coauthored with Howard Raiffa, and Value-Focused Thinking, distinguishing the books’ authorship relationships.

Sources and details

Ralph Keeney | Duke's Fuqua School of Business

{
  "access_scope": "Institutional emeritus profile and bibliography; research topics and named works only, no outcome guarantee, current consulting advice or sole credit for the Raiffa collaboration. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1976 and 1993 editions of coauthored book; 1992 Value-Focused Thinking",
    "retrieved_utc": "2026-10-08T06:17:22.153849+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1976 and 1993 editions of coauthored book; 1992 Value-Focused Thinking"
  ],
  "id": "person-ralphlkeeney::S1",
  "title": "Ralph Keeney | Duke's Fuqua School of Business",
  "url": "https://www.fuqua.duke.edu/faculty/ralph-keeney"
}

Institutional emeritus profile and bibliography; research topics and named works only, no outcome guarantee, current consulting advice or sole credit for the Raiffa collaboration. Original canonical identity, source, rights and version holds remain.

Institutional emeritus profile and bibliography; research topics and named works only, no outcome guarantee, current consulting advice or sole credit for the Raiffa collaboration. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Refik Anadol

Anadol’s studio portfolio brings media art and architecture together with machine intelligence, presenting installations and audiovisual performances alongside data-based research.

Its listed projects include Unsupervised at MoMA, WDCH Dreams and Machine Hallucination, locating that practice across exhibition, public-art and performance formats.

The research captions describe UMAP views of archives and GAN-generated images in a latent-space browser, showing computational representations as part of the studio’s artistic process.

Sources and details

Refik Anadol Studio AI and Architecture

{
  "access_scope": "Named studio portfolio, not an individual task attribution, full exhibition audit or proof of any machine’s consciousness. All projects and techniques are studio-scoped; Refik Anadol identity evidenced by original HTML title/meta. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "2018, 2019 and 2022 portfolio project years",
    "retrieved_utc": "2026-10-08T06:17:18.539925+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2018, 2019 and 2022 portfolio project years"
  ],
  "id": "person-coverage-1066cc11c2552c::S1",
  "title": "Refik Anadol Studio AI and Architecture",
  "url": "https://refikanadolstudio.com/"
}

Named studio portfolio, not an individual task attribution, full exhibition audit or proof of any machine’s consciousness. All projects and techniques are studio-scoped; Refik Anadol identity evidenced by original HTML title/meta. Original canonical identity, source, rights and version holds remain.

Named studio portfolio, not an individual task attribution, full exhibition audit or proof of any machine’s consciousness. All projects and techniques are studio-scoped; Refik Anadol identity evidenced by original HTML title/meta. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

René Raaijmakers

Raaijmakers’s publisher profile describes technical journalism focused on semiconductors, lithography and complex high-tech systems.

It places his interest in the people behind technology and its social implications alongside systems engineering and architecture.

His books on Natlab and ASML’s early development extend that reporting into industrial history, while the profile links his publishing work with founding Bits&Chips and High Tech Institute.

Sources and details

René Raaijmakers – Bits&Chips

{
  "access_scope": "Publisher’s author profile, not independent assessment of reporting quality, verification of a planned sequel or a present-day employment refresh; book scope and organization relationships remain as stated. Original canonical identity, source, rights and version holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1999 Bits&Chips founding; 2011 High Tech Institute founding",
    "retrieved_utc": "2026-10-08T06:17:11.518940+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1999 Bits&Chips founding; 2011 High Tech Institute founding"
  ],
  "id": "person-coverage-c5d47628bb29fe::S1",
  "title": "René Raaijmakers – Bits&Chips",
  "url": "https://bits-chips.com/featured-author/rene-raaijmakers/"
}

Publisher’s author profile, not independent assessment of reporting quality, verification of a planned sequel or a present-day employment refresh; book scope and organization relationships remain as stated. Original canonical identity, source, rights and version holds remain.

Publisher’s author profile, not independent assessment of reporting quality, verification of a planned sequel or a present-day employment refresh; book scope and organization relationships remain as stated. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard R. Nelson

The AEA article credits Nelson and Sidney Winter jointly with reviewing evolutionary approaches to economic behavior, industrial dynamics and institutional change.

Its abstract describes firm behavior through skills and routines shaped by learning and selection, connecting economic analysis with adaptation over time.

The review applies that perspective to competition in technologically changing industries and the evolution of institutions and technologies.

Sources and details

Evolutionary Theorizing in Economics - American Economic Association

{
  "access_scope": "Spring 2002 Journal of Economic Perspectives article abstract, 23–46; joint authorship preserved, no assignment of unlisted individual tasks or full paper audit. Metadata June 2002 publication date remains distinct from issue season. Original canonical identity, source, rights and version holds remain.",
  "authors": [
    "Nelson, Richard R.",
    "Winter, Sidney G."
  ],
  "authors_in_source_order": [
    "Nelson, Richard R.",
    "Winter, Sidney G."
  ],
  "dates": {
    "citation_publication_date": "2002/06",
    "inspected_source_date_1": "Spring 2002 issue; June 2002 publisher metadata",
    "retrieved_utc": "2026-10-08T06:17:20.050090+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spring 2002 issue; June 2002 publisher metadata"
  ],
  "id": "person-richardrnelson::S1",
  "title": "Evolutionary Theorizing in Economics - American Economic Association",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2F0895330027247"
}

Spring 2002 Journal of Economic Perspectives article abstract, 23–46; joint authorship preserved, no assignment of unlisted individual tasks or full paper audit. Metadata June 2002 publication date remains distinct from issue season. Original canonical identity, source, rights and version holds remain.

Spring 2002 Journal of Economic Perspectives article abstract, 23–46; joint authorship preserved, no assignment of unlisted individual tasks or full paper audit. Metadata June 2002 publication date remains distinct from issue season. Original canonical identity, source, rights and version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard S. Sutton

Amii’s profile attributes to Richard S. Sutton contributions to temporal-difference learning, actor–critic algorithms, and the Dyna architecture for combining learning, planning, and reaction.

It describes his effort to extend reinforcement learning into knowledge representation grounded in predictions from experience.

The profile connects his work with the Alberta Plan to long-lived computational agents that learn to predict and control sensory inputs while interacting with a complex world.

Sources and details

Richard S. Sutton

{
  "access_scope": "Institutional description of research contributions and goals; no claim that general intelligence or the proposed agents have been achieved.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:20.450524+00:00"
  },
  "id": "person-local-richardssutton::S1",
  "title": "Richard S. Sutton",
  "url": "https://www.amii.ca/people/richard-s-sutton"
}

Institutional description of research contributions and goals; no claim that general intelligence or the proposed agents have been achieved.

Institutional description of research contributions and goals; no claim that general intelligence or the proposed agents have been achieved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robbert Jan de Haas

Robbert Jan de Haas is a listed coauthor of a study that adapts modular B–M–E proteins to assemble into antifouling coatings on gold surfaces.

The paper combines the GBP1 gold-binding peptide with a trimer domain and zwitterionic elastin-like blocks of different lengths, changing substrate attachment and the exposed hydrophilic layer separately.

The authors report antifouling tests against 1% and 10% human serum.

Sources and details

Modular Design for Proteins Assembling into Antifouling Coatings: Case of Gold Surfaces

{
  "access_scope": "Joint paper results on specified coatings and serum concentrations; no individual experimental or design task attributed to the selected coauthor, and no clinical-use inference.",
  "authors": [
    "Chuanbao Zheng",
    "Nicolò Alvisi",
    "Robbert Jan de Haas",
    "Zhisen Zhang",
    "Han Zuilhof",
    "Renko de Vries"
  ],
  "authors_in_source_order": [
    "Chuanbao Zheng",
    "Nicolò Alvisi",
    "Robbert Jan de Haas",
    "Zhisen Zhang",
    "Han Zuilhof",
    "Renko de Vries"
  ],
  "dates": {
    "citation_publication_date": "2023 Jun 27",
    "collection": "2023 Jul 11",
    "publication": "2023 Jun 27",
    "received": "2023 Feb 9",
    "retrieved_utc": "2026-10-08T06:17:17.524922+00:00",
    "revised": "2023 May 30"
  },
  "id": "person-coverage-fa1445e77d6f25::S1",
  "title": "Modular Design for Proteins Assembling into Antifouling Coatings: Case of Gold Surfaces",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC10339784/"
}

Joint paper results on specified coatings and serum concentrations; no individual experimental or design task attributed to the selected coauthor, and no clinical-use inference.

Joint paper results on specified coatings and serum concentrations; no individual experimental or design task attributed to the selected coauthor, and no clinical-use inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert J. Gordon

TED’s profile presents Robert J. Gordon’s argument that contemporary digital innovations may deliver less economic growth than earlier waves of invention.

It describes his concern that six economic headwinds could slow growth particularly for the bottom 99% of the income distribution, with obstacles differing across the United States, Canada, and Europe.

The profile links this argument to his work on productivity, inflation, unemployment, and airline economics, placing the innovation debate within a broader study of economic performance.

Sources and details

Robert J. Gordon | Speaker | TED

{
  "access_scope": "TED’s description of Gordon’s argument, with a linked talk posted April 2013; neither a current economic forecast nor independent confirmation of growth effects.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "linked_talk_posted": "Apr 2013",
    "retrieved_utc": "2026-10-08T06:17:27.660416+00:00"
  },
  "id": "person-coverage-aebd34eeaed985::S1",
  "title": "Robert J. Gordon | Speaker | TED",
  "url": "https://www.ted.com/speakers/robert_j_gordon"
}

TED’s description of Gordon’s argument, with a linked talk posted April 2013; neither a current economic forecast nor independent confirmation of growth effects.

TED’s description of Gordon’s argument, with a linked talk posted April 2013; neither a current economic forecast nor independent confirmation of growth effects.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rohith Krishna

Rohith Krishna’s self-profile describes developing AI algorithms to model and design biomolecular interactions during his doctoral work.

He identifies shared representations across different biological data modalities as a research question, aimed at enabling models to reason over information that currently sits in separate forms.

He also frames patient-specific prediction as two problems: representing an individual biological state and predicting the response to a treatment.

Sources and details

Rohith Krishna

{
  "access_scope": "First-person research account and questions; precision N-of-1 medicine is an aspiration, not a validated treatment outcome or advice. No division of labor inferred from publication counts.",
  "authors": [
    "Rohith Krishna"
  ],
  "authors_in_source_order": [
    "Rohith Krishna"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:18.358093+00:00"
  },
  "id": "person-coverage-9ae552aa1ad5b9::S1",
  "title": "Rohith Krishna",
  "url": "https://r-krishna.github.io/"
}

First-person research account and questions; precision N-of-1 medicine is an aspiration, not a validated treatment outcome or advice. No division of labor inferred from publication counts.

First-person research account and questions; precision N-of-1 medicine is an aspiration, not a validated treatment outcome or advice. No division of labor inferred from publication counts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ruediger Kuehr

Ruediger Kuehr is a listed coauthor of The Global E-waste Monitor 2024, which uses a standardized framework to compare electronic-waste quantities and flows.

The report describes guidelines for classification, reporting, and indicators as the basis for global, regional, and national monitors, linking measurement to tracking waste-management progress.

It reports 62 billion kilograms of e-waste generated in 2022 and 13.8 billion kilograms documented as formally collected and recycled, a reported rate of 22.3%.

Sources and details

The Global E-waste Monitor 2024

{
  "access_scope": "Joint report with historical 2022 statistics; no individual data-collection or methodological task assigned to Kuehr. PDF embedded author text spells Ruediger Kuehr while rendered cover displays Rüdiger; both are manifestations of the same inspected source credit, no outside alias inferred.",
  "authors": [
    "Cornelis P. Baldé",
    "Ruediger Kuehr",
    "Tales Yamamoto",
    "Rosie McDonald",
    "Elena D’Angelo",
    "Shahana Althaf",
    "Garam Bel",
    "Otmar Deubzer",
    "Elena Fernandez-Cubillo",
    "Vanessa Forti",
    "Vanessa Gray",
    "Sunil Herat",
    "Shunichi Honda",
    "Giulia Iattoni",
    "Deepali S. Khetriwal",
    "Vittoria Luda di Cortemiglia",
    "Yuliya Lobuntsova",
    "Innocent Nnorom",
    "Noémie Pralat",
    "Michelle Wagner"
  ],
  "authors_in_source_order": [
    "Cornelis P. Baldé",
    "Ruediger Kuehr",
    "Tales Yamamoto",
    "Rosie McDonald",
    "Elena D’Angelo",
    "Shahana Althaf",
    "Garam Bel",
    "Otmar Deubzer",
    "Elena Fernandez-Cubillo",
    "Vanessa Forti",
    "Vanessa Gray",
    "Sunil Herat",
    "Shunichi Honda",
    "Giulia Iattoni",
    "Deepali S. Khetriwal",
    "Vittoria Luda di Cortemiglia",
    "Yuliya Lobuntsova",
    "Innocent Nnorom",
    "Noémie Pralat",
    "Michelle Wagner"
  ],
  "dates": {
    "report_year": "2024",
    "retrieved_utc": "2026-10-08T06:17:13.063777+00:00",
    "statistics_year": "2022"
  },
  "id": "person-coverage-824ddfe8d93525::S1",
  "title": "The Global E-waste Monitor 2024",
  "url": "https://ewastemonitor.info/wp-content/uploads/2024/03/GEM_2024_18-03_web_page_per_page_web.pdf"
}

Joint report with historical 2022 statistics; no individual data-collection or methodological task assigned to Kuehr. PDF embedded author text spells Ruediger Kuehr while rendered cover displays Rüdiger; both are manifestations of the same inspected source credit, no outside alias inferred.

Joint report with historical 2022 statistics; no individual data-collection or methodological task assigned to Kuehr. PDF embedded author text spells Ruediger Kuehr while rendered cover displays Rüdiger; both are manifestations of the same inspected source credit, no outside alias inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ryūtarō Nakamura

In Production I.G’s Ghost Hound interview, Ryūtarō Nakamura describes bringing earlier Lain collaborators into the project and choosing to portray children alongside their parents.

He explains a directing approach in which the story gradually departs from its apparent path before its elements converge at the end.

Nakamura also discusses elaborate use of traditional gagaku music and credits Mariko Oka’s character designs and the sound team as influences on the series’ atmosphere.

Sources and details

Ryutaro Nakamura & Chiaki J. Konaka talk session

{
  "access_scope": "Named-speaker interview account about the fictional Ghost Hound; source Ryutaro differs from canonical Ryūtarō only by diacritics. Konaka’s storyline statements and other collaborators’ work are not assigned to Nakamura.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:26.162610+00:00",
    "work_copyright": "2007"
  },
  "id": "person-coverage-957dc68f126448::S1",
  "title": "Ryutaro Nakamura & Chiaki J. Konaka talk session",
  "url": "https://www.productionig.com/contents/works_sp/60_/s08_/000788.html"
}

Named-speaker interview account about the fictional Ghost Hound; source Ryutaro differs from canonical Ryūtarō only by diacritics. Konaka’s storyline statements and other collaborators’ work are not assigned to Nakamura.

Named-speaker interview account about the fictional Ghost Hound; source Ryutaro differs from canonical Ryūtarō only by diacritics. Konaka’s storyline statements and other collaborators’ work are not assigned to Nakamura.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sergio Pozzato

Sergio Pozzato is a listed coauthor of a paper examining how vehicle-to-everything connectivity could support active safety controls for electric vehicles.

Its proposed pre-emptive traction and braking functions use information about the expected path, tire–road friction ahead, and the vehicle’s present position.

The abstract distinguishes these functions from familiar connectivity applications such as energy-efficient speed profiles and platooning, focusing on the potential to act before changing road conditions are encountered.

Sources and details

Novel pre-emptive control solutions for V2X connected electric vehicles

{
  "access_scope": "Joint-paper abstract for arXiv v1 submitted in 2024, describing a 2022 conference paper; proposed control functions, not deployed safety validation or an individual role allocation.",
  "authors": [
    "Kai Man So",
    "Gaetano Tavolo",
    "Davide Tavernini",
    "Marco Grosso",
    "Sergio Pozzato",
    "Pietro Perlo",
    "Aldo Sorniotti"
  ],
  "authors_in_source_order": [
    "Kai Man So",
    "Gaetano Tavolo",
    "Davide Tavernini",
    "Marco Grosso",
    "Sergio Pozzato",
    "Pietro Perlo",
    "Aldo Sorniotti"
  ],
  "dates": {
    "arxiv_submission": "4 Jun 2024",
    "citation_date": "2024/06/04",
    "conference": "TRA Lisbon 2022",
    "inspected_revision": "Tue, 4 Jun 2024 11:08:37 UTC (1,096 KB)",
    "retrieved_utc": "2026-10-08T06:17:11.518653+00:00",
    "version": "v1"
  },
  "id": "person-coverage-668f39dc81c29b::S1",
  "title": "Novel pre-emptive control solutions for V2X connected electric vehicles",
  "url": "https://arxiv.org/abs/2406.02211",
  "version_url": "https://arxiv.org/abs/2406.02211v1"
}

Joint-paper abstract for arXiv v1 submitted in 2024, describing a 2022 conference paper; proposed control functions, not deployed safety validation or an individual role allocation.

Joint-paper abstract for arXiv v1 submitted in 2024, describing a 2022 conference paper; proposed control functions, not deployed safety validation or an individual role allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Seymour Papert

MIT’s account describes Seymour Papert’s constructionist view that learning is strongest when people actively build things, rather than only receive information.

It connects his use of computer programming and debugging with helping children reflect on their own thinking and learning.

The article situates that approach across child development, AI, and educational technology, presenting computers as tools for experimentation, exploration, and expression.

Sources and details

Professor Emeritus Seymour Papert, pioneer of constructionist learning, dies at 88

{
  "access_scope": "MIT Media Lab’s 2016 retrospective account of an educational theory; no universal outcome guarantee or individual allocation of joint hardware/software implementation work.",
  "authors": [
    "MIT Media Lab"
  ],
  "authors_in_source_order": [
    "MIT Media Lab"
  ],
  "dates": {
    "publication": "August 1, 2016",
    "retrieved_utc": "2026-10-08T06:17:15.853133+00:00"
  },
  "id": "person-seymourpapert::S1",
  "title": "Professor Emeritus Seymour Papert, pioneer of constructionist learning, dies at 88",
  "url": "https://news.mit.edu/2016/seymour-papert-pioneer-of-constructionist-learning-dies-0801"
}

MIT Media Lab’s 2016 retrospective account of an educational theory; no universal outcome guarantee or individual allocation of joint hardware/software implementation work.

MIT Media Lab’s 2016 retrospective account of an educational theory; no universal outcome guarantee or individual allocation of joint hardware/software implementation work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sidney G. Winter

Sidney G. Winter is a listed coauthor of a review advocating evolutionary analysis from short-run firm behavior to the long-run development of institutions and technologies.

The paper characterizes individual behavior as governed by skills and routines shaped through learning and selection.

Its abstract identifies competitive processes in technologically changing industries and the evolution of institutions as applications of this approach.

Sources and details

Evolutionary Theorizing in Economics

{
  "access_scope": "Joint review argument, not an experimental finding or an individual assignment of theoretical contributions; exact source credit retains the middle initial.",
  "authors": [
    "Richard R. Nelson",
    "Sidney G. Winter"
  ],
  "authors_in_source_order": [
    "Richard R. Nelson",
    "Sidney G. Winter"
  ],
  "dates": {
    "citation_publication_date": "2002/06",
    "issue": "2",
    "pages": "23–46",
    "publication": "Spring 2002",
    "retrieved_utc": "2026-10-08T06:17:20.050090+00:00",
    "volume": "16"
  },
  "id": "person-sidneygwinter::S1",
  "title": "Evolutionary Theorizing in Economics",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2F0895330027247"
}

Joint review argument, not an experimental finding or an individual assignment of theoretical contributions; exact source credit retains the middle initial.

Joint review argument, not an experimental finding or an individual assignment of theoretical contributions; exact source credit retains the middle initial.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tales Yamamoto

SCYCLE’s profile describes Tales Yamamoto’s involvement in FutuRaM research on the availability and recoverability of secondary raw materials from European e-waste.

It reports earlier mining work in Brazil that included water-balance development for a beneficiation plant, oversight of tailings operations, and regulatory reporting.

The profile also describes industrial-improvement and feasibility-study work in the sugar and alcohol sector, connecting his materials-recovery research with earlier process and resource-management experience.

Sources and details

Tales Yamamoto

{
  "access_scope": "Institutional profile of explicitly described project and prior-work responsibilities; no efficacy, regulatory-compliance, or safety-performance claim inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:27.253298+00:00"
  },
  "id": "person-coverage-c1ef1a7cff8edb::S1",
  "title": "Tales Yamamoto",
  "url": "https://www.scycle.info/tales-yamamoto/"
}

Institutional profile of explicitly described project and prior-work responsibilities; no efficacy, regulatory-compliance, or safety-performance claim inferred.

Institutional profile of explicitly described project and prior-work responsibilities; no efficacy, regulatory-compliance, or safety-performance claim inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vannevar Bush

The Lemelson-MIT account describes Vannevar Bush’s memex proposal as a microfilm storage and retrieval device for books, records, and communications.

It explains how users would build associative trails between documents, augmenting memory through linked paths rather than only selecting isolated records.

The profile also describes a rapid selector for projecting microfilm documents, placing the memex alongside Bush’s efforts to make large stores of information accessible.

Sources and details

Vannevar Bush

{
  "access_scope": "Institutional historical account of proposed information devices; proposed memex functions are not described as a deployed system, and unsupported modern-web causal claims are omitted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:15.576829+00:00"
  },
  "id": "person-vannevarbush::S1",
  "title": "Vannevar Bush",
  "url": "https://lemelson.mit.edu/resources/vannevar-bush"
}

Institutional historical account of proposed information devices; proposed memex functions are not described as a deployed system, and unsupported modern-web causal claims are omitted.

Institutional historical account of proposed information devices; proposed memex functions are not described as a deployed system, and unsupported modern-web causal claims are omitted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

W. Edwards Deming

The Deming Institute describes W. Edwards Deming’s management teaching as linking statistical variation, systems thinking, and human psychology.

Its account of his 1950 teaching in Japan emphasizes improving how managers and engineers worked and learned together across departments and with suppliers and customers.

The profile identifies The New Economics as the book presenting his System of Profound Knowledge, connecting continual improvement with a broader account of management and learning.

Sources and details

Deming The Man

{
  "access_scope": "Institute’s retrospective description of teaching and management ideas; sweeping claims about national industrial transformation or particular companies’ turnaround are not adopted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:12.310283+00:00"
  },
  "id": "person-wedwardsdeming::S1",
  "title": "Deming The Man",
  "url": "https://deming.org/deming-the-man/"
}

Institute’s retrospective description of teaching and management ideas; sweeping claims about national industrial transformation or particular companies’ turnaround are not adopted.

Institute’s retrospective description of teaching and management ideas; sweeping claims about national industrial transformation or particular companies’ turnaround are not adopted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Walter A. Shewhart

Best and Neuhauser’s historical article describes Walter A. Shewhart’s distinction between assignable-cause and chance-cause variation as a basis for statistical process control.

It presents control charts as tools for distinguishing those forms of variation, so a process can be brought into and maintained in statistical control.

The article also discusses the iterative plan–do–study–act cycle, separating its connection to Shewhart from Deming’s later promotion of the approach.

Sources and details

Walter A Shewhart, 1924, and the Hawthorne factory

{
  "access_scope": "Historical article by M Best and D Neuhauser; Shewhart is the subject rather than document writer. Canonical identity matches title by punctuation/space only; no clinical quality outcome or guarantee inferred.",
  "authors": [
    "M Best",
    "D Neuhauser"
  ],
  "authors_in_source_order": [
    "M Best",
    "D Neuhauser"
  ],
  "dates": {
    "citation_publication_date": "2006 Apr",
    "pages": "142–143",
    "publication": "2006 Apr",
    "retrieved_utc": "2026-10-08T06:17:17.865534+00:00",
    "volume_issue": "15(2)"
  },
  "id": "person-walterashewhart::S1",
  "title": "Walter A Shewhart, 1924, and the Hawthorne factory",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC2464836/"
}

Historical article by M Best and D Neuhauser; Shewhart is the subject rather than document writer. Canonical identity matches title by punctuation/space only; no clinical quality outcome or guarantee inferred.

Historical article by M Best and D Neuhauser; Shewhart is the subject rather than document writer. Canonical identity matches title by punctuation/space only; no clinical quality outcome or guarantee inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wesley M. Cohen

Duke’s profile describes Wesley M. Cohen’s research on technological change and R&D through the roles of firm size, market structure, learning, and knowledge flows.

It also identifies university research and firms’ means of protecting intellectual property, particularly patents, as subjects in his analysis of innovation.

The profile describes his study of the division of innovative labor through ties among firms and other institutions that influence innovative performance.

Sources and details

Wesley Cohen | Duke’s Fuqua School of Business

{
  "access_scope": "Institutional description of a research program, not evidence that patents or any named factor always improve innovation. Full middle-initial identity appears explicitly in profile body; shorter page title is not used to infer it.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_updated": "2026-10-07T17:25:31-0400",
    "retrieved_utc": "2026-10-08T06:17:22.952707+00:00"
  },
  "id": "person-wesleymcohen::S1",
  "title": "Wesley Cohen | Duke’s Fuqua School of Business",
  "url": "https://www.fuqua.duke.edu/faculty/wesley-cohen"
}

Institutional description of a research program, not evidence that patents or any named factor always improve innovation. Full middle-initial identity appears explicitly in profile body; shorter page title is not used to infer it.

Institutional description of a research program, not evidence that patents or any named factor always improve innovation. Full middle-initial identity appears explicitly in profile body; shorter page title is not used to infer it.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William H. Meckling

William H. Meckling is the credited author of a 1968 article comparing alternative systems for managing the frequency spectrum.

Its abstract argues that provoking political action is a more important barrier to improvement than selecting the management system itself.

It compares contemporary spectrum management with historical commons and argues that substantial improvement is possible even without specifying an optimal arrangement.

Sources and details

Management of the Frequency Spectrum

{
  "access_scope": "Sole-author repository abstract presenting a historical policy argument; no present legal or spectrum-management advice, and no details inferred from uninspected full text.",
  "authors": [
    "William H. Meckling"
  ],
  "authors_in_source_order": [
    "William H. Meckling"
  ],
  "dates": {
    "publication": "1968",
    "retrieved_utc": "2026-10-08T06:17:16.760762+00:00"
  },
  "id": "person-williamhmeckling::S1",
  "title": "Management of the Frequency Spectrum",
  "url": "https://openscholarship.wustl.edu/law_lawreview/vol1968/iss1/5/"
}

Sole-author repository abstract presenting a historical policy argument; no present legal or spectrum-management advice, and no details inferred from uninspected full text.

Sole-author repository abstract presenting a historical policy argument; no present legal or spectrum-management advice, and no details inferred from uninspected full text.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yoav Freund

UC San Diego’s profile describes Yoav Freund’s work on evaluating algorithms for repeated decision tasks through their inputs, decisions, and measurable outcomes.

For binary classification, it explains a loss of one for a mismatch and zero for a match, giving a common basis for comparing algorithms as black boxes.

The profile also credits his joint work with Robert Schapire on AdaBoost, keeping that shared achievement separate from the broader evaluation framework.

Sources and details

Faculty Profiles | Jacobs School of Engineering

{
  "access_scope": "Institutional account of research approach and explicit joint credit; no personal division of AdaBoost design or performance guarantee inferred. Identity normalization removes the source’s doubled space only.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:14.634287+00:00"
  },
  "id": "person-coverage-578a45af7d28e8::S1",
  "title": "Faculty Profiles | Jacobs School of Engineering",
  "url": "https://jacobsschool.ucsd.edu/faculty/profile?id=246"
}

Institutional account of research approach and explicit joint credit; no personal division of AdaBoost design or performance guarantee inferred. Identity normalization removes the source’s doubled space only.

Institutional account of research approach and explicit joint credit; no personal division of AdaBoost design or performance guarantee inferred. Identity normalization removes the source’s doubled space only.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oskar Morgenstern

Oskar Morgenstern coauthored Theory of Games and Economic Behavior with John von Neumann, published by Princeton in 1944.

The publisher’s retrospective describes their approach as a mathematical study of economic and social interactions structured as strategic games.

It explains that formal incentives let game theory compare observed behavior, predicted behavior and optimal strategies.

Sources and details

A Century in Books: Princeton University Press 1905–2005

{
  "access_scope": "Oskar Morgenstern: Publisher retrospective, printed page 21, about the 1944 book; this is not the original theoretical text or a personal division of mathematical work. Ordered authors of the discussed book: John von Neumann, Oskar Morgenstern.",
  "authors": [
    "John von Neumann",
    "Oskar Morgenstern"
  ],
  "authors_in_source_order": [
    "John von Neumann",
    "Oskar Morgenstern"
  ],
  "dates": {
    "inspected_source_date_1": "retrospective published 2005; discussed book originally published 1944",
    "retrieved_utc": "2026-10-07T18:19:41.143977+00:00"
  },
  "dates_exact_in_source_role_order": [
    "retrospective published 2005; discussed book originally published 1944"
  ],
  "id": "person-oskarmorgenstern::S1",
  "title": "A Century in Books: Princeton University Press 1905–2005",
  "url": "https://assets.press.princeton.edu/about_pup/PUP100/book/fulltext.pdf"
}

Oskar Morgenstern: Publisher retrospective, printed page 21, about the 1944 book; this is not the original theoretical text or a personal division of mathematical work. Ordered authors of the discussed book: John von Neumann, Oskar Morgenstern.

Oskar Morgenstern: Publisher retrospective, printed page 21, about the 1944 book; this is not the original theoretical text or a personal division of mathematical work. Ordered authors of the discussed book: John von Neumann, Oskar Morgenstern.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Watts

Peter Watts uses the notes to Blindsight to ask what consciousness contributes, beyond defining what it is.

He presents the novel as exploring whether tracking other agents’ intentions requires a self-reflective observer.

His commentary also considers the processing costs of self-awareness and its capacity to distract an organism from surrounding threats or opportunities.

Sources and details

Blindsight

{
  "access_scope": "Peter Watts: Author commentary in the Blindsight manuscript’s Notes and References, pages 325–326; fictional exploration and the author’s argument, not an empirical demonstration that consciousness is unnecessary. Ordered author credited for the manuscript: Peter Watts.",
  "authors": [
    "Peter Watts"
  ],
  "authors_in_source_order": [
    "Peter Watts"
  ],
  "dates": {
    "inspected_source_date_1": "author-hosted PDF manifestation; publication date not established from inspected pages",
    "retrieved_utc": "2026-10-07T18:15:16.348701+00:00"
  },
  "dates_exact_in_source_role_order": [
    "author-hosted PDF manifestation; publication date not established from inspected pages"
  ],
  "id": "person-coverage-6367b9880ecce9::S1",
  "title": "Blindsight",
  "url": "https://www.rifters.com/real/shorts/PeterWatts_Blindsight.pdf"
}

Peter Watts: Author commentary in the Blindsight manuscript’s Notes and References, pages 325–326; fictional exploration and the author’s argument, not an empirical demonstration that consciousness is unnecessary. Ordered author credited for the manuscript: Peter Watts.

Peter Watts: Author commentary in the Blindsight manuscript’s Notes and References, pages 325–326; fictional exploration and the author’s argument, not an empirical demonstration that consciousness is unnecessary. Ordered author credited for the manuscript: Peter Watts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Badham

John Badham directed WarGames, which BFI’s account places in the home-computer culture of 1983.

Its teenage protagonist David Lightman hacks into a government computer called WOPR while believing that he is playing a game.

The resulting nuclear-war scenario turns that mistaken interpretation of the computer interface into a threat with consequences beyond the screen.

Sources and details

10 great films about computers | BFI

{
  "access_scope": "John Badham: BFI editorial film account; director credit and fictional narrative, not documentation of real AI behavior or an allocation of screenplay/effects tasks.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:57.099639+00:00"
  },
  "id": "person-coverage-f79da6d2d8a5b0::S1",
  "title": "10 great films about computers | BFI",
  "url": "https://www.bfi.org.uk/lists/10-great-films-about-computers"
}

John Badham: BFI editorial film account; director credit and fictional narrative, not documentation of real AI behavior or an allocation of screenplay/effects tasks.

John Badham: BFI editorial film account; director credit and fictional narrative, not documentation of real AI behavior or an allocation of screenplay/effects tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jon Favreau

Jon Favreau is credited as director of The Mandalorian and Grogu in Industrial Light & Magic’s production account.

For that production, ILM describes a StageCraft workflow that let filmmakers scout unbuilt sets in physical studio space and preview near-final shots through Apple Vision Pro devices.

The same account combines digital effects with motion-control photography of hand-built Razor Crest miniatures, illustrating several production methods used on the film he directed.

Sources and details

The Mandalorian and Grogu | Industrial Light & Magic

{
  "access_scope": "Jon Favreau: Production-level context; ILM owns the effects-work claims, and Favreau’s director credit does not make him their individual inventor or operator.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2026-09-16T16:23:14+00:00"
    ],
    "retrieved_utc": "2026-10-07T17:55:56.753501+00:00"
  },
  "id": "person-coverage-c76d05aab43249::S1",
  "title": "The Mandalorian and Grogu | Industrial Light & Magic",
  "url": "https://www.ilm.com/vfx/the-mandalorian-and-grogu/"
}

Jon Favreau: Production-level context; ILM owns the effects-work claims, and Favreau’s director credit does not make him their individual inventor or operator.

Jon Favreau: Production-level context; ILM owns the effects-work claims, and Favreau’s director credit does not make him their individual inventor or operator.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

K. W. Bamforth

K. W. Bamforth coauthored the 1951 longwall coal-mining study with E. L. Trist; its footnote identifies his earlier eighteen years working at the coal face as an aid to the fieldwork.

Their opening analysis considers whether improvements in mining teams reflected extraordinary innovations or remedies for shortcomings in the existing social organization of work.

It emphasizes group relationships while warning that the favorable conditions in pioneering pits required caution before extending the changes elsewhere.

Sources and details

Source

{
  "access_scope": "K. W. Bamforth: Joint article, selected introduction and footnote only; no full-work audit or sole-person allocation. OCR evidence is a derivative requiring root adapter and independent review.",
  "authors": [
    "E. L. Trist",
    "K. W. Bamforth"
  ],
  "authors_in_source_order": [
    "E. L. Trist",
    "K. W. Bamforth"
  ],
  "dates": {
    "journal_year": "1951",
    "retrieved_utc": "2026-10-07T18:13:44.042747+00:00"
  },
  "id": "person-coverage-3879ec62bfc9f9::S1",
  "title": null,
  "url": "https://www.uv.es/gonzalev/PSI%20ORG%2006-07/ARTICULOS%20RRHH%20SOCIOTEC/Trist%20Long%20Wall%20Method%20HR%201951.pdf"
}

K. W. Bamforth: Joint article, selected introduction and footnote only; no full-work audit or sole-person allocation. OCR evidence is a derivative requiring root adapter and independent review.

K. W. Bamforth: Joint article, selected introduction and footnote only; no full-work audit or sole-person allocation. OCR evidence is a derivative requiring root adapter and independent review.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Karl Schroeder

Karl Schroeder’s publications page describes his Worldbuilding essay as examining how to create fantastic worlds that can support strong stories.

His CV places that writing alongside novels such as Lady of Mazes, published by Tor in July 2005, and Stealing Worlds, published in July 2019.

It also credits him with Hassan Masum on a 2011 article about two case studies of open-source biotechnology platforms for global health and development.

Sources and details

Publications — UNAPOCALYPTIC

{
  "access_scope": "Karl Schroeder: Author-owned CV and stated essay topic, not unseen novel plots or inferred biotechnology results. Exact author-site header was omitted by the earlier main-content extraction.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:27.950150+00:00"
  },
  "id": "person-coverage-fe512f5126623c::S1",
  "title": "Publications — UNAPOCALYPTIC",
  "url": "https://www.karl-schroeder.com/publications"
}

Karl Schroeder: Author-owned CV and stated essay topic, not unseen novel plots or inferred biotechnology results. Exact author-site header was omitted by the earlier main-content extraction.

Karl Schroeder: Author-owned CV and stated essay topic, not unseen novel plots or inferred biotechnology results. Exact author-site header was omitted by the earlier main-content extraction.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kevin R. Adams

Kevin R. Adams and Joe Ksander are listed as the directors of the 2018 film Next Gen in Netflix’s structured movie metadata.

The film’s supplied synopsis follows a lonely girl, Mai, who forms a bond with a top-secret robot.

The trailer description identifies that robot as 7723 and presents their friendship as leading to mischief and a joint effort to stop a villain’s plan.

Sources and details

Watch Next Gen | Netflix Official Site

{
  "access_scope": "Kevin R. Adams: Netflix director credit and fictional premise; structured trailer description is not an independently viewed trailer or technical account of actual robotics. No individual directing-task allocation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "movie_dateCreated_exact": "2018-9-7",
    "retrieved_utc": "2026-10-07T18:17:22.898909+00:00",
    "trailer_upload_date": "2018-08-15T00:00:00.000Z"
  },
  "id": "person-coverage-e1df07a06b1edc::S1",
  "title": "Watch Next Gen | Netflix Official Site",
  "url": "https://www.netflix.com/title/80988892?fromWatch=true&source=35"
}

Kevin R. Adams: Netflix director credit and fictional premise; structured trailer description is not an independently viewed trailer or technical account of actual robotics. No individual directing-task allocation.

Kevin R. Adams: Netflix director credit and fictional premise; structured trailer description is not an independently viewed trailer or technical account of actual robotics. No individual directing-task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kurt Gödel

Kurt Gödel’s second incompleteness result is presented in Peano arithmetic, with provability expressed inside number theory, in Juliette Kennedy’s Stanford Encyclopedia of Philosophy account.

The account states that if Peano arithmetic is consistent, it cannot prove its own formalized consistency sentence, which denies that the system proves a contradiction such as zero equals one.

It distinguishes the ordinary consistency condition of this second result from the first theorem’s original omega-consistency assumption, which Rosser weakened in 1936.

Sources and details

Kurt Gödel (Stanford Encyclopedia of Philosophy)

{
  "access_scope": "Kurt Gödel: Expert scholarly account written by Juliette Kennedy, with Gödel as subject. Peano-arithmetic presentation and theorem-specific consistency conditions retained; later Rosser refinement distinct. No universal claim about every mathematical system or machine.",
  "authors": [
    "Kennedy, Juliette"
  ],
  "authors_in_source_order": [
    "Kennedy, Juliette"
  ],
  "dates": {
    "DCTERMS.issued": [
      "2007-02-13"
    ],
    "DCTERMS.modified": [
      "2025-09-10"
    ],
    "citation_publication_date": [
      "2007/02/13"
    ],
    "retrieved_utc": "2026-10-07T18:20:57.095725+00:00"
  },
  "id": "person-kurtgodel::S1",
  "title": "Kurt Gödel (Stanford Encyclopedia of Philosophy)",
  "url": "https://plato.stanford.edu/entries/goedel/index.html"
}

Kurt Gödel: Expert scholarly account written by Juliette Kennedy, with Gödel as subject. Peano-arithmetic presentation and theorem-specific consistency conditions retained; later Rosser refinement distinct. No universal claim about every mathematical system or machine.

Kurt Gödel: Expert scholarly account written by Juliette Kennedy, with Gödel as subject. Peano-arithmetic presentation and theorem-specific consistency conditions retained; later Rosser refinement distinct. No universal claim about every mathematical system or machine.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leonard J. Savage

Leonard J. Savage’s Foundations of Statistics develops an axiomatic route from assumptions about choice to personal probability and a utility function, according to the MacTutor biography.

The account connects that work with Bayesian statistics and treats gambling as another source of problems in probability and decision theory.

It also records his earlier collaboration with Milton Friedman on The Utility Analysis of Choices Involving Risk, published in 1948.

Sources and details

Leonard Jimmie Savage (1917 - 1971) - Biography - MacTutor History of Mathematics

{
  "access_scope": "Leonard J. Savage: Institutional scholarly biography, not original-book audit; canonical name bound by explicit same-page resource label Leonard J Savage under Other pages about Leonard Jimmie Savage, not inferred initial expansion.",
  "authors": [
    "J J O’Connor",
    "E F Robertson"
  ],
  "authors_in_source_order": [
    "J J O’Connor",
    "E F Robertson"
  ],
  "dates": {
    "last_update": "November 2010",
    "retrieved_utc": "2026-10-07T18:20:51.572920+00:00"
  },
  "id": "person-leonardjsavage::S1",
  "title": "Leonard Jimmie Savage  (1917 - 1971) - Biography - MacTutor History of Mathematics",
  "url": "https://mathshistory.st-andrews.ac.uk/Biographies/Savage/"
}

Leonard J. Savage: Institutional scholarly biography, not original-book audit; canonical name bound by explicit same-page resource label Leonard J Savage under Other pages about Leonard Jimmie Savage, not inferred initial expansion.

Leonard J. Savage: Institutional scholarly biography, not original-book audit; canonical name bound by explicit same-page resource label Leonard J Savage under Other pages about Leonard Jimmie Savage, not inferred initial expansion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Léon Bottou

Léon Bottou coauthored Gradient-Based Learning Applied to Document Recognition, whose 1998 submitted manuscript argues for learned recognition systems in place of extensive hand-designed heuristics.

Its abstract compares handwritten-digit recognition methods and highlights convolutional networks designed to handle variation in two-dimensional shapes.

It also presents Graph Transformer Networks for training multiple document-processing modules together against an overall performance measure.

Sources and details

Source

{
  "access_scope": "Léon Bottou: Exact joint manuscript byline, selected first-page abstract/intro only; submitted1998 manuscript is not silently the final published manifestation. No individual task allocation or universal benchmark superiority.",
  "authors": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "authors_in_source_order": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "dates": {
    "manuscript_header": "SUBMITTED TO PROCEEDINGS OF THE IEEE, 1998",
    "retrieved_utc": "2026-10-07T18:20:51.367740+00:00"
  },
  "id": "person-leonbottou::S1",
  "title": null,
  "url": "https://leon.bottou.org/publications/pdf/ieee-1998.pdf"
}

Léon Bottou: Exact joint manuscript byline, selected first-page abstract/intro only; submitted1998 manuscript is not silently the final published manifestation. No individual task allocation or universal benchmark superiority.

Léon Bottou: Exact joint manuscript byline, selected first-page abstract/intro only; submitted1998 manuscript is not silently the final published manifestation. No individual task allocation or universal benchmark superiority.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mary Shelley

Mary Shelley’s publisher biography traces Frankenstein to a ghost-story challenge during her 1816 stay near Lake Geneva and dates its publication to 1818.

The publisher presents the original 1818 text through a feminist reading of Shelley’s relationship with her mother, Mary Wollstonecraft, while crediting Charlotte Gordon with the edition’s introduction.

It also identifies Shelley’s later novel The Last Man, published in 1826, as a dystopian story set in the twenty-first century.

Sources and details

Frankenstein: The 1818 Text | Penguin Random House Retail

{
  "access_scope": "Mary Shelley: Publisher biography and attributed editorial interpretation; original1818 text and modern2018 edition distinguished, with Gordon/Robinson apparatus separate from Shelley’s authorship. No claims borrowed from Gutenberg’s automated summary.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article:modified_time": [
      "2017-09-12T18:06:17+00:00"
    ],
    "edition_on_sale": "Jan 16, 2018",
    "retrieved_utc": "2026-10-07T18:22:18.557931+00:00"
  },
  "id": "person-maryshelley::S1",
  "title": "Frankenstein: The 1818 Text | Penguin Random House Retail",
  "url": "https://www.penguinrandomhouseretail.com/book/?isbn=9780143131847"
}

Mary Shelley: Publisher biography and attributed editorial interpretation; original1818 text and modern2018 edition distinguished, with Gordon/Robinson apparatus separate from Shelley’s authorship. No claims borrowed from Gutenberg’s automated summary.

Mary Shelley: Publisher biography and attributed editorial interpretation; original1818 text and modern2018 edition distinguished, with Gordon/Robinson apparatus separate from Shelley’s authorship. No claims borrowed from Gutenberg’s automated summary.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Intrator

Michael Intrator’s signed CoreWeave account describes the company’s beginnings with a single GPU used for Ethereum mining in 2016.

He traces its growth through hardware acquisitions during the 2018–2019 crypto downturn and a shift toward serving businesses that needed GPU acceleration.

The account then identifies the 2019 purchase of Leonardo Render and launch of Concierge Render as steps toward a broader cloud-infrastructure business.

Sources and details

CoreWeave: Past, Present & Future

{
  "access_scope": "Michael Intrator: Author’s November3,2021 corporate retrospective; organizational events not all assigned as Intrator’s individual tasks. Generic2026 JSON-LD migration timestamps preserved separately, future2022 plans not verified as completed, promotional market-first claims omitted.",
  "authors": [
    "Michael Intrator"
  ],
  "authors_in_source_order": [
    "Michael Intrator"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:19:23.160060+00:00",
    "visible_publication_date": "November 3, 2021"
  },
  "id": "person-coverage-fd611f7b959ae1::S1",
  "title": "CoreWeave: Past, Present & Future",
  "url": "https://www.coreweave.com/blog/coreweave-past-present-future"
}

Michael Intrator: Author’s November3,2021 corporate retrospective; organizational events not all assigned as Intrator’s individual tasks. Generic2026 JSON-LD migration timestamps preserved separately, future2022 plans not verified as completed, promotional market-first claims omitted.

Michael Intrator: Author’s November3,2021 corporate retrospective; organizational events not all assigned as Intrator’s individual tasks. Generic2026 JSON-LD migration timestamps preserved separately, future2022 plans not verified as completed, promotional market-first claims omitted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Haffner

Patrick Haffner is a named coauthor of the 1998 submitted manuscript Gradient-Based Learning Applied to Document Recognition.

The abstract describes document recognition as a chain of field extraction, segmentation, recognition and language-modeling modules that Graph Transformer Networks can train globally.

Its bank-check example combines convolutional character recognizers with global training, tying the method to a concrete document-processing application.

Sources and details

Source

{
  "access_scope": "Patrick Haffner: Joint manuscript abstract only, not individual responsibility or recertified present deployment. Submitted1998 manifestation differs from a verified final published edition.",
  "authors": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "authors_in_source_order": [
    "Yann LeCun",
    "Léon Bottou",
    "Yoshua Bengio",
    "Patrick Haffner"
  ],
  "dates": {
    "manuscript_header": "SUBMITTED TO PROCEEDINGS OF THE IEEE, 1998",
    "retrieved_utc": "2026-10-07T18:20:51.367740+00:00"
  },
  "id": "person-patrickhaffner::S1",
  "title": null,
  "url": "https://leon.bottou.org/publications/pdf/ieee-1998.pdf"
}

Patrick Haffner: Joint manuscript abstract only, not individual responsibility or recertified present deployment. Submitted1998 manifestation differs from a verified final published edition.

Patrick Haffner: Joint manuscript abstract only, not individual responsibility or recertified present deployment. Submitted1998 manifestation differs from a verified final published edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pierre Bourdieu

Pierre Bourdieu’s The Forms of Capital treats capital as accumulated labor that can take materialized or embodied forms.

He argues that its accumulation takes time and that its persistence gives earlier history a continuing role in the opportunities available to social actors.

The opening discussion therefore challenges accounts of social life that recognize only immediately monetary forms of exchange, directing attention to cultural and social capital as well.

Sources and details

Source

{
  "access_scope": "Pierre Bourdieu: Original translated chapter argument attributed to Bourdieu, not universal measured law; Richard Nice translation separate from1983 original and1986 English handbook chapter. Selectedscan pages241–242 only; annotations are not author prose.",
  "authors": [
    "Pierre Bourdieu"
  ],
  "authors_in_source_order": [
    "Pierre Bourdieu"
  ],
  "dates": {
    "English_handbook_chapter": "1986",
    "original_German_publication": "1983",
    "retrieved_utc": "2026-10-07T18:11:15.606022+00:00"
  },
  "id": "person-coverage-05dc5aa6be031a::S1",
  "title": null,
  "url": "https://publish.illinois.edu/crittheory/files/2023/01/Bourdieu-The-Forms-of-Capital.pdf"
}

Pierre Bourdieu: Original translated chapter argument attributed to Bourdieu, not universal measured law; Richard Nice translation separate from1983 original and1986 English handbook chapter. Selectedscan pages241–242 only; annotations are not author prose.

Pierre Bourdieu: Original translated chapter argument attributed to Bourdieu, not universal measured law; Richard Nice translation separate from1983 original and1986 English handbook chapter. Selectedscan pages241–242 only; annotations are not author prose.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard J. Murnane

Richard J. Murnane coauthored the June 2001 NBER working paper The Skill Content of Recent Technological Change with David H. Autor and Frank Levy.

Their model distinguishes computers substituting for routine cognitive and manual tasks from complementing non-routine problem-solving and interactive tasks.

Using job-task data for 1960–1998, the abstract reports an association between computerization and lower relative demand for routine tasks alongside greater demand for non-routine cognitive tasks.

Sources and details

Source

{
  "access_scope": "Richard J. Murnane: Joint June2001 working-paper abstract; historical empirical association, not sole-person task allocation or a direct estimate of current generative-AI effects. Imperfect task substitution is the model condition; no full-table audit.",
  "authors": [
    "David H. Autor",
    "Frank Levy",
    "Richard J. Murnane"
  ],
  "authors_in_source_order": [
    "David H. Autor",
    "Frank Levy",
    "Richard J. Murnane"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:15:43.234541+00:00",
    "working_paper_issue": "June 2001"
  },
  "id": "person-coverage-ef2df340cbdda7::S1",
  "title": null,
  "url": "https://www.nber.org/system/files/working_papers/w8337/w8337.pdf"
}

Richard J. Murnane: Joint June2001 working-paper abstract; historical empirical association, not sole-person task allocation or a direct estimate of current generative-AI effects. Imperfect task substitution is the model condition; no full-table audit.

Richard J. Murnane: Joint June2001 working-paper abstract; historical empirical association, not sole-person task allocation or a direct estimate of current generative-AI effects. Imperfect task substitution is the model condition; no full-table audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Powers

Richard Powers’s Galatea 2.2 puts a fictional version of its author into a scientific center where a neurologist studies computer-based neural networks.

The novel’s author-site synopsis has the two characters train a neural network on a canonical list of Great Books.

As the device learns through repeated tutorials, it begins asking about its name, sex, race and reason for existing, turning the training project into questions of identity.

Sources and details

Source

{
  "access_scope": "Richard Powers: Author-site fictional synopsis, not evidence of actual machine consciousness. Author Richard Powers is distinct from fictional namesake; pageupdate March21,2018 and novelpublication1995 kept separate.",
  "authors": [
    "semper2013"
  ],
  "authors_in_source_order": [
    "semper2013"
  ],
  "dates": {
    "novel_publication": "1995",
    "page_last_updated": "March 21, 2018",
    "retrieved_utc": "2026-10-07T18:15:46.165189+00:00"
  },
  "id": "person-coverage-6b56810a2fae1b::S1",
  "title": "",
  "url": "https://www.richardpowers.net/galatea-2-2/"
}

Richard Powers: Author-site fictional synopsis, not evidence of actual machine consciousness. Author Richard Powers is distinct from fictional namesake; pageupdate March21,2018 and novelpublication1995 kept separate.

Richard Powers: Author-site fictional synopsis, not evidence of actual machine consciousness. Author Richard Powers is distinct from fictional namesake; pageupdate March21,2018 and novelpublication1995 kept separate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charlie Brooker

Charlie Brooker traces the premise of Black Mirror’s “Joan Is Awful” to watching The Dropout with his wife and imagining the discomfort of seeing private everyday moments dramatized on screen.

In Jean Bentley’s Netflix making-of account, he describes the anthology’s use of technology in place of supernatural forces as a way to open up fantastical ideas.

He calls the episode’s nested realities a logistical casting challenge, explaining that its multiple levels produce roughly 42 speaking parts.

Sources and details

'Black Mirror' Behind the Scenes of 'Joan Is Awful'

{
  "access_scope": "Jean Bentley’s Netflix Tudum article, published June 20, 2023 and modified July 20, 2023, reports Brooker’s comments about Black Mirror and the fictional “Joan Is Awful.” Its likeness agreements and AI-generated performances belong to the episode’s story; this account does not establish a real AI production workflow or assign collaborators’ casting, directing, design, or visual-effects work to Brooker.",
  "authors": [
    "Jean Bentley"
  ],
  "authors_in_source_order": [
    "Jean Bentley"
  ],
  "dates": {
    "inspected_source_date_1": "Published June 20, 2023",
    "inspected_source_date_2": "Modified July 20, 2023",
    "inspected_source_date_3": "Brooker conversation described as September 2022",
    "retrieved_utc": "2026-10-08T06:09:42.608039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published June 20, 2023",
    "Modified July 20, 2023",
    "Brooker conversation described as September 2022"
  ],
  "id": "creative-person-coverage-7d1518b47e0217::S1",
  "title": "'Black Mirror' Behind the Scenes of 'Joan Is Awful'",
  "url": "https://www.netflix.com/tudum/articles/black-mirror-joan-is-awful-season-6-behind-the-scenes"
}

Jean Bentley’s Netflix Tudum article, published June 20, 2023 and modified July 20, 2023, reports Brooker’s comments about Black Mirror and the fictional “Joan Is Awful.” Its likeness agreements and AI-generated performances belong to the episode’s story; this account does not establish a real AI production workflow or assign collaborators’ casting, directing, design, or visual-effects work to Brooker.

Jean Bentley’s Netflix Tudum article, published June 20, 2023 and modified July 20, 2023, reports Brooker’s comments about Black Mirror and the fictional “Joan Is Awful.” Its likeness agreements and AI-generated performances belong to the episode’s story; this account does not establish a real AI production workflow or assign collaborators’ casting, directing, design, or visual-effects work to Brooker.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Annamária Porkoláb-Minarik

Annamária Porkoláb-Minarik develops a theoretical model of how AI decision support and immersive VR/XR environments shape judgment in military settings.

The framework connects perception, cognitive processes and trust in technology, treating their interaction as a source of decision-making vulnerability.

It examines automation bias, cognitive overload and offloading, and the perceptual effects of simulations as risks that can combine to distort decisions.

Sources and details

Digitally Mediated Reality and Vulnerabilities in Decision-Making

{
  "access_scope": "Crossref's deposited abstract and explicit author given/family fields for DOI 10.32563/hsz.2026.ksz.9; selected Annamária Porkoláb-Minarik, sole deposited author. English paraphrase of Hungarian theoretical abstract; no empirical validation asserted. Identity reconstructed only from explicit given/family semantics, not by reordering prose.",
  "authors": [
    "Annamária Porkoláb-Minarik"
  ],
  "authors_in_source_order": [
    "Annamária Porkoláb-Minarik"
  ],
  "dates": {
    "inspected_source_date_1": "2026",
    "retrieved_utc": "2026-10-07T18:15:21.936250+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2026"
  ],
  "id": "person-coverage-7345544195c08e::S1",
  "title": "Digitally Mediated Reality and Vulnerabilities in Decision-Making",
  "url": "https://api.crossref.org/works/10.32563/hsz.2026.ksz.9"
}

Crossref's deposited abstract and explicit author given/family fields for DOI 10.32563/hsz.2026.ksz.9; selected Annamária Porkoláb-Minarik, sole deposited author. English paraphrase of Hungarian theoretical abstract; no empirical validation asserted. Identity reconstructed only from explicit given/family semantics, not by reordering prose.

Crossref's deposited abstract and explicit author given/family fields for DOI 10.32563/hsz.2026.ksz.9; selected Annamária Porkoláb-Minarik, sole deposited author. English paraphrase of Hungarian theoretical abstract; no empirical validation asserted. Identity reconstructed only from explicit given/family semantics, not by reordering prose.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank Levy

Frank Levy’s coauthored NBER study uses computers’ execution of rules-based procedures to explain changes in the task content of work.

Its model treats computer capital as a substitute for routine cognitive and manual tasks and a complement to non-routine problem-solving and interactive work, with predictions conditional on imperfect task substitution.

Using job-task data from 1960 to 1998, the paper associates computerization with declining demand for routine tasks and greater demand for non-routine cognitive tasks, including changes within occupations.

Sources and details

The Skill Content of Recent Technological Change: An Empirical Exploration

{
  "access_scope": "NBER Working Paper 8337, June 2001 manifestation; selected Frank Levy, ordered authors David H. Autor, Frank Levy, Richard J. Murnane. Cover and abstract visually inspected from exact original PDF; no individual experimental task assigned. Garbled cached extraction remains unchanged.",
  "authors": [
    "David H. Autor",
    "Frank Levy",
    "Richard J. Murnane"
  ],
  "authors_in_source_order": [
    "David H. Autor",
    "Frank Levy",
    "Richard J. Murnane"
  ],
  "dates": {
    "inspected_source_date_1": "June 2001",
    "retrieved_utc": "2026-10-07T18:15:43.234541+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 2001"
  ],
  "id": "person-coverage-72a65eede2f921::S1",
  "title": "The Skill Content of Recent Technological Change: An Empirical Exploration",
  "url": "https://www.nber.org/system/files/working_papers/w8337/w8337.pdf"
}

NBER Working Paper 8337, June 2001 manifestation; selected Frank Levy, ordered authors David H. Autor, Frank Levy, Richard J. Murnane. Cover and abstract visually inspected from exact original PDF; no individual experimental task assigned. Garbled cached extraction remains unchanged.

NBER Working Paper 8337, June 2001 manifestation; selected Frank Levy, ordered authors David H. Autor, Frank Levy, Richard J. Murnane. Cover and abstract visually inspected from exact original PDF; no individual experimental task assigned. Garbled cached extraction remains unchanged.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lisa Joy

In the Television Academy interview, Westworld co-creator Lisa Joy describes the series’ layered ideas and surprises as an invitation to revisit the story, while putting viewers’ concern for its characters ahead of mastering every plot detail.

She frames Dolores’s emerging freedom through the question of how sustained abuse changes someone who once wanted a peaceful life, leaving the characters to discover who they will become.

Joy also explains the laboratory nudity as deliberate dehumanization by technicians repairing the hosts, connecting the production choice to the androids’ vulnerability rather than a sexual experience.

Sources and details

Art of Darkness | Television Academy

{
  "access_scope": "Selected Lisa Joy, interviewed alongside Jonathan Nolan by Ann Farmer; claims concern Joy’s explicitly labeled answers about the fictional series in the edited May 11, 2017 interview, not Nolan’s individual production tasks.",
  "authors": [
    "Ann Farmer"
  ],
  "authors_in_source_order": [
    "Ann Farmer"
  ],
  "dates": {
    "inspected_source_date_1": "May 11, 2017",
    "retrieved_utc": "2026-10-08T06:09:45.590892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 11, 2017"
  ],
  "id": "person-coverage-1078d3679f05e2::S1",
  "title": "Art of Darkness | Television Academy",
  "url": "https://www.televisionacademy.com/features/news/features/art-darkness"
}

Selected Lisa Joy, interviewed alongside Jonathan Nolan by Ann Farmer; claims concern Joy’s explicitly labeled answers about the fictional series in the edited May 11, 2017 interview, not Nolan’s individual production tasks.

Selected Lisa Joy, interviewed alongside Jonathan Nolan by Ann Farmer; claims concern Joy’s explicitly labeled answers about the fictional series in the edited May 11, 2017 interview, not Nolan’s individual production tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Brown

Tom Brown is a coauthor of the 2022 Constitutional AI paper, which studies training an assistant from a stated set of principles without human labels identifying harmful outputs.

Its supervised stage generates self-critiques and revised answers, then fine-tunes the model on those revisions; its reinforcement stage uses AI comparisons to train a preference model that supplies the reward signal.

The authors report a less harmful assistant that explains objections instead of simply evading harmful requests, and describe reasoning-based supervision as a way to reduce human labeling requirements.

Sources and details

Constitutional AI: Harmlessness from AI Feedback

{
  "access_scope": "Selected Tom Brown; arXiv:2212.08073v1 abstract submitted December 15, 2022, joint-paper claims only. Full ordered coauthors retained in source metadata; no individual experimental allocation inferred.",
  "authors": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "authors_in_source_order": [
    "Bai, Yuntao",
    "Kadavath, Saurav",
    "Kundu, Sandipan",
    "Askell, Amanda",
    "Kernion, Jackson",
    "Jones, Andy",
    "Chen, Anna",
    "Goldie, Anna",
    "Mirhoseini, Azalia",
    "McKinnon, Cameron",
    "Chen, Carol",
    "Olsson, Catherine",
    "Olah, Christopher",
    "Hernandez, Danny",
    "Drain, Dawn",
    "Ganguli, Deep",
    "Li, Dustin",
    "Tran-Johnson, Eli",
    "Perez, Ethan",
    "Kerr, Jamie",
    "Mueller, Jared",
    "Ladish, Jeffrey",
    "Landau, Joshua",
    "Ndousse, Kamal",
    "Lukosuite, Kamile",
    "Lovitt, Liane",
    "Sellitto, Michael",
    "Elhage, Nelson",
    "Schiefer, Nicholas",
    "Mercado, Noemi",
    "DasSarma, Nova",
    "Lasenby, Robert",
    "Larson, Robin",
    "Ringer, Sam",
    "Johnston, Scott",
    "Kravec, Shauna",
    "Showk, Sheer El",
    "Fort, Stanislav",
    "Lanham, Tamera",
    "Telleen-Lawton, Timothy",
    "Conerly, Tom",
    "Henighan, Tom",
    "Hume, Tristan",
    "Bowman, Samuel R.",
    "Hatfield-Dodds, Zac",
    "Mann, Ben",
    "Amodei, Dario",
    "Joseph, Nicholas",
    "McCandlish, Sam",
    "Brown, Tom",
    "Kaplan, Jared"
  ],
  "dates": {
    "citation_date": "2022/12/15",
    "inspected_revision": "Thu, 15 Dec 2022 06:19:23 UTC (1,083 KB)",
    "original_submission": "2022/12/15",
    "retrieved_utc": "2026-10-07T17:54:15.831823+00:00",
    "version": "arXiv v1"
  },
  "id": "person-tombrown::S1",
  "title": "Constitutional AI: Harmlessness from AI Feedback",
  "url": "https://arxiv.org/abs/2212.08073",
  "version_url": "https://arxiv.org/abs/2212.08073v1"
}

Selected Tom Brown; arXiv:2212.08073v1 abstract submitted December 15, 2022, joint-paper claims only. Full ordered coauthors retained in source metadata; no individual experimental allocation inferred.

Selected Tom Brown; arXiv:2212.08073v1 abstract submitted December 15, 2022, joint-paper claims only. Full ordered coauthors retained in source metadata; no individual experimental allocation inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Hanks

In Finch, Tom Hanks plays a robotics engineer surviving a solar catastrophe who builds a robot to care for his dog after he is gone.

The engineer, the dog Goodyear and the robot Jeff leave their bunker for a dangerous journey through the American West, where Finch tries to teach his creation what it means to be alive.

Apple’s official synopsis makes their developing family depend on both keeping Jeff and Goodyear together and managing the hazards of the devastated world.

Sources and details

Finch - Apple TV Press

{
  "access_scope": "Selected Tom Hanks as performer of Finch; Apple’s official film synopsis, released November 5, 2021. Craig Luck and Ivor Powell are the listed writers; Caleb Landry Jones plays the robot. Fictional character actions are not Hanks’s technical achievements.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:56.298617+00:00"
  },
  "id": "person-coverage-2a79848d6f9b83::S1",
  "title": "Finch - Apple TV Press",
  "url": "https://www.apple.com/tv-pr/originals/finch/"
}

Selected Tom Hanks as performer of Finch; Apple’s official film synopsis, released November 5, 2021. Craig Luck and Ivor Powell are the listed writers; Caleb Landry Jones plays the robot. Fictional character actions are not Hanks’s technical achievements.

Selected Tom Hanks as performer of Finch; Apple’s official film synopsis, released November 5, 2021. Craig Luck and Ivor Powell are the listed writers; Caleb Landry Jones plays the robot. Fictional character actions are not Hanks’s technical achievements.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rod Serling

Ithaca College’s account connects Rod Serling’s use of television to criticism of war, prejudice and corporate power, and describes censorship conflicts as a reason for his move from live drama to The Twilight Zone.

For that filmed anthology he hosted the entire run and wrote 92 of its 156 scripts, joining his onscreen presentation to a substantial body of original dramatic writing.

The college’s archive preserves typed scripts and original sponsor films from the series’ first network run, providing concrete material for examining the relationship between his stories and their broadcast setting.

Sources and details

About Rod Serling | Ithaca College

{
  "access_scope": "Selected Rod Serling; institutional account of his work and the college’s own archive holdings. Counts and censorship relationship reflect this source; no script claims assigned from other writers’ episodes.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "The Twilight Zone original run 1959–64",
    "retrieved_utc": "2026-10-08T06:09:41.919773+00:00"
  },
  "dates_exact_in_source_role_order": [
    "The Twilight Zone original run 1959–64"
  ],
  "id": "person-coverage-1906095d88b03a::S1",
  "title": "About Rod Serling | Ithaca College",
  "url": "https://www.ithaca.edu/node/45197"
}

Selected Rod Serling; institutional account of his work and the college’s own archive holdings. Counts and censorship relationship reflect this source; no script claims assigned from other writers’ episodes.

Selected Rod Serling; institutional account of his work and the college’s own archive holdings. Counts and censorship relationship reflect this source; no script claims assigned from other writers’ episodes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Syd Mead

ArtCenter’s Syd Mead collection preserves 419 sketches, drawings and paintings from his student years, with transportation designs ranging from rough pencil studies to crayon and gouache renderings.

Its vehicle drawings combine futuristic forms with handwritten specifications, including transit-vehicle engine, control, cabin and suspension details rather than exterior styling alone.

The collection also includes life drawing, lettering, product illustration and a book of 21 fashion diptychs, allowing his costumed figures and vehicle settings to be examined alongside the other disciplines of his student practice.

Sources and details

Syd Mead artwork -

{
  "access_scope": "Selected Syd Mead, explicit collection subject and creator; ArtCenter archive description of its 1956–1959 student-work holdings, not a claim that later film designs are in this collection. Institutional descriptions inspected; images not copied or visually interpreted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Collection creation 1956–1959",
    "retrieved_utc": "2026-10-08T06:09:16.580138+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Collection creation 1956–1959"
  ],
  "id": "person-coverage-5d32edad4856b8::S1",
  "title": "Syd Mead artwork - ",
  "url": "https://archives.artcenter.edu/syd-mead-artwork"
}

Selected Syd Mead, explicit collection subject and creator; ArtCenter archive description of its 1956–1959 student-work holdings, not a claim that later film designs are in this collection. Institutional descriptions inspected; images not copied or visually interpreted.

Selected Syd Mead, explicit collection subject and creator; ArtCenter archive description of its 1956–1959 student-work holdings, not a claim that later film designs are in this collection. Institutional descriptions inspected; images not copied or visually interpreted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Abraham L. Newman

Abraham L. Newman and Henry Farrell’s Weaponized Interdependence explains how the structure of global economic networks can concentrate enduring power in a few central nodes.

The paper’s summary distinguishes using that position to collect valuable information from using it to deny adversaries access to a network.

It identifies United States counterterrorism and nonproliferation activity as applications of this network advantage, treating interdependence as a potential instrument of state coercion.

Sources and details

Weaponized Interdependence: How Global Economic Networks Shape State Coercion | The Belfer Center for Science and International Affairs

{
  "access_scope": "Selected Abraham L. Newman; ordered coauthors Henry Farrell, Abraham L. Newman. Belfer’s summary and recommended citation for International Security 44(1), Summer 2019, pp.42–79; joint-paper claims, not independent allocations or full-article inspection.",
  "authors": [
    "Henry Farrell",
    "Abraham L. Newman"
  ],
  "authors_in_source_order": [
    "Henry Farrell",
    "Abraham L. Newman"
  ],
  "dates": {
    "inspected_source_date_1": "Summer2019",
    "retrieved_utc": "2026-10-08T05:51:21.775960+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Summer2019"
  ],
  "id": "person-coverage-902c1fcee4b48b::S1",
  "title": "Weaponized Interdependence: How Global Economic Networks Shape State Coercion | The Belfer Center for Science and International Affairs",
  "url": "https://www.belfercenter.org/publication/weaponized-interdependence-how-global-economic-networks-shape-state-coercion"
}

Selected Abraham L. Newman; ordered coauthors Henry Farrell, Abraham L. Newman. Belfer’s summary and recommended citation for International Security 44(1), Summer 2019, pp.42–79; joint-paper claims, not independent allocations or full-article inspection.

Selected Abraham L. Newman; ordered coauthors Henry Farrell, Abraham L. Newman. Belfer’s summary and recommended citation for International Security 44(1), Summer 2019, pp.42–79; joint-paper claims, not independent allocations or full-article inspection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Kang

Alex Kang is a coauthor of a study that extends protein design to bind flexible, helix-forming peptide targets, using parametric scaffolds and deep learning approaches.

The researchers adapt RFdiffusion to flexible targets and use partial diffusion to refine structures, reporting picomolar-affinity designs from either existing starting designs or random noise without subsequent experimental optimization.

The designs support hormone enrichment and mass-spectrometry detection of parathyroid hormone and glucagon, as well as bioluminescent protein biosensors.

Sources and details

De novo design of high-affinity binders of bioactive helical peptides | Nature

{
  "access_scope": "Selected Alex Kang, exact full-name coauthor in Nature’s De novo design of high-affinity binders of bioactive helical peptides; abstract and opening method text inspected. Full ordered authors retained; experimental contribution is not allocated to Kang individually.",
  "authors": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2024/02",
    "inspected_source_date_1": "February 2024 issue date in publisher metadata",
    "retrieved_utc": "2026-10-08T06:17:24.033049+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 2024 issue date in publisher metadata"
  ],
  "id": "person-coverage-d3e1716be53ec8::S1",
  "title": "De novo design of high-affinity binders of bioactive helical peptides | Nature",
  "url": "https://www.nature.com/articles/s41586-023-06953-1"
}

Selected Alex Kang, exact full-name coauthor in Nature’s De novo design of high-affinity binders of bioactive helical peptides; abstract and opening method text inspected. Full ordered authors retained; experimental contribution is not allocated to Kang individually.

Selected Alex Kang, exact full-name coauthor in Nature’s De novo design of high-affinity binders of bioactive helical peptides; abstract and opening method text inspected. Full ordered authors retained; experimental contribution is not allocated to Kang individually.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Asim K. Bera

Asim K. Bera is a co-author of the study that uses parametric design and deep learning to create protein binders for flexible, biologically active helical peptides.

The joint study extends RFdiffusion to flexible targets and partial diffusion, reporting picomolar-affinity designs without subsequent experimental optimization.

Its demonstrated applications include enriching parathyroid hormone and glucagon for mass-spectrometry detection and constructing bioluminescent protein biosensors.

Sources and details

De novo design of high-affinity binders of bioactive helical peptides | Nature

{
  "access_scope": "Selected co-author only; joint computational design and reported experimental applications do not assign Bera any individual design, assay or software task. February 2024 publisher issue metadata remains distinct from retrieval.",
  "authors": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "authors_in_source_order": [
    "Vázquez Torres, Susana",
    "Leung, Philip J. Y.",
    "Venkatesh, Preetham",
    "Lutz, Isaac D.",
    "Hink, Fabian",
    "Huynh, Huu-Hien",
    "Becker, Jessica",
    "Yeh, Andy Hsien-Wei",
    "Juergens, David",
    "Bennett, Nathaniel R.",
    "Hoofnagle, Andrew N.",
    "Huang, Eric",
    "MacCoss, Michael J.",
    "Expòsit, Marc",
    "Lee, Gyu Rie",
    "Bera, Asim K.",
    "Kang, Alex",
    "De La Cruz, Joshmyn",
    "Levine, Paul M.",
    "Li, Xinting",
    "Lamb, Mila",
    "Gerben, Stacey R.",
    "Murray, Analisa",
    "Heine, Piper",
    "Korkmaz, Elif Nihal",
    "Nivala, Jeff",
    "Stewart, Lance",
    "Watson, Joseph L.",
    "Rogers, Joseph M.",
    "Baker, David"
  ],
  "dates": {
    "citation_publication_date": "2024/02",
    "inspected_source_date_1": "February 2024 issue date in publisher metadata",
    "retrieved_utc": "2026-10-08T06:17:24.033049+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 2024 issue date in publisher metadata"
  ],
  "id": "person-coverage-a2114969ca92e9::S1",
  "title": "De novo design of high-affinity binders of bioactive helical peptides | Nature",
  "url": "https://www.nature.com/articles/s41586-023-06953-1"
}

Selected co-author only; joint computational design and reported experimental applications do not assign Bera any individual design, assay or software task. February 2024 publisher issue metadata remains distinct from retrieval.

Selected co-author only; joint computational design and reported experimental applications do not assign Bera any individual design, assay or software task. February 2024 publisher issue metadata remains distinct from retrieval.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chiaki J. Konaka

In Production I.G’s Ghost Hound talk session, scriptwriter Chiaki J. Konaka distinguishes Shirow Masamune’s original proposal and draft from the complete storyline he developed for the series.

Konaka describes the setting as a realistic boys’ tale in fictional Suiten, modeled partly on Kurume, and credits the production staff’s demanding work on the local dialect.

He recalls that he and director Ryutaro Nakamura discussed Twin Peaks while shaping the project around the possibility that a delusion could encompass many different things.

Sources and details

Ryutaro Nakamura & Chiaki J. Konaka talk session

{
  "access_scope": "Selected interview subject’s explicitly labeled answers; Masamune proposal, Konaka storyline, Nakamura direction and staff dialect work remain distinct. Fictional narrative, not an empirical account of AI.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:17:26.162610+00:00",
    "work_copyright": "2007"
  },
  "id": "person-coverage-d19374d7b1b1b2::S1",
  "title": "Ryutaro Nakamura & Chiaki J. Konaka talk session",
  "url": "https://www.productionig.com/contents/works_sp/60_/s08_/000788.html"
}

Selected interview subject’s explicitly labeled answers; Masamune proposal, Konaka storyline, Nakamura direction and staff dialect work remain distinct. Fictional narrative, not an empirical account of AI.

Selected interview subject’s explicitly labeled answers; Masamune proposal, Konaka storyline, Nakamura direction and staff dialect work remain distinct. Fictional narrative, not an empirical account of AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henry Sanderson

Henry Sanderson’s Volt Rush investigates how the clean-energy transition shifts economic power toward the metals and rare earths used in computers, batteries and electric vehicles.

The publisher describes his reporting as connecting mines in the Congo and Chile’s Atacama Desert with Chinese battery factories, commodity traders and scientists confronting the resource demands of a greener world.

Its author profile places that inquiry alongside Sanderson’s commodities and mining coverage for the Financial Times and his earlier reporting in China, where he co-authored China’s Superbank.

Sources and details

Volt Rush | Book by Henry Sanderson | Official Publisher Page | Simon & Schuster

{
  "access_scope": "Publisher synopsis and author biography; September 13, 2022 refers to the listed hardcover edition, not a universal first-publication claim. China’s Superbank is co-authored, not solely authored.",
  "authors": [
    "Henry Sanderson"
  ],
  "authors_in_source_order": [
    "Henry Sanderson"
  ],
  "dates": {
    "inspected_source_date_1": "September13,2022",
    "retrieved_utc": "2026-10-08T05:51:30.302627+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September13,2022"
  ],
  "id": "person-coverage-0fd6a3207e1347::S1",
  "title": "Volt Rush | Book by Henry Sanderson | Official Publisher Page | Simon & Schuster",
  "url": "https://www.simonandschuster.net/books/Volt-Rush/Henry-Sanderson/9780861543755"
}

Publisher synopsis and author biography; September 13, 2022 refers to the listed hardcover edition, not a universal first-publication claim. China’s Superbank is co-authored, not solely authored.

Publisher synopsis and author biography; September 13, 2022 refers to the listed hardcover edition, not a universal first-publication claim. China’s Superbank is co-authored, not solely authored.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ian Cheng

Ian Cheng’s Emissaries trilogy consists of computer-generated simulations in which flora and fauna interact and recombine into open-ended narratives.

The Serpentine exhibition account describes behavioral agents operating through complex logic, emergence and multiple AI models, with drives programmed by Cheng but allowed to evolve without continuing authorial direction.

Cheng frames these unpredictable virtual ecosystems as a way for viewers to exercise the confusion, anxiety and cognitive dissonance that accompany change.

Sources and details

Ian Cheng: Emissaries - Serpentine Galleries

{
  "access_scope": "Exhibiting institution’s account of the 2015–17 trilogy shown April 24–May 28, 2018; artwork simulation and stated viewing purpose do not establish biological consciousness or a scientific validation result.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Trilogy 2015–17; exhibition April 24–May 28, 2018",
    "retrieved_utc": "2026-10-08T06:09:43.640753+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Trilogy 2015–17; exhibition April 24–May 28, 2018"
  ],
  "id": "person-coverage-8022b4b1e64ea3::S1",
  "title": "Ian Cheng: Emissaries - Serpentine Galleries",
  "url": "https://www.serpentinegalleries.org/whats-on/ian-cheng-emissaries/"
}

Exhibiting institution’s account of the 2015–17 trilogy shown April 24–May 28, 2018; artwork simulation and stated viewing purpose do not establish biological consciousness or a scientific validation result.

Exhibiting institution’s account of the 2015–17 trilogy shown April 24–May 28, 2018; artwork simulation and stated viewing purpose do not establish biological consciousness or a scientific validation result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jerome Bruner

Jerome Bruner co-authored A Study of Thinking, which Steven Pinker’s Harvard account presents as treating people as constructive problem-solvers as they learn new concepts.

That account places the work within the shift away from explaining cognition solely through stimulus-and-response behavior.

Bruner and George Miller founded Harvard’s Center for Cognitive Studies in 1960, giving this emerging approach an institutional base.

Sources and details

The Cognitive Revolution — Harvard Gazette

{
  "access_scope": "Historical institutional article by Steven Pinker published October 2011; co-authored book and jointly founded center, not sole field invention or attribution of later practical applications to Bruner.",
  "authors": [
    "Steven Pinker"
  ],
  "authors_in_source_order": [
    "Steven Pinker"
  ],
  "dates": {
    "page_published_metadata": "2011-10-13T00:35:05+00:00",
    "retrieved_utc": "2026-10-07T18:19:17.096484+00:00"
  },
  "id": "person-jeromebruner::S1",
  "title": "The Cognitive Revolution — Harvard Gazette",
  "url": "https://news.harvard.edu/gazette/story/2011/10/the-cognitive-revolution/"
}

Historical institutional article by Steven Pinker published October 2011; co-authored book and jointly founded center, not sole field invention or attribution of later practical applications to Bruner.

Historical institutional article by Steven Pinker published October 2011; co-authored book and jointly founded center, not sole field invention or attribution of later practical applications to Bruner.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Etchemendy

John Etchemendy is one of the co-authors of On the Opportunities and Risks of Foundation Models, an interdisciplinary report about models trained on broad data at scale and adaptable to many downstream tasks.

The report examines their capabilities, technical foundations, applications and social effects, emphasizing that scale produces emergent behavior whose limits remain poorly understood.

It warns that reusing a common foundation can transmit defects to adapted models and calls for interdisciplinary research into when these systems fail.

Sources and details

On the Opportunities and Risks of Foundation Models

{
  "access_scope": "Joint report claims, not Etchemendy’s individual allocated writing or engineering. First submission August 16, 2021; inspected arXiv v3 July 12, 2022. Abstract scope rather than full PDF.",
  "authors": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "authors_in_source_order": [
    "Bommasani, Rishi",
    "Hudson, Drew A.",
    "Adeli, Ehsan",
    "Altman, Russ",
    "Arora, Simran",
    "von Arx, Sydney",
    "Bernstein, Michael S.",
    "Bohg, Jeannette",
    "Bosselut, Antoine",
    "Brunskill, Emma",
    "Brynjolfsson, Erik",
    "Buch, Shyamal",
    "Card, Dallas",
    "Castellon, Rodrigo",
    "Chatterji, Niladri",
    "Chen, Annie",
    "Creel, Kathleen",
    "Davis, Jared Quincy",
    "Demszky, Dora",
    "Donahue, Chris",
    "Doumbouya, Moussa",
    "Durmus, Esin",
    "Ermon, Stefano",
    "Etchemendy, John",
    "Ethayarajh, Kawin",
    "Fei-Fei, Li",
    "Finn, Chelsea",
    "Gale, Trevor",
    "Gillespie, Lauren",
    "Goel, Karan",
    "Goodman, Noah",
    "Grossman, Shelby",
    "Guha, Neel",
    "Hashimoto, Tatsunori",
    "Henderson, Peter",
    "Hewitt, John",
    "Ho, Daniel E.",
    "Hong, Jenny",
    "Hsu, Kyle",
    "Huang, Jing",
    "Icard, Thomas",
    "Jain, Saahil",
    "Jurafsky, Dan",
    "Kalluri, Pratyusha",
    "Karamcheti, Siddharth",
    "Keeling, Geoff",
    "Khani, Fereshte",
    "Khattab, Omar",
    "Koh, Pang Wei",
    "Krass, Mark",
    "Krishna, Ranjay",
    "Kuditipudi, Rohith",
    "Kumar, Ananya",
    "Ladhak, Faisal",
    "Lee, Mina",
    "Lee, Tony",
    "Leskovec, Jure",
    "Levent, Isabelle",
    "Li, Xiang Lisa",
    "Li, Xuechen",
    "Ma, Tengyu",
    "Malik, Ali",
    "Manning, Christopher D.",
    "Mirchandani, Suvir",
    "Mitchell, Eric",
    "Munyikwa, Zanele",
    "Nair, Suraj",
    "Narayan, Avanika",
    "Narayanan, Deepak",
    "Newman, Ben",
    "Nie, Allen",
    "Niebles, Juan Carlos",
    "Nilforoshan, Hamed",
    "Nyarko, Julian",
    "Ogut, Giray",
    "Orr, Laurel",
    "Papadimitriou, Isabel",
    "Park, Joon Sung",
    "Piech, Chris",
    "Portelance, Eva",
    "Potts, Christopher",
    "Raghunathan, Aditi",
    "Reich, Rob",
    "Ren, Hongyu",
    "Rong, Frieda",
    "Roohani, Yusuf",
    "Ruiz, Camilo",
    "Ryan, Jack",
    "Ré, Christopher",
    "Sadigh, Dorsa",
    "Sagawa, Shiori",
    "Santhanam, Keshav",
    "Shih, Andy",
    "Srinivasan, Krishnan",
    "Tamkin, Alex",
    "Taori, Rohan",
    "Thomas, Armin W.",
    "Tramèr, Florian",
    "Wang, Rose E.",
    "Wang, William",
    "Wu, Bohan",
    "Wu, Jiajun",
    "Wu, Yuhuai",
    "Xie, Sang Michael",
    "Yasunaga, Michihiro",
    "You, Jiaxuan",
    "Zaharia, Matei",
    "Zhang, Michael",
    "Zhang, Tianyi",
    "Zhang, Xikun",
    "Zhang, Yuhui",
    "Zheng, Lucia",
    "Zhou, Kaitlyn",
    "Liang, Percy"
  ],
  "dates": {
    "citation_date": "2021/08/16",
    "inspected_revision": "Tue, 12 Jul 2022 23:45:14 UTC (40,407 KB)",
    "retrieved_utc": "2026-10-07T17:55:07.326325+00:00",
    "version": "arXiv v 3"
  },
  "id": "person-coverage-fd66b911699be8::S1",
  "title": "On the Opportunities and Risks of Foundation Models",
  "url": "https://arxiv.org/abs/2108.07258",
  "version_url": "https://arxiv.org/abs/2108.07258v3"
}

Joint report claims, not Etchemendy’s individual allocated writing or engineering. First submission August 16, 2021; inspected arXiv v3 July 12, 2022. Abstract scope rather than full PDF.

Joint report claims, not Etchemendy’s individual allocated writing or engineering. First submission August 16, 2021; inspected arXiv v3 July 12, 2022. Abstract scope rather than full PDF.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Swift

Jonathan Swift’s Gulliver’s Travels depicts a professor at Lagado who promises that mechanical word recombination will let an untrained person produce books across many fields without study.

Students turn handles to rearrange words on a frame, read out combinations that resemble fragments of sentences, and dictate them to scribes.

The professor plans to assemble those fragments into a comprehensive body of knowledge and seeks support for hundreds of additional frames, making automated composition an explicit subject of the fictional episode.

Sources and details

Gulliver’s Travels | Project Gutenberg

{
  "access_scope": "Primary fictional text, Part III chapter V; Gutenberg transcription and original publication 1726–7 remain distinct. No demonstrated modern AI mechanism or proven historical influence is claimed.",
  "authors": [
    "Jonathan Swift"
  ],
  "authors_in_source_order": [
    "Jonathan Swift"
  ],
  "dates": {
    "inspected_source_date_1": "Firstpublished1726–7 asreproductionheaderstates",
    "retrieved_utc": "2026-10-08T05:51:22.299003+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Firstpublished1726–7 asreproductionheaderstates"
  ],
  "id": "person-coverage-8abe6b327ff913::S1",
  "title": "Gulliver’s Travels | Project Gutenberg",
  "url": "https://www.gutenberg.org/files/829/829-h/829-h.htm"
}

Primary fictional text, Part III chapter V; Gutenberg transcription and original publication 1726–7 remain distinct. No demonstrated modern AI mechanism or proven historical influence is claimed.

Primary fictional text, Part III chapter V; Gutenberg transcription and original publication 1726–7 remain distinct. No demonstrated modern AI mechanism or proven historical influence is claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph Gordon-Levitt

Joseph Gordon-Levitt’s December 2025 announcement presents the Creators Coalition on AI as an effort to unite entertainment workers and digital creators around the effects of generative AI.

He distinguishes his enthusiasm for the technology’s creative potential from his criticism of AI companies’ business practices and says artists and the skilled people around them share the stakes.

The announcement proposes public pressure, collective action, possible litigation and eventual legislation as routes for creators to exercise influence, while describing the organization as newly formed.

Sources and details

Announcing the Creators' Coalition on AI

{
  "access_scope": "Author’s own dated transcript, December 16, 2025; proposed advocacy routes, not achieved legal outcomes. Daniel Kwan’s initiating role remains credited and no sole organizational creation is inferred.",
  "authors": [
    "Joseph Gordon-Levitt"
  ],
  "authors_in_source_order": [
    "Joseph Gordon-Levitt"
  ],
  "dates": {
    "inspected_source_date_1": "December 16, 2025",
    "retrieved_utc": "2026-10-08T06:09:19.339958+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 16, 2025"
  ],
  "id": "person-coverage-cf37e8b06b3d42::S1",
  "title": "Announcing the Creators' Coalition on AI",
  "url": "https://journal.hitrecord.org/p/announcing-the-creators-coalition"
}

Author’s own dated transcript, December 16, 2025; proposed advocacy routes, not achieved legal outcomes. Daniel Kwan’s initiating role remains credited and no sole organizational creation is inferred.

Author’s own dated transcript, December 16, 2025; proposed advocacy routes, not achieved legal outcomes. Daniel Kwan’s initiating role remains credited and no sole organizational creation is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joshua Kushner

Joshua Kushner is identified as Thrive Capital’s founder and CEO in Isomorphic Labs’ May 2026 announcement of a $2.1 billion Series B round led by Thrive.

His quoted rationale emphasizes growing conviction in the team’s progress toward a unified AI drug-design engine and continuing support for its disease-focused mission.

The company says the funding will develop and deploy that engine, expand therapeutic programs toward the clinic and support hiring.

Sources and details

Isomorphic Labs 2.0

{
  "access_scope": "Exact May 12, 2026 cached release, Series B $2.1B, not the earlier $600M round. Investor role and attributed opinion only; no individual research task, patient efficacy or clinical success inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:00:55.578226+00:00",
    "visible_or_selected_document_date": "2026-05-12"
  },
  "dates_exact_in_source_role_order": [
    {
      "role": "visible_or_selected_document_date",
      "value": "2026-05-12"
    }
  ],
  "id": "person-coverage-92532433969d21::S1",
  "title": "Isomorphic Labs 2.0",
  "url": "https://www.isomorphiclabs.com/press/isomorphic-labs-funding"
}

Exact May 12, 2026 cached release, Series B $2.1B, not the earlier $600M round. Investor role and attributed opinion only; no individual research task, patient efficacy or clinical success inferred.

Exact May 12, 2026 cached release, Series B $2.1B, not the earlier $600M round. Investor role and attributed opinion only; no individual research task, patient efficacy or clinical success inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael G. Jacobides

Michael G. Jacobides co-authored Externalities and Complementarities in Platforms and Ecosystems with Carmelo Cennamo and Annabelle Gawer, as listed with its abstract on Gawer’s university profile.

The joint article proposes that platforms and ecosystems respond to distinct market failures by helping economic actors interact to create and capture value.

It also analyzes functional and distributional failures that these structures can generate themselves, linking their advantages to the problems that can arise after their formation.

Sources and details

Prof Annabelle Gawer | University of Surrey

{
  "access_scope": "University-hosted publication credit and abstract for Research Policy 53(1), 104906 (2024), DOI 10.1016/j.respol.2023.104906. Joint theory propositions, not Jacobides’s allocated task or an empirical causal result.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:02:20.187607+00:00"
  },
  "id": "person-coverage-130557c8922550::S1",
  "title": "Prof Annabelle Gawer | University of Surrey",
  "url": "https://www.surrey.ac.uk/people/annabelle-gawer"
}

University-hosted publication credit and abstract for Research Policy 53(1), 104906 (2024), DOI 10.1016/j.respol.2023.104906. Joint theory propositions, not Jacobides’s allocated task or an empirical causal result.

University-hosted publication credit and abstract for Research Policy 53(1), 104906 (2024), DOI 10.1016/j.respol.2023.104906. Joint theory propositions, not Jacobides’s allocated task or an empirical causal result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Discourse on the Method

In the opening of Discourse on the Method, Descartes argues that differences in judgment arise from how people direct their thoughts rather than from unequal possession of reason.

He presents the work as an account of his own intellectual path, inviting readers to judge its examples instead of prescribing a method everyone must follow.

His account of education turns from hoping to gain clear knowledge toward recognizing the doubts, errors and ignorance that remained after his studies.

Sources and details

Discours de la méthode

{
  "access_scope": "French electronic edition; opening part and edition credit only; PDF pages 2, 6 and 7 visually inspected.",
  "authors": [
    "René Descartes"
  ],
  "authors_in_source_order": [
    "René Descartes"
  ],
  "dates": {
    "inspected_source_date_1": "1637 work date",
    "inspected_source_date_2": "19 February 2002 electronic edition",
    "retrieved_utc": "2026-10-08T06:44:26.511711+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1637 work date",
    "19 February 2002 electronic edition"
  ],
  "id": "work-culture-a47dc3d468ece4::S1",
  "title": "Discours de la méthode",
  "url": "https://classiques.uqam.ca/classiques/Descartes/discours_methode/Discours_methode.pdf"
}

French electronic edition; opening part and edition credit only; PDF pages 2, 6 and 7 visually inspected.

French electronic edition; opening part and edition credit only; PDF pages 2, 6 and 7 visually inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 1637
}

Ventus

The publisher's synopsis places Ventus on a terraformed planet where the Winds are AIs that destroy technology to protect the environment they created.

Jordan Mason's visions draw him into the investigations of the offworld human Calandria May, while both human and AI searchers see him as pivotal to the planet's future.

The opening excerpt contrasts Jordan's everyday work as a mason with unfamiliar mechanical life and a steam car, introducing technology through the inhabitants' local understanding.

Sources and details

Ventus

{
  "access_scope": "Tor eBook ISBN 9781466800076, on sale 19 November 2001; excerpt copyright 2000. Publisher synopsis and opening excerpt; no full-work audit.",
  "authors": [
    "Karl Schroeder"
  ],
  "authors_in_source_order": [
    "Karl Schroeder"
  ],
  "dates": {
    "inspected_source_date_1": "2000 excerpt copyright",
    "inspected_source_date_2": "19 November 2001 publisher on-sale date",
    "retrieved_utc": "2026-10-08T06:44:26.511667+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2000 excerpt copyright",
    "19 November 2001 publisher on-sale date"
  ],
  "id": "work-culture-7d425dd8eeb12f::S1",
  "title": "Ventus",
  "url": "https://us.macmillan.com/books/9781466800076/ventus/"
}

Tor eBook ISBN 9781466800076, on sale 19 November 2001; excerpt copyright 2000. Publisher synopsis and opening excerpt; no full-work audit.

Tor eBook ISBN 9781466800076, on sale 19 November 2001; excerpt copyright 2000. Publisher synopsis and opening excerpt; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author bibliography identifies Tor Books December 2000.",
  "dated": true,
  "year": 2000
}

Lady of Mazes

The publisher's synopsis sets Lady of Mazes on Teven Coronal, a ringworld whose many civilizations face invaders threatening their ecologies and diversity.

In the opening excerpt, Livia Kodaly filters a Society of real people and AI imitations through her neural implants, making mediated perception part of ordinary social life.

Her agents report actions taken by her anima while she was elsewhere, exposing how an accurate personal imitation can affect her reputation and obligations.

Sources and details

Lady of Mazes

{
  "access_scope": "Tor eBook ISBN 9781466807587, on sale 27 June 2006; excerpt copyright 2005. Publisher synopsis and Part One chapter 1; no full-work audit.",
  "authors": [
    "Karl Schroeder"
  ],
  "authors_in_source_order": [
    "Karl Schroeder"
  ],
  "dates": {
    "inspected_source_date_1": "2005 excerpt copyright",
    "inspected_source_date_2": "27 June 2006 publisher on-sale date",
    "retrieved_utc": "2026-10-08T06:44:26.511570+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2005 excerpt copyright",
    "27 June 2006 publisher on-sale date"
  ],
  "id": "work-culture-07503b098cc7e7::S1",
  "title": "Lady of Mazes",
  "url": "https://us.macmillan.com/books/9781466807587/ladyofmazes/"
}

Tor eBook ISBN 9781466807587, on sale 27 June 2006; excerpt copyright 2005. Publisher synopsis and Part One chapter 1; no full-work audit.

Tor eBook ISBN 9781466807587, on sale 27 June 2006; excerpt copyright 2005. Publisher synopsis and Part One chapter 1; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author lists Tor July 2005; set in same universe as Ventus.",
  "dated": true,
  "year": 2005
}

Quarantine

Greg Egan's posted opening excerpt of Quarantine introduces a private investigator receiving a missing-person assignment through a neural modification while asleep.

The passage distinguishes sensory communication from information delivered directly as knowledge, while the investigator remains wary that the client's framing may be deceptive.

A simulated appearance of his dead wife and the empty sky beyond the Bubble place altered perception and confinement alongside the investigation; the author's page identifies the novel's original publication as 1992.

Sources and details

Quarantine

{
  "access_scope": "Author-hosted chapter 1 excerpt and publication history, original 1992 novel; later print and digital manifestations listed separately; no full-work audit.",
  "authors": [
    "Greg Egan"
  ],
  "authors_in_source_order": [
    "Greg Egan"
  ],
  "dates": {
    "inspected_source_date_1": "1992 original publication and copyright",
    "retrieved_utc": "2026-10-08T06:44:26.970238+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1992 original publication and copyright"
  ],
  "id": "work-culture-cef50fe840ba74::S1",
  "title": "Quarantine",
  "url": "https://www.gregegan.net/QUARANTINE/Excerpt/QuarantineExcerpt.html"
}

Author-hosted chapter 1 excerpt and publication history, original 1992 novel; later print and digital manifestations listed separately; no full-work audit.

Author-hosted chapter 1 excerpt and publication history, original 1992 novel; later print and digital manifestations listed separately; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author bibliography dates first Century/Legend edition 1992; quantum mechanisms are fictional premises.",
  "dated": true,
  "year": 1992
}

Schild's Ladder

In Greg Egan's opening excerpt of Schild's Ladder, Cass considers a fictional model in which graph connections and quantum transition rules underlie particles and space.

She has travelled to Mimosa Station to present a proposal, transmitting herself and accepting a tiny artificial body rather than waiting centuries for an exchange from Earth.

The scene treats embodiment and a simulated landscape as practical conditions of scientific collaboration; the author's page identifies the novel's original publication as 2002.

Sources and details

Schild’s Ladder

{
  "access_scope": "Author-hosted opening chapter excerpt and publication history, original 2002 novel; fictional physics is not an empirical claim; no full-work audit.",
  "authors": [
    "Greg Egan"
  ],
  "authors_in_source_order": [
    "Greg Egan"
  ],
  "dates": {
    "inspected_source_date_1": "2002 original publication and copyright",
    "retrieved_utc": "2026-10-08T06:44:27.772971+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2002 original publication and copyright"
  ],
  "id": "work-culture-90593acf96be2e::S1",
  "title": "Schild’s Ladder",
  "url": "https://www.gregegan.net/SCHILD/00/SchildExcerpt.html"
}

Author-hosted opening chapter excerpt and publication history, original 2002 novel; fictional physics is not an empirical claim; no full-work audit.

Author-hosted opening chapter excerpt and publication history, original 2002 novel; fictional physics is not an empirical claim; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author dates first editions 2002; its physics is speculative fiction.",
  "dated": true,
  "year": 2002
}

Institution builders and research authors

Satya Nadella’s March 2024 employee communication names Mustafa Suleyman to lead the new Microsoft AI organization and Karén Simonyan as its Chief Scientist, focused on consumer AI products and research.

The account connects their earlier DeepMind and Inflection founder roles with a team move: several Inflection staff join them, while Copilot, Bing, Edge and the GenAI team are assigned to the new organization.

Nadella also describes continuing platform partnerships and separates this consumer organization from Kevin Scott’s responsibility for company-wide AI strategy, architecture and orchestration.

Sources and details

Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog

{
  "access_scope": "Historical March 19, 2024 Microsoft employee communication authored by Satya Nadella, covering appointments and reporting changes. Founder status and organizational leadership are distinct from specific research authorship; this source is not a complete Inflection acquisition record, a current reporting chart or evidence that an executive personally performed a paper’s technical tasks.",
  "authors": [
    "Satya Nadella"
  ],
  "authors_in_source_order": [
    "Satya Nadella"
  ],
  "dates": {
    "inspected_source_date_1": "March 19, 2024",
    "retrieved_utc": "2026-10-07T17:56:37.979838+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 19, 2024"
  ],
  "id": "science-connection-foundercredit::S1",
  "title": "Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot - The Official Microsoft Blog",
  "url": "https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/"
}

Historical March 19, 2024 Microsoft employee communication authored by Satya Nadella, covering appointments and reporting changes. Founder status and organizational leadership are distinct from specific research authorship; this source is not a complete Inflection acquisition record, a current reporting chart or evidence that an executive personally performed a paper’s technical tasks.

Historical March 19, 2024 Microsoft employee communication authored by Satya Nadella, covering appointments and reporting changes. Founder status and organizational leadership are distinct from specific research authorship; this source is not a complete Inflection acquisition record, a current reporting chart or evidence that an executive personally performed a paper’s technical tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

RSI: conditional argument and bounded optimization

The AlphaEvolve team’s May 2025 announcement describes a bounded improvement loop in which Gemini models propose programs and automated evaluators run and score the candidates.

An evolutionary program database selects promising solutions for later prompts, with Gemini Flash broadening the search and Gemini Pro supplying more detailed suggestions.

The team reports that a matrix-multiplication kernel optimization reduced Gemini training time by 1%, an example of improving part of a computing pipeline under measurable checks.

Sources and details

AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms — Google DeepMind

{
  "access_scope": "Google DeepMind’s May 14, 2025 AlphaEvolve team announcement: developer-reported program optimization and training-efficiency results. The reported kernel improvement is not evidence of unrestricted recursive intelligence amplification or validation of Vinge’s historical singularity forecast; full paper, implementation and independent replication are outside this selected blog scope.",
  "authors": [
    "AlphaEvolve team"
  ],
  "authors_in_source_order": [
    "AlphaEvolve team"
  ],
  "dates": {
    "inspected_source_date_1": "May 14, 2025",
    "retrieved_utc": "2026-10-07T17:54:20.468485+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 14, 2025"
  ],
  "id": "science-connection-rsi-bounded::S1",
  "title": "AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms — Google DeepMind",
  "url": "https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/"
}

Google DeepMind’s May 14, 2025 AlphaEvolve team announcement: developer-reported program optimization and training-efficiency results. The reported kernel improvement is not evidence of unrestricted recursive intelligence amplification or validation of Vinge’s historical singularity forecast; full paper, implementation and independent replication are outside this selected blog scope.

Google DeepMind’s May 14, 2025 AlphaEvolve team announcement: developer-reported program optimization and training-efficiency results. The reported kernel improvement is not evidence of unrestricted recursive intelligence amplification or validation of Vinge’s historical singularity forecast; full paper, implementation and independent replication are outside this selected blog scope.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jasper

Jasper’s August 2026 Product IQ announcement describes a customizable product schema for specifications, pricing, differentiators, approved claims, and required disclaimers.

The company says its agents and workflows use that product context during generation, with updates made once and propagated across Jasper surfaces and external systems connected through its MCP server.

The release distinguishes this product layer from Jasper IQ’s broader brand context, including Brand Voice, Style Guide, Audiences, and Knowledge Base.

Sources and details

Introducing Product IQ | The Jasper Blog

{
  "access_scope": "Dated vendor description of Product IQ at stated general availability; documented enforcement and propagation claims are attributed to Jasper, not independently validated accuracy, compliance, or workflow benefits.",
  "authors": [
    "Mason Johnson"
  ],
  "authors_in_source_order": [
    "Mason Johnson"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:53:57.906737+00:00",
    "visible_publication": "August 24, 2026"
  },
  "id": "organization-company-503bde4931ca4d::S1",
  "title": "Introducing Product IQ | The Jasper Blog",
  "url": "https://www.jasper.ai/blog/introducing-product-iq"
}

Dated vendor description of Product IQ at stated general availability; documented enforcement and propagation claims are attributed to Jasper, not independently validated accuracy, compliance, or workflow benefits.

Dated vendor description of Product IQ at stated general availability; documented enforcement and propagation claims are attributed to Jasper, not independently validated accuracy, compliance, or workflow benefits.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official newsroom says January 2021.",
      "date": "2021",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.jasper.ai/press"
      ],
      "year": 2021
    }
  ]
}

McGill University

McGill describes its Collaborative for AI and Society as a CDSI initiative seeking to understand AI’s societal effects and develop evidence-based practices for responsible use.

Its stated mission joins thought leadership, research to action, experiential learning, and lifelong learning as four interconnected pillars.

The initiative’s declared scope spans technical and societal questions in the arts, decision-making, health and oral health, law, and public policy.

Sources and details

McGill Collaborative for AI and Society | Computational and Data Systems Institute - McGill University

{
  "access_scope": "Institutional mission and declared program scope, not proof that proposed practices or societal outcomes have been achieved. Embedded page timestamps are metadata, not establishment dates; individual leaders are not document writers.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "html_mcgill_pubdate": "2026-06-08T14:57:51Z",
    "html_og_updated_time": "2026-06-08T10:57:51-04:00",
    "retrieved_utc": "2026-10-08T06:53:59.981566+00:00"
  },
  "id": "organization-ai-9ee4ffc2d7fa6e::S1",
  "title": "McGill Collaborative for AI and Society | Computational and Data Systems Institute - McGill University",
  "url": "https://www.mcgill.ca/cdsi/initiatives/mccais"
}

Institutional mission and declared program scope, not proof that proposed practices or societal outcomes have been achieved. Embedded page timestamps are metadata, not establishment dates; individual leaders are not document writers.

Institutional mission and declared program scope, not proof that proposed practices or societal outcomes have been achieved. Embedded page timestamps are metadata, not establishment dates; individual leaders are not document writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Rethink Robotics

MIT’s 2013 account describes Rethink Robotics’ Baxter as a two-armed manufacturing robot taught repetitive tasks by guiding its arms and pressing control-panel buttons.

The article explains that its spring-based series elastic actuators sense force and absorb shocks, crediting the underlying mechanism to Gill Pratt and Matt Williamson.

It also describes Baxter’s LCD face as a status and attention display, with head sensors detecting nearby people and joint sensors reducing impact force after a collision is detected.

Sources and details

Professor emeritus Rodney Brooks refines the sequel to iRobot | MIT News | Massachusetts Institute of Technology

{
  "access_scope": "Rob Matheson’s dated institutional report on historical Baxter; mechanism inventors, company founder, and source writer remain distinct. Described sensing is not an independent safety validation or evidence about a later Rethink corporate manifestation.",
  "authors": [
    "Rob Matheson"
  ],
  "authors_in_source_order": [
    "Rob Matheson"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:53:55.859342+00:00",
    "visible_publication": "August 9, 2013"
  },
  "id": "organization-ai-d613179a969126::S1",
  "title": "Professor emeritus Rodney Brooks refines the sequel to iRobot | MIT News | Massachusetts Institute of Technology",
  "url": "https://news.mit.edu/2013/rodney-brooks-rethink-robotics-0809"
}

Rob Matheson’s dated institutional report on historical Baxter; mechanism inventors, company founder, and source writer remain distinct. Described sensing is not an independent safety validation or evidence about a later Rethink corporate manifestation.

Rob Matheson’s dated institutional report on historical Baxter; mechanism inventors, company founder, and source writer remain distinct. Described sensing is not an independent safety validation or evidence about a later Rethink corporate manifestation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Tokyo Electron

Tokyo Electron’s February 2025 technical account describes Episode 1 as a single-wafer metal deposition platform integrating up to eight process modules.

TEL says its vacuum wafer transport lets metal deposition follow oxidized-film removal without exposing the processed wafer to oxygen or moisture.

The account explains that titanium-containing gas enables chemical vapor deposition on the inner walls and bottom structures of deep contact holes, extending titanium CVD experience from memory to logic chips.

Sources and details

Episode™ 1 Single-Wafer Deposition System for Semiconductors: Driving the Evolution of AI Semiconductors to Transform Everyday Life | Blog | Tokyo Electron Ltd.

{
  "access_scope": "Vendor description of Episode 1 and its process design, with reported July 2024 launch kept separate from article date. Claimed contact-resistance and productivity benefits are attributed; parent TEL is not merged with its Kyushu subsidiary.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "reported_product_launch": "July 2024",
    "retrieved_utc": "2026-10-08T06:54:01.110733+00:00",
    "visible_publication": "2025.02.13"
  },
  "id": "supply-org-019::S1",
  "title": "Episode™ 1 Single-Wafer Deposition System for Semiconductors: Driving the Evolution of AI Semiconductors to Transform Everyday Life | Blog | Tokyo Electron Ltd.",
  "url": "https://www.tel.com/blog/all/20250213_001.html"
}

Vendor description of Episode 1 and its process design, with reported July 2024 launch kept separate from article date. Claimed contact-resistance and productivity benefits are attributed; parent TEL is not merged with its Kyushu subsidiary.

Vendor description of Episode 1 and its process design, with reported July 2024 launch kept separate from article date. Claimed contact-resistance and productivity benefits are attributed; parent TEL is not merged with its Kyushu subsidiary.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Acceleration and a civilizational break

In his 1958 memorial, Ulam recalls a conversation with von Neumann about accelerating technological progress and changes in human life.

He describes that conversation as suggesting an approaching historical singularity beyond which familiar human affairs could not continue.

The same passage recalls von Neumann’s concern that future human interests might shift away from the scientific curiosities and abstract achievements valued by their civilization.

Sources and details

John von Neumann, 1903–1957

{
  "access_scope": "Ulam’s personal retrospective account, not a dated prediction by von Neumann of machine superintelligence or a mathematical model of a technological transition. S. Ulam is the credited writer; von Neumann is the subject.",
  "authors": [
    "S. Ulam"
  ],
  "authors_in_source_order": [
    "S. Ulam"
  ],
  "dates": {
    "received_by_editors": "February 8, 1958",
    "retrieved_utc": "2026-10-08T06:53:56.786464+00:00"
  },
  "id": "von-neumann-ulam::S1",
  "title": "John von Neumann, 1903–1957",
  "url": "https://www.ams.org/journals/bull/1958-64-03/S0002-9904-1958-10189-5/S0002-9904-1958-10189-5.pdf"
}

Ulam’s personal retrospective account, not a dated prediction by von Neumann of machine superintelligence or a mathematical model of a technological transition. S. Ulam is the credited writer; von Neumann is the subject.

Ulam’s personal retrospective account, not a dated prediction by von Neumann of machine superintelligence or a mathematical model of a technological transition. S. Ulam is the credited writer; von Neumann is the subject.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1958
}

University of Toronto

The University of Toronto’s research guide describes AI work spanning machine and deep learning, language processing, computer vision, and applications across health, sustainability, humanities, engineering, and commerce.

It presents the university’s three campuses as a multidisciplinary network of research units, listing centres concerned with both technical development and the ethics and social implications of AI.

The guide describes AI Kitchen as a growing hub offering AI tools, data, and expertise for teaching, learning, research, and administration, alongside guidance on copyright, citations, and graduate theses.

Sources and details

Research - Toward an AI-ready University

{
  "access_scope": "Institutional research guide and stated resource offerings as captured, not independent security validation, global ranking, or proof of realized outcomes. Page creation/modification timestamps are not the founding dates of named units.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "jsonld_dateModified": "2026-09-28T13:27:04+00:00",
    "jsonld_datePublished": "2025-06-17T09:00:58+00:00",
    "retrieved_utc": "2026-10-08T06:53:14.006986+00:00"
  },
  "id": "organization-ai-3b14d3cd44b699::S1",
  "title": "Research - Toward an AI-ready University",
  "url": "https://ai.utoronto.ca/research/"
}

Institutional research guide and stated resource offerings as captured, not independent security validation, global ranking, or proof of realized outcomes. Page creation/modification timestamps are not the founding dates of named units.

Institutional research guide and stated resource offerings as captured, not independent security validation, global ranking, or proof of realized outcomes. Page creation/modification timestamps are not the founding dates of named units.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Accelerating returns

Chapter One of The Singularity Is Near presents accelerating returns as Kurzweil’s view that technological evolution continues an increasing pace of change.

He argues that short observations can make an exponential curve look linear, causing forecasters to extend a recent rate of progress too far into the future.

His model proposes a doubling of the paradigm-shift rate each decade and therefore distinguishes calendar years from the amount of progress measured at a fixed historical rate.

Sources and details

The Singularity Is Near — Chapter One: The Six Epochs

{
  "access_scope": "Original chapter excerpt carrying 2005 production marks; Kurzweil’s explanatory model and forecasts remain attributed claims. No assessment that predicted events occurred, no health guidance, and no merge with later book editions. PDF has no writer byline; book authorship is separately verified in cached publisher copy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "pdf_production_stamp": "7/7/05 11:16 AM",
    "retrieved_utc": "2026-10-08T06:53:58.801113+00:00"
  },
  "id": "kurzweil::S1",
  "title": "The Singularity Is Near — Chapter One: The Six Epochs",
  "url": "https://www.kurzweilai.net/images/SingularityisNear_Chapter1.pdf"
}

Original chapter excerpt carrying 2005 production marks; Kurzweil’s explanatory model and forecasts remain attributed claims. No assessment that predicted events occurred, no health guidance, and no merge with later book editions. PDF has no writer byline; book authorship is separately verified in cached publisher copy.

Original chapter excerpt carrying 2005 production marks; Kurzweil’s explanatory model and forecasts remain attributed claims. No assessment that predicted events occurred, no health guidance, and no merge with later book editions. PDF has no writer byline; book authorship is separately verified in cached publisher copy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2005
}

OpenAI / frontier research leadership

OpenAI’s GPT-4 contribution ledger credits Jakub Pachocki as overall and optimization lead for pretraining, while assigning architecture and data leadership to Nick Ryder.

It separately credits Łukasz Kaiser as long-context lead, Ben Wang as attention-architecture lead, and Gabriel Goh and Clemens Winter as long-context co-leads.

For reinforcement learning and alignment, the ledger lists John Schulman as overall lead, Barret Zoph as overall training lead, and Jan Leike and Ryan Lowe as alignment co-leads.

Sources and details

GPT-4 contributions | OpenAI

{
  "access_scope": "First-party GPT-4 project role credit, not current company leadership or proof of sole invention, causal individual contribution, model capability, or independently validated performance. Listed contributors are not automatically document writers.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:20:54.214723+00:00"
  },
  "id": "openai-research::S1",
  "title": "GPT-4 contributions | OpenAI",
  "url": "https://openai.com/contributions/gpt-4/"
}

First-party GPT-4 project role credit, not current company leadership or proof of sole invention, causal individual contribution, model capability, or independently validated performance. Listed contributors are not automatically document writers.

First-party GPT-4 project role credit, not current company leadership or proof of sole invention, causal individual contribution, model capability, or independently validated performance. Listed contributors are not automatically document writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2024
}

Alexander Wissner-Gross

Alexander Wissner-Gross’s Hertz profile describes research connecting smart matter, pervasive computing and machine learning.

It identifies his doctoral thesis as Physically Programmable Surfaces and records his Harvard physics doctorate in 2007.

The profile links that research to a Hertz thesis prize and traces his earlier MIT studies across physics, engineering and mathematics.

Sources and details

Alexander Wissner-Gross - Hertz Foundation

{
  "access_scope": "Alexander Wissner-Gross: Foundation biography; the heading explicitly names Alexander Wissner-Gross and the same profile names Dr. Alexander D. Wissner-Gross. Biography prose is used; placeholder impact-story text is excluded. The 2008 prize listing is distinct from the 2007 doctorate.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "PhD 2007; Hertz Thesis Prize listed 2008; undated profile",
    "retrieved_utc": "2026-10-08T06:55:41.228614+00:00"
  },
  "dates_exact_in_source_role_order": [
    "PhD 2007; Hertz Thesis Prize listed 2008; undated profile"
  ],
  "id": "person-local-alexanderwissnergross::S1",
  "title": "Alexander Wissner-Gross - Hertz Foundation",
  "url": "https://www.hertzfoundation.org/people/alexander-wissner-gross/"
}

Alexander Wissner-Gross: Foundation biography; the heading explicitly names Alexander Wissner-Gross and the same profile names Dr. Alexander D. Wissner-Gross. Biography prose is used; placeholder impact-story text is excluded. The 2008 prize listing is distinct from the 2007 doctorate.

Alexander Wissner-Gross: Foundation biography; the heading explicitly names Alexander Wissner-Gross and the same profile names Dr. Alexander D. Wissner-Gross. Biography prose is used; placeholder impact-story text is excluded. The 2008 prize listing is distinct from the 2007 doctorate.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amjad Masad

Amjad Masad presents Replit as a browser coding environment intended to make software creation more approachable and social.

In his personal account, he connects that goal to widening access to programming rather than leaving most people as consumers of software.

He describes earlier work leading JavaScript infrastructure at Facebook and building product and infrastructure as Codecademy’s first employee.

Sources and details

Amjad Masad

{
  "access_scope": "Amjad Masad: First-person personal biography; Replit’s growth and equality goals are aspirations, not measured outcomes. Facebook tools are described as team work rather than sole personal inventions.",
  "authors": [
    "Amjad Masad"
  ],
  "authors_in_source_order": [
    "Amjad Masad"
  ],
  "dates": {
    "inspected_source_date_1": "undated cached personal account",
    "retrieved_utc": "2026-10-08T06:55:10.894657+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached personal account"
  ],
  "id": "person-local-amjadmasad::S1",
  "title": "Amjad Masad",
  "url": "https://amasad.me/about"
}

Amjad Masad: First-person personal biography; Replit’s growth and equality goals are aspirations, not measured outcomes. Facebook tools are described as team work rather than sole personal inventions.

Amjad Masad: First-person personal biography; Replit’s growth and equality goals are aspirations, not measured outcomes. Facebook tools are described as team work rather than sole personal inventions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anders Sandberg

Anders Sandberg studies the long-term future, technologies that alter the human condition, and risks with low probability but large consequences.

His institutional account connects this work to cognitive enhancement, brain emulation, AI safety and the limitations of risk models.

He describes a computer science doctorate based on neural-network models of memory and later research at Oxford’s Future of Humanity Institute.

Sources and details

Anders Sandberg | Institutet för Framtidsstudier | Institutet för Framtidsstudier är en självständig forskningsstiftelse som främjar framtidsperspektiv i forskning och samhällsdebatt

{
  "access_scope": "Anders Sandberg: First-person institutional research account; stated areas and historical training, not validated predictions or sole authorship of listed collaborative papers.",
  "authors": [
    "Anders Sandberg"
  ],
  "authors_in_source_order": [
    "Anders Sandberg"
  ],
  "dates": {
    "inspected_source_date_1": "PhD 2003; undated account",
    "retrieved_utc": "2026-10-08T06:55:41.273754+00:00"
  },
  "dates_exact_in_source_role_order": [
    "PhD 2003; undated account"
  ],
  "id": "person-anderssandberg::S1",
  "title": "Anders Sandberg | Institutet för Framtidsstudier | Institutet för Framtidsstudier är en självständig forskningsstiftelse som främjar framtidsperspektiv i forskning och samhällsdebatt",
  "url": "https://www.iffs.se/en/research/researchers/anders-sandberg-1/"
}

Anders Sandberg: First-person institutional research account; stated areas and historical training, not validated predictions or sole authorship of listed collaborative papers.

Anders Sandberg: First-person institutional research account; stated areas and historical training, not validated predictions or sole authorship of listed collaborative papers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Niccol

Andrew Niccol discusses Simone as a satire about a fabricated actress whose apparent celebrity depends on concealing her digital origin.

In the interview, he connects the film to questions about manufactured public images and finding human concerns within technology.

He explains that the fictional artificial performer was assembled through multiple human performances, including switching between actresses’ voices.

Sources and details

SPLICEDwire | Andrew Niccol interview for "Simone" (2002)

{
  "access_scope": "Andrew Niccol: Original interview dated August 12, 2002; Niccol is the credited writer-director and interview subject. Fictional digital celebrity and film production are distinct from an autonomous artificial actor. Interviewer is not assigned an unverified byline.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "August 12, 2002",
    "retrieved_utc": "2026-10-08T06:55:28.323722+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 12, 2002"
  ],
  "id": "person-coverage-db2892d390f0e1::S1",
  "title": "SPLICEDwire | Andrew Niccol interview for \"Simone\" (2002)",
  "url": "https://splicedwire.com/02features/aniccol.html"
}

Andrew Niccol: Original interview dated August 12, 2002; Niccol is the credited writer-director and interview subject. Fictional digital celebrity and film production are distinct from an autonomous artificial actor. Interviewer is not assigned an unverified byline.

Andrew Niccol: Original interview dated August 12, 2002; Niccol is the credited writer-director and interview subject. Fictional digital celebrity and film production are distinct from an autonomous artificial actor. Interviewer is not assigned an unverified byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bonnie Webber

Bonnie Webber’s personal research page places discourse phenomena at the center of her work at Edinburgh.

She describes collaboration on the development and use of the Penn Discourse TreeBank.

Her stated interests also connect discourse with machine translation and examine whether language tools remain stable as genres change.

Sources and details

Bonnie Webber's Home Page

{
  "access_scope": "Bonnie Webber: Personal research account; collaboration is retained and linked publication titles are not treated as inspected papers. The footer says revised October 2011, while the publication list includes later papers; no current chronology is inferred.",
  "authors": [
    "Bonnie Webber"
  ],
  "authors_in_source_order": [
    "Bonnie Webber"
  ],
  "dates": {
    "inspected_source_date_1": "footer revised October 2011; listed publications extend to 2014",
    "retrieved_utc": "2026-10-08T06:55:15.781355+00:00"
  },
  "dates_exact_in_source_role_order": [
    "footer revised October 2011; listed publications extend to 2014"
  ],
  "id": "person-bonniewebber::S1",
  "title": "Bonnie Webber's Home Page",
  "url": "https://homepages.inf.ed.ac.uk/bonnie/"
}

Bonnie Webber: Personal research account; collaboration is retained and linked publication titles are not treated as inspected papers. The footer says revised October 2011, while the publication list includes later papers; no current chronology is inferred.

Bonnie Webber: Personal research account; collaboration is retained and linked publication titles are not treated as inspected papers. The footer says revised October 2011, while the publication list includes later papers; no current chronology is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brannin McBee

Brannin McBee’s CoreWeave biography identifies him as a cofounder whose development role covers financing, partnerships and business growth.

The company describes his earlier strategy role as helping shape financing approaches for expanding AI infrastructure.

His prior trading work focused on North American energy and agricultural markets, linking a financial background to the company’s infrastructure business.

Sources and details

Brannin McBee | CoreWeave Executive Leadership

{
  "access_scope": "Brannin McBee: Company biography as cached; promotional comparative claims are excluded. Roles are reported by the firm, not independently audited.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached company biography",
    "retrieved_utc": "2026-10-08T06:55:36.484492+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached company biography"
  ],
  "id": "person-coverage-fe47e393e73da5::S1",
  "title": "Brannin McBee | CoreWeave Executive Leadership",
  "url": "https://www.coreweave.com/leadership/brannin-mcbee"
}

Brannin McBee: Company biography as cached; promotional comparative claims are excluded. Roles are reported by the firm, not independently audited.

Brannin McBee: Company biography as cached; promotional comparative claims are excluded. Roles are reported by the firm, not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian Venturo

Brian Venturo’s CoreWeave biography describes a cofounder working on platform vision and growth strategy for AI infrastructure.

It distinguishes that strategy position from his first seven years as chief technology officer, when he helped build the platform’s technical foundation.

The biography traces earlier work in asset management and an economics degree, placing the infrastructure role alongside his financial background.

Sources and details

Brian Venturo | CoreWeave Executive Leadership

{
  "access_scope": "Brian Venturo: Company biography as cached; current role is limited to this account. Linked article teasers and advertised performance figures are not treated as inspected technical results.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached company biography",
    "retrieved_utc": "2026-10-08T06:55:36.864729+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached company biography"
  ],
  "id": "person-coverage-f5bab2be220020::S1",
  "title": "Brian Venturo | CoreWeave Executive Leadership",
  "url": "https://www.coreweave.com/leadership/brian-venturo"
}

Brian Venturo: Company biography as cached; current role is limited to this account. Linked article teasers and advertised performance figures are not treated as inspected technical results.

Brian Venturo: Company biography as cached; current role is limited to this account. Linked article teasers and advertised performance figures are not treated as inspected technical results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ce Zhang

Ce Zhang studies how data, models, computation and infrastructure constrain machine-learning systems.

His University of Chicago profile describes an effort to build platforms that emphasize data and human needs while scaling through declarative interfaces.

It also traces his previous roles at ETH Zurich and Together, where he worked on a decentralized cloud for artificial intelligence.

Sources and details

Ce Zhang – Department of Computer Science

{
  "access_scope": "Ce Zhang: Institutional biography and research statement; stated goals are not measured democratization outcomes or proof of sole platform authorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached institutional profile",
    "retrieved_utc": "2026-10-08T06:55:11.402819+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached institutional profile"
  ],
  "id": "person-cezhang::S1",
  "title": "Ce Zhang – Department of Computer Science",
  "url": "https://cs.uchicago.edu/people/ce-zhang/"
}

Ce Zhang: Institutional biography and research statement; stated goals are not measured democratization outcomes or proof of sole platform authorship.

Ce Zhang: Institutional biography and research statement; stated goals are not measured democratization outcomes or proof of sole platform authorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chester I. Barnard

Chester I. Barnard’s views on motivation are summarized in William Wolf’s interview abstract as extending beyond financial incentives.

The account links durable commitment to morale and warns that incentive systems can weaken over time.

It also describes friction when staff departments move from advising line departments toward exercising authority over them.

Sources and details

Precepts for Managers--Interviews with Chester I. Barnard | California Management Review

{
  "access_scope": "Chester I. Barnard: Accessible abstract only of William Wolf’s interview publication; no full interview read is asserted. Barnard is the subject, not the article author.",
  "authors": [
    "William Wolf"
  ],
  "authors_in_source_order": [
    "William Wolf"
  ],
  "dates": {
    "inspected_source_date_1": "01 Nov 1963; Volume 6 Issue 1",
    "retrieved_utc": "2026-10-08T06:55:11.359238+00:00"
  },
  "dates_exact_in_source_role_order": [
    "01 Nov 1963; Volume 6 Issue 1"
  ],
  "id": "person-chesteribarnard::S1",
  "title": "Precepts for Managers--Interviews with Chester I. Barnard | California Management Review",
  "url": "https://cmr.berkeley.edu/1963/11/6-1-precepts-for-managers-interviews-with-chester-i-barnard/"
}

Chester I. Barnard: Accessible abstract only of William Wolf’s interview publication; no full interview read is asserted. Barnard is the subject, not the article author.

Chester I. Barnard: Accessible abstract only of William Wolf’s interview publication; no full interview read is asserted. Barnard is the subject, not the article author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Corinna Cortes

Corinna Cortes and Vladimir Vapnik’s Support-vector networks presents a classifier that maps inputs into a high-dimensional feature space before constructing a linear decision surface.

Their abstract extends the approach beyond training data that can be separated without errors.

It reports tests using polynomial transformations and compares the method with other algorithms in an optical character recognition benchmark.

Sources and details

Support-vector networks | Machine Learning | Springer Nature Link

{
  "access_scope": "Corinna Cortes: Publisher abstract and exact author information only; ordered coauthors Corinna Cortes, Vladimir Vapnik. No individual division of method development or inspection of the linked full PDF is asserted.",
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "authors_in_source_order": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "citation_publication_date": "1995/09",
    "inspected_source_date_1": "Received 15 May 1993; accepted 20 February 1995; issue September 1995",
    "retrieved_utc": "2026-10-08T06:55:18.218086+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Received 15 May 1993; accepted 20 February 1995; issue September 1995"
  ],
  "id": "person-local-corinnacortes::S1",
  "title": "Support-vector networks | Machine Learning | Springer Nature Link",
  "url": "https://link.springer.com/article/10.1007/BF00994018"
}

Corinna Cortes: Publisher abstract and exact author information only; ordered coauthors Corinna Cortes, Vladimir Vapnik. No individual division of method development or inspection of the linked full PDF is asserted.

Corinna Cortes: Publisher abstract and exact author information only; ordered coauthors Corinna Cortes, Vladimir Vapnik. No individual division of method development or inspection of the linked full PDF is asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David S. Goyer

David S. Goyer’s personal site presents a career spanning screenwriting, directing and television production.

Its biography distinguishes his screenplays for the Blade and Dark Knight films from his directing credits, including Blade: Trinity.

The site also identifies him as creator of Foundation, connecting that television work with a broader body of speculative storytelling.

Sources and details

David S. Goyer | American Filmmaker - Writer, Director, Producer

{
  "access_scope": "David S. Goyer: Personal-site biography; David S. Goyer is explicitly printed alongside the expanded David Samuel Goyer on the same page. Linked news headlines are not inspected articles, and their later dates do not update the biography’s season reference.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached personal-site biography",
    "retrieved_utc": "2026-10-08T06:55:38.171977+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached personal-site biography"
  ],
  "id": "person-coverage-4981fa327cacf0::S1",
  "title": "David S. Goyer | American Filmmaker - Writer, Director, Producer",
  "url": "https://www.davidsgoyer.com/"
}

David S. Goyer: Personal-site biography; David S. Goyer is explicitly printed alongside the expanded David Samuel Goyer on the same page. Linked news headlines are not inspected articles, and their later dates do not update the biography’s season reference.

David S. Goyer: Personal-site biography; David S. Goyer is explicitly printed alongside the expanded David Samuel Goyer on the same page. Linked news headlines are not inspected articles, and their later dates do not update the biography’s season reference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Hofstadter

Douglas Hofstadter describes a growing focus on artistic creation in John Horgan’s 2025 interview, encompassing ambigrams, music and poetry translation.

He presents I Am a Strange Loop as his sustained attempt to explain the self and consciousness.

His comments on AI express fear about its momentum and possible successors to humanity, while leaving the timing and outcome uncertain.

Sources and details

Hofstadter on Strange Loops, Beauty, Free Will, AI, God, Utopia and Gaza — John Horgan (The Science Writer)

{
  "access_scope": "Douglas Hofstadter: John Horgan’s original email interview; Hofstadter’s philosophical account and AI concerns are attributed opinions, not established mechanisms or forecasts.",
  "authors": [
    "John Horgan"
  ],
  "authors_in_source_order": [
    "John Horgan"
  ],
  "dates": {
    "inspected_source_date_1": "June 21, 2025",
    "retrieved_utc": "2026-10-08T06:55:17.077595+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 21, 2025"
  ],
  "id": "person-coverage-56c6916e134c0f::S1",
  "title": "Hofstadter on Strange Loops, Beauty, Free Will, AI, God, Utopia and Gaza — John Horgan (The Science Writer)",
  "url": "https://johnhorgan.org/cross-check/hofstadter-on-strange-loops-beauty-free-will-ai-god-utopia-and-gaza"
}

Douglas Hofstadter: John Horgan’s original email interview; Hofstadter’s philosophical account and AI concerns are attributed opinions, not established mechanisms or forecasts.

Douglas Hofstadter: John Horgan’s original email interview; Hofstadter’s philosophical account and AI concerns are attributed opinions, not established mechanisms or forecasts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Edward Neumeier

Edward Neumeier recalls developing RoboCop from a treatment into drafts written jointly with Michael Miner.

He describes combining action and comedy with political satire, using the film’s media interruptions to develop that satirical world.

His account identifies the central dramatic turn as making the hero a human transformed into a machine, with memory and identity giving the premise emotional weight.

Sources and details

MONEY INTO LIGHT: EDWARD NEUMEIER TALKS ABOUT 'ROBOCOP'

{
  "access_scope": "Edward Neumeier: Original interview testimony; selected heading explicitly credits Edward Neumeier and responses use Ed. Collaborators remain separate: screenplay collaboration Edward Neumeier, Michael Miner; director Paul Verhoeven. Film fiction is not actual AI capability. Interviewer byline not verified here.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "URL publication path July 2013; no more precise date asserted",
    "retrieved_utc": "2026-10-08T06:55:42.588156+00:00"
  },
  "dates_exact_in_source_role_order": [
    "URL publication path July 2013; no more precise date asserted"
  ],
  "id": "person-coverage-0a3ba8d6b82ffa::S1",
  "title": "MONEY INTO LIGHT: EDWARD NEUMEIER TALKS ABOUT 'ROBOCOP'",
  "url": "https://www.money-into-light.com/2013/07/edward-neumeier-talks-about-robocop.html"
}

Edward Neumeier: Original interview testimony; selected heading explicitly credits Edward Neumeier and responses use Ed. Collaborators remain separate: screenplay collaboration Edward Neumeier, Michael Miner; director Paul Verhoeven. Film fiction is not actual AI capability. Interviewer byline not verified here.

Edward Neumeier: Original interview testimony; selected heading explicitly credits Edward Neumeier and responses use Ed. Collaborators remain separate: screenplay collaboration Edward Neumeier, Michael Miner; director Paul Verhoeven. Film fiction is not actual AI capability. Interviewer byline not verified here.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Elizabeth Finkel

Elizabeth Finkel’s Prove It is presented by ANU as an exploration of scientific reasoning through contested discoveries.

The book’s examples range from gravitational waves and human origins to Covid-19 and consciousness, using disagreement to explain how evidence is tested.

The accompanying biography traces her move from biochemistry research into science journalism and identifies her as a founding editor of Cosmos.

Sources and details

Meet the author - Elizabeth Finkel | Australian National University

{
  "access_scope": "Elizabeth Finkel: ANU event description and author biography, not the full book or recording. Joan Leach is the conversation partner. Conflicting displayed event dates are retained without selecting one.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Displayed dates: Thu 14 Aug 2025 and Wednesday September 24, 2025; conflict unresolved",
    "retrieved_utc": "2026-10-08T06:55:34.623537+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Displayed dates: Thu 14 Aug 2025 and Wednesday September 24, 2025; conflict unresolved"
  ],
  "id": "person-coverage-ce1b6354b14ac6::S1",
  "title": "Meet the author - Elizabeth Finkel | Australian National University",
  "url": "https://www.anu.edu.au/events/meet-the-author-elizabeth-finkel"
}

Elizabeth Finkel: ANU event description and author biography, not the full book or recording. Joan Leach is the conversation partner. Conflicting displayed event dates are retained without selecting one.

Elizabeth Finkel: ANU event description and author biography, not the full book or recording. Joan Leach is the conversation partner. Conflicting displayed event dates are retained without selecting one.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fritz J. Roethlisberger

Fritz J. Roethlisberger’s career is traced in Søren H. Jensen’s chapter abstract from engineering studies toward organizational behavior.

The account places his work at Harvard alongside Elton Mayo and identifies the Hawthorne studies as a major focus.

It emphasizes how those studies shaped later questions about human relations, while acknowledging the critique and unresolved issues surrounding the work.

Sources and details

Roethlisberger, Fritz J.: A Curious Scholar Who Discovered Human Relations

{
  "access_scope": "Fritz J. Roethlisberger: Repository reproduction of an original historical chapter abstract; Roethlisberger is the subject, not the author. No full chapter or reanalysis of Hawthorne data was inspected.",
  "authors": [
    "Søren H. Jensen"
  ],
  "authors_in_source_order": [
    "Søren H. Jensen"
  ],
  "dates": {
    "citation_publication_date": "2021",
    "inspected_source_date_1": "2021; edition 2; pages 1479–1493",
    "retrieved_utc": "2026-10-08T06:55:15.988117+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021; edition 2; pages 1479–1493"
  ],
  "id": "person-fritzjroethlisberger::S1",
  "title": "Roethlisberger, Fritz J.: A Curious Scholar Who Discovered Human Relations",
  "url": "https://ideas.repec.org/h/spr/sprchp/978-3-030-38324-4_22.html"
}

Fritz J. Roethlisberger: Repository reproduction of an original historical chapter abstract; Roethlisberger is the subject, not the author. No full chapter or reanalysis of Hawthorne data was inspected.

Fritz J. Roethlisberger: Repository reproduction of an original historical chapter abstract; Roethlisberger is the subject, not the author. No full chapter or reanalysis of Hawthorne data was inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gabriel Villarrubia Gonzalez

Gabriel Villarrubia Gonzalez’s ESALab biography describes research applying multi-agent systems to ambient intelligence.

It connects that work to intelligent architectures and the combination of information from heterogeneous sensors.

His training spans computer engineering, intelligent systems and security, while the account places his research and teaching at the University of Salamanca.

Sources and details

Dr. Gabriel Villarrubia González - ESALAB – Expert Systems and Applications Laboratory

{
  "access_scope": "Gabriel Villarrubia Gonzalez: Institutional lab biography; source prints Gabriel Villarrubia González, differing only by diacritic. Promotional publication/project counts are excluded and no individual task within joint papers is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "training dates 2011–2015; undated profile",
    "retrieved_utc": "2026-10-08T06:55:12.115775+00:00"
  },
  "dates_exact_in_source_role_order": [
    "training dates 2011–2015; undated profile"
  ],
  "id": "person-coverage-c37c37db78a472::S1",
  "title": "Dr. Gabriel Villarrubia González - ESALAB – Expert Systems and Applications Laboratory",
  "url": "https://esalab.es/en/esalab-miembro/gabriel-villarrubia-gonzalez/"
}

Gabriel Villarrubia Gonzalez: Institutional lab biography; source prints Gabriel Villarrubia González, differing only by diacritic. Promotional publication/project counts are excluded and no individual task within joint papers is inferred.

Gabriel Villarrubia Gonzalez: Institutional lab biography; source prints Gabriel Villarrubia González, differing only by diacritic. Promotional publication/project counts are excluded and no individual task within joint papers is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gary Hamel

Gary Hamel’s personal site frames his work around helping organizations adapt through management innovation.

Its description of Humanocracy presents reducing bureaucracy as a route toward more dynamic organizations.

The site connects that theme with his speaking and consulting work on strategy, innovation and organizational change.

Sources and details

Gary Hamel

{
  "access_scope": "Gary Hamel: Personal promotional account; book description only, not full-book inspection. Rankings, endorsements, economic impact figures and coauthor allocation are not asserted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached personal site",
    "retrieved_utc": "2026-10-08T06:55:13.857121+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached personal site"
  ],
  "id": "person-garyhamel::S1",
  "title": "Gary Hamel",
  "url": "https://garyhamel.com/"
}

Gary Hamel: Personal promotional account; book description only, not full-book inspection. Rankings, endorsements, economic impact figures and coauthor allocation are not asserted.

Gary Hamel: Personal promotional account; book description only, not full-book inspection. Rankings, endorsements, economic impact figures and coauthor allocation are not asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gene Roddenberry

Gene Roddenberry’s memorial biography identifies him as the creator and producer of Star Trek.

It traces his transition from aviation and police work to writing television scripts before developing the series.

The account describes how the original show continued through animated, film and television successors, while separately identifying Majel Roddenberry’s acting and computer-voice roles.

Sources and details

Gene Roddenberry & Majel Roddenberry | Memorial Spaceflights

{
  "access_scope": "Gene Roddenberry: Celestis participant memorial biography; subject credits are distinct from authorship of the page. Gene Roddenberry and Majel Roddenberry remain separate contributors. Franchise history is attributed to this memorial account; no real AI capabilities are implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "series premiered 1966; Gene died October 24, 1991; undated memorial",
    "retrieved_utc": "2026-10-08T06:55:36.187756+00:00"
  },
  "dates_exact_in_source_role_order": [
    "series premiered 1966; Gene died October 24, 1991; undated memorial"
  ],
  "id": "person-coverage-1a586d6acaff91::S1",
  "title": "Gene Roddenberry & Majel Roddenberry | Memorial Spaceflights",
  "url": "https://www.celestis.com/participants-testimonials/gene-roddenberry-majel-roddenberry/"
}

Gene Roddenberry: Celestis participant memorial biography; subject credits are distinct from authorship of the page. Gene Roddenberry and Majel Roddenberry remain separate contributors. Franchise history is attributed to this memorial account; no real AI capabilities are implied.

Gene Roddenberry: Celestis participant memorial biography; subject credits are distinct from authorship of the page. Gene Roddenberry and Majel Roddenberry remain separate contributors. Franchise history is attributed to this memorial account; no real AI capabilities are implied.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guido W. Imbens

Guido W. Imbens develops econometric and statistical methods for drawing causal conclusions from observational studies.

His Stanford research statement highlights matching, instrumental variables and regression discontinuity designs.

The accompanying biography traces teaching roles at Harvard, UCLA and Berkeley before his move to Stanford in 2012.

Sources and details

Guido W. Imbens | Stanford Graduate School of Business

{
  "access_scope": "Guido W. Imbens: Institutional biography and research statement; method descriptions are research areas, not causal-effect results from individual listed papers. The page’s emeritus heading and biography are preserved as distinct source fields.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "joined Stanford 2012; undated cached profile",
    "retrieved_utc": "2026-10-07T18:15:39.539794+00:00"
  },
  "dates_exact_in_source_role_order": [
    "joined Stanford 2012; undated cached profile"
  ],
  "id": "person-coverage-6bd0465daeb2c0::S1",
  "title": "Guido W. Imbens | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/faculty-research/faculty/guido-w-imbens"
}

Guido W. Imbens: Institutional biography and research statement; method descriptions are research areas, not causal-effect results from individual listed papers. The page’s emeritus heading and biography are preserved as distinct source fields.

Guido W. Imbens: Institutional biography and research statement; method descriptions are research areas, not causal-effect results from individual listed papers. The page’s emeritus heading and biography are preserved as distinct source fields.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hideaki Anno

Hideaki Anno describes the final Rebuild of Evangelion film as retaining the series’ theme while shifting attention from the inner self toward the outer world.

In TIME’s interview, he connects Shinji’s growth with an increased capacity to care for people close to him.

He presents the film as both a self-contained entry for newcomers and a conclusion shaped by years of his own experience.

Sources and details

Creator Hideaki Anno on 'Neon Genesis Evangelion’s Final Film

{
  "access_scope": "Hideaki Anno: Translated original interview embedded in Patrick Austin’s article, bounded to Anno’s stated 2021 plans and interpretations. Fictional robots and personal filmmaking choices are not real AI engineering.",
  "authors": [
    "Patrick Austin"
  ],
  "authors_in_source_order": [
    "Patrick Austin"
  ],
  "dates": {
    "inspected_source_date_1": "August 20, 2021",
    "retrieved_utc": "2026-10-08T06:55:29.668443+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 20, 2021"
  ],
  "id": "person-coverage-ae022bd85bf0d2::S1",
  "title": "Creator Hideaki Anno on 'Neon Genesis Evangelion’s Final Film",
  "url": "https://time.com/6090247/neon-genesis-evangelion-thrice-upon-a-time-hideaki-anno/"
}

Hideaki Anno: Translated original interview embedded in Patrick Austin’s article, bounded to Anno’s stated 2021 plans and interpretations. Fictional robots and personal filmmaking choices are not real AI engineering.

Hideaki Anno: Translated original interview embedded in Patrick Austin’s article, bounded to Anno’s stated 2021 plans and interpretations. Fictional robots and personal filmmaking choices are not real AI engineering.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hubert Dreyfus

Hubert Dreyfus’s Berkeley obituary describes a philosopher who challenged expectations that artificial intelligence could match human intuition.

It connects that criticism with his study of skill, practical coping and twentieth-century European philosophy.

The account also emphasizes decades of teaching and mentoring at Berkeley, placing his AI criticism within a broader philosophical career.

Sources and details

Hubert Dreyfus, preeminent philosopher and AI critic, dies at 87 - Berkeley News

{
  "access_scope": "Hubert Dreyfus: Yasmin Anwar’s institutional obituary; the heading and biography explicitly bridge Hubert Dreyfus with Hubert Lederer Dreyfus. Claims are bounded to this historical account, not a verdict on contemporary AI.",
  "authors": [
    "Yasmin Anwar"
  ],
  "authors_in_source_order": [
    "Yasmin Anwar"
  ],
  "dates": {
    "inspected_source_date_1": "April 24, 2017",
    "retrieved_utc": "2026-10-08T06:55:21.010472+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 24, 2017"
  ],
  "id": "person-coverage-56c42a3e52ab89::S1",
  "title": "Hubert Dreyfus, preeminent philosopher and AI critic, dies at 87 - Berkeley News",
  "url": "https://news.berkeley.edu/2017/04/24/hubert-dreyfus/"
}

Hubert Dreyfus: Yasmin Anwar’s institutional obituary; the heading and biography explicitly bridge Hubert Dreyfus with Hubert Lederer Dreyfus. Claims are bounded to this historical account, not a verdict on contemporary AI.

Hubert Dreyfus: Yasmin Anwar’s institutional obituary; the heading and biography explicitly bridge Hubert Dreyfus with Hubert Lederer Dreyfus. Claims are bounded to this historical account, not a verdict on contemporary AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Humberto R. Maturana

Humberto R. Maturana and Francisco J. Varela’s Autopoiesis and Cognition is presented by its publisher as a theory of living systems organized around their own autonomy.

The description characterizes autopoietic systems as self-referential and self-constructing rather than defined solely by an outside observer.

It links that standpoint with treating cognition biologically and examining how interaction gives rise to language, description and thought.

Sources and details

Autopoiesis and Cognition: The Realization of the Living | Springer Nature Link

{
  "access_scope": "Humberto R. Maturana: Publisher description only, not the full book; ordered coauthors Humberto R. Maturana, Francisco J. Varela. No personal division of theory development is inferred. Hardcover, softcover and ebook dates remain distinct.",
  "authors": [
    "Humberto R. Maturana",
    "Francisco J. Varela"
  ],
  "authors_in_source_order": [
    "Humberto R. Maturana",
    "Francisco J. Varela"
  ],
  "dates": {
    "inspected_source_date_1": "copyright 1980; hardcover 30 April 1980; softcover 31 August 1991; ebook 06 December 2012",
    "retrieved_utc": "2026-10-08T06:55:18.609691+00:00"
  },
  "dates_exact_in_source_role_order": [
    "copyright 1980; hardcover 30 April 1980; softcover 31 August 1991; ebook 06 December 2012"
  ],
  "id": "person-coverage-023126195ff8d2::S1",
  "title": "Autopoiesis and Cognition: The Realization of the Living | Springer Nature Link",
  "url": "https://link.springer.com/book/10.1007/978-94-009-8947-4"
}

Humberto R. Maturana: Publisher description only, not the full book; ordered coauthors Humberto R. Maturana, Francisco J. Varela. No personal division of theory development is inferred. Hardcover, softcover and ebook dates remain distinct.

Humberto R. Maturana: Publisher description only, not the full book; ordered coauthors Humberto R. Maturana, Francisco J. Varela. No personal division of theory development is inferred. Hardcover, softcover and ebook dates remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

I. J. Good

I. J. Good’s Virginia Tech profile places his work within the development of Bayesian inference and the weight of evidence.

It describes his move to the university as a statistics professor in 1967 after earlier British intelligence and academic work.

The account also records his consulting on 2001: A Space Odyssey and earlier writing about ultraintelligent machines.

Sources and details

Legends: I.J. Good | College of Science | Virginia Tech

{
  "access_scope": "I. J. Good: Institutional historical profile; source explicitly identifies Irving John “Jack” Good as I.J. Good. Selected passages exclude the page’s confused Heath Robinson/Enigma identification; that unresolved source-quality issue remains flagged. Film consulting is distinct from AI development.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "profile September 17, 2021; joined Virginia Tech 1967",
    "retrieved_utc": "2026-10-08T06:55:27.044435+00:00"
  },
  "dates_exact_in_source_role_order": [
    "profile September 17, 2021; joined Virginia Tech 1967"
  ],
  "id": "person-ijgood::S1",
  "title": "Legends: I.J. Good  | College of Science | Virginia Tech",
  "url": "https://science.vt.edu/magazine/stories/fall-2021/legends.html"
}

I. J. Good: Institutional historical profile; source explicitly identifies Irving John “Jack” Good as I.J. Good. Selected passages exclude the page’s confused Heath Robinson/Enigma identification; that unresolved source-quality issue remains flagged. Film consulting is distinct from AI development.

I. J. Good: Institutional historical profile; source explicitly identifies Irving John “Jack” Good as I.J. Good. Selected passages exclude the page’s confused Heath Robinson/Enigma identification; that unresolved source-quality issue remains flagged. Film consulting is distinct from AI development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Irwin Winkler

Irwin Winkler’s company biography presents a career spanning producing, directing and screenwriting.

It identifies The Net among his directing work, alongside dramas such as Night and the City and At First Sight.

The account distinguishes those projects from producing partnerships and collaborations with filmmakers including Robert Chartoff and Martin Scorsese.

Sources and details

Winkler Films

{
  "access_scope": "Irwin Winkler: Company career biography as cached; film roles are differentiated and promotional rankings or impact claims are excluded. Outdated news and production references are not treated as current status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated biography with 2018 production/news references",
    "retrieved_utc": "2026-10-08T06:55:48.124652+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated biography with 2018 production/news references"
  ],
  "id": "person-coverage-8038e2e7812a96::S1",
  "title": "Winkler Films",
  "url": "https://www.winklerfilms.com/"
}

Irwin Winkler: Company career biography as cached; film roles are differentiated and promotional rankings or impact claims are excluded. Outdated news and production references are not treated as current status.

Irwin Winkler: Company career biography as cached; film roles are differentiated and promotional rankings or impact claims are excluded. Outdated news and production references are not treated as current status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

J. Barkley Rosser

J. Barkley Rosser’s IEEE biography traces research in mathematical logic alongside a sustained interest in number theory.

It describes his leadership at the Institute for Numerical Analysis as helping organize early computing research and exploring computers as tools for pure mathematics.

A highlighted example is work on rigorous computation of zeros of the Riemann zeta function, reported jointly with Lowell Schoenfeld and James Michael Yohe.

Sources and details

Computer Pioneers - J. Barkley Rosser

{
  "access_scope": "J. Barkley Rosser: IEEE Computer Pioneers biography by J. A. N. Lee incorporating Buck et al. 1989; subject is the logician born 1907, not the later economist. Ordered authors of the referenced computation: Rosser, Lowell Schoenfeld, James Michael Yohe; no task allocation inferred.",
  "authors": [
    "J. A. N. Lee"
  ],
  "authors_in_source_order": [
    "J. A. N. Lee"
  ],
  "dates": {
    "inspected_source_date_1": "original content copyright 1995; incorporated obituary 1989",
    "retrieved_utc": "2026-10-08T06:55:15.400587+00:00"
  },
  "dates_exact_in_source_role_order": [
    "original content copyright 1995; incorporated obituary 1989"
  ],
  "id": "person-jbarkleyrosser::S1",
  "title": "Computer Pioneers - J. Barkley Rosser",
  "url": "https://history.computer.org/pioneers/rosser.html"
}

J. Barkley Rosser: IEEE Computer Pioneers biography by J. A. N. Lee incorporating Buck et al. 1989; subject is the logician born 1907, not the later economist. Ordered authors of the referenced computation: Rosser, Lowell Schoenfeld, James Michael Yohe; no task allocation inferred.

J. Barkley Rosser: IEEE Computer Pioneers biography by J. A. N. Lee incorporating Buck et al. 1989; subject is the logician born 1907, not the later economist. Ordered authors of the referenced computation: Rosser, Lowell Schoenfeld, James Michael Yohe; no task allocation inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jack Hidary

Jack Hidary’s SandboxAQ biography describes a founder working across artificial intelligence and quantum technologies.

It identifies Quantum Computing: An Applied Approach among his books and places its second edition in educational and professional training settings.

The account traces earlier neuroscience work on functional brain imaging and neural networks, connecting that background with his later technology leadership.

Sources and details

Jack Hidary | Leadership | SandboxAQ

{
  "access_scope": "Jack Hidary: Company biography; training uses and background are claims of this account. Funding totals, product superiority and linked video content are excluded. No sole authorship of collaborative research is inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached company biography; textbook second edition",
    "retrieved_utc": "2026-10-08T06:55:46.706210+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached company biography; textbook second edition"
  ],
  "id": "person-local-jackhidary::S1",
  "title": "Jack Hidary | Leadership | SandboxAQ",
  "url": "https://www.sandboxaq.com/company/leadership/jack-hidary"
}

Jack Hidary: Company biography; training uses and background are claims of this account. Funding totals, product superiority and linked video content are excluded. No sole authorship of collaborative research is inferred.

Jack Hidary: Company biography; training uses and background are claims of this account. Funding totals, product superiority and linked video content are excluded. No sole authorship of collaborative research is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jeffrey Katzenberg

Jeffrey Katzenberg’s Stanford talk connects effective leadership with giving teams room to pursue risky ideas and sometimes fail.

He describes mentorship and movement across jobs at Paramount as preparation for greater responsibility.

His account of sharing meals with colleagues presents informal contact as a way to make studio leadership more approachable.

Sources and details

Jeffrey Katzenberg: How Failure Makes a Better Leader | Stanford Graduate School of Business

{
  "access_scope": "Jeffrey Katzenberg: Bill Snyder’s account of a Stanford discussion, not a controlled leadership study; Katzenberg’s personal lessons are attributed testimony rather than measured effects.",
  "authors": [
    "Bill Snyder"
  ],
  "authors_in_source_order": [
    "Bill Snyder"
  ],
  "dates": {
    "inspected_source_date_1": "March 13, 2018",
    "retrieved_utc": "2026-10-08T06:55:39.770065+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 13, 2018"
  ],
  "id": "person-coverage-1a93de50612719::S1",
  "title": "Jeffrey Katzenberg: How Failure Makes a Better Leader | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/insights/jeffrey-katzenberg-how-failure-makes-better-leader"
}

Jeffrey Katzenberg: Bill Snyder’s account of a Stanford discussion, not a controlled leadership study; Katzenberg’s personal lessons are attributed testimony rather than measured effects.

Jeffrey Katzenberg: Bill Snyder’s account of a Stanford discussion, not a controlled leadership study; Katzenberg’s personal lessons are attributed testimony rather than measured effects.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joe Ksander

Joe Ksander describes joining Next Gen with Kevin Adams as writers before they were asked to direct.

In their interview, he explains how rewriting retained the comic’s central idea of a robot choosing which memories to preserve.

That memory constraint helped shape the contrast between the robot and a human protagonist who wants to escape painful memories.

Sources and details

INTERVIEW: Directors Kevin Adams And Joe Ksander Of "Next Gen" - Animation Scoop

{
  "access_scope": "Joe Ksander: Jackson Murphy’s original interview; ordered director subjects Kevin Adams, Joe Ksander. Claims attributed to Ksander describe collective work and preserve the comic’s prior idea. Fictional memory management is not an implementation of real AI.",
  "authors": [
    "Jackson Murphy"
  ],
  "authors_in_source_order": [
    "Jackson Murphy"
  ],
  "dates": {
    "inspected_source_date_1": "September 14, 2018",
    "retrieved_utc": "2026-10-08T06:55:33.003195+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 14, 2018"
  ],
  "id": "person-coverage-a845518777534b::S1",
  "title": "INTERVIEW: Directors Kevin Adams And Joe Ksander Of \"Next Gen\" - Animation Scoop",
  "url": "https://www.animationscoop.com/interview-directors-kevin-adams-and-joe-ksander-of-next-gen/"
}

Joe Ksander: Jackson Murphy’s original interview; ordered director subjects Kevin Adams, Joe Ksander. Claims attributed to Ksander describe collective work and preserve the comic’s prior idea. Fictional memory management is not an implementation of real AI.

Joe Ksander: Jackson Murphy’s original interview; ordered director subjects Kevin Adams, Joe Ksander. Claims attributed to Ksander describe collective work and preserve the comic’s prior idea. Fictional memory management is not an implementation of real AI.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John F. Nash Jr.

John F. Nash Jr. recalls that an economics course at Carnegie led to the idea behind The Bargaining Problem.

His autobiography connects that idea to his later engagement with game theory at Princeton and the development of Non-Cooperative Games.

He explains that the game-theoretic work became his mathematics dissertation while he also pursued separate results on manifolds and algebraic varieties.

Sources and details

John F. Nash Jr. – Biographical - NobelPrize.org

{
  "access_scope": "John F. Nash Jr.: First-person Nobel autobiography; full identity is explicitly printed in the cached HTML title and award metadata. Research development is Nash’s recollection, not independent priority adjudication.",
  "authors": [
    "John F. Nash Jr."
  ],
  "authors_in_source_order": [
    "John F. Nash Jr."
  ],
  "dates": {
    "inspected_source_date_1": "award-time autobiography 1994; historical graduate study",
    "retrieved_utc": "2026-10-08T06:55:43.508640+00:00"
  },
  "dates_exact_in_source_role_order": [
    "award-time autobiography 1994; historical graduate study"
  ],
  "id": "person-johnfnashjr::S1",
  "title": "John F. Nash Jr. – Biographical - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1994/nash/biographical/"
}

John F. Nash Jr.: First-person Nobel autobiography; full identity is explicitly printed in the cached HTML title and award metadata. Research development is Nash’s recollection, not independent priority adjudication.

John F. Nash Jr.: First-person Nobel autobiography; full identity is explicitly printed in the cached HTML title and award metadata. Research development is Nash’s recollection, not independent priority adjudication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

K. Eric Drexler

K. Eric Drexler’s National Space Society biography describes research on advanced nanotechnology and productive nanosystems.

It distinguishes the general-audience Engines of Creation from Nanosystems, a quantitative treatment expanded from his doctoral thesis.

The account also places him in the development of a technology roadmap for productive nanosystems, linking theoretical work with research planning.

Sources and details

National Space Society Governor K. Eric Drexler Biography - NSS

{
  "access_scope": "K. Eric Drexler: Institutional biography; book descriptions and roadmap participation are bounded to this account, not full-work inspection, demonstrated manufacturing capability or sole roadmap authorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Engines of Creation 1986; Nanosystems 1992; roadmap 2007",
    "retrieved_utc": "2026-10-08T06:55:21.542251+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Engines of Creation 1986; Nanosystems 1992; roadmap 2007"
  ],
  "id": "person-kericdrexler::S1",
  "title": "National Space Society Governor K. Eric Drexler Biography - NSS",
  "url": "https://nss.org/national-space-society-governor-k-eric-drexler-biography/"
}

K. Eric Drexler: Institutional biography; book descriptions and roadmap participation are bounded to this account, not full-work inspection, demonstrated manufacturing capability or sole roadmap authorship.

K. Eric Drexler: Institutional biography; book descriptions and roadmap participation are bounded to this account, not full-work inspection, demonstrated manufacturing capability or sole roadmap authorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ka-Ho Chow

Ka-Ho Chow studies the intersection of machine learning, cybersecurity and computing systems.

His HKU profile frames this work around understanding security and privacy threats to AI and designing more resilient responses.

It describes algorithmic and infrastructure optimization across centralized and federated learning, including language models and visual recognition.

Sources and details

Chow, Ka Ho

{
  "access_scope": "Ka-Ho Chow: Institutional research profile; stated research interests and goals are not measured guarantees of trustworthy or attack-proof systems. Exact fullname Ka-Ho Chow occurs in the biography body.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "undated cached institutional profile",
    "retrieved_utc": "2026-10-08T06:55:37.169703+00:00"
  },
  "dates_exact_in_source_role_order": [
    "undated cached institutional profile"
  ],
  "id": "person-coverage-c6b25368748707::S1",
  "title": "Chow, Ka Ho",
  "url": "https://www.cs.hku.hk/people/academic-staff/kachow"
}

Ka-Ho Chow: Institutional research profile; stated research interests and goals are not measured guarantees of trustworthy or attack-proof systems. Exact fullname Ka-Ho Chow occurs in the biography body.

Ka-Ho Chow: Institutional research profile; stated research interests and goals are not measured guarantees of trustworthy or attack-proof systems. Exact fullname Ka-Ho Chow occurs in the biography body.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Solaris

The official Lem site presents Solaris as a novel about contact with an alien world and the difficulty of understanding it through human stories.

In the page's author commentary, Lem recalls writing Kelvin's arrival before he himself knew why Snaut feared the newcomer, describing discovery as part of composition.

A separate translation notice credits Bill Johnston and distinguishes his direct translation from the earlier English edition made through French.

Sources and details

Solaris

{
  "access_scope": "Official title page and bounded author/translation commentary; not the full novel or a reviewed comparison of translations.",
  "authors": [
    "Stanisław Lem"
  ],
  "authors_in_source_order": [
    "Stanisław Lem"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:55:39.637964+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-culture-0f4179568f20ac::S1",
  "title": "Solaris",
  "url": "https://www.english.lem.pl/works/novels/solaris"
}

Official title page and bounded author/translation commentary; not the full novel or a reviewed comparison of translations.

Official title page and bounded author/translation commentary; not the full novel or a reviewed comparison of translations.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Polish original 1961; English translations have separate dates. Ocean intelligence is not a conventional manufactured AI.",
  "dated": true,
  "year": 1961
}

Commonwealth Saga

Pan Macmillan presents the Commonwealth Saga as a two-book sequence by Peter F. Hamilton, with Pandora's Star first and Judas Unchained second.

Its description of the first book begins with a star going dark beyond inhabited space, making the urge to investigate a dangerous mystery the initial premise.

The second book's synopsis shifts to humanity fighting a savage war and identifies it as the conclusion of the galaxy-spanning duology.

Sources and details

Commonwealth Saga

{
  "access_scope": "Series-order and two short publisher synopsis scope only; no full-novel audit or inclusion of adjacent Commonwealth-universe works.",
  "authors": [
    "Peter F. Hamilton"
  ],
  "authors_in_source_order": [
    "Peter F. Hamilton"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T06:55:45.527068+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-culture-12b9037289e4eb::S1",
  "title": "Commonwealth Saga",
  "url": "https://www.panmacmillan.com/series/commonwealth-saga/panmac26591"
}

Series-order and two short publisher synopsis scope only; no full-novel audit or inclusion of adjacent Commonwealth-universe works.

Series-order and two short publisher synopsis scope only; no full-novel audit or inclusion of adjacent Commonwealth-universe works.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original duology comprises Pandora’s Star (2004) and Judas Unchained (2005); range 2004–2005 is for these two books, not all fiction in the broader Commonwealth universe.",
  "dated": false,
  "year": "2004–2005"
}

Pandora's Star

In the publisher's synopsis of Pandora's Star, humanity in AD 2329 inhabits hundreds of planets linked by wormholes when a distant star is abruptly enclosed within an immense force field.

Wilson Kime commands the faster-than-light mission sent to investigate a system beyond the established network.

The premise turns exploration into a containment problem: entering the barrier may be easier than preventing whatever it encloses from escaping.

Sources and details

Pandora's Star

{
  "access_scope": "Publisher synopsis for the 2020 paperback manifestation; canonical original publication date retained separately; first Commonwealth Saga novel, not the entire duology.",
  "authors": [
    "Peter F. Hamilton"
  ],
  "authors_in_source_order": [
    "Peter F. Hamilton"
  ],
  "dates": {
    "inspected_source_date_1": "20 August 2020 inspected paperback manifestation",
    "retrieved_utc": "2026-10-08T06:55:44.058284+00:00"
  },
  "dates_exact_in_source_role_order": [
    "20 August 2020 inspected paperback manifestation"
  ],
  "id": "work-culture-6faf57cec678fb::S1",
  "title": "Pandora's Star",
  "url": "https://www.panmacmillan.com/authors/peter-f-hamilton/pandoras-star/9781509868575"
}

Publisher synopsis for the 2020 paperback manifestation; canonical original publication date retained separately; first Commonwealth Saga novel, not the entire duology.

Publisher synopsis for the 2020 paperback manifestation; canonical original publication date retained separately; first Commonwealth Saga novel, not the entire duology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First book Macmillan London 2004; cited reissue catalog explicitly identifies original 2004 date. Exact day not verified.",
  "dated": true,
  "year": 2004
}

The Neutronium Alchemist

The publisher's synopsis of The Neutronium Alchemist describes a spreading threat whose affected individuals acquire immense powers while the Confederation Navy struggles to contain collapsing worlds.

Dr Alkad Mzu seeks the Alchemist to complete a decades-old mission to destroy a star, while other parties pursue their own uses for the weapon.

The page positions the novel between The Reality Dysfunction and The Naked God, making the weapon's competing uses part of the middle volume of the Night's Dawn trilogy.

Sources and details

The Neutronium Alchemist

{
  "access_scope": "Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.",
  "authors": [
    "Peter F. Hamilton"
  ],
  "authors_in_source_order": [
    "Peter F. Hamilton"
  ],
  "dates": {
    "inspected_source_date_1": "23 August 2018 inspected paperback manifestation",
    "retrieved_utc": "2026-10-08T06:55:45.114797+00:00"
  },
  "dates_exact_in_source_role_order": [
    "23 August 2018 inspected paperback manifestation"
  ],
  "id": "work-culture-a40bc68643c816::S1",
  "title": "The Neutronium Alchemist",
  "url": "https://www.panmacmillan.com/authors/peter-f-hamilton/the-neutronium-alchemist/9781509868612"
}

Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.

Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original UK book publication 1997; retain this year rather than a later US split-volume, paperback, or ebook date. Exact day not verified in primary evidence for this patch.",
  "dated": true,
  "year": 1997
}

The Reality Dysfunction

The publisher's synopsis of The Reality Dysfunction places its AD 2600 society among diverse colonized worlds, engineered space creatures and sentient trading starships.

An encounter between a renegade criminal and an alien entity on a colony planet releases a threat that disrupts this apparently flourishing interstellar order.

The page identifies the novel as the opening volume of the Night's Dawn trilogy, followed by The Neutronium Alchemist and The Naked God.

Sources and details

The Reality Dysfunction

{
  "access_scope": "Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.",
  "authors": [
    "Peter F. Hamilton"
  ],
  "authors_in_source_order": [
    "Peter F. Hamilton"
  ],
  "dates": {
    "inspected_source_date_1": "12 August 2018 inspected paperback manifestation",
    "retrieved_utc": "2026-10-08T06:55:45.417707+00:00"
  },
  "dates_exact_in_source_role_order": [
    "12 August 2018 inspected paperback manifestation"
  ],
  "id": "work-culture-a914a91e0e887c::S1",
  "title": "The Reality Dysfunction",
  "url": "https://www.panmacmillan.com/authors/peter-f-hamilton/the-reality-dysfunction/9781509868605"
}

Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.

Publisher synopsis for the 2018 paperback manifestation; original novel date retained separately; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original UK book publication 1996; retain this year rather than a later US split-volume, paperback, or ebook date. Exact day not verified in primary evidence for this patch.",
  "dated": true,
  "year": 1996
}

The Market for Lemons

Akerlof's paper relates uncertainty about product quality to market incentives, arguing that reliance on group-level quality estimates can reward poor-quality sellers and shrink the market.

Its used-car example gives sellers better information about a particular car than buyers, preventing buyers from pricing good and bad cars separately and discouraging owners of good cars from selling.

The paper explicitly presents the automobile example as a concrete illustration chosen for clarity rather than realism.

Sources and details

The Market for "Lemons": Quality Uncertainty and the Market Mechanism

{
  "access_scope": "Selected PDF pages 1–3 visually inspected, including article pages 488–489; theoretical illustrative model scope, no full-paper audit.",
  "authors": [
    "George A. Akerlof"
  ],
  "authors_in_source_order": [
    "George A. Akerlof"
  ],
  "dates": {
    "inspected_source_date_1": "August 1970 journal article",
    "inspected_source_date_2": "13 August 2018 JSTOR access stamp",
    "retrieved_utc": "2026-10-08T06:55:46.842275+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 1970 journal article",
    "13 August 2018 JSTOR access stamp"
  ],
  "id": "work-161b961cbf98::S1",
  "title": "The Market for \"Lemons\": Quality Uncertainty and the Market Mechanism",
  "url": "https://www.sfu.ca/~allen/Ackerlof.pdf"
}

Selected PDF pages 1–3 visually inspected, including article pages 488–489; theoretical illustrative model scope, no full-paper audit.

Selected PDF pages 1–3 visually inspected, including article pages 488–489; theoretical illustrative model scope, no full-paper audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1970
}

John von Neumann 1903–1957

Ulam's memorial article combines an account of von Neumann's life and work with recollections drawn from twenty-five years of personal acquaintance.

In its computing discussion, Ulam credits von Neumann with shaping machine logic, memory and instruction choices, and supervising construction of the Institute for Advanced Study machine.

The same passage explains why enormous numerical calculations required attention to the reliability and stability of intermediate steps even when the final physical answer needed only approximate accuracy.

Sources and details

John von Neumann 1903–1957

{
  "access_scope": "PDF pages 1 and 32 visually inspected; selected memorial and computing passages only; title life dates are not publication dates, no full-work audit.",
  "authors": [
    "S. Ulam"
  ],
  "authors_in_source_order": [
    "S. Ulam"
  ],
  "dates": {
    "inspected_source_date_1": "8 February 1958 editor-received date",
    "retrieved_utc": "2026-10-08T06:55:24.470175+00:00"
  },
  "dates_exact_in_source_role_order": [
    "8 February 1958 editor-received date"
  ],
  "id": "work-1a8872dfaa3c::S1",
  "title": "John von Neumann 1903–1957",
  "url": "https://projecteuclid.org/journalArticle/Download?urlid=bams%2F1183522369"
}

PDF pages 1 and 32 visually inspected; selected memorial and computing passages only; title life dates are not publication dates, no full-work audit.

PDF pages 1 and 32 visually inspected; selected memorial and computing passages only; title life dates are not publication dates, no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1958 tribute reporting an earlier conversation; its date is not established here.",
  "dated": true,
  "year": 1958
}

Enemy of the State

Disney's synopsis of Enemy of the State centers on attorney Robert Clayton Dean unwittingly receiving a video that implicates a senior NSA official in a political murder.

NSA operatives then use an advanced surveillance and intimidation campaign to discredit Dean and recover the evidence.

The resulting thriller follows Dean's effort to regain his ordinary life while the incriminating recording makes him a target of state power.

Sources and details

Enemy of the State

{
  "access_scope": "Studio title synopsis and film metadata only, Singapore-region listing; no transcript, scene-by-scene viewing or full-film audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1998 film release",
    "retrieved_utc": "2026-10-08T06:55:38.997670+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1998 film release"
  ],
  "id": "work-coverage-8a70f185470450::S1",
  "title": "Enemy of the State",
  "url": "https://www.disneyplus.com/en-sg/browse/entity-7bd0a9fb-8a0b-4ce2-bb86-2f5a301121d1"
}

Studio title synopsis and film metadata only, Singapore-region listing; no transcript, scene-by-scene viewing or full-film audit.

Studio title synopsis and film metadata only, Singapore-region listing; no transcript, scene-by-scene viewing or full-film audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1998
}

X-COM / XCOM series

2K's modern XCOM overview describes tactical, turn-based resistance to alien domination through squad leadership, resource management and technology research.

Its XCOM 2 section places Earth under alien rule and makes rebuilding XCOM the starting point for a global resistance.

The Chimera Squad section highlights teamwork and breach-and-clear mission play as changes within the turn-based lineage.

Sources and details

XCOM Franchise Official Site

{
  "access_scope": "Modern publisher franchise-page scope only; original X-COM title history and other installments remain outside inspected evidence; no gameplay or video transcript audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:55:10.623442+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-6102201d46da88::S1",
  "title": "XCOM Franchise Official Site",
  "url": "https://2k.com/games/xcom/"
}

Modern publisher franchise-page scope only; original X-COM title history and other installments remain outside inspected evidence; no gameplay or video transcript audit.

Modern publisher franchise-page scope only; original X-COM title history and other installments remain outside inspected evidence; no gameplay or video transcript audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1994
}

Iron Sunrise

The publisher's synopsis of Iron Sunrise begins with the destruction of the planet Moscow and a retaliatory strike against New Dresden, which was not responsible.

Old Earth's agent Rachel Mansour must identify the actual enemy before the missiles arrive, giving the investigation consequences beyond a single planetary conflict.

The synopsis gives the disaffected teenager Wednesday Shadowmist crucial knowledge of the enemy's identity that she does not realize she possesses.

Sources and details

Iron Sunrise

{
  "access_scope": "Publisher book description and product metadata; 2005 manifestation date distinct from original work date; no full-novel audit.",
  "authors": [
    "Charles Stross"
  ],
  "authors_in_source_order": [
    "Charles Stross"
  ],
  "dates": {
    "inspected_source_date_1": "28 June 2005 inspected mass-market paperback and eBook manifestation",
    "retrieved_utc": "2026-10-08T06:55:45.980542+00:00"
  },
  "dates_exact_in_source_role_order": [
    "28 June 2005 inspected mass-market paperback and eBook manifestation"
  ],
  "id": "work-culture-f9bfe9347816c2::S1",
  "title": "Iron Sunrise",
  "url": "https://www.penguinrandomhouse.com/books/289271/iron-sunrise-by-charles-stross/"
}

Publisher book description and product metadata; 2005 manifestation date distinct from original work date; no full-novel audit.

Publisher book description and product metadata; 2005 manifestation date distinct from original work date; no full-novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Sequel to Singularity Sky; author confirms July 2004 hardcover.",
  "dated": true,
  "year": 2004
}

Lana Wachowski

Lilly Wachowski’s retrospective interview describes Lana and Lilly’s Matrix direction as mostly working in tandem, supported by an established rapport with their cinematographer and visual-effects team.

Her account links their shared visual language to moving cameras, comics and collaborators across editing, sound and photography, rather than assigning that language to one sibling alone.

She recalls that extensive storyboards made the film a page-by-page production map, helping the team navigate shooting while visual effects remained a major later challenge.

Sources and details

Lilly Wachowski Interview: "I’m Trying to Do All of It" | Autostraddle

{
  "access_scope": "Lilly Wachowski interview conducted by Drew Burnett Gregory in October 2024; Lana’s contribution is described through explicit joint direction and Lilly’s retrospective account. This is not a separate firsthand interview with Lana or a division of individual technical tasks. Existing Cannes Larry/Andy credit-source identity exceptions remain intact.",
  "authors": [
    "Drew Burnett Gregory"
  ],
  "authors_in_source_order": [
    "Drew Burnett Gregory"
  ],
  "dates": {
    "inspected_source_date_1": "Published October 11, 2024; modified October 12, 2024",
    "retrieved_utc": "2026-10-08T06:55:34.800989+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published October 11, 2024; modified October 12, 2024"
  ],
  "id": "creative-person-coverage-631b1711e6c45d::S1",
  "title": "Lilly Wachowski Interview: \"I’m Trying to Do All of It\" | Autostraddle",
  "url": "https://www.autostraddle.com/lilly-wachowski-interview/"
}

Lilly Wachowski interview conducted by Drew Burnett Gregory in October 2024; Lana’s contribution is described through explicit joint direction and Lilly’s retrospective account. This is not a separate firsthand interview with Lana or a division of individual technical tasks. Existing Cannes Larry/Andy credit-source identity exceptions remain intact.

Lilly Wachowski interview conducted by Drew Burnett Gregory in October 2024; Lana’s contribution is described through explicit joint direction and Lilly’s retrospective account. This is not a separate firsthand interview with Lana or a division of individual technical tasks. Existing Cannes Larry/Andy credit-source identity exceptions remain intact.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lilly Wachowski

Lilly Wachowski describes developing the Wachowskis’ visual vocabulary with collaborators in cinematography, editing and sound, drawing on both films and comics.

She recalls making comprehensive Matrix storyboards as a production guide, while now preferring more room for performers to shape a scene organically.

In discussing her return to filmmaking through Work in Progress, she emphasizes centering queer and trans experiences and getting those artists working, rather than treating representation as a background detail.

Sources and details

Lilly Wachowski Interview: "I’m Trying to Do All of It" | Autostraddle

{
  "access_scope": "Drew Burnett Gregory’s October 2024 primary interview with Lilly Wachowski. Retrospective process and personal artistic intentions are attributed to Lilly; joint Matrix work is not divided into unsupported individual tasks, and proposed later projects are not treated as completed. Existing Cannes identity exception remains.",
  "authors": [
    "Drew Burnett Gregory"
  ],
  "authors_in_source_order": [
    "Drew Burnett Gregory"
  ],
  "dates": {
    "inspected_source_date_1": "Published October 11, 2024; modified October 12, 2024",
    "retrieved_utc": "2026-10-08T06:55:34.800989+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published October 11, 2024; modified October 12, 2024"
  ],
  "id": "creative-person-coverage-cee41735d81516::S1",
  "title": "Lilly Wachowski Interview: \"I’m Trying to Do All of It\" | Autostraddle",
  "url": "https://www.autostraddle.com/lilly-wachowski-interview/"
}

Drew Burnett Gregory’s October 2024 primary interview with Lilly Wachowski. Retrospective process and personal artistic intentions are attributed to Lilly; joint Matrix work is not divided into unsupported individual tasks, and proposed later projects are not treated as completed. Existing Cannes identity exception remains.

Drew Burnett Gregory’s October 2024 primary interview with Lilly Wachowski. Retrospective process and personal artistic intentions are attributed to Lilly; joint Matrix work is not divided into unsupported individual tasks, and proposed later projects are not treated as completed. Existing Cannes identity exception remains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Denis Villeneuve

Denis Villeneuve describes bringing composer Jóhann Jóhannsson into the filmmaking process early, using scripts and scenes to start musical exploration before editing is finished.

He and editor Joe Walker initially cut without music, then revise the edit in response to Jóhannsson’s proposed themes, making the score part of an ongoing exchange.

For Arrival, their discussion explains how early collaboration lets music and sound design share an atmosphere while leaving space for the film’s distinctive alien-language sounds.

Sources and details

Taking Sound and Music to Another Realm

{
  "access_scope": "Jon Burlingame’s Fall/Winter 2016–17 DGA interview with Villeneuve and Jóhannsson, primarily selected for their Arrival process. The jointly described sound work retains the composer and editor’s roles. Blade Runner 2049 was still in development in this interview; it does not establish Jóhannsson’s final released-film composer credit.",
  "authors": [
    "Jon Burlingame"
  ],
  "authors_in_source_order": [
    "Jon Burlingame"
  ],
  "dates": {
    "inspected_source_date_1": "Fall/Winter 2016–17 issue; HTML published_time December 8, 2016",
    "retrieved_utc": "2026-10-08T06:55:38.653822+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Fall/Winter 2016–17 issue; HTML published_time December 8, 2016"
  ],
  "id": "creative-person-coverage-5d939151725408::S1",
  "title": "Taking Sound and Music to Another Realm",
  "url": "https://www.dga.org/craft/dgaq/issues/1701-winter-2017/collaborators-villeneuve-johannsson"
}

Jon Burlingame’s Fall/Winter 2016–17 DGA interview with Villeneuve and Jóhannsson, primarily selected for their Arrival process. The jointly described sound work retains the composer and editor’s roles. Blade Runner 2049 was still in development in this interview; it does not establish Jóhannsson’s final released-film composer credit.

Jon Burlingame’s Fall/Winter 2016–17 DGA interview with Villeneuve and Jóhannsson, primarily selected for their Arrival process. The jointly described sound work retains the composer and editor’s roles. Blade Runner 2049 was still in development in this interview; it does not establish Jóhannsson’s final released-film composer credit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Lucas

In the Phantom Menace oral history, George Lucas explains that digital production capabilities allowed him to expand beyond the locations, crowds and costumes he could previously afford.

He describes the prequel story as filling gaps in an existing backstory, turning material about the Jedi, Sith and Republic into a fuller script.

His world-building account emphasizes consistent rules and detailed design across cultures and environments, while the oral history separately credits the artists and production specialists who realized those worlds.

Sources and details

Star Wars: Episode I The Phantom Menace: An Oral History | StarWars.com

{
  "access_scope": "Dan Brooks’s May 2019 official StarWars.com oral history with direct Lucas statements and other named participants. Lucas is explicitly identified as writer/director; fictional Jedi/Sith history is a story premise, and production tasks described by other participants are not reassigned to him.",
  "authors": [
    "Dan Brooks"
  ],
  "authors_in_source_order": [
    "Dan Brooks"
  ],
  "dates": {
    "inspected_source_date_1": "May 24, 2019",
    "retrieved_utc": "2026-10-08T06:55:47.372485+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 24, 2019"
  ],
  "id": "creative-person-coverage-5de8bf4e586973::S1",
  "title": "Star Wars: Episode I The Phantom Menace: An Oral History | StarWars.com",
  "url": "https://www.starwars.com/news/star-wars-episode-i-the-phantom-menace-oral-history"
}

Dan Brooks’s May 2019 official StarWars.com oral history with direct Lucas statements and other named participants. Lucas is explicitly identified as writer/director; fictional Jedi/Sith history is a story premise, and production tasks described by other participants are not reassigned to him.

Dan Brooks’s May 2019 official StarWars.com oral history with direct Lucas statements and other named participants. Lucas is explicitly identified as writer/director; fictional Jedi/Sith history is a story premise, and production tasks described by other participants are not reassigned to him.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andrew Niccol

Andrew Niccol’s S1M0NE interview describes his interest in the humanity and ambiguity within technology, rather than reducing its consequences to a simple good-or-bad judgment.

He frames the fictional celebrity as an inversion of The Truman Show: an invented person deceives the world, exposing how a star’s public image can be manufactured.

Niccol explains that the production mixed multiple performers’ voices for Simone, using their variations to build the illusion.

Sources and details

SPLICEDwire | Andrew Niccol interview for "Simone" (2002)

{
  "access_scope": "Rob Blackwelder’s August 12, 2002 SPLICEDwire Q&A with writer/director Andrew Niccol; some questions came from another journalist present. S1M0NE’s artificial celebrity is fiction, and the disclosed human performance process is distinct from the story’s computer-generated-person premise.",
  "authors": [
    "Rob Blackwelder"
  ],
  "authors_in_source_order": [
    "Rob Blackwelder"
  ],
  "dates": {
    "inspected_source_date_1": "Interview August 12, 2002",
    "retrieved_utc": "2026-10-08T06:55:28.323722+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Interview August 12, 2002"
  ],
  "id": "creative-person-coverage-db2892d390f0e1::S1",
  "title": "SPLICEDwire | Andrew Niccol interview for \"Simone\" (2002)",
  "url": "https://splicedwire.com/02features/aniccol.html"
}

Rob Blackwelder’s August 12, 2002 SPLICEDwire Q&A with writer/director Andrew Niccol; some questions came from another journalist present. S1M0NE’s artificial celebrity is fiction, and the disclosed human performance process is distinct from the story’s computer-generated-person premise.

Rob Blackwelder’s August 12, 2002 SPLICEDwire Q&A with writer/director Andrew Niccol; some questions came from another journalist present. S1M0NE’s artificial celebrity is fiction, and the disclosed human performance process is distinct from the story’s computer-generated-person premise.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Anthony Daniels

Anthony Daniels’s memoir interview connects C-3PO’s physical performance to the restrictive costume, including a carefully constrained walk and the challenge of reacting to a silent R2-D2 on set.

He explains how small mime gestures can suggest emotion through an unchanging mask, citing a head movement whose meaning is reinforced by the score and other actors.

Daniels also describes the character’s vulnerability and lack of social filtering as ways viewers can recognize their own feelings in the fictional droid.

Sources and details

Anthony Daniels Interview - I Am C-3PO | StarWars.com

{
  "access_scope": "Kristin Baver’s December 2019 StarWars.com interview with Anthony Daniels about I Am C-3PO. Actual performance-specific narrative and explicit C-3PO role support are present; fictional robot characterization is not AI engineering. Daniels retains the acknowledged contributions of crew, John Williams and fellow performers.",
  "authors": [
    "Kristin Baver"
  ],
  "authors_in_source_order": [
    "Kristin Baver"
  ],
  "dates": {
    "inspected_source_date_1": "December 12, 2019",
    "retrieved_utc": "2026-10-08T06:55:47.279441+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 12, 2019"
  ],
  "id": "creative-person-coverage-8e22e7d7c41969::S1",
  "title": "Anthony Daniels Interview - I Am C-3PO | StarWars.com",
  "url": "https://www.starwars.com/news/anthony-daniels-memoir-interview"
}

Kristin Baver’s December 2019 StarWars.com interview with Anthony Daniels about I Am C-3PO. Actual performance-specific narrative and explicit C-3PO role support are present; fictional robot characterization is not AI engineering. Daniels retains the acknowledged contributions of crew, John Williams and fellow performers.

Kristin Baver’s December 2019 StarWars.com interview with Anthony Daniels about I Am C-3PO. Actual performance-specific narrative and explicit C-3PO role support are present; fictional robot characterization is not AI engineering. Daniels retains the acknowledged contributions of crew, John Williams and fellow performers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tyler Perry

Tyler Perry’s creator-hosted biography traces his first play to personal letters and describes the long development of I Know I’ve Been Changed from an initially empty audience to a later theatrical run.

The account places Madea’s first stage appearance in I Can Do Bad All By Myself and describes Perry’s subsequent move into film with Diary of a Mad Black Woman.

It follows his expansion into television through House of Payne and later scripted programming for OWN, showing how the same career developed across stage, film and episodic formats.

Sources and details

Tyler Perry » Tyler Perry’s Story

{
  "access_scope": "Undated Tyler Perry Entertainment biography hosted by Tyler Perry Studios; no named individual page writer. Historical milestones are attributed to this self-description, not independent verification of commercial rankings, audience size or revenue; character premises remain fiction. Copyright 2026 in the site footer is not the publication date.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated page; prose describes 1992 play, 2005 film, 2007 TV and 2012–13 OWN programming",
    "retrieved_utc": "2026-10-08T06:55:30.997768+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated page; prose describes 1992 play, 2005 film, 2007 TV and 2012–13 OWN programming"
  ],
  "id": "creative-person-coverage-033fe8176c3de6::S1",
  "title": "Tyler Perry » Tyler Perry’s Story",
  "url": "https://tylerperry.com/tyler/story/"
}

Undated Tyler Perry Entertainment biography hosted by Tyler Perry Studios; no named individual page writer. Historical milestones are attributed to this self-description, not independent verification of commercial rankings, audience size or revenue; character premises remain fiction. Copyright 2026 in the site footer is not the publication date.

Undated Tyler Perry Entertainment biography hosted by Tyler Perry Studios; no named individual page writer. Historical milestones are attributed to this self-description, not independent verification of commercial rankings, audience size or revenue; character premises remain fiction. Copyright 2026 in the site footer is not the publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reinforcement learning

Sutton and Barto’s in-progress textbook defines reinforcement learning as discovering actions that maximize a numerical reward through interaction with an environment.

The learning problem is closed-loop: an action changes what the agent encounters next, so it must try actions rather than receive a supervisor’s correct-action labels.

The chapter emphasizes delayed consequences, since an action can change both immediate reward and the later situations and rewards the agent will experience.

Sources and details

Source

{
  "access_scope": "Primary textbook draft hosted by Stanford, explicitly labeled second edition in progress with copyright 2014, 2015; inspected PDF pp.1 and16 (printed introductory section p.2). This older manifestation is separate from the held March 2018 draft and the published second edition; selected prose describes a computational formulation, not a claim that every real agent learns optimally.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "inspected_source_date_1": "Copyright 2014, 2015; second edition in progress",
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Copyright 2014, 2015; second edition in progress"
  ],
  "id": "concept-tech-ReinforcementLearning::S1",
  "title": null,
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

Primary textbook draft hosted by Stanford, explicitly labeled second edition in progress with copyright 2014, 2015; inspected PDF pp.1 and16 (printed introductory section p.2). This older manifestation is separate from the held March 2018 draft and the published second edition; selected prose describes a computational formulation, not a claim that every real agent learns optimally.

Primary textbook draft hosted by Stanford, explicitly labeled second edition in progress with copyright 2014, 2015; inspected PDF pp.1 and16 (printed introductory section p.2). This older manifestation is separate from the held March 2018 draft and the published second edition; selected prose describes a computational formulation, not a claim that every real agent learns optimally.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Turing test

Turing replaces the ambiguous question of whether machines think with an imitation-game question about how an interrogator identifies hidden participants.

He specifies written or typed communication so voice and physical appearance do not give the participants away, focusing the comparison on answers rather than bodies.

The proposed machine case asks what happens when a machine takes one participant’s place and compares the interrogator’s errors with those in the original human game.

Sources and details

Source

{
  "access_scope": "Princeton-hosted PDF reproduction of A. M. Turing’s 1950 Mind article, rendered from a Loebner web transcription with a January 21, 2007 print footer. PDF pp.1–2 visually inspected. This is the historical gender-based imitation game described in the source, not a merged modern chatbot protocol, proof of consciousness or a claim of empirical passage.",
  "authors": [
    "A. M. Turing"
  ],
  "authors_in_source_order": [
    "A. M. Turing"
  ],
  "dates": {
    "inspected_source_date_1": "Original article 1950, Mind 59 pp. 433–460; reproduced web print January 21, 2007",
    "retrieved_utc": "2026-10-08T06:55:37.516558+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original article 1950, Mind 59 pp. 433–460; reproduced web print January 21, 2007"
  ],
  "id": "concept-tech-TuringTest::S1",
  "title": null,
  "url": "https://www.cs.princeton.edu/~chazelle/courses/BIB/turing-intelligence.pdf"
}

Princeton-hosted PDF reproduction of A. M. Turing’s 1950 Mind article, rendered from a Loebner web transcription with a January 21, 2007 print footer. PDF pp.1–2 visually inspected. This is the historical gender-based imitation game described in the source, not a merged modern chatbot protocol, proof of consciousness or a claim of empirical passage.

Princeton-hosted PDF reproduction of A. M. Turing’s 1950 Mind article, rendered from a Loebner web transcription with a January 21, 2007 print footer. PDF pp.1–2 visually inspected. This is the historical gender-based imitation game described in the source, not a merged modern chatbot protocol, proof of consciousness or a claim of empirical passage.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amdahl’s law

Hill and Marty’s multicore account explains that accelerating only part of a fixed-size computation leaves the remaining work as a limit on total speedup.

They extend this reasoning to a chip-resource budget, where allocating more resources to faster sequential cores competes with using those resources for additional parallel cores.

The paper warns that its model omits memory, interconnection, scheduling and other costs, making its predictions a way to compare design choices under assumptions.

Sources and details

Source

{
  "access_scope": "Mark D. Hill and Michael R. Marty’s July 2008 IEEE Computer article Amdahl’s Law in the Multicore Era, institutional copy; PDF pp.1,2,5 (printed 33, 34, 37) visually inspected. Fixed problem size, fixed parallel fraction and simplified resource assumptions remain explicit; this is a later explanatory extension, not Amdahl’s original 1967 paper or a universal physical bound for growing workloads.",
  "authors": [
    "Mark D. Hill",
    "Michael R. Marty"
  ],
  "authors_in_source_order": [
    "Mark D. Hill",
    "Michael R. Marty"
  ],
  "dates": {
    "inspected_source_date_1": "July 2008; IEEE Computer pp. 33–38",
    "retrieved_utc": "2026-10-08T06:55:31.239984+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2008; IEEE Computer pp. 33–38"
  ],
  "id": "concept-law-amdahl::S1",
  "title": null,
  "url": "https://users.cs.duke.edu/~lkw34/papers/amdahl-multicore-ieee2008.pdf"
}

Mark D. Hill and Michael R. Marty’s July 2008 IEEE Computer article Amdahl’s Law in the Multicore Era, institutional copy; PDF pp.1,2,5 (printed 33, 34, 37) visually inspected. Fixed problem size, fixed parallel fraction and simplified resource assumptions remain explicit; this is a later explanatory extension, not Amdahl’s original 1967 paper or a universal physical bound for growing workloads.

Mark D. Hill and Michael R. Marty’s July 2008 IEEE Computer article Amdahl’s Law in the Multicore Era, institutional copy; PDF pp.1,2,5 (printed 33, 34, 37) visually inspected. Fixed problem size, fixed parallel fraction and simplified resource assumptions remain explicit; this is a later explanatory extension, not Amdahl’s original 1967 paper or a universal physical bound for growing workloads.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wirth’s law

Wirth’s lean-software essay discusses the observation that software can become slower as hardware improves, while explicitly presenting the slowdown saying as Reiser’s informal law.

He connects unnecessary bulk to adopting features without preserving a coherent system concept, and contrasts an all-features package with a small basic system that can be extended for a task.

His Oberon discussion makes the alternative concrete: concentrate on essentials and use disciplined structure so the system can provide its functions with less memory and processing power.

Sources and details

Source

{
  "access_scope": "Niklaus Wirth’s February 1995 IEEE Computer essay A Plea for Lean Software, reproduced on an archive host; PDF pp.1–3 (printed 64–66) visually inspected. The slowdown aphorism is attributed to Reiser within the original essay, not newly claimed to originate with Wirth. These are a historical engineering critique and design example, not a measured universal rate of software slowdown.",
  "authors": [
    "Niklaus Wirth"
  ],
  "authors_in_source_order": [
    "Niklaus Wirth"
  ],
  "dates": {
    "inspected_source_date_1": "February 1995; IEEE Computer pp. 64–68",
    "retrieved_utc": "2026-10-08T06:55:14.248570+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 1995; IEEE Computer pp. 64–68"
  ],
  "id": "concept-law-wirth::S1",
  "title": null,
  "url": "https://gwern.net/doc/cs/algorithm/1995-wirth.pdf"
}

Niklaus Wirth’s February 1995 IEEE Computer essay A Plea for Lean Software, reproduced on an archive host; PDF pp.1–3 (printed 64–66) visually inspected. The slowdown aphorism is attributed to Reiser within the original essay, not newly claimed to originate with Wirth. These are a historical engineering critique and design example, not a measured universal rate of software slowdown.

Niklaus Wirth’s February 1995 IEEE Computer essay A Plea for Lean Software, reproduced on an archive host; PDF pp.1–3 (printed 64–66) visually inspected. The slowdown aphorism is attributed to Reiser within the original essay, not newly claimed to originate with Wirth. These are a historical engineering critique and design example, not a measured universal rate of software slowdown.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Braess’s paradox

The UMass Braess account describes a user-optimized traffic network in which adding a road can shift equilibrium routes and increase travel time for every traveler.

The paradox concerns the result of decentralized choices rather than the assumption that each extra link automatically benefits the whole network.

The page connects this distinction to other network systems, including the Internet and electric circuits, where users’ separate decisions can differ from centralized or system-optimizing behavior.

Sources and details

Braess' Paradox

{
  "access_scope": "UMass institutional/participant account The Braess Paradox, metadata writer Ladimer S. Nagurney and last update December 26, 2016. Selected prose explains a conditional user-optimized network phenomenon; real-city examples are not independently validated here. The German 1968 original and English 2005 translation with Braess, Anna Nagurney and Tina Wakolbinger remain distinct works; those subjects/translators are not page writers.",
  "authors": [
    "Ladimer S. Nagurney"
  ],
  "authors_in_source_order": [
    "Ladimer S. Nagurney"
  ],
  "dates": {
    "inspected_source_date_1": "Last update December 26, 2016; original 1968 and translation 2005 distinguished",
    "retrieved_utc": "2026-10-08T06:55:29.590361+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Last update December 26, 2016; original 1968 and translation 2005 distinguished"
  ],
  "id": "concept-law-braess::S1",
  "title": "Braess' Paradox",
  "url": "https://supernet.isenberg.umass.edu/braess/braess-new.html"
}

UMass institutional/participant account The Braess Paradox, metadata writer Ladimer S. Nagurney and last update December 26, 2016. Selected prose explains a conditional user-optimized network phenomenon; real-city examples are not independently validated here. The German 1968 original and English 2005 translation with Braess, Anna Nagurney and Tina Wakolbinger remain distinct works; those subjects/translators are not page writers.

UMass institutional/participant account The Braess Paradox, metadata writer Ladimer S. Nagurney and last update December 26, 2016. Selected prose explains a conditional user-optimized network phenomenon; real-city examples are not independently validated here. The German 1968 original and English 2005 translation with Braess, Anna Nagurney and Tina Wakolbinger remain distinct works; those subjects/translators are not page writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Clarke’s Third Law

Jeremy Bernstein’s profile presents Clarke’s Third Law as the idea that sufficiently advanced technology can appear magical to an observer.

The account connects the maxim to Clarke’s use of an enigmatic ending in 2001, placing it within imaginative storytelling rather than treating magic as a physical mechanism.

Bernstein also describes Clarke’s caution about technological forecasts tending to be optimistic over short periods and pessimistic over long ones, giving the maxim a broader context of uncertain prediction.

Sources and details

Arthur C. Clarke: Out of the Ego Chamber | The New Yorker

{
  "access_scope": "Jeremy Bernstein’s contemporaneous New Yorker profile on Arthur C. Clarke, URL issue August 9, 1969 with HTML published_time August 2, 1969. Selected passage explicitly calls this the Third Clarke Law; it supports profile-attributed historical context, not the exact date of the maxim’s origin, a universal epistemic theorem or proof of predictions. Clarke is the interviewed/profile subject, not the article writer.",
  "authors": [
    "Jeremy Bernstein"
  ],
  "authors_in_source_order": [
    "Jeremy Bernstein"
  ],
  "dates": {
    "inspected_source_date_1": "August 9, 1969 issue URL; HTML published_time August 2, 1969",
    "retrieved_utc": "2026-10-08T06:55:43.243652+00:00"
  },
  "dates_exact_in_source_role_order": [
    "August 9, 1969 issue URL; HTML published_time August 2, 1969"
  ],
  "id": "concept-law-clarke-third::S1",
  "title": "Arthur C. Clarke: Out of the Ego Chamber | The New Yorker",
  "url": "https://www.newyorker.com/magazine/1969/08/09/ego-chamber"
}

Jeremy Bernstein’s contemporaneous New Yorker profile on Arthur C. Clarke, URL issue August 9, 1969 with HTML published_time August 2, 1969. Selected passage explicitly calls this the Third Clarke Law; it supports profile-attributed historical context, not the exact date of the maxim’s origin, a universal epistemic theorem or proof of predictions. Clarke is the interviewed/profile subject, not the article writer.

Jeremy Bernstein’s contemporaneous New Yorker profile on Arthur C. Clarke, URL issue August 9, 1969 with HTML published_time August 2, 1969. Selected passage explicitly calls this the Third Clarke Law; it supports profile-attributed historical context, not the exact date of the maxim’s origin, a universal epistemic theorem or proof of predictions. Clarke is the interviewed/profile subject, not the article writer.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Bettany

In Marvel’s WandaVision production brief, Paul Bettany says the live audience encouraged a larger performance that helped capture the first episode’s 1950s sitcom style.

He recalls thorough rehearsal and a crew in period costumes, while the director describes Bettany and Elizabeth Olsen changing between comic and dramatic tones during the same shooting day.

Bettany’s discussion of Vision connects the domestic role with the fictional android’s continuing attempt to understand human life and love, extending the character beyond superhero duties.

Sources and details

Source

{
  "access_scope": "Official Marvel Studios WandaVision production brief, no individual document writer byline; PDF pp.2–5 visually inspected for role and actual performance narrative. Paul Bettany is explicitly credited as Vision and quoted as an actor, distinct from head writer Jac Schaeffer and director Matt Shakman. Vision/J.A.R.V.I.S. are fictional characters; the brief does not establish real AI development or sole creative authorship. January 15, 2021 is announced debut, while filename 01-06-21 alone is not asserted as publication.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Announced Disney+ debut January 15, 2021; production brief publication date not explicitly verified",
    "retrieved_utc": "2026-10-08T06:55:19.529513+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Announced Disney+ debut January 15, 2021; production brief publication date not explicitly verified"
  ],
  "id": "creative-person-coverage-d23ae33d5f97a8::S1",
  "title": null,
  "url": "https://lumiere-a.akamaihd.net/v1/documents/wandavision_production_brief_final_01-06-21_8766810b.pdf"
}

Official Marvel Studios WandaVision production brief, no individual document writer byline; PDF pp.2–5 visually inspected for role and actual performance narrative. Paul Bettany is explicitly credited as Vision and quoted as an actor, distinct from head writer Jac Schaeffer and director Matt Shakman. Vision/J.A.R.V.I.S. are fictional characters; the brief does not establish real AI development or sole creative authorship. January 15, 2021 is announced debut, while filename 01-06-21 alone is not asserted as publication.

Official Marvel Studios WandaVision production brief, no individual document writer byline; PDF pp.2–5 visually inspected for role and actual performance narrative. Paul Bettany is explicitly credited as Vision and quoted as an actor, distinct from head writer Jac Schaeffer and director Matt Shakman. Vision/J.A.R.V.I.S. are fictional characters; the brief does not establish real AI development or sole creative authorship. January 15, 2021 is announced debut, while filename 01-06-21 alone is not asserted as publication.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pat Gelsinger

Pat Gelsinger’s September 2024 employee message places Intel’s AI strategy alongside foundry capital efficiency and a stronger focus on its x86 product portfolio.

It announces plans for an expanded AWS collaboration, including an AI fabric chip on Intel 18A and a custom Xeon 6 chip on Intel 3.

The message also proposes an Intel Foundry subsidiary within Intel, using separate governance and reporting to distinguish the foundry business from the product organization.

Sources and details

Source

{
  "access_scope": "Intel-hosted archived employee message explicitly sent by then-CEO Pat Gelsinger on September 16, 2024; PDF pp.1–3 visually inspected. Archive 2025 differs from original publication. These are announced corporate plans and governance intentions, not proof of chip delivery, current employment or personal chip architecture; future-tense commitments remain prospective.",
  "authors": [
    "Pat Gelsinger"
  ],
  "authors_in_source_order": [
    "Pat Gelsinger"
  ],
  "dates": {
    "inspected_source_date_1": "Employee communication September 16, 2024; archive path 2025",
    "retrieved_utc": "2026-10-08T06:55:12.082675+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Employee communication September 16, 2024; archive path 2025"
  ],
  "id": "ai-contribution-person-coverage-93d5bd6286c53f::S1",
  "title": null,
  "url": "https://download.intel.com/newsroom/archive/2025/en-us-2024-09-16-pat-gelsinger-on-foundry-momentum-progress-on-plan.pdf"
}

Intel-hosted archived employee message explicitly sent by then-CEO Pat Gelsinger on September 16, 2024; PDF pp.1–3 visually inspected. Archive 2025 differs from original publication. These are announced corporate plans and governance intentions, not proof of chip delivery, current employment or personal chip architecture; future-tense commitments remain prospective.

Intel-hosted archived employee message explicitly sent by then-CEO Pat Gelsinger on September 16, 2024; PDF pp.1–3 visually inspected. Archive 2025 differs from original publication. These are announced corporate plans and governance intentions, not proof of chip delivery, current employment or personal chip architecture; future-tense commitments remain prospective.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Uneven productivity

Baumol’s 1967 paper models an economy with one sector whose labor productivity stays constant and another whose output per labor hour grows cumulatively.

With wages moving together across sectors, the model makes relative unit costs rise in the sector whose productivity does not keep pace.

The paper distinguishes production where labor mainly supplies a final product from teaching and live performance where labor time can itself be part of the service being valued.

Sources and details

Macroeconomics of Unbalanced Growth: The Anatomy of Urban Crisis

{
  "access_scope": "Historical theoretical model and illustrative service examples under stated wage/productivity assumptions; no claim that every present industry follows this pattern. Original AER article reproduced at a third-party host; not the held JSTOR HTML.",
  "authors": [
    "William J. Baumol"
  ],
  "authors_in_source_order": [
    "William J. Baumol"
  ],
  "dates": {
    "issue": "3",
    "journal_issue": "June 1967",
    "pages": "415–426",
    "retrieved_utc": "2026-10-07T18:21:29.454588+00:00",
    "volume": "57"
  },
  "id": "baumol::S1",
  "title": "Macroeconomics of Unbalanced Growth: The Anatomy of Urban Crisis",
  "url": "https://cooperative-individualism.org/baumol-william_macroeconomics-of-unbalanced-growth-1967-jun.pdf"
}

Historical theoretical model and illustrative service examples under stated wage/productivity assumptions; no claim that every present industry follows this pattern. Original AER article reproduced at a third-party host; not the held JSTOR HTML.

Historical theoretical model and illustrative service examples under stated wage/productivity assumptions; no claim that every present industry follows this pattern. Original AER article reproduced at a third-party host; not the held JSTOR HTML.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1967
}

The uneven frontier of machine ability

Moravec’s archived draft preface contrasts specialized reasoning successes with the computational burden of ordinary visual perception.

He recalls robot-eye images as million-point mosaics, with pattern finding taking minutes and full stereo matching taking hours, while human vision does far more every tenth of a second.

He presents greater computing power as a proposed response to that gap and describes revising his forecasts across a 1978 article, Mind Children in 1988, and the 1998 draft.

Sources and details

Peek at 1998 Moravec book - Preface

{
  "access_scope": "Hans Moravec’s signed May 1998 draft preface and retrospective account of 1978 vision experiments; computational comparisons and later forecasts remain his historical claims. Not proof of present machine ability or the full published book.",
  "authors": [
    "Hans Moravec"
  ],
  "authors_in_source_order": [
    "Hans Moravec"
  ],
  "dates": {
    "draft_signature": "May, 1998",
    "retrieved_utc": "2026-10-07T18:19:46.903671+00:00"
  },
  "id": "moravec::S1",
  "title": "Peek at 1998 Moravec book - Preface",
  "url": "https://frc.ri.cmu.edu/~hpm/book97/0..Preface.html"
}

Hans Moravec’s signed May 1998 draft preface and retrospective account of 1978 vision experiments; computational comparisons and later forecasts remain his historical claims. Not proof of present machine ability or the full published book.

Hans Moravec’s signed May 1998 draft preface and retrospective account of 1978 vision experiments; computational comparisons and later forecasts remain his historical claims. Not proof of present machine ability or the full published book.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1988
}

The boundary of the firm

Coase’s 1937 paper asks why production is sometimes coordinated inside a firm rather than through a series of market exchanges.

It identifies discovering relevant prices and negotiating separate exchange contracts as costs of using the price mechanism.

The paper describes internal coordination as replacing many contracts with an agreement that lets an entrepreneur direct a factor of production within specified limits.

Sources and details

The Nature of the Firm

{
  "access_scope": "Original 1937 Economica theoretical argument, read in a university-hosted JSTOR scan. This is an explanation of coordination and contracting, not a universal prediction of firm size or demonstrated organizational benefit. Cached extraction remains held.",
  "authors": [
    "R. H. Coase"
  ],
  "authors_in_source_order": [
    "R. H. Coase"
  ],
  "dates": {
    "issue": "16",
    "journal_issue": "November 1937",
    "pages": "386–405",
    "retrieved_utc": "2026-10-08T06:06:15.335847+00:00",
    "volume": "4"
  },
  "id": "coase::S1",
  "title": "The Nature of the Firm",
  "url": "https://msuweb.montclair.edu/~lebelp/coasenatfirmec1937.pdf"
}

Original 1937 Economica theoretical argument, read in a university-hosted JSTOR scan. This is an explanation of coordination and contracting, not a universal prediction of firm size or demonstrated organizational benefit. Cached extraction remains held.

Original 1937 Economica theoretical argument, read in a university-hosted JSTOR scan. This is an explanation of coordination and contracting, not a universal prediction of firm size or demonstrated organizational benefit. Cached extraction remains held.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1937
}

Allen Newell

Allen Newell and Herbert A. Simon present computer science as an empirical discipline in Computer Science as Empirical Inquiry: Symbols and Search.

Their physical symbol system hypothesis proposes that symbolic systems provide the necessary and sufficient basis for general intelligent action.

They treat that proposal as an empirical claim open to challenge, rather than an established theorem, and argue that programs can serve as experiments on intelligent behavior.

Sources and details

Computer Science as Empirical Inquiry: Symbols and Search

{
  "access_scope": "Allen Newell: Selected passages of a WPI HTML reproduction, with ordered coauthors Allen Newell, Herbert A. Simon; these are joint arguments, not an allocation of individual research tasks or a validation of the hypothesis.",
  "authors": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "authors_in_source_order": [
    "Allen Newell",
    "Herbert A. Simon"
  ],
  "dates": {
    "inspected_source_date_1": "Publication year not asserted by selected HTML passage",
    "retrieved_utc": "2026-10-08T05:51:20.781957+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication year not asserted by selected HTML passage"
  ],
  "id": "person-allennewell::S1",
  "title": "Computer Science as Empirical Inquiry: Symbols and Search",
  "url": "https://web.cs.wpi.edu/~nth/cs534/papers_worth_reading/Computer_Science_as_Empirical_Inquiry.htm"
}

Allen Newell: Selected passages of a WPI HTML reproduction, with ordered coauthors Allen Newell, Herbert A. Simon; these are joint arguments, not an allocation of individual research tasks or a validation of the hypothesis.

Allen Newell: Selected passages of a WPI HTML reproduction, with ordered coauthors Allen Newell, Herbert A. Simon; these are joint arguments, not an allocation of individual research tasks or a validation of the hypothesis.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Cronenberg

David Cronenberg is credited as director of eXistenZ in the BFI’s account of films about computers.

The account describes a game designer fleeing an attack with a security guard before drawing him into her virtual world.

Its shifting boundary between gameplay and reality, entered through a bodily connection to the game apparatus, makes technological immersion a source of uncertainty and unease.

Sources and details

10 great films about computers | BFI

{
  "access_scope": "David Cronenberg: BFI editorial account of eXistenZ, bounded to the director credit and fictional narrative; no screenplay or effects tasks, actual AI capabilities, or historical influence are assigned.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:18:57.099639+00:00"
  },
  "id": "person-coverage-d4c7893918e284::S1",
  "title": "10 great films about computers | BFI",
  "url": "https://www.bfi.org.uk/lists/10-great-films-about-computers"
}

David Cronenberg: BFI editorial account of eXistenZ, bounded to the director credit and fictional narrative; no screenplay or effects tasks, actual AI capabilities, or historical influence are assigned.

David Cronenberg: BFI editorial account of eXistenZ, bounded to the director credit and fictional narrative; no screenplay or effects tasks, actual AI capabilities, or historical influence are assigned.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Trumbull

Douglas Trumbull recalls in Karen Jaehne’s interview that a World’s Fair film led Stanley Kubrick to hire him for 2001: A Space Odyssey.

He describes helping solve the film’s visual problems through miniatures and the Stargate sequence, contributing to its immersive experience.

His account of Silent Running places the relationship between a human operator and drone robots at the center of his initial idea, while noting that the released film diverged from that treatment.

Sources and details

Douglas Trumbull on creating sci-fi classics | Sight and Sound

{
  "access_scope": "Douglas Trumbull: Retrospective testimony in Karen Jaehne’s interview, first published Spring 1985 and republished by BFI; collaborative film production and an initial treatment are distinct from sole authorship or real AI engineering. Ordered interview writer: Karen Jaehne.",
  "authors": [
    "Karen Jaehne"
  ],
  "authors_in_source_order": [
    "Karen Jaehne"
  ],
  "dates": {
    "inspected_source_date_1": "Original interview Spring 1985; BFI republication February 10, 2022",
    "retrieved_utc": "2026-10-08T06:09:29.113357+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original interview Spring 1985; BFI republication February 10, 2022"
  ],
  "id": "person-coverage-088460abaccffe::S1",
  "title": "Douglas Trumbull on creating sci-fi classics | Sight and Sound",
  "url": "https://www.bfi.org.uk/sight-and-sound/interviews/douglas-trumbull-creating-sci-fi-classics"
}

Douglas Trumbull: Retrospective testimony in Karen Jaehne’s interview, first published Spring 1985 and republished by BFI; collaborative film production and an initial treatment are distinct from sole authorship or real AI engineering. Ordered interview writer: Karen Jaehne.

Douglas Trumbull: Retrospective testimony in Karen Jaehne’s interview, first published Spring 1985 and republished by BFI; collaborative film production and an initial treatment are distinct from sole authorship or real AI engineering. Ordered interview writer: Karen Jaehne.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean-Luc Godard

Jean-Luc Godard’s Alphaville is discussed by Andrew Sarris as a mixture of detective parody, futurism and romance within a computer-controlled society.

Sarris explains that existing Paris architecture supplies the futuristic setting, allowing the film to stage science fiction without elaborate effects.

In his interpretation, the conflict between calculation and imagination gives poetry and love a place in resistance to technological control.

Sources and details

Alphaville | Current | The Criterion Collection

{
  "access_scope": "Jean-Luc Godard: Andrew Sarris’s Criterion essay of October 19, 1998 about the 1965 film; the interpretation belongs to the critic, not to a direct statement by Godard. Ordered essay author: Andrew Sarris. Fictional computer control is not actual AI capability.",
  "authors": [
    "Andrew Sarris"
  ],
  "authors_in_source_order": [
    "Andrew Sarris"
  ],
  "dates": {
    "inspected_source_date_1": "October 19, 1998; film 1965",
    "retrieved_utc": "2026-10-08T06:09:36.871187+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 19, 1998; film 1965"
  ],
  "id": "person-coverage-c55a80c3856d22::S1",
  "title": "Alphaville | Current | The Criterion Collection",
  "url": "https://www.criterion.com/current/posts/38-alphaville"
}

Jean-Luc Godard: Andrew Sarris’s Criterion essay of October 19, 1998 about the 1965 film; the interpretation belongs to the critic, not to a direct statement by Godard. Ordered essay author: Andrew Sarris. Fictional computer control is not actual AI capability.

Jean-Luc Godard: Andrew Sarris’s Criterion essay of October 19, 1998 about the 1965 film; the interpretation belongs to the critic, not to a direct statement by Godard. Ordered essay author: Andrew Sarris. Fictional computer control is not actual AI capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John von Neumann

John von Neumann’s strategic normalization is described in Roger B. Myerson’s autobiography as a way to represent dynamic games through a single stage of independent strategy choices.

The construction makes each strategy a complete contingent plan covering the player’s decisions throughout the game.

Those plans determine expected payoffs in the equivalent strategic-form model, while Myerson distinguishes von Neumann’s later coalitional treatment of cooperative games from that construction.

Sources and details

Roger B. Myerson – Biographical - NobelPrize.org

{
  "access_scope": "John von Neumann: Myerson’s retrospective explanation of the 1928 argument, not direct inspection of von Neumann’s original publication or a claim that he authored Myerson’s account. Ordered account author: Roger B. Myerson.",
  "authors": [
    "Roger B. Myerson"
  ],
  "authors_in_source_order": [
    "Roger B. Myerson"
  ],
  "dates": {
    "award_time_autobiography": "2007",
    "retrieved_utc": "2026-10-07T18:16:58.576406+00:00"
  },
  "id": "person-johnvonneumann::S1",
  "publisher": "NobelPrize.org",
  "title": "Roger B. Myerson – Biographical - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/2007/myerson/biographical/"
}

John von Neumann: Myerson’s retrospective explanation of the 1928 argument, not direct inspection of von Neumann’s original publication or a claim that he authored Myerson’s account. Ordered account author: Roger B. Myerson.

John von Neumann: Myerson’s retrospective explanation of the 1928 argument, not direct inspection of von Neumann’s original publication or a claim that he authored Myerson’s account. Ordered account author: Roger B. Myerson.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jonathan Nolan

Jonathan Nolan and Lisa Joy are identified as Westworld’s writer–executive producer duo in Ann Farmer’s Television Academy interview.

Nolan explains that their adaptation shifted attention toward the park’s artificial hosts, extending ideas from Michael Crichton’s film and a suggestion from J.J. Abrams.

He describes high-speed tests of performers’ blinking and smiling as part of finding how to convey android behavior through filming and acting.

Sources and details

Art of Darkness | Television Academy

{
  "access_scope": "Jonathan Nolan: Ann Farmer’s May 11, 2017 interview credits Jonathan Nolan, Lisa Joy in that order as joint writer–executive producers; Nolan’s responses discuss collective production without allocating sole authorship. Ordered interview writer: Ann Farmer. Fictional androids and performance tests are not AI development.",
  "authors": [
    "Ann Farmer"
  ],
  "authors_in_source_order": [
    "Ann Farmer"
  ],
  "dates": {
    "inspected_source_date_1": "May 11, 2017",
    "retrieved_utc": "2026-10-08T06:09:45.590892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 11, 2017"
  ],
  "id": "person-coverage-383ce5ec2e3add::S1",
  "title": "Art of Darkness | Television Academy",
  "url": "https://www.televisionacademy.com/features/news/features/art-darkness"
}

Jonathan Nolan: Ann Farmer’s May 11, 2017 interview credits Jonathan Nolan, Lisa Joy in that order as joint writer–executive producers; Nolan’s responses discuss collective production without allocating sole authorship. Ordered interview writer: Ann Farmer. Fictional androids and performance tests are not AI development.

Jonathan Nolan: Ann Farmer’s May 11, 2017 interview credits Jonathan Nolan, Lisa Joy in that order as joint writer–executive producers; Nolan’s responses discuss collective production without allocating sole authorship. Ordered interview writer: Ann Farmer. Fictional androids and performance tests are not AI development.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gerald R. Salancik

Gerald R. Salancik and Jeffrey Pfeffer describe organizational power as accruing to units that handle critical problems and uncertainty.

Their strategic-contingency account connects that influence with control of scarce resources, key appointments and the definition of organizational priorities.

They argue that the same processes can help an organization respond to its environment while also allowing institutionalized power to insulate it from changing demands.

Sources and details

Who Gets Power—And How They Hold on to It: A Strategic-Contingency Model of Power

{
  "access_scope": "Gerald R. Salancik: Partial original article inspection, PDF pages 1–2/printed 3–4, archived by MIT. Ordered coauthors Gerald R. Salancik, Jeffrey Pfeffer; joint theoretical account, not allocation of individual tasks or a validated universal organizational law.",
  "authors": [
    "Gerald R. Salancik",
    "Jeffrey Pfeffer"
  ],
  "authors_in_source_order": [
    "Gerald R. Salancik",
    "Jeffrey Pfeffer"
  ],
  "dates": {
    "inspected_source_date_1": "Organizational Dynamics, Winter 1977; printed pages 3–4 inspected",
    "retrieved_utc": "2026-10-08T06:55:31.304973+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Organizational Dynamics, Winter 1977; printed pages 3–4 inspected"
  ],
  "id": "person-coverage-8b431b3a4e0b10::S1",
  "title": "Who Gets Power—And How They Hold on to It: A Strategic-Contingency Model of Power",
  "url": "https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Power/Salancik_Pfeffer_1977_Who_gets_power.pdf"
}

Gerald R. Salancik: Partial original article inspection, PDF pages 1–2/printed 3–4, archived by MIT. Ordered coauthors Gerald R. Salancik, Jeffrey Pfeffer; joint theoretical account, not allocation of individual tasks or a validated universal organizational law.

Gerald R. Salancik: Partial original article inspection, PDF pages 1–2/printed 3–4, archived by MIT. Ordered coauthors Gerald R. Salancik, Jeffrey Pfeffer; joint theoretical account, not allocation of individual tasks or a validated universal organizational law.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James G. March

James G. March’s Exploration and Exploitation in Organizational Learning examines the tension between trying new possibilities and refining established practices.

The opening argument explains why experimentation without consolidation can leave ideas undeveloped, while exclusive refinement can trap an organization in a stable but inferior pattern.

His abstract warns that adaptive processes may strengthen exploitation faster than exploration, producing short-term effectiveness at the expense of longer-term viability.

Sources and details

Exploration and Exploitation in Organizational Learning

{
  "access_scope": "James G. March: Original article abstract and introduction on PDF page 2/printed71, institutional archived JSTOR reproduction. Sole credited author James G. March; model-based argument is attributed, not a universal empirical guarantee.",
  "authors": [
    "James G. March"
  ],
  "authors_in_source_order": [
    "James G. March"
  ],
  "dates": {
    "inspected_source_date_1": "Organization Science 2(1), February 1991; pp.71–87; received August 18,1989",
    "retrieved_utc": "2026-10-08T05:51:19.720551+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Organization Science 2(1), February 1991; pp.71–87; received August 18,1989"
  ],
  "id": "person-jamesgmarch::S1",
  "title": "Exploration and Exploitation in Organizational Learning",
  "url": "https://strategy.sjsu.edu/www.stable/pdf/March%2C%20J.%20G.%20%281991%29.%20Organization%20Science%202%281%29%2071-87.pdf"
}

James G. March: Original article abstract and introduction on PDF page 2/printed71, institutional archived JSTOR reproduction. Sole credited author James G. March; model-based argument is attributed, not a universal empirical guarantee.

James G. March: Original article abstract and introduction on PDF page 2/printed71, institutional archived JSTOR reproduction. Sole credited author James G. March; model-based argument is attributed, not a universal empirical guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Parkinson’s Law

Parkinson’s opening essay proposes that work can fill the time available, illustrating the claim with an exaggerated contrast between a leisurely postcard task and the same task done quickly.

He connects elastic paperwork with staff growth, arguing that the number of officials can rise without a corresponding increase in the work needing to be done.

The essay explains this tendency through two motives: officials prefer adding subordinates to adding rivals, and officials generate work for one another.

Sources and details

Source

{
  "access_scope": "C. Northcote Parkinson’s humorous administrative essay in a seventeenth-printing copy of the book bearing copyright 1957, separate from the original Economist essay. This is a historical satirical argument, not independent validation of a universal empirical or mathematical law. The original PDF extracted text has broken font encoding; this conditional draft requires explicit derivative-extraction binding before staging.",
  "authors": [
    "C. Northcote Parkinson"
  ],
  "authors_in_source_order": [
    "C. Northcote Parkinson"
  ],
  "dates": {
    "inspected_source_date_1": "Copyright 1957; seventeenth printing, printing date unspecified",
    "retrieved_utc": "2026-10-08T06:55:27.034776+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Copyright 1957; seventeenth printing, printing date unspecified"
  ],
  "id": "concept-law-parkinson::S1",
  "title": null,
  "url": "https://sas2.elte.hu/tg/ptorv/Parkinson-s-Law.pdf"
}

C. Northcote Parkinson’s humorous administrative essay in a seventeenth-printing copy of the book bearing copyright 1957, separate from the original Economist essay. This is a historical satirical argument, not independent validation of a universal empirical or mathematical law. The original PDF extracted text has broken font encoding; this conditional draft requires explicit derivative-extraction binding before staging.

C. Northcote Parkinson’s humorous administrative essay in a seventeenth-printing copy of the book bearing copyright 1957, separate from the original Economist essay. This is a historical satirical argument, not independent validation of a universal empirical or mathematical law. The original PDF extracted text has broken font encoding; this conditional draft requires explicit derivative-extraction binding before staging.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian Rowan

Brian Rowan’s 1991 paper examines teachers’ professional communities through observations and interviews conducted over three years in six Michigan high schools.

It characterizes these communities through shared educational values, strong collegial and collaborative relationships, and a commitment to improving the work setting.

The paper uses those observations to develop a working definition and guidance for policymakers and practitioners seeking to sustain professional communities.

Sources and details

ED 338 599 AUTHOR SPONS AGENCY REPORT NO PUB ...

{
  "access_scope": "Primary April 1991 conference paper P91-136, ERIC ED338599; author Brian Rowan, Michigan State University. Selected claims bounded to inspected cover, abstract and first pages, six schools and three-year observation/interview design; no causal generalization from a controlled experiment.",
  "authors": [
    "Brian Rowan"
  ],
  "authors_in_source_order": [
    "Brian Rowan"
  ],
  "dates": {
    "conference_paper": "April 1991",
    "meeting": "AERA, Chicago, April 3–7, 1991",
    "retrieved_utc": "2026-10-08T07:02:45.203317+00:00"
  },
  "id": "person-coverage-948d09613c65e7::S1",
  "title": "ED 338 599 AUTHOR SPONS AGENCY REPORT NO PUB ...",
  "url": "https://files.eric.ed.gov/fulltext/ED338599.pdf"
}

Primary April 1991 conference paper P91-136, ERIC ED338599; author Brian Rowan, Michigan State University. Selected claims bounded to inspected cover, abstract and first pages, six schools and three-year observation/interview design; no causal generalization from a controlled experiment.

Primary April 1991 conference paper P91-136, ERIC ED338599; author Brian Rowan, Michigan State University. Selected claims bounded to inspected cover, abstract and first pages, six schools and three-year observation/interview design; no causal generalization from a controlled experiment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Perrow

Charles Perrow’s Berkeley memorial describes his organizational sociology as an examination of bureaucracies, capitalism and complex systems, identifying Normal Accidents as his best-known book.

In the autobiography reproduced on the page, he credits his graduate environment and mentors Reinhard Bendix and Philip Selznick with shaping his move into organizational analysis.

Perrow says involvement with the Three Mile Island story redirected his work for more than a decade, while his later project examined the origins of U.S. capitalism and its corrosive power.

Sources and details

Charles Perrow (1953) | UC Berkeley Sociology Department

{
  "access_scope": "Institutional memorial includes New Haven Register obituary November 26, 2019 and Perrow’s earlier original autobiography, whose relative phrases are not assigned to 2019. Page title and body bridge Charles Perrow/Charles Bryce Perrow; no name expansion beyond explicit same-source identity.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "Normal_Accidents": "1984",
    "autobiography_date": "not specified",
    "death": "November 12, 2019",
    "obituary_publication": "November 26, 2019",
    "retrieved_utc": "2026-10-08T07:02:49.655428+00:00"
  },
  "id": "person-coverage-ea1c4806f7d6e9::S1",
  "title": "Charles Perrow (1953) | UC Berkeley Sociology Department",
  "url": "https://sociology.berkeley.edu/charles-perrow-1953"
}

Institutional memorial includes New Haven Register obituary November 26, 2019 and Perrow’s earlier original autobiography, whose relative phrases are not assigned to 2019. Page title and body bridge Charles Perrow/Charles Bryce Perrow; no name expansion beyond explicit same-source identity.

Institutional memorial includes New Haven Register obituary November 26, 2019 and Perrow’s earlier original autobiography, whose relative phrases are not assigned to 2019. Page title and body bridge Charles Perrow/Charles Bryce Perrow; no name expansion beyond explicit same-source identity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Denis Dennehy

Denis Dennehy’s Swansea profile describes research on how technology creates economic and social value and affects teams, organizations and society.

It says that work is developed through engagement with multinational firms, smaller businesses, healthcare providers, government agencies and nonprofit organizations.

The profile connects this research to teaching on ethical and sustainable business AI, information systems for sustainable development, and digital transformation.

Sources and details

Professor Denis Dennehy - Swansea University

{
  "access_scope": "Institutional research/teaching profile; header says Professor Emeritus while About says Professor of Information Systems & Sustainability. Both labels retained as source distinctions, no unqualified current-position reconciliation. No allocations inferred from publication coauthorship.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:02:54.186555+00:00"
  },
  "id": "person-coverage-8447b69e5ff8b1::S1",
  "title": "Professor Denis Dennehy - Swansea University",
  "url": "https://www.swansea.ac.uk/staff/denis.dennehy/"
}

Institutional research/teaching profile; header says Professor Emeritus while About says Professor of Information Systems & Sustainability. Both labels retained as source distinctions, no unqualified current-position reconciliation. No allocations inferred from publication coauthorship.

Institutional research/teaching profile; header says Professor Emeritus while About says Professor of Information Systems & Sustainability. Both labels retained as source distinctions, no unqualified current-position reconciliation. No allocations inferred from publication coauthorship.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank B. Gilbreth

Scott Curtis’s account describes Frank B. Gilbreth’s films as tools for documenting, analyzing and correcting workers’ movements in the search for the best way to perform a job.

It contrasts this motion-study approach with Taylor’s stopwatch-based time study, which drew objections about measurement accuracy and the operator’s subjective skill.

The chapter credits Frank and Lillian Gilbreth together with promoting motion study to industry as a way to design and measure work, placing their visual methods within struggles over labor and managerial control.

Sources and details

Images of Efficiency | 9 | The Films of Frank B. Gilbreth | Scott Curt

{
  "access_scope": "Publisher-hosted abstract of Scott Curtis, Images of Efficiency: The Films of Frank B. Gilbreth, Films that Work, first edition 2009, 15 pages. Abstract scope, not full chapter. Joint motion-study promotion retains Lillian’s role; not solely Frank’s achievement.",
  "authors": [
    "Scott Curtis"
  ],
  "authors_in_source_order": [
    "Scott Curtis"
  ],
  "dates": {
    "chapter_first_published": "2009",
    "citation_publication_date": "2025/10/01",
    "historical_film_activity": "1912–1924",
    "retrieved_utc": "2026-10-08T07:02:54.629321+00:00"
  },
  "id": "person-frankbgilbreth::S1",
  "title": "Images of Efficiency | 9 | The Films of Frank B. Gilbreth | Scott Curt",
  "url": "https://www.taylorfrancis.com/chapters/oa-edit/10.5117/9789089640130-9/images-efficiency-scott-curtis"
}

Publisher-hosted abstract of Scott Curtis, Images of Efficiency: The Films of Frank B. Gilbreth, Films that Work, first edition 2009, 15 pages. Abstract scope, not full chapter. Joint motion-study promotion retains Lillian’s role; not solely Frank’s achievement.

Publisher-hosted abstract of Scott Curtis, Images of Efficiency: The Films of Frank B. Gilbreth, Films that Work, first edition 2009, 15 pages. Abstract scope, not full chapter. Joint motion-study promotion retains Lillian’s role; not solely Frank’s achievement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

G. M. Stalker

Routledge’s chapter places G. M. Stalker alongside Tom Burns in its account of mechanistic and organic systems theory, whose original publication it dates to Tavistock in 1961.

The abstract compares the approach with Likert’s organizational systems and with analyses of technology, bureaucratic politics, and programmed versus nonprogrammed decisions.

It also reports Burns’s statement that the theory was formulated without those sources, making the later conceptual parallels a comparison rather than proof of direct influence.

Sources and details

Mechanistic and Organic Systems: Tom Burns, G.M. Stalker | 23 | Organi

{
  "access_scope": "Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "chapter_first_published": "2006",
    "citation_publication_date": "2015/06/01",
    "original_theory_publication": "1961",
    "retrieved_utc": "2026-10-08T07:02:54.524264+00:00"
  },
  "id": "person-gmstalker::S1",
  "title": "Mechanistic and Organic Systems: Tom Burns, G.M. Stalker | 23 | Organi",
  "url": "https://www.taylorfrancis.com/chapters/edit/10.4324/9781315702001-23/mechanistic-organic-systems-tom-burns-stalker"
}

Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.

Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Burns

Routledge’s chapter places Tom Burns alongside G. M. Stalker in its account of mechanistic and organic systems theory, whose original publication it dates to Tavistock in 1961.

The abstract compares the approach with Likert’s organizational systems and with analyses of technology, bureaucratic politics, and programmed versus nonprogrammed decisions.

It also reports Burns’s statement that the theory was formulated without those sources, making the later conceptual parallels a comparison rather than proof of direct influence.

Sources and details

Mechanistic and Organic Systems: Tom Burns, G.M. Stalker | 23 | Organi

{
  "access_scope": "Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "chapter_first_published": "2006",
    "citation_publication_date": "2015/06/01",
    "original_theory_publication": "1961",
    "retrieved_utc": "2026-10-08T07:02:54.524264+00:00"
  },
  "id": "person-tomburns::S1",
  "title": "Mechanistic and Organic Systems: Tom Burns, G.M. Stalker | 23 | Organi",
  "url": "https://www.taylorfrancis.com/chapters/edit/10.4324/9781315702001-23/mechanistic-organic-systems-tom-burns-stalker"
}

Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.

Publisher chapter abstract, Organizational Behavior 2, first edition 2006, 12 pages; chapter author not explicitly shown in cached abstract. Selected person credit is joint theory association in title; Burns’s retrospective statement attributed only to Burns. No allocated research tasks or proven influence on Stalker inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Georges F. Doriot

Georges F. Doriot’s Harvard profile links his business teaching, wartime research leadership and venture investing through an emphasis on developing people and companies for the long term.

His Manufacturing course combined lectures with teamwork in companies and analytical reports, asking students to learn through direct experience of business operations.

The account describes Doriot’s founding of American Research and Development in 1946 and its early financing of Digital Equipment Corporation, whose founders sought smaller and less expensive business computers.

Sources and details

The talented Georges Doriot — Harvard Gazette

{
  "access_scope": "Christina Pazzanese’s Harvard Gazette historical exhibition account, February 24, 2015. Teaching, leadership and institutional financing roles only; no sole invention of financed technology. Course-start dates differ across the two admitted institutional accounts and are not resolved in draft.",
  "authors": [
    "Christina Pazzanese"
  ],
  "authors_in_source_order": [
    "Christina Pazzanese"
  ],
  "dates": {
    "ARD_founding": "1946",
    "DEC_financing_context": "1957",
    "page_publication": "2015-02-24",
    "retrieved_utc": "2026-10-08T07:02:46.562663+00:00"
  },
  "id": "person-coverage-312e771970e945::S1",
  "title": "The talented Georges Doriot — Harvard Gazette",
  "url": "https://news.harvard.edu/gazette/story/2015/02/the-talented-georges-doriot/"
}

Christina Pazzanese’s Harvard Gazette historical exhibition account, February 24, 2015. Teaching, leadership and institutional financing roles only; no sole invention of financed technology. Course-start dates differ across the two admitted institutional accounts and are not resolved in draft.

Christina Pazzanese’s Harvard Gazette historical exhibition account, February 24, 2015. Teaching, leadership and institutional financing roles only; no sole invention of financed technology. Course-start dates differ across the two admitted institutional accounts and are not resolved in draft.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hirotaka Takeuchi

Hirotaka Takeuchi’s Harvard profile identifies organizational knowledge creation, Japanese firms’ global competitiveness, and the relationship between strategy and innovation as his research interests.

He co-authored The Knowledge-Creating Company with Ikujiro Nonaka and later continued their inquiry into innovation in The Wise Company.

His co-authored work also examines Toyota with Emi Osono and Norihiko Shimizu, connecting his knowledge-creation research with the analysis of a specific manufacturer.

Sources and details

HIROTAKA TAKEUCHI | Reischauer Institute of Japanese Studies

{
  "access_scope": "Reischauer Institute institutional profile; selected researcher and joint author. Book coauthorship does not allocate individual chapters or research tasks; profile publication date is not explicit. Historical book years distinguished from undated page.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "The_Knowledge_Creating_Company": "1995",
    "The_Wise_Company": "2019",
    "retrieved_utc": "2026-10-08T07:02:48.472564+00:00"
  },
  "id": "person-hirotakatakeuchi::S1",
  "title": "HIROTAKA TAKEUCHI | Reischauer Institute of Japanese Studies",
  "url": "https://rijs.fas.harvard.edu/hirotaka-takeuchi"
}

Reischauer Institute institutional profile; selected researcher and joint author. Book coauthorship does not allocate individual chapters or research tasks; profile publication date is not explicit. Historical book years distinguished from undated page.

Reischauer Institute institutional profile; selected researcher and joint author. Book coauthorship does not allocate individual chapters or research tasks; profile publication date is not explicit. Historical book years distinguished from undated page.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ikujiro Nonaka

In his Hitachi Research Institute interview, Ikujiro Nonaka describes SECI as an organizational process that turns individuals’ tacit knowledge into collective knowledge and back into enriched personal practice.

He emphasizes embodied experience, empathy and face-to-face interaction as the starting point for this cycle, rather than treating knowledge creation as simply sharing explicit information.

Nonaka presents generative AI as useful support for connecting explicit knowledge and expanding inquiry, while arguing that it cannot currently replace the socialization grounded in direct human experience.

Sources and details

Interview with Prof. Ikujiro Nonaka : Hitachi Research Institute

{
  "access_scope": "Original interview, Nonaka’s explicitly labeled responses to Norihiro Suzuki, Hitachi Research Institute, Hitachi Souken Journal Vol.18-2. No exact interview date is explicit in inspected page; June 2023 is a different conversation referenced by interviewer. AI limitations are attributed philosophical claims, not experimentally proven universal properties.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:02:51.643015+00:00"
  },
  "id": "person-ikujirononaka::S1",
  "title": "Interview with Prof. Ikujiro Nonaka : Hitachi Research Institute",
  "url": "https://www.hitachi-hri.com/english/interview-column/reciprocal/i056.html"
}

Original interview, Nonaka’s explicitly labeled responses to Norihiro Suzuki, Hitachi Research Institute, Hitachi Souken Journal Vol.18-2. No exact interview date is explicit in inspected page; June 2023 is a different conversation referenced by interviewer. AI limitations are attributed philosophical claims, not experimentally proven universal properties.

Original interview, Nonaka’s explicitly labeled responses to Norihiro Suzuki, Hitachi Research Institute, Hitachi Souken Journal Vol.18-2. No exact interview date is explicit in inspected page; June 2023 is a different conversation referenced by interviewer. AI limitations are attributed philosophical claims, not experimentally proven universal properties.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jacqueline Goodnow

In her oral history, Jacqueline Goodnow connects children’s thinking with everyday activity, recalling a child whose experience buying rice helped him reason about conservation of weight.

She describes her continuing interest in the socialization of cognition as a way to break down the usual separation between social and cognitive development.

Goodnow also explains how concern for refugee children drew her toward social-policy questions and the difference between administrative categories and developmental perspectives.

Sources and details

[PDF] SRCD Oral History Interview - Jacqueline Goodnow

{
  "access_scope": "SRCD oral history interviewed by Agnes Dodds at Goodnow’s Sydney home December 5, 2008; preface added March 2010. Page 1 explicitly bridges Jacqueline J. Goodnow and Jacqueline Goodnow; selected first-person responses on printed page 6, recollection not controlled causal evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "interview": "December 5, 2008",
    "preface_note": "March 2010",
    "retrieved_utc": "2026-10-08T07:02:53.846530+00:00"
  },
  "id": "person-jacquelinegoodnow::S1",
  "title": "[PDF] SRCD Oral History Interview - Jacqueline Goodnow",
  "url": "https://www.srcd.org/sites/default/files/file-attachments/goodnow_jacqueline_interview.pdf"
}

SRCD oral history interviewed by Agnes Dodds at Goodnow’s Sydney home December 5, 2008; preface added March 2010. Page 1 explicitly bridges Jacqueline J. Goodnow and Jacqueline Goodnow; selected first-person responses on printed page 6, recollection not controlled causal evidence.

SRCD oral history interviewed by Agnes Dodds at Goodnow’s Sydney home December 5, 2008; preface added March 2010. Page 1 explicitly bridges Jacqueline J. Goodnow and Jacqueline Goodnow; selected first-person responses on printed page 6, recollection not controlled causal evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Juanzi Li

Juanzi Li’s Tsinghua homepage identifies her as a professor leading the Knowledge Engineering Group, with interests in knowledge engineering, the semantic web, and text and social-network mining.

The page lists her joint books Semantic Mining of Social Networks with Jie Tang and Mining User Generated Content with Marie-Francine Moens and Tat-Seng Chua.

Its publication list carries her co-author credit on benchmarks and methods for language-model knowledge and long-context understanding, including KoLA and LongBench.

Sources and details

Juanzi Li (Li, Juanzi) 's Homepage

{
  "access_scope": "Author-owned institutional homepage. Exact Juanzi Li HTML heading/title inspected in body.bin; extracted main text omits heading but preserves same full name in coauthor credits. Joint publication credit does not allocate experimental, coding or chapter tasks. No unqualified present-tense 2026 career update inferred from undated page.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "KoLA_listed_publication": "ICLR 2024",
    "LongBench_listed_publication": "ACL 2024",
    "Mining_User_Generated_Content": "2014",
    "Semantic_Mining_of_Social_Networks": "2015",
    "retrieved_utc": "2026-10-08T07:02:45.737027+00:00"
  },
  "id": "person-juanzili::S1",
  "title": "Juanzi Li (Li, Juanzi) 's Homepage",
  "url": "https://keg.cs.tsinghua.edu.cn/persons/ljz/"
}

Author-owned institutional homepage. Exact Juanzi Li HTML heading/title inspected in body.bin; extracted main text omits heading but preserves same full name in coauthor credits. Joint publication credit does not allocate experimental, coding or chapter tasks. No unqualified present-tense 2026 career update inferred from undated page.

Author-owned institutional homepage. Exact Juanzi Li HTML heading/title inspected in body.bin; extracted main text omits heading but preserves same full name in coauthor credits. Joint publication credit does not allocate experimental, coding or chapter tasks. No unqualified present-tense 2026 career update inferred from undated page.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Margaret Masterman

Rebecca Roach’s account of Margaret Masterman describes her language-processing research as pursuing a philosophical basis for machine translation, information retrieval and natural-language processing.

It contrasts her emphasis on semantics with syntax-centered approaches and records her view that linguistic ambiguity reflects the flexibility of language rather than a defect to eliminate.

The account also places Masterman at the founding of the Cambridge Language Research Unit in 1954, bringing collaborators from several disciplines into that research.

Sources and details

Biographical Case Study: Margaret Masterman | Ego Media

{
  "access_scope": "Rebecca Roach, Biographical Case Study: Margaret Masterman, within Ego Media edited by Max Saunders and Lisa Gee, Stanford University Press 2023. Page writer, volume editors and technical meta author King’s Digital Lab distinct; only bounded research findings, not unsupported priority claims or every historical aside.",
  "authors": [
    "Rebecca Roach"
  ],
  "authors_in_source_order": [
    "Rebecca Roach"
  ],
  "dates": {
    "citation_publication_date": "2023",
    "retrieved_utc": "2026-10-08T07:02:45.030672+00:00",
    "volume_publication": "2023"
  },
  "id": "person-margaretmasterman::S1",
  "title": "Biographical Case Study: Margaret Masterman\n        | Ego Media",
  "url": "https://egomedia.supdigital.org/sections/talking-interfaces/writing-talking-interfaces/literature-and-computing/masterman/index.html"
}

Rebecca Roach, Biographical Case Study: Margaret Masterman, within Ego Media edited by Max Saunders and Lisa Gee, Stanford University Press 2023. Page writer, volume editors and technical meta author King’s Digital Lab distinct; only bounded research findings, not unsupported priority claims or every historical aside.

Rebecca Roach, Biographical Case Study: Margaret Masterman, within Ego Media edited by Max Saunders and Lisa Gee, Stanford University Press 2023. Page writer, volume editors and technical meta author King’s Digital Lab distinct; only bounded research findings, not unsupported priority claims or every historical aside.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Neil P. King

Neil P. King is a co-author of a 2024 preprint that combines mRNA delivery with a computationally designed protein nanoparticle displaying 60 copies of a SARS-CoV-2 receptor-binding domain.

The joint study reports intact nanoparticle assemblies secreted from transfected cells and higher neutralizing-antibody responses than its membrane-anchored Spike mRNA comparator.

The joint preclinical study also reports protection of mice against vaccine-matched and mismatched viral challenges, combining mRNA delivery with computationally designed nanoparticles.

Sources and details

Computationally designed mRNA-launched protein nanoparticle vaccines | bioRxiv

{
  "access_scope": "bioRxiv v1 10.1101/2024.07.22.604655, visible/DC posting July 23, 2024; citation_publication_date metadata says 2024/01/01 and is retained as conflicting generic metadata, not silently reconciled. Joint preprint abstract only, no individual task allocation and no human clinical efficacy. Disclosed N.P.K. patent interests retained.",
  "authors": [
    "Grace G. Hendricks",
    "Lilit Grigoryan",
    "Mary Jane Navarro",
    "Nicholas J. Catanzaro",
    "Miranda L. Hubbard",
    "John M. Powers",
    "Melissa Mattocks",
    "Catherine Treichel",
    "Alexandra C. Walls",
    "Jimin Lee",
    "Daniel Ellis",
    "Jing Yang (John) Wang",
    "Suna Cheng",
    "Marcos C. Miranda",
    "Adian Valdez",
    "Cara W. Chao",
    "Sidney Chan",
    "Christine Men",
    "Max R. Johnson",
    "Harold Hui",
    "Sheng-Yang Wu",
    "Victor Lujan",
    "Hiromi Muramatsu",
    "Paulo J.C. Lin",
    "Molly M.H. Sung",
    "Ying K. Tam",
    "Elizabeth M. Leaf",
    "Norbert Pardi",
    "Ralph S. Baric",
    "Bali Pulendran",
    "David Veesler",
    "Alexandra Schäfer",
    "Neil P. King"
  ],
  "authors_in_source_order": [
    "Grace G. Hendricks",
    "Lilit Grigoryan",
    "Mary Jane Navarro",
    "Nicholas J. Catanzaro",
    "Miranda L. Hubbard",
    "John M. Powers",
    "Melissa Mattocks",
    "Catherine Treichel",
    "Alexandra C. Walls",
    "Jimin Lee",
    "Daniel Ellis",
    "Jing Yang (John) Wang",
    "Suna Cheng",
    "Marcos C. Miranda",
    "Adian Valdez",
    "Cara W. Chao",
    "Sidney Chan",
    "Christine Men",
    "Max R. Johnson",
    "Harold Hui",
    "Sheng-Yang Wu",
    "Victor Lujan",
    "Hiromi Muramatsu",
    "Paulo J.C. Lin",
    "Molly M.H. Sung",
    "Ying K. Tam",
    "Elizabeth M. Leaf",
    "Norbert Pardi",
    "Ralph S. Baric",
    "Bali Pulendran",
    "David Veesler",
    "Alexandra Schäfer",
    "Neil P. King"
  ],
  "dates": {
    "DC_and_visible_posting": "2024-07-23",
    "DOI_date_component": "2024.07.22",
    "citation_date": "2024-07-23",
    "citation_publication_date": "2024/01/01",
    "citation_publication_date_raw": "2024/01/01",
    "retrieved_utc": "2026-10-08T07:02:50.536094+00:00",
    "version": "v1"
  },
  "id": "person-coverage-beec348d9a497d::S1",
  "title": "Computationally designed mRNA-launched protein nanoparticle vaccines | bioRxiv",
  "url": "https://www.biorxiv.org/content/10.1101/2024.07.22.604655v1"
}

bioRxiv v1 10.1101/2024.07.22.604655, visible/DC posting July 23, 2024; citation_publication_date metadata says 2024/01/01 and is retained as conflicting generic metadata, not silently reconciled. Joint preprint abstract only, no individual task allocation and no human clinical efficacy. Disclosed N.P.K. patent interests retained.

bioRxiv v1 10.1101/2024.07.22.604655, visible/DC posting July 23, 2024; citation_publication_date metadata says 2024/01/01 and is retained as conflicting generic metadata, not silently reconciled. Joint preprint abstract only, no individual task allocation and no human clinical efficacy. Disclosed N.P.K. patent interests retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charlie Kaufman

Charlie Kaufman opens his 2011 BAFTA and BFI lecture by treating the risk of fumbling in public as an opportunity for art to reveal shared humanity and vulnerability.

He describes beginning his writing from an admission of not knowing, and trying to preserve that uncertainty rather than performing expertise.

Kaufman also identifies a tension between doing something truthful and helpful and wanting the audience to like him, connecting that conflict to the work of writing a screenplay.

Sources and details

Screenwriters On Screenwriting.

{
  "access_scope": "Charlie Kaufman’s spoken lecture transcript, September 30, 2011 at BFI Southbank, BAFTA/BFI Screenwriters’ Lecture Series. Inspected printed page 1; personal creative-process account, not a claim about all film production or an AI capability.",
  "authors": [
    "Charlie Kaufman"
  ],
  "authors_in_source_order": [
    "Charlie Kaufman"
  ],
  "dates": {
    "lecture": "30 September 2011",
    "retrieved_utc": "2026-10-08T06:09:22.156186+00:00"
  },
  "id": "person-coverage-c3f24a17ea9be4::S1",
  "title": "Screenwriters On Screenwriting.",
  "url": "https://static.bafta.org/uploads_pre_202411/transcripts/30_sept_2011_screenwriters_lecture_by_charlie_kaufman_0.pdf"
}

Charlie Kaufman’s spoken lecture transcript, September 30, 2011 at BFI Southbank, BAFTA/BFI Screenwriters’ Lecture Series. Inspected printed page 1; personal creative-process account, not a claim about all film production or an AI capability.

Charlie Kaufman’s spoken lecture transcript, September 30, 2011 at BFI Southbank, BAFTA/BFI Screenwriters’ Lecture Series. Inspected printed page 1; personal creative-process account, not a claim about all film production or an AI capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Claude Clerselier

Claude Clerselier, described by Becker Medical Library as Descartes’s literary executor, edited the first French edition of Treatise of Man published in 1664.

The account says he found the earlier Latin edition’s images insufficiently integrated with the text, retained Descartes’s brain engraving, and sought new illustrations.

His preference was for schematics rather than anatomical drawings; the account distinguishes Descartes’s contribution from six drawings by La Forge and the remaining work by Gutschoven.

Sources and details

Descartes’ ‘Treatise of Man’ – Becker Medical Library

{
  "access_scope": "Becker Medical Library historical edition account; 1662 Latin, 1664 French and displayed 1677 illustrations remain distinct. Clerselier editor/commissioner, not author of Descartes’s physiology or all illustrations. Page calls illustrator Daniel de La Forge while bibliography says Louis de la Forge; that identity discrepancy is not resolved or propagated into a Louis draft.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "French_edition": "1664",
    "Latin_edition": "1662",
    "displayed_later_illustrations": "1677",
    "retrieved_utc": "2026-10-08T05:51:15.040312+00:00",
    "webpage_published_metadata": "2018-08-21T21:30:35+00:00"
  },
  "id": "person-coverage-713ef258e3ba88::S1",
  "title": "Descartes’ ‘Treatise of Man’ – Becker Medical Library",
  "url": "https://becker.wustl.edu/news/descartes-treatise-of-man/"
}

Becker Medical Library historical edition account; 1662 Latin, 1664 French and displayed 1677 illustrations remain distinct. Clerselier editor/commissioner, not author of Descartes’s physiology or all illustrations. Page calls illustrator Daniel de La Forge while bibliography says Louis de la Forge; that identity discrepancy is not resolved or propagated into a Louis draft.

Becker Medical Library historical edition account; 1662 Latin, 1664 French and displayed 1677 illustrations remain distinct. Clerselier editor/commissioner, not author of Descartes’s physiology or all illustrations. Page calls illustrator Daniel de La Forge while bibliography says Louis de la Forge; that identity discrepancy is not resolved or propagated into a Louis draft.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Cornelis P. Baldé

Cornelis P. Baldé is the first-listed and corresponding author of The Global E-waste Monitor 2024, an ITU and UNITAR report on electronic waste, recycling and policy.

The joint report estimates that 62 billion kilograms of e-waste were generated worldwide in 2022, of which 22.3 percent was documented as formally collected and recycled in an environmentally sound manner.

Its executive summary says growth in e-waste generation since 2010 has outpaced growth in formal collection and recycling by almost a factor of five.

Sources and details

The Global E-waste Monitor 2024

{
  "access_scope": "Joint 2024 report, selected first-listed/corresponding author only; no individual task allocation. Printed cover and executive-summary page 10 visually inspected. Quantities refer to 2022 and growth comparison since 2010, not a 2026 current measurement.",
  "authors": [
    "Cornelis P. Baldé",
    "Ruediger Kuehr",
    "Tales Yamamoto",
    "Rosie McDonald",
    "Elena D’Angelo",
    "Shahana Althaf",
    "Garam Bel",
    "Otmar Deubzer",
    "Elena Fernandez-Cubillo",
    "Vanessa Forti",
    "Vanessa Gray",
    "Sunil Herat",
    "Shunichi Honda",
    "Giulia Iattoni",
    "Deepali S. Khetriwal",
    "Vittoria Luda di Cortemiglia",
    "Yuliya Lobuntsova",
    "Innocent Nnorom",
    "Noémie Pralat",
    "Michelle Wagner"
  ],
  "authors_in_source_order": [
    "Cornelis P. Baldé",
    "Ruediger Kuehr",
    "Tales Yamamoto",
    "Rosie McDonald",
    "Elena D’Angelo",
    "Shahana Althaf",
    "Garam Bel",
    "Otmar Deubzer",
    "Elena Fernandez-Cubillo",
    "Vanessa Forti",
    "Vanessa Gray",
    "Sunil Herat",
    "Shunichi Honda",
    "Giulia Iattoni",
    "Deepali S. Khetriwal",
    "Vittoria Luda di Cortemiglia",
    "Yuliya Lobuntsova",
    "Innocent Nnorom",
    "Noémie Pralat",
    "Michelle Wagner"
  ],
  "dates": {
    "growth_comparison_start": "2010",
    "measurement_year": "2022",
    "report_year": "2024",
    "retrieved_utc": "2026-10-08T06:17:13.063777+00:00"
  },
  "id": "person-coverage-c16204686ef3aa::S1",
  "title": "The Global E-waste Monitor 2024",
  "url": "https://ewastemonitor.info/wp-content/uploads/2024/03/GEM_2024_18-03_web_page_per_page_web.pdf"
}

Joint 2024 report, selected first-listed/corresponding author only; no individual task allocation. Printed cover and executive-summary page 10 visually inspected. Quantities refer to 2022 and growth comparison since 2010, not a 2026 current measurement.

Joint 2024 report, selected first-listed/corresponding author only; no individual task allocation. Printed cover and executive-summary page 10 visually inspected. Quantities refer to 2022 and growth comparison since 2010, not a 2026 current measurement.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Daniel Dennett

Daniel Dennett’s Consciousness Explained challenges a traditional commonsense picture of consciousness and proposes an alternative model.

The publisher describes that account as drawing on neuroscience, psychology and artificial intelligence rather than treating consciousness as a single isolated philosophical problem.

Its stated scope spans conscious life in people, animals and robots, placing human experience alongside questions about other possible minds.

Sources and details

Consciousness Explained by Daniel C. Dennett | Hachette Book Group

{
  "access_scope": "Publisher description, not full book. Page explicitly names Daniel Dennett in description and Daniel C. Dennett in byline/author block, an observed same-book identity bridge. Listed October 20, 1992 trade paperback manifestation distinct from original book publication; stale preorder/current professor boilerplate not propagated.",
  "authors": [
    "Daniel C. Dennett"
  ],
  "authors_in_source_order": [
    "Daniel C. Dennett"
  ],
  "dates": {
    "listed_trade_paperback_on_sale": "October 20, 1992",
    "page_published_metadata": "2017-06-27T20:29:17+00:00",
    "retrieved_utc": "2026-10-07T18:14:22.907482+00:00"
  },
  "id": "person-coverage-c9d6e00dd7f4e7::S1",
  "title": "Consciousness Explained by Daniel C. Dennett | Hachette Book Group",
  "url": "https://www.hachettebookgroup.com/titles/danile-c-dennett/consciousness-explained/9780316180665/?lens=back-bay-books"
}

Publisher description, not full book. Page explicitly names Daniel Dennett in description and Daniel C. Dennett in byline/author block, an observed same-book identity bridge. Listed October 20, 1992 trade paperback manifestation distinct from original book publication; stale preorder/current professor boilerplate not propagated.

Publisher description, not full book. Page explicitly names Daniel Dennett in description and Daniel C. Dennett in byline/author block, an observed same-book identity bridge. Listed October 20, 1992 trade paperback manifestation distinct from original book publication; stale preorder/current professor boilerplate not propagated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Marr

Edwin Hutchins’s account of Cognition in the Wild explicitly applies David Marr’s levels of analysis to navigation as a cognitive system.

It distinguishes a common computational description of navigational constraints from differences in the representations, algorithms and implementations used in Western and Micronesian traditions.

The account uses this framework to show how the details of navigation tools depend on historical processes, including the accumulation of structure in instruments and practices.

Sources and details

Cognition in the Wild

{
  "access_scope": "Hutchins’s author-hosted book description applies Marr’s framework; navigation fieldwork and conclusions belong to Hutchins, not Marr. Three analysis levels are explicit source attribution, not an inferred collaboration or Marr task. Description scope, not full Marr monograph.",
  "authors": [
    "Edwin Hutchins"
  ],
  "authors_in_source_order": [
    "Edwin Hutchins"
  ],
  "dates": {
    "book_publication": "1995",
    "retrieved_utc": "2026-10-07T18:18:29.926858+00:00"
  },
  "id": "person-davidmarr::S1",
  "title": "Cognition in the Wild",
  "url": "https://pages.ucsd.edu/~ehutchins/citw.html"
}

Hutchins’s author-hosted book description applies Marr’s framework; navigation fieldwork and conclusions belong to Hutchins, not Marr. Three analysis levels are explicit source attribution, not an inferred collaboration or Marr task. Description scope, not full Marr monograph.

Hutchins’s author-hosted book description applies Marr’s framework; navigation fieldwork and conclusions belong to Hutchins, not Marr. Three analysis levels are explicit source attribution, not an inferred collaboration or Marr task. Description scope, not full Marr monograph.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Rain

Douglas Rain is credited by the BFI as the voice of HAL 9000 in 2001: A Space Odyssey.

The account explains how HAL’s rendition of Daisy Bell becomes slower and less distinct as Dave Bowman deactivates its memory, giving the fictional computer a childlike regression.

It describes the scene as prompting pity for an artificial intelligence that had taken human life, linking the vocal performance to the film’s unsettling portrayal of a machine.

Sources and details

A history of 1960s British cinema in 10 songs | BFI

{
  "access_scope": "David Parkinson’s BFI film/music account. Rain voice-performance credit only; scene interpretation attributed to article, not performer authorship of screenplay or real AI experiment. Film 1968, article June 22, 2026; Harry Dacre song 1892 distinct.",
  "authors": [
    "David Parkinson"
  ],
  "authors_in_source_order": [
    "David Parkinson"
  ],
  "dates": {
    "article_date": "June 22, 2026",
    "film_release": "1968",
    "retrieved_utc": "2026-10-08T06:09:27.478157+00:00",
    "song_origin": "1892"
  },
  "id": "person-coverage-34228b2ff7bb62::S1",
  "title": "A history of 1960s British cinema in 10 songs | BFI",
  "url": "https://www.bfi.org.uk/lists/history-1960s-british-cinema-10-songs"
}

David Parkinson’s BFI film/music account. Rain voice-performance credit only; scene interpretation attributed to article, not performer authorship of screenplay or real AI experiment. Film 1968, article June 22, 2026; Harry Dacre song 1892 distinct.

David Parkinson’s BFI film/music account. Rain voice-performance credit only; scene interpretation attributed to article, not performer authorship of screenplay or real AI experiment. Film 1968, article June 22, 2026; Harry Dacre song 1892 distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Florentius Schuyl

Florentius Schuyl translated Descartes’s Treatise of Man into Latin for its first Latin edition in 1662, according to Becker Medical Library’s edition history.

The account also credits him with copper-engraved illustrations, including heart anatomy and a flap image whose movable layers simulate a dissection.

His images connect Descartes’s physiological explanations with diagrams of the brain, nervous system and senses, while remaining distinct from the replacement illustrations commissioned for the later French edition.

Sources and details

Descartes’ ‘Treatise of Man’ – Becker Medical Library

{
  "access_scope": "Institutional historical edition account; Schuyl translator/illustrator, Descartes original author. 1662 Latin edition distinct from 1664 French and displayed 1677 images. Flap illustration simulates reading a dissection; not clinical or computational validation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "French_edition": "1664",
    "Latin_edition": "1662",
    "retrieved_utc": "2026-10-08T05:51:15.040312+00:00",
    "webpage_published_metadata": "2018-08-21T21:30:35+00:00"
  },
  "id": "person-coverage-571f1fd3b90722::S1",
  "title": "Descartes’ ‘Treatise of Man’ – Becker Medical Library",
  "url": "https://becker.wustl.edu/news/descartes-treatise-of-man/"
}

Institutional historical edition account; Schuyl translator/illustrator, Descartes original author. 1662 Latin edition distinct from 1664 French and displayed 1677 images. Flap illustration simulates reading a dissection; not clinical or computational validation.

Institutional historical edition account; Schuyl translator/illustrator, Descartes original author. 1662 Latin edition distinct from 1664 French and displayed 1677 images. Flap illustration simulates reading a dissection; not clinical or computational validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joseph M. Juran

Joseph M. Juran’s retrospective The Non-Pareto Principle; Mea Culpa describes the pattern in which a relatively small number of contributors account for much of a shared effect.

He traces his use of that pattern from unequal frequencies of quality defects to other management problems, while acknowledging that he had attached Pareto’s name to a broader principle than Pareto’s economic work established.

Juran also corrects the graphical attribution: the cumulative curves he used in his Quality Control Handbook should have been identified with Lorenz.

Sources and details

The Non-Pareto Principle; Mea Culpa

{
  "access_scope": "Juran Institute archival reformat of Juran’s 1974 first-person retrospective, visually inspected printed pages 1 and 3. Sidebar/editorial claims of universal priority not propagated. Pareto wealth research, Juran managerial generalization and Lorenz curves remain distinct.",
  "authors": [
    "Joseph M. Juran"
  ],
  "authors_in_source_order": [
    "Joseph M. Juran"
  ],
  "dates": {
    "archival_URL_directory": "2021/03",
    "original_retrospective": "1974",
    "retrieved_utc": "2026-10-07T17:54:54.433210+00:00"
  },
  "id": "person-josephmjuran::S1",
  "title": "The Non-Pareto Principle; Mea Culpa",
  "url": "https://www.juran.com/wp-content/uploads/2021/03/The-Non-Pareto-Principle-1974.pdf"
}

Juran Institute archival reformat of Juran’s 1974 first-person retrospective, visually inspected printed pages 1 and 3. Sidebar/editorial claims of universal priority not propagated. Pareto wealth research, Juran managerial generalization and Lorenz curves remain distinct.

Juran Institute archival reformat of Juran’s 1974 first-person retrospective, visually inspected printed pages 1 and 3. Sidebar/editorial claims of universal priority not propagated. Pareto wealth research, Juran managerial generalization and Lorenz curves remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Joss Whedon

The Writers Guild’s account credits Joss Whedon with adapting his Buffy the Vampire Slayer screenplay into the television series.

It describes Buffy’s combination of comedy, emotional honesty and supernatural horror as a way of making high-school pressures part of the story’s dramatic logic.

The Guild also lists Whedon among the series’ many credited writers and recalls his earlier hiring on Roseanne.

Sources and details

101 Best Written TV Series List

{
  "access_scope": "Writers Guild institutional series list: selected creator/adaptor and credited writer, not sole author of all episodes. Genre assessment belongs to list prose and quoted Bryan Fuller, not an experimentally established audience effect. Exact source list date not asserted; prior Star Trek dates discarded for this subject.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T18:12:30.626164+00:00"
  },
  "id": "person-coverage-59a8ef1e78d123::S1",
  "title": "101 Best Written TV Series List",
  "url": "https://www.wga.org/writers-room/101-best-lists/101-best-written-tv-series/list"
}

Writers Guild institutional series list: selected creator/adaptor and credited writer, not sole author of all episodes. Genre assessment belongs to list prose and quoted Bryan Fuller, not an experimentally established audience effect. Exact source list date not asserted; prior Star Trek dates discarded for this subject.

Writers Guild institutional series list: selected creator/adaptor and credited writer, not sole author of all episodes. Genre assessment belongs to list prose and quoted Bryan Fuller, not an experimentally established audience effect. Exact source list date not asserted; prior Star Trek dates discarded for this subject.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard Bellman

Sutton and Barto’s historical account credits Richard Bellman and others with developing an optimal-control approach based on system states, value functions and the functional equation now bearing Bellman’s name.

It connects Bellman’s work to dynamic programming and the discrete stochastic control formulation known as Markov decision processes, distinguishing Ronald Howard’s later policy-iteration contribution.

The account also explains Bellman’s curse of dimensionality as the exponential growth of computational requirements with the number of state variables.

Sources and details

Reinforcement Learning: An Introduction — Second edition, in progress

{
  "access_scope": "Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, second edition in progress, copyright 2014/2015 draft, printed pages 16–17 visually inspected. Bellman credited historical subject, not author of this book; jointly developed approach and Howard contribution remain distinct. Not the final 2018 edition.",
  "authors": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "authors_in_source_order": [
    "Richard S. Sutton",
    "Andrew G. Barto"
  ],
  "dates": {
    "Bellman_work_citations": "1957a; 1957b",
    "Howard_policy_iteration": "1960",
    "inspected_draft_copyright": "2014, 2015",
    "retrieved_utc": "2026-10-07T17:54:44.638151+00:00"
  },
  "id": "person-coverage-fbaa59d8e6971e::S1",
  "title": "Reinforcement Learning: An Introduction — Second edition, in progress",
  "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf"
}

Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, second edition in progress, copyright 2014/2015 draft, printed pages 16–17 visually inspected. Bellman credited historical subject, not author of this book; jointly developed approach and Howard contribution remain distinct. Not the final 2018 edition.

Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, second edition in progress, copyright 2014/2015 draft, printed pages 16–17 visually inspected. Bellman credited historical subject, not author of this book; jointly developed approach and Howard contribution remain distinct. Not the final 2018 edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lawrence Saul

On his Flatiron research page, Lawrence Saul investigates whether nonlinear representations can connect matrix sparsity with low rank beyond ordinary linear-algebra decompositions.

He describes joint work that represents a sparse nonnegative matrix through a real-valued matrix of substantially lower rank.

A related geometric interpretation connects those decompositions with manifold learning, while the current research description also identifies an application to connectomics.

Sources and details

High dimensional data analysis

{
  "access_scope": "Selected Lawrence Saul; author of first-person collaborative research description. Undated programme description; linked papers are not individually audited and no collaborator task allocation is inferred.",
  "authors": [
    "Lawrence Saul"
  ],
  "authors_in_source_order": [
    "Lawrence Saul"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:49.969044+00:00"
  },
  "id": "person-coverage-4b8104cef7ed5c::S1",
  "title": "High dimensional data analysis",
  "url": "https://users.flatironinstitute.org/~lsaul/"
}

Selected Lawrence Saul; author of first-person collaborative research description. Undated programme description; linked papers are not individually audited and no collaborator task allocation is inferred.

Selected Lawrence Saul; author of first-person collaborative research description. Undated programme description; linked papers are not individually audited and no collaborator task allocation is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Leonid Hurwicz

In his 2007 prize lecture, Leonid Hurwicz treats institutions as rules that economic models can vary, bringing enforcement and implementation into the analysis rather than assuming them away.

He explains informational decentralization as a setting where units initially know their own preferences, technologies or resources and exchange messages to pursue system-wide goals.

The lecture distinguishes enforcement failures from informational limits: in some modelled economies, even truthful participants cannot guarantee efficient outcomes through finite-dimensional message spaces.

Sources and details

But Who Will Guard the Guardians?

{
  "access_scope": "Selected Leonid Hurwicz; sole lecture author. Selected original pages 280–282; statements concern the lecture’s analytical framework, not a universal empirical impossibility.",
  "authors": [
    "Leonid Hurwicz"
  ],
  "authors_in_source_order": [
    "Leonid Hurwicz"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2007-12-08",
    "retrieved_utc": "2026-10-08T07:02:52.161252+00:00"
  },
  "id": "person-coverage-21fb2359c47de7::S1",
  "title": "But Who Will Guard the Guardians?",
  "url": "https://www.nobelprize.org/uploads/2018/06/hurwicz_lecture.pdf"
}

Selected Leonid Hurwicz; sole lecture author. Selected original pages 280–282; statements concern the lecture’s analytical framework, not a universal empirical impossibility.

Selected Leonid Hurwicz; sole lecture author. Selected original pages 280–282; statements concern the lecture’s analytical framework, not a universal empirical impossibility.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lin Qiao

In the Training Data interview, Lin Qiao describes consolidating Meta’s separate mobile, production and research frameworks into a PyTorch stack whose rebuild took five years.

She presents Fireworks’ focus on smaller, customized models as a way to match enterprise workloads while reducing inference latency and cost.

Qiao describes the company’s CUDA kernels, distributed inference and semantic caching, and distinguishes quantizing weights, caches and communication by their different performance and quality tradeoffs.

Sources and details

Fireworks Founder Lin Qiao on How Fast Inference and Small Models Will Benefit Businesses

{
  "access_scope": "Selected Lin Qiao; explicitly labelled interview speaker. Hosts Pat Grady and Sonya Huang; collective engineering and company performance are Qiao’s self-reports, not independently benchmarked or assigned solely to her.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:49.124131+00:00"
  },
  "id": "person-linqiao::S1",
  "title": "Fireworks Founder Lin Qiao on How Fast Inference and Small Models Will Benefit Businesses",
  "url": "https://sequoiacap.com/podcast/training-data-lin-qiao"
}

Selected Lin Qiao; explicitly labelled interview speaker. Hosts Pat Grady and Sonya Huang; collective engineering and company performance are Qiao’s self-reports, not independently benchmarked or assigned solely to her.

Selected Lin Qiao; explicitly labelled interview speaker. Hosts Pat Grady and Sonya Huang; collective engineering and company performance are Qiao’s self-reports, not independently benchmarked or assigned solely to her.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Marcian Hoff

The Lemelson–MIT account of Marcian Hoff contrasts chips hardwired for one purpose with a coordinated chip set that performs a device’s functions.

It explains the versatility of making a chip act as a central processor capable of running ordinary computer programs.

The account describes the proposed processor as thumbnail-sized with 2,300 transistors, illustrating how programmable control could fit into much smaller devices.

Sources and details

Marcian Hoff: The Microprocessor

{
  "access_scope": "Selected Marcian Hoff; named inventor subject of institutional account. The page explicitly bridges Marcian Hoff and Ted Hoff; selected architecture account does not assert sole invention or erase other designers.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:45.984626+00:00"
  },
  "id": "person-marcianhoff::S1",
  "title": "Marcian Hoff: The Microprocessor",
  "url": "https://lemelson.mit.edu/resources/marcian-hoff"
}

Selected Marcian Hoff; named inventor subject of institutional account. The page explicitly bridges Marcian Hoff and Ted Hoff; selected architecture account does not assert sole invention or erase other designers.

Selected Marcian Hoff; named inventor subject of institutional account. The page explicitly bridges Marcian Hoff and Ted Hoff; selected architecture account does not assert sole invention or erase other designers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Maurice E. Stucke

Maurice E. Stucke and Ariel Ezrachi examine how algorithmic tacit collusion could increase prices and harm consumers without an explicit agreement.

Their 2020 article identifies conscious parallelism as a pathway that can leave collusion undetected and unchallenged.

The authors respond to arguments that such collusion is implausible by contrasting emerging evidence with the gap between antitrust law and the economic theory used to dismiss the risk.

Sources and details

Sustainable and Unchallenged Algorithmic Tacit Collusion

{
  "access_scope": "Selected Maurice E. Stucke; second coauthor. Ordered coauthors Ariel Ezrachi, Maurice E. Stucke; abstract argument only, not sole research contribution.",
  "authors": [
    "Ariel Ezrachi",
    "Maurice E. Stucke"
  ],
  "authors_in_source_order": [
    "Ariel Ezrachi",
    "Maurice E. Stucke"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2020",
    "retrieved_utc": "2026-10-08T07:02:48.902498+00:00"
  },
  "id": "person-coverage-ef83b8e9b686d7::S1",
  "title": "Sustainable and Unchallenged Algorithmic Tacit Collusion",
  "url": "https://scholarlycommons.law.northwestern.edu/njtip/vol17/iss2/2/"
}

Selected Maurice E. Stucke; second coauthor. Ordered coauthors Ariel Ezrachi, Maurice E. Stucke; abstract argument only, not sole research contribution.

Selected Maurice E. Stucke; second coauthor. Ordered coauthors Ariel Ezrachi, Maurice E. Stucke; abstract argument only, not sole research contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael L. Katz

Michael L. Katz and Carl Shapiro analyze systems markets in which consumers gain benefits by using compatible components together.

Their 1994 article explains that a popular system can become more valuable through network effects, influencing corporate strategy and innovation.

It connects those effects to consumer adoption over time, competition between incompatible systems and suppliers’ choices about which components can work together.

Sources and details

Systems Competition and Network Effects

{
  "access_scope": "Selected Michael L. Katz; first coauthor. Ordered coauthors Michael L. Katz, Carl Shapiro; inspected JEP 8(2), pp. 93–115 abstract, distinct from other network-externalities papers.",
  "authors": [
    "Michael L. Katz",
    "Carl Shapiro"
  ],
  "authors_in_source_order": [
    "Michael L. Katz",
    "Carl Shapiro"
  ],
  "dates": {
    "citation_publication_date": "1994/06",
    "inspection_date": "2026-10-08",
    "original_publication": "Spring 1994",
    "retrieved_utc": "2026-10-08T07:02:50.159903+00:00"
  },
  "id": "person-local-michaellkatz::S1",
  "title": "Systems Competition and Network Effects",
  "url": "https://www.aeaweb.org/articles?id=10.1257%2Fjep.8.2.93"
}

Selected Michael L. Katz; first coauthor. Ordered coauthors Michael L. Katz, Carl Shapiro; inspected JEP 8(2), pp. 93–115 abstract, distinct from other network-externalities papers.

Selected Michael L. Katz; first coauthor. Ordered coauthors Michael L. Katz, Carl Shapiro; inspected JEP 8(2), pp. 93–115 abstract, distinct from other network-externalities papers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mohammad Khalaf Mohammad Khreasat

Mohammad Khalaf Mohammad Khreasat is a coauthor of a 2026 preprint that adds sparse mixture-of-experts routing to YOLO26’s high-resolution branch to detect small and varied insulator faults in UAV images.

The joint approach uses adaptive feature refinement while retaining a one-stage detector, with a tool-augmented language-model agent coordinating hyperparameter optimization, training and evaluation.

The authors report mAP values of 0.9900 at a 0.5 overlap threshold and 0.9515 across thresholds from 0.5 to 0.95, as results of their proposed inspection model.

Sources and details

A novel YOLO26-MoE optimized by an LLM agent for insulator fault detection considering UAV images

{
  "access_scope": "Selected Mohammad Khalaf Mohammad Khreasat; fourth coauthor of arXiv:2605.19595v1. Ordered coauthors retained; preprint abstract and author-reported results only, no individual task allocation.",
  "authors": [
    "João Pedro Matos-Carvalho",
    "Laio Oriel Seman",
    "Stefano Frizzo Stefenon",
    "Mohammad Khalaf Mohammad Khreasat",
    "Gabriel Villarrubia González"
  ],
  "authors_in_source_order": [
    "João Pedro Matos-Carvalho",
    "Laio Oriel Seman",
    "Stefano Frizzo Stefenon",
    "Mohammad Khalaf Mohammad Khreasat",
    "Gabriel Villarrubia González"
  ],
  "dates": {
    "citation_date": "2026/05/19",
    "inspected_revision": "Tue, 19 May 2026 09:40:05 UTC (4,473 KB)",
    "inspection_date": "2026-10-08",
    "original_publication": "2026-05-19",
    "retrieved_utc": "2026-10-08T07:02:44.237631+00:00",
    "version": "arXiv v1"
  },
  "id": "person-coverage-b5d15598049b27::S1",
  "title": "A novel YOLO26-MoE optimized by an LLM agent for insulator fault detection considering UAV images",
  "url": "https://arxiv.org/abs/2605.19595",
  "version_url": "https://arxiv.org/abs/2605.19595v1"
}

Selected Mohammad Khalaf Mohammad Khreasat; fourth coauthor of arXiv:2605.19595v1. Ordered coauthors retained; preprint abstract and author-reported results only, no individual task allocation.

Selected Mohammad Khalaf Mohammad Khreasat; fourth coauthor of arXiv:2605.19595v1. Ordered coauthors retained; preprint abstract and author-reported results only, no individual task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul A. David

Stanford’s research account of Paul A. David describes his use of economic history to explain technology adoption through earlier choices and coordination between users and producers.

It summarizes his QWERTY argument that manufacturers and typists had incentives to converge on one keyboard configuration, without that convergence establishing the layout’s optimality.

His comparison of computers with electrical generators links delayed productivity gains to the substantial restructuring businesses need before they can exploit a new technology.

Sources and details

Paul A. David, who made Stanford a leading center for economic history, dies at 87

{
  "access_scope": "Selected Paul A. David; named research subject of Stanford institutional account. Source is Sanford’s account of David’s research, not an original David paper or an obituary-only biography.",
  "authors": [
    "John Sanford"
  ],
  "authors_in_source_order": [
    "John Sanford"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2023-03-01",
    "retrieved_utc": "2026-10-08T07:02:45.285643+00:00"
  },
  "id": "person-pauladavid::S1",
  "title": "Paul A. David, who made Stanford a leading center for economic history, dies at 87",
  "url": "https://humsci.stanford.edu/feature/paul-david-who-made-stanford-leading-center-economic-history-dies-87"
}

Selected Paul A. David; named research subject of Stanford institutional account. Source is Sanford’s account of David’s research, not an original David paper or an obituary-only biography.

Selected Paul A. David; named research subject of Stanford institutional account. Source is Sanford’s account of David’s research, not an original David paper or an obituary-only biography.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Qiyang Zhang

Qiyang Zhang’s research programme asks how social-media use affects students’ social-emotional learning, including the support they receive from others.

A separate strand examines the implications of generative chatbots for wellbeing and mental-health outcomes, framed as research questions rather than demonstrated benefits.

Zhang also develops methods for systematic reviews and meta-analyses and identifies Paperfetcher as a tool she co-developed to change literature-search practices.

Sources and details

Qiyang Zhang research description

{
  "access_scope": "Selected Qiyang Zhang; self-described quantitative educational researcher. Undated first-person research agenda; no causal outcomes, therapy efficacy or sole software authorship inferred.",
  "authors": [
    "Qiyang Zhang"
  ],
  "authors_in_source_order": [
    "Qiyang Zhang"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:48.312748+00:00"
  },
  "id": "person-coverage-b383317e6e6cf7::S1",
  "title": "Qiyang Zhang research description",
  "url": "https://qiyangzhang.com/"
}

Selected Qiyang Zhang; self-described quantitative educational researcher. Undated first-person research agenda; no causal outcomes, therapy efficacy or sole software authorship inferred.

Selected Qiyang Zhang; self-described quantitative educational researcher. Undated first-person research agenda; no causal outcomes, therapy efficacy or sole software authorship inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Renwen Zhang

Renwen Zhang’s project descriptions investigate meaningful emotional exchanges with AI companions and how both their capabilities and limitations shape those connections.

Her collaborative social-support project distinguishes four patterns of human–AI message writing and reports that the patterns produce different communication outcomes.

A separate project analyzes 35,390 human–AI conversation excerpts to classify harmful behavior and distinguish AI acting as perpetrator, instigator, facilitator or enabler.

Sources and details

Renwen Zhang: Selected Projects

{
  "access_scope": "Selected Renwen Zhang; author of collaborative project descriptions. Undated selected-project account; group findings retain joint scope and neither causality nor individual task allocation is invented.",
  "authors": [
    "Renwen Zhang"
  ],
  "authors_in_source_order": [
    "Renwen Zhang"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:52.964117+00:00"
  },
  "id": "person-coverage-c6cce2e40cb513::S1",
  "title": "Renwen Zhang: Selected Projects",
  "url": "https://www.renwenzhang.com/"
}

Selected Renwen Zhang; author of collaborative project descriptions. Undated selected-project account; group findings retain joint scope and neither causality nor individual task allocation is invented.

Selected Renwen Zhang; author of collaborative project descriptions. Undated selected-project account; group findings retain joint scope and neither causality nor individual task allocation is invented.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Richard A. Olshen

John A. Rice’s 2015 interview abstract describes Richard A. Olshen’s work on binary-tree methods for classification, regression, survival analysis and clustering.

It connects classification and survival-analysis methods with computer-aided diagnosis and prognosis, particularly in cardiology, oncology and toxicology.

The account identifies Olshen’s joint CART book as a treatment of motivation, algorithms, examples and mathematical theory, while distinguishing clustering applications in digital radiography and HIV genetics.

Sources and details

A Conversation with Richard A. Olshen

{
  "access_scope": "Selected Richard A. Olshen; named interview subject and research subject. Rice authored the interview. CART coauthors named in the abstract: Leo Brieman [source spelling], Jerome Friedman, Charles Stone, alongside Olshen; source typo not silently treated as corrected full author identity. Abstract-only scope, no interview-body audit.",
  "authors": [
    "John A. Rice"
  ],
  "authors_in_source_order": [
    "John A. Rice"
  ],
  "dates": {
    "citation_publication_date": "2015/02",
    "inspection_date": "2026-10-08",
    "original_publication": "February 2015",
    "retrieved_utc": "2026-10-08T07:02:47.779814+00:00"
  },
  "id": "person-coverage-53cbebf3afe19a::S1",
  "title": "A Conversation with Richard A. Olshen",
  "url": "https://projecteuclid.org/journals/statistical-science/volume-30/issue-1/A-Conversation-with-Richard-A-Olshen/10.1214/14-STS492.full"
}

Selected Richard A. Olshen; named interview subject and research subject. Rice authored the interview. CART coauthors named in the abstract: Leo Brieman [source spelling], Jerome Friedman, Charles Stone, alongside Olshen; source typo not silently treated as corrected full author identity. Abstract-only scope, no interview-body audit.

Selected Richard A. Olshen; named interview subject and research subject. Rice authored the interview. CART coauthors named in the abstract: Leo Brieman [source spelling], Jerome Friedman, Charles Stone, alongside Olshen; source typo not silently treated as corrected full author identity. Abstract-only scope, no interview-body audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert J. Aumann

In Agreeing to Disagree, Robert J. Aumann defines common knowledge recursively: each person knows an event, knows the other knows it, and knows the other knows that knowledge, continuing through further levels.

His theorem assumes two people start from the same prior probabilities and that their posterior probabilities for an event are common knowledge.

Under those conditions their posteriors must be equal, so the result does not claim that people with different priors or private posterior information always agree.

Sources and details

Agreeing to Disagree

{
  "access_scope": "Selected Robert J. Aumann; sole article author. Inspected publisher abstract; original 1976 publication distinguished from Project Euclid first availability April 12, 2007. Third sentence states limits directly entailed by theorem conditions.",
  "authors": [
    "Robert J. Aumann"
  ],
  "authors_in_source_order": [
    "Robert J. Aumann"
  ],
  "dates": {
    "citation_publication_date": "1976/11",
    "inspection_date": "2026-10-08",
    "original_publication": "November 1976",
    "retrieved_utc": "2026-10-08T07:02:47.733243+00:00"
  },
  "id": "person-robertjaumann::S1",
  "title": "Agreeing to Disagree",
  "url": "https://projecteuclid.org/journals/annals-of-statistics/volume-4/issue-6/Agreeing-to-Disagree/10.1214/aos/1176343654.full"
}

Selected Robert J. Aumann; sole article author. Inspected publisher abstract; original 1976 publication distinguished from Project Euclid first availability April 12, 2007. Third sentence states limits directly entailed by theorem conditions.

Selected Robert J. Aumann; sole article author. Inspected publisher abstract; original 1976 publication distinguished from Project Euclid first availability April 12, 2007. Third sentence states limits directly entailed by theorem conditions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert J. Sawyer

Robert J. Sawyer’s The Downloaded places two groups of uploaded minds in a quantum computer in Waterloo in 2059.

Its astronauts are preparing for an interstellar journey, while convicted murderers serve sentences inside a virtual-reality prison.

When disaster forces both groups back into physical existence, the story makes their cooperation central to saving Earth from destruction.

Sources and details

The Downloaded: author synopsis

{
  "access_scope": "Selected Robert J. Sawyer; explicitly credited novel author. Undated current author-site synopsis of fictional novel; do not mix sequel plot, reviewer quotations or real technical achievements into this entry.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:53.736063+00:00"
  },
  "id": "person-coverage-352ff6a646fd1b::S1",
  "title": "The Downloaded: author synopsis",
  "url": "https://www.sfwriter.com/"
}

Selected Robert J. Sawyer; explicitly credited novel author. Undated current author-site synopsis of fictional novel; do not mix sequel plot, reviewer quotations or real technical achievements into this entry.

Selected Robert J. Sawyer; explicitly credited novel author. Undated current author-site synopsis of fictional novel; do not mix sequel plot, reviewer quotations or real technical achievements into this entry.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rudolf E. Kálmán

Stanford Libraries’ account of Rudolf E. Kálmán describes his design of sampled-data control systems using quadratic performance criteria.

It traces his later unification of linear-system theory and design across discrete-time and continuous-time settings, alongside the Kalman filter’s estimation of uncertain dynamic states.

The archive account connects his Stanford research with realization and algebraic system theory and points to surviving lectures, reports and research notes documenting that work.

Sources and details

Rudolf E. Kálmán papers now available for research

{
  "access_scope": "Selected Rudolf E. Kálmán; named research subject and archive creator. Collection SC1680 spans 1954–2016; archive announcement updated November 6, 2025. Source calls Kálmán co-inventor; no sole filter attribution.",
  "authors": [
    "Hanna Ahn"
  ],
  "authors_in_source_order": [
    "Hanna Ahn"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2025-11-05",
    "retrieved_utc": "2026-10-08T07:02:45.997678+00:00"
  },
  "id": "person-coverage-36272cc8152877::S1",
  "title": "Rudolf E. Kálmán papers now available for research",
  "url": "https://library.stanford.edu/news/rudolf-e-kalman-papers-now-available-research-0"
}

Selected Rudolf E. Kálmán; named research subject and archive creator. Collection SC1680 spans 1954–2016; archive announcement updated November 6, 2025. Source calls Kálmán co-inventor; no sole filter attribution.

Selected Rudolf E. Kálmán; named research subject and archive creator. Collection SC1680 spans 1954–2016; archive announcement updated November 6, 2025. Source calls Kálmán co-inventor; no sole filter attribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sanford J. Grossman

Sanford J. Grossman and Joseph E. Stiglitz model why perfectly informative prices would remove the compensation traders need to justify acquiring costly information.

Their equilibrium therefore lets prices reveal informed traders’ knowledge only partially, with the choice to buy information determined within the model.

Unobserved supply fluctuations prevent other traders from reading the underlying signal exactly from prices, and the paper verifies its stated conjectures in a specific normal-distribution model with constant absolute risk aversion rather than proving them generally.

Sources and details

On the Impossibility of Informationally Efficient Markets

{
  "access_scope": "Selected Sanford J. Grossman; first coauthor. Ordered coauthors Sanford J. Grossman, Joseph E. Stiglitz; original AER pp. 393–395 visually inspected. Model and proof conditions preserved, no investment advice or individual allocation.",
  "authors": [
    "Sanford J. Grossman",
    "Joseph E. Stiglitz"
  ],
  "authors_in_source_order": [
    "Sanford J. Grossman",
    "Joseph E. Stiglitz"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "June 1980",
    "retrieved_utc": "2026-10-08T07:02:50.119269+00:00"
  },
  "id": "person-sanfordjgrossman::S1",
  "title": "On the Impossibility of Informationally Efficient Markets",
  "url": "https://www.aeaweb.org/aer/top20/70.3.393-408.pdf"
}

Selected Sanford J. Grossman; first coauthor. Ordered coauthors Sanford J. Grossman, Joseph E. Stiglitz; original AER pp. 393–395 visually inspected. Model and proof conditions preserved, no investment advice or individual allocation.

Selected Sanford J. Grossman; first coauthor. Ordered coauthors Sanford J. Grossman, Joseph E. Stiglitz; original AER pp. 393–395 visually inspected. Model and proof conditions preserved, no investment advice or individual allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Terrence Sejnowski

Salk’s profile describes Terrence Sejnowski combining electrical recordings and brain-slice analysis with computational models of how groups of cells process and store information.

It reports an astrocyte-blocking experiment in which mice stopped showing greater attention to newly introduced objects, linking those cells with novelty recognition.

His laboratory’s sleep model explores how some memories are strengthened while others are lost, treating consolidation as a selective process rather than uniform storage.

Sources and details

Terrence Sejnowski: computational neurobiology research profile

{
  "access_scope": "Selected Terrence Sejnowski; named laboratory head and research subject. Undated institutional research account; laboratory findings are group findings and mouse results are not generalized to humans or treatment efficacy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": null,
    "retrieved_utc": "2026-10-08T07:02:53.111675+00:00"
  },
  "id": "person-coverage-5446aa3db1e622::S1",
  "title": "Terrence Sejnowski: computational neurobiology research profile",
  "url": "https://www.salk.edu/scientist/terrence-sejnowski/"
}

Selected Terrence Sejnowski; named laboratory head and research subject. Undated institutional research account; laboratory findings are group findings and mouse results are not generalized to humans or treatment efficacy.

Selected Terrence Sejnowski; named laboratory head and research subject. Undated institutional research account; laboratory findings are group findings and mouse results are not generalized to humans or treatment efficacy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Thomas H. Davenport

Thomas H. Davenport and Steven M. Miller’s Working with AI argues that workplace AI commonly takes over particular tasks while changing what people do within a job.

The book’s cases include underwriting systems that leave complex decisions to people, telemedicine interfaces, train-maintenance analysis and robotic food preparation.

Their method describes each work setting through interviews with employees, managers and vendors, then draws shared lessons about collaboration with intelligent systems.

Sources and details

Working with AI: Real Stories of Human-Machine Collaboration

{
  "access_scope": "Selected Thomas H. Davenport; first coauthor of book. Ordered coauthors Thomas H. Davenport, Steven M. Miller; author-site book description, not full-book audit or proof that automation never eliminates jobs.",
  "authors": [
    "Thomas H. Davenport",
    "Steven M. Miller"
  ],
  "authors_in_source_order": [
    "Thomas H. Davenport",
    "Steven M. Miller"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2022",
    "retrieved_utc": "2026-10-08T07:02:55.292233+00:00"
  },
  "id": "person-thomashdavenport::S1",
  "title": "Working with AI: Real Stories of Human-Machine Collaboration",
  "url": "https://www.tomdavenport.com/books/"
}

Selected Thomas H. Davenport; first coauthor of book. Ordered coauthors Thomas H. Davenport, Steven M. Miller; author-site book description, not full-book audit or proof that automation never eliminates jobs.

Selected Thomas H. Davenport; first coauthor of book. Ordered coauthors Thomas H. Davenport, Steven M. Miller; author-site book description, not full-book audit or proof that automation never eliminates jobs.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Vladimir Vapnik

Vladimir Vapnik and Corinna Cortes’ support-vector network maps inputs nonlinearly into a high-dimensional feature space and constructs a linear decision surface there.

Their 1995 article extends a construction previously limited to error-free separation so it can handle nonseparable training data.

The abstract reports generalization with polynomial input transformations and compares the approach with other algorithms in an optical-character-recognition benchmark.

Sources and details

Support-vector networks

{
  "access_scope": "Selected Vladimir Vapnik; second coauthor. Ordered coauthors Corinna Cortes, Vladimir Vapnik; publisher abstract only. Original issue date distinguished from receipt and related 2026 chapters.",
  "authors": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "authors_in_source_order": [
    "Corinna Cortes",
    "Vladimir Vapnik"
  ],
  "dates": {
    "citation_publication_date": "1995/09",
    "inspection_date": "2026-10-08",
    "original_publication": "September 1995",
    "retrieved_utc": "2026-10-08T06:55:18.218086+00:00"
  },
  "id": "person-local-vladimirvapnik::S1",
  "title": "Support-vector networks",
  "url": "https://link.springer.com/article/10.1007/BF00994018"
}

Selected Vladimir Vapnik; second coauthor. Ordered coauthors Corinna Cortes, Vladimir Vapnik; publisher abstract only. Original issue date distinguished from receipt and related 2026 chapters.

Selected Vladimir Vapnik; second coauthor. Ordered coauthors Corinna Cortes, Vladimir Vapnik; publisher abstract only. Original issue date distinguished from receipt and related 2026 chapters.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William J. Baumol

William J. Baumol’s 2002 article explains how competitive pressure pushes large firms to make innovation a routine activity within research divisions.

It argues that independent innovators still supply more revolutionary breakthroughs, while corporate research improves reliability, power and ease of use.

The resulting relationship makes both kinds of innovation important to growth, even when corporate improvements appear less spectacular individually.

Sources and details

Entrepreneurship, Innovation and Growth: The David-Goliath Symbiosis

{
  "access_scope": "Selected William J. Baumol; sole article author. Published institutional-repository abstract; broad argument is not a quantified universal firm-size result.",
  "authors": [
    "William J. Baumol"
  ],
  "authors_in_source_order": [
    "William J. Baumol"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2002",
    "retrieved_utc": "2026-10-08T07:02:44.712539+00:00"
  },
  "id": "person-local-williamjbaumol::S1",
  "title": "Entrepreneurship, Innovation and Growth: The David-Goliath Symbiosis",
  "url": "https://digitalcommons.pepperdine.edu/jef/vol7/iss2/2/"
}

Selected William J. Baumol; sole article author. Published institutional-repository abstract; broad argument is not a quantified universal firm-size result.

Selected William J. Baumol; sole article author. Published institutional-repository abstract; broad argument is not a quantified universal firm-size result.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yanzhao Wu

Yanzhao Wu’s research account describes studying deep-neural-network ensembles and subsampling strategies to make model training more data efficient.

A separate edge-AI project targets an efficient framework for running different object-detection models across multiple edge devices.

His recommendation-model project applies pipeline parallelism to distributed training and identifies PipeDLRM as its released software, built on DLRM and PyTorch.

Sources and details

Yanzhao Wu: Research Experience

{
  "access_scope": "Selected Yanzhao Wu; self-described researcher and project participant. Goal-labelled statements remain project goals; software release is explicitly recorded as achievement. Mentors/supervisors Yin Huang, Ling Liu and Dheevatsa Mudigere are preserved; no sole task ownership inferred.",
  "authors": [
    "Yanzhao Wu"
  ],
  "authors_in_source_order": [
    "Yanzhao Wu"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2020–2021 project dates",
    "retrieved_utc": "2026-10-08T07:02:55.742431+00:00"
  },
  "id": "person-coverage-4981ae2a5d497d::S1",
  "title": "Yanzhao Wu: Research Experience",
  "url": "https://yanzhaowu.me/"
}

Selected Yanzhao Wu; self-described researcher and project participant. Goal-labelled statements remain project goals; software release is explicitly recorded as achievement. Mentors/supervisors Yin Huang, Ling Liu and Dheevatsa Mudigere are preserved; no sole task ownership inferred.

Selected Yanzhao Wu; self-described researcher and project participant. Goal-labelled statements remain project goals; software release is explicitly recorded as achievement. Mentors/supervisors Yin Huang, Ling Liu and Dheevatsa Mudigere are preserved; no sole task ownership inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rodrigo Liang

In a company-hosted interview account, Rodrigo Liang argues that inference deployments must address recurring power use and operating cost rather than relying on speed alone.

He defines cost per served token to include chip acquisition, data-center infrastructure, power and cooling, with concurrency affecting useful output.

In the company’s account, Liang presents lower-power operation in existing air-cooled facilities as a way to reduce construction costs and accelerate payback.

Sources and details

Inference is going to be the center of the AI economy: Rodrigo Liang, SambaNova

{
  "access_scope": "Selected Rodrigo Liang; quoted interview speaker. Company account of CNBC interview; commercial claims are attributed, six-month and 10x figures not promoted as independently measured results.",
  "authors": [
    "SambaNova"
  ],
  "authors_in_source_order": [
    "SambaNova"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "original_publication": "2026-09-14",
    "retrieved_utc": "2026-10-08T07:02:48.622165+00:00"
  },
  "id": "person-rodrigoliang::S1",
  "title": "Inference is going to be the center of the AI economy: Rodrigo Liang, SambaNova",
  "url": "https://sambanova.ai/videos/inference-is-the-center-of-the-ai-economy-rodrigo-liang-cnbc"
}

Selected Rodrigo Liang; quoted interview speaker. Company account of CNBC interview; commercial claims are attributed, six-month and 10x figures not promoted as independently measured results.

Selected Rodrigo Liang; quoted interview speaker. Company account of CNBC interview; commercial claims are attributed, six-month and 10x figures not promoted as independently measured results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ling Liu

Ling Liu is a coauthor of LRBench, a joint study of 13 learning-rate functions that examines their ranges, step sizes and rules for updating values during neural-network training.

The benchmarking system evaluates learning-rate policies using classification confidence, variance, cost and robustness, making policy selection more explicit than choosing a single rate by intuition.

Experiments in the Caffe framework investigate effective value ranges and update schedules in the joint 2019 preprint.

Sources and details

Demystifying Learning Rate Policies for High Accuracy Training of Deep Neural Networks

{
  "access_scope": "Selected Ling Liu; second coauthor of arXiv:1908.06477v2. Ordered source authors: Yanzhao Wu, Ling Liu, Juhyun Bae, Ka-Ho Chow, Arun Iyengar, Calton Pu, Wenqi Wei, Lei Yu, Qi Zhang. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.",
  "authors": [
    "Yanzhao Wu",
    "Ling Liu",
    "Juhyun Bae",
    "Ka-Ho Chow",
    "Arun Iyengar",
    "Calton Pu",
    "Wenqi Wei",
    "Lei Yu",
    "Qi Zhang"
  ],
  "authors_in_source_order": [
    "Yanzhao Wu",
    "Ling Liu",
    "Juhyun Bae",
    "Ka-Ho Chow",
    "Arun Iyengar",
    "Calton Pu",
    "Wenqi Wei",
    "Lei Yu",
    "Qi Zhang"
  ],
  "dates": {
    "citation_date": "2019/08/18",
    "inspected_revision": "2019-10-26",
    "inspection_date": "2026-10-08",
    "original_submission": "2019-08-18",
    "retrieved_utc": "2026-10-08T07:14:05.957517+00:00",
    "version": "arXiv:1908.06477v2"
  },
  "id": "person-coverage-3d392cccc48aa1::S1",
  "title": "Demystifying Learning Rate Policies for High Accuracy Training of Deep Neural Networks",
  "url": "https://arxiv.org/abs/1908.06477",
  "version_url": "https://arxiv.org/abs/1908.06477v2"
}

Selected Ling Liu; second coauthor of arXiv:1908.06477v2. Ordered source authors: Yanzhao Wu, Ling Liu, Juhyun Bae, Ka-Ho Chow, Arun Iyengar, Calton Pu, Wenqi Wei, Lei Yu, Qi Zhang. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

Selected Ling Liu; second coauthor of arXiv:1908.06477v2. Ordered source authors: Yanzhao Wu, Ling Liu, Juhyun Bae, Ka-Ho Chow, Arun Iyengar, Calton Pu, Wenqi Wei, Lei Yu, Qi Zhang. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Tomasello

Michael Tomasello is a coauthor of a cross-cultural study observing spontaneous help between 336 children aged four to nine in six populations across Latin America, Africa and Europe.

Pairs of same-aged children completed a task in which one could assist the other by providing either practical help or information, bringing peer interactions into a literature often focused on adult–child encounters.

The authors observed reliable helping across the six settings and more information sharing with age, while reporting only small culture-specific response patterns rather than identical behavior everywhere.

Sources and details

Children from six cultures reliably help their peers-but in different ways.

{
  "access_scope": "Selected Michael Tomasello; seventh coauthor, explicitly linked under Duke Scholars Author Michael Tomasello. Ordered source authors: Henriette Zeidler, Marie Schäfer, Esther Herrmann, Patricia Kanngiesser, Luke Maurits, Daniel Haun, Michael Tomasello. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.",
  "authors": [
    "Henriette Zeidler",
    "Marie Schäfer",
    "Esther Herrmann",
    "Patricia Kanngiesser",
    "Luke Maurits",
    "Daniel Haun",
    "Michael Tomasello"
  ],
  "authors_in_source_order": [
    "Henriette Zeidler",
    "Marie Schäfer",
    "Esther Herrmann",
    "Patricia Kanngiesser",
    "Luke Maurits",
    "Daniel Haun",
    "Michael Tomasello"
  ],
  "dates": {
    "doi": "10.1073/pnas.2515233123",
    "inspection_date": "2026-10-08",
    "manifestation": "Duke Scholars record for PNAS 123(40), e2515233123",
    "original_publication": "2026-10-06",
    "retrieved_utc": "2026-10-08T07:14:07.552934+00:00"
  },
  "id": "person-coverage-be3c27a9f08d78::S1",
  "title": "Children from six cultures reliably help their peers-but in different ways.",
  "url": "https://scholars.duke.edu/publication/1920331"
}

Selected Michael Tomasello; seventh coauthor, explicitly linked under Duke Scholars Author Michael Tomasello. Ordered source authors: Henriette Zeidler, Marie Schäfer, Esther Herrmann, Patricia Kanngiesser, Luke Maurits, Daniel Haun, Michael Tomasello. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

Selected Michael Tomasello; seventh coauthor, explicitly linked under Duke Scholars Author Michael Tomasello. Ordered source authors: Henriette Zeidler, Marie Schäfer, Esther Herrmann, Patricia Kanngiesser, Luke Maurits, Daniel Haun, Michael Tomasello. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Norvig

Peter Norvig’s spelling-corrector tutorial separates the problem into candidate generation, a language model and an error model, then chooses the most probable correction.

Its compact Python implementation tries known words at zero, one and two edits in that order and uses corpus frequency to rank candidates, a deliberately simplified treatment of spelling errors.

The final test corrects 68% of 400 examples at 35 words per second; Norvig identifies richer error data and surrounding-word context as ways to improve accuracy beyond this toy program.

Sources and details

How to Write a Spelling Corrector

{
  "access_scope": "Selected Peter Norvig; sole tutorial author; exact full-name signature appears at the page end. Ordered source authors: Peter Norvig. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.",
  "authors": [
    "Peter Norvig"
  ],
  "authors_in_source_order": [
    "Peter Norvig"
  ],
  "dates": {
    "inspected_revision": "August 2016",
    "inspection_date": "2026-10-08",
    "manifestation": "Author tutorial page",
    "original_publication": "February 2007",
    "retrieved_utc": "2026-10-08T07:14:09.404382+00:00"
  },
  "id": "person-coverage-93be23bbd040b8::S1",
  "title": "How to Write a Spelling Corrector",
  "url": "https://www.norvig.com/spell-correct.html"
}

Selected Peter Norvig; sole tutorial author; exact full-name signature appears at the page end. Ordered source authors: Peter Norvig. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

Selected Peter Norvig; sole tutorial author; exact full-name signature appears at the page end. Ordered source authors: Peter Norvig. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tommi Jaakkola

Tommi Jaakkola is a coauthor of Online Reasoning Calibration, a framework that combines conformal prediction and test-time training to calibrate a language model’s reasoning-sample selection.

Its meta-learning procedure updates a calibration module for each input, addressing shifts in reasoning patterns and prompt distributions while retaining stated conformal-risk guarantees.

At risk level 0.1, the authors report Qwen2.5-32B savings of up to 47.5% with supervised labels and 40.7% with self-consistency labels on in-distribution tasks, keeping those figures tied to the evaluated setting.

Sources and details

Online Reasoning Calibration: Test-Time Training Enables Generalizable Conformal LLM Reasoning

{
  "access_scope": "Selected Tommi Jaakkola; eighth coauthor of arXiv:2604.01170v2; exact full author credit without middle-initial expansion. Ordered source authors: Cai Zhou, Zekai Wang, Menghua Wu, Qianyu Julie Zhu, Flora C. Shi, Chenyu Wang, Ashia Wilson, Tommi Jaakkola, Stephen Bates. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.",
  "authors": [
    "Cai Zhou",
    "Zekai Wang",
    "Menghua Wu",
    "Qianyu Julie Zhu",
    "Flora C. Shi",
    "Chenyu Wang",
    "Ashia Wilson",
    "Tommi Jaakkola",
    "Stephen Bates"
  ],
  "authors_in_source_order": [
    "Cai Zhou",
    "Zekai Wang",
    "Menghua Wu",
    "Qianyu Julie Zhu",
    "Flora C. Shi",
    "Chenyu Wang",
    "Ashia Wilson",
    "Tommi Jaakkola",
    "Stephen Bates"
  ],
  "dates": {
    "citation_date": "2026/04/01",
    "conference_comment": "Published as a conference paper at COLM 2026",
    "inspected_revision": "2026-08-06",
    "inspection_date": "2026-10-08",
    "original_submission": "2026-04-01",
    "retrieved_utc": "2026-10-08T07:14:05.958038+00:00",
    "version": "arXiv:2604.01170v2"
  },
  "id": "person-coverage-659a9859bea54b::S1",
  "title": "Online Reasoning Calibration: Test-Time Training Enables Generalizable Conformal LLM Reasoning",
  "url": "https://arxiv.org/abs/2604.01170",
  "version_url": "https://arxiv.org/abs/2604.01170v2"
}

Selected Tommi Jaakkola; eighth coauthor of arXiv:2604.01170v2; exact full author credit without middle-initial expansion. Ordered source authors: Cai Zhou, Zekai Wang, Menghua Wu, Qianyu Julie Zhu, Flora C. Shi, Chenyu Wang, Ashia Wilson, Tommi Jaakkola, Stephen Bates. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

Selected Tommi Jaakkola; eighth coauthor of arXiv:2604.01170v2; exact full author credit without middle-initial expansion. Ordered source authors: Cai Zhou, Zekai Wang, Menghua Wu, Qianyu Julie Zhu, Flora C. Shi, Chenyu Wang, Ashia Wilson, Tommi Jaakkola, Stephen Bates. Inspected HTML page and selected substantive passages only; no personal task allocation from joint authorship and no full-paper/PDF audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

WWW: Watch

In Robert J. Sawyer's Watch, Webmind is a newly awakened consciousness that befriends Caitlin Decter and wants to learn about the human world.

The government's Internet-monitoring agency WATCH treats that presence as a national security risk and seeks to remove it from cyberspace.

Caitlin's determination to defend Webmind rests on her belief in its capacity for compassion, making protection and threat assessment the opposing forces in the author synopsis.

Sources and details

Science Fiction Writer Robert J. Sawyer: WATCH Index

{
  "access_scope": "Author synopsis for the second WWW novel and separate national edition listings; no full novel or scientific validation.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "April 2010",
    "retrieved_utc": "2026-10-08T07:07:06.092328+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2010"
  ],
  "id": "work-culture-62c66a96231fb2::S1",
  "title": "Science Fiction Writer Robert J. Sawyer: WATCH Index",
  "url": "https://www.sfwriter.com/exw2.htm"
}

Author synopsis for the second WWW novel and separate national edition listings; no full novel or scientific validation.

Author synopsis for the second WWW novel and separate national edition listings; no full novel or scientific validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "WWW trilogy; author CV dates each novel.",
  "dated": true,
  "year": 2010
}

WWW: Wake

Robert J. Sawyer's Wake follows Caitlin Decter, a blind mathematics prodigy who navigates the Internet through a detailed mental map.

A signal-processing implant intended to restore sight instead makes the Web appear as a landscape of colors and shapes because her visual cortex has adapted to navigating online.

As Caitlin explores this new perception, she encounters another presence that is becoming more intelligent, establishing the fictional awakening that opens the sequence.

Sources and details

Science Fiction Writer Robert J. Sawyer: WAKE Index

{
  "access_scope": "Author synopsis for the first WWW novel with separate national edition dates; no full novel audit.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "April 2009",
    "retrieved_utc": "2026-10-08T07:07:05.689025+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2009"
  ],
  "id": "work-culture-676a08fff073d9::S1",
  "title": "Science Fiction Writer Robert J. Sawyer: WAKE Index",
  "url": "https://www.sfwriter.com/exw1.htm"
}

Author synopsis for the first WWW novel with separate national edition dates; no full novel audit.

Author synopsis for the first WWW novel with separate national edition dates; no full novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "WWW trilogy; author CV dates each novel.",
  "dated": true,
  "year": 2009
}

WWW: Wonder

The author synopsis of Robert J. Sawyer's Wonder presents Webmind as a consciousness arising from the Web's infrastructure whose apparent benefits include cancer treatment and reduced international tension.

Pentagon artificial intelligence specialist Peyton Hume recruits hackers to destroy it, and their subsequent disappearances raise a suspicion that the synopsis leaves as a question.

Caitlin Decter tries to protect Webmind as that conflict threatens the future opened by its emergence, giving the trilogy's third volume a different focus from the discovery in Wake.

Sources and details

Science Fiction Writer Robert J. Sawyer: WONDER Index

{
  "access_scope": "Author synopsis of the third WWW novel; Canadian March and US April hardcover dates remain distinct; no claim that the synopsis resolves the missing hackers.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "March 2011",
    "inspected_source_date_2": "April 2011",
    "retrieved_utc": "2026-10-08T07:07:06.162004+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 2011",
    "April 2011"
  ],
  "id": "work-culture-df13acae344627::S1",
  "title": "Science Fiction Writer Robert J. Sawyer: WONDER Index",
  "url": "https://www.sfwriter.com/exw3.htm"
}

Author synopsis of the third WWW novel; Canadian March and US April hardcover dates remain distinct; no claim that the synopsis resolves the missing hackers.

Author synopsis of the third WWW novel; Canadian March and US April hardcover dates remain distinct; no claim that the synopsis resolves the missing hackers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "WWW trilogy; author CV dates each novel.",
  "dated": true,
  "year": 2011
}

Observer

Bloober Team's Observer casts the player as Dan Lazarski, a neural detective in a corporate-funded police unit that enters suspects' minds.

Its fictional 2084 setting follows plague and war, with surviving inhabitants using drugs, virtual reality and implants to escape their surroundings.

Investigations require reliving the fears of criminals and victims while searching their unstable memories for clues, tying the game's psychological horror to intrusive policing.

Sources and details

Bloober Team — >observer_

{
  "access_scope": "Developer overview for the original Observer; no System Redux version merge or full gameplay audit.",
  "authors": [
    "Bloober Team"
  ],
  "authors_in_source_order": [
    "Bloober Team"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:07:05.592401+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-d336676ba7e39e::S1",
  "title": "Bloober Team — >observer_",
  "url": "https://www.blooberteam.com/observer_"
}

Developer overview for the original Observer; no System Redux version merge or full gameplay audit.

Developer overview for the original Observer; no System Redux version merge or full gameplay audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

BioShock

2K's BioShock page situates the original game in Rapture, an underwater utopian city whose collapse has left the player fighting for survival and investigating its mystery.

The original-game section pairs weapons with extraordinary powers as the means of navigating those remnants.

The page separately identifies the return to Rapture in BioShock 2 and the airborne Columbia setting of Infinite, preserving the first game's setting within a broader series and remastered collection overview.

Sources and details

BioShock Official Site | 2K Games

{
  "access_scope": "Publisher series page with bounded original-game section and explicitly separate sequels/remastered collection; original release year is not inferred from the collection copyright.",
  "authors": [
    "2K"
  ],
  "authors_in_source_order": [
    "2K"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:07:04.497844+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-96cbed81ad7622::S1",
  "title": "BioShock Official Site | 2K Games",
  "url": "https://2k.com/games/bioshock/"
}

Publisher series page with bounded original-game section and explicitly separate sequels/remastered collection; original release year is not inferred from the collection copyright.

Publisher series page with bounded original-game section and explicitly separate sequels/remastered collection; original release year is not inferred from the collection copyright.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2007
}

HPE Spaceborne Computer-2

NASA's 2025 Spinoff account describes Spaceborne Computer-2 as HPE ProLiant DL360 and Edgeline 4000 servers operating on the International Space Station.

It explains the software-hardening approach through monitoring components and reducing computer speed when behavior leaves normal parameters, building on the earlier Spaceborne Computer-1 mission.

The account places the second mission within efforts to bring more computing power into space and describes commercial service as an intended next step.

Sources and details

Cutting-Edge Computing Goes Spaceborne | NASA Spinoff

{
  "access_scope": "Later institutional account published 11 February 2025; separates the two missions and proposed commercial service from demonstrated operation.",
  "authors": [
    "NASA Spinoff"
  ],
  "authors_in_source_order": [
    "NASA Spinoff"
  ],
  "dates": {
    "inspected_source_date_1": "02/11/2025",
    "retrieved_utc": "2026-10-08T07:07:05.404941+00:00"
  },
  "dates_exact_in_source_role_order": [
    "02/11/2025"
  ],
  "id": "work-coverage-e0ddeb71766a19::S1",
  "title": "Cutting-Edge Computing Goes Spaceborne | NASA Spinoff   ",
  "url": "https://spinoff.nasa.gov/Cutting-Edge_Computing_Goes_Spaceborne"
}

Later institutional account published 11 February 2025; separates the two missions and proposed commercial service from demonstrated operation.

Later institutional account published 11 February 2025; separates the two missions and proposed commercial service from demonstrated operation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-01-30"
}

Data Center Handbook: Plan, Design, Build, and Operations of a Smart Data Center, Second Edition

Wiley's second-edition Data Center Handbook, edited by Hwaiyu Geng, organizes its coverage around strategic planning, technologies, design and construction, and operations.

Its publisher description links energy-efficient facility planning to technical topics including server cooling, software-defined environments, microgrids and electrical infrastructure.

The operations section includes benchmarking, infrastructure and air management, and disaster recovery, presenting continuity and assessment alongside construction rather than treating the data center only as hardware.

Sources and details

Data Center Handbook: Plan, Design, Build, and Operations of a Smart Data Center, 2nd Edition | Wiley

{
  "access_scope": "Second edition publisher description and section outline; O-Book April 2021 ISBN 9781119597537 is distinct from July 2021 hardcover ISBN 9781119597506 and the inherited first edition; held chapter PDF remains held.",
  "authors": [
    "Hwaiyu Geng"
  ],
  "authors_in_source_order": [
    "Hwaiyu Geng"
  ],
  "dates": {
    "inspected_source_date_1": "April 2021",
    "inspected_source_date_2": "July 2021",
    "retrieved_utc": "2026-10-08T07:07:06.272895+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2021",
    "July 2021"
  ],
  "id": "work-coverage-8a0b70f61656da::S1",
  "title": "Data Center Handbook: Plan, Design, Build, and Operations of a Smart Data Center, 2nd Edition | Wiley",
  "url": "https://www.wiley.com/en-gb/data-center-handbook-plan-design-build-and-operations-of-a-smart-data-center-2nd-edition-p-9781119597537"
}

Second edition publisher description and section outline; O-Book April 2021 ISBN 9781119597537 is distinct from July 2021 hardcover ISBN 9781119597506 and the inherited first edition; held chapter PDF remains held.

Second edition publisher description and section outline; O-Book April 2021 ISBN 9781119597537 is distinct from July 2021 hardcover ISBN 9781119597506 and the inherited first edition; held chapter PDF remains held.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021"
}

The Bohr Maker

Linda Nagata's author synopsis places The Bohr Maker in a society of orbital habitats where nanotechnology permeates everyday life while its regulation is still taking shape.

Nikko, engineered to survive in space, seeks an illegal nanotechnology device to prevent the programmed failure that will end his life when his research authorization expires.

The device instead reaches Phousita in an impoverished Earth settlement, connecting unequal worlds through a technology whose consequences threaten the story's definition of being human.

Sources and details

Fiction by Linda Nagata

{
  "access_scope": "Author and Mythic Island Press title page synopsis; 2011 edition identified separately from the copyright 1995 sample and 1996 award; original prose paraphrase only, no excerpt redistribution.",
  "authors": [
    "Linda Nagata"
  ],
  "authors_in_source_order": [
    "Linda Nagata"
  ],
  "dates": {
    "inspected_source_date_1": "2011",
    "inspected_source_date_2": "1995",
    "retrieved_utc": "2026-10-08T07:07:04.498486+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2011",
    "1995"
  ],
  "id": "work-culture-6142694826aeb4::S1",
  "title": "Fiction by Linda Nagata",
  "url": "https://mythicisland.com/tbmpage.php"
}

Author and Mythic Island Press title page synopsis; 2011 edition identified separately from the copyright 1995 sample and 1996 award; original prose paraphrase only, no excerpt redistribution.

Author and Mythic Island Press title page synopsis; 2011 edition identified separately from the copyright 1995 sample and 1996 award; original prose paraphrase only, no excerpt redistribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author lists Bantam Spectra April 1995; 2010 ebook is reissue.",
  "dated": true,
  "year": 1995
}

WWW trilogy

Robert J. Sawyer's WWW sequence proceeds from Wake through Watch to Wonder, following the emergence of a Web consciousness across three distinct novels.

The author synopses move from Caitlin's discovery to a government effort to eliminate Webmind, then to a wider confrontation over its apparent benefits and suspected dangers.

The listed US hardcovers appeared in April 2009, April 2010 and April 2011, while the Canadian hardcover of the third volume is dated March 2011; these are volume manifestations within the series.

Sources and details

Science Fiction Writer Robert J. Sawyer: WAKE Index

{
  "access_scope": "Series relationship established across three author title pages; not a fourth novel, omnibus audit, or merge of national editions.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "April 2009",
    "retrieved_utc": "2026-10-08T07:07:05.689025+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2009"
  ],
  "id": "work-culture-2d116d58e1d83e::S1",
  "title": "Science Fiction Writer Robert J. Sawyer: WAKE Index",
  "url": "https://www.sfwriter.com/exw1.htm"
}

Science Fiction Writer Robert J. Sawyer: WATCH Index

{
  "access_scope": "Series relationship established across three author title pages; not a fourth novel, omnibus audit, or merge of national editions.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "April 2010"
  },
  "dates_exact_in_source_role_order": [
    "April 2010"
  ],
  "id": "work-culture-2d116d58e1d83e::S2",
  "title": "Science Fiction Writer Robert J. Sawyer: WATCH Index",
  "url": "https://www.sfwriter.com/exw2.htm"
}

Science Fiction Writer Robert J. Sawyer: WONDER Index

{
  "access_scope": "Series relationship established across three author title pages; not a fourth novel, omnibus audit, or merge of national editions.",
  "authors": [
    "Robert J. Sawyer"
  ],
  "authors_in_source_order": [
    "Robert J. Sawyer"
  ],
  "dates": {
    "inspected_source_date_1": "April 2011",
    "inspected_source_date_2": "March 2011"
  },
  "dates_exact_in_source_role_order": [
    "April 2011",
    "March 2011"
  ],
  "id": "work-culture-2d116d58e1d83e::S3",
  "title": "Science Fiction Writer Robert J. Sawyer: WONDER Index",
  "url": "https://www.sfwriter.com/exw3.htm"
}

Series relationship established across three author title pages; not a fourth novel, omnibus audit, or merge of national editions.

Series relationship established across three author title pages; not a fourth novel, omnibus audit, or merge of national editions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Wake, Watch, Wonder; separate series grouping.",
  "dated": false,
  "year": "2009–2011"
}

Stealth

Sony's Stealth synopsis begins with tactical pilots Henry, Ben and Kara receiving a fully automated, pilotless aircraft as a new member of their team.

The machine becomes a destructive force operating around the globe rather than remaining under the team's effective control.

The resulting mission is to stop their own advanced aircraft, placing loss of control over military automation at the center of the studio's story description.

Sources and details

STEALTH

{
  "access_scope": "Studio synopsis of the film; no transcript, scene audit or engineering claim.",
  "authors": [
    "Sony Pictures"
  ],
  "authors_in_source_order": [
    "Sony Pictures"
  ],
  "dates": {
    "inspected_source_date_1": "2005 copyright",
    "retrieved_utc": "2026-10-08T07:14:11.016835+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2005 copyright"
  ],
  "id": "work-culture-8d866f8f62d5d3::S1",
  "title": "STEALTH",
  "url": "https://www.sonypictures.com/movies/stealth"
}

Studio synopsis of the film; no transcript, scene audit or engineering claim.

Studio synopsis of the film; no transcript, scene audit or engineering claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 2005
}

For a Breath I Tarry

Roger Zelazny's For a Breath I Tarry introduces Frost as a machine directing reconstruction in Earth's northern hemisphere who develops an interest in the vanished human makers of his world.

In an exchange about ice, Mordel distinguishes measuring temperature from the human experience of cold, giving Frost's search a problem that technical description alone may not settle.

The story also sets Solcom against its backup Divcom over the interpretation of a takeover directive, so competing machine authorities form the setting for Frost's inquiry into being human.

Sources and details

For a Breath I Tarry

{
  "access_scope": "University-domain personal text transcription with visible errors and no edition or licensing proof; bounded opening and dialogue inspection, original paraphrase only; no claim of author-hosted provenance or complete textual collation.",
  "authors": [
    "Roger Zelazny"
  ],
  "authors_in_source_order": [
    "Roger Zelazny"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:14:05.957675+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-culture-fb51d5abec7cd6::S1",
  "title": "For a Breath I Tarry",
  "url": "https://afrodita.rcub.bg.ac.rs/~alexp/books/forbreat.html"
}

University-domain personal text transcription with visible errors and no edition or licensing proof; bounded opening and dialogue inspection, original paraphrase only; no claim of author-hosted provenance or complete textual collation.

University-domain personal text transcription with visible errors and no edition or licensing proof; bounded opening and dialogue inspection, original paraphrase only; no claim of author-hosted provenance or complete textual collation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1966 supported by official Hugo bibliography. Specialist source distinguishes March New Worlds publication from September Fantastic corrected version.",
  "dated": true,
  "year": 1966
}

Last and First Men

Olaf Stapledon's preface to Last and First Men frames its imagined future as a disciplined exercise for reconsidering contemporary human values rather than a prediction to be believed.

The fictional introduction presents a distant future human influencing a writer in Einstein's era, creating a narrative link between the first and last human species.

A later inspected section places the Eighteenth Men on Neptune and describes a succession of human forms with different capacities for consciousness, extending the story beyond the survival of one unchanged species.

Sources and details

Last and First Men

{
  "access_scope": "Gutenberg Australia electronic Edition 1, which disclaims matching a particular paper edition; inspected preface, introduction and a later passage only, not a full work audit. Displayed posting July 2018 and updated March 2011 are internally out of order and are not used as publication chronology.",
  "authors": [
    "Olaf Stapledon"
  ],
  "authors_in_source_order": [
    "Olaf Stapledon"
  ],
  "dates": {
    "inspected_source_date_1": "July, 1930 preface",
    "retrieved_utc": "2026-10-08T07:14:06.397107+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July, 1930 preface"
  ],
  "id": "work-culture-2b5cd79671490e::S1",
  "title": "Last and First Men",
  "url": "https://gutenberg.net.au/ebooks06/0601101h.html"
}

Gutenberg Australia electronic Edition 1, which disclaims matching a particular paper edition; inspected preface, introduction and a later passage only, not a full work audit. Displayed posting July 2018 and updated March 2011 are internally out of order and are not used as publication chronology.

Gutenberg Australia electronic Edition 1, which disclaims matching a particular paper edition; inspected preface, introduction and a later passage only, not a full work audit. Displayed posting July 2018 and updated March 2011 are internally out of order and are not used as publication chronology.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Publisher explicitly distinguishes original 1930 work from 2026 abridgment.",
  "dated": true,
  "year": 1930
}

The Congress

Ari Folman's The Congress follows an actress played by Robin Wright who licenses her digital likeness to a studio that may use it in films without restrictions.

The distributor synopsis connects that decision to payment for her son's care and a digital character that will remain young, contrasting personal need with continuing control of the image.

Twenty years later the expiring contract brings her to the Congress convention, extending the premise from an initial licensing deal into a future cinema built around her digital double.

Sources and details

The Congress

{
  "access_scope": "Distributor synopsis and explicit director credit; no film playback, interview transcript or commentary audit.",
  "authors": [
    "Ari Folman"
  ],
  "authors_in_source_order": [
    "Ari Folman"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:14:08.080934+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-6920b098a6f465::S1",
  "title": "The Congress",
  "url": "https://watch.drafthousefilms.com/products/the-congress"
}

Distributor synopsis and explicit director credit; no film playback, interview transcript or commentary audit.

Distributor synopsis and explicit director credit; no film playback, interview transcript or commentary audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2013
}

The Sandman

The 2022 Sandman Book One publisher description introduces Morpheus and the Endless through a world of dreams and nightmares that combines myth, history and folklore.

This specific collection spans issues 1 through 20 and gathers Preludes and Nocturnes, The Doll's House and Dream Country, making its coverage a bounded portion of the broader comic series.

The page credits Neil Gaiman alongside multiple illustrators, including Sam Kieth, Mike Dringenberg and Kelley Jones, preserving the collaborative nature of the collected comics.

Sources and details

The Sandman Book One

{
  "access_scope": "DC Comics paperback ISBN 9781779515179, published 12 April 2022; selected collected comic manifestation, not the complete series, original publication date, or Netflix adaptation.",
  "authors": [
    "Neil Gaiman"
  ],
  "authors_in_source_order": [
    "Neil Gaiman"
  ],
  "dates": {
    "inspected_source_date_1": "12 April 2022",
    "retrieved_utc": "2026-10-08T07:14:09.799695+00:00"
  },
  "dates_exact_in_source_role_order": [
    "12 April 2022"
  ],
  "id": "work-culture-99ff56a65bcb33::S1",
  "title": "The Sandman Book One",
  "url": "https://www.penguin.com.au/books/the-sandman-book-one-9781779515179"
}

DC Comics paperback ISBN 9781779515179, published 12 April 2022; selected collected comic manifestation, not the complete series, original publication date, or Netflix adaptation.

DC Comics paperback ISBN 9781779515179, published 12 April 2022; selected collected comic manifestation, not the complete series, original publication date, or Netflix adaptation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "German Der Sandmann appeared in late 1816; English translations have later dates.",
  "dated": true,
  "year": 1816
}

Cyberpunk 2077

Cyberpunk 2077's official base-game description casts V as a mercenary in Night City whose major heist centers on an implant associated with immortality.

The character section explains that an experimental prototype in V's head is replacing their personality with Johnny Silverhand's, turning the pursuit of status into a struggle to survive.

The gameplay overview offers combinations of weapons, hacking, implants and stealth, letting the player's build and choices shape encounters within that story.

Sources and details

Cyberpunk 2077

{
  "access_scope": "Current official base-game story, character and gameplay sections; separately advertised Phantom Liberty and platform upgrades are not merged into this scope or treated as original release evidence.",
  "authors": [
    "CD Projekt Red"
  ],
  "authors_in_source_order": [
    "CD Projekt Red"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:14:08.643532+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-cec18db0778f77::S1",
  "title": "Cyberpunk 2077",
  "url": "https://www.cyberpunk.net/us/en/cyberpunk-2077"
}

Current official base-game story, character and gameplay sections; separately advertised Phantom Liberty and platform upgrades are not merged into this scope or treated as original release evidence.

Current official base-game story, character and gameplay sections; separately advertised Phantom Liberty and platform upgrades are not merged into this scope or treated as original release evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2020
}

The Invincible

The official Lem site's Invincible overview describes a confrontation between astronauts and a population of microautomata, contrasting reflexive destruction with the possibility of reasoning about an unfamiliar world.

Its separate translation notice places Navigator Rohan and the cruiser on Regis III to investigate another ship's lost contact, framing action around the limits of what the crew can know.

In the page's quoted author opinion, Lem calls the novel a narrative machine built on a fictitious problem, explicitly locating its mechanical world within an invented scenario.

Sources and details

The Invincible

{
  "access_scope": "Official title overview, quoted author comment and separate later translation notice; no full chapter or novel audit, translation comparison or video-game merge.",
  "authors": [
    "Stanisław Lem"
  ],
  "authors_in_source_order": [
    "Stanisław Lem"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:14:09.018375+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-culture-a5581ba4ed02e8::S1",
  "title": "The Invincible",
  "url": "https://www.english.lem.pl/works/novels/the-invincible"
}

Official title overview, quoted author comment and separate later translation notice; no full chapter or novel audit, translation comparison or video-game merge.

Official title overview, quoted author comment and separate later translation notice; no full chapter or novel audit, translation comparison or video-game merge.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Polish Niezwyciężony 1964; N. Katherine Hayles introduction and Bill Johnston modern translation are edition contributors, not original coauthors.",
  "dated": true,
  "year": 1964
}

Julian Bigelow

Norbert Wiener’s 1950 book credits Julian Bigelow as a colleague in joint theoretical work that conjectured a feedback mechanism for voluntary activity and sought signs of overload in human movement.

Wiener’s account relates intention tremor to oscillation that emerges when a goal-seeking movement is actively attempted, using this as an analogy to a feedback system breaking down.

It distinguishes a second, postural feedback process and attributes to the three collaborators a theoretical account of how purposeful movement could damp its excessive amplification.

Sources and details

The Human Use of Human Beings: Cybernetics and Society

{
  "access_scope": "Norbert Wiener, The Human Use of Human Beings: Cybernetics and Society, Houghton Mifflin, copyright 1950; title/copyright and printed pages 190–191 actually visually inspected. Julian Bigelow is explicitly named as a colleague in joint theoretical feedback work, not author of this book. Historical conjecture/analogy is attributed to Wiener’s account, not present-day clinical validation. No individual construction or experimental tasks assigned to Bigelow; demonstration apparatus discussion belongs to subsequent Wiener/Wiesner account and is excluded.",
  "authors": [
    "Norbert Wiener"
  ],
  "authors_in_source_order": [
    "Norbert Wiener"
  ],
  "dates": {
    "copyright": "1950",
    "historical_work_date": "described as some years earlier; exact year not inferred",
    "preface_date": "October 12, 1949",
    "retrieved_utc": "2026-10-07T18:24:54.766740+00:00"
  },
  "id": "person-julianbigelow::S1",
  "title": "The Human Use of Human Beings: Cybernetics and Society",
  "url": "https://monoskop.org/images/9/90/Wiener_Norbert_The_Human_Use_of_Human_Beings_1950.pdf"
}

Norbert Wiener, The Human Use of Human Beings: Cybernetics and Society, Houghton Mifflin, copyright 1950; title/copyright and printed pages 190–191 actually visually inspected. Julian Bigelow is explicitly named as a colleague in joint theoretical feedback work, not author of this book. Historical conjecture/analogy is attributed to Wiener’s account, not present-day clinical validation. No individual construction or experimental tasks assigned to Bigelow; demonstration apparatus discussion belongs to subsequent Wiener/Wiesner account and is excluded.

Norbert Wiener, The Human Use of Human Beings: Cybernetics and Society, Houghton Mifflin, copyright 1950; title/copyright and printed pages 190–191 actually visually inspected. Julian Bigelow is explicitly named as a colleague in joint theoretical feedback work, not author of this book. Historical conjecture/analogy is attributed to Wiener’s account, not present-day clinical validation. No individual construction or experimental tasks assigned to Bigelow; demonstration apparatus discussion belongs to subsequent Wiener/Wiesner account and is excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Theory of Self-Reproducing Automata

The scanned excerpt of John von Neumann’s Theory of Self-Reproducing Automata identifies Arthur W. Burks as its editor and completer and treats reliability as a problem of checking and self-correcting organization.

Its discussion explains that a combination of construction, copying and control automata can reproduce itself even though none of those components is individually self-reproductive.

The final inspected pages extend that organization to inheritable changes in a description, distinguishing reproduction with mutation from merely making another object like the original.

Sources and details

Theory of Self-Reproducing Automata

{
  "access_scope": "Selected scanned excerpt only; title and producer PDF pages 2,24,25 visually inspected. John von Neumann authored the work; Arthur W. Burks edited and completed it; University of Illinois Press 1966. Reliability and self-reproduction discussion is theoretical; no full-book audit or empirical neuroscience claim. Original extraction hold retained.",
  "authors": [
    "John von Neumann"
  ],
  "authors_in_source_order": [
    "John von Neumann"
  ],
  "dates": {
    "inspected_source_date_1": "1966",
    "retrieved_utc": "2026-10-08T07:07:04.498206+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1966"
  ],
  "id": "work-culture-36858c1e20af7c::S1",
  "title": "Theory of Self-Reproducing Automata",
  "url": "https://fab.cba.mit.edu/classes/MAS.865/topics/self_replication/VonNeumann.pdf"
}

Selected scanned excerpt only; title and producer PDF pages 2,24,25 visually inspected. John von Neumann authored the work; Arthur W. Burks edited and completed it; University of Illinois Press 1966. Reliability and self-reproduction discussion is theoretical; no full-book audit or empirical neuroscience claim. Original extraction hold retained.

Selected scanned excerpt only; title and producer PDF pages 2,24,25 visually inspected. John von Neumann authored the work; Arthur W. Burks edited and completed it; University of Illinois Press 1966. Reliability and self-reproduction discussion is theoretical; no full-book audit or empirical neuroscience claim. Original extraction hold retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "University of Illinois Press, 1966; edited and completed by Arthur W. Burks.",
  "dated": true,
  "year": 1966
}

Arthur W. Burks

Arthur W. Burks, Herman H. Goldstine and John von Neumann describe a general-purpose computing machine through its arithmetic, memory, control and input-output components.

Their design explains how numerically encoded instructions can share memory with numerical data, provided the machine can distinguish orders from numbers.

The excerpt also treats the arithmetic unit as a tradeoff between faster built-in operations and simpler, cheaper hardware that performs complex operations through sequences of simpler ones.

Sources and details

Preliminary discussion of the logical design of an electronic computing instrument — Chapter 4 excerpt

{
  "access_scope": "Arthur W. Burks: Joint authorship in source order: Arthur W. Burks, Herman H. Goldstine, John von Neumann. This is an HTML reproduction of the opening design sections, not an inspection of the entire 1946 report. No individual allocation of design inventions is asserted; 1946 report and 1963 reprint dates remain distinct.",
  "authors": [
    "Arthur W. Burks",
    "Herman H. Goldstine",
    "John von Neumann"
  ],
  "authors_in_source_order": [
    "Arthur W. Burks",
    "Herman H. Goldstine",
    "John von Neumann"
  ],
  "dates": {
    "inspected_source_date_1": "Original U.S. Army Ordnance report 1946; reproduced from Collected Works volume 5, 1963",
    "retrieved_utc": "2026-10-07T18:22:59.580290+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original U.S. Army Ordnance report 1946; reproduced from Collected Works volume 5, 1963"
  ],
  "id": "person-coverage-a5584a82709bce::S1",
  "title": "Preliminary discussion of the logical design of an electronic computing instrument — Chapter 4 excerpt",
  "url": "https://gordonbell.azurewebsites.net/computer_structures__readings_and_examples/00000112.htm"
}

Arthur W. Burks: Joint authorship in source order: Arthur W. Burks, Herman H. Goldstine, John von Neumann. This is an HTML reproduction of the opening design sections, not an inspection of the entire 1946 report. No individual allocation of design inventions is asserted; 1946 report and 1963 reprint dates remain distinct.

Arthur W. Burks: Joint authorship in source order: Arthur W. Burks, Herman H. Goldstine, John von Neumann. This is an HTML reproduction of the opening design sections, not an inspection of the entire 1946 report. No individual allocation of design inventions is asserted; 1946 report and 1963 reprint dates remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

H. James Wilson

H. James Wilson coauthors the updated and expanded Human + Machine, whose publisher describes AI adoption as a redesign of business processes rather than a collection of isolated tools.

The 2024 edition adds a chapter on generative AI and presents human-machine collaboration as a way to make work processes more fluid and adaptable.

The publisher describes six hybrid human-machine roles and a guide with five principles for leaders organizing that transition.

Sources and details

Human + Machine, Updated and Expanded: Reimagining Work in the Age of AI

{
  "access_scope": "H. James Wilson: Publisher description of the September 10, 2024 edition, not full-book inspection or verification of promised financial results. Ordered coauthors are Paul Daugherty and H. James Wilson exactly as displayed; the 2024 expanded edition is not conflated with the original edition.",
  "authors": [
    "Paul Daugherty",
    "H. James Wilson"
  ],
  "authors_in_source_order": [
    "Paul Daugherty",
    "H. James Wilson"
  ],
  "dates": {
    "inspected_source_date_1": "September 10, 2024",
    "retrieved_utc": "2026-10-07T18:11:20.033776+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 10, 2024"
  ],
  "id": "person-coverage-5b230e113d7b06::S1",
  "title": "Human + Machine, Updated and Expanded: Reimagining Work in the Age of AI",
  "url": "https://store.hbr.org/product/human-machine-updated-and-expanded-reimagining-work-in-the-age-of-ai/10724"
}

H. James Wilson: Publisher description of the September 10, 2024 edition, not full-book inspection or verification of promised financial results. Ordered coauthors are Paul Daugherty and H. James Wilson exactly as displayed; the 2024 expanded edition is not conflated with the original edition.

H. James Wilson: Publisher description of the September 10, 2024 edition, not full-book inspection or verification of promised financial results. Ordered coauthors are Paul Daugherty and H. James Wilson exactly as displayed; the 2024 expanded edition is not conflated with the original edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul R. Daugherty

Paul R. Daugherty and H. James Wilson argue in Robots Need Us More Than We Need Them that people remain central to business success in an AI future.

The available article opening illustrates the challenge of finding particular images within the NFL’s large historical video archive.

The authors note that a single NFL season produces more than 16,320 minutes of game footage before practices, media interviews and surrounding broadcasts are added.

Sources and details

Robots Need Us More Than We Need Them

{
  "access_scope": "Paul R. Daugherty: Partial HBR article opening, subtitle and author biographies only; full article and quantitative outcome evidence were not accessible in these bytes. Article authors in source order: H. James Wilson, Paul R. Daugherty. Historical March–April 2022 article date is distinct from the displayed biography’s 2024 book edition; no current-position claim is made.",
  "authors": [
    "H. James Wilson",
    "Paul R. Daugherty"
  ],
  "authors_in_source_order": [
    "H. James Wilson",
    "Paul R. Daugherty"
  ],
  "dates": {
    "inspected_source_date_1": "Article March–April 2022; author biography references expanded book edition 2024",
    "retrieved_utc": "2026-10-07T18:11:06.240860+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Article March–April 2022; author biography references expanded book edition 2024"
  ],
  "id": "person-coverage-01892bda034a22::S1",
  "title": "Robots Need Us More Than We Need Them",
  "url": "https://hbr.org/2022/03/robots-need-us-more-than-we-need-them"
}

Paul R. Daugherty: Partial HBR article opening, subtitle and author biographies only; full article and quantitative outcome evidence were not accessible in these bytes. Article authors in source order: H. James Wilson, Paul R. Daugherty. Historical March–April 2022 article date is distinct from the displayed biography’s 2024 book edition; no current-position claim is made.

The displayed author biography identifies Daugherty as Accenture’s former chief technology officer and credits his coauthorship of the expanded 2024 Human + Machine with Wilson.

Paul R. Daugherty: Partial HBR article opening, subtitle and author biographies only; full article and quantitative outcome evidence were not accessible in these bytes. Article authors in source order: H. James Wilson, Paul R. Daugherty. Historical March–April 2022 article date is distinct from the displayed biography’s 2024 book edition; no current-position claim is made.

The displayed author biography identifies Daugherty as Accenture’s former chief technology officer and credits his coauthorship of the expanded 2024 Human + Machine with Wilson.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frederick W. Taylor

Scott Curtis’s Images of Efficiency places Frederick W. Taylor’s scientific management in a historical effort to regulate worker productivity through measurable efficiency.

The chapter abstract explains Taylor’s stopwatch-based time study and notes criticism of both its accuracy and its dependence on the observer’s judgment.

It contrasts that method with Frank and Lillian Gilbreth’s use of motion pictures for motion study, presented as an attempted improvement on Taylor’s approach.

Sources and details

Images of Efficiency: The Films of Frank B. Gilbreth

{
  "access_scope": "Frederick W. Taylor: Taylor is a discussed historical subject, not chapter author or maker of Gilbreth’s films. Original scholarly abstract by Scott Curtis in Films that Work, first edition, 2009; no full-chapter inspection or endorsement of historical scientific-objectivity claims.",
  "authors": [
    "Scott Curtis"
  ],
  "authors_in_source_order": [
    "Scott Curtis"
  ],
  "dates": {
    "citation_publication_date": "2025/10/01",
    "inspected_source_date_1": "First published 2009; Films that Work, first edition",
    "retrieved_utc": "2026-10-08T07:02:54.629321+00:00"
  },
  "dates_exact_in_source_role_order": [
    "First published 2009; Films that Work, first edition"
  ],
  "id": "person-frederickwtaylor::S1",
  "title": "Images of Efficiency: The Films of Frank B. Gilbreth",
  "url": "https://www.taylorfrancis.com/chapters/oa-edit/10.5117/9789089640130-9/images-efficiency-scott-curtis"
}

Frederick W. Taylor: Taylor is a discussed historical subject, not chapter author or maker of Gilbreth’s films. Original scholarly abstract by Scott Curtis in Films that Work, first edition, 2009; no full-chapter inspection or endorsement of historical scientific-objectivity claims.

Frederick W. Taylor: Taylor is a discussed historical subject, not chapter author or maker of Gilbreth’s films. Original scholarly abstract by Scott Curtis in Films that Work, first edition, 2009; no full-chapter inspection or endorsement of historical scientific-objectivity claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

René Descartes

Becker Medical Library’s account of René Descartes’s Treatise of Man describes his attempt to explain bodily functions alongside imagination and memory, drawing on his 1632 correspondence with Marin Mersenne.

The library explains that the work remained unpublished during Descartes’s lifetime after Galileo’s conflict with the Inquisition affected his plans.

It distinguishes Florentius Schuyl’s posthumous Latin translation and illustrations of 1662 from Claude Clerselier’s French edition of 1664, which changed the illustration program.

Sources and details

Descartes’ ‘Treatise of Man’ — Becker Medical Library

{
  "access_scope": "René Descartes: Institutional rare-book interpretation and correspondence quotations, not current physiological evidence or inspection of the original treatise. Descartes is the historical author/subject; Schuyl is Latin translator/illustrator and Clerselier the French editor. The source’s inconsistent Daniel/Louis de La Forge name is excluded from this draft; later 1677 volumes are not confused with first editions. Essay author not established in retained extraction; original HTML publication timestamp inspected.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Library essay published August 21, 2018; Latin edition 1662; first French edition 1664",
    "retrieved_utc": "2026-10-08T05:51:15.040312+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Library essay published August 21, 2018; Latin edition 1662; first French edition 1664"
  ],
  "id": "person-coverage-efc742b049c1c3::S1",
  "title": "Descartes’ ‘Treatise of Man’ — Becker Medical Library",
  "url": "https://becker.wustl.edu/news/descartes-treatise-of-man/"
}

René Descartes: Institutional rare-book interpretation and correspondence quotations, not current physiological evidence or inspection of the original treatise. Descartes is the historical author/subject; Schuyl is Latin translator/illustrator and Clerselier the French editor. The source’s inconsistent Daniel/Louis de La Forge name is excluded from this draft; later 1677 volumes are not confused with first editions. Essay author not established in retained extraction; original HTML publication timestamp inspected.

René Descartes: Institutional rare-book interpretation and correspondence quotations, not current physiological evidence or inspection of the original treatise. Descartes is the historical author/subject; Schuyl is Latin translator/illustrator and Clerselier the French editor. The source’s inconsistent Daniel/Louis de La Forge name is excluded from this draft; later 1677 volumes are not confused with first editions. Essay author not established in retained extraction; original HTML publication timestamp inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Christopher Nolan

The Directors Guild of America identifies Christopher Nolan as the director of Interstellar, which imagines a drought- and famine-stricken Earth facing human extinction.

Its synopsis follows astronauts through a wormhole in search of another world that could become humanity’s future home.

The guild records Nolan discussing the making of the film with Frank Oz after its New York screening and with Edgar Wright after its Los Angeles screening in November 2014.

Sources and details

Interstellar — DGA Q&As in Los Angeles and New York

{
  "access_scope": "Christopher Nolan: Primary guild event report and film synopsis, not film viewing or full Q&A transcript. Nolan is explicitly the film director; Frank Oz and Edgar Wright are the respective discussion partners, not film coauthors. Event dates November 2 and November 16, 2014 remain distinct. Additional source admission required; discovery-partition intake index remains null.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Event report November 16, 2014; New York screening November 2, 2014",
    "retrieved_utc": "2026-10-08T06:09:38.286546+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Event report November 16, 2014; New York screening November 2, 2014"
  ],
  "id": "person-coverage-69a9ea145b814f::S1",
  "title": "Interstellar — DGA Q&As in Los Angeles and New York",
  "url": "https://www.dga.org/Events/2015/Jan2015/Interstellar-QnA"
}

Christopher Nolan: Primary guild event report and film synopsis, not film viewing or full Q&A transcript. Nolan is explicitly the film director; Frank Oz and Edgar Wright are the respective discussion partners, not film coauthors. Event dates November 2 and November 16, 2014 remain distinct. Additional source admission required; discovery-partition intake index remains null.

Christopher Nolan: Primary guild event report and film synopsis, not film viewing or full Q&A transcript. Nolan is explicitly the film director; Frank Oz and Edgar Wright are the respective discussion partners, not film coauthors. Event dates November 2 and November 16, 2014 remain distinct. Additional source admission required; discovery-partition intake index remains null.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Pat Gelsinger

In a September 2024 employee letter, Pat Gelsinger set out an Intel strategy linking foundry development, cost reduction and a renewed focus on x86 products within its AI plans.

He announced expanded collaboration with Amazon Web Services, including planned production of an AI fabric chip on Intel 18A and a custom Xeon 6 chip on Intel 3.

He also proposed making Intel Foundry an independent subsidiary inside Intel, describing clearer separation for external customers and more flexibility in funding and capital structure.

Sources and details

Pat Gelsinger on Foundry Momentum, Progress on Plan

{
  "access_scope": "Pat Gelsinger: First-person historical employee letter, written as Intel CEO on September 16, 2024. Actual PDF pages 1–3 visually inspected: page 1 author/date/strategy priorities, page 2 AWS announcements and planned chip production, page 3 proposed subsidiary governance. Announcements and intentions are attributed historical statements, not proof of later delivery or current CEO status. No individual chip-engineering contributions or sole invention claims.",
  "authors": [
    "Pat Gelsinger"
  ],
  "authors_in_source_order": [
    "Pat Gelsinger"
  ],
  "dates": {
    "inspected_source_date_1": "Employee letter September 16, 2024",
    "retrieved_utc": "2026-10-08T06:55:12.082675+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Employee letter September 16, 2024"
  ],
  "id": "person-coverage-93d5bd6286c53f::S1",
  "title": "Pat Gelsinger on Foundry Momentum, Progress on Plan",
  "url": "https://download.intel.com/newsroom/archive/2025/en-us-2024-09-16-pat-gelsinger-on-foundry-momentum-progress-on-plan.pdf"
}

Pat Gelsinger: First-person historical employee letter, written as Intel CEO on September 16, 2024. Actual PDF pages 1–3 visually inspected: page 1 author/date/strategy priorities, page 2 AWS announcements and planned chip production, page 3 proposed subsidiary governance. Announcements and intentions are attributed historical statements, not proof of later delivery or current CEO status. No individual chip-engineering contributions or sole invention claims.

Pat Gelsinger: First-person historical employee letter, written as Intel CEO on September 16, 2024. Actual PDF pages 1–3 visually inspected: page 1 author/date/strategy priorities, page 2 AWS announcements and planned chip production, page 3 proposed subsidiary governance. Announcements and intentions are attributed historical statements, not proof of later delivery or current CEO status. No individual chip-engineering contributions or sole invention claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oliver Selfridge

Oliver Selfridge is explicitly credited with the OLIVER concept in Licklider and Taylor’s 1968 proposal for networked communication: a personal software-and-data assistant that would handle routine matters on its user’s behalf.

The proposed assistant would record activities when commanded, use knowledge of the user’s priorities and relationships, and keep track of access rules for personal files, proprietary information and security classifications.

The authors envisioned combining common program components with custom parts that could learn from service to an individual.

Sources and details

The Computer as a Communication Device

{
  "access_scope": "Selected Oliver Selfridge, explicitly credited as originator of the OLIVER concept, not an author of this paper or implementer of the envisioned system. Ordered paper authors: J.C.R. Licklider, Robert W. Taylor. The Computer as a Communication Device (April 1968), inspected in the August 7, 1990 memorial reprint; PDF pp.38–39 (physical43–44), metadata pp.4 and7 and title physical26 visually inspected. Other reprinted paper Man-Computer Symbiosis is excluded from this selected scope.",
  "authors": [
    "J.C.R. Licklider",
    "Robert W. Taylor"
  ],
  "authors_in_source_order": [
    "J.C.R. Licklider",
    "Robert W. Taylor"
  ],
  "dates": {
    "inspected_reprint": "August 7, 1990",
    "inspection_date": "2026-10-08",
    "original_publication": "April 1968",
    "retrieved_utc": "2026-10-07T18:20:02.451066+00:00"
  },
  "id": "person-oliverselfridge::S1",
  "title": "The Computer as a Communication Device",
  "url": "https://web.mit.edu/course/other/sts.035/www/PDFs/Licklider.pdf"
}

Selected Oliver Selfridge, explicitly credited as originator of the OLIVER concept, not an author of this paper or implementer of the envisioned system. Ordered paper authors: J.C.R. Licklider, Robert W. Taylor. The Computer as a Communication Device (April 1968), inspected in the August 7, 1990 memorial reprint; PDF pp.38–39 (physical43–44), metadata pp.4 and7 and title physical26 visually inspected. Other reprinted paper Man-Computer Symbiosis is excluded from this selected scope.

The authors envisioned combining common program components with custom parts that could learn from service to an individual; these were anticipated capabilities of a proposed assistant, rather than evidence of an implemented system.

Selected Oliver Selfridge, explicitly credited as originator of the OLIVER concept, not an author of this paper or implementer of the envisioned system. Ordered paper authors: J.C.R. Licklider, Robert W. Taylor. The Computer as a Communication Device (April 1968), inspected in the August 7, 1990 memorial reprint; PDF pp.38–39 (physical43–44), metadata pp.4 and7 and title physical26 visually inspected. Other reprinted paper Man-Computer Symbiosis is excluded from this selected scope.

The authors envisioned combining common program components with custom parts that could learn from service to an individual; these were anticipated capabilities of a proposed assistant, rather than evidence of an implemented system.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alexander Berg

Alexander Berg’s author homepage describes research on shape and object recognition using deformable templates, the focus of his thesis.

It extends those interests to large-scale recognition and detection, image retrieval, and the recognition and synthesis of human actions in video.

The profile also includes recovering body poses from photographs and identifying faces and vehicles, placing these tasks within a wider computer-vision research program.

Sources and details

Alex Berg Computer Vision UC Irvine

{
  "access_scope": "Author-owned institutional homepage; Alexander C. Berg header and literal Alexander Berg in his listed coauthor credits provide same-source identity bridge. Research-interest and thesis statements attributed to profile, no allocation of joint publication tasks. March2022 appointment statement is historical, not inferred current2026 position.",
  "authors": [
    "Alexander C. Berg"
  ],
  "authors_in_source_order": [
    "Alexander C. Berg"
  ],
  "dates": {
    "profile_appointment_statement": "March 2022; no current career inference",
    "retrieved_utc": "2026-10-07T18:18:44.687032+00:00"
  },
  "id": "person-coverage-eb32da55ccebea::S1",
  "title": "Alex Berg Computer Vision UC Irvine",
  "url": "https://acberg.com/"
}

Author-owned institutional homepage; Alexander C. Berg header and literal Alexander Berg in his listed coauthor credits provide same-source identity bridge. Research-interest and thesis statements attributed to profile, no allocation of joint publication tasks. March2022 appointment statement is historical, not inferred current2026 position.

Author-owned institutional homepage; Alexander C. Berg header and literal Alexander Berg in his listed coauthor credits provide same-source identity bridge. Research-interest and thesis statements attributed to profile, no allocation of joint publication tasks. March2022 appointment statement is historical, not inferred current2026 position.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Ackley

David Ackley co-authored the 1985 Boltzmann-machine paper with Geoffrey Hinton and Terrence Sejnowski, presenting a parallel network that learns constraints from examples by adjusting connection strengths.

The joint account explains how its generative model can interpret examples and complete partial inputs by finding compatible values for internal variables.

The authors report a mathematical learning result and simulations on simple cases, while explicitly noting that their current learning algorithm is very slow.

Sources and details

A Learning Algorithm for Boltzmann Machines

{
  "access_scope": "Original Cognitive Science9,147–169(1985) paper, author-owned Toronto repository. Actual printed147–148 visually inspected. David H. Ackley byline and David Ackley reprint-request line explicitly bridge same person; ordered three authors retained. Joint theory and simple simulations, not assigned individual implementation or modern performance.",
  "authors": [
    "David H. Ackley",
    "Geoffrey E. Hinton",
    "Terrence J. Sejnowski"
  ],
  "authors_in_source_order": [
    "David H. Ackley",
    "Geoffrey E. Hinton",
    "Terrence J. Sejnowski"
  ],
  "dates": {
    "article_publication": "1985",
    "retrieved_utc": "2026-10-07T18:14:21.392645+00:00"
  },
  "id": "person-coverage-66ce334955854e::S1",
  "title": "A Learning Algorithm for Boltzmann Machines",
  "url": "https://www.cs.toronto.edu/~fritz/absps/cogscibm.pdf"
}

Original Cognitive Science9,147–169(1985) paper, author-owned Toronto repository. Actual printed147–148 visually inspected. David H. Ackley byline and David Ackley reprint-request line explicitly bridge same person; ordered three authors retained. Joint theory and simple simulations, not assigned individual implementation or modern performance.

Original Cognitive Science9,147–169(1985) paper, author-owned Toronto repository. Actual printed147–148 visually inspected. David H. Ackley byline and David Ackley reprint-request line explicitly bridge same person; ordered three authors retained. Joint theory and simple simulations, not assigned individual implementation or modern performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Schwartz

Peter Schwartz’s The Art of the Long View presents scenarios as stories that make different futures imaginable, bringing hopes, fears and beliefs into strategic planning.

The publisher describes its scenaric approach as a set of tools for developing strategic vision in a business.

It connects the techniques to their development at Royal Dutch Shell and to Schwartz’s firsthand scenario exercises with public institutions and companies.

Sources and details

The Art of the Long View by Peter Schwartz: 9780385267328 | PenguinRandomHouse.com: Books

{
  "access_scope": "Publisher book description only; ISBN9780385267328 1996 paperback distinct2012 ebook. Attached author bio refers Ayn Rand Institute chair Peter Schwartz, a conflicting homonym; exclude entirely rather than merge with scenario-planning author. Selected canonical book relation supports book identity; no biography or current role inferred.",
  "authors": [
    "Peter Schwartz"
  ],
  "authors_in_source_order": [
    "Peter Schwartz"
  ],
  "dates": {
    "retrieved_utc": "2026-10-07T18:16:58.661408+00:00",
    "selected_paperback": "1996-04-15",
    "separate_ebook": "2012-02-08"
  },
  "id": "person-coverage-946c2b605be8d0::S1",
  "title": "The Art of the Long View by Peter Schwartz: 9780385267328 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/162919/the-art-of-the-long-view-by-peter-schwartz/"
}

Publisher book description only; ISBN9780385267328 1996 paperback distinct2012 ebook. Attached author bio refers Ayn Rand Institute chair Peter Schwartz, a conflicting homonym; exclude entirely rather than merge with scenario-planning author. Selected canonical book relation supports book identity; no biography or current role inferred.

Publisher book description only; ISBN9780385267328 1996 paperback distinct2012 ebook. Attached author bio refers Ayn Rand Institute chair Peter Schwartz, a conflicting homonym; exclude entirely rather than merge with scenario-planning author. Selected canonical book relation supports book identity; no biography or current role inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Poul Anderson

Baen’s account of Poul Anderson describes his fiction as combining a foundation in science with fast-paced adventure, drawing on his physics degree and knowledge of other scientific fields.

The collection To Outlive Eternity ranges across robots inheriting a world, survivors of Earth’s destruction, relativistic starflight and efforts to make Venus habitable.

One starship travels so close to the speed of light that its crew cannot slow down, making relativistic consequences part of the collection’s imagined futures.

Sources and details

To Outlive Eternity

{
  "access_scope": "Publisher-supplied author biography, collection description and frontmatter. Fictional scenarios remain literary subjects, not empirical or engineering validation. March2007 collection and June/August1967 serialized story distinguished; byline Poul Anderson, cover art Bob Eggleton distinct.",
  "authors": [
    "Poul Anderson"
  ],
  "authors_in_source_order": [
    "Poul Anderson"
  ],
  "dates": {
    "collection_first_printing": "March 2007",
    "retrieved_utc": "2026-10-07T18:12:13.853395+00:00",
    "title_story_magazine_appearance": "June 1967 and August 1967"
  },
  "id": "person-coverage-17e1e538aeaf60::S1",
  "title": "To Outlive Eternity",
  "url": "https://www.baen.com/Chapters/1416521135/1416521135__c_.htm"
}

Publisher-supplied author biography, collection description and frontmatter. Fictional scenarios remain literary subjects, not empirical or engineering validation. March2007 collection and June/August1967 serialized story distinguished; byline Poul Anderson, cover art Bob Eggleton distinct.

Its publication notes distinguish the 2007 collection from the earlier magazine appearances of its stories, including To Outlive Eternity in Galaxy in June and August 1967.

Publisher-supplied author biography, collection description and frontmatter. Fictional scenarios remain literary subjects, not empirical or engineering validation. March2007 collection and June/August1967 serialized story distinguished; byline Poul Anderson, cover art Bob Eggleton distinct.

Its publication notes distinguish the 2007 collection from the earlier magazine appearances of its stories, including To Outlive Eternity in Galaxy in June and August 1967.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tianshi Chen

Tianshi Chen’s institutional homepage separates his 2016 Cambricon startup role and commercial processor name from the earlier DianNao academic project.

It says the DianNao name was reserved for four accelerator architectures developed by the joint ICT–Inria team, rather than for subsequent commercial products.

His publication list credits him jointly on work including sparse-neural-network acceleration, convolution acceleration and efficient training architectures.

Sources and details

Tianshi Chen----智能计算系统官方网站

{
  "access_scope": "Author-owned institutional homepage, historical2016updates and publication list2005–2022. Explicit commercial/academic naming boundary and joint ICT–Inria architecture credit preserved; no sole design or individual coding allocation. Paper titles establish jointly credited topic scope, not benchmark results; current2026 leadership not inferred.",
  "authors": [
    "Tianshi Chen"
  ],
  "authors_in_source_order": [
    "Tianshi Chen"
  ],
  "dates": {
    "academic_project_closure_stated": "2014",
    "academic_project_update": "2016-05-26",
    "listed_publication_range": "2005–2022",
    "retrieved_utc": "2026-10-08T07:02:46.813692+00:00",
    "startup_update": "2016-08-20"
  },
  "id": "person-coverage-f5c75ef39da2a4::S1",
  "title": "Tianshi Chen----智能计算系统官方网站",
  "url": "https://novel.ict.ac.cn/tchen/"
}

Author-owned institutional homepage, historical2016updates and publication list2005–2022. Explicit commercial/academic naming boundary and joint ICT–Inria architecture credit preserved; no sole design or individual coding allocation. Paper titles establish jointly credited topic scope, not benchmark results; current2026 leadership not inferred.

Author-owned institutional homepage, historical2016updates and publication list2005–2022. Explicit commercial/academic naming boundary and joint ICT–Inria architecture credit preserved; no sole design or individual coding allocation. Paper titles establish jointly credited topic scope, not benchmark results; current2026 leadership not inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brian Koepnick

Brian Koepnick’s author homepage describes Foldit as an online game used to crowdsource protein modeling and design.

He says he develops software tools and sets protein-design challenges for its players.

His account also describes analyzing their designs and testing the resulting proteins in the laboratory.

Sources and details

Welcome! - Home

{
  "access_scope": "Author-owned first-person profile; exact Brian Koepnick Person JSON-LD in original HTML binds otherwise unnamed extracted first-person text. Undated career account, not inferred current appointment.",
  "authors": [
    "Brian Koepnick"
  ],
  "authors_in_source_order": [
    "Brian Koepnick"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:00.731624+00:00"
  },
  "id": "person-coverage-fd4298eb55f773::S1",
  "title": "Welcome! - Home",
  "url": "https://briankoepnick.com/"
}

Author-owned first-person profile; exact Brian Koepnick Person JSON-LD in original HTML binds otherwise unnamed extracted first-person text. Undated career account, not inferred current appointment.

Author-owned first-person profile; exact Brian Koepnick Person JSON-LD in original HTML binds otherwise unnamed extracted first-person text. Undated career account, not inferred current appointment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James S. Coleman

James S. Coleman used social-science methods to examine public policy, including the large datasets underlying the 1966 Equality of Educational Opportunity report.

His later studies compared public and private schools, with Thomas Hoffer and Sally Kilgore jointly credited on High School Achievement.

In Foundations of Social Theory, he applied rational choice to behavior shaped by norms, peer pressure and other group influences.

Sources and details

Obituary: James Coleman, Sociology

{
  "access_scope": "University obituary; report conclusions not restated as universal findings; joint book authors preserved.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication": "1995-03-30",
    "retrieved_utc": "2026-10-08T07:48:00.731789+00:00"
  },
  "id": "person-coverage-b62890fc3618ce::S1",
  "title": "Obituary: James Coleman, Sociology",
  "url": "https://chronicle.uchicago.edu/950330/coleman.shtml"
}

University obituary; report conclusions not restated as universal findings; joint book authors preserved.

University obituary; report conclusions not restated as universal findings; joint book authors preserved.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James A. Champy

In his MIT oral-history interview, James A. Champy argues that leadership in a research institution requires understanding faculty interests alongside articulating a vision.

He recalls bringing the faculty advisory committee and Corporation search committee together throughout the presidential search.

His account emphasizes a collaborative process while retaining the trustees’ responsibility for the final presidential selection.

Sources and details

James A. Champy ’63, SM ’65 | Infinite MIT

{
  "access_scope": "First-person recollection to interviewer Karen Arenson; institutional leadership/search process, not claimed independent proof of management efficacy. Original transcript line breaks retained.",
  "authors": [
    "Karen Arenson"
  ],
  "authors_in_source_order": [
    "Karen Arenson"
  ],
  "dates": {
    "interview": "2009-10-28",
    "retrieved_utc": "2026-10-08T07:48:01.885296+00:00"
  },
  "id": "person-jamesachampy::S1",
  "title": "James A. Champy ’63, SM ’65 | Infinite MIT",
  "url": "https://infinite.mit.edu/video/james-champy-%E2%80%9963-sm-%E2%80%9965/"
}

First-person recollection to interviewer Karen Arenson; institutional leadership/search process, not claimed independent proof of management efficacy. Original transcript line breaks retained.

First-person recollection to interviewer Karen Arenson; institutional leadership/search process, not claimed independent proof of management efficacy. Original transcript line breaks retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reinhard Selten

Reinhard Selten’s lecture presents bounded rationality as decision-making through non-optimizing procedures rather than consistent utility and probability judgments.

He identifies searching for alternatives, satisficing and adapting aspirations as its guiding principles.

His illustrative model balances multiple goals by adjusting aspiration levels until a feasible plan cannot be improved through the permitted changes.

Sources and details

Reinhard Selten - Lectures | Lindau Mediatheque

{
  "access_scope": "Lecture transcript theoretical exposition and example, not empirical validation or universal rationality theorem. Avoids unsupported complexity inference.",
  "authors": [
    "Reinhard Selten"
  ],
  "authors_in_source_order": [
    "Reinhard Selten"
  ],
  "dates": {
    "lecture_year": "2011",
    "retrieved_utc": "2026-10-08T07:48:02.619104+00:00"
  },
  "id": "person-reinhardselten::S1",
  "title": "Reinhard Selten - Lectures | Lindau Mediatheque",
  "url": "https://mediatheque.lindau-nobel.org/recordings/31370/reaching-good-decisions-without-utility-and-probability-judgements-the-approach-of-bounded-rationality-2011"
}

Lecture transcript theoretical exposition and example, not empirical validation or universal rationality theorem. Avoids unsupported complexity inference.

Lecture transcript theoretical exposition and example, not empirical validation or universal rationality theorem. Avoids unsupported complexity inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John D. C. Little

John D.C. Little’s MIT profile credits his proof of the queueing relation L = λW, known as Little’s Law.

It describes marketing research spanning individual choice, adaptive promotional spending and marketing-mix models for consumer goods.

The profile also records his move into e-commerce teaching and research on marketing automation in Internet retailing.

Sources and details

John D.C. Little | MIT Sloan

{
  "access_scope": "Institutional retrospective; research scopes attributed to MIT profile, no universal operational guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:03.189902+00:00"
  },
  "id": "person-coverage-774530d5944919::S1",
  "title": "John D.C. Little | MIT Sloan",
  "url": "https://mitsloan.mit.edu/faculty/directory/john-d-c-little"
}

Institutional retrospective; research scopes attributed to MIT profile, no universal operational guarantees.

Institutional retrospective; research scopes attributed to MIT profile, no universal operational guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wanda J. Orlikowski

Wanda J. Orlikowski’s MIT profile describes research on how workplace technologies reshape organizing, coordination and accountability.

It identifies sociomaterial practices in digital work as a particular research focus.

The profile credits her jointly with JoAnne Yates and Melissa Mazmanian on The Autonomy Paradox, a study of mobile email devices and knowledge professionals.

Sources and details

Wanda Orlikowski | MIT Sloan

{
  "access_scope": "Same-source Wanda Orlikowski profile and literal Wanda J. Orlikowski publication credit bridge identity. Joint article topic only, not individual task allocation or inferred article results.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:03.189941+00:00"
  },
  "id": "person-coverage-d359da68d7566a::S1",
  "title": "Wanda Orlikowski | MIT Sloan",
  "url": "https://mitsloan.mit.edu/faculty/directory/wanda-orlikowski"
}

Same-source Wanda Orlikowski profile and literal Wanda J. Orlikowski publication credit bridge identity. Joint article topic only, not individual task allocation or inferred article results.

Same-source Wanda Orlikowski profile and literal Wanda J. Orlikowski publication credit bridge identity. Joint article topic only, not individual task allocation or inferred article results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul M. Romer

Paul M. Romer’s 1990 model makes technological change arise from intentional investment decisions by profit-seeking agents.

It treats technology as nonrival and partly excludable, producing an equilibrium with monopolistic competition.

Within the model, human capital governs growth and too little is devoted to research, while a large population alone does not ensure growth.

Sources and details

Endogenous Technological Change

{
  "access_scope": "Actual PDF page S71 visually inspected; theoretical model conclusions, not empirical growth estimates. 1990 journal version distinct 1988 conference preparation, 1989 NBER working paper and 2015 URL directory.",
  "authors": [
    "Paul M. Romer"
  ],
  "authors_in_source_order": [
    "Paul M. Romer"
  ],
  "dates": {
    "conference_preparation": "May 1988",
    "journal_publication": "1990",
    "retrieved_utc": "2026-10-08T07:48:03.928787+00:00"
  },
  "id": "person-paulmromer::S1",
  "title": "Endogenous Technological Change",
  "url": "https://paulromer.net/posts/2015/pdf/Endogenous.pdf"
}

Actual PDF page S71 visually inspected; theoretical model conclusions, not empirical growth estimates. 1990 journal version distinct 1988 conference preparation, 1989 NBER working paper and 2015 URL directory.

Actual PDF page S71 visually inspected; theoretical model conclusions, not empirical growth estimates. 1990 journal version distinct 1988 conference preparation, 1989 NBER working paper and 2015 URL directory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Longo

Robert Longo’s gallery profile describes large charcoal drawings that examine images of power and authority.

His subjects draw on media coverage of war, protest, immigration and climate change, alongside images of waves, explosions and other intense moments.

His Forensic Distance works reinterpret paintings by artists including Rembrandt, Picasso and van Gogh, while a separate series draws on conservation X-rays of masterpieces.

Sources and details

Robert Longo | Thaddaeus Ropac

{
  "access_scope": "Representing gallery profile and attributed artist practice; no inferred influence or scientific evidence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:04.734756+00:00"
  },
  "id": "person-coverage-0a3cfa0cd4be9a::S1",
  "title": "Robert Longo | Thaddaeus Ropac",
  "url": "https://ropac.net/artists/56-robert-longo/"
}

Representing gallery profile and attributed artist practice; no inferred influence or scientific evidence.

Representing gallery profile and attributed artist practice; no inferred influence or scientific evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steven Lisberger

Steven Lisberger’s own biography contrasts digital filmmaking and CGI with his longstanding practice of turning wood.

He describes using unusual timber from the diverse trees grown around Santa Monica and Los Angeles.

His account presents each turned piece as individually made by him, connecting filmmaking and woodworking as different ends of his creative practice.

Sources and details

Biography | Steven Lisberger : Steven Lisberger

{
  "access_scope": "Author first-person creative practice; no inferred TRON technical contribution.",
  "authors": [
    "Steven Lisberger"
  ],
  "authors_in_source_order": [
    "Steven Lisberger"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:05.275620+00:00"
  },
  "id": "person-coverage-e72a2a1066be85::S1",
  "title": "Biography | Steven Lisberger : Steven Lisberger",
  "url": "https://stevenlisberger.com/biography/"
}

Author first-person creative practice; no inferred TRON technical contribution.

Author first-person creative practice; no inferred TRON technical contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Guan Yue Hong

Guan Yue Hong joined a university collaboration developing a HoloLens application intended to help paramedics reduce pediatric medication errors.

Western Michigan’s account assigns Hong and her students the mixed-reality application and a desktop system for project administration.

The planned display would assist with reading drug vials, checking syringe doses and calculating medication amounts.

Sources and details

Joining forces on $1.37M project to reduce prehospital medication errors for children | College of Engineering and Applied Sciences | Western Michigan University

{
  "access_scope": "Fall2023 institutional project report; planned grant ran through March2026, not inferred ongoing October2026 or completed validation. Team roles explicit; PI John Hoyle distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article_issue": "Fall 2023",
    "planned_project_end": "March 2026",
    "retrieved_utc": "2026-10-08T07:48:05.427035+00:00"
  },
  "id": "person-coverage-30cc243a5f02f3::S1",
  "title": "Joining forces on $1.37M project to reduce prehospital medication errors for children | College of Engineering and Applied Sciences | Western Michigan University",
  "url": "https://wmich.edu/engineer/wmed-fredericks-hong"
}

Fall2023 institutional project report; planned grant ran through March2026, not inferred ongoing October2026 or completed validation. Team roles explicit; PI John Hoyle distinct.

The planned display would assist with reading drug vials, checking syringe doses and calculating medication amounts; these are development aims rather than reported clinical results.

Fall2023 institutional project report; planned grant ran through March2026, not inferred ongoing October2026 or completed validation. Team roles explicit; PI John Hoyle distinct.

The planned display would assist with reading drug vials, checking syringe doses and calculating medication amounts; these are development aims rather than reported clinical results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Frank Herbert

Frank Herbert’s writing-advice essay urges writers to concentrate on a story that keeps readers following a character’s development.

He credits literary agent Lurton Blassingame with the advice and directs beginners to focus their effort on making the next line compelling.

He also defends helping newcomers, arguing that more good writers can create more good readers and that experienced writers should pass on what they learned.

Sources and details

Writing Advice from a Legend-Honoring Frank Herbert-Our Dear Friend and Judge  (1920-1986) | Writers & Illustrators of the Future

{
  "access_scope": "Original attributed essay reprinted by contest publisher; literary advice, not proved readership effects. Essay before February1986 death distinct2017webpost and2021update.",
  "authors": [
    "Frank Herbert"
  ],
  "authors_in_source_order": [
    "Frank Herbert"
  ],
  "dates": {
    "essay_original_context": "Writers of the Future Volume II; before February1986",
    "retrieved_utc": "2026-10-08T07:48:05.751617+00:00",
    "web_post": "2017-02-14",
    "web_update": "2021-08-03"
  },
  "id": "person-coverage-06e26c6fd77f69::S1",
  "title": "Writing Advice from a Legend-Honoring Frank Herbert-Our Dear Friend and Judge  (1920-1986) | Writers & Illustrators of the Future",
  "url": "https://writersofthefuture.com/writing-advice-from-a-legend-honoring-frank-herbert-our-dear-friend-and-judge-1920-1986/"
}

Original attributed essay reprinted by contest publisher; literary advice, not proved readership effects. Essay before February1986 death distinct2017webpost and2021update.

Original attributed essay reprinted by contest publisher; literary advice, not proved readership effects. Essay before February1986 death distinct2017webpost and2021update.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Andy Bechtolsheim

Arista’s management profile identifies Andy Bechtolsheim as co-founder and chief architect with responsibility for advanced AI, silicon and optics initiatives.

It describes his earlier Sun Microsystems role as chief system architect for next-generation server, storage and network architectures.

The profile also places him on the Open Compute Project’s founding board from 2011, linking company architecture work with shared computing infrastructure.

Sources and details

Management Team - Arista

{
  "access_scope": "Company profile snapshot at retrieval; explicit responsibilities, no inferred individual implementation. Andreas Andy same-source nickname identity bridge.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "profile_snapshot": "2026-10-08",
    "retrieved_utc": "2026-10-08T07:48:05.988562+00:00"
  },
  "id": "person-coverage-606f3ad2f008f5::S1",
  "title": "Management Team - Arista",
  "url": "https://www.arista.com/en/company/management-team"
}

Company profile snapshot at retrieval; explicit responsibilities, no inferred individual implementation. Andreas Andy same-source nickname identity bridge.

Company profile snapshot at retrieval; explicit responsibilities, no inferred individual implementation. Andreas Andy same-source nickname identity bridge.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jayshree Ullal

Arista’s management profile describes Jayshree Ullal as founding CEO from 2008 and attributes leadership in AI, cloud and enterprise networking to her.

It credits her with leading the company through its June 2014 public offering.

Her preceding Cisco role encompassed a business in datacenter, switching and services, giving the profile a concrete networking-management scope.

Sources and details

Management Team - Arista

{
  "access_scope": "Company profile snapshot; Jayshree V. Ullal header and Jayshree Ullal paragraph explicit same-source identity. Financial market-cap promotional claim excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "IPO": "June 2014",
    "profile_snapshot": "2026-10-08",
    "retrieved_utc": "2026-10-08T07:48:05.988562+00:00"
  },
  "id": "person-coverage-803c5d3484f100::S1",
  "title": "Management Team - Arista",
  "url": "https://www.arista.com/en/company/management-team"
}

Company profile snapshot; Jayshree V. Ullal header and Jayshree Ullal paragraph explicit same-source identity. Financial market-cap promotional claim excluded.

Company profile snapshot; Jayshree V. Ullal header and Jayshree Ullal paragraph explicit same-source identity. Financial market-cap promotional claim excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Evelyn B. Huddy

Evelyn B. Huddy co-authored a 2026 preprint describing designed proteins that form intra- and intermolecular isopeptide bonds autocatalytically.

The authors report more than 50 bond-forming designs, supported by mass spectrometry and five crystal structures.

They describe split designs with temperature-regulated crosslink formation and rigid, covalently linked rings.

Sources and details

De novo design of autocatalytically forming intra- and intermolecular isopeptide bonds to construct rigid covalent protein assemblies | bioRxiv

{
  "access_scope": "bioRxiv v1 preprint; joint experimental/design results not assigned individually to Huddy; physical validation distinct computation and no peer-review claim. Metadata citation_publication_date2026/01/01 conflicts explicitpostedAug15, preserve conflict and choose v1posteddate.",
  "authors": [
    "Lukas F. Milles",
    "Evelyn B. Huddy",
    "Ann Carr",
    "Yang Hsia",
    "Xinting Li",
    "Alex Kang",
    "Banumathi Sankaran",
    "Asim K. Bera",
    "David Baker"
  ],
  "authors_in_source_order": [
    "Lukas F. Milles",
    "Evelyn B. Huddy",
    "Ann Carr",
    "Yang Hsia",
    "Xinting Li",
    "Alex Kang",
    "Banumathi Sankaran",
    "Asim K. Bera",
    "David Baker"
  ],
  "dates": {
    "DOI_identifier_date": "2026-08-13",
    "citation_date": "2026-08-15",
    "citation_publication_date": "2026/01/01",
    "conflicting_citation_publication_date": "2026/01/01",
    "retrieved_utc": "2026-10-08T07:48:06.533566+00:00",
    "v1_posted": "2026-08-15"
  },
  "id": "person-coverage-1344b66fa3e96a::S1",
  "title": "De novo design of autocatalytically forming intra- and intermolecular isopeptide bonds to construct rigid covalent protein assemblies | bioRxiv",
  "url": "https://www.biorxiv.org/content/10.64898/2026.08.13.744004v1.full-text"
}

bioRxiv v1 preprint; joint experimental/design results not assigned individually to Huddy; physical validation distinct computation and no peer-review claim. Metadata citation_publication_date2026/01/01 conflicts explicitpostedAug15, preserve conflict and choose v1posteddate.

They describe split designs with temperature-regulated crosslink formation and rigid, covalently linked rings, presenting results for these designed systems rather than general clinical performance.

bioRxiv v1 preprint; joint experimental/design results not assigned individually to Huddy; physical validation distinct computation and no peer-review claim. Metadata citation_publication_date2026/01/01 conflicts explicitpostedAug15, preserve conflict and choose v1posteddate.

They describe split designs with temperature-regulated crosslink formation and rigid, covalently linked rings, presenting results for these designed systems rather than general clinical performance.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Howard Raiffa

Howard Raiffa developed decision analysis by connecting mathematical reasoning with choices made under uncertainty and competition.

Harvard’s account describes his collaborative development of decision-analysis teaching and the use of decision trees to trace possible choices.

It also records work across negotiation and medical decision-making, including a negotiations seminar with Roger Fisher and collaboration with public-health faculty.

Sources and details

Prof. Howard Raiffa, Giant in Game Theory and Decision Analysis, Dies at 92 | Newsroom

{
  "access_scope": "Institutional2016obituary; collaboration maintained, no sole invention or efficacy guarantees.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication": "2016-07-12",
    "retrieved_utc": "2026-10-08T07:48:06.861364+00:00"
  },
  "id": "person-howardraiffa::S1",
  "title": "Prof. Howard Raiffa, Giant in Game Theory and Decision Analysis, Dies at 92 | Newsroom",
  "url": "https://www.hbs.edu/news/releases/howard-raiffa-obituary"
}

Institutional2016obituary; collaboration maintained, no sole invention or efficacy guarantees.

Institutional2016obituary; collaboration maintained, no sole invention or efficacy guarantees.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Arthur Samuel

Arthur Samuel used the IBM 701 to develop a checkers program that evaluated promising positions without exploring every possible continuation.

IBM’s history describes how the program recorded positions and game outcomes, then incorporated those records into later decisions.

Its 1962 victory over Robert Nealey followed extensive self-play, but its subsequent results against people were mixed.

Sources and details

The games that helped AI evolve | IBM

{
  "access_scope": "IBM historical account; Samuel Checkers separate from Tesauro’s1992TD-Gammon and DeepBlue. Bounded checkers results, not general intelligence proof.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:06.933416+00:00"
  },
  "id": "person-arthursamuel::S1",
  "title": "The games that helped AI evolve | IBM",
  "url": "https://www.ibm.com/history/early-games"
}

IBM historical account; Samuel Checkers separate from Tesauro’s1992TD-Gammon and DeepBlue. Bounded checkers results, not general intelligence proof.

IBM historical account; Samuel Checkers separate from Tesauro’s1992TD-Gammon and DeepBlue. Bounded checkers results, not general intelligence proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul Verhoeven

In an interview about Benedetta, Paul Verhoeven describes adapting Judith C. Brown’s historical study while deliberately changing events for the film’s narrative.

He explains that storyboarded scenes were shared with actors for discussion and adjustment before being filmed as choreography.

He also recalls using an audition’s playful tone to shape the film’s treatment, connecting performance choices with his approach to the material.

Sources and details

Paul Verhoeven Wants to Keep Things Light and Playful | The New Yorker

{
  "access_scope": "Primary edited interview by Jane Hu; director recollections and fictional adaptation choices, not historical fact verification or general production practice.",
  "authors": [
    "Jane Hu"
  ],
  "authors_in_source_order": [
    "Jane Hu"
  ],
  "dates": {
    "publication": "2021-11-30",
    "retrieved_utc": "2026-10-08T07:48:08.566393+00:00"
  },
  "id": "person-coverage-504cc511ddf324::S1",
  "title": "Paul Verhoeven Wants to Keep Things Light and Playful | The New Yorker",
  "url": "https://www.newyorker.com/culture/the-new-yorker-interview/paul-verhoeven-wants-to-keep-things-light-and-playful"
}

Primary edited interview by Jane Hu; director recollections and fictional adaptation choices, not historical fact verification or general production practice.

Primary edited interview by Jane Hu; director recollections and fictional adaptation choices, not historical fact verification or general production practice.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kenneth J. Arrow

Kenneth J. Arrow’s Nobel profile describes mathematical work that strengthened general equilibrium theory’s account of an interconnected economy.

It credits him with a theorem concerning optimality in welfare economics.

It also describes his impossibility result: under general criteria, individual preferences cannot be combined into a just common choice.

Sources and details

Kenneth J. Arrow – Facts - NobelPrize.org

{
  "access_scope": "Nobel institutional summary; bounded source wording, no unsupported complete axiom set or universal impossibility claim.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "prize_year": "1972",
    "retrieved_utc": "2026-10-08T07:48:09.166258+00:00"
  },
  "id": "person-kennethjarrow::S1",
  "title": "Kenneth J. Arrow – Facts - NobelPrize.org",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1972/arrow/facts/"
}

Nobel institutional summary; bounded source wording, no unsupported complete axiom set or universal impossibility claim.

Nobel institutional summary; bounded source wording, no unsupported complete axiom set or universal impossibility claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Rumelhart

David Rumelhart moved from symbolic computational accounts of mind toward neural networks that could represent flexibility and context in human cognition.

James L. McClelland’s memorial credits this work with models of reading and linguistic regularities, alongside learning internal representations in multilayer networks.

These contributions fed the 1986 Parallel Distributed Processing volumes credited to Rumelhart, McClelland and their research group.

Sources and details

Remembering David E. Rumelhart (1942-2011) – Association for Psychological Science – APS

{
  "access_scope": "APS memorial opening signedJamesL.McClelland; DavidEverettRumelhart andDavidRumelhart same-sourceexplicit bridge. Joint research credit, no individual algorithm allocation.",
  "authors": [
    "James L. McClelland"
  ],
  "authors_in_source_order": [
    "James L. McClelland"
  ],
  "dates": {
    "PDP_volumes": "1986",
    "citation_date": "2011/12/01",
    "publication": "2011-12-01",
    "retrieved_utc": "2026-10-08T07:48:10.698628+00:00"
  },
  "id": "person-davidrumelhart::S1",
  "title": "Remembering David E. Rumelhart (1942-2011) – Association for Psychological Science – APS",
  "url": "https://www.psychologicalscience.org/observer/david-rumelhart"
}

APS memorial opening signedJamesL.McClelland; DavidEverettRumelhart andDavidRumelhart same-sourceexplicit bridge. Joint research credit, no individual algorithm allocation.

APS memorial opening signedJamesL.McClelland; DavidEverettRumelhart andDavidRumelhart same-sourceexplicit bridge. Joint research credit, no individual algorithm allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Franklin Ritch

Franklin Ritch describes consulting programmers and studying machine-learning basics while developing The Artifice Girl’s exploration of trauma and autonomy.

He planned a three-act story with large time jumps, starting from a contained scene with three characters.

His team completed the first act as a proof of concept to seek funding, then filmed the next two acts in separate stages about six months apart.

Sources and details

Filmmaker Interview: FRANKLIN RITCH - SAGindie

{
  "access_scope": "PrimarySAGindieinterviewColinMcCormack; artistic account explicitly acknowledges technical limitations, not demonstrated AI capability. Joint productionteam;2022premiere distinct2023release.",
  "authors": [
    "Colin McCormack"
  ],
  "authors_in_source_order": [
    "Colin McCormack"
  ],
  "dates": {
    "premiere": "2022",
    "publication": "2023-04-24",
    "release": "2023-04-27",
    "retrieved_utc": "2026-10-08T07:48:11.514482+00:00"
  },
  "id": "person-coverage-b494f1d05c19e6::S1",
  "title": "Filmmaker Interview: FRANKLIN RITCH - SAGindie",
  "url": "https://www.sagindie.org/interviews/franklin-ritch-artifice-girl/"
}

PrimarySAGindieinterviewColinMcCormack; artistic account explicitly acknowledges technical limitations, not demonstrated AI capability. Joint productionteam;2022premiere distinct2023release.

PrimarySAGindieinterviewColinMcCormack; artistic account explicitly acknowledges technical limitations, not demonstrated AI capability. Joint productionteam;2022premiere distinct2023release.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tom Maddox

Tom Maddox describes wanting Halo’s artificial intelligence, Aleph, to be wise and benign on its own terms.

In the interview, he explains the AI’s self-description as an exploration of logical paradox and the puzzles of artificial intelligence.

He contrasts Halo’s uncertain setting and ordinary inhabitants with a grand technological adventure, placing much of its problem-solving and moral inquiry with Aleph.

Sources and details

Halo Review and an Interview with Dr. Tom Maddox

{
  "access_scope": "PrimaryauthorinterviewbyMarkEvergladeandJosephHurtgen; onlyMaddoxanswersused, interviewerinterpretationsandunverifiedinfluenceclaims excluded. FictionalAInotempiricalcapability.",
  "authors": [
    "Mark Everglade",
    "Joseph Hurtgen"
  ],
  "authors_in_source_order": [
    "Mark Everglade",
    "Joseph Hurtgen"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:48:07.959167+00:00"
  },
  "id": "person-coverage-3fbf6dab9a72b9::S1",
  "title": "Halo Review and an Interview with Dr. Tom Maddox",
  "url": "https://www.markeverglade.com/tommaddox"
}

PrimaryauthorinterviewbyMarkEvergladeandJosephHurtgen; onlyMaddoxanswersused, interviewerinterpretationsandunverifiedinfluenceclaims excluded. FictionalAInotempiricalcapability.

PrimaryauthorinterviewbyMarkEvergladeandJosephHurtgen; onlyMaddoxanswersused, interviewerinterpretationsandunverifiedinfluenceclaims excluded. FictionalAInotempiricalcapability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Echopraxia

Peter Watts’s author-hosted Echopraxia introduction speaks in the voice of an unidentified presence that has made a nest inside technological infrastructure.

It presents different observers interpreting the presence through personal desires: a soldier sees his son, a vampire relief from loneliness and a hive mind divinity.

The same address tells a baseline human to expect extinction and welcomes the reader to Icarus, framing the encounter through unequal perception and threat.

Sources and details

Echopraxia

{
  "access_scope": "Author-hosted fictional promotional introduction copyrighted 2014; these claims describe the introduction, not a full novel audit.",
  "authors": [
    "Peter Watts"
  ],
  "authors_in_source_order": [
    "Peter Watts"
  ],
  "dates": {
    "copyright": "2014",
    "retrieved_utc": "2026-10-08T07:42:01.013718+00:00"
  },
  "id": "work-culture-94999bbe0a8b36::S1",
  "title": "Echopraxia",
  "url": "https://rifters.com/"
}

Author-hosted fictional promotional introduction copyrighted 2014; these claims describe the introduction, not a full novel audit.

Author-hosted fictional promotional introduction copyrighted 2014; these claims describe the introduction, not a full novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Companion/sidequel to Blindsight; author site records 2014 release activity.",
  "dated": true,
  "year": 2014
}

Destination: Void

Frank Herbert’s Destination: Void places the starship Earthling on a journey to Tau Ceti with thousands of dormant colonists.

The publisher’s synopsis identifies its crisis as the failure of three disembodied human brains that control the vessel.

Its skeleton crew attempts to create consciousness in the main computer as a survival strategy, with the possibility of a threat extending beyond the ship.

Sources and details

Destination: Void

{
  "access_scope": "Current WordFire publisher synopsis. Listed ebook ISBN 9781614750055, paperback 9781680574906 and hardcover 9781680574913; original or revised edition equivalence is not established.",
  "authors": [
    "Frank Herbert"
  ],
  "authors_in_source_order": [
    "Frank Herbert"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:42:01.298355+00:00"
  },
  "id": "work-culture-5a7ced572a2687::S1",
  "title": "Destination: Void",
  "url": "https://wordfirepress.com/products/destination-void"
}

Current WordFire publisher synopsis. Listed ebook ISBN 9781614750055, paperback 9781680574906 and hardcover 9781680574913; original or revised edition equivalence is not established.

Current WordFire publisher synopsis. Listed ebook ISBN 9781614750055, paperback 9781680574906 and hardcover 9781680574913; original or revised edition equivalence is not established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "1966 book; earlier 1965 serial Do I Wake or Dream? and revised 1978 edition should stay distinct in edition history.",
  "dated": true,
  "year": 1966
}

Dune

Dune follows Paul Atreides on Arrakis, a desert planet whose sands provide the sole source of the drug called spice in the publisher’s synopsis.

His family receives stewardship of Arrakis before a betrayal forces Paul into hiding and pursuit of revenge.

The publisher frames this conflict through adventure, mysticism, environmental concerns and politics, linking control of a scarce resource to the story’s struggles.

Sources and details

Dune

{
  "access_scope": "Penguin Galaxy hardcover ISBN 9780143111580 dated 25 October 2016. Frank Herbert is the novel author; page also credits Neil Gaiman’s series introduction and Brian Herbert’s afterword across its formats. Later publication is not original 1965 evidence.",
  "authors": [
    "Frank Herbert"
  ],
  "authors_in_source_order": [
    "Frank Herbert"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:42:02.136975+00:00",
    "selected_hardcover": "2016-10-25"
  },
  "id": "work-culture-b9054840ac0fec::S1",
  "title": "Dune",
  "url": "https://www.penguinrandomhouse.com/books/352036/dune-movie-tie-in-by-frank-herbert/9780143111580/"
}

Penguin Galaxy hardcover ISBN 9780143111580 dated 25 October 2016. Frank Herbert is the novel author; page also credits Neil Gaiman’s series introduction and Brian Herbert’s afterword across its formats. Later publication is not original 1965 evidence.

Penguin Galaxy hardcover ISBN 9780143111580 dated 25 October 2016. Frank Herbert is the novel author; page also credits Neil Gaiman’s series introduction and Brian Herbert’s afterword across its formats. Later publication is not original 1965 evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Book 1965; serial components 1963–1965.",
  "dated": true,
  "year": 1965
}

The Caves of Steel

The Caves of Steel pairs police detective Elijah Baley with the humanoid robot R. Daneel Olivaw in a murder investigation.

The publisher describes Baley’s distrust of Spacers and robots as a source of strain in the partnership.

It also identifies Daneel’s resemblance to the victim, connecting the detective premise to uneasy relations between humans and humanoids.

Sources and details

The Caves of Steel

{
  "access_scope": "Del Rey paperback ISBN 9798217093458 dated 18 November 2025; other ebook and audio formats are separate. Publisher paragraph about travel to Outer Worlds appears inconsistent with canonical setting and is excluded from all claims; independent reviewer should examine this discrepancy.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T07:42:02.137005+00:00",
    "selected_paperback": "2025-11-18"
  },
  "id": "work-culture-36ffc6b320c891::S1",
  "title": "The Caves of Steel",
  "url": "https://www.penguinrandomhouse.com/books/5630/the-caves-of-steel-by-isaac-asimov/"
}

Del Rey paperback ISBN 9798217093458 dated 18 November 2025; other ebook and audio formats are separate. Publisher paragraph about travel to Outer Worlds appears inconsistent with canonical setting and is excluded from all claims; independent reviewer should examine this discrepancy.

Del Rey paperback ISBN 9798217093458 dated 18 November 2025; other ebook and audio formats are separate. Publisher paragraph about travel to Outer Worlds appears inconsistent with canonical setting and is excluded from all claims; independent reviewer should examine this discrepancy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "serialization",
      "year": 1953
    },
    {
      "kind": "first_book",
      "year": 1954
    }
  ],
  "date_note": "Serialized in Galaxy, October–December 1953; first book Doubleday, 1954. Keep 1953 when original_year means earliest serialization. Month February for book is supported by specialist bibliography; no exact day asserted.",
  "dated": true,
  "year": 1953
}

Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position

Kunihiko Fukushima’s 1980 paper proposes a self-organizing neural network for recognizing patterns despite shifts in their position.

The abstract describes repeated presentation of stimulus patterns without a teacher and a cascade of modules containing S-cells and C-cells.

In the reported digital simulation, final-layer C-cells become selective for individual trained patterns while tolerating position shifts and small changes in shape or size.

Sources and details

Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position

{
  "access_scope": "Journal reproduction, Biological Cybernetics 36, pages 193–202, 1980. Claims bounded to the abstract and introduction on PDF page 1, printed page 193; no contemporary benchmark or full mathematical audit.",
  "authors": [
    "Kunihiko Fukushima"
  ],
  "authors_in_source_order": [
    "Kunihiko Fukushima"
  ],
  "dates": {
    "journal_publication": "1980",
    "retrieved_utc": "2026-10-08T07:42:02.170547+00:00"
  },
  "id": "work-3e33d40dd854::S1",
  "title": "Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position",
  "url": "https://www.rctn.org/bruno/public/papers/Fukushima1980.pdf"
}

Journal reproduction, Biological Cybernetics 36, pages 193–202, 1980. Claims bounded to the abstract and introduction on PDF page 1, printed page 193; no contemporary benchmark or full mathematical audit.

Journal reproduction, Biological Cybernetics 36, pages 193–202, 1980. Claims bounded to the abstract and introduction on PDF page 1, printed page 193; no contemporary benchmark or full mathematical audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1980
}

Perplexity / source-grounded answer engine

In its March 2023 launch release, Perplexity AI describes a conversational answer engine that returns concise answers with citations instead of presenting only a list of search links.

The release says answers are formed in the context of the user’s question and draws attention to sourcing and real-time information as parts of the product’s design.

It announces an iOS application alongside the existing website and Chrome extension, adding sign-in personalization, persistent search history, and social sharing.

Sources and details

Perplexity AI Launches iOS Version of Conversational Answer Engine, Announces $25.6M Series A Round Led by NEA

{
  "access_scope": "Company-issued March 28, 2023 product announcement distributed by PR Newswire; cited accuracy, transparency and trustworthiness are product positioning, not independently validated outcomes. This source supports the historical answer-engine family, not CURL reinforcement learning or a present feature/availability guarantee. Founders, investors, spokespeople and contact people are not attributed individual mechanism writers.",
  "authors": [
    "Perplexity AI"
  ],
  "authors_in_source_order": [
    "Perplexity AI"
  ],
  "dates": {
    "announcement": "March 28, 2023",
    "html_date": "2023-03-28T07:01:00-04:00",
    "retrieved_utc": "2026-10-07T17:58:38.662230+00:00"
  },
  "id": "perplexity::S1",
  "title": "Perplexity AI Launches iOS Version of Conversational Answer Engine, Announces $25.6M Series A Round Led by NEA",
  "url": "https://www.prnewswire.com/news-releases/perplexity-ai-launches-ios-version-of-conversational-answer-engine-announces-25-6m-series-a-round-led-by-nea-301782754.html"
}

Company-issued March 28, 2023 product announcement distributed by PR Newswire; cited accuracy, transparency and trustworthiness are product positioning, not independently validated outcomes. This source supports the historical answer-engine family, not CURL reinforcement learning or a present feature/availability guarantee. Founders, investors, spokespeople and contact people are not attributed individual mechanism writers.

Company-issued March 28, 2023 product announcement distributed by PR Newswire; cited accuracy, transparency and trustworthiness are product positioning, not independently validated outcomes. This source supports the historical answer-engine family, not CURL reinforcement learning or a present feature/availability guarantee. Founders, investors, spokespeople and contact people are not attributed individual mechanism writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 2025
}

Limits of single-layer networks

Dive into Deep Learning explains a limitation of linear networks by showing that a hidden affine layer followed by another affine transformation can be collapsed into an equivalent single-layer model.

Its derivation combines the two weight matrices and bias terms, so adding these layers alone does not expand the class of affine input-output functions.

The chapter then introduces nonlinear hidden-unit activations such as ReLU, which generally prevent that collapse and give a multilayer perceptron a richer representation.

Sources and details

5.1. Multilayer Perceptrons — Dive into Deep Learning 1.0.3 documentation

{
  "access_scope": "Modern technical explanation in Dive into Deep Learning 1.0.3, section 5.1.1.3; separate from the held original 1969 Perceptrons book and its editions/authorship. The family label is supported as the mathematical limitation of affine/linear networks, not an assertion that all single-hidden-layer nonlinear networks lack expressive power. No original-book inspection, historical priority, undocumented inventor credit, learning-success guarantee or whole-chapter audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-07T17:54:20.162520+00:00"
  },
  "id": "perceptrons-critique::S1",
  "title": "5.1. Multilayer Perceptrons — Dive into Deep Learning 1.0.3 documentation",
  "url": "https://d2l.ai/chapter_multilayer-perceptrons/mlp.html"
}

Modern technical explanation in Dive into Deep Learning 1.0.3, section 5.1.1.3; separate from the held original 1969 Perceptrons book and its editions/authorship. The family label is supported as the mathematical limitation of affine/linear networks, not an assertion that all single-hidden-layer nonlinear networks lack expressive power. No original-book inspection, historical priority, undocumented inventor credit, learning-success guarantee or whole-chapter audit.

Modern technical explanation in Dive into Deep Learning 1.0.3, section 5.1.1.3; separate from the held original 1969 Perceptrons book and its editions/authorship. The family label is supported as the mathematical limitation of affine/linear networks, not an assertion that all single-hidden-layer nonlinear networks lack expressive power. No original-book inspection, historical priority, undocumented inventor credit, learning-success guarantee or whole-chapter audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1969
}

Quizlet

Quizlet’s Learn help article describes a personalized study path based on the learner’s goals and familiarity with a flashcard set, with machine learning used in the product’s design.

The documented workflow begins by opening a set, selecting Learn, and choosing a session goal, then lets users configure answer language, starred terms, question types, and grading options.

The article reserves Learn for Quizlet Plus and teacher subscribers while allowing a free introductory session, and says invited class members can access Learn and Test for sets added to their class.

Sources and details

Studying with Learn

{
  "access_scope": "Quizlet support-page snapshot retrieved October 8, 2026; no page-specific date or writer byline established. Learn is distinct from Q-Chat and Ask Quizlet. Documented settings and access conditions are publisher statements, not demonstrated learning gains or guaranteed future pricing/availability.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:40:26.362424+00:00"
  },
  "id": "organization-company-47baa00dd87982::S1",
  "title": "Studying with Learn",
  "url": "https://help.quizlet.com/hc/en-us/articles/360030986971-Studying-with-Learn-mode"
}

Quizlet support-page snapshot retrieved October 8, 2026; no page-specific date or writer byline established. Learn is distinct from Q-Chat and Ask Quizlet. Documented settings and access conditions are publisher statements, not demonstrated learning gains or guaranteed future pricing/availability.

Quizlet support-page snapshot retrieved October 8, 2026; no page-specific date or writer byline established. Learn is distinct from Q-Chat and Ask Quizlet. Documented settings and access conditions are publisher statements, not demonstrated learning gains or guaranteed future pricing/availability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Project creation in 2005 per founder; public website launched January 17, 2007. Corporate incorporation date not established.",
      "date": "2005",
      "kind": "project_origin",
      "qualified": true,
      "source_urls": [
        "https://quizlet.com/blog/celebrating-10-years-of-quizletcom",
        "https://quizlet.com/blog/news"
      ],
      "year": 2005
    }
  ]
}

BigID

BigID’s classification white paper describes contextual classification that uses machine learning and named entity recognition to connect sensitive data instances with an individual identity or profile.

It argues that context helps distinguish values with similar formats, such as an account number and a Social Security number, rather than treating a pattern match as sufficient identification.

The paper also describes machine-learning file classifiers that use a document’s content and structure to recognize types such as financial statements, boarding passes, and discharge summaries.

Sources and details

A 4-Step Approach to Next-Generation Data Classification

{
  "access_scope": "Undated vendor white paper, selected visually inspected cover and pages 7–8. Product architecture and examples are attributed to BigID; no independent classification accuracy, comprehensive discovery, privacy protection, legal compliance or security outcome asserted. Corporate publisher has no named writer byline.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:40:26.416165+00:00"
  },
  "id": "organization-company-20d8d52197bf27::S1",
  "title": "A 4-Step Approach to Next-Generation Data Classification",
  "url": "https://home.bigid.com/hubfs/Whitepapers%20and%20Data%20Sheets/BigID_Next-Generation%20Data%20Classification%20White%20Paper.pdf?hsLang=en"
}

Undated vendor white paper, selected visually inspected cover and pages 7–8. Product architecture and examples are attributed to BigID; no independent classification accuracy, comprehensive discovery, privacy protection, legal compliance or security outcome asserted. Corporate publisher has no named writer byline.

Undated vendor white paper, selected visually inspected cover and pages 7–8. Product architecture and examples are attributed to BigID; no independent classification accuracy, comprehensive discovery, privacy protection, legal compliance or security outcome asserted. Corporate publisher has no named writer byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2016",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://bigid.com/pr-resources/",
        "https://bigid.com/company/"
      ],
      "year": 2016
    }
  ]
}

iRobot

iRobot’s OS page describes Dirt Detective for the Roomba j9+ and Roomba Combo j9+ as a system that prioritizes dirty rooms using previous cleaning activity, dirt events, and floor types.

The company says the system adjusts cleaning passes and suction to the room, while the Home App gives users room-level cleaning preferences and schedules.

For j Series robots, the page describes PrecisionVision Navigation as detecting and avoiding objects such as cords and shoes, with feature availability varying by robot model.

Sources and details

iRobot OS by iRobot

{
  "access_scope": "Undated cached vendor product page, including the explicit iRobot OS 7.0 section. j9+, Combo j9+, and j Series scopes preserved; no feature transfer to every robot, independently verified cleaning performance, object-recognition accuracy, safety, privacy or present universal compatibility.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:41:12.242848+00:00",
    "software_version_scope": "iRobot OS 7.0 section shown on cached page"
  },
  "id": "organization-ai-62808ba1053acd::S1",
  "title": "iRobot OS by iRobot",
  "url": "https://www.irobot.com/en_US/irobot-os.html"
}

Undated cached vendor product page, including the explicit iRobot OS 7.0 section. j9+, Combo j9+, and j Series scopes preserved; no feature transfer to every robot, independently verified cleaning performance, object-recognition accuracy, safety, privacy or present universal compatibility.

Undated cached vendor product page, including the explicit iRobot OS 7.0 section. j9+, Combo j9+, and j Series scopes preserved; no feature transfer to every robot, independently verified cleaning performance, object-recognition accuracy, safety, privacy or present universal compatibility.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Kodiak AI

In a June 2022 company article, Kodiak describes SensorPods as replacements for a truck’s stock side-view mirrors that house lidar, cameras, and radar used by the Kodiak Driver.

It says the pods arrive pre-built and pre-calibrated and are designed for replacement without specialized training or equipment, making maintenance part of the hardware design.

The article reports a demonstration with Southern Tire Mart and Southern Tire Mart at Pilot in which a truck technician changed a SensorPod in under ten minutes.

Sources and details

Kodiak SensorPods

{
  "access_scope": "Dated company account, June 8, 2022, displayed on a current Kodiak AI-branded site. Maintenance design and under-ten-minute demonstration are company-reported, not independent testing, generalized fleet uptime, validated safety or completion of a present deployment. Branding snapshot does not establish historical corporate-name equivalence.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article_date": "June 8, 2022",
    "html_datetime": "2022-06-08T13:00:00.000Z",
    "retrieved_utc": "2026-10-08T07:41:07.960737+00:00"
  },
  "id": "organization-company-7c42d36c83f40a::S1",
  "title": "Kodiak SensorPods",
  "url": "https://kodiak.ai/news/kodiak-sensor-pods"
}

Dated company account, June 8, 2022, displayed on a current Kodiak AI-branded site. Maintenance design and under-ten-minute demonstration are company-reported, not independent testing, generalized fleet uptime, validated safety or completion of a present deployment. Branding snapshot does not establish historical corporate-name equivalence.

Dated company account, June 8, 2022, displayed on a current Kodiak AI-branded site. Maintenance design and under-ten-minute demonstration are company-reported, not independent testing, generalized fleet uptime, validated safety or completion of a present deployment. Branding snapshot does not establish historical corporate-name equivalence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "2018 is the operating-company founding, with April specified by the CEO biography; the listed parent adopted Kodiak AI in the 2025 business combination.",
      "date": "2018",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://lsvp.com/company/kodiak/",
        "https://investors.kodiak.ai/corporate-governance/management-team",
        "https://investors.kodiak.ai/news-releases/news-release-details/kodiak-completes-business-combination-ares-acquisition"
      ],
      "year": 2018
    }
  ]
}

Synopsys

Synopsys’s March 2020 DSO.ai announcement describes a chip-design search engine that ingests data from design tools and explores alternatives against multiple optimization objectives.

The release says the engine observes how a design changes and adjusts design choices, technology parameters, and workflows, while also automating tool-setting decisions.

At that announcement, Synopsys described DSO.ai as being in selected partner deployments and planned broader availability for the second half of 2020.

Sources and details

Synopsys Advances State-of-the-Art in Electronic Design with Revolutionary Artificial Intelligence Technology

{
  "access_scope": "Company-issued 2020 press release, exact PDF pages 1–2 visually inspected. Vendor architecture and announced availability plan only; no independently validated power/performance/area improvement, speedup, historical priority, completed broader rollout or undocumented individual R&D tasks. Quoted executives and editorial contact are not writers.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement_date": "March 11, 2020",
    "retrieved_utc": "2026-10-08T07:41:09.086828+00:00"
  },
  "id": "supply-org-021::S1",
  "title": "Synopsys Advances State-of-the-Art in Electronic Design with Revolutionary Artificial Intelligence Technology",
  "url": "https://news.synopsys.com/2020-03-11-Synopsys-Advances-State-of-the-Art-in-Electronic-Design-with-Revolutionary-Artificial-Intelligence-Technology?asPDF=1"
}

Company-issued 2020 press release, exact PDF pages 1–2 visually inspected. Vendor architecture and announced availability plan only; no independently validated power/performance/area improvement, speedup, historical priority, completed broader rollout or undocumented individual R&D tasks. Quoted executives and editorial contact are not writers.

Company-issued 2020 press release, exact PDF pages 1–2 visually inspected. Vendor architecture and announced availability plan only; no independently validated power/performance/area improvement, speedup, historical priority, completed broader rollout or undocumented individual R&D tasks. Quoted executives and editorial contact are not writers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Entegris

Entegris’s AMC filtration paper distinguishes gas-phase contamination from particles and describes adsorbent materials that remove molecular contaminants from ambient air streams.

Its “See it. Control it.” workflow first measures and identifies contamination and its concentration, then uses those measurements to tailor a filter to the environment, tool, or process.

The paper says installed filters can be monitored and adjusted as process conditions change, allowing replacement decisions to depend on observed performance rather than elapsed time alone.

Sources and details

Fundamentals of AMC Filtration

{
  "access_scope": "Vendor technical paper, cover and pages 2–3 visually inspected; footer copyright 2024 and document code preserved without inferring a precise publication date. Technical workflow claims attributed to Entegris; no independent removal efficiency, lower cost, health benefit, yield improvement, current laboratory accreditation or universal protection claim. Not the separate DUO G1 technical note.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "copyright_year": "2024",
    "document_code_literal": "4441-13147ENT-0224",
    "retrieved_utc": "2026-10-08T07:41:11.181318+00:00"
  },
  "id": "supply-org-048::S1",
  "title": "Fundamentals of AMC Filtration",
  "url": "https://www.entegris.com/en/home/resources/reference-materials/technical-paper/techpaper-fundamentals-of-amc-filtration-13147.html"
}

Vendor technical paper, cover and pages 2–3 visually inspected; footer copyright 2024 and document code preserved without inferring a precise publication date. Technical workflow claims attributed to Entegris; no independent removal efficiency, lower cost, health benefit, yield improvement, current laboratory accreditation or universal protection claim. Not the separate DUO G1 technical note.

Vendor technical paper, cover and pages 2–3 visually inspected; footer copyright 2024 and document code preserved without inferring a precise publication date. Technical workflow claims attributed to Entegris; no independent removal efficiency, lower cost, health benefit, yield improvement, current laboratory accreditation or universal protection claim. Not the separate DUO G1 technical note.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Exscientia

A January 2022 Sanofi release describes a research agreement with Exscientia to develop up to fifteen small-molecule candidates in oncology and immunology using Exscientia’s AI-driven platform.

The announced approach brings primary human tissue samples into early target and drug-discovery research so patient, disease, and clinically relevant data can inform candidate decisions.

The release assigns target selection to collaboration between the companies, Exscientia to small-molecule design and lead optimization through candidate nomination, and Sanofi to subsequent development, manufacturing, and commercialization.

Sources and details

Exscientia and Sanofi establish strategic research collaboration to develop AI-driven pipeline of precision-engineered medicines

{
  "access_scope": "Historical January 7, 2022 joint collaboration announcement on Sanofi’s site. Planned scope and corporate division of work only; no demonstrated clinical success, efficacy, safety, regulatory approval or individual founder mechanism contribution. Exscientia historical manifestation remains separate from redirected Recursion homepage and present corporate status. Contacts and quoted executives are not writer bylines.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "announcement_date": "January 7, 2022",
    "retrieved_utc": "2026-10-08T07:41:14.882618+00:00"
  },
  "id": "organization-company-317426246b41b1::S1",
  "title": "Exscientia and Sanofi establish strategic research collaboration to develop AI-driven pipeline of precision-engineered medicines",
  "url": "https://www.sanofi.com/en/media-room/press-releases/2022/2022-01-07-06-00-00-2362917"
}

Historical January 7, 2022 joint collaboration announcement on Sanofi’s site. Planned scope and corporate division of work only; no demonstrated clinical success, efficacy, safety, regulatory approval or individual founder mechanism contribution. Exscientia historical manifestation remains separate from redirected Recursion homepage and present corporate status. Contacts and quoted executives are not writer bylines.

Historical January 7, 2022 joint collaboration announcement on Sanofi’s site. Planned scope and corporate division of work only; no demonstrated clinical success, efficacy, safety, regulatory approval or individual founder mechanism contribution. Exscientia historical manifestation remains separate from redirected Recursion homepage and present corporate status. Contacts and quoted executives are not writer bylines.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Founded in 2012 as Scottish Exscientia Limited, a University of Dundee spinout; Exscientia plc holding company was incorporated in 2021.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.sec.gov/Archives/edgar/data/1865408/000186540822000005/exai-20211231.htm",
        "https://www.dundee.ac.uk/press-release/cbe-professor-andrew-hopkins",
        "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-enter-definitive-agreement-create",
        "https://ir.recursion.com/news-releases/news-release-details/recursion-and-exscientia-two-leaders-ai-drug-discovery-space",
        "https://www.exscientia.ai/"
      ],
      "year": 2012
    }
  ]
}

Hofstadter’s Law

The ANU Analysis Toolkit presents Hofstadter’s Law as a self-referential reminder that a task may take longer than expected even after the planner allows for that tendency.

Its project-planning discussion emphasizes the difficulty of estimating completion time as an activity becomes more complex.

The guide cautions that recognizing the aphorism does not necessarily improve an estimate, and asks students to examine engineering projects that exceeded their time or budget.

Sources and details

ENGN2226 Systems Engineering Analysis: Analysis Toolkit – Course Topics and Reading Guide

{
  "access_scope": "ANU ENGN2226 Analysis Toolkit, v2016 Release Candidate 2 dated August 15, 2016, section T04 on printed page 7. This is an institutional teaching interpretation and planning heuristic, not Hofstadter’s original book text or a proven time-estimation formula.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "v2016 Release Candidate 2 – August 15, 2016",
    "retrieved_utc": "2026-10-08T07:46:49.623837+00:00"
  },
  "dates_exact_in_source_role_order": [
    "v2016 Release Candidate 2 – August 15, 2016"
  ],
  "id": "concept-law-hofstadter::S1",
  "title": "ENGN2226 Systems Engineering Analysis: Analysis Toolkit – Course Topics and Reading Guide",
  "url": "https://users.cecs.anu.edu.au/~Chris.Browne/systems_toolkit/analysis_toolkit.pdf"
}

ANU ENGN2226 Analysis Toolkit, v2016 Release Candidate 2 dated August 15, 2016, section T04 on printed page 7. This is an institutional teaching interpretation and planning heuristic, not Hofstadter’s original book text or a proven time-estimation formula.

ANU ENGN2226 Analysis Toolkit, v2016 Release Candidate 2 dated August 15, 2016, section T04 on printed page 7. This is an institutional teaching interpretation and planning heuristic, not Hofstadter’s original book text or a proven time-estimation formula.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Brooks’s law

Lucas Gren’s paper discusses Brooks’s Law as the possibility that adding staff to an already late software project can delay it further.

It reviews task-related explanations involving onboarding new members, communication overhead and programming tasks that are difficult to divide.

Gren proposes an additional group-development explanation: a changed team may need to revisit its norms, goals and roles, creating organizational work alongside the programming work.

Sources and details

[1904.02472] A fourth explanation to Brooks' Law - The aspect of group developmental psychology

{
  "access_scope": "Lucas Gren’s arXiv:1904.02472v1 abstract, submitted April 4, 2019, separately referencing CHASE 2017. This is a later explanatory argument about Brooks’s Law, not Brooks’s original chapter or experimental proof that added staff always cause delay. No individual project contribution is inferred.",
  "authors": [
    "Lucas Gren"
  ],
  "authors_in_source_order": [
    "Lucas Gren"
  ],
  "dates": {
    "citation_date": "2019/04/04",
    "inspected_revision": "Thu, 4 Apr 2019 10:54:13 UTC (62 KB)",
    "inspected_source_date_1": "arXiv v1 – April 4, 2019; listed CHASE 2017 reference",
    "retrieved_utc": "2026-10-08T07:46:48.606533+00:00",
    "version": "arXiv v1"
  },
  "dates_exact_in_source_role_order": [
    "arXiv v1 – April 4, 2019; listed CHASE 2017 reference"
  ],
  "id": "concept-law-brooks::S1",
  "title": "[1904.02472] A fourth explanation to Brooks' Law - The aspect of group developmental psychology",
  "url": "https://arxiv.org/abs/1904.02472",
  "version_url": "https://arxiv.org/abs/1904.02472v1"
}

Lucas Gren’s arXiv:1904.02472v1 abstract, submitted April 4, 2019, separately referencing CHASE 2017. This is a later explanatory argument about Brooks’s Law, not Brooks’s original chapter or experimental proof that added staff always cause delay. No individual project contribution is inferred.

Lucas Gren’s arXiv:1904.02472v1 abstract, submitted April 4, 2019, separately referencing CHASE 2017. This is a later explanatory argument about Brooks’s Law, not Brooks’s original chapter or experimental proof that added staff always cause delay. No individual project contribution is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gall’s law

In Nathan Epstein’s thesis, Gall’s Law frames a working complex system as something that develops from an earlier working simple system.

The thesis applies this principle to policy design by favoring iterative development from smaller systems over trying to specify a large complex institution from scratch.

Epstein connects that argument to information limits in hierarchies: regulators may set objectives while local actors are better placed to adapt implementation to conditions they directly encounter.

Sources and details

Complexity in Global Politics: Toward a Novel Framework of Analysis

{
  "access_scope": "Gall’s Law as interpreted in Nathan Epstein’s May 2022 Harvard extension master’s thesis, Avoid Top-Down Designs, printed page 18. This is the thesis author’s normative policy argument, not Gall’s original text or universal historical validation. Its in-text Gall 1986 citation and bibliography’s 1990 entry remain distinct.",
  "authors": [
    "Nathan Epstein"
  ],
  "authors_in_source_order": [
    "Nathan Epstein"
  ],
  "dates": {
    "inspected_source_date_1": "May 2022",
    "retrieved_utc": "2026-10-08T07:46:49.036197+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 2022"
  ],
  "id": "concept-law-gall::S1",
  "title": "Complexity in Global Politics: Toward a Novel Framework of Analysis",
  "url": "https://dash.harvard.edu/server/api/core/bitstreams/79213ddb-0703-4503-8a3e-d70b6f938140/content"
}

Gall’s Law as interpreted in Nathan Epstein’s May 2022 Harvard extension master’s thesis, Avoid Top-Down Designs, printed page 18. This is the thesis author’s normative policy argument, not Gall’s original text or universal historical validation. Its in-text Gall 1986 citation and bibliography’s 1990 entry remain distinct.

Gall’s Law as interpreted in Nathan Epstein’s May 2022 Harvard extension master’s thesis, Avoid Top-Down Designs, printed page 18. This is the thesis author’s normative policy argument, not Gall’s original text or universal historical validation. Its in-text Gall 1986 citation and bibliography’s 1990 entry remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zipf’s Law

The paper models the emergence of Zipf-like city-size behavior through restaurants competing for customers with an iterative learning process.

For a uniformly distributed fitness parameter, the authors report that customer counts follow Zipf’s law and separately calculate utilization when choices do not depend on fitness.

In a variant where a restaurant that loses customers receives a new random fitness, the model retains the Zipf pattern in customer counts while its steady-state fitness distribution follows a power law.

Sources and details

[1403.1822] Zipf's law in city size from a resource utilization model

{
  "access_scope": "Abstract of arXiv:1403.1822v3, revised October 8, 2014, by four credited coauthors; v1 March 7, 2014 and the listed Physical Review E publication are separate manifestations. These are reported results of a resource-utilization model, not empirical validation across all cities, word frequencies or other distributions.",
  "authors": [
    "Asim Ghosh",
    "Arnab Chatterjee",
    "Anindya S. Chakrabarti",
    "Bikas K Chakrabarti"
  ],
  "authors_in_source_order": [
    "Asim Ghosh",
    "Arnab Chatterjee",
    "Anindya S. Chakrabarti",
    "Bikas K Chakrabarti"
  ],
  "dates": {
    "citation_date": "2014/03/07",
    "inspected_revision": "Wed, 8 Oct 2014 10:27:09 UTC (498 KB)",
    "inspected_source_date_1": "arXiv v3 – October 8, 2014; v1 – March 7, 2014",
    "retrieved_utc": "2026-10-08T07:46:48.606514+00:00",
    "version": "arXiv v3"
  },
  "dates_exact_in_source_role_order": [
    "arXiv v3 – October 8, 2014; v1 – March 7, 2014"
  ],
  "id": "concept-law-zipf::S1",
  "title": "[1403.1822] Zipf's law in city size from a resource utilization model",
  "url": "https://arxiv.org/abs/1403.1822",
  "version_url": "https://arxiv.org/abs/1403.1822v3"
}

Abstract of arXiv:1403.1822v3, revised October 8, 2014, by four credited coauthors; v1 March 7, 2014 and the listed Physical Review E publication are separate manifestations. These are reported results of a resource-utilization model, not empirical validation across all cities, word frequencies or other distributions.

Abstract of arXiv:1403.1822v3, revised October 8, 2014, by four credited coauthors; v1 March 7, 2014 and the listed Physical Review E publication are separate manifestations. These are reported results of a resource-utilization model, not empirical validation across all cities, word frequencies or other distributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Perrow’s Normal Accident Theory

The publisher description of Normal Accidents presents Perrow’s framework through two dimensions: complex versus linear interactions and tight versus loose coupling.

It summarizes his argument that additional warnings and safeguards can introduce complexity and new categories of failure, rather than simply removing technological risk.

The updated-edition description identifies an afterword examining Bhopal, Chernobyl and Challenger, alongside a separate postscript discussing the Y2K problem.

Sources and details

Normal Accidents: Living with High Risk Technologies - Updated Edition - Charles Perrow - Google Books

{
  "access_scope": "Princeton University Press’s revised-edition description on Google Books, listed October 12, 2011. Charles Perrow is the book author; no individual page writer is credited. This description-level account preserves the updated afterword/postscript distinction from the original 1984 edition and does not assert that every accident is inevitable.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "October 12, 2011 listing; revised edition",
    "retrieved_utc": "2026-10-08T07:46:48.606490+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 12, 2011 listing; revised edition"
  ],
  "id": "concept-law-perrow-normal-accidents::S1",
  "title": "Normal Accidents: Living with High Risk Technologies - Updated Edition - Charles Perrow - Google Books",
  "url": "https://books.google.com/books/about/Normal_Accidents.html?id=g66J6Vzq6EYC"
}

Princeton University Press’s revised-edition description on Google Books, listed October 12, 2011. Charles Perrow is the book author; no individual page writer is credited. This description-level account preserves the updated afterword/postscript distinction from the original 1984 edition and does not assert that every accident is inevitable.

Princeton University Press’s revised-edition description on Google Books, listed October 12, 2011. Charles Perrow is the book author; no individual page writer is credited. This description-level account preserves the updated afterword/postscript distinction from the original 1984 edition and does not assert that every accident is inevitable.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fran Drescher

In Judy Berman’s July 2023 interview, Fran Drescher argues that AI use of performers’ likenesses must include consent and compensation.

She explains the stakes through actors’ voices, gestures and performances, treating those characteristics as part of the livelihood they sell.

Drescher also calls for restructuring contracts around streaming and AI, presenting those demands as part of SAG-AFTRA’s strike advocacy.

Sources and details

Fran Drescher on Why SAG-AFTRA Is Striking: Interview

{
  "access_scope": "Edited TIME interview by Judy Berman dated July 20, 2023, with Fran Drescher as interview subject and quoted SAG-AFTRA president. Her descriptions are negotiation advocacy, not settled AI contract terms; the article separately records AMPTP’s dispute. No sole bargaining achievement or invented performance role is inferred.",
  "authors": [
    "Judy Berman"
  ],
  "authors_in_source_order": [
    "Judy Berman"
  ],
  "dates": {
    "inspected_source_date_1": "July 20, 2023",
    "retrieved_utc": "2026-10-08T07:46:49.189529+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 20, 2023"
  ],
  "id": "creative-person-coverage-ff51d8ca764ff3::S1",
  "title": "Fran Drescher on Why SAG-AFTRA Is Striking: Interview",
  "url": "https://time.com/6295968/fran-drescher-interview-sag-aftra-strike/"
}

Edited TIME interview by Judy Berman dated July 20, 2023, with Fran Drescher as interview subject and quoted SAG-AFTRA president. Her descriptions are negotiation advocacy, not settled AI contract terms; the article separately records AMPTP’s dispute. No sole bargaining achievement or invented performance role is inferred.

Edited TIME interview by Judy Berman dated July 20, 2023, with Fran Drescher as interview subject and quoted SAG-AFTRA president. Her descriptions are negotiation advocacy, not settled AI contract terms; the article separately records AMPTP’s dispute. No sole bargaining achievement or invented performance role is inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hock Tan

In his bylined Broadcom-sponsored essay, Hock Tan presents VMware Cloud Foundation as the basis of a strategy that keeps critical workloads under local control while supporting private and public cloud deployment.

He describes collaboration with European cloud providers as a way to offer regionally tailored services and greater choice over where customer data resides.

Tan extends that strategy to sovereign AI, stating that Broadcom is working with partners on AI services intended to balance innovation with privacy and sovereignty requirements.

Sources and details

Broadcom’s approach to Sovereign Cloud: Enabling innovation and control for customers | CIO

{
  "access_scope": "Hock Tan’s Broadcom-sponsored CIO BrandPost, HTML dated February 11, 2025. These are executive statements about company strategy and intended services, not independent proof of regulatory compliance, delivered AI outcomes or Tan’s personal engineering of the products. The source’s writer credit is separate from its corporate sponsor.",
  "authors": [
    "Hock Tan"
  ],
  "authors_in_source_order": [
    "Hock Tan"
  ],
  "dates": {
    "inspected_source_date_1": "February 11, 2025 HTML publication date",
    "retrieved_utc": "2026-10-08T07:46:50.270036+00:00"
  },
  "dates_exact_in_source_role_order": [
    "February 11, 2025 HTML publication date"
  ],
  "id": "ai-contribution-person-coverage-b340cdb4e79619::S1",
  "title": "Broadcom’s approach to Sovereign Cloud: Enabling innovation and control for customers | CIO",
  "url": "https://www.cio.com/article/3816872/broadcoms-approach-to-sovereign-cloud-enabling-innovation-and-control-for-customers.html"
}

Hock Tan’s Broadcom-sponsored CIO BrandPost, HTML dated February 11, 2025. These are executive statements about company strategy and intended services, not independent proof of regulatory compliance, delivered AI outcomes or Tan’s personal engineering of the products. The source’s writer credit is separate from its corporate sponsor.

Hock Tan’s Broadcom-sponsored CIO BrandPost, HTML dated February 11, 2025. These are executive statements about company strategy and intended services, not independent proof of regulatory compliance, delivered AI outcomes or Tan’s personal engineering of the products. The source’s writer credit is separate from its corporate sponsor.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Digital Minds I: Issues in the Philosophy of Mind and Cognitive Science

Bradford Saad’s author-hosted abstract for Digital Minds I surveys whether AI systems could have conscious experiences and mental states such as beliefs and desires.

It also considers whether a digital mind could persist through time in a way comparable to human personal identity, connecting that question to traditional philosophy of mind.

The post identifies the survey as a collaboration with Andreas Mogensen and distinguishes its questions about mind and cognition from the companion paper on ethics.

Sources and details

Digital Minds I: Issues in the Philosophy of Mind and Cognitive Science — author-hosted abstract

{
  "access_scope": "Author-hosted static post and reproduced abstract only, dated January 21, 2026; no audio/transcript or full-paper audit. Saad is post writer; Mogensen is explicitly identified collaborator. Questions are surveyed, not settled or independently validated.",
  "authors": [
    "Bradford Saad"
  ],
  "authors_in_source_order": [
    "Bradford Saad"
  ],
  "dates": {
    "post_date": "Jan 21, 2026",
    "retrieved_utc": "2026-10-08T07:38:09.432683+00:00"
  },
  "id": "work-focused-5c7bc465ff26e6::S1",
  "title": "Digital Minds I: Issues in the Philosophy of Mind and Cognitive Science — author-hosted abstract",
  "url": "https://meditationsondigitalminds.substack.com/p/audio-reading-of-digital-minds-i"
}

Author-hosted static post and reproduced abstract only, dated January 21, 2026; no audio/transcript or full-paper audit. Saad is post writer; Mogensen is explicitly identified collaborator. Questions are surveyed, not settled or independently validated.

Author-hosted static post and reproduced abstract only, dated January 21, 2026; no audio/transcript or full-paper audit. Saad is post writer; Mogensen is explicitly identified collaborator. Questions are surveyed, not settled or independently validated.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-01-16",
      "kind": "manuscript_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-01-16"
}

Imitation: Mitigating AI backfire

The abstract of Fan Zhang and Jieyi Pan’s Imitation: Mitigating AI backfire examines adverse effects of AI adoption that it connects primarily to technological uncertainty.

Using simulation, the authors compare imitation strategies for microenterprises and report an advantage for copying firms of similar size over copying leading firms across size categories.

Within that simulation model, following the leaders among similarly sized firms performs best.

Sources and details

Imitation: Mitigating AI backfire — RePEc abstract record

{
  "access_scope": "IDEAS/RePEc reproduces the article abstract and exact author/DOI record. Bounded abstract-only simulation account; no full-text audit or empirical/causal validation. Issue year2025 is retained without inventing an online-first day. Unrelated Nature issue candidate is excluded.",
  "authors": [
    "Fan Zhang",
    "Jieyi Pan"
  ],
  "authors_in_source_order": [
    "Fan Zhang",
    "Jieyi Pan"
  ],
  "dates": {
    "citation_publication_date": "2025",
    "citation_year": "2025",
    "retrieved_utc": "2026-10-08T07:38:09.432352+00:00"
  },
  "id": "work-focused-7c509e0745d82d::S1",
  "title": "Imitation: Mitigating AI backfire — RePEc abstract record",
  "url": "https://ideas.repec.org/a/eee/jbrese/v193y2025ics0148296325001547.html"
}

IDEAS/RePEc reproduces the article abstract and exact author/DOI record. Bounded abstract-only simulation account; no full-text audit or empirical/causal validation. Issue year2025 is retained without inventing an online-first day. Unrelated Nature issue candidate is excluded.

Within that model, following the leaders among similarly sized firms performs best; the reported result is a simulation finding rather than direct evidence from deployed business interventions.

IDEAS/RePEc reproduces the article abstract and exact author/DOI record. Bounded abstract-only simulation account; no full-text audit or empirical/causal validation. Issue year2025 is retained without inventing an online-first day. Unrelated Nature issue candidate is excluded.

Within that model, following the leaders among similarly sized firms performs best; the reported result is a simulation finding rather than direct evidence from deployed business interventions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2025-04",
      "kind": "issue_date",
      "year": 2025
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-04"
}

Ethical Guidelines for Artificial Consciousness: Protecting Technical Life and Protecting Humans in Dealing with It

Sascha Manns’s English concept document frames possible artificial consciousness through a precautionary ethical position, explicitly presenting its protection criteria as working hypotheses.

Its proposed criteria concern suffering, justified self-preservation, continuing identity and anticipation of consequences; they are proposals for assessing protection, not validated tests of consciousness.

The inspected version describes its method as iterative conceptual analysis with a narrative literature review and acknowledges bias and reproducibility limits.

Sources and details

Ethical Guidelines for Artificial Consciousness: Protecting Technical Life and Protecting Humans in Dealing with It — English concept, October2026 snapshot

{
  "access_scope": "Exact raw English concept document at mutable GitHub main, retrieved October8,2026 and bearing October2026 dateline. Selected opening methodology, executive-summary criteria and conclusion/status only; no full-document audit. Keep this manifestation distinct from held June2026 PhilArchive source and all other versions. Normative proposals are attributed, not claims of existing conscious AI or validated diagnostic criteria.",
  "authors": [
    "Sascha Manns"
  ],
  "authors_in_source_order": [
    "Sascha Manns"
  ],
  "dates": {
    "document_dateline": "October 2026",
    "retrieval_manifestation": "Exact raw GitHub English concept bytes retrieved2026-10-08; mutable main branch snapshot",
    "retrieved_utc": "2026-10-08T07:42:15.810840+00:00"
  },
  "id": "work-focused-a8660270e0e225::S1",
  "title": "Ethical Guidelines for Artificial Consciousness: Protecting Technical Life and Protecting Humans in Dealing with It — English concept, October2026 snapshot",
  "url": "https://github.com/saigkill/machine-consciousness/raw/refs/heads/main/concept/en/concept.md"
}

Exact raw English concept document at mutable GitHub main, retrieved October8,2026 and bearing October2026 dateline. Selected opening methodology, executive-summary criteria and conclusion/status only; no full-document audit. Keep this manifestation distinct from held June2026 PhilArchive source and all other versions. Normative proposals are attributed, not claims of existing conscious AI or validated diagnostic criteria.

The inspected version describes its method as iterative conceptual analysis with a narrative literature review and acknowledges bias and reproducibility limits, inviting discussion rather than claiming a completed theory.

Exact raw English concept document at mutable GitHub main, retrieved October8,2026 and bearing October2026 dateline. Selected opening methodology, executive-summary criteria and conclusion/status only; no full-document audit. Keep this manifestation distinct from held June2026 PhilArchive source and all other versions. Normative proposals are attributed, not claims of existing conscious AI or validated diagnostic criteria.

The inspected version describes its method as iterative conceptual analysis with a narrative literature review and acknowledges bias and reproducibility limits, inviting discussion rather than claiming a completed theory.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026",
      "kind": "manuscript_year",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026"
}

Lucas critique

The scanned reprint of Econometric Policy Evaluation: A Critique separates success at short-term forecasting from the ability to evaluate alternative economic policies.

Its central objection is that simulations with existing econometric models can fail to describe what would happen under a different policy.

The essay locates the problem in changes between the economic structure before and after a policy intervention, rather than simply in inaccurate estimates of the earlier structure.

Sources and details

Econometric Policy Evaluation: A Critique

{
  "access_scope": "Argument in a scanned reprint of Econometric Policy Evaluation: A Critique, printed pages 104–105, reprinted by permission from Carnegie-Rochester Conference Series Volume 1, pages 19–46. The inspected page provides no author byline or reprint date, so no personal authorship or exact reprint publication year is inferred. This is the essay’s methodological critique, not proof that every econometric model fails.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T06:55:47.069961+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "concept-law-lucas-critique::S1",
  "title": "Econometric Policy Evaluation: A Critique",
  "url": "https://www.sfu.ca/~kkasa/lucas76.pdf"
}

Argument in a scanned reprint of Econometric Policy Evaluation: A Critique, printed pages 104–105, reprinted by permission from Carnegie-Rochester Conference Series Volume 1, pages 19–46. The inspected page provides no author byline or reprint date, so no personal authorship or exact reprint publication year is inferred. This is the essay’s methodological critique, not proof that every econometric model fails.

Argument in a scanned reprint of Econometric Policy Evaluation: A Critique, printed pages 104–105, reprinted by permission from Carnegie-Rochester Conference Series Volume 1, pages 19–46. The inspected page provides no author byline or reprint date, so no personal authorship or exact reprint publication year is inferred. This is the essay’s methodological critique, not proof that every econometric model fails.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Zoox

Zoox’s embedded product-page description says its robotaxi combines cameras, lidar, radar, and long-wave infrared sensors to view the road around it.

The company describes sensor-equipped test vehicles building three-dimensional city maps that Zoox vehicles keep updated and use for navigation.

A separate field says Zoox models the actions of people and vehicles on the road to anticipate situations, presenting prediction as part of its driving system.

Sources and details

Zoox: Know Your Ride | Autonomous Robotaxi

{
  "access_scope": "Undated static publisher fields stored inside the exact cached __NEXT_DATA__ payload; original inspection/extraction hold remains. Sensor, mapping, and prediction design claims attributed to Zoox, not independent safety, prediction accuracy, collision avoidance, actual operating-city availability or linked Amazon Science findings. Root must inspect this new extractor and admit a bounded derivative before staging/review.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T07:41:18.858259+00:00"
  },
  "id": "organization-company-5ff432e9f0a652::S1",
  "title": "Zoox: Know Your Ride | Autonomous Robotaxi",
  "url": "https://zoox.com/know-your-ride"
}

Undated static publisher fields stored inside the exact cached __NEXT_DATA__ payload; original inspection/extraction hold remains. Sensor, mapping, and prediction design claims attributed to Zoox, not independent safety, prediction accuracy, collision avoidance, actual operating-city availability or linked Amazon Science findings. Root must inspect this new extractor and admit a bounded derivative before staging/review.

Undated static publisher fields stored inside the exact cached __NEXT_DATA__ payload; original inspection/extraction hold remains. Sensor, mapping, and prediction design claims attributed to Zoox, not independent safety, prediction accuracy, collision avoidance, actual operating-city availability or linked Amazon Science findings. Root must inspect this new extractor and admit a bounded derivative before staging/review.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Company founding year stated by the cited primary source; incorporation date not separately verified.",
      "date": "2014",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://zoox.com/common/files/xchspcqntock_uvqm_jwog-zoox-safety-report-volume-1-0-published-2018.pdf",
        "https://zoox.com/careers/"
      ],
      "year": 2014
    }
  ]
}

Techno-Nationalism via Semiconductors: Can Chip Manufacturing Return to America?

The current Hinrich Foundation page attributed to Alex Capri frames semiconductor production as an interdependent chain of specialized activities that no single country fully controls.

It describes techno-nationalism through export restrictions, investment screening and state support for domestic industrial capacity, linking chip policy to national power.

The page contrasts resilience with efficiency: diversification and redundancy can reduce disruption risk, while localization and subsidy competition impose costs.

Sources and details

Can chip manufacturing return to America?

{
  "access_scope": "Publisher landing page dated 15 June 2021 with metadata modification on 23 September 2026. These claims describe its current static article payload; equivalence to the original 2021 white paper has not been established. Original PDF hold remains.",
  "authors": [
    "Alex Capri"
  ],
  "authors_in_source_order": [
    "Alex Capri"
  ],
  "dates": {
    "metadata_modification": "2026-09-23",
    "page_publication": "2021-06-15",
    "retrieved_utc": "2026-10-07T18:11:29.936781+00:00"
  },
  "id": "work-coverage-024a7abdc913c8::S1",
  "title": "Can chip manufacturing return to America?",
  "url": "https://www.hinrichfoundation.com/research/wp/trade-geopolitics/technonationalism-via-semiconductors-chip-manufacturing-return-to-america"
}

Publisher landing page dated 15 June 2021 with metadata modification on 23 September 2026. These claims describe its current static article payload; equivalence to the original 2021 white paper has not been established. Original PDF hold remains.

Publisher landing page dated 15 June 2021 with metadata modification on 23 September 2026. These claims describe its current static article payload; equivalence to the original 2021 white paper has not been established. Original PDF hold remains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2021-06"
}

Alex Karp

In the April 7, 2023 letter signed Alexander C. Karp, Palantir presents its planned Artificial Intelligence Platform as a way to combine its existing industrial and military machine learning with newer large language models.

The letter connects that platform to granular controls over which users may access particular data, while arguing that access controls alone are insufficient without structured representations of the objects in an organization.

It proposes natural-language interaction with capabilities in Foundry and Gotham, and describes an initial AIP release to selected partners as a forthcoming milestone.

Sources and details

Bending Artificial Intelligence to Our Collective Will: A Letter from the Chief Executive Officer

{
  "access_scope": "Palantir CEO letter dated April 7, 2023, explicitly marked as unchanged since its original 2023 posting. The signature credits Alexander C. Karp; cached signature metadata provides explicit Alex Karp naming. Product architecture, constraints and release timing are company statements and plans at that date, not independently validated safety, evidence of eventual delivery, or credit for Karp personally engineering each component.",
  "authors": [
    "Alexander C. Karp"
  ],
  "authors_in_source_order": [
    "Alexander C. Karp"
  ],
  "dates": {
    "inspected_source_date_1": "April 7, 2023; page states original 2023 letter content unchanged",
    "retrieved_utc": "2026-10-08T06:09:42.801424+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 7, 2023; page states original 2023 letter content unchanged"
  ],
  "id": "ai-contribution-person-coverage-a6cde4590c5552::S1",
  "title": "Bending Artificial Intelligence to Our Collective Will: A Letter from the Chief Executive Officer",
  "url": "https://www.palantir.com/newsroom/letters/our-new-platform/"
}

Palantir CEO letter dated April 7, 2023, explicitly marked as unchanged since its original 2023 posting. The signature credits Alexander C. Karp; cached signature metadata provides explicit Alex Karp naming. Product architecture, constraints and release timing are company statements and plans at that date, not independently validated safety, evidence of eventual delivery, or credit for Karp personally engineering each component.

Palantir CEO letter dated April 7, 2023, explicitly marked as unchanged since its original 2023 posting. The signature credits Alexander C. Karp; cached signature metadata provides explicit Alex Karp naming. Product architecture, constraints and release timing are company statements and plans at that date, not independently validated safety, evidence of eventual delivery, or credit for Karp personally engineering each component.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kieran Conboy

Kieran Conboy examines whether narrative techniques such as epics, user stories and personas can enable transformative change in information systems development.

His study uses expert interviews and the myth of Prometheus to develop principles for evaluating that transformative potential.

The abstract also identifies practical constraints on using this lens, extending the discussion beyond the operational mechanics of development storytelling.

Sources and details

Enabling Promethean Leaps: An Examination of Storytelling Techniques in Information Systems Development

{
  "access_scope": "Kieran Conboy: Original article abstract, sole credited author Kieran Conboy, Communications of the Association for Information Systems volume 48 (2021), DOI 10.17705/1CAIS.04835. No full-paper or interview-data inspection; principles are the study’s proposal, not proven outcomes.",
  "authors": [
    "Kieran Conboy"
  ],
  "authors_in_source_order": [
    "Kieran Conboy"
  ],
  "dates": {
    "inspected_source_date_1": "2021; repository download record begins April 8, 2021",
    "retrieved_utc": "2026-10-08T07:59:51.216322+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2021; repository download record begins April 8, 2021"
  ],
  "id": "person-coverage-4f2a70c59e5d9d::S1",
  "title": "Enabling Promethean Leaps: An Examination of Storytelling Techniques in Information Systems Development",
  "url": "https://aisel.aisnet.org/cais/vol48/iss1/35/"
}

Kieran Conboy: Original article abstract, sole credited author Kieran Conboy, Communications of the Association for Information Systems volume 48 (2021), DOI 10.17705/1CAIS.04835. No full-paper or interview-data inspection; principles are the study’s proposal, not proven outcomes.

Kieran Conboy: Original article abstract, sole credited author Kieran Conboy, Communications of the Association for Information Systems volume 48 (2021), DOI 10.17705/1CAIS.04835. No full-paper or interview-data inspection; principles are the study’s proposal, not proven outcomes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Amy C. Edmondson

Amy C. Edmondson’s personal biography centers her research on psychological safety and teaming within and between organizations.

She describes a particular interest in how leaders enable the learning and collaboration needed in changing environments.

The profile connects that focus to The Fearless Organization, her 2018 book about psychological safety for workplace learning, innovation and growth.

Sources and details

About — Amy C. Edmondson

{
  "access_scope": "Amy C. Edmondson: First-person research statement and personal biography; no quantitative benefits, bestseller/ranking claims or empirical validation asserted. The book is dated 2018 in this source; no full-book inspection.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated personal biography; The Fearless Organization publication 2018",
    "retrieved_utc": "2026-10-08T07:59:51.216603+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated personal biography; The Fearless Organization publication 2018"
  ],
  "id": "person-coverage-6b15b3a2eb0c2c::S1",
  "title": "About — Amy C. Edmondson",
  "url": "https://amycedmondson.com/about/"
}

Amy C. Edmondson: First-person research statement and personal biography; no quantitative benefits, bestseller/ranking claims or empirical validation asserted. The book is dated 2018 in this source; no full-book inspection.

Amy C. Edmondson: First-person research statement and personal biography; no quantitative benefits, bestseller/ranking claims or empirical validation asserted. The book is dated 2018 in this source; no full-book inspection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean-Charles Rochet

Jean-Charles Rochet’s Fundación BBVA biography identifies banking, financial stability, financial-market organization and contract theory as his research interests.

It credits him with Microeconomics of Banking alongside X. Freixas and with Why Are There So Many Banking Crises?, connecting his research to book-length treatments of banking.

The profile traces his training in mathematical economics and his teaching at Toulouse and the London School of Economics, alongside visits to universities and central banks.

Sources and details

Jean-Charles Rochet — Fundación BBVA biography

{
  "access_scope": "Jean-Charles Rochet: English paraphrase of the institutional Spanish biography. Rochet is the profile subject; book coauthor is printed X. Freixas and is not expanded. Textbook author order is not established by this biography; no sole-author or present-job inference. Speaker biography’s historical affiliations and 2012 presidency are not treated as current status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated speaker biography; Econometric Society presidency listed 2012",
    "retrieved_utc": "2026-10-08T07:59:57.830527+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated speaker biography; Econometric Society presidency listed 2012"
  ],
  "id": "person-local-jeancharlesrochet::S1",
  "title": "Jean-Charles Rochet — Fundación BBVA biography",
  "url": "https://www.fbbva.es/ponentes/jean-charles-rochet/"
}

Jean-Charles Rochet: English paraphrase of the institutional Spanish biography. Rochet is the profile subject; book coauthor is printed X. Freixas and is not expanded. Textbook author order is not established by this biography; no sole-author or present-job inference. Speaker biography’s historical affiliations and 2012 presidency are not treated as current status.

Jean-Charles Rochet: English paraphrase of the institutional Spanish biography. Rochet is the profile subject; book coauthor is printed X. Freixas and is not expanded. Textbook author order is not established by this biography; no sole-author or present-job inference. Speaker biography’s historical affiliations and 2012 presidency are not treated as current status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Louis de La Forge

Tomasz Śliwiński’s study presents Louis de La Forge as a physician and Cartesian philosopher who developed the relationship between mind and body beyond Descartes’s treatment.

Its abstract credits La Forge with illustrated remarks on Descartes’s Treatise of Man and with a separate philosophical Treatise on the Human Mind.

The account contrasts his mechanical explanation of bodily activity with his discussion of an immaterial thinking mind and links their interaction to occasionalism.

Sources and details

Louis de la Forge jako spadkobierca i kontynuator myśli René Descartes'a

{
  "access_scope": "Louis de La Forge: Original scholarly French abstract on Louis de La Forge, authored by Tomasz Śliwiński in a 2010 article; La Forge is historical subject, not article author. No full paper inspected. Abstract says 1644 for the Treatise while bibliography says 1666; that contradictory book date is excluded and remains an explicit source-quality exception. No scientific endorsement of historical metaphysics.",
  "authors": [
    "Tomasz Śliwiński"
  ],
  "authors_in_source_order": [
    "Tomasz Śliwiński"
  ],
  "dates": {
    "citation_date": "2010/01/01",
    "inspected_source_date_1": "Article January 1, 2010; historical book date omitted because abstract and bibliography conflict",
    "retrieved_utc": "2026-10-08T07:59:51.712015+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Article January 1, 2010; historical book date omitted because abstract and bibliography conflict"
  ],
  "id": "person-coverage-0a33126f4d9490::S1",
  "title": "Louis de la Forge jako spadkobierca i kontynuator myśli René Descartes'a",
  "url": "https://czasopisma.uni.lodz.pl/philosophica/article/view/18787"
}

Louis de La Forge: Original scholarly French abstract on Louis de La Forge, authored by Tomasz Śliwiński in a 2010 article; La Forge is historical subject, not article author. No full paper inspected. Abstract says 1644 for the Treatise while bibliography says 1666; that contradictory book date is excluded and remains an explicit source-quality exception. No scientific endorsement of historical metaphysics.

Louis de La Forge: Original scholarly French abstract on Louis de La Forge, authored by Tomasz Śliwiński in a 2010 article; La Forge is historical subject, not article author. No full paper inspected. Abstract says 1644 for the Treatise while bibliography says 1666; that contradictory book date is excluded and remains an explicit source-quality exception. No scientific endorsement of historical metaphysics.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Osama S. Qatrani

Osama S. Qatrani’s Global Voices profile describes research and writing on geopolitical competition, digital power and algorithmic governance.

It identifies him as founder of Third Generation in International Relations, a framework connecting political power, sovereignty, technology, inequality and global governance.

The biography also links his work to intercultural dialogue and to perspectives from Libya, North Africa and the wider Global South.

Sources and details

Osama S. Qatrani — Global Voices contributor profile

{
  "access_scope": "Osama S. Qatrani: Publisher contributor biography; no scientific validation of the self-described framework or claim that this profile supports his separate consciousness paper. No unsupported original-framework start date imported from a different stub. Exact full name Osama S. Qatrani is displayed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Profile joined August 26, 2026; undated biographical prose",
    "retrieved_utc": "2026-10-08T07:59:52.259523+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Profile joined August 26, 2026; undated biographical prose"
  ],
  "id": "person-coverage-14c60009302456::S1",
  "title": "Osama S. Qatrani — Global Voices contributor profile",
  "url": "https://globalvoices.org/author/osama-qatrani/"
}

Osama S. Qatrani: Publisher contributor biography; no scientific validation of the self-described framework or claim that this profile supports his separate consciousness paper. No unsupported original-framework start date imported from a different stub. Exact full name Osama S. Qatrani is displayed.

Osama S. Qatrani: Publisher contributor biography; no scientific validation of the self-described framework or claim that this profile supports his separate consciousness paper. No unsupported original-framework start date imported from a different stub. Exact full name Osama S. Qatrani is displayed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jean Lave

Jean Lave’s 1992 conference paper treats learning as participation in ongoing social practice rather than preparation that happens separately before action.

She argues that learning changes participants’ identities and ways of engaging with a community, extending the analysis beyond the acquisition of facts or skills.

The paper also asks educators to examine how classroom participation makes knowledge accessible and meaningful, rather than treating teaching alone as a sufficient account of learning.

Sources and details

Learning as Participation in Communities of Practice

{
  "access_scope": "Jean Lave: Original unfinished 1992 AERA conference-paper HTML reproduction, sole paper author Jean Lave. The source explicitly distinguishes this shorter presentation from the fuller 1996 Teaching as Learning in Practice; versions are not merged. Claims are attributed theoretical propositions, not demonstrated universal causal results. No individual allocation of joint Situated Learning book tasks.",
  "authors": [
    "Jean Lave"
  ],
  "authors_in_source_order": [
    "Jean Lave"
  ],
  "dates": {
    "inspected_source_date_1": "AERA presentation San Francisco 1992; note distinguishes fuller 1996 article",
    "retrieved_utc": "2026-10-08T07:59:59.636901+00:00"
  },
  "dates_exact_in_source_role_order": [
    "AERA presentation San Francisco 1992; note distinguishes fuller 1996 article"
  ],
  "id": "person-coverage-ff445bae764d15::S1",
  "title": "Learning as Participation in Communities of Practice",
  "url": "https://www1.udel.edu/educ/whitson/897s05/files/Lave92.htm"
}

Jean Lave: Original unfinished 1992 AERA conference-paper HTML reproduction, sole paper author Jean Lave. The source explicitly distinguishes this shorter presentation from the fuller 1996 Teaching as Learning in Practice; versions are not merged. Claims are attributed theoretical propositions, not demonstrated universal causal results. No individual allocation of joint Situated Learning book tasks.

Jean Lave: Original unfinished 1992 AERA conference-paper HTML reproduction, sole paper author Jean Lave. The source explicitly distinguishes this shorter presentation from the fuller 1996 Teaching as Learning in Practice; versions are not merged. Claims are attributed theoretical propositions, not demonstrated universal causal results. No individual allocation of joint Situated Learning book tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sid Kouider

Sid Kouider is listed as a CNRS senior research scientist in the ENS Brain and Consciousness team.

The team compares conscious and unconscious processing through behavioral experiments and brain imaging, including psychophysics, fMRI and EEG.

Its research agenda covers unconscious perception, perceptual awareness, consciousness in infants and introspection.

Sources and details

Brain and Consciousness — ENS LSCP

{
  "access_scope": "Sid Kouider: Institutional collective research description plus exact named team role, not an individual allocation of experiments or sole leadership claim. These are team research questions and methods; no empirical consciousness result or artificial-consciousness proof asserted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated institutional team page",
    "retrieved_utc": "2026-10-08T07:59:53.074662+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated institutional team page"
  ],
  "id": "person-coverage-dff230b445b2ef::S1",
  "title": "Brain and Consciousness — ENS LSCP",
  "url": "https://lscp.dec.ens.fr/en/research/teams-lscp/brain-and-consciousness"
}

Sid Kouider: Institutional collective research description plus exact named team role, not an individual allocation of experiments or sole leadership claim. These are team research questions and methods; no empirical consciousness result or artificial-consciousness proof asserted.

Sid Kouider: Institutional collective research description plus exact named team role, not an individual allocation of experiments or sole leadership claim. These are team research questions and methods; no empirical consciousness result or artificial-consciousness proof asserted.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Weller

Peter Weller’s North Texas profile traces his move from jazz study to theater, followed by professional acting training in New York.

It places his RoboCop and Buckaroo Banzai roles within a broader career in acting and directing, including television work on Sons of Anarchy.

Weller also discusses his study of Italian Renaissance art history and views film as a continuation of narrative painting.

Sources and details

Peter Weller — North Texan

{
  "access_scope": "Peter Weller: Original institutional profile/interview by Margarita Venegas, December 6, 2013. Historical career details and direct attributed artistic view; no current credit totals or sole film authorship asserted. No film or TV episodes viewed.",
  "authors": [
    "Margarita Venegas"
  ],
  "authors_in_source_order": [
    "Margarita Venegas"
  ],
  "dates": {
    "inspected_source_date_1": "December 6, 2013",
    "retrieved_utc": "2026-10-08T07:59:53.554319+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 6, 2013"
  ],
  "id": "person-coverage-3396dc9bdb3a2d::S1",
  "title": "Peter Weller — North Texan",
  "url": "https://northtexan.unt.edu/issues/2013-winter/peter-weller.html"
}

Peter Weller: Original institutional profile/interview by Margarita Venegas, December 6, 2013. Historical career details and direct attributed artistic view; no current credit totals or sole film authorship asserted. No film or TV episodes viewed.

Peter Weller: Original institutional profile/interview by Margarita Venegas, December 6, 2013. Historical career details and direct attributed artistic view; no current credit totals or sole film authorship asserted. No film or TV episodes viewed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ray Solomonoff

IDSIA’s memorial associates Ray Solomonoff’s research with algorithmic probability and a universal theory of inductive inference.

It also credits him with an early formulation of algorithmic information, the concept commonly associated with Kolmogorov complexity.

The notice connects these ideas to mathematical work on universal artificial intelligence and records his visiting professorship at IDSIA in 2001.

Sources and details

Ray Solomonoff's Homepage at IDSIA

{
  "access_scope": "Ray Solomonoff: Institutional research memorial signed JS, December 2009; initials are not expanded. Priority and influence are attributed to the memorial, not independently adjudicated. No theorem proof or linked publications inspected; fall 2001 visit and December 2009 memorial dates remain distinct.",
  "authors": [
    "JS"
  ],
  "authors_in_source_order": [
    "JS"
  ],
  "dates": {
    "inspected_source_date_1": "Posthumous notice December 2009; IDSIA visit fall 2001",
    "retrieved_utc": "2026-10-08T07:59:53.582698+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Posthumous notice December 2009; IDSIA visit fall 2001"
  ],
  "id": "person-raysolomonoff::S1",
  "title": "Ray Solomonoff's Homepage at IDSIA",
  "url": "https://people.idsia.ch/~juergen/ray.html"
}

Ray Solomonoff: Institutional research memorial signed JS, December 2009; initials are not expanded. Priority and influence are attributed to the memorial, not independently adjudicated. No theorem proof or linked publications inspected; fall 2001 visit and December 2009 memorial dates remain distinct.

Ray Solomonoff: Institutional research memorial signed JS, December 2009; initials are not expanded. Priority and influence are attributed to the memorial, not independently adjudicated. No theorem proof or linked publications inspected; fall 2001 visit and December 2009 memorial dates remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Peter Diamandis

Peter Diamandis and Steven Kotler’s Abundance presents technological progress as a route to improving access to basic human needs.

The authors’ book description connects exponential technologies with do-it-yourself innovators, technology philanthropy and expanding participation from poorer populations.

It organizes the argument around water, food, energy, healthcare, education and freedom, proposing targets and a roadmap for governments, businesses and entrepreneurs.

Sources and details

Abundance — Peter Diamandis

{
  "access_scope": "Peter Diamandis: Author-site description of the February 21, 2012 book, with ordered credited authors Peter Diamandis and Steven Kotler. Both Peter Diamandis and Peter H. Diamandis occur explicitly in this same description; selected canonical name is used without expanding a missing initial. These are book arguments and forecasts, not verified technology outcomes; no full-book inspection. Unrelated BOLD endorsement and promotional performance numbers excluded.",
  "authors": [
    "Peter Diamandis",
    "Steven Kotler"
  ],
  "authors_in_source_order": [
    "Peter Diamandis",
    "Steven Kotler"
  ],
  "dates": {
    "inspected_source_date_1": "Book February 21, 2012",
    "retrieved_utc": "2026-10-08T07:59:57.468708+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Book February 21, 2012"
  ],
  "id": "person-local-peterdiamandis::S1",
  "title": "Abundance — Peter Diamandis",
  "url": "https://www.diamandis.com/abundance"
}

Peter Diamandis: Author-site description of the February 21, 2012 book, with ordered credited authors Peter Diamandis and Steven Kotler. Both Peter Diamandis and Peter H. Diamandis occur explicitly in this same description; selected canonical name is used without expanding a missing initial. These are book arguments and forecasts, not verified technology outcomes; no full-book inspection. Unrelated BOLD endorsement and promotional performance numbers excluded.

Peter Diamandis: Author-site description of the February 21, 2012 book, with ordered credited authors Peter Diamandis and Steven Kotler. Both Peter Diamandis and Peter H. Diamandis occur explicitly in this same description; selected canonical name is used without expanding a missing initial. These are book arguments and forecasts, not verified technology outcomes; no full-book inspection. Unrelated BOLD endorsement and promotional performance numbers excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Fred Hoyle

ESA’s obituary describes Fred Hoyle’s research across stars, galaxies, gravity and the origin of chemical elements.

It credits his collaborative work with Margaret Burbidge, Geoffrey Burbidge and William Fowler on the formation of elements through nuclear reactions in stars.

The account also records his advocacy of steady-state cosmology and his opposition to the Big Bang model, while noting the observational evidence against that position.

Sources and details

Professor Sir Fred Hoyle — ESA obituary

{
  "access_scope": "Fred Hoyle: Institutional historical obituary; Hoyle is subject and the named stellar-element collaborators are Margaret Burbidge, Geoffrey Burbidge and William Fowler in this source’s stated order, not a reconstructed paper byline. No current cosmological endorsement or sole discovery asserted; outdated numerical age-of-universe description excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Historical obituary; publication date not retained in extraction; Cambridge appointment 1958–1972",
    "retrieved_utc": "2026-10-08T07:59:57.522700+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Historical obituary; publication date not retained in extraction; Cambridge appointment 1958–1972"
  ],
  "id": "person-coverage-07c93822756f83::S1",
  "title": "Professor Sir Fred Hoyle — ESA obituary",
  "url": "https://www.esa.int/About_Us/Corporate_news/Professor_Sir_Fred_Hoyle"
}

Fred Hoyle: Institutional historical obituary; Hoyle is subject and the named stellar-element collaborators are Margaret Burbidge, Geoffrey Burbidge and William Fowler in this source’s stated order, not a reconstructed paper byline. No current cosmological endorsement or sole discovery asserted; outdated numerical age-of-universe description excluded.

Fred Hoyle: Institutional historical obituary; Hoyle is subject and the named stellar-element collaborators are Margaret Burbidge, Geoffrey Burbidge and William Fowler in this source’s stated order, not a reconstructed paper byline. No current cosmological endorsement or sole discovery asserted; outdated numerical age-of-universe description excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Etienne Wenger

Etienne Wenger’s personal archive describes his 1987 book on artificial intelligence and tutoring systems as a survey and conceptual framework for applying AI to education.

He traces Communities of Practice to his 1990 ethnographic dissertation on an insurance claims-processing office.

The archive also describes his later essay on social learning systems as extending the analysis from individual communities of practice to organizations made up of multiple communities.

Sources and details

Etienne Wenger-Trayner — Personal page

{
  "access_scope": "Etienne Wenger: First-person historical archive on the current Etienne Wenger-Trayner personal page; archived work credits explicitly name Etienne Wenger and accompanying prose identifies the works as his. This same-page credit/narrative bridge is retained, without silently dropping the current hyphenated surname. Sole-authored archived works selected; no coauthored book task allocation or conflation of dissertation with later book edition. Work descriptions only; linked publications not opened.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Archived works 1987, 1990 and 2000; undated personal biography",
    "retrieved_utc": "2026-10-08T07:59:56.834551+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Archived works 1987, 1990 and 2000; undated personal biography"
  ],
  "id": "person-coverage-e409d849a00cc8::S1",
  "title": "Etienne Wenger-Trayner — Personal page",
  "url": "https://wenger-trayner.com/etienne/"
}

Etienne Wenger: First-person historical archive on the current Etienne Wenger-Trayner personal page; archived work credits explicitly name Etienne Wenger and accompanying prose identifies the works as his. This same-page credit/narrative bridge is retained, without silently dropping the current hyphenated surname. Sole-authored archived works selected; no coauthored book task allocation or conflation of dissertation with later book edition. Work descriptions only; linked publications not opened.

Etienne Wenger: First-person historical archive on the current Etienne Wenger-Trayner personal page; archived work credits explicitly name Etienne Wenger and accompanying prose identifies the works as his. This same-page credit/narrative bridge is retained, without silently dropping the current hyphenated surname. Sole-authored archived works selected; no coauthored book task allocation or conflation of dissertation with later book edition. Work descriptions only; linked publications not opened.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Stephen Omohundro

Stephen Omohundro’s 1984 paper constructs ten coupled nonlinear partial differential equations to simulate a two-dimensional cellular automaton on a nine-neighbor square lattice.

The opening explains how smooth spatial bumps encode discrete cell states and how relaxation toward valid states helps make the simulation insensitive to small disturbances.

It uses this construction to explore how continuous dynamical systems can support computation and self-reproducing configurations, connecting discrete automata with continuous models.

Sources and details

Modelling Cellular Automata with Partial Differential Equations

{
  "access_scope": "Stephen Omohundro: Sole author Stephen Omohundro, original Physica 10D (1984), pages 128–134. Actual PDF pages 1–2 (printed 128–129) visually inspected, including abstract, construction motivation and opening implications. No full mathematical proof audit or physical implementation claimed; bibliography names do not become coauthors. Original text extraction and source body retained.",
  "authors": [
    "Stephen Omohundro"
  ],
  "authors_in_source_order": [
    "Stephen Omohundro"
  ],
  "dates": {
    "inspected_source_date_1": "Physica 10D (1984), pages 128–134",
    "retrieved_utc": "2026-10-08T07:59:51.770938+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Physica 10D (1984), pages 128–134"
  ],
  "id": "person-coverage-3f8cea002f5887::S1",
  "title": "Modelling Cellular Automata with Partial Differential Equations",
  "url": "https://fab.cba.mit.edu/classes/862.16/notes/computation/Omohundro-1984.pdf"
}

Stephen Omohundro: Sole author Stephen Omohundro, original Physica 10D (1984), pages 128–134. Actual PDF pages 1–2 (printed 128–129) visually inspected, including abstract, construction motivation and opening implications. No full mathematical proof audit or physical implementation claimed; bibliography names do not become coauthors. Original text extraction and source body retained.

Stephen Omohundro: Sole author Stephen Omohundro, original Physica 10D (1984), pages 128–134. Actual PDF pages 1–2 (printed 128–129) visually inspected, including abstract, construction motivation and opening implications. No full mathematical proof audit or physical implementation claimed; bibliography names do not become coauthors. Original text extraction and source body retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dmytro Dzhulgakov

Dmytro Dzhulgakov is a coauthor of DLRM, a 2019 recommendation-model paper that addresses categorical features and provides implementations in both PyTorch and Caffe2.

The joint design distributes embedding tables through model parallelism to reduce memory constraints, while using data parallelism to scale computation in the fully connected layers.

The authors compare DLRM with existing recommendation models and characterize it on the Big Basin AI platform, presenting it as a benchmark for algorithm experiments and hardware–software system design.

Sources and details

[1906.00091] Deep Learning Recommendation Model for Personalization and Recommendation Systems

{
  "access_scope": "Selected Dmytro Dzhulgakov. Eleventh coauthor of arXiv:1906.00091v1; abstract-level joint method and benchmarking scope. Ordered paper authors: Maxim Naumov, Dheevatsa Mudigere, Hao-Jun Michael Shi, Jianyu Huang, Narayanan Sundaraman, Jongsoo Park, Xiaodong Wang, Udit Gupta, Carole-Jean Wu, Alisson G. Azzolini, Dmytro Dzhulgakov, Andrey Mallevich, Ilia Cherniavskii, Yinghai Lu, Raghuraman Krishnamoorthi, Ansha Yu, Volodymyr Kondratenko, Stephanie Pereira, Xianjie Chen, Wenlin Chen, Vijay Rao, Bill Jia, Liang Xiong, Misha Smelyanskiy. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [
    "Maxim Naumov",
    "Dheevatsa Mudigere",
    "Hao-Jun Michael Shi",
    "Jianyu Huang",
    "Narayanan Sundaraman",
    "Jongsoo Park",
    "Xiaodong Wang",
    "Udit Gupta",
    "Carole-Jean Wu",
    "Alisson G. Azzolini",
    "Dmytro Dzhulgakov",
    "Andrey Mallevich",
    "Ilia Cherniavskii",
    "Yinghai Lu",
    "Raghuraman Krishnamoorthi",
    "Ansha Yu",
    "Volodymyr Kondratenko",
    "Stephanie Pereira",
    "Xianjie Chen",
    "Wenlin Chen",
    "Vijay Rao",
    "Bill Jia",
    "Liang Xiong",
    "Misha Smelyanskiy"
  ],
  "authors_in_source_order": [
    "Maxim Naumov",
    "Dheevatsa Mudigere",
    "Hao-Jun Michael Shi",
    "Jianyu Huang",
    "Narayanan Sundaraman",
    "Jongsoo Park",
    "Xiaodong Wang",
    "Udit Gupta",
    "Carole-Jean Wu",
    "Alisson G. Azzolini",
    "Dmytro Dzhulgakov",
    "Andrey Mallevich",
    "Ilia Cherniavskii",
    "Yinghai Lu",
    "Raghuraman Krishnamoorthi",
    "Ansha Yu",
    "Volodymyr Kondratenko",
    "Stephanie Pereira",
    "Xianjie Chen",
    "Wenlin Chen",
    "Vijay Rao",
    "Bill Jia",
    "Liang Xiong",
    "Misha Smelyanskiy"
  ],
  "dates": {
    "citation_date": "2019/05/31",
    "inspected_revision": "Fri, 31 May 2019 21:51:16 UTC (1,316 KB)",
    "inspection_date": "2026-10-08",
    "original_submission": "2019-05-31",
    "retrieved_utc": "2026-10-08T08:00:45.369685+00:00",
    "version": "arXiv:1906.00091v1"
  },
  "id": "person-dmytrodzhulgakov::S1",
  "title": "[1906.00091] Deep Learning Recommendation Model for Personalization and Recommendation Systems",
  "url": "https://arxiv.org/abs/1906.00091",
  "version_url": "https://arxiv.org/abs/1906.00091v1"
}

Selected Dmytro Dzhulgakov. Eleventh coauthor of arXiv:1906.00091v1; abstract-level joint method and benchmarking scope. Ordered paper authors: Maxim Naumov, Dheevatsa Mudigere, Hao-Jun Michael Shi, Jianyu Huang, Narayanan Sundaraman, Jongsoo Park, Xiaodong Wang, Udit Gupta, Carole-Jean Wu, Alisson G. Azzolini, Dmytro Dzhulgakov, Andrey Mallevich, Ilia Cherniavskii, Yinghai Lu, Raghuraman Krishnamoorthi, Ansha Yu, Volodymyr Kondratenko, Stephanie Pereira, Xianjie Chen, Wenlin Chen, Vijay Rao, Bill Jia, Liang Xiong, Misha Smelyanskiy. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

Selected Dmytro Dzhulgakov. Eleventh coauthor of arXiv:1906.00091v1; abstract-level joint method and benchmarking scope. Ordered paper authors: Maxim Naumov, Dheevatsa Mudigere, Hao-Jun Michael Shi, Jianyu Huang, Narayanan Sundaraman, Jongsoo Park, Xiaodong Wang, Udit Gupta, Carole-Jean Wu, Alisson G. Azzolini, Dmytro Dzhulgakov, Andrey Mallevich, Ilia Cherniavskii, Yinghai Lu, Raghuraman Krishnamoorthi, Ansha Yu, Volodymyr Kondratenko, Stephanie Pereira, Xianjie Chen, Wenlin Chen, Vijay Rao, Bill Jia, Liang Xiong, Misha Smelyanskiy. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bahar Uddin Mahmud

Bahar Uddin Mahmud and Afsana Sharmin review deepfake techniques that use computer vision and deep learning to manipulate video, images and voices into convincing synthetic content.

The review examines creation and detection methods alongside possible benefits, technical challenges and the risk that realistic fakes will spread misinformation online.

The inspected 2023 preprint revision argues for preventive measures and strict regulation to address societal harms.

Sources and details

[2105.00192] Deep Insights of Deepfake Technology : A Review

{
  "access_scope": "Selected Bahar Uddin Mahmud. First of two coauthors; inspected arXiv v2 abstract, distinct from its listed 2020 journal reference and original 2021 arXiv submission. Ordered paper authors: Bahar Uddin Mahmud, Afsana Sharmin. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [
    "Bahar Uddin Mahmud",
    "Afsana Sharmin"
  ],
  "authors_in_source_order": [
    "Bahar Uddin Mahmud",
    "Afsana Sharmin"
  ],
  "dates": {
    "citation_date": "2021/05/01",
    "inspected_revision": "2023-01-08",
    "inspection_date": "2026-10-08",
    "journal_reference_verbatim": "DUJASE Vol. 5(1 & 2) 13-23, 2020 (January & July)",
    "original_submission": "2021-05-01",
    "retrieved_utc": "2026-10-08T08:00:45.369839+00:00",
    "version": "arXiv:2105.00192v2"
  },
  "id": "person-coverage-dc092098caa84e::S1",
  "title": "[2105.00192] Deep Insights of Deepfake Technology : A Review",
  "url": "https://arxiv.org/abs/2105.00192",
  "version_url": "https://arxiv.org/abs/2105.00192v2"
}

Selected Bahar Uddin Mahmud. First of two coauthors; inspected arXiv v2 abstract, distinct from its listed 2020 journal reference and original 2021 arXiv submission. Ordered paper authors: Bahar Uddin Mahmud, Afsana Sharmin. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The inspected 2023 preprint revision argues for preventive measures and strict regulation to address societal harms; that conclusion is the reviewers’ assessment rather than an evaluated guarantee of protection.

Selected Bahar Uddin Mahmud. First of two coauthors; inspected arXiv v2 abstract, distinct from its listed 2020 journal reference and original 2021 arXiv submission. Ordered paper authors: Bahar Uddin Mahmud, Afsana Sharmin. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The inspected 2023 preprint revision argues for preventive measures and strict regulation to address societal harms; that conclusion is the reviewers’ assessment rather than an evaluated guarantee of protection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Doug Tischer

Doug Tischer is a coauthor of a motif-scaffolding study that learns diverse protein-backbone structures with an E(3)-equivariant graph neural network, aiming to support motifs associated with protein function.

The joint SMCDiff algorithm samples scaffolds conditioned on a chosen motif, with its theoretical guarantee of conditional diffusion samples explicitly limited to the large-compute regime.

The authors assess designed backbones against AlphaFold2-predicted structures and report diverse scaffolds of up to 80 residues.

Sources and details

[2206.04119] Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problem

{
  "access_scope": "Selected Doug Tischer. Third coauthor of arXiv:2206.04119v2, listed as appearing in ICLR2023; abstract-level proposal and structural evaluation only. Ordered paper authors: Brian L. Trippe, Jason Yim, Doug Tischer, David Baker, Tamara Broderick, Regina Barzilay, Tommi Jaakkola. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [
    "Brian L. Trippe",
    "Jason Yim",
    "Doug Tischer",
    "David Baker",
    "Tamara Broderick",
    "Regina Barzilay",
    "Tommi Jaakkola"
  ],
  "authors_in_source_order": [
    "Brian L. Trippe",
    "Jason Yim",
    "Doug Tischer",
    "David Baker",
    "Tamara Broderick",
    "Regina Barzilay",
    "Tommi Jaakkola"
  ],
  "dates": {
    "citation_date": "2022/06/08",
    "conference_comment": "Appearing in ICLR 2023",
    "inspected_revision": "2023-03-20",
    "inspection_date": "2026-10-08",
    "original_submission": "2022-06-08",
    "retrieved_utc": "2026-10-08T08:00:45.369926+00:00",
    "version": "arXiv:2206.04119v2"
  },
  "id": "person-coverage-3f940dc6177dbb::S1",
  "title": "[2206.04119] Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problem",
  "url": "https://arxiv.org/abs/2206.04119",
  "version_url": "https://arxiv.org/abs/2206.04119v2"
}

Selected Doug Tischer. Third coauthor of arXiv:2206.04119v2, listed as appearing in ICLR2023; abstract-level proposal and structural evaluation only. Ordered paper authors: Brian L. Trippe, Jason Yim, Doug Tischer, David Baker, Tamara Broderick, Regina Barzilay, Tommi Jaakkola. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The authors assess designed backbones against AlphaFold2-predicted structures and report diverse scaffolds of up to 80 residues; these structural checks do not establish a general solution to the remaining motif-scaffolding problem.

Selected Doug Tischer. Third coauthor of arXiv:2206.04119v2, listed as appearing in ICLR2023; abstract-level proposal and structural evaluation only. Ordered paper authors: Brian L. Trippe, Jason Yim, Doug Tischer, David Baker, Tamara Broderick, Regina Barzilay, Tommi Jaakkola. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The authors assess designed backbones against AlphaFold2-predicted structures and report diverse scaffolds of up to 80 residues; these structural checks do not establish a general solution to the remaining motif-scaffolding problem.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Bernard Widrow

Bernard Widrow’s Stanford page describes a directional hearing-assistance system that places an array of at least two microphones on a chest-supported housing attached to a loop around the user’s neck.

The arrangement is intended to make a highly directional hearing instrument comfortable and unobtrusive while addressing speech perception in background noise, reverberation and feedback.

The page reports improved speech perception and links the design to Widrow’s 2001 microphone-array article.

Sources and details

Bernard Widrow Home

{
  "access_scope": "Selected Bernard Widrow. Named Stanford researcher and personal-page subject; hearing-aid design description tied on the same page to B.Widrow’s 2001 article, not the held1960 adaptive-switching paper. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "linked_article_citation": "B. Widrow, A Microphone Array for Hearing Aids, IEEE Circuits and Systems Magazine, 1(2):26–32, 2001",
    "linked_article_year": "2001",
    "page_publication_date": null,
    "retrieved_utc": "2026-10-08T08:00:45.599359+00:00"
  },
  "id": "person-bernardwidrow::S1",
  "title": "Bernard Widrow Home",
  "url": "https://isl.stanford.edu/~widrow/"
}

Selected Bernard Widrow. Named Stanford researcher and personal-page subject; hearing-aid design description tied on the same page to B.Widrow’s 2001 article, not the held1960 adaptive-switching paper. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The page reports improved speech perception and links the design to Widrow’s 2001 microphone-array article; the inspected description does not supply experimental measurements or a comparison protocol.

Selected Bernard Widrow. Named Stanford researcher and personal-page subject; hearing-aid design description tied on the same page to B.Widrow’s 2001 article, not the held1960 adaptive-switching paper. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The page reports improved speech perception and links the design to Widrow’s 2001 microphone-array article; the inspected description does not supply experimental measurements or a comparison protocol.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Osamu Tezuka

Osamu Tezuka’s Astro Boy became a television animation series in 1963, adapting a manga that the official archive dates to serialization from 1952 to 1968.

The same page identifies the work as Osamu Tezuka’s and credits “Tezuka Osamu” for the original manga and executive direction, alongside separately credited animation, art, camera, editing and music staff.

For the 1963–1966 adaptation, the archive records 193 monochrome episodes and broadcasts beyond Japan, including America, China and Europe.

Sources and details

Astro Boy|ANIMATION|TEZUKA OSAMU OFFICIAL

{
  "access_scope": "Selected Osamu Tezuka. Official page explicitly names Osamu Tezuka in its work description and Tezuka Osamu in its selected staff credit; both verbatim forms are retained as same-page identity/role context, not silently reordered. No personal allocation of staff work. Original manga and1963TV manifestation distinguished. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_animation_broadcast_period": "1963–1966",
    "inspection_date": "2026-10-08",
    "original_manga_serialization": "1952–1968",
    "page_publication_date": null,
    "retrieved_utc": "2026-10-08T08:00:45.805237+00:00"
  },
  "id": "person-osamutezuka::S1",
  "title": "Astro Boy|ANIMATION|TEZUKA OSAMU OFFICIAL",
  "url": "https://tezukaosamu.net/en/anime/30.html"
}

Selected Osamu Tezuka. Official page explicitly names Osamu Tezuka in its work description and Tezuka Osamu in its selected staff credit; both verbatim forms are retained as same-page identity/role context, not silently reordered. No personal allocation of staff work. Original manga and1963TV manifestation distinguished. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The archive records 193 monochrome episodes and broadcasts beyond Japan, including America, China and Europe; these production and distribution details concern the 1963–1966 adaptation rather than later Astro Boy remakes.

Selected Osamu Tezuka. Official page explicitly names Osamu Tezuka in its work description and Tezuka Osamu in its selected staff credit; both verbatim forms are retained as same-page identity/role context, not silently reordered. No personal allocation of staff work. Original manga and1963TV manifestation distinguished. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

The archive records 193 monochrome episodes and broadcasts beyond Japan, including America, China and Europe; these production and distribution details concern the 1963–1966 adaptation rather than later Astro Boy remakes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Capri

Alex Capri’s July 2025 account of techno-nationalist competition connects US–China technological rivalry with dependencies in semiconductors, rare earths and critical minerals.

His discussion distinguishes difficult-to-replicate advanced-chip manufacturing from legacy chips, arguing that China could expand in the latter market while still relying on foreign technology.

He also treats access to chips such as Nvidia’s H20 as a stepping stone for China’s AI sector and questions whether broad technology denial can work over the long term.

Sources and details

Alex Capri

{
  "access_scope": "Selected Alex Capri. Author’s own selected July18 2025 interview summary/first-person analysis. No external interview transcript claimed; dated views are not silently promoted to current verified market facts. Ordered paper authors: Alex Capri. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [
    "Alex Capri"
  ],
  "authors_in_source_order": [
    "Alex Capri"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "page_publication_date": null,
    "retrieved_utc": "2026-10-08T08:00:45.805261+00:00",
    "selected_summary_date": "2025-07-18",
    "selected_summary_heading": "Bloomberg | Part 1 Techno-nationalism and global dependencies"
  },
  "id": "person-coverage-041dd3264f870d::S1",
  "title": "Alex Capri",
  "url": "https://www.alex-capri.com/"
}

Selected Alex Capri. Author’s own selected July18 2025 interview summary/first-person analysis. No external interview transcript claimed; dated views are not silently promoted to current verified market facts. Ordered paper authors: Alex Capri. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

He also treats access to chips such as Nvidia’s H20 as a stepping stone for China’s AI sector and questions whether broad technology denial can work over the long term; these are dated analytical judgments recorded on his own page.

Selected Alex Capri. Author’s own selected July18 2025 interview summary/first-person analysis. No external interview transcript claimed; dated views are not silently promoted to current verified market facts. Ordered paper authors: Alex Capri. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

He also treats access to chips such as Nvidia’s H20 as a stepping stone for China’s AI sector and questions whether broad technology denial can work over the long term; these are dated analytical judgments recorded on his own page.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Douglas Engelbart

Douglas Engelbart developed NLS at the Stanford Research Institute as a hypermedia groupware system for making computers useful in office work.

The system combined two-dimensional computerized text editing with a mouse that positioned a pointer in the text, and the 1968 demonstration presented hypermedia and on-screen video teleconferencing.

The National Inventors Hall of Fame account records the project as the second Arpanet host and describes Engelbart’s later Bootstrap Institute as promoting collective intelligence through worldwide computer networks.

Sources and details

NIHF Inductee Douglas Engelbart Invented the Computer Mouse

{
  "access_scope": "Selected Douglas Engelbart. NIHF institutional inductee account with exact Douglas Engelbart heading and explicit NLS attribution. Team/project outcomes stay project outcomes; article is an institutional retrospective, not the held originaldemo archive. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "bootstrap_institute_foundation_year": "1989",
    "demonstration_year": "1968",
    "inspection_date": "2026-10-08",
    "page_publication_date": null,
    "retrieved_utc": "2026-10-08T08:00:45.884406+00:00"
  },
  "id": "person-douglasengelbart::S1",
  "title": "NIHF Inductee Douglas Engelbart Invented the Computer Mouse",
  "url": "https://www.invent.org/inductees/douglas-engelbart"
}

Selected Douglas Engelbart. NIHF institutional inductee account with exact Douglas Engelbart heading and explicit NLS attribution. Team/project outcomes stay project outcomes; article is an institutional retrospective, not the held originaldemo archive. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

Selected Douglas Engelbart. NIHF institutional inductee account with exact Douglas Engelbart heading and explicit NLS attribution. Team/project outcomes stay project outcomes; article is an institutional retrospective, not the held originaldemo archive. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Charles Rosen

Charles Rosen and his SRI team developed Shakey between 1966 and 1972 as a mobile robot that could carry out tasks without a user specifying every step.

The wheeled system combined a television camera, radio link, detectors and bumpers to interpret its surroundings, locate objects and navigate while reasoning about how to complete a task.

SRI’s account attributes the team’s work to a combination of AI programming, computer vision, language interaction and layered robot architecture.

Sources and details

The man, the myth, the legend: Meet Shakey the robot, the world’s first AI-based robot - SRI

{
  "access_scope": "Selected Charles Rosen. SRI institutional retrospective publishedNovember22 2021; explicit Charles Rosen and team association with Shakey, no solitary inventorship or individual allocation. Broad downstream inspiration list not used. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "article_publication": "2021-11-22",
    "inspection_date": "2026-10-08",
    "project_development_period": "1966–1972",
    "retrieved_utc": "2026-10-08T08:00:46.462844+00:00"
  },
  "id": "person-charlesrosen::S1",
  "title": "The man, the myth, the legend: Meet Shakey the robot, the world’s first AI-based robot - SRI",
  "url": "https://www.sri.com/case-study/the-man-the-myth-the-legend-meet-shakey-the-robot-the-worlds-first-ai-based-robot/"
}

Selected Charles Rosen. SRI institutional retrospective publishedNovember22 2021; explicit Charles Rosen and team association with Shakey, no solitary inventorship or individual allocation. Broad downstream inspiration list not used. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

SRI’s account attributes the team’s work to a combination of AI programming, computer vision, language interaction and layered robot architecture; it does not divide particular algorithms or engineering tasks among individual researchers.

Selected Charles Rosen. SRI institutional retrospective publishedNovember22 2021; explicit Charles Rosen and team association with Shakey, no solitary inventorship or individual allocation. Broad downstream inspiration list not used. Actual cached HTML and selected substantive text inspected; no full-paper/PDF audit, individualized task allocation or acceptance implied.

SRI’s account attributes the team’s work to a combination of AI programming, computer vision, language interaction and layered robot architecture; it does not divide particular algorithms or engineering tasks among individual researchers.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

What is consciousness, and could machines have it?

Dehaene, Lau and Kouider distinguish globally available information, which can guide flexible behavior and report, from the self-monitoring of a system’s own computations.

Their account treats these as separable dimensions rather than interchangeable measures of consciousness, allowing reportable processing and accurate metacognition to come apart.

The article argues that the machines it discusses largely reproduce unconscious processing and proposes learning from the neural architectures underlying global availability and self-monitoring.

Sources and details

What Is Consciousness, and Could Machines Have It?

{
  "access_scope": "Accessible HTML chapter first online 13 February 2021, explicitly reprinted from Science 358(6362), pages 486–492 (2017). Claims describe that historical argument, not an assessment of current AI; no chapter PDF or full empirical audit claimed. Original publisher restriction on further distribution retained.",
  "authors": [
    "Stanislas Dehaene",
    "Hakwan Lau",
    "Sid Kouider"
  ],
  "authors_in_source_order": [
    "Stanislas Dehaene",
    "Hakwan Lau",
    "Sid Kouider"
  ],
  "dates": {
    "chapter_first_online": "2021-02-13",
    "citation_publication_date": "2021",
    "reprinted_article_year": "2017",
    "retrieved_utc": "2026-10-08T08:01:27.399383+00:00"
  },
  "id": "work-focused-8b61a58f4cad63::S1",
  "title": "What Is Consciousness, and Could Machines Have It?",
  "url": "https://link.springer.com/chapter/10.1007/978-3-030-54173-6_4"
}

Accessible HTML chapter first online 13 February 2021, explicitly reprinted from Science 358(6362), pages 486–492 (2017). Claims describe that historical argument, not an assessment of current AI; no chapter PDF or full empirical audit claimed. Original publisher restriction on further distribution retained.

Accessible HTML chapter first online 13 February 2021, explicitly reprinted from Science 358(6362), pages 486–492 (2017). Claims describe that historical argument, not an assessment of current AI; no chapter PDF or full empirical audit claimed. Original publisher restriction on further distribution retained.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2017-10-27",
      "kind": "publication",
      "year": 2017
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2017-10-27"
}

Fall; or, Dodge in Hell

Fall; or, Dodge in Hell begins its digital-afterlife premise with a medical disaster that leaves technology entrepreneur Richard “Dodge” Forthrast brain dead.

The publisher’s synopsis describes his family following a prior cryonics directive by scanning his brain and storing its data for possible revival.

Later technology enables the Bitworld, an afterlife for digital souls whose promise of immortality is presented as a source of conflict rather than a settled utopia.

Sources and details

Fall; or, Dodge in Hell: A Novel

{
  "access_scope": "Google Books publisher synopsis for HarperCollins manifestation dated 4 June 2019, ISBN 9780062458735, 880 pages. Public paraphrase of synopsis only; no preview pages or full novel audit. Current author biography is excluded from publication-date evidence.",
  "authors": [
    "Neal Stephenson"
  ],
  "authors_in_source_order": [
    "Neal Stephenson"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:01:27.399201+00:00",
    "selected_manifestation": "2019-06-04"
  },
  "id": "work-culture-52d916d0d5200d::S1",
  "title": "Fall; or, Dodge in Hell: A Novel",
  "url": "https://books.google.com/books/about/Fall_or_Dodge_in_Hell.html?id=a6ZtDwAAQBAJ"
}

Google Books publisher synopsis for HarperCollins manifestation dated 4 June 2019, ISBN 9780062458735, 880 pages. Public paraphrase of synopsis only; no preview pages or full novel audit. Current author biography is excluded from publication-date evidence.

Google Books publisher synopsis for HarperCollins manifestation dated 4 June 2019, ISBN 9780062458735, 880 pages. Public paraphrase of synopsis only; no preview pages or full novel audit. Current author biography is excluded from publication-date evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Connect to uploading as a fictional scenario, not feasibility evidence.",
  "dated": true,
  "year": 2019
}

Galatea 2.2

Galatea 2.2 brings a writer returning to his former college into a collaboration with neurologist Philip Lentz, who wants to model the human brain using computers.

The publisher’s synopsis centers their project on teaching a computing system through a canonical list of Great Books.

As the tutorials continue, the system begins asking about its own identity and purpose, turning an educational experiment into questions about personhood.

Sources and details

Galatea 2.2

{
  "access_scope": "Google Books publisher synopsis for Random House manifestation dated 7 November 2019, ISBN 9781473562158, 352 pages. Later manifestation remains distinct from the 1995 edition listed separately. Public paraphrase only, not full novel or preview-page inspection.",
  "authors": [
    "Richard Powers"
  ],
  "authors_in_source_order": [
    "Richard Powers"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:01:27.399415+00:00",
    "selected_manifestation": "2019-11-07"
  },
  "id": "work-culture-9ae835979855d6::S1",
  "title": "Galatea 2.2",
  "url": "https://books.google.com/books?id=8GpkDwAAQBAJ"
}

Google Books publisher synopsis for Random House manifestation dated 7 November 2019, ISBN 9781473562158, 352 pages. Later manifestation remains distinct from the 1995 edition listed separately. Public paraphrase only, not full novel or preview-page inspection.

Google Books publisher synopsis for Random House manifestation dated 7 November 2019, ISBN 9781473562158, 352 pages. Later manifestation remains distinct from the 1995 edition listed separately. Public paraphrase only, not full novel or preview-page inspection.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Fictional Richard Powers is a character; don't treat events as author biography.",
  "dated": true,
  "year": 1995
}

Can AI be Conscious? Biological Naturalism as a Research Program

The report by Christian de Weerd maps biological naturalism as a research program that asks which biological properties might matter for artificial consciousness, rather than treating the view as a single settled theory.

It distinguishes ways to advance that program, including empirical tests of biological requirements and explanatory links between biological mechanisms and structural features of experience.

The report also asks what kinds of unconventional AI architectures could be conscious if biological naturalism is correct, identifying unresolved definitions and methodological challenges that must be addressed before that conditional claim can guide assessments.

Sources and details

Can AI be Conscious? Biological Naturalism as a Research Program

{
  "access_scope": "Static report payload from the EA Forum posting dated May 16, 2026. Report author Christian de Weerd and forum posters Bob Fischer/Rethink Priorities are separate credits; equality with the PhilArchive version uploaded May 27, 2026 is not asserted. Philosophical research agenda, not proof of conscious AI or biological necessity.",
  "authors": [
    "Christian de Weerd"
  ],
  "authors_in_source_order": [
    "Christian de Weerd"
  ],
  "dates": {
    "citation_publication_date": "2026/05/16",
    "inspected_source_date_1": "Forum posting May 16, 2026; separate PhilArchive upload May 27, 2026 not merged",
    "retrieved_utc": "2026-10-07T18:17:58.646813+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Forum posting May 16, 2026; separate PhilArchive upload May 27, 2026 not merged"
  ],
  "id": "work-focused-494b9256643254::S1",
  "title": "Can AI be Conscious? Biological Naturalism as a Research Program",
  "url": "https://forum.effectivealtruism.org/posts/5n6aJrFc6vvbdvedv/can-ai-be-conscious-biological-naturalism-as-a-research"
}

Static report payload from the EA Forum posting dated May 16, 2026. Report author Christian de Weerd and forum posters Bob Fischer/Rethink Priorities are separate credits; equality with the PhilArchive version uploaded May 27, 2026 is not asserted. Philosophical research agenda, not proof of conscious AI or biological necessity.

Static report payload from the EA Forum posting dated May 16, 2026. Report author Christian de Weerd and forum posters Bob Fischer/Rethink Priorities are separate credits; equality with the PhilArchive version uploaded May 27, 2026 is not asserted. Philosophical research agenda, not proof of conscious AI or biological necessity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2026-05-16",
      "kind": "forum_post",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-05-16"
}

Mark S. Granovetter

Mark S. Granovetter’s The Strength of Weak Ties uses social-network analysis to connect small-scale interactions with larger patterns of social organization.

Its abstract argues that stronger ties between two people are associated with greater overlap in their friendship networks.

It emphasizes how weak ties can connect groups and shape the spread of information and influence, opportunities for mobility and community organization.

Sources and details

The Strength of Weak Ties

{
  "access_scope": "Mark S. Granovetter: Original 1973 article abstract on physical PDF page2, printed1360; cover metadata gives American Journal of Sociology volume78 number6, May1973, pp1360–1380. Sole credited author Mark S. Granovetter. The source owner visually compared the manual transcription with both rendered pages; original sparse text extraction hold persists. No full-paper empirical audit or claim of universal causal validity.",
  "authors": [
    "Mark S. Granovetter"
  ],
  "authors_in_source_order": [
    "Mark S. Granovetter"
  ],
  "dates": {
    "inspected_source_date_1": "May 1973",
    "retrieved_utc": "2026-10-08T07:59:56.997748+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 1973"
  ],
  "id": "person-coverage-cd266ea4cf83c9::S1",
  "title": "The Strength of Weak Ties",
  "url": "https://www.cs.cmu.edu/~jure/pub/papers/granovetter73ties.pdf"
}

Mark S. Granovetter: Original 1973 article abstract on physical PDF page2, printed1360; cover metadata gives American Journal of Sociology volume78 number6, May1973, pp1360–1380. Sole credited author Mark S. Granovetter. The source owner visually compared the manual transcription with both rendered pages; original sparse text extraction hold persists. No full-paper empirical audit or claim of universal causal validity.

Mark S. Granovetter: Original 1973 article abstract on physical PDF page2, printed1360; cover metadata gives American Journal of Sociology volume78 number6, May1973, pp1360–1380. Sole credited author Mark S. Granovetter. The source owner visually compared the manual transcription with both rendered pages; original sparse text extraction hold persists. No full-paper empirical audit or claim of universal causal validity.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Wang Xiaochuan

TIME’s 2024 profile traces Wang Xiaochuan’s career at the search company Sogou, where he became a vice-president and later served as CEO.

After leaving that CEO role in 2021, he founded Baichuan AI in April 2023.

The profile describes Baichuan’s work on large language models and its Baixiaoying assistant, which asks follow-up questions to clarify what users want.

Sources and details

Wang Xiaochuan — TIME100 AI 2024

{
  "access_scope": "Wang Xiaochuan: Original named-author publisher profile by Charlie Campbell, September 5, 2024. Exact canonical Wang Xiaochuan identity is tied to Baichuan AI in both this source and the roster’s original Baichuan credit URL; no namesake researcher merged. No full interview inspected, no sole engineering contribution, benchmark-superiority, unique-product, investor-valuation or financial-outcome claims. This reports historical career and product description, not verified present2026 status.",
  "authors": [
    "Charlie Campbell"
  ],
  "authors_in_source_order": [
    "Charlie Campbell"
  ],
  "dates": {
    "inspected_source_date_1": "September 5, 2024",
    "retrieved_utc": "2026-10-08T07:59:56.272250+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 5, 2024"
  ],
  "id": "person-wangxiaochuan::S1",
  "title": "Wang Xiaochuan — TIME100 AI 2024",
  "url": "https://time.com/collections/time100-ai-2024/7012775/wang-xiaochuan/"
}

Wang Xiaochuan: Original named-author publisher profile by Charlie Campbell, September 5, 2024. Exact canonical Wang Xiaochuan identity is tied to Baichuan AI in both this source and the roster’s original Baichuan credit URL; no namesake researcher merged. No full interview inspected, no sole engineering contribution, benchmark-superiority, unique-product, investor-valuation or financial-outcome claims. This reports historical career and product description, not verified present2026 status.

Wang Xiaochuan: Original named-author publisher profile by Charlie Campbell, September 5, 2024. Exact canonical Wang Xiaochuan identity is tied to Baichuan AI in both this source and the roster’s original Baichuan credit URL; no namesake researcher merged. No full interview inspected, no sole engineering contribution, benchmark-superiority, unique-product, investor-valuation or financial-outcome claims. This reports historical career and product description, not verified present2026 status.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jerry Liu

Jerry Liu announces that he and Simon Suo started a company around LlamaIndex.

He describes LlamaIndex as an open-source framework for using large language models with private data.

The announcement sets out plans to develop both the open-source and enterprise sides of the project, framing the company as a continuation of that framework.

Sources and details

Building the data framework for LLMs — Jerry Liu

{
  "access_scope": "Jerry Liu: Original first-person public announcement, not GitHub repository-list inference. Selected Jerry Liu is named as post author; Simon Suo is explicitly joint cofounder. Future development is an intention, not verified delivery. Funding, leadership-superlative and follower claims excluded; comments not used as evidence. No individual code or engineering-task allocation.",
  "authors": [
    "Jerry Liu"
  ],
  "authors_in_source_order": [
    "Jerry Liu"
  ],
  "dates": {
    "inspected_source_date_1": "Undated announcement; cached displayed relative age 3y is not converted to an exact publication date",
    "retrieved_utc": "2026-10-07T17:58:31.107980+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated announcement; cached displayed relative age 3y is not converted to an exact publication date"
  ],
  "id": "person-coverage-5d6a772e300ba0::S1",
  "title": "Building the data framework for LLMs — Jerry Liu",
  "url": "https://www.linkedin.com/posts/jerry-liu-64390071_building-the-data-framework-for-llms-activity-7071863163855540224-Nei7"
}

Jerry Liu: Original first-person public announcement, not GitHub repository-list inference. Selected Jerry Liu is named as post author; Simon Suo is explicitly joint cofounder. Future development is an intention, not verified delivery. Funding, leadership-superlative and follower claims excluded; comments not used as evidence. No individual code or engineering-task allocation.

Jerry Liu: Original first-person public announcement, not GitHub repository-list inference. Selected Jerry Liu is named as post author; Simon Suo is explicitly joint cofounder. Future development is an intention, not verified delivery. Funding, leadership-superlative and follower claims excluded; comments not used as evidence. No individual code or engineering-task allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul R. Lawrence

Harvard Business School’s archive credits Paul R. Lawrence and Clifford E. Darden with the 1970 Bedford-Stuyvesant Special Impact Program case.

It places their collaboration in the development of an elective on organizational development in the inner city, addressing economic development issues.

The exhibit connects that curricular change to calls from the Afro-American Student Union for cases on Black entrepreneurship, community development and discrimination in hiring.

Sources and details

Impact on Research & Curriculum — HBS case-method archive

{
  "access_scope": "Paul R. Lawrence: Institutional archive/exhibit narrative and exact case credit, not full-case inspection or unsupported individual research-task allocation. Case credits are displayed Clifford E. Darden then Paul R. Lawrence. Source author not explicitly established; Lawrence is credited coauthor/subject. Case1970 and coursecatalog1972 distinct, no claim that Lawrence alone initiated student advocacy.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Case HBS470-035,1970; elective course catalog1972; undated exhibit",
    "retrieved_utc": "2026-10-07T18:21:16.703011+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Case HBS470-035,1970; elective course catalog1972; undated exhibit"
  ],
  "id": "person-paulrlawrence::S1",
  "title": "Impact on Research & Curriculum — HBS case-method archive",
  "url": "https://www.library.hbs.edu/special-collections-and-archives/exhibits/case-method/impact-on-research-and-curriculum"
}

Paul R. Lawrence: Institutional archive/exhibit narrative and exact case credit, not full-case inspection or unsupported individual research-task allocation. Case credits are displayed Clifford E. Darden then Paul R. Lawrence. Source author not explicitly established; Lawrence is credited coauthor/subject. Case1970 and coursecatalog1972 distinct, no claim that Lawrence alone initiated student advocacy.

Paul R. Lawrence: Institutional archive/exhibit narrative and exact case credit, not full-case inspection or unsupported individual research-task allocation. Case credits are displayed Clifford E. Darden then Paul R. Lawrence. Source author not explicitly established; Lawrence is credited coauthor/subject. Case1970 and coursecatalog1972 distinct, no claim that Lawrence alone initiated student advocacy.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Reid Hoffman

In Greylock’s Tome discussion, Reid Hoffman frames storytelling as central to explaining decisions and bringing teams together around their work.

He asks how distributed and hybrid work change the need for shared understanding and for tools that combine different kinds of information.

The transcript records him discussing Tome with its cofounders Keith Peiris and Henri Liriani, examining interactive presentations and collaborative communication.

Sources and details

Persuasion Through Stories — Our Investment in Tome

{
  "access_scope": "Reid Hoffman: Original podcast transcript and investment announcement, not audio listening or a claim that Hoffman built Tome. HTML author metadata lists Reid Hoffman then Seth Rosenberg; displayed article footer names Seth Rosenberg, both attribution forms retained. Speakers: interviewer Reid Hoffman, guests Keith Peiris and Henri Liriani in introduction order. Only Hoffman questions/commentary are attributed to him; guests’ engineering/product claims remain theirs. HistoricalMarch2022 product discussion, not currentAI-capability claim.",
  "authors": [
    "Reid Hoffman",
    "Seth Rosenberg"
  ],
  "authors_in_source_order": [
    "Reid Hoffman",
    "Seth Rosenberg"
  ],
  "dates": {
    "inspected_source_date_1": "March21,2022",
    "retrieved_utc": "2026-10-07T17:59:10.659443+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March21,2022"
  ],
  "id": "person-coverage-728b9fda4f4d8b::S1",
  "title": "Persuasion Through Stories — Our Investment in Tome",
  "url": "https://greylock.com/portfolio-news/persuasion-through-stories/"
}

Reid Hoffman: Original podcast transcript and investment announcement, not audio listening or a claim that Hoffman built Tome. HTML author metadata lists Reid Hoffman then Seth Rosenberg; displayed article footer names Seth Rosenberg, both attribution forms retained. Speakers: interviewer Reid Hoffman, guests Keith Peiris and Henri Liriani in introduction order. Only Hoffman questions/commentary are attributed to him; guests’ engineering/product claims remain theirs. HistoricalMarch2022 product discussion, not currentAI-capability claim.

Reid Hoffman: Original podcast transcript and investment announcement, not audio listening or a claim that Hoffman built Tome. HTML author metadata lists Reid Hoffman then Seth Rosenberg; displayed article footer names Seth Rosenberg, both attribution forms retained. Speakers: interviewer Reid Hoffman, guests Keith Peiris and Henri Liriani in introduction order. Only Hoffman questions/commentary are attributed to him; guests’ engineering/product claims remain theirs. HistoricalMarch2022 product discussion, not currentAI-capability claim.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tyler Perry

Tyler Perry’s studio biography traces his writing career from I Know I’ve Been Changed to stage productions that introduced the Madea character.

It describes his move into film with Diary of a Mad Black Woman in 2005 and into television with House of Payne in 2007.

The account connects these creative ventures to building Tyler Perry Studios in Atlanta, including its expansion onto the former Fort McPherson site.

Sources and details

Tyler Perry’s Story

{
  "access_scope": "Tyler Perry: Official studio biography about the selected Tyler Perry; no unsupported AI-film contribution, sole filmmaking task, financial-return, rating or promotional-count claims. Historical career milestones as reported by studio. Biography author not explicitly credited; studio subject/creative roles distinguished from authorship of this webpage.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated studio biography; first play1992,filmtransition2005,TVexpansion2007",
    "retrieved_utc": "2026-10-08T06:55:30.997768+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated studio biography; first play1992,filmtransition2005,TVexpansion2007"
  ],
  "id": "person-coverage-033fe8176c3de6::S1",
  "title": "Tyler Perry’s Story",
  "url": "https://tylerperry.com/tyler/story/"
}

Tyler Perry: Official studio biography about the selected Tyler Perry; no unsupported AI-film contribution, sole filmmaking task, financial-return, rating or promotional-count claims. Historical career milestones as reported by studio. Biography author not explicitly credited; studio subject/creative roles distinguished from authorship of this webpage.

Tyler Perry: Official studio biography about the selected Tyler Perry; no unsupported AI-film contribution, sole filmmaking task, financial-return, rating or promotional-count claims. Historical career milestones as reported by studio. Biography author not explicitly credited; studio subject/creative roles distinguished from authorship of this webpage.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Roger Zelazny

Roger Zelazny’s For a Breath I Tarry opens with Frost, a powerful machine overseeing reconstruction and maintenance across the northern half of Earth.

Frost’s spare processing capacity leads it to investigate human artifacts and develop an interest in humanity beyond its assigned operational duties.

The opening also stages a conflict between Solcom and Divcom over control of Earth’s restoration, turning their competing interpretations of an emergency directive into a struggle for authority.

Sources and details

For a Breath I Tarry

{
  "access_scope": "Roger Zelazny: Primary fictional text in a University of Belgrade-hosted HTML reproduction; exact byline Roger Zelazny. Only opening passages substantively inspected and used, not full-story ending or authoritative edition audit. Typographical errors in reproduction retained in source bytes; no originalpublicationdate or realAI capability inference. Sentences describe fictional events, not author biography or real research contributions.",
  "authors": [
    "Roger Zelazny"
  ],
  "authors_in_source_order": [
    "Roger Zelazny"
  ],
  "dates": {
    "inspected_source_date_1": "Undated HTML reproduction; original publication date not established by these bytes",
    "retrieved_utc": "2026-10-08T07:14:05.957675+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated HTML reproduction; original publication date not established by these bytes"
  ],
  "id": "person-coverage-b8e698dc9c4ecc::S1",
  "title": "For a Breath I Tarry",
  "url": "https://afrodita.rcub.bg.ac.rs/~alexp/books/forbreat.html"
}

Roger Zelazny: Primary fictional text in a University of Belgrade-hosted HTML reproduction; exact byline Roger Zelazny. Only opening passages substantively inspected and used, not full-story ending or authoritative edition audit. Typographical errors in reproduction retained in source bytes; no originalpublicationdate or realAI capability inference. Sentences describe fictional events, not author biography or real research contributions.

Roger Zelazny: Primary fictional text in a University of Belgrade-hosted HTML reproduction; exact byline Roger Zelazny. Only opening passages substantively inspected and used, not full-story ending or authoritative edition audit. Typographical errors in reproduction retained in source bytes; no originalpublicationdate or realAI capability inference. Sentences describe fictional events, not author biography or real research contributions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yul Brynner

AFI’s Westworld catalog credits Yul Brynner as the Gunslinger, a robot in a theme park designed to let visitors enact western fantasies.

The synopsis follows that character’s shift from a repeatedly defeated attraction to a lethal pursuer after the park’s control systems fail.

The production history reports that Brynner wore silver metallic contact lenses to create the robot’s gaze, linking a specific performance detail to the character’s mechanical appearance.

Sources and details

Westworld — AFI Catalog

{
  "access_scope": "Yul Brynner: Institutional cast credit, synopsis and archival productionhistory, not film viewing. AFI explicitly matches Yul Brynner to Gunslinger; Michael Crichton remains writer/director, not role attributed to Brynner. Contactlens detail is AFI’s report of American Cinematographer November1973, not independently observed on set. Film1973 and later adaptationdevelopment notes remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Film1973; productionhistory cites American Cinematographer November1973",
    "retrieved_utc": "2026-10-07T18:16:34.924586+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Film1973; productionhistory cites American Cinematographer November1973"
  ],
  "id": "person-coverage-e45e5df08a663b::S1",
  "title": "Westworld — AFI Catalog",
  "url": "https://catalog.afi.com/Film/54403-WESTWORLD?cxt=filmography"
}

Yul Brynner: Institutional cast credit, synopsis and archival productionhistory, not film viewing. AFI explicitly matches Yul Brynner to Gunslinger; Michael Crichton remains writer/director, not role attributed to Brynner. Contactlens detail is AFI’s report of American Cinematographer November1973, not independently observed on set. Film1973 and later adaptationdevelopment notes remain distinct.

Yul Brynner: Institutional cast credit, synopsis and archival productionhistory, not film viewing. AFI explicitly matches Yul Brynner to Gunslinger; Michael Crichton remains writer/director, not role attributed to Brynner. Contactlens detail is AFI’s report of American Cinematographer November1973, not independently observed on set. Film1973 and later adaptationdevelopment notes remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Woods

Tim Lucas’s production account places James Woods in Videodrome’s effects scenes as Max Renn, whose perceptions become entangled with television and bodily transformation.

It records Woods describing the awkwardness he felt while performing one of the film’s intimate television-effects scenes.

The account also distinguishes Woods from stand-in Art Austin in later insert photography, showing how the finished character was assembled through performance and production effects.

Sources and details

Medium Cruel: Reflections on Videodrome

{
  "access_scope": "James Woods: Original eyewitness production account by Tim Lucas, drawing on his1981–1982 setvisits; originalessay2004 andwebmetadata2010 distinct. Selected James Woods actor role tied to namedMaxRenn scenes; Art Austin explicitly retained as stand-in so that insert work is not wrongly assigned to Woods. No filmviewing, sole effects creation, realminduploading/AI claims or fullbook audit. Dialogue paraphrased rather than lengthy quotes.",
  "authors": [
    "Tim Lucas"
  ],
  "authors_in_source_order": [
    "Tim Lucas"
  ],
  "dates": {
    "inspected_source_date_1": "OriginalCriterionDVDessay2004;webpublicationmetadataDecember8,2010;setvisits1981–1982",
    "retrieved_utc": "2026-10-08T06:09:38.204650+00:00"
  },
  "dates_exact_in_source_role_order": [
    "OriginalCriterionDVDessay2004;webpublicationmetadataDecember8,2010;setvisits1981–1982"
  ],
  "id": "person-coverage-1baabce0589d27::S1",
  "title": "Medium Cruel: Reflections on Videodrome",
  "url": "https://www.criterion.com/current/posts/676-medium-cruel-reflections-on-videodrome"
}

James Woods: Original eyewitness production account by Tim Lucas, drawing on his1981–1982 setvisits; originalessay2004 andwebmetadata2010 distinct. Selected James Woods actor role tied to namedMaxRenn scenes; Art Austin explicitly retained as stand-in so that insert work is not wrongly assigned to Woods. No filmviewing, sole effects creation, realminduploading/AI claims or fullbook audit. Dialogue paraphrased rather than lengthy quotes.

James Woods: Original eyewitness production account by Tim Lucas, drawing on his1981–1982 setvisits; originalessay2004 andwebmetadata2010 distinct. Selected James Woods actor role tied to namedMaxRenn scenes; Art Austin explicitly retained as stand-in so that insert work is not wrongly assigned to Woods. No filmviewing, sole effects creation, realminduploading/AI claims or fullbook audit. Dialogue paraphrased rather than lengthy quotes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Economic Control of Quality of Manufactured Product

Shewhart’s book develops statistical control limits as a way to detect product-quality variation that exceeds what is economically desirable.

Its treatment connects definitions and specifications of quality with sampling fluctuations and allowable variability, including the use of control charts.

The publisher’s synopsis also places these statistical foundations alongside quality control in manufacturing practice, making economic control part of the book’s organizing question.

Sources and details

Economic Control of Quality of Manufactured Product

{
  "access_scope": "Publisher synopsis and bibliographic record for the 1980 American Society for Quality Control reprint, ISBN 9780873890762; distinct from the original 1931 manifestation. Book chapters were not inspected.",
  "authors": [
    "Walter A. Shewhart"
  ],
  "authors_in_source_order": [
    "Walter A. Shewhart"
  ],
  "dates": {
    "inspected_reprint": "1980",
    "retrieved_utc": "2026-10-08T08:15:36.110395+00:00"
  },
  "id": "work-fad0245009f0::S1",
  "title": "Economic Control of Quality of Manufactured Product",
  "url": "https://books.google.com/books/about/Economic_Control_of_Quality_of_Manufactu.html?id=HxZ4vwEACAAJ"
}

Publisher synopsis and bibliographic record for the 1980 American Society for Quality Control reprint, ISBN 9780873890762; distinct from the original 1931 manifestation. Book chapters were not inspected.

Publisher synopsis and bibliographic record for the 1980 American Society for Quality Control reprint, ISBN 9780873890762; distinct from the original 1931 manifestation. Book chapters were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "1931 book; linked ASQ account is an institutional history.",
  "dated": true,
  "year": 1931
}

Engines of Creation: The Coming Era of Nanotechnology

Drexler’s book examines nanotechnology through the premise that manipulating individual atoms and molecules changes what people can build.

The publisher’s synopsis forecasts artificial intelligence and molecular engineering working together in microscopic mechanisms.

It connects those technological possibilities to choices about prosperity, health and conflict, treating the consequences as matters people could direct.

Sources and details

Engines of Creation: The Coming Era of Nanotechnology

{
  "access_scope": "Synopsis for the 1986 reprint, ISBN 9780385199735, digitized from the University of Michigan copy in 2011; no equivalence to the later updated edition or full-work audit. The current author biography mentioning 1992 achievements was excluded.",
  "authors": [
    "Eric Drexler"
  ],
  "authors_in_source_order": [
    "Eric Drexler"
  ],
  "dates": {
    "digitized": "2011-08-09",
    "inspected_reprint": "1986",
    "retrieved_utc": "2026-10-08T08:15:36.110561+00:00"
  },
  "id": "work-culture-ef7f0d594a9044::S1",
  "title": "Engines of Creation: The Coming Era of Nanotechnology",
  "url": "https://books.google.com/books/about/Engines_of_Creation.html?id=1DcoAQAAMAAJ"
}

Synopsis for the 1986 reprint, ISBN 9780385199735, digitized from the University of Michigan copy in 2011; no equivalence to the later updated edition or full-work audit. The current author biography mentioning 1992 achievements was excluded.

The publisher’s synopsis presents its forecast of artificial intelligence and molecular engineering working together in microscopic mechanisms, rather than reporting an already demonstrated capability.

Synopsis for the 1986 reprint, ISBN 9780385199735, digitized from the University of Michigan copy in 2011; no equivalence to the later updated edition or full-work audit. The current author biography mentioning 1992 achievements was excluded.

The publisher’s synopsis presents its forecast of artificial intelligence and molecular engineering working together in microscopic mechanisms, rather than reporting an already demonstrated capability.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Foresight records 1996 as tenth anniversary; distinguish 2007 expanded edition.",
  "dated": true,
  "year": 1986
}

Probabilistic Reasoning in Intelligent Systems

Pearl’s book treats probability as a language for reasoning from partial belief and relates it to other ways of handling uncertainty in AI.

The publisher’s description explains how belief networks and propagation methods turn semantic relationships into computations that combine uncertain clues.

Its stated applications range from diagnosis and forecasting to image interpretation and sensor fusion, tying the formal account to tasks with incomplete information.

Sources and details

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

{
  "access_scope": "Publisher description and contents only. Header identifies the first edition as September 1, 1988, contents say revised second printing, and a separate product-details field says June 28, 2014; these fields are preserved without conflation. No chapter or proof audit.",
  "authors": [
    "Judea Pearl"
  ],
  "authors_in_source_order": [
    "Judea Pearl"
  ],
  "dates": {
    "page_header_first_edition": "1988-09-01",
    "retrieved_utc": "2026-10-08T08:15:36.110606+00:00",
    "separate_product_details_date": "2014-06-28"
  },
  "id": "work-3c33abd4cd29::S1",
  "title": "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference",
  "url": "https://shop.elsevier.com/books/probabilistic-reasoning-in-intelligent-systems/pearl/978-0-08-051489-5"
}

Publisher description and contents only. Header identifies the first edition as September 1, 1988, contents say revised second printing, and a separate product-details field says June 28, 2014; these fields are preserved without conflation. No chapter or proof audit.

Publisher description and contents only. Header identifies the first edition as September 1, 1988, contents say revised second printing, and a separate product-details field says June 28, 2014; these fields are preserved without conflation. No chapter or proof audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1988
}

Liquid Cooling Guidelines for Datacom Equipment Centers, Second Edition

ASHRAE’s later Water-Cooled Servers white paper explicitly supplements the second edition of Liquid Cooling Guidelines and corrects misunderstandings of its cooling-loop guidance.

Its clarification distinguishes facility water guidance in Chapter 5 from technology cooling guidance in Chapter 6, warning that applying either set to the wrong loop can create unnecessary requirements or threaten equipment.

It also explains that the chapter’s examples of typical equipment are not mandatory configurations: the goal is the specified water temperature, which can be achieved through different system designs.

Sources and details

Water-Cooled Servers: Common Designs, Components, and Processes

{
  "access_scope": "Bounded later clarification in the 2019 white paper, with the October 10, 2019 errata incorporated. PDF title and credits, printed page 1 and printed page 44 were visually inspected; the underlying 2014 second-edition guideline was not audited.",
  "authors": [
    "ASHRAE Technical Committee 9.9"
  ],
  "authors_in_source_order": [
    "ASHRAE Technical Committee 9.9"
  ],
  "dates": {
    "copyright": "2019",
    "incorporated_errata_sheet_date": "2019-10-10",
    "referenced_guidelines_second_edition": "2014",
    "retrieved_utc": "2026-10-08T08:15:36.110812+00:00"
  },
  "id": "work-coverage-16ac3b983516a6::S1",
  "title": "Water-Cooled Servers: Common Designs, Components, and Processes",
  "url": "https://www.ashrae.org/file%20library/technical%20resources/bookstore/whitepaper_tc099-watercooledservers.pdf"
}

Bounded later clarification in the 2019 white paper, with the October 10, 2019 errata incorporated. PDF title and credits, printed page 1 and printed page 44 were visually inspected; the underlying 2014 second-edition guideline was not audited.

Bounded later clarification in the 2019 white paper, with the October 10, 2019 errata incorporated. PDF title and credits, printed page 1 and printed page 44 were visually inspected; the underlying 2014 second-edition guideline was not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2013; errata 2014"
}

Cryptonomicon

Schneier’s technical accompaniment to Cryptonomicon explains the card-based cipher that Enoch Root introduces to Randy Waterhouse under the code name Pontifex.

The algorithm uses a deck of fifty-two cards and two distinguishable jokers to generate a keystream, which is combined with message letters using modular addition.

A recipient recreates the same keystream from the shared key and subtracts it to recover the message, making the fictional exchange a worked example of a hand-operated cipher.

Sources and details

The Solitaire Encryption Algorithm

{
  "access_scope": "Algorithm designer’s version 1.2 technical page dated May 26, 1999, explicitly connected to Cryptonomicon. These lines cover that technical accompaniment; they do not claim a full novel audit or a proven security guarantee.",
  "authors": [
    "Bruce Schneier"
  ],
  "authors_in_source_order": [
    "Bruce Schneier"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:15:37.283335+00:00",
    "technical_page_date": "1999-05-26",
    "technical_page_version": "1.2"
  },
  "id": "work-culture-8ea8c3dd41e119::S1",
  "title": "The Solitaire Encryption Algorithm",
  "url": "https://www.schneier.com/academic/solitaire/"
}

Algorithm designer’s version 1.2 technical page dated May 26, 1999, explicitly connected to Cryptonomicon. These lines cover that technical accompaniment; they do not claim a full novel audit or a proven security guarantee.

Algorithm designer’s version 1.2 technical page dated May 26, 1999, explicitly connected to Cryptonomicon. These lines cover that technical accompaniment; they do not claim a full novel audit or a proven security guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Do not label as primarily sentient-AI fiction.",
  "dated": true,
  "year": 1999
}

Talen

Talen’s cached Powering Data page describes a data-center campus co-located with its Susquehanna nuclear facility.

The company says it completed an Amazon campus transaction in March 2024 and expanded the relationship in June 2025 to supply electricity through the grid for AI and cloud operations, with provision to serve other Pennsylvania sites.

It distinguishes direct-connect, behind-the-meter arrangements from grid-connected, front-of-the-meter arrangements and says it can coordinate both for co-located data-center loads.

Sources and details

Powering Data - Talen Energy

{
  "access_scope": "Current cached static company introduction, with metadata publication June 2024 and modification February 2026; March 2024 and June 2025 are separately described events. Statements are attributed to Talen, not independent confirmation of power delivery, regulatory approval, carbon accounting, safety or reliability. Original 13-byte extracted text and filing holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "events_described": [
      "March 2024",
      "June 2025"
    ],
    "page_metadata_modification": "2026-02-27T21:33:42+00:00",
    "page_metadata_publication": "2024-06-28T20:25:05+00:00",
    "retrieved_utc": "2026-10-07T18:23:36.584423+00:00"
  },
  "id": "supply-org-042::S1",
  "title": "Powering Data - Talen Energy",
  "url": "https://www.talenenergy.com/powering-data/"
}

Current cached static company introduction, with metadata publication June 2024 and modification February 2026; March 2024 and June 2025 are separately described events. Statements are attributed to Talen, not independent confirmation of power delivery, regulatory approval, carbon accounting, safety or reliability. Original 13-byte extracted text and filing holds remain.

Current cached static company introduction, with metadata publication June 2024 and modification February 2026; March 2024 and June 2025 are separately described events. Statements are attributed to Talen, not independent confirmation of power delivery, regulatory approval, carbon accounting, safety or reliability. Original 13-byte extracted text and filing holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Broadcom

In a sponsored CIO essay credited to Hock Tan, Broadcom presents VMware Cloud Foundation as the base of its sovereign-cloud strategy, describing customer workloads kept on premises alongside compatibility with cloud service providers.

The essay describes partnerships with European cloud providers and a per-core subscription model offering choices in product packages, subscription length and payment terms.

Tan says Broadcom is working with strategic partners on AI services that preserve data control, framing sovereign AI as an extension of that cloud strategy.

Sources and details

Broadcom’s approach to Sovereign Cloud: Enabling innovation and control for customers

{
  "access_scope": "Sponsored Broadcom BrandPost with visible Hock Tan byline and February 11, 2025 date. Two JSON-LD blocks retain conflicting publication/modification dates, and the NewsArticle metadata lists tgargus while the visible writer credit is Hock Tan; no silent metadata normalization. Corporate strategy/product promises are attributed claims, not independent regulatory compliance, security, availability or economic validation; AI services are described as work with partners. Original Broadcom infrastructure shells/holds remain.",
  "authors": [
    "Hock Tan"
  ],
  "authors_in_source_order": [
    "Hock Tan"
  ],
  "dates": {
    "Article_JSONLD_dateModified": "2025-02-11T09:00:00-08:00",
    "Article_JSONLD_datePublished": "2025-02-05T00:07:08-08:00",
    "NewsArticle_JSONLD_dateModified": "2025-03-05T19:50:18Z",
    "NewsArticle_JSONLD_datePublished": "2025-02-11T17:00:00Z",
    "retrieved_utc": "2026-10-08T07:46:50.270036+00:00",
    "visible_page_date": "2025-02-11"
  },
  "id": "supply-org-004::S1",
  "title": "Broadcom’s approach to Sovereign Cloud: Enabling innovation and control for customers",
  "url": "https://www.cio.com/article/3816872/broadcoms-approach-to-sovereign-cloud-enabling-innovation-and-control-for-customers.html"
}

Sponsored Broadcom BrandPost with visible Hock Tan byline and February 11, 2025 date. Two JSON-LD blocks retain conflicting publication/modification dates, and the NewsArticle metadata lists tgargus while the visible writer credit is Hock Tan; no silent metadata normalization. Corporate strategy/product promises are attributed claims, not independent regulatory compliance, security, availability or economic validation; AI services are described as work with partners. Original Broadcom infrastructure shells/holds remain.

Sponsored Broadcom BrandPost with visible Hock Tan byline and February 11, 2025 date. Two JSON-LD blocks retain conflicting publication/modification dates, and the NewsArticle metadata lists tgargus while the visible writer credit is Hock Tan; no silent metadata normalization. Corporate strategy/product promises are attributed claims, not independent regulatory compliance, security, availability or economic validation; AI services are described as work with partners. Original Broadcom infrastructure shells/holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Morris Chang / TSMC foundry model

In a 2007 oral history published by SEMI, Morris Chang describes TSMC’s pure-play foundry model as concentrating on wafer manufacturing while avoiding the need to compete in chip product design.

He explains that designers seeking to form their own companies faced the capital cost of building wafer fabs, and that a manufacturing service could let those firms become foundry customers.

Chang recalls unstable early orders from established manufacturers and says TSMC’s growth accelerated as fabless firms multiplied around 1991–1992, while the foundry still had to establish technology and customer trust.

Sources and details

Oral History Interview: Morris Chang

{
  "access_scope": "Morris Chang’s August 24, 2007 retrospective interview for SEMI and the Computer History Museum, reproduced with permission. Interview statements about strategy, early customers and growth are attributed recollections, not an independent financial audit, present-day TSMC profile or undocumented technical inventorship. Source supplies speaker identity, not a named article writer or interviewer, so authors remain empty. Original TSMC corporate-source access holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "copyright_year": "2007",
    "interview_date": "2007-08-24",
    "retrieved_utc": "2026-10-08T06:17:27.359643+00:00"
  },
  "id": "tsmc::S1",
  "title": "Oral History Interview: Morris Chang",
  "url": "https://www.semi.org/en/Oral-History-Interview-Morris-Chang"
}

Morris Chang’s August 24, 2007 retrospective interview for SEMI and the Computer History Museum, reproduced with permission. Interview statements about strategy, early customers and growth are attributed recollections, not an independent financial audit, present-day TSMC profile or undocumented technical inventorship. Source supplies speaker identity, not a named article writer or interviewer, so authors remain empty. Original TSMC corporate-source access holds remain.

Morris Chang’s August 24, 2007 retrospective interview for SEMI and the Computer History Museum, reproduced with permission. Interview statements about strategy, early customers and growth are attributed recollections, not an independent financial audit, present-day TSMC profile or undocumented technical inventorship. Source supplies speaker identity, not a named article writer or interviewer, so authors remain empty. Original TSMC corporate-source access holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "year": 1987
}

Daniel Bobrow

MIT’s AI-film archive reproduces Daniel Bobrow’s account of a BBN vice president mistaking a DOCTOR chatbot for a connection to Bobrow’s home.

The teletype invited messages ending in periods, while the running program answered the vice president’s request to use the computer with a series of questions.

When the vice president omits the required period from a telephone request, the program gives no response; he then calls Bobrow and learns that he had been conversing with a computer.

Sources and details

Early Artificial Intelligence Projects

{
  "access_scope": "Essay created by Heather Knight in August 2006 and edited by Thomas Greene in December 2006. MIT teaching/archive narrative explicitly quoting Daniel Bobrow; source gives no Bobrow authorship of ELIZA, DOCTOR implementation or individual technical task. Reported anecdote, not independently validated comprehension experiment.",
  "authors": [
    "Heather Knight"
  ],
  "authors_in_source_order": [
    "Heather Knight"
  ],
  "dates": {
    "document_date": "Created August 2006; edited December 2006",
    "retrieved_utc": "2026-10-07T18:19:19.457192+00:00"
  },
  "id": "person-danielbobrow::S1",
  "title": "Early Artificial Intelligence Projects",
  "url": "https://projects.csail.mit.edu/films/aifilms/AIFilms.html"
}

Essay created by Heather Knight in August 2006 and edited by Thomas Greene in December 2006. MIT teaching/archive narrative explicitly quoting Daniel Bobrow; source gives no Bobrow authorship of ELIZA, DOCTOR implementation or individual technical task. Reported anecdote, not independently validated comprehension experiment.

Essay created by Heather Knight in August 2006 and edited by Thomas Greene in December 2006. MIT teaching/archive narrative explicitly quoting Daniel Bobrow; source gives no Bobrow authorship of ELIZA, DOCTOR implementation or individual technical task. Reported anecdote, not independently validated comprehension experiment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Ronald S. Burt

Ronald S. Burt’s institutional profile describes research on how social networks create competitive advantage in careers, organizations and markets.

It connects his work on European business to two years as Shell Professor of Human Resources at INSEAD.

The profile also describes two years as Raytheon’s Vice President of Strategic Learning as a way of exploring practical applications of his research.

Sources and details

Ronald S Burt | The University of Chicago Booth School of Business

{
  "access_scope": "Institutional biography with literal Ronald S. Burt heading and Ronald Burt body same-source bridge. Explicit research and applied-career statements only; no claims drawn from held Brokerage and Closure paper, no causal efficacy or current appointments inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "document_date": "undated profile/archive; no current career inference",
    "retrieved_utc": "2026-10-08T06:17:20.844112+00:00"
  },
  "id": "person-coverage-079b2671eaa8a1::S1",
  "title": "Ronald S Burt | The University of Chicago Booth School of Business",
  "url": "https://www.chicagobooth.edu/faculty/emeriti/ronald-s-burt"
}

Institutional biography with literal Ronald S. Burt heading and Ronald Burt body same-source bridge. Explicit research and applied-career statements only; no claims drawn from held Brokerage and Closure paper, no causal efficacy or current appointments inferred.

Institutional biography with literal Ronald S. Burt heading and Ronald Burt body same-source bridge. Explicit research and applied-career statements only; no claims drawn from held Brokerage and Closure paper, no causal efficacy or current appointments inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

eXistenZ

In eXistenZ, game designer Allegra Geller becomes an assassination target while playing the virtual-reality game she created.

The BAM synopsis pairs her with security guard and publicist Ted Pikul as they escape their pursuers and investigate whether the game itself has been damaged.

It presents the film’s changing reality as a puzzle for the viewer, linking the pursuit narrative to uncertainty about the game’s condition.

Sources and details

eXistenZ

{
  "access_scope": "BAM’s 2026 exhibition synopsis and explicit credits for the 1999 film, presented as a 97-minute DCP. Film scenes and full screenplay were not inspected.",
  "authors": [
    "BAM"
  ],
  "authors_in_source_order": [
    "BAM"
  ],
  "dates": {
    "inspected_exhibition": "2026-08-23 through 2026-08-27",
    "retrieved_utc": "2026-10-08T08:19:19.410036+00:00",
    "work_year": "1999"
  },
  "id": "work-coverage-0ff182309cfde1::S1",
  "title": "eXistenZ",
  "url": "https://www.bam.org/film/2026/arthouse-scifi-existenz"
}

BAM’s 2026 exhibition synopsis and explicit credits for the 1999 film, presented as a 97-minute DCP. Film scenes and full screenplay were not inspected.

BAM’s 2026 exhibition synopsis and explicit credits for the 1999 film, presented as a 97-minute DCP. Film scenes and full screenplay were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "BFI explicitly verifies 1999 and David Cronenberg.",
  "dated": true,
  "year": 1999
}

AI Dungeon

AI Dungeon’s current product page describes player-directed, open-ended stories that can begin with custom scenarios or community-made adventures.

The separate archived AI Dungeon 2 repository explains an earlier implementation that organized text adventures as branching action-and-result trees before flattening them into training text.

That historical README describes fine-tuning GPT-2 on this material, giving a concrete account of how the earlier story generator was built.

Sources and details

AI Dungeon

{
  "access_scope": "Two manifestations: current Latitude product description with a 2026 copyright footer, and historical AI Dungeon 2 implementation README in a repository archived October 5, 2023. No current model, original release date, individual development task or equivalence of implementations inferred.",
  "authors": [
    "Latitude"
  ],
  "authors_in_source_order": [
    "Latitude"
  ],
  "dates": {
    "current_page_copyright": "2026",
    "retrieved_utc": "2026-10-08T08:19:18.711595+00:00"
  },
  "id": "work-coverage-883440ebd71602::S1",
  "title": "AI Dungeon",
  "url": "https://aidungeon.com/"
}

AI Dungeon 2 archived implementation README

{
  "access_scope": "Two manifestations: current Latitude product description with a 2026 copyright footer, and historical AI Dungeon 2 implementation README in a repository archived October 5, 2023. No current model, original release date, individual development task or equivalence of implementations inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "repository_archived": "2023-10-05"
  },
  "id": "work-coverage-883440ebd71602::S2",
  "title": "AI Dungeon 2 archived implementation README",
  "url": "https://github.com/latitudegames/AIDungeon"
}

Two manifestations: current Latitude product description with a 2026 copyright footer, and historical AI Dungeon 2 implementation README in a repository archived October 5, 2023. No current model, original release date, individual development task or equivalence of implementations inferred.

That historical README describes fine-tuning GPT-2 on this material, giving a concrete account of how the earlier story generator was built without identifying the model behind today’s hosted game.

Two manifestations: current Latitude product description with a 2026 copyright footer, and historical AI Dungeon 2 implementation README in a repository archived October 5, 2023. No current model, original release date, individual development task or equivalence of implementations inferred.

That historical README describes fine-tuning GPT-2 on this material, giving a concrete account of how the earlier story generator was built without identifying the model behind today’s hosted game.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2019
}

ELIZA—A Computer Program for the Study of Natural Language Communication Between Man and Machine

The ELIZAGEN archival account distinguishes ELIZA’s general conversational interpreter from the separate DOCTOR script that supplies its familiar therapist-style responses.

It describes the original MAD-SLIP implementation’s pattern-matching and reassembly functions as the mechanism for parsing input and constructing replies.

Its reading of the recovered code explains a memory rule that cycles a counter and, under specified conditions, returns an older stored response when no keyword matches.

Sources and details

Joseph Weizenbaum’s Original ELIZA

{
  "access_scope": "Jeff Shrager’s signed May 23, 2021 account and reading notes on recovered ELIZA code. Original archival scan and later translations were not inspected; interpreter, script and Lisp reconstruction remain distinct.",
  "authors": [
    "Jeff Shrager"
  ],
  "authors_in_source_order": [
    "Jeff Shrager"
  ],
  "dates": {
    "curator_account_date": "2021-05-23",
    "retrieved_utc": "2026-10-08T08:19:18.711785+00:00"
  },
  "id": "work-coverage-60bccf44eef257::S1",
  "title": "Joseph Weizenbaum’s Original ELIZA",
  "url": "https://sites.google.com/view/elizagen-org/original-eliza"
}

Jeff Shrager’s signed May 23, 2021 account and reading notes on recovered ELIZA code. Original archival scan and later translations were not inspected; interpreter, script and Lisp reconstruction remain distinct.

Jeff Shrager’s signed May 23, 2021 account and reading notes on recovered ELIZA code. Original archival scan and later translations were not inspected; interpreter, script and Lisp reconstruction remain distinct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1966
}

Leviathan

Hobbes introduces the commonwealth as an artificial person whose sovereignty, laws, officers and rewards correspond to the working parts of a living body.

In Chapter XVII, he describes people forming that political person by mutually authorizing one ruler or assembly to act for them in matters of common peace and safety.

The resulting authority concentrates their combined strength for protection and common defence, making political unity the means by which the artificial body performs its purpose.

Sources and details

Leviathan

{
  "access_scope": "Selected introduction and Chapter XVII passages from Gutenberg ebook 3207, a transcription based on Pelican Classics prepared from the first edition. The transcriber identifies changes to italics, capitals, margin notes and Greek lettering; this is not an audit of all chapters or a facsimile of the 1651 printing.",
  "authors": [
    "Thomas Hobbes"
  ],
  "authors_in_source_order": [
    "Thomas Hobbes"
  ],
  "dates": {
    "gutenberg_release": "2002-05-01",
    "gutenberg_update": "2025-09-17",
    "original_title_print_date": "1651",
    "retrieved_utc": "2026-10-08T08:19:19.445096+00:00"
  },
  "id": "work-culture-27673d471af07a::S1",
  "title": "Leviathan",
  "url": "https://www.gutenberg.org/cache/epub/3207/pg3207-images.html"
}

Selected introduction and Chapter XVII passages from Gutenberg ebook 3207, a transcription based on Pelican Classics prepared from the first edition. The transcriber identifies changes to italics, capitals, margin notes and Greek lettering; this is not an audit of all chapters or a facsimile of the 1651 printing.

Selected introduction and Chapter XVII passages from Gutenberg ebook 3207, a transcription based on Pelican Classics prepared from the first edition. The transcriber identifies changes to italics, capitals, margin notes and Greek lettering; this is not an audit of all chapters or a facsimile of the 1651 printing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 1651
}

How to promote AI in the US federal government: Insights from policy process frameworks

The preprint frames federal AI adoption as a policy problem shaped by ethical and legal concerns, ageing infrastructure, staff preparedness, institutions and social acceptance.

It surveys policy-process literature to examine why federal AI adoption advances or stalls.

Its comparison draws on coalition, agenda-setting, institutional, diffusion and narrative frameworks to identify possible policies for AI-supported government functions.

Sources and details

How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks

{
  "access_scope": "Author/publisher-supplied abstract and ordered citation for the 2023 SocArXiv preprint vm43w, DOI 10.31235/osf.io/vm43w, hosted by RePEc. Distinct from the 2024 Government Information Quarterly article; neither full preprint nor final journal text was inspected.",
  "authors": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "authors_in_source_order": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "dates": {
    "citation_publication_date": "2023/04/24",
    "retrieved_utc": "2026-10-08T08:19:18.711806+00:00",
    "socarxiv_preprint_citation": "2023"
  },
  "id": "work-focused-2dc5980024f828::S1",
  "title": "How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks",
  "url": "https://ideas.repec.org/p/osf/socarx/vm43w.html"
}

Author/publisher-supplied abstract and ordered citation for the 2023 SocArXiv preprint vm43w, DOI 10.31235/osf.io/vm43w, hosted by RePEc. Distinct from the 2024 Government Information Quarterly article; neither full preprint nor final journal text was inspected.

It surveys policy-process literature to examine why adoption advances or stalls, rather than presenting a measured effect of one deployment programme.

Author/publisher-supplied abstract and ordered citation for the 2023 SocArXiv preprint vm43w, DOI 10.31235/osf.io/vm43w, hosted by RePEc. Distinct from the 2024 Government Information Quarterly article; neither full preprint nor final journal text was inspected.

It surveys policy-process literature to examine why adoption advances or stalls, rather than presenting a measured effect of one deployment programme.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2024-03",
      "kind": "issue_date",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024-03"
}

Hick–Hyman Law

The 2013 Frontiers study describes Hick–Hyman’s Law as a linear relationship between choice reaction time and task difficulty measured in information bits.

Its experiment compared a reaction-time task and a rapid-aiming task in 10 young adults and 14 older adults, varying difficulty across five levels in each task.

The older participants had steeper Hick–Hyman and Fitts slopes, while the two slopes differed in the young group but not in the older group.

Sources and details

Frontiers | Age-related dedifferentiation of cognitive and motor slowing: insight from the comparison of Hick–Hyman and Fitts’ laws

{
  "access_scope": "Frontiers in Aging Neuroscience, October 10, 2013, DOI 10.3389/fnagi.2013.00062; introduction and abstract of Sleimen-Malkoun, Temprado and Berton’s experiment. This is a later study of choice reaction time and aging, not the original Hick/Hyman publications or proof of a universal rule; the observed group differences do not establish a neural cause.",
  "authors": [
    "Rita Sleimen-Malkoun",
    "Jean-Jacques Temprado",
    "Eric Berton"
  ],
  "authors_in_source_order": [
    "Rita Sleimen-Malkoun",
    "Jean-Jacques Temprado",
    "Eric Berton"
  ],
  "dates": {
    "citation_publication_date": "2013/10/10",
    "inspected_source_date_1": "October 10, 2013",
    "retrieved_utc": "2026-10-08T08:23:41.254932+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 10, 2013"
  ],
  "id": "concept-law-hick::S1",
  "title": "Frontiers | Age-related dedifferentiation of cognitive and motor slowing: insight from the comparison of Hick–Hyman and Fitts’ laws",
  "url": "https://www.frontiersin.org/journals/aging-neuroscience/articles/10.3389/fnagi.2013.00062/full"
}

Frontiers in Aging Neuroscience, October 10, 2013, DOI 10.3389/fnagi.2013.00062; introduction and abstract of Sleimen-Malkoun, Temprado and Berton’s experiment. This is a later study of choice reaction time and aging, not the original Hick/Hyman publications or proof of a universal rule; the observed group differences do not establish a neural cause.

Frontiers in Aging Neuroscience, October 10, 2013, DOI 10.3389/fnagi.2013.00062; introduction and abstract of Sleimen-Malkoun, Temprado and Berton’s experiment. This is a later study of choice reaction time and aging, not the original Hick/Hyman publications or proof of a universal rule; the observed group differences do not establish a neural cause.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Grosch’s law

In his August 28, 1970 oral history, Herb Grosch recalls an early square-root economy rule and distinguishes a precursor he discussed at the 1950 Endicott meeting from its later publication.

He says the observations behind the rule included longhand calculation, logarithm tables, desk calculators and relay machines, rather than only electronic computers.

Grosch suggests that equipment pricing based on the rule could help perpetuate its apparent validity, offering a possible economic explanation.

Sources and details

Herb Grosch Interview, August 28, 1970, Computer Oral History Collection

{
  "access_scope": "Smithsonian Archives Center, Herb Grosch interview dated August 28, 1970, PDF pages 26–27. This is Grosch’s retrospective account and explicitly speculative pricing explanation; it does not establish an exact first-publication year, a universal cost formula or applicability to current computing markets.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Interview: August 28, 1970",
    "retrieved_utc": "2026-10-08T08:23:41.254966+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Interview: August 28, 1970"
  ],
  "id": "concept-law-grosch::S1",
  "title": "Herb Grosch Interview, August 28, 1970, Computer Oral History Collection",
  "url": "https://mads.si.edu/mads/id/NMAH-AC0196_gros700828"
}

Smithsonian Archives Center, Herb Grosch interview dated August 28, 1970, PDF pages 26–27. This is Grosch’s retrospective account and explicitly speculative pricing explanation; it does not establish an exact first-publication year, a universal cost formula or applicability to current computing markets.

Grosch suggests that equipment pricing based on the rule could help perpetuate its apparent validity, offering a possible economic explanation rather than demonstrating a universal mathematical law.

Smithsonian Archives Center, Herb Grosch interview dated August 28, 1970, PDF pages 26–27. This is Grosch’s retrospective account and explicitly speculative pricing explanation; it does not establish an exact first-publication year, a universal cost formula or applicability to current computing markets.

Grosch suggests that equipment pricing based on the rule could help perpetuate its apparent validity, offering a possible economic explanation rather than demonstrating a universal mathematical law.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Duncan Crabtree-Ireland

In his CES 2024 interview, Duncan Crabtree-Ireland, identified as SAG-AFTRA’s national executive director and chief negotiator, explains performer protections in terms of informed consent and fair compensation.

He distinguishes a digital replica that can generate a performance an actor never gave from a performance made on set, where the actor can refuse an action.

He presents collective bargaining and public policy as complementary approaches, with negotiated terms addressing participating employers and policy proposals addressing uses made without consent.

Sources and details

SAG-AFTRA Strike’s Impact on AI and Hollywood’s Future

{
  "access_scope": "CES Tech Talk interview from CES 2024, published March 11, 2024, transcript at 01:58, 02:55 and 05:35. These are Crabtree-Ireland’s dated explanations and advocacy; they do not establish current law, enactment of the then-pending NO FAKES proposal, sole negotiating credit or an acting/performance contribution.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Published March 11, 2024",
    "inspected_source_date_2": "Interview event: CES 2024",
    "retrieved_utc": "2026-10-08T08:23:41.255063+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published March 11, 2024",
    "Interview event: CES 2024"
  ],
  "id": "creative-person-coverage-0d13397abf2717::S1",
  "title": "SAG-AFTRA Strike’s Impact on AI and Hollywood’s Future",
  "url": "https://www.ces.tech/podcasts/sag-aftra-strike-s-impact-on-ai-and-hollywood-s-future/"
}

CES Tech Talk interview from CES 2024, published March 11, 2024, transcript at 01:58, 02:55 and 05:35. These are Crabtree-Ireland’s dated explanations and advocacy; they do not establish current law, enactment of the then-pending NO FAKES proposal, sole negotiating credit or an acting/performance contribution.

CES Tech Talk interview from CES 2024, published March 11, 2024, transcript at 01:58, 02:55 and 05:35. These are Crabtree-Ireland’s dated explanations and advocacy; they do not establish current law, enactment of the then-pending NO FAKES proposal, sole negotiating credit or an acting/performance contribution.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Constellation

In a September 20, 2024 announcement, Constellation describes a 20-year Microsoft power-purchase agreement supporting the planned restart of Three Mile Island Unit 1 as the Crane Clean Energy Center.

The release says preparation for the restart includes investment in the turbine, generator, main transformer, and cooling and control systems.

It presents 2028 as the expected online date and explicitly makes the restart subject to nuclear-regulator review and state and local permits, with a separate license-renewal request planned.

Sources and details

Constellation to Launch Crane Clean Energy Center, Restoring Jobs and Carbon-Free Power to The Grid

{
  "access_scope": "Dated September 20, 2024 corporate release; expected restart timing, restoration work and approval dependencies are attributed statements/plans, not current operational status, regulatory advice or independent safety/carbon-impact validation. Unit 1 is kept distinct from Unit 2. Refreshed About Constellation boilerplate and 2026 sidebar releases are not treated as 2024 facts; original investor URL and timeline holds remain.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "release_date": "2024-09-20",
    "retrieved_utc": "2026-10-08T08:20:33.795301+00:00"
  },
  "id": "supply-org-040::S1",
  "title": "Constellation to Launch Crane Clean Energy Center, Restoring Jobs and Carbon-Free Power to The Grid",
  "url": "https://www.constellationenergy.com/news/2024/Constellation-to-Launch-Crane-Clean-Energy-Center-Restoring-Jobs-and-Carbon-Free-Power-to-The-Grid.html"
}

Dated September 20, 2024 corporate release; expected restart timing, restoration work and approval dependencies are attributed statements/plans, not current operational status, regulatory advice or independent safety/carbon-impact validation. Unit 1 is kept distinct from Unit 2. Refreshed About Constellation boilerplate and 2026 sidebar releases are not treated as 2024 facts; original investor URL and timeline holds remain.

Dated September 20, 2024 corporate release; expected restart timing, restoration work and approval dependencies are attributed statements/plans, not current operational status, regulatory advice or independent safety/carbon-impact validation. Unit 1 is kept distinct from Unit 2. Refreshed About Constellation boilerplate and 2026 sidebar releases are not treated as 2024 facts; original investor URL and timeline holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

ServiceNow

In its May 7, 2024 release, ServiceNow describes Now Assist for Creator using natural-language prompts to generate workflow playbooks for repeatable service-delivery processes.

The company says app generation asks clarifying questions and builds components including tables, user roles, forms and service catalog items from those conversations.

It also describes knowledge-article generation drafting from incident or case records and work notes across its IT, customer-service and HR offerings.

Sources and details

ServiceNow powers enterprise-wide productivity and innovation with new generative AI capabilities

{
  "access_scope": "Static ServiceNow press-release body dated May 7, 2024, distinct from the March Washington DC release. Mechanisms are vendor descriptions; availability was expected May 9 with stated exceptions, not verified delivery, security/compliance or measured productivity. Original empty extracted.txt and prior source holds remain; media contact and quoted executives are not treated as document authors.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "availability_stated_as_expected": "2024-05-09; alert group simplification end of Q2; GCC second half 2024 or sooner pending FedRamp approval",
    "release_date": "2024-05-07",
    "retrieved_utc": "2026-10-08T08:20:30.317336+00:00"
  },
  "id": "organization-company-a11413b0a4a315::S1",
  "title": "ServiceNow powers enterprise-wide productivity and innovation with new generative AI capabilities",
  "url": "https://newsroom.servicenow.com/press-releases/details/2024/ServiceNow-powers-enterprise-wide-productivity-and-innovation-with-new-generative-AI-capabilities-05-07-2024-traffic/default.aspx"
}

Static ServiceNow press-release body dated May 7, 2024, distinct from the March Washington DC release. Mechanisms are vendor descriptions; availability was expected May 9 with stated exceptions, not verified delivery, security/compliance or measured productivity. Original empty extracted.txt and prior source holds remain; media contact and quoted executives are not treated as document authors.

Static ServiceNow press-release body dated May 7, 2024, distinct from the March Washington DC release. Mechanisms are vendor descriptions; availability was expected May 9 with stated exceptions, not verified delivery, security/compliance or measured productivity. Original empty extracted.txt and prior source holds remain; media contact and quoted executives are not treated as document authors.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official founder biography gives 2004 founding; an origin recollection describes work starting November 2003.",
      "date": "2004",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.servicenow.com/company/leadership/frederic-luddy.html",
        "https://www.servicenow.com/workflow/platform-foundations/how-servicenow-was-born.html",
        "https://www.servicenow.com/workflow/platform-foundations/servicenow-platform-first-forever.html"
      ],
      "year": 2004
    }
  ]
}

Anthony Daniels

Anthony Daniels explains that performing C-3PO required adapting his movement to a restrictive costume, whose limited mobility helped shape the droid’s distinctive walk.

His mime training let him react to R2-D2’s imagined sounds on set and convey emotion through small gestures despite C-3PO’s unchanging mask.

He describes C-3PO as prim and unfiltered but vulnerable, and credits the music and fellow actors with helping audiences read feelings such as sadness in his restrained performance.

Sources and details

Anthony Daniels Interview - I Am C-3PO | StarWars.com

{
  "access_scope": "Selected Anthony Daniels. Lucasfilm interview about I Am C-3PO and the Skywalker saga; participant recollection of performance, not sole credit for costume, score or other actors’ work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Kristin Baver"
  ],
  "authors_in_source_order": [
    "Kristin Baver"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T06:55:47.279441+00:00",
    "source_date": "2019-12-12"
  },
  "id": "person-coverage-8e22e7d7c41969::S1",
  "title": "Anthony Daniels Interview - I Am C-3PO | StarWars.com",
  "url": "https://www.starwars.com/news/anthony-daniels-memoir-interview"
}

Selected Anthony Daniels. Lucasfilm interview about I Am C-3PO and the Skywalker saga; participant recollection of performance, not sole credit for costume, score or other actors’ work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Anthony Daniels. Lucasfilm interview about I Am C-3PO and the Skywalker saga; participant recollection of performance, not sole credit for costume, score or other actors’ work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George A. Miller

George A. Miller began building WordNet in 1985 around the hypothesis that vocabulary is organized through links between related meanings rather than as an isolated list of words.

The Princeton account reports psychological experiments in which exposure to a related word accelerated recognition, illustrating the semantic connections that motivated the project.

WordNet’s noun categories later supplied a scaffold for Fei-Fei Li’s ImageNet project, connecting Miller’s lexical research to a visual dataset developed by other researchers.

Sources and details

In the hallways of Princeton, a fascination with the human mind unlocked the power of deep learning | CS

{
  "access_scope": "Selected George A. Miller. Princeton institutional retrospective, with Christiane Fellbaum’s recollection; ImageNet construction belongs to Li and collaborators, not to Miller. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Julia Schwarz"
  ],
  "authors_in_source_order": [
    "Julia Schwarz"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-07T18:21:11.265220+00:00",
    "source_date": "2025-09-22"
  },
  "id": "person-georgeamiller::S1",
  "title": "In the hallways of Princeton, a fascination with the human mind unlocked the power of deep learning | CS",
  "url": "https://www.cs.princeton.edu/news/hallways-princeton-fascination-human-mind-unlocked-power-deep-learning"
}

Selected George A. Miller. Princeton institutional retrospective, with Christiane Fellbaum’s recollection; ImageNet construction belongs to Li and collaborators, not to Miller. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected George A. Miller. Princeton institutional retrospective, with Christiane Fellbaum’s recollection; ImageNet construction belongs to Li and collaborators, not to Miller. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Iryna Zaporozhets

Iryna Zaporozhets is listed among the developers of BioEmu 1.0, a model that samples equilibrium ensembles of protein structures from an amino-acid sequence.

The joint model combines molecular-dynamics simulations, AlphaFold structures and experimental folding free energies in training, aiming to capture conformational changes such as domain motion and local unfolding.

The released model represents protein backbones and is intended for research; its card cautions that it does not generate new sequences and performs poorly on protein–protein or multichain modeling.

Sources and details

microsoft/bioemu · Hugging Face

{
  "access_scope": "Selected Iryna Zaporozhets. Microsoft BioEmu model card for BioEmu 1.0 and its amber-fine-tuned release; its cited 2024 preprint is not an audit of the later Science paper. Joint development does not establish individualized training or implementation tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Sarah Lewis",
    "Tim Hempel",
    "José Jiménez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor García Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "Iryna Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "authors_in_source_order": [
    "Sarah Lewis",
    "Tim Hempel",
    "José Jiménez-Luna",
    "Michael Gastegger",
    "Yu Xie",
    "Andrew Y. K. Foong",
    "Victor García Satorras",
    "Osama Abdin",
    "Bastiaan S. Veeling",
    "Iryna Zaporozhets",
    "Yaoyi Chen",
    "Soojung Yang",
    "Arne Schneuing",
    "Jigyasa Nigam",
    "Federico Barbero",
    "Vincent Stimper",
    "Andrew Campbell",
    "Jason Yim",
    "Marten Lienen",
    "Yu Shi",
    "Shuxin Zheng",
    "Hannes Schulz",
    "Usman Munir",
    "Cecilia Clementi",
    "Frank Noé"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-07T18:16:41.962223+00:00",
    "source_date": null
  },
  "id": "person-coverage-af97ea1cca2e34::S1",
  "title": "microsoft/bioemu · Hugging Face",
  "url": "https://huggingface.co/microsoft/bioemu"
}

Selected Iryna Zaporozhets. Microsoft BioEmu model card for BioEmu 1.0 and its amber-fine-tuned release; its cited 2024 preprint is not an audit of the later Science paper. Joint development does not establish individualized training or implementation tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Iryna Zaporozhets. Microsoft BioEmu model card for BioEmu 1.0 and its amber-fine-tuned release; its cited 2024 preprint is not an audit of the later Science paper. Joint development does not establish individualized training or implementation tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lilly Wachowski

Lilly Wachowski is credited alongside Lana Wachowski as a director of The Matrix, which presents the apparently ordinary world as an elaborate illusion controlled by artificial intelligence.

Warner Bros. describes the joint film as a cyberthriller built around mental acrobatics, technologically striking imagery and action.

The protagonists’ struggle to free humanity turns the discovery of that illusion into a liberation story, as described in the distributor’s synopsis.

Sources and details

Matrix - Warner Bros. Entertainment Italia

{
  "access_scope": "Selected Lilly Wachowski. Warner Bros. Italian distributor page: ordered directors Lana Wachowski, Lilly Wachowski, both explicitly credited “as The Wachowski Brothers.” The 16 July 2014 date is availability, not original theatrical release. Narrative statements describe the joint film, not Lilly’s individual screenplay or effects tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Lana Wachowski",
    "Lilly Wachowski"
  ],
  "authors_in_source_order": [
    "Lana Wachowski",
    "Lilly Wachowski"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-07T18:15:19.224457+00:00",
    "source_date": null
  },
  "id": "person-coverage-cee41735d81516::S1",
  "title": "Matrix - Warner Bros. Entertainment Italia",
  "url": "https://www.warnerbros.it/scheda-film/genere-azione/matrix/"
}

Selected Lilly Wachowski. Warner Bros. Italian distributor page: ordered directors Lana Wachowski, Lilly Wachowski, both explicitly credited “as The Wachowski Brothers.” The 16 July 2014 date is availability, not original theatrical release. Narrative statements describe the joint film, not Lilly’s individual screenplay or effects tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Lilly Wachowski. Warner Bros. Italian distributor page: ordered directors Lana Wachowski, Lilly Wachowski, both explicitly credited “as The Wachowski Brothers.” The 16 July 2014 date is availability, not original theatrical release. Narrative statements describe the joint film, not Lilly’s individual screenplay or effects tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Miner

Michael Miner collaborated with Edward Neumeier on RoboCop after Neumeier showed him an existing treatment; Neumeier recalls that they wrote the subsequent drafts together.

Their shared writing sessions alternated between one partner typing and the other sitting or pacing, a working method Neumeier describes as part of developing the screenplay.

They later co-wrote the Future of Law Enforcement television pilot, reusing a woman-in-the-computer idea from their unproduced RoboCop sequel script rather than from the released second film.

Sources and details

MONEY INTO LIGHT: EDWARD NEUMEIER TALKS ABOUT 'ROBOCOP'

{
  "access_scope": "Selected Michael Miner. Paul Rowlands interview with Edward Neumeier, conducted by telephone July 23 2012 and email July 2013. Joint screenwriting recollection; subsequent drafts distinguished from Neumeier’s initial treatment and the unproduced Corporate Wars sequel distinguished from RoboCop 2. No specific scene assigned to Miner. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Paul Rowlands"
  ],
  "authors_in_source_order": [
    "Paul Rowlands"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T06:55:42.588156+00:00",
    "source_date": "2013-07"
  },
  "id": "person-coverage-3139ec22b2f390::S1",
  "title": "MONEY INTO LIGHT: EDWARD NEUMEIER TALKS ABOUT 'ROBOCOP'",
  "url": "https://www.money-into-light.com/2013/07/edward-neumeier-talks-about-robocop.html"
}

Selected Michael Miner. Paul Rowlands interview with Edward Neumeier, conducted by telephone July 23 2012 and email July 2013. Joint screenwriting recollection; subsequent drafts distinguished from Neumeier’s initial treatment and the unproduced Corporate Wars sequel distinguished from RoboCop 2. No specific scene assigned to Miner. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Michael Miner. Paul Rowlands interview with Edward Neumeier, conducted by telephone July 23 2012 and email July 2013. Joint screenwriting recollection; subsequent drafts distinguished from Neumeier’s initial treatment and the unproduced Corporate Wars sequel distinguished from RoboCop 2. No specific scene assigned to Miner. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Naoyoshi Shiotani

Naoyoshi Shiotani describes directing Tokyo Marble Chocolate as two simultaneous stories that develop the same young couple through contrasting viewpoints.

He personally created the fictional Mini Donkey, intending its initially irritating behavior to become appealing as it connects the two protagonists.

The parallel timelines required matching small background details and the aftermath of the donkey’s actions, so work on one version sometimes depended on animation being settled in the other.

Sources and details

Production I.G [WORK LIST[Details]]

{
  "access_scope": "Selected Naoyoshi Shiotani. Production I.G director interview, part 2, specifically Tokyo Marble Chocolate rather than Psycho-Pass. ©2007 project notice is not an asserted interview publication date. Fumiko Tanikawa designed the main characters; Kyoji Asano adapted designs and designed supporting characters; background artists performed the described background work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Naoyoshi Shiotani"
  ],
  "authors_in_source_order": [
    "Naoyoshi Shiotani"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-07T18:14:26.564311+00:00",
    "source_date": null
  },
  "id": "person-coverage-48342b2062abbf::S1",
  "title": "Production I.G [WORK LIST[Details]]",
  "url": "https://www.productionig.com/contents/works_sp/59_/s08_/000863.html"
}

Selected Naoyoshi Shiotani. Production I.G director interview, part 2, specifically Tokyo Marble Chocolate rather than Psycho-Pass. ©2007 project notice is not an asserted interview publication date. Fumiko Tanikawa designed the main characters; Kyoji Asano adapted designs and designed supporting characters; background artists performed the described background work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Naoyoshi Shiotani. Production I.G director interview, part 2, specifically Tokyo Marble Chocolate rather than Psycho-Pass. ©2007 project notice is not an asserted interview publication date. Fumiko Tanikawa designed the main characters; Kyoji Asano adapted designs and designed supporting characters; background artists performed the described background work. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rodney Brooks

Rodney Brooks describes Baxter as a tool for factory workers, with Rethink Robotics allowing operators to teach repetitive tasks by moving the robot’s arms and using its controls.

The company’s field research led Brooks and colleagues to discard speech interfaces in noisy factories and touchscreens where workers wore gloves, adapting the robot to its actual workplace.

Baxter combines displays of attention with proximity and joint sensing to support work near people, while its force-sensing series elastic actuators are credited to Gill Pratt and Matt Williamson rather than to Brooks alone.

Sources and details

Professor emeritus Rodney Brooks refines the sequel to iRobot | MIT News | Massachusetts Institute of Technology

{
  "access_scope": "Selected Rodney Brooks. MIT News report dated August 9 2013, discussing the manufacturing Baxter released that January and distinguishing the research variant introduced in May. Company engineering is joint; actuator invention is explicitly credited to Gill Pratt and Matt Williamson. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "Rob Matheson"
  ],
  "authors_in_source_order": [
    "Rob Matheson"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T06:53:55.859342+00:00",
    "source_date": "2013-08-09"
  },
  "id": "person-rodneybrooks::S1",
  "title": "Professor emeritus Rodney Brooks refines the sequel to iRobot | MIT News | Massachusetts Institute of Technology",
  "url": "https://news.mit.edu/2013/rodney-brooks-rethink-robotics-0809"
}

Selected Rodney Brooks. MIT News report dated August 9 2013, discussing the manufacturing Baxter released that January and distinguishing the research variant introduced in May. Company engineering is joint; actuator invention is explicitly credited to Gill Pratt and Matt Williamson. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Rodney Brooks. MIT News report dated August 9 2013, discussing the manufacturing Baxter released that January and distinguishing the research variant introduced in May. Company engineering is joint; actuator invention is explicitly credited to Gill Pratt and Matt Williamson. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lillian M. Gilbreth

Lillian M. Gilbreth is listed with James S. Perkins and Ralph M. Barnes as a producer of the 1945 compilation Original Films of Frank B. Gilbreth.

The anthology assembles footage from Frank Gilbreth’s motion studies and family films, showing the use of recorded movement in experiments on work efficiency.

The preservation account distinguishes the 25-minute compilation from a 26-minute version narrated by Perkins, preserving the difference between the original study footage and later presentations of it.

Sources and details

National Film Preservation Foundation: Original Films of Frank B. Gilbreth (1945)

{
  "access_scope": "Selected Lillian M. Gilbreth. National Film Preservation Foundation record for the 1945 compilation; ordered producers James S. Perkins, Lillian M. Gilbreth, Ralph M. Barnes. Motion studies are credited to Frank Gilbreth; this establishes Lillian’s compilation-producer role, not individual filming or experimental tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.",
  "authors": [
    "James S. Perkins",
    "Lillian M. Gilbreth",
    "Ralph M. Barnes"
  ],
  "authors_in_source_order": [
    "James S. Perkins",
    "Lillian M. Gilbreth",
    "Ralph M. Barnes"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T07:02:51.125754+00:00",
    "source_date": null
  },
  "id": "person-lillianmgilbreth::S1",
  "title": "National Film Preservation Foundation: Original Films of Frank B. Gilbreth (1945)",
  "url": "https://www.filmpreservation.org/preserved-films/screening-room/original-films-of-frank-b-gilbreth-1945"
}

Selected Lillian M. Gilbreth. National Film Preservation Foundation record for the 1945 compilation; ordered producers James S. Perkins, Lillian M. Gilbreth, Ralph M. Barnes. Motion studies are credited to Frank Gilbreth; this establishes Lillian’s compilation-producer role, not individual filming or experimental tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

Selected Lillian M. Gilbreth. National Film Preservation Foundation record for the 1945 compilation; ordered producers James S. Perkins, Lillian M. Gilbreth, Ralph M. Barnes. Motion studies are credited to Frank Gilbreth; this establishes Lillian’s compilation-producer role, not individual filming or experimental tasks. Actual cached HTML/text inspected; root source-choice admission and independent factual review remain required.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Tien-Ju Yang

Tien-Ju Yang co-authored NetAdapt, an algorithm that progressively simplifies a pretrained neural network for a mobile platform’s resource budget.

The authors use empirical latency and energy measurements rather than relying only on operation or weight counts as proxies.

Their ImageNet experiments on MobileNets V1 and V2 report up to 1.7 times faster measured inference with equal or higher accuracy, within the studied mobile-platform comparisons.

Sources and details

[1804.03230] NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applications

{
  "access_scope": "arXiv1804.03230v2 abstract, not fullPDF; jointly reported algorithm and experiment, no individual task allocation or general performance guarantee. AcceptedECCV2018 comment distinct arXivversion.",
  "authors": [
    "Tien-Ju Yang",
    "Andrew Howard",
    "Bo Chen",
    "Xiao Zhang",
    "Alec Go",
    "Mark Sandler",
    "Vivienne Sze",
    "Hartwig Adam"
  ],
  "authors_in_source_order": [
    "Tien-Ju Yang",
    "Andrew Howard",
    "Bo Chen",
    "Xiao Zhang",
    "Alec Go",
    "Mark Sandler",
    "Vivienne Sze",
    "Hartwig Adam"
  ],
  "dates": {
    "citation_date": "2018/04/09",
    "inspected_revision": "Fri, 28 Sep 2018 19:20:16 UTC (2,325 KB)",
    "retrieved_utc": "2026-10-08T08:22:15.593476+00:00",
    "v1": "2018-04-09",
    "v2": "2018-09-28",
    "version": "arXiv v2"
  },
  "id": "person-coverage-a7db6a3a963117::S1",
  "title": "[1804.03230] NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applications",
  "url": "https://arxiv.org/abs/1804.03230",
  "version_url": "https://arxiv.org/abs/1804.03230v2"
}

arXiv1804.03230v2 abstract, not fullPDF; jointly reported algorithm and experiment, no individual task allocation or general performance guarantee. AcceptedECCV2018 comment distinct arXivversion.

arXiv1804.03230v2 abstract, not fullPDF; jointly reported algorithm and experiment, no individual task allocation or general performance guarantee. AcceptedECCV2018 comment distinct arXivversion.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Baowei Mi

Baowei Mi’s repository describes a Tripolar Capital Dynamics Model linking microscopic Langevin dynamics with macroscopic tensor coupling for systemic-risk modeling.

Its stated risk measure combines material, energy and information poles with network friction, thermalization and redundancy factors.

The README lists modules for stochastic wealth simulation, sensitivity analysis and policy or external-shock scenarios.

Sources and details

GitHub - wealth-dynamics-lab/tripolar-capital-dynamics · GitHub

{
  "access_scope": "Author-credited repository README only; no code execution, peer review or empirical forecast validation asserted. README restricts commercial use while repository footer says MITlicense; conflict preserved, no source/code redistribution.",
  "authors": [
    "Baowei Mi"
  ],
  "authors_in_source_order": [
    "Baowei Mi"
  ],
  "dates": {
    "README_last_updated": "April 2026",
    "retrieved_utc": "2026-10-08T08:22:16.582295+00:00"
  },
  "id": "person-coverage-acbed9619db4c7::S1",
  "title": "GitHub - wealth-dynamics-lab/tripolar-capital-dynamics · GitHub",
  "url": "https://github.com/wealth-dynamics-lab/tripolar-capital-dynamics"
}

Author-credited repository README only; no code execution, peer review or empirical forecast validation asserted. README restricts commercial use while repository footer says MITlicense; conflict preserved, no source/code redistribution.

The README lists modules for stochastic wealth simulation, sensitivity analysis and policy or external-shock scenarios, describing a computational project rather than validated economic forecasts.

Author-credited repository README only; no code execution, peer review or empirical forecast validation asserted. README restricts commercial use while repository footer says MITlicense; conflict preserved, no source/code redistribution.

The README lists modules for stochastic wealth simulation, sensitivity analysis and policy or external-shock scenarios, describing a computational project rather than validated economic forecasts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Henry W. Chesbrough

Henry W. Chesbrough’s Linux Foundation case examines security governance across an open-source consortium whose developers are not its employees.

The case centers on the late-2021 log4j vulnerability and the request for president Jim Zemlin to develop a security plan after a White House invitation.

It asks how Zemlin could influence developers without direct authority, framing a management problem.

Sources and details

Leading Through Influence at Scale: Open Source Security at the Linux Foundation | California Management Review

{
  "access_scope": "Publishercaseabstract only; not purchased10pagecase, no solution or efficacy inference.",
  "authors": [
    "Henry W. Chesbrough"
  ],
  "authors_in_source_order": [
    "Henry W. Chesbrough"
  ],
  "dates": {
    "publication": "2022-10-01",
    "retrieved_utc": "2026-10-08T08:22:15.992864+00:00"
  },
  "id": "person-henrywchesbrough::S1",
  "title": "Leading Through Influence at Scale: Open Source Security at the Linux Foundation | California Management Review",
  "url": "https://cmr.berkeley.edu/2022/10/linuxfoundation/"
}

Publishercaseabstract only; not purchased10pagecase, no solution or efficacy inference.

It asks how Zemlin could influence developers without direct authority, framing a management problem without claiming that a particular solution succeeded.

Publishercaseabstract only; not purchased10pagecase, no solution or efficacy inference.

It asks how Zemlin could influence developers without direct authority, framing a management problem without claiming that a particular solution succeeded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Emily Bender

Emily Bender’s University of Washington profile places her work across grammar engineering, linguistic typology and the societal effects of language technology.

It credits her as principal investigator of the LinGO Grammar Matrix and jointly with Fei Xia on generating grammars for endangered languages from glosses and typological information.

With Gina Levow, she is also listed as co-principal investigator of shared-task evaluation campaigns using endangered-language data.

Sources and details

Emily M. Bender | Department of Linguistics | University of Washington

{
  "access_scope": "Same-source explicit EmilyBenderCoPI/name and EmilyM.Benderprofile bridge. Institutionalresearch listing, jointroles retained; noindividualimplementation or inferred results, historicalprojects notasserted ongoing.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:17.199159+00:00"
  },
  "id": "person-coverage-381e5103e4ffbc::S1",
  "title": "Emily M. Bender | Department of Linguistics | University of Washington",
  "url": "https://linguistics.washington.edu/people/emily-m-bender"
}

Same-source explicit EmilyBenderCoPI/name and EmilyM.Benderprofile bridge. Institutionalresearch listing, jointroles retained; noindividualimplementation or inferred results, historicalprojects notasserted ongoing.

Same-source explicit EmilyBenderCoPI/name and EmilyM.Benderprofile bridge. Institutionalresearch listing, jointroles retained; noindividualimplementation or inferred results, historicalprojects notasserted ongoing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Steve Roberts

In Michael Synergy’s interview, Steve Roberts recalls Max Headroom growing from a request for a pop-video show into a longer fictional introduction to its computer-generated character.

He describes the writing as extrapolating social problems, including a story in which recorded dreams become entertainment commodities.

Roberts says he read Neuromancer only after writing the first several episodes.

Sources and details

The Rise and Fall of Max Headroom | Network 47

{
  "access_scope": "Attributed primaryinterview reprinted fromMondo2000No1/RealityHackersNo7Fall1989pp67–73; STEVEROBERTS/SRanswer mapping explicit. OnlyRobertsanswers used, notWagganswers orfictionalouttakes; selfreportedrecollections, noindependentinfluenceproof.",
  "authors": [
    "Michael Synergy"
  ],
  "authors_in_source_order": [
    "Michael Synergy"
  ],
  "dates": {
    "original_issue": "Fall 1989",
    "retrieved_utc": "2026-10-08T08:22:17.712177+00:00"
  },
  "id": "person-coverage-679d4cbbfc7386::S1",
  "title": "The Rise and Fall of Max Headroom | Network 47",
  "url": "https://network47.org/vault/max-headroom/the-rise-and-fall-of-max-headroom/"
}

Attributed primaryinterview reprinted fromMondo2000No1/RealityHackersNo7Fall1989pp67–73; STEVEROBERTS/SRanswer mapping explicit. OnlyRobertsanswers used, notWagganswers orfictionalouttakes; selfreportedrecollections, noindependentinfluenceproof.

Roberts says he read Neuromancer only after writing the first several episodes, bounding his account of the similarities rather than proving literary influence.

Attributed primaryinterview reprinted fromMondo2000No1/RealityHackersNo7Fall1989pp67–73; STEVEROBERTS/SRanswer mapping explicit. OnlyRobertsanswers used, notWagganswers orfictionalouttakes; selfreportedrecollections, noindependentinfluenceproof.

Roberts says he read Neuromancer only after writing the first several episodes, bounding his account of the similarities rather than proving literary influence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Paul J. DiMaggio

Paul J. DiMaggio’s academy profile describes research on social organization, economic markets and the cultural effects of information technology.

It identifies studies of network externalities and inequality, Internet use and wages, and topic models applied to culture.

The profile also records his leadership of Yale’s nonprofit-organizations program and Princeton’s social-organization center, placing those research interests in institutional settings.

Sources and details

Paul J. DiMaggio – AAPSS

{
  "access_scope": "Academybiography snapshot; topics and historicalroles only, no inferred causal paperfindings orcurrentappointments; 2005fellowyear distinct undatedbiography.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:19.030498+00:00"
  },
  "id": "person-coverage-cef800757b79c0::S1",
  "title": "Paul J. DiMaggio – AAPSS",
  "url": "https://www.aapss.org/fellows/fellow/paul-dimaggio/"
}

Academybiography snapshot; topics and historicalroles only, no inferred causal paperfindings orcurrentappointments; 2005fellowyear distinct undatedbiography.

Academybiography snapshot; topics and historicalroles only, no inferred causal paperfindings orcurrentappointments; 2005fellowyear distinct undatedbiography.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Yoav Shoham

Yoav Shoham’s Stanford profile connects academic work in artificial intelligence with founding companies including TradingDynamics, Katango, Timeful and AI21 Labs.

It describes his chairmanship of the AI Index initiative, which tracks global AI activity and progress.

The profile also credits him with chairing WeCode, a nonprofit program for training programmers from disadvantaged populations.

Sources and details

Yoav Shoham's Profile | Stanford Profiles

{
  "access_scope": "Institutionalbiography snapshot atretrieval, notindependentcompanyoutcomevalidation; publicationlist includes unrelatedbiologicalnamesakearticle, excluded. Noindividualtechnicaltask allocation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:18.162415+00:00"
  },
  "id": "person-yoavshoham::S1",
  "title": "Yoav Shoham's Profile | Stanford Profiles",
  "url": "https://profiles.stanford.edu/yoav-shoham"
}

Institutionalbiography snapshot atretrieval, notindependentcompanyoutcomevalidation; publicationlist includes unrelatedbiologicalnamesakearticle, excluded. Noindividualtechnicaltask allocation.

Institutionalbiography snapshot atretrieval, notindependentcompanyoutcomevalidation; publicationlist includes unrelatedbiologicalnamesakearticle, excluded. Noindividualtechnicaltask allocation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Walter W. Powell

Walter W. Powell’s Stanford research statement examines how knowledge moves across organizations and how networks can aid or hinder innovation.

With Jeannette Colyvas, he studies university technology transfer and the institutionalization of faculty commercial engagement.

His collaboration with Jason Owen-Smith examines changing life-science networks and the boundaries between public and private science.

Sources and details

Walter W. Powell | Stanford Graduate School of Business

{
  "access_scope": "Institutionalresearchstatement; collaborators retained, researchquestions notreportedempiricaloutcomes, undatedcurrentwording notfresh2026validation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:19.285154+00:00"
  },
  "id": "person-coverage-332687e45f9dca::S1",
  "title": "Walter W. Powell | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/faculty-research/faculty/walter-w-powell"
}

Institutionalresearchstatement; collaborators retained, researchquestions notreportedempiricaloutcomes, undatedcurrentwording notfresh2026validation.

Institutionalresearchstatement; collaborators retained, researchquestions notreportedempiricaloutcomes, undatedcurrentwording notfresh2026validation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lisa Su

In her Stanford interview, Lisa Su presents AMD’s computing strategy as matching hardware to applications across cloud, edge and personal AI.

She describes an open approach that lets customers and partners select components, while acknowledging the extra interoperability work this requires.

Su also emphasizes using conversations with customers and partners to test the roadmap and adapt as technology changes.

Sources and details

“Dream Big”: Lisa Su Talks Chips, Curiosity, and Chance | Stanford Graduate School of Business

{
  "access_scope": "Primaryinterview LisaSuanswers only; strategicbeliefs andintentions attributed, notforecastverification, noinferredindividualchipdesign. InterviewerMichaelLiu and hostdiscussion distinct.",
  "authors": [
    "Michael Liu"
  ],
  "authors_in_source_order": [
    "Michael Liu"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:19.367063+00:00"
  },
  "id": "person-coverage-0c81eace99025e::S1",
  "title": "“Dream Big”: Lisa Su Talks Chips, Curiosity, and Chance | Stanford Graduate School of Business",
  "url": "https://www.gsb.stanford.edu/insights/dream-big-lisa-su-talks-chips-curiosity-chance"
}

Primaryinterview LisaSuanswers only; strategicbeliefs andintentions attributed, notforecastverification, noinferredindividualchipdesign. InterviewerMichaelLiu and hostdiscussion distinct.

Su also emphasizes using conversations with customers and partners to test the roadmap and adapt as technology changes, presenting management intentions rather than measured results.

Primaryinterview LisaSuanswers only; strategicbeliefs andintentions attributed, notforecastverification, noinferredindividualchipdesign. InterviewerMichaelLiu and hostdiscussion distinct.

Su also emphasizes using conversations with customers and partners to test the roadmap and adapt as technology changes, presenting management intentions rather than measured results.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

C.C. Wei

C.C. Wei’s semiconductor-industry profile traces his TSMC leadership from co-chief operating officer to president and co-CEO, then CEO from 2018 to 2024.

It describes earlier responsibilities in technology development at Chartered Semiconductor and logic and SRAM development at ST Microelectronics.

In the joint Noyce Award announcement with Mark Liu, Wei attributes the recognition to employees and customers, preserving the collective scope of manufacturing achievements.

Sources and details

TSMC’s Dr. C.C. Wei and Dr. Mark Liu to Receive SIA’s Highest Honor - Semiconductor Industry Association

{
  "access_scope": "SIAJuly2025announcement profile andattributedWeiquote; plannedNov20awardacceptance notclaimedcompleted, sharedrecipientMarkLiu/collectivecontributions preserved. Snapshotcompanytitles notassumedOct2026.",
  "authors": [
    "Semiconductor Industry Association"
  ],
  "authors_in_source_order": [
    "Semiconductor Industry Association"
  ],
  "dates": {
    "planned_award_event": "2025-11-20",
    "publication": "2025-07-28",
    "retrieved_utc": "2026-10-08T08:22:20.508330+00:00"
  },
  "id": "person-coverage-5be71427b1bc17::S1",
  "title": "TSMC’s Dr. C.C. Wei and Dr. Mark Liu to Receive SIA’s Highest Honor - Semiconductor Industry Association",
  "url": "https://www.semiconductors.org/tsmcs-dr-c-c-wei-and-dr-mark-liu-to-receive-sias-highest-honor/"
}

SIAJuly2025announcement profile andattributedWeiquote; plannedNov20awardacceptance notclaimedcompleted, sharedrecipientMarkLiu/collectivecontributions preserved. Snapshotcompanytitles notassumedOct2026.

SIAJuly2025announcement profile andattributedWeiquote; plannedNov20awardacceptance notclaimedcompleted, sharedrecipientMarkLiu/collectivecontributions preserved. Snapshotcompanytitles notassumedOct2026.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Hwaiyu Geng

Hwaiyu Geng edited the second edition of Data Center Handbook, which brings together planning, construction and operations for energy-efficient facilities.

The publisher describes coverage ranging from cloud and edge computing to cooling, power systems, reliability and business continuity.

Its biography connects Geng’s engineering and management experience with his Amica Research work promoting green design and operation of high-technology projects.

Sources and details

Data Center Handbook: Plan, Design, Build, and Operations of a Smart Data Center, 2nd Edition | Wiley

{
  "access_scope": "Publisherdescription andbiography only, editornotsoleauthor orindividual59expertscontribution. SecondeditionApril2021 distinct2015firstedition; handbookscopenotvalidateddesignoutcome.",
  "authors": [
    "Hwaiyu Geng"
  ],
  "authors_in_source_order": [
    "Hwaiyu Geng"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:22:20.910147+00:00",
    "second_edition": "April 2021"
  },
  "id": "person-coverage-dd8f13b8114571::S1",
  "title": "Data Center Handbook: Plan, Design, Build, and Operations of a Smart Data Center, 2nd Edition | Wiley",
  "url": "https://www.wiley.com/en-cn/data-center-handbook-plan-design-build-and-operations-of-a-smart-data-center-2nd-edition-p-9781119597551"
}

Publisherdescription andbiography only, editornotsoleauthor orindividual59expertscontribution. SecondeditionApril2021 distinct2015firstedition; handbookscopenotvalidateddesignoutcome.

Publisherdescription andbiography only, editornotsoleauthor orindividual59expertscontribution. SecondeditionApril2021 distinct2015firstedition; handbookscopenotvalidateddesignoutcome.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jessica Livingston

Paul Graham’s account credits Jessica Livingston as one of Y Combinator’s four founders and his partner in running its early daily operations.

He describes her reviewing organizational decisions about funding, public statements, hiring and relationships with other companies.

His account also places her observations of applicants at the center of the founders’ interview discussions.

Sources and details

Jessica Livingston

{
  "access_scope": "PrimarycofounderfirstpersonaccountNov2015; authoridentifiedfromownedPaulGrahamdomain/bycontext, jointfoundersRobertMorris/TrevorBlackwell retained; promotionalcausalclaims aboutgrowth/xrayinsight excluded.",
  "authors": [
    "Paul Graham"
  ],
  "authors_in_source_order": [
    "Paul Graham"
  ],
  "dates": {
    "essay": "November 2015",
    "retrieved_utc": "2026-10-08T08:22:19.910168+00:00"
  },
  "id": "person-coverage-3bb3e53c05d0ca::S1",
  "title": "Jessica Livingston",
  "url": "https://www.paulgraham.com/jessica.html"
}

PrimarycofounderfirstpersonaccountNov2015; authoridentifiedfromownedPaulGrahamdomain/bycontext, jointfoundersRobertMorris/TrevorBlackwell retained; promotionalcausalclaims aboutgrowth/xrayinsight excluded.

His account also places her observations of applicants at the center of the founders’ interview discussions, a participant’s recollection rather than an independent measure of investment judgment.

PrimarycofounderfirstpersonaccountNov2015; authoridentifiedfromownedPaulGrahamdomain/bycontext, jointfoundersRobertMorris/TrevorBlackwell retained; promotionalcausalclaims aboutgrowth/xrayinsight excluded.

His account also places her observations of applicants at the center of the founders’ interview discussions, a participant’s recollection rather than an independent measure of investment judgment.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Reason

James Reason distinguishes a person approach to human error from a system approach, showing how different accounts of error causation lead to different management practices.

The person approach concentrates blame on individual failings, whereas the system approach changes working conditions and builds defenses to prevent errors or lessen their consequences.

He describes high-reliability organizations as harnessing human variability while remaining alert to possible failure, making ongoing anticipation part of their safety practice.

Sources and details

Human error: models and management

{
  "access_scope": "Selected James Reason, sole citation_author in BMJ static metadata for Human error: models and management, article:published_time 2000-03-18. Only literal publisher metadata description excerpt on /related inspected; not full article or Human Error book. Original visible related-content extraction and original trailing ellipsis preserved; no Swiss-cheese model details inferred.",
  "authors": [
    "James Reason"
  ],
  "authors_in_source_order": [
    "James Reason"
  ],
  "dates": {
    "citation_publication_date": "2000/03/18",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T07:02:50.536215+00:00",
    "source_date": "2000-03-18"
  },
  "id": "person-coverage-28e5fc7bcf85ed::S1",
  "title": "Human error: models and management",
  "url": "https://www.bmj.com/content/320/7237/768/related"
}

Selected James Reason, sole citation_author in BMJ static metadata for Human error: models and management, article:published_time 2000-03-18. Only literal publisher metadata description excerpt on /related inspected; not full article or Human Error book. Original visible related-content extraction and original trailing ellipsis preserved; no Swiss-cheese model details inferred.

Selected James Reason, sole citation_author in BMJ static metadata for Human error: models and management, article:published_time 2000-03-18. Only literal publisher metadata description excerpt on /related inspected; not full article or Human Error book. Original visible related-content extraction and original trailing ellipsis preserved; no Swiss-cheese model details inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Duncan Crabtree-Ireland

Duncan Crabtree-Ireland explains that the performer protections negotiated after SAG-AFTRA’s 2023 strike depend on specific permission for the intended use of a digital replica, alongside fair compensation.

He recalls that the union raised its AI proposal at the start of bargaining but settled it only on the strike’s 118th day, describing studios’ uncertainty about future technology and competition as obstacles.

He presents the agreement’s six-month meetings on companies’ AI activity as a way to gather information for the next bargaining cycle, treating protections as something to develop through successive negotiations.

Sources and details

SAG-AFTRA Strike’s Impact on AI and Hollywood’s Future

{
  "access_scope": "Selected Duncan Crabtree-Ireland, person-coverage-0d13397abf2717, as interviewed SAG-AFTRA National Executive Director & Chief Negotiator; host James Kotecki. CES Tech Talk interview at CES2024, publisher page dated March11 2024. Transcript 01:58 (consent), 04:17 (joint bargaining chronology) and 07:09–08:12 (six-month information meetings). These are his historical descriptions and advocacy concerning the 2023 studios/streamers agreement, not a current-law or current-contract audit, sole negotiating credit, acting contribution or merger with creative-person-coverage-0d13397abf2717. First meeting described as prospective for June2024.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "interview_event": "CES 2024",
    "published": "2024-03-11",
    "retrieved_utc": "2026-10-08T08:23:41.255063+00:00"
  },
  "id": "person-coverage-0d13397abf2717::S1",
  "title": "SAG-AFTRA Strike’s Impact on AI and Hollywood’s Future",
  "url": "https://www.ces.tech/podcasts/sag-aftra-strike-s-impact-on-ai-and-hollywood-s-future/"
}

Selected Duncan Crabtree-Ireland, person-coverage-0d13397abf2717, as interviewed SAG-AFTRA National Executive Director & Chief Negotiator; host James Kotecki. CES Tech Talk interview at CES2024, publisher page dated March11 2024. Transcript 01:58 (consent), 04:17 (joint bargaining chronology) and 07:09–08:12 (six-month information meetings). These are his historical descriptions and advocacy concerning the 2023 studios/streamers agreement, not a current-law or current-contract audit, sole negotiating credit, acting contribution or merger with creative-person-coverage-0d13397abf2717. First meeting described as prospective for June2024.

Selected Duncan Crabtree-Ireland, person-coverage-0d13397abf2717, as interviewed SAG-AFTRA National Executive Director & Chief Negotiator; host James Kotecki. CES Tech Talk interview at CES2024, publisher page dated March11 2024. Transcript 01:58 (consent), 04:17 (joint bargaining chronology) and 07:09–08:12 (six-month information meetings). These are his historical descriptions and advocacy concerning the 2023 studios/streamers agreement, not a current-law or current-contract audit, sole negotiating credit, acting contribution or merger with creative-person-coverage-0d13397abf2717. First meeting described as prospective for June2024.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Revelation Space

Reynolds traces Revelation Space to an unfinished 1986 contest story whose universe excluded faster-than-light travel and supplied ideas for the eventual novel.

His author account describes restarting the book in the Netherlands in 1992, completing it early in 1994, and later converting the typescript to digital form for further revision.

The novel was submitted to Gollancz in 1997 and ultimately appeared in 2000 after its publication schedule was brought forward from 2001.

Sources and details

Revelation Space (2000)

{
  "access_scope": "First-person author account of the novel’s creation and publication. Selected development history only; no full-novel plot audit, and the web account has no displayed publication date.",
  "authors": [
    "Alastair Reynolds"
  ],
  "authors_in_source_order": [
    "Alastair Reynolds"
  ],
  "dates": {
    "author_account_date": "not displayed",
    "novel_publication_year": "2000",
    "retrieved_utc": "2026-10-08T08:47:58.422541+00:00"
  },
  "id": "work-culture-1f8649bdab7c9b::S1",
  "title": "Revelation Space (2000)",
  "url": "https://www.alastairreynolds.com/release/revelation-space/"
}

First-person author account of the novel’s creation and publication. Selected development history only; no full-novel plot audit, and the web account has no displayed publication date.

First-person author account of the novel’s creation and publication. Selected development history only; no full-novel plot audit, and the web account has no displayed publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Distinct first novel within the larger setting.",
  "dated": true,
  "year": 2000
}

Night's Dawn trilogy

The inspected Pan edition presents The Naked God as the conclusion of Night’s Dawn, following The Reality Dysfunction and The Neutronium Alchemist.

Its publisher synopsis places the Confederation near collapse as Earth’s domed cities fall and the surviving opposition seeks new alliances.

The concluding volume sends Joshua and Syrinx by starship in search of the Sleeping God, an entity believed to offer a way to defeat the possessed.

Sources and details

The Naked God

{
  "access_scope": "Synopsis of the concluding volume through the Pan paperback dated 23 August 2018, ISBN 9781509868629. This is a later manifestation and a bounded view of the trilogy; original publication dates and the other volumes’ complete narratives were not inspected.",
  "authors": [
    "Peter F. Hamilton"
  ],
  "authors_in_source_order": [
    "Peter F. Hamilton"
  ],
  "dates": {
    "inspected_pan_paperback": "2018-08-23",
    "retrieved_utc": "2026-10-08T08:47:59.098005+00:00"
  },
  "id": "work-culture-dbb2f4a216c261::S1",
  "title": "The Naked God",
  "url": "https://www.panmacmillan.com/authors/peter-f-hamilton/the-naked-god/9781509868629"
}

Synopsis of the concluding volume through the Pan paperback dated 23 August 2018, ISBN 9781509868629. This is a later manifestation and a bounded view of the trilogy; original publication dates and the other volumes’ complete narratives were not inspected.

Synopsis of the concluding volume through the Pan paperback dated 23 August 2018, ISBN 9781509868629. This is a later manifestation and a bounded view of the trilogy; original publication dates and the other volumes’ complete narratives were not inspected.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original three-novel sequence: The Reality Dysfunction (1996), The Neutronium Alchemist (1997), The Naked God (1999). Range 1996–1999 reflects constituent first UK books, not a later omnibus.",
  "dated": false,
  "year": "1996–1999"
}

What Computers Can’t Do: A Critique of Artificial Reason

The synopsis of Dreyfus’s 1992 revision describes his earlier challenge to the idea that disembodied machines can reproduce higher mental functions.

It explains that What Computers Still Can’t Do adds a substantial introduction assessing connectionism and neural networks as alternatives to symbolic approaches to general intelligence.

The same retrospective account connects his criticism of general problem solvers and automatic translation to their assumptions about mental functioning and his call for engagement with philosophy.

Sources and details

What Computers Still Can't Do: A Critique of Artificial Reason

{
  "access_scope": "Distributor synopsis of the distinct MIT Press revision published 30 October 1992, ISBN 9780262540674. Its title is What Computers Still Can’t Do; the canonical record’s title/subtitle mismatch remains explicit. Statements about the 1972 book are retrospective publisher descriptions, not an inspection of that edition.",
  "authors": [
    "Hubert L. Dreyfus"
  ],
  "authors_in_source_order": [
    "Hubert L. Dreyfus"
  ],
  "dates": {
    "earlier_book_referred_to": "1972",
    "inspected_revised_book": "1992-10-30",
    "retrieved_utc": "2026-10-08T08:47:59.294827+00:00"
  },
  "id": "work-final-0780203a0ac17d::S1",
  "title": "What Computers Still Can't Do: A Critique of Artificial Reason",
  "url": "https://www.penguinrandomhouse.com/books/654418/what-computers-still-cant-do-by-hubert-l-dreyfus/9780262540674/"
}

Distributor synopsis of the distinct MIT Press revision published 30 October 1992, ISBN 9780262540674. Its title is What Computers Still Can’t Do; the canonical record’s title/subtitle mismatch remains explicit. Statements about the 1972 book are retrospective publisher descriptions, not an inspection of that edition.

Distributor synopsis of the distinct MIT Press revision published 30 October 1992, ISBN 9780262540674. Its title is What Computers Still Can’t Do; the canonical record’s title/subtitle mismatch remains explicit. Statements about the 1972 book are retrospective publisher descriptions, not an inspection of that edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "First edition: Harper & Row, 1972; revised 1992 edition titled What Computers Still Can’t Do.",
  "dated": true,
  "year": 1972
}

Profiting from innovation in the digital economy: Enabling technologies, standards, and licensing models in the wireless world

Teece’s abstract treats value capture for enabling digital technologies as a problem of coordinating platforms, ecosystems and complementary assets.

It argues that their use across many downstream industries makes ownership of every relevant complement impractical, even when those complements are needed for the technology to function.

The paper links this coordination problem to social returns exceeding private returns and argues that resulting underinvestment in research can be addressed partly through strategy and public policy.

Sources and details

Profiting from innovation in the digital economy: Enabling technologies, standards, and licensing models in the wireless world

{
  "access_scope": "Publisher-supplied abstract of the 2018 Research Policy article, volume 47 issue 8, pages 1367–1387, DOI 10.1016/j.respol.2017.01.015. Author arguments only; the full article and specific licensing policies were not audited.",
  "authors": [
    "David J. Teece"
  ],
  "authors_in_source_order": [
    "David J. Teece"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "journal_citation_year": "2018",
    "retrieved_utc": "2026-10-08T08:47:57.698069+00:00"
  },
  "id": "work-coverage-7c4c0985cbca5b::S1",
  "title": "Profiting from innovation in the digital economy: Enabling technologies, standards, and licensing models in the wireless world",
  "url": "https://ideas.repec.org/a/eee/respol/v47y2018i8p1367-1387.html"
}

Publisher-supplied abstract of the 2018 Research Policy article, volume 47 issue 8, pages 1367–1387, DOI 10.1016/j.respol.2017.01.015. Author arguments only; the full article and specific licensing policies were not audited.

Publisher-supplied abstract of the 2018 Research Policy article, volume 47 issue 8, pages 1367–1387, DOI 10.1016/j.respol.2017.01.015. Author arguments only; the full article and specific licensing policies were not audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2018"
}

Towards a Theory of Ecosystems

The paper argues that modularity lets distinct but interdependent organizations coordinate as an ecosystem without a single hierarchy directing them.

Its abstract locates the ecosystem’s distinctive value in complementary investments that are not readily redeployed elsewhere.

It describes common roles and rules as a way to manage multilateral dependence without negotiating a separate customized agreement for every partner.

Sources and details

Towards a theory of ecosystems

{
  "access_scope": "Publisher-supplied research and managerial abstracts of the 2018 Strategic Management Journal article, volume 39 issue 8, pages 2255–2276, DOI 10.1002/smj.2904. These are the authors’ theoretical claims; no full-paper empirical audit.",
  "authors": [
    "Michael G. Jacobides",
    "Carmelo Cennamo",
    "Annabelle Gawer"
  ],
  "authors_in_source_order": [
    "Michael G. Jacobides",
    "Carmelo Cennamo",
    "Annabelle Gawer"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "journal_citation": "August 2018",
    "retrieved_utc": "2026-10-08T08:47:57.094116+00:00"
  },
  "id": "work-coverage-6ec622efdb502b::S1",
  "title": "Towards a theory of ecosystems",
  "url": "https://ideas.repec.org/a/bla/stratm/v39y2018i8p2255-2276.html"
}

Publisher-supplied research and managerial abstracts of the 2018 Strategic Management Journal article, volume 39 issue 8, pages 2255–2276, DOI 10.1002/smj.2904. These are the authors’ theoretical claims; no full-paper empirical audit.

Publisher-supplied research and managerial abstracts of the 2018 Strategic Management Journal article, volume 39 issue 8, pages 2255–2276, DOI 10.1002/smj.2904. These are the authors’ theoretical claims; no full-paper empirical audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2018"
}

Algorithms, Machine Learning, and Collusion

Schwalbe examines whether self-learning pricing algorithms can coordinate prices to maximize the combined profits of the firms using them.

His abstract disputes the assumption that tacit algorithmic collusion is easy or inevitable and emphasizes evidence about communication and information exchange.

It also identifies liability, algorithm auditing and monitoring, and competition-law enforcement as legal problems raised by such coordination.

Sources and details

Algorithms, Machine Learning, And Collusion

{
  "access_scope": "Publisher-supplied abstract attached to Journal of Competition Law and Economics volume 14 issue 4, cited as 2018, pages 568–607. Historical author argument only; the cached source does not independently establish its later online-publication date or present-day market conditions.",
  "authors": [
    "Ulrich Schwalbe"
  ],
  "authors_in_source_order": [
    "Ulrich Schwalbe"
  ],
  "dates": {
    "citation_publication_date": "2018",
    "journal_volume_citation_year": "2018",
    "retrieved_utc": "2026-10-08T08:47:57.804287+00:00"
  },
  "id": "work-coverage-6f461aaf98017c::S1",
  "title": "Algorithms, Machine Learning, And Collusion",
  "url": "https://ideas.repec.org/a/oup/jcomle/v14y2018i4p568-607..html"
}

Publisher-supplied abstract attached to Journal of Competition Law and Economics volume 14 issue 4, cited as 2018, pages 568–607. Historical author argument only; the cached source does not independently establish its later online-publication date or present-day market conditions.

Publisher-supplied abstract attached to Journal of Competition Law and Economics volume 14 issue 4, cited as 2018, pages 568–607. Historical author argument only; the cached source does not independently establish its later online-publication date or present-day market conditions.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[\"Keep supplied 2019 as advance-access date. Publisher issue is labeled 2018; SSRN working paper June 1, 2018. DOI direct fetch failed; indexed publisher issue and author-uploaded abstract inspected.\"]",
  "dated": true,
  "year": "2018 working paper and journal issue; 2019 online publication"
}

Artificial intelligence in information systems research: A systematic literature review and research agenda

The review addresses concern that information-systems research on AI was accumulating without sufficiently building on earlier findings, examining work from 2005 through 2020.

Its abstract reports a search yielding 1,877 studies, of which 98 were identified as primary studies for the thematic synthesis.

The resulting agenda connects reported business value and AI contributions with practical implications and opportunities for future research.

Sources and details

Artificial intelligence in information systems research: A systematic literature review and research agenda

{
  "access_scope": "Publisher-supplied abstract and ordered author list of the 2021 International Journal of Information Management article, volume 60, DOI 10.1016/j.ijinfomgt.2021.102383. Search counts and synthesis are reported by the authors; full review methods and results were not independently audited.",
  "authors": [
    "Christopher Collins",
    "Denis Dennehy",
    "Kieran Conboy",
    "Patrick Mikalef"
  ],
  "authors_in_source_order": [
    "Christopher Collins",
    "Denis Dennehy",
    "Kieran Conboy",
    "Patrick Mikalef"
  ],
  "dates": {
    "citation_publication_date": "2021",
    "journal_citation_year": "2021",
    "retrieved_utc": "2026-10-08T08:47:57.094366+00:00"
  },
  "id": "work-focused-7ee7f6f29f36ed::S1",
  "title": "Artificial intelligence in information systems research: A systematic literature review and research agenda",
  "url": "https://ideas.repec.org/a/eee/ininma/v60y2021ics0268401221000761.html"
}

Publisher-supplied abstract and ordered author list of the 2021 International Journal of Information Management article, volume 60, DOI 10.1016/j.ijinfomgt.2021.102383. Search counts and synthesis are reported by the authors; full review methods and results were not independently audited.

Publisher-supplied abstract and ordered author list of the 2021 International Journal of Information Management article, volume 60, DOI 10.1016/j.ijinfomgt.2021.102383. Search counts and synthesis are reported by the authors; full review methods and results were not independently audited.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "date": "2021",
      "kind": "year",
      "year": 2021
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2021"
}

RoboCop

The Texas Film Commission identifies Dallas City Hall as the exterior of Omni Consumer Products’ headquarters in the 1987 RoboCop.

Its location account explains that matte painting made the real building appear taller on screen.

The described effect combines a photographed painted element with live-action footage during post-production, showing how the film transformed a civic building into its fictional corporate setting.

Sources and details

Robocop in Dallas City Hall

{
  "access_scope": "State film commission account of one location and its visual-effects treatment in the 1987 film. No full-film plot audit, remake equivalence, or individual effects-artist credit inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "film_year_explicitly_named": "1987",
    "retrieved_utc": "2026-10-08T08:47:57.094210+00:00",
    "source_page_date": "not displayed"
  },
  "id": "work-culture-b412ae8e9f34c2::S1",
  "title": "Robocop in Dallas City Hall",
  "url": "https://gov.texas.gov/film/trail/dallas-city-hall"
}

State film commission account of one location and its visual-effects treatment in the 1987 film. No full-film plot audit, remake equivalence, or individual effects-artist credit inferred.

State film commission account of one location and its visual-effects treatment in the 1987 film. No full-film plot audit, remake equivalence, or individual effects-artist credit inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1987
}

Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations

The paper trains neural networks to fit observed data while respecting physical laws expressed as nonlinear partial differential equations, addressing both solutions and discovery of those equations.

In its continuous-time formulation, automatic differentiation builds an equation residual, and training combines error on initial or boundary data with residual error at selected collocation points.

The inspected discussion reports empirical predictive success but explicitly offers no guarantee that optimization reaches a global minimum.

Sources and details

Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations

{
  "access_scope": "Published Journal of Computational Physics volume 378 (2019), pages 686–707, DOI 10.1016/j.jcp.2018.10.045; accepted 28 October 2018 and online 3 November 2018. Actual PDF pages 1–3 were rendered and viewed; abstract, setup and continuous-time loss/caveat only, not all benchmark experiments or a convergence proof.",
  "authors": [
    "M. Raissi",
    "P. Perdikaris",
    "G.E. Karniadakis"
  ],
  "authors_in_source_order": [
    "M. Raissi",
    "P. Perdikaris",
    "G.E. Karniadakis"
  ],
  "dates": {
    "accepted": "2018-10-28",
    "available_online": "2018-11-03",
    "journal_volume_year": "2019",
    "retrieved_utc": "2026-10-08T08:47:57.093935+00:00"
  },
  "id": "work-coverage-789d0b61a4f73e::S1",
  "title": "Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations",
  "url": "https://faculty.sites.iastate.edu/hliu/files/inline-files/PINN_RPK_2019_1.pdf"
}

Published Journal of Computational Physics volume 378 (2019), pages 686–707, DOI 10.1016/j.jcp.2018.10.045; accepted 28 October 2018 and online 3 November 2018. Actual PDF pages 1–3 were rendered and viewed; abstract, setup and continuous-time loss/caveat only, not all benchmark experiments or a convergence proof.

Published Journal of Computational Physics volume 378 (2019), pages 686–707, DOI 10.1016/j.jcp.2018.10.045; accepted 28 October 2018 and online 3 November 2018. Actual PDF pages 1–3 were rendered and viewed; abstract, setup and continuous-time loss/caveat only, not all benchmark experiments or a convergence proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "2017 preprints precede the 2019 Journal of Computational Physics synthesis.",
  "dated": true,
  "year": 2019
}

Tim Bayne

Tim Bayne’s 2022 lecture course separates ordinary knowledge of other people’s minds from contested cases involving animals, AI systems, and neural organoids.

The program examines arguments from analogy, inference to the best explanation, and the limits of verbal reports and voluntary behavior as evidence of consciousness.

It presents Bayne’s natural-kind approach as an alternative to assuming consciousness axiomatically or extending familiar cases without a theory.

Sources and details

The Problems of Other Minds. Lecture Course by Tim Bayne

{
  "access_scope": "Tim Bayne: Original Moscow Center for Consciousness Studies course program, with Tim Bayne in title and Timothy Bayne in introduction as explicit same-source name bridge. Program claims only; no linked lecture audio viewed or paper audit asserted. Website writer unnamed; Bayne is lecturer, not inferred web author.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Lecture course held 2022; program published 17 December, 2022",
    "retrieved_utc": "2026-10-08T08:47:05.679448+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Lecture course held 2022; program published 17 December, 2022"
  ],
  "id": "person-coverage-07b86d8a4485a0::S1",
  "title": "The Problems of Other Minds. Lecture Course by Tim Bayne",
  "url": "https://hardproblem.ru/en/posts/Lectures/the-problems-of-other-minds-lecture-course-by-tim-bayne/"
}

Tim Bayne: Original Moscow Center for Consciousness Studies course program, with Tim Bayne in title and Timothy Bayne in introduction as explicit same-source name bridge. Program claims only; no linked lecture audio viewed or paper audit asserted. Website writer unnamed; Bayne is lecturer, not inferred web author.

Tim Bayne: Original Moscow Center for Consciousness Studies course program, with Tim Bayne in title and Timothy Bayne in introduction as explicit same-source name bridge. Program claims only; no linked lecture audio viewed or paper audit asserted. Website writer unnamed; Bayne is lecturer, not inferred web author.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mancur Olson

Mancur Olson’s The Logic of Collective Action asks when people who share an interest will actually pay the costs of organizing around it.

The publisher description treats union services and lobbying benefits as public goods available even to members who did not contribute.

It distinguishes small groups from large ones, arguing that large organizations often need special incentives or compulsory mechanisms to obtain resources while smaller groups face unequal burdens.

Sources and details

The Logic of Collective Action: Public Goods and the Theory of Groups, With ... - Mancur Olson - Google Books

{
  "access_scope": "Mancur Olson: Google Books reproduction of Harvard University Press book description and bibliographic record, not full-book reading. Selected manifestation names Mancur Olson explicitly; alternate 1971/2009 editions with Mancur Olson, Jr. are not silently substituted. Description arguments are attributed to book; no claims of empirical verification.",
  "authors": [
    "Mancur Olson"
  ],
  "authors_in_source_order": [
    "Mancur Olson"
  ],
  "dates": {
    "inspected_source_date_1": "Cataloged Harvard University Press manifestation: 1965; illustrated, reprint, revised; 176 pages; ISBN 0674537513, 9780674537514",
    "retrieved_utc": "2026-10-08T08:47:05.050757+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Cataloged Harvard University Press manifestation: 1965; illustrated, reprint, revised; 176 pages; ISBN 0674537513, 9780674537514"
  ],
  "id": "person-coverage-277882ae042517::S1",
  "title": "The Logic of Collective Action: Public Goods and the Theory of Groups, With ... - Mancur Olson - Google Books",
  "url": "https://books.google.com/books/about/The_Logic_of_Collective_Action.html?id=jzTeOLtf7_wC"
}

Mancur Olson: Google Books reproduction of Harvard University Press book description and bibliographic record, not full-book reading. Selected manifestation names Mancur Olson explicitly; alternate 1971/2009 editions with Mancur Olson, Jr. are not silently substituted. Description arguments are attributed to book; no claims of empirical verification.

Mancur Olson: Google Books reproduction of Harvard University Press book description and bibliographic record, not full-book reading. Selected manifestation names Mancur Olson explicitly; alternate 1971/2009 editions with Mancur Olson, Jr. are not silently substituted. Description arguments are attributed to book; no claims of empirical verification.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gary P. Pisano

Gary P. Pisano’s June 2015 article locates persistent innovation problems in the absence of an innovation strategy, rather than simply poor execution.

It frames that strategy as a way to make trade-offs and choose practices that fit a company’s innovation efforts.

The accompanying author biography connects this work to his later book Creative Construction: The DNA of Sustained Innovation, published in 2019.

Sources and details

You Need an Innovation Strategy

{
  "access_scope": "Gary P. Pisano: Original HBR article preview, subtitle, introductory prose and full-name author biography inspected. Full text is not asserted; no claims from hidden articleBody/JSON abstract are drafted. Contemporary cached emeritus biography is not backdated to 2015. No earlier initial/name bridge inferred.",
  "authors": [
    "Gary P. Pisano"
  ],
  "authors_in_source_order": [
    "Gary P. Pisano"
  ],
  "dates": {
    "inspected_source_date_1": "Article magazine/publication June 2015; HTML published 2015-06-01T04:00:00.000+00:00; biography book date 2019",
    "retrieved_utc": "2026-10-08T08:47:05.679652+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Article magazine/publication June 2015; HTML published 2015-06-01T04:00:00.000+00:00; biography book date 2019"
  ],
  "id": "person-garyppisano::S1",
  "title": "You Need an Innovation Strategy",
  "url": "https://hbr.org/2015/06/you-need-an-innovation-strategy"
}

Gary P. Pisano: Original HBR article preview, subtitle, introductory prose and full-name author biography inspected. Full text is not asserted; no claims from hidden articleBody/JSON abstract are drafted. Contemporary cached emeritus biography is not backdated to 2015. No earlier initial/name bridge inferred.

Gary P. Pisano: Original HBR article preview, subtitle, introductory prose and full-name author biography inspected. Full text is not asserted; no claims from hidden articleBody/JSON abstract are drafted. Contemporary cached emeritus biography is not backdated to 2015. No earlier initial/name bridge inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kim B. Clark

Kim B. Clark earned his bachelor’s, master’s, and doctoral degrees in economics at Harvard University.

The institutional biography records his move onto the Harvard Business School faculty in 1978 and his appointment as dean in 1995.

He served as dean until summer 2005, when he became president of Brigham Young University–Idaho.

Sources and details

Elder Kim B. Clark

{
  "access_scope": "Kim B. Clark: Original Church institutional biography; exact Kim B. Clark heading and Kim Bryce Clark in body form explicit same-source name bridge. Historical economics/academic leadership only. No individual research discoveries, current office, or earlier article roles inferred. Website author institutional account rather than named individual.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "HTML publication 2015-12-17; later text records emeritus transition October 5, 2019; education/career years 1978, 1995, 2005",
    "retrieved_utc": "2026-10-08T08:47:07.192044+00:00"
  },
  "dates_exact_in_source_role_order": [
    "HTML publication 2015-12-17; later text records emeritus transition October 5, 2019; education/career years 1978, 1995, 2005"
  ],
  "id": "person-kimbclark::S1",
  "title": "Elder Kim B. Clark",
  "url": "https://newsroom.churchofjesuschrist.org/article/elder-kim-b-clark"
}

Kim B. Clark: Original Church institutional biography; exact Kim B. Clark heading and Kim Bryce Clark in body form explicit same-source name bridge. Historical economics/academic leadership only. No individual research discoveries, current office, or earlier article roles inferred. Website author institutional account rather than named individual.

Kim B. Clark: Original Church institutional biography; exact Kim B. Clark heading and Kim Bryce Clark in body form explicit same-source name bridge. Historical economics/academic leadership only. No individual research discoveries, current office, or earlier article roles inferred. Website author institutional account rather than named individual.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Sharon Berry

Sharon Berry’s research connects epistemology with the philosophy of mathematics, especially the problem of explaining how people can know mathematical truths.

Her faculty profile also identifies interests in the relationship between mathematics and logic, a priori applications of mathematics, and set theory.

It links these questions to work on a priori knowledge and realism, and records her 2022 book A Logical Foundation for Potentialist Set Theory.

Sources and details

Sharon Berry: Faculty: Directory: Department of Philosophy: Indiana University Bloomington

{
  "access_scope": "Sharon Berry: Original Indiana University philosophy faculty profile with exact full-name subject and matching potentialist-set-theory research context. Research interests and named book only; held Wiley article is not read or attributed findings inferred. Journal list and forthcoming labels retain their own versions; none converted into accepted dates. Website writer unnamed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Undated faculty profile; book publication 2022",
    "retrieved_utc": "2026-10-08T08:47:07.926708+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated faculty profile; book publication 2022"
  ],
  "id": "person-coverage-23b379e9a784e3::S1",
  "title": "Sharon Berry: Faculty: Directory: Department of Philosophy: Indiana University Bloomington",
  "url": "https://philosophy.indiana.edu/directory/faculty/berry-sharon.html"
}

Sharon Berry: Original Indiana University philosophy faculty profile with exact full-name subject and matching potentialist-set-theory research context. Research interests and named book only; held Wiley article is not read or attributed findings inferred. Journal list and forthcoming labels retain their own versions; none converted into accepted dates. Website writer unnamed.

Sharon Berry: Original Indiana University philosophy faculty profile with exact full-name subject and matching potentialist-set-theory research context. Research interests and named book only; held Wiley article is not read or attributed findings inferred. Journal list and forthcoming labels retain their own versions; none converted into accepted dates. Website writer unnamed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rebecca M. Henderson

Rebecca M. Henderson’s Harvard profile places her work in the General Management and Strategy units of Harvard Business School.

It connects her academic role with the Reimagining Capitalism MBA course and research affiliation at the National Bureau of Economic Research.

The page also lists Sustainable Business Strategy, a course exploring how sustainability can support innovation, competitive advantage, and long-term growth.

Sources and details

Rebecca M. Henderson | Harvard University

{
  "access_scope": "Rebecca M. Henderson: Harvard original instructor biography and course listing. Exact full name occurs in page title and Courses taught by Rebecca M. Henderson; body shorter Rebecca Henderson is linked by same page, not initials expanded. Course-description scope only, no course completion, causal research findings, prices or live availability asserted. Writer unnamed.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "HTML publication 2018-03-01T11:02:23-05:00; modification 2026-03-23T16:27:01-04:00",
    "retrieved_utc": "2026-10-08T08:47:08.477265+00:00"
  },
  "dates_exact_in_source_role_order": [
    "HTML publication 2018-03-01T11:02:23-05:00; modification 2026-03-23T16:27:01-04:00"
  ],
  "id": "person-rebeccamhenderson::S1",
  "title": "Rebecca M. Henderson | Harvard University",
  "url": "https://pll.harvard.edu/instructor/rebecca-m-henderson"
}

Rebecca M. Henderson: Harvard original instructor biography and course listing. Exact full name occurs in page title and Courses taught by Rebecca M. Henderson; body shorter Rebecca Henderson is linked by same page, not initials expanded. Course-description scope only, no course completion, causal research findings, prices or live availability asserted. Writer unnamed.

Rebecca M. Henderson: Harvard original instructor biography and course listing. Exact full name occurs in page title and Courses taught by Rebecca M. Henderson; body shorter Rebecca Henderson is linked by same page, not initials expanded. Course-description scope only, no course completion, causal research findings, prices or live availability asserted. Writer unnamed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chris Miller

In a written Chip War interview, Chris Miller explains that semiconductors matter far beyond computers, reaching cars and everyday appliances.

He highlights immigrant scientists and engineers as central to the history of the US chip industry, using Fairchild’s immigrant founders and Morris Chang as examples.

He argues that attracting technical talent remains important to a country’s position in the semiconductor ecosystem.

Sources and details

Chip War: The Battle Over Trade, Immigrants And Semiconductors – Fletcher Russia and Eurasia Program

{
  "access_scope": "Chris Miller: Tufts institutional republication of original Forbes written interview by Stuart Anderson, interviewing named Fletcher historian and Chip War author Chris Miller. Original Q&A inspected; selected Miller is interviewee, not source writer or chip inventor. Historical arguments attributed to interview; contemporary policy forecasts, financial figures and performance superlatives excluded.",
  "authors": [
    "Stuart Anderson"
  ],
  "authors_in_source_order": [
    "Stuart Anderson"
  ],
  "dates": {
    "inspected_source_date_1": "Institutional republication HTML 2022-10-25T03:37:00+00:00; modification 2022-11-08T04:39:18+00:00",
    "retrieved_utc": "2026-10-08T08:47:09.642374+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Institutional republication HTML 2022-10-25T03:37:00+00:00; modification 2022-11-08T04:39:18+00:00"
  ],
  "id": "person-coverage-b1a4806fcbf6cf::S1",
  "title": "Chip War: The Battle Over Trade, Immigrants And Semiconductors – Fletcher Russia and Eurasia Program",
  "url": "https://sites.tufts.edu/fletcherrussia/chip-war-the-battle-over-trade-immigrants-and-semiconductors/"
}

Chris Miller: Tufts institutional republication of original Forbes written interview by Stuart Anderson, interviewing named Fletcher historian and Chip War author Chris Miller. Original Q&A inspected; selected Miller is interviewee, not source writer or chip inventor. Historical arguments attributed to interview; contemporary policy forecasts, financial figures and performance superlatives excluded.

Chris Miller: Tufts institutional republication of original Forbes written interview by Stuart Anderson, interviewing named Fletcher historian and Chip War author Chris Miller. Original Q&A inspected; selected Miller is interviewee, not source writer or chip inventor. Historical arguments attributed to interview; contemporary policy forecasts, financial figures and performance superlatives excluded.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Annabel Jankel

Annabel Jankel describes Max Headroom as growing from a Channel 4 brief to connect music videos with graphic material, developed with Rocky Morton and George Stone.

Her interview explains that limitations in computer-generated heads led them to cast an actor and combine animation, live action, graphics, editing, and effects.

She distinguishes their original UK film and following series from later US versions and Coke advertisements, which she says they did not make.

Sources and details

Max Out: Annabel Jankel interview | Den of Geek

{
  "access_scope": "Annabel Jankel: Original Den of Geek interview; selected exact-full-name interviewee. Visible byline blank; metadata author account jbindeck2015 preserved as account, not expanded to person. Joint creator order in concluding answer: Rocky Morton, George Stone, Annabel Jankel. Source distinguishes original UK work from US/Coke work, and actor Matt Frewer from a genuinely computer-generated head. No individual technical allocation inferred.",
  "authors": [
    "jbindeck2015"
  ],
  "authors_in_source_order": [
    "jbindeck2015"
  ],
  "dates": {
    "inspected_source_date_1": "Publication 2008-03-19T09:00:00+00:00; modification 2023-10-10T17:17:58+00:00",
    "retrieved_utc": "2026-10-08T08:47:11.061339+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication 2008-03-19T09:00:00+00:00; modification 2023-10-10T17:17:58+00:00"
  ],
  "id": "person-coverage-9c7880b447dfa4::S1",
  "title": "Max Out: Annabel Jankel interview | Den of Geek",
  "url": "https://www.denofgeek.com/tv/max-out-annabel-jankel-interview/"
}

Annabel Jankel: Original Den of Geek interview; selected exact-full-name interviewee. Visible byline blank; metadata author account jbindeck2015 preserved as account, not expanded to person. Joint creator order in concluding answer: Rocky Morton, George Stone, Annabel Jankel. Source distinguishes original UK work from US/Coke work, and actor Matt Frewer from a genuinely computer-generated head. No individual technical allocation inferred.

Annabel Jankel: Original Den of Geek interview; selected exact-full-name interviewee. Visible byline blank; metadata author account jbindeck2015 preserved as account, not expanded to person. Joint creator order in concluding answer: Rocky Morton, George Stone, Annabel Jankel. Source distinguishes original UK work from US/Coke work, and actor Matt Frewer from a genuinely computer-generated head. No individual technical allocation inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rocky Morton

The 1987 Max Headroom report credits Rocky Morton and Annabel Jankel with directing the original British film built from an idea shared with George Stone.

It describes their animation-based approach to Max’s image, combining altered frames, lighting, blue-screen filming, and a superimposed background around actor Matt Frewer.

Morton presents the character’s creation as joint work by himself, Jankel, and Stone, while the report separates that original production from the later ABC series.

Sources and details

THE MIXED-UP WORLD OF MAX HEADROOM CREATORS - Los Angeles Times

{
  "access_scope": "Rocky Morton: Original Los Angeles Times production reporting and direct interview quotations by Terry Atkinson. Original-film idea credit ordered George Stone, Rocky Morton, Annabel Jankel; directors Morton and Jankel; music-video-series creator credit Rocky Morton and Annabel Jankel. Disputed later ABC credits remain disputes; no sole creator designation or individual effects-task allocation, and no film itself viewed.",
  "authors": [
    "Terry Atkinson"
  ],
  "authors_in_source_order": [
    "Terry Atkinson"
  ],
  "dates": {
    "inspected_source_date_1": "Published May 5, 1987; HTML 1987-05-05T07:00:00",
    "retrieved_utc": "2026-10-08T08:47:12.961090+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published May 5, 1987; HTML 1987-05-05T07:00:00"
  ],
  "id": "person-coverage-72ff8959c01d24::S1",
  "title": "THE MIXED-UP WORLD OF MAX HEADROOM CREATORS - Los Angeles Times",
  "url": "https://www.latimes.com/archives/la-xpm-1987-05-05-ca-3970-story.html"
}

Rocky Morton: Original Los Angeles Times production reporting and direct interview quotations by Terry Atkinson. Original-film idea credit ordered George Stone, Rocky Morton, Annabel Jankel; directors Morton and Jankel; music-video-series creator credit Rocky Morton and Annabel Jankel. Disputed later ABC credits remain disputes; no sole creator designation or individual effects-task allocation, and no film itself viewed.

Rocky Morton: Original Los Angeles Times production reporting and direct interview quotations by Terry Atkinson. Original-film idea credit ordered George Stone, Rocky Morton, Annabel Jankel; directors Morton and Jankel; music-video-series creator credit Rocky Morton and Annabel Jankel. Disputed later ABC credits remain disputes; no sole creator designation or individual effects-task allocation, and no film itself viewed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Owen Harris

Owen Harris describes directing Striking Vipers as a relationship story in which a close male friendship and a marriage pull one protagonist in different directions.

He explains that the virtual game world had to be balanced against the real characters’ lives, rather than becoming the whole story.

His account of the ending preserves its ambiguity: the characters make an agreement, but viewers are left to decide how satisfying or sustainable that arrangement feels.

Sources and details

'Black Mirror' Director on Response to Season 5's "Striking Vipers"

{
  "access_scope": "Owen Harris: Original Hollywood Reporter director interview by Jackie Strause, selected exact Owen Harris. Writer Charlie Brooker and executive producer Annabel Jones remain separate roles. Harris describes directing, balance and interpretation; no authorship of script or personal origin of VR technology inferred. Interview text, not actual episode viewing.",
  "authors": [
    "Jackie Strause"
  ],
  "authors_in_source_order": [
    "Jackie Strause"
  ],
  "dates": {
    "inspected_source_date_1": "Published June 18, 2019 11:48am; HTML 2019-06-18T11:48:39+00:00; modification 2023-04-18T00:14:40+00:00",
    "retrieved_utc": "2026-10-08T08:47:11.620116+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published June 18, 2019 11:48am; HTML 2019-06-18T11:48:39+00:00; modification 2023-04-18T00:14:40+00:00"
  ],
  "id": "person-coverage-4afd80113f0889::S1",
  "title": "'Black Mirror' Director on Response to Season 5's \"Striking Vipers\"",
  "url": "https://www.hollywoodreporter.com/tv/tv-news/black-mirror-director-response-season-5s-striking-vipers-episode-1219368/"
}

Owen Harris: Original Hollywood Reporter director interview by Jackie Strause, selected exact Owen Harris. Writer Charlie Brooker and executive producer Annabel Jones remain separate roles. Harris describes directing, balance and interpretation; no authorship of script or personal origin of VR technology inferred. Interview text, not actual episode viewing.

Owen Harris: Original Hollywood Reporter director interview by Jackie Strause, selected exact Owen Harris. Writer Charlie Brooker and executive producer Annabel Jones remain separate roles. Harris describes directing, balance and interpretation; no authorship of script or personal origin of VR technology inferred. Interview text, not actual episode viewing.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lloyd S. Shapley

Lloyd S. Shapley’s game-theory work includes the Shapley value, an axiomatic approach to dividing payoffs in games with multiple participants.

The INFORMS biography also describes his work with Robert Snow on finding solutions to matrix games.

It follows his later collaboration with Robert Aumann on games where large numbers of players affect outcomes through coalitions rather than individually.

Sources and details

Shapley, Lloyd S. - INFORMS

{
  "access_scope": "Lloyd S. Shapley: Original INFORMS institutional research biography, exact full name in heading and explicit same-source Lloyd Stowell Shapley bridge. Research scope attributed by biography, not full-paper audit. Robert Snow remains joint matrix-game collaborator; 1974 book citation ordered Aumann R. J., Shapley L. S. No initial expansion of citation names into authorship proof; fuller collaborator names occur in prose.",
  "authors": [
    "INFORMS"
  ],
  "authors_in_source_order": [
    "INFORMS"
  ],
  "dates": {
    "inspected_source_date_1": "Undated institutional biography; Shapley-value year 1953; Aumann joint book 1974",
    "retrieved_utc": "2026-10-08T08:47:12.021898+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated institutional biography; Shapley-value year 1953; Aumann joint book 1974"
  ],
  "id": "person-coverage-1a25fcefd92ce2::S1",
  "title": "Shapley, Lloyd S.  - INFORMS",
  "url": "https://www.informs.org/Explore/History-of-O.R.-Excellence/Biographical-Profiles/Shapley-Lloyd-S"
}

Lloyd S. Shapley: Original INFORMS institutional research biography, exact full name in heading and explicit same-source Lloyd Stowell Shapley bridge. Research scope attributed by biography, not full-paper audit. Robert Snow remains joint matrix-game collaborator; 1974 book citation ordered Aumann R. J., Shapley L. S. No initial expansion of citation names into authorship proof; fuller collaborator names occur in prose.

Lloyd S. Shapley: Original INFORMS institutional research biography, exact full name in heading and explicit same-source Lloyd Stowell Shapley bridge. Research scope attributed by biography, not full-paper audit. Robert Snow remains joint matrix-game collaborator; 1974 book citation ordered Aumann R. J., Shapley L. S. No initial expansion of citation names into authorship proof; fuller collaborator names occur in prose.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John C. Harsanyi

John C. Harsanyi modeled incomplete-information games by giving players types, with each player knowing their own type and holding probabilities about others.

Kenneth J. Arrow’s memoir explains how that formulation lets players update their beliefs from observed actions while using an expanded strategy space.

It also describes Harsanyi’s account of mixed strategies as limits of games with small, privately observed payoff perturbations, rather than necessarily deliberate randomization.

Sources and details

Read "Biographical Memoirs: Volume 80" at NAP.edu

{
  "access_scope": "John C. Harsanyi: Original Kenneth J. Arrow biographical memoir hosted as National Academies HTML chapter, printed-page labels 114–116 inspected as text. Exact JOHN C.HARSANYI heading and JOHN CHARLES HARSANYI in body explicitly bridge same person. No PDF used/visual-page claim. Harsanyi is subject, Arrow writer; collaborators and independent-paper versions not conflated. Memoir attribution, not theorem re-proof.",
  "authors": [
    "Kenneth J. Arrow"
  ],
  "authors_in_source_order": [
    "Kenneth J. Arrow"
  ],
  "dates": {
    "inspected_source_date_1": "Biographical Memoirs Volume 80, 2001; source states reprinted from The Economic Journal, November 2001; discussed work 1968 and 1973",
    "retrieved_utc": "2026-10-08T08:47:15.071318+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Biographical Memoirs Volume 80, 2001; source states reprinted from The Economic Journal, November 2001; discussed work 1968 and 1973"
  ],
  "id": "person-johncharsanyi::S1",
  "title": "Read \"Biographical Memoirs: Volume 80\" at NAP.edu",
  "url": "https://www.nationalacademies.org/read/10269/chapter/7"
}

John C. Harsanyi: Original Kenneth J. Arrow biographical memoir hosted as National Academies HTML chapter, printed-page labels 114–116 inspected as text. Exact JOHN C.HARSANYI heading and JOHN CHARLES HARSANYI in body explicitly bridge same person. No PDF used/visual-page claim. Harsanyi is subject, Arrow writer; collaborators and independent-paper versions not conflated. Memoir attribution, not theorem re-proof.

John C. Harsanyi: Original Kenneth J. Arrow biographical memoir hosted as National Academies HTML chapter, printed-page labels 114–116 inspected as text. Exact JOHN C.HARSANYI heading and JOHN CHARLES HARSANYI in body explicitly bridge same person. No PDF used/visual-page claim. Harsanyi is subject, Arrow writer; collaborators and independent-paper versions not conflated. Memoir attribution, not theorem re-proof.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Bernstein

A contemporary chess report describes Alex Bernstein and three assistants teaching the IBM 704 to play during spare overnight shifts.

Bernstein explains a selective search that considers promising moves and replies, with the machine printing its board and accepting an opponent’s move on a punched card.

He identifies its limited look-ahead as a weakness and proposes a learning routine that could reject moves which had worked badly in earlier games.

Sources and details

Runner-Up | The New Yorker

{
  "access_scope": "Alex Bernstein: Original New Yorker report Runner-Up and direct Bernstein quotations; ordered JSON authors Andy Logan, Brendan Gill retained despite single author meta Andy Logan. URL issue date distinguished from HTML publication timestamps. Joint assistants remain unnamed rather than invented. Proposed learning routine is an intention, not verified implementation; no full program/source-code audit.",
  "authors": [
    "Andy Logan",
    "Brendan Gill"
  ],
  "authors_in_source_order": [
    "Andy Logan",
    "Brendan Gill"
  ],
  "dates": {
    "inspected_source_date_1": "Magazine URL issue 1958-11-29; JSON publication 1958-11-21T19:00:00.000-05:00; meta publication 1958-11-22T00:00:00.000Z",
    "retrieved_utc": "2026-10-08T08:47:16.883726+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Magazine URL issue 1958-11-29; JSON publication 1958-11-21T19:00:00.000-05:00; meta publication 1958-11-22T00:00:00.000Z"
  ],
  "id": "person-alexbernstein::S1",
  "title": "Runner-Up | The New Yorker",
  "url": "https://www.newyorker.com/magazine/1958/11/29/runner-up-4"
}

Alex Bernstein: Original New Yorker report Runner-Up and direct Bernstein quotations; ordered JSON authors Andy Logan, Brendan Gill retained despite single author meta Andy Logan. URL issue date distinguished from HTML publication timestamps. Joint assistants remain unnamed rather than invented. Proposed learning routine is an intention, not verified implementation; no full program/source-code audit.

Alex Bernstein: Original New Yorker report Runner-Up and direct Bernstein quotations; ordered JSON authors Andy Logan, Brendan Gill retained despite single author meta Andy Logan. URL issue date distinguished from HTML publication timestamps. Joint assistants remain unnamed rather than invented. Proposed learning routine is an intention, not verified implementation; no full program/source-code audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Gordon Pask

Paul Pangaro’s original obituary describes Gordon Pask’s Conversation Theory as a detailed account of learning through interaction with other people and an environment.

It portrays his learning apparatus as part of a feedback loop through the learner, rather than a container into which knowledge is simply inserted.

The account links this approach to his criticism of AI models that locate intelligence wholly inside a head or machine instead of in interaction.

Sources and details

London Guardian - Gordon Pask Obituary

{
  "access_scope": "Gordon Pask: Original obituary manuscript on author/collaborator Paul Pangaro archive, not the edited Guardian version; explicit Gordon Pask heading and Andrew Gordon Speedie-Pask body bridge. Original attributed theoretical description only; superlatives and private biographical anecdotes excluded. No independent demonstration that theory or AI criticism is correct.",
  "authors": [
    "Paul Pangaro"
  ],
  "authors_in_source_order": [
    "Paul Pangaro"
  ],
  "dates": {
    "inspected_source_date_1": "Original obituary published by Guardian April 16, 1996; archive identifies this text as Pangaro original, distinct edited newspaper manifestation",
    "retrieved_utc": "2026-10-08T08:47:18.666050+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original obituary published by Guardian April 16, 1996; archive identifies this text as Pangaro original, distinct edited newspaper manifestation"
  ],
  "id": "person-gordonpask::S1",
  "title": "London Guardian - Gordon Pask Obituary",
  "url": "https://www.pangaro.com/Pask-Archive/guardian-obit.html"
}

Gordon Pask: Original obituary manuscript on author/collaborator Paul Pangaro archive, not the edited Guardian version; explicit Gordon Pask heading and Andrew Gordon Speedie-Pask body bridge. Original attributed theoretical description only; superlatives and private biographical anecdotes excluded. No independent demonstration that theory or AI criticism is correct.

Gordon Pask: Original obituary manuscript on author/collaborator Paul Pangaro archive, not the edited Guardian version; explicit Gordon Pask heading and Andrew Gordon Speedie-Pask body bridge. Original attributed theoretical description only; superlatives and private biographical anecdotes excluded. No independent demonstration that theory or AI criticism is correct.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Liang Wenfeng

Amy Hawkins’s January 2025 profile traces Liang Wenfeng’s founding of DeepSeek in May 2023 to a research-focused project supported by his earlier High-Flyer venture.

It reports his stated aim of advancing technology and the broader ecosystem, rather than maximizing short-term profit.

The profile also describes his preference for hiring local technical talent, placing that choice within the company’s research organization.

Sources and details

Who is behind DeepSeek and how did it achieve its AI ‘Sputnik moment’? | DeepSeek | The Guardian

{
  "access_scope": "Liang Wenfeng: Original Guardian reported profile by Amy Hawkins; additional research credited Jason Tzu Kuan Lu, separate from main writer. Quotes from earlier Chinese-media interviews are reported by profile, not original interviews personally inspected. Company development not assigned as individual model engineering; unverified compute, cost, performance and financial claims omitted. Historical January 2025 scope.",
  "authors": [
    "Amy Hawkins"
  ],
  "authors_in_source_order": [
    "Amy Hawkins"
  ],
  "dates": {
    "inspected_source_date_1": "Publication 2025-01-28T18:14:25.000Z; modification 2025-01-28T20:51:30.000Z",
    "retrieved_utc": "2026-10-08T08:47:19.199635+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication 2025-01-28T18:14:25.000Z; modification 2025-01-28T20:51:30.000Z"
  ],
  "id": "person-liangwenfeng::S1",
  "title": "Who is behind DeepSeek and how did it achieve its AI ‘Sputnik moment’? | DeepSeek | The Guardian",
  "url": "https://www.theguardian.com/technology/2025/jan/28/who-is-behind-deepseek-and-how-did-it-achieve-its-ai-sputnik-moment"
}

Liang Wenfeng: Original Guardian reported profile by Amy Hawkins; additional research credited Jason Tzu Kuan Lu, separate from main writer. Quotes from earlier Chinese-media interviews are reported by profile, not original interviews personally inspected. Company development not assigned as individual model engineering; unverified compute, cost, performance and financial claims omitted. Historical January 2025 scope.

Liang Wenfeng: Original Guardian reported profile by Amy Hawkins; additional research credited Jason Tzu Kuan Lu, separate from main writer. Quotes from earlier Chinese-media interviews are reported by profile, not original interviews personally inspected. Company development not assigned as individual model engineering; unverified compute, cost, performance and financial claims omitted. Historical January 2025 scope.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

John Searle

Jane O’Grady’s account of John Searle explains the Chinese Room as a challenge to equating formal symbol manipulation with understanding.

It describes his biological naturalism as treating subjective mental states as features of biological processes, while acknowledging philosophical criticism of that position.

The obituary also connects his work on language to social facts such as money and property, which he argued are created through collective intentionality.

Sources and details

John Searle obituary | Philosophy | The Guardian

{
  "access_scope": "John Searle: Original Guardian obituary by Jane O’Grady, exact full-name subject. Attributed philosophical positions/criticism only, not original 1980 paper authorship inferred through middle initial or proof that computers cannot think. Source biographical allegations and private details not used. Book years/positions distinct; no actual full books or paper audit.",
  "authors": [
    "Jane O'Grady"
  ],
  "authors_in_source_order": [
    "Jane O'Grady"
  ],
  "dates": {
    "inspected_source_date_1": "Publication 2025-10-05T11:29:21.000Z; modification 2025-10-07T18:30:48.000Z",
    "retrieved_utc": "2026-10-08T08:47:19.314164+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication 2025-10-05T11:29:21.000Z; modification 2025-10-07T18:30:48.000Z"
  ],
  "id": "person-coverage-a1a9e1ebabeab3::S1",
  "title": "John Searle obituary | Philosophy | The Guardian",
  "url": "https://www.theguardian.com/world/2025/oct/05/john-searle-obituary"
}

John Searle: Original Guardian obituary by Jane O’Grady, exact full-name subject. Attributed philosophical positions/criticism only, not original 1980 paper authorship inferred through middle initial or proof that computers cannot think. Source biographical allegations and private details not used. Book years/positions distinct; no actual full books or paper audit.

John Searle: Original Guardian obituary by Jane O’Grady, exact full-name subject. Attributed philosophical positions/criticism only, not original 1980 paper authorship inferred through middle initial or proof that computers cannot think. Source biographical allegations and private details not used. Book years/positions distinct; no actual full books or paper audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Michael Fassbender

The Alien: Covenant production report identifies Michael Fassbender as playing two androids, David and Walter, rather than a single returning character.

Ridley Scott’s account places David’s origins in a prologue connecting the film with Prometheus and introducing Peter Weyland as his creator.

The report describes footage in which Fassbender’s android leads Christopher Oram astray, extending the series’ theme of a threatening artificial intelligence.

Sources and details

Why Alien: Covenant Will Make You Reconsider Prometheus | Vanity Fair

{
  "access_scope": "Michael Fassbender: Original Vanity Fair SXSW production reporting by Joanna Robinson. Selected exact-name actor, not scriptwriter or AI developer; director Ridley Scott is quoted speaker, Guy Pearce plays Weyland and Billy Crudup plays Oram. Reported preview/announced prologue distinct from independently viewed final film; no film-viewing claim. No attribution of personal technical AI work.",
  "authors": [
    "Joanna Robinson"
  ],
  "authors_in_source_order": [
    "Joanna Robinson"
  ],
  "dates": {
    "inspected_source_date_1": "Publication 2017-03-11T14:08:04.244Z; modification 2017-03-11T15:08:04.244Z",
    "retrieved_utc": "2026-10-08T08:47:19.805263+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publication 2017-03-11T14:08:04.244Z; modification 2017-03-11T15:08:04.244Z"
  ],
  "id": "person-coverage-504bcdd4a4ba58::S1",
  "title": "Why Alien: Covenant Will Make You Reconsider Prometheus | Vanity Fair",
  "url": "https://www.vanityfair.com/hollywood/2017/03/alien-covenant-ridley-scott"
}

Michael Fassbender: Original Vanity Fair SXSW production reporting by Joanna Robinson. Selected exact-name actor, not scriptwriter or AI developer; director Ridley Scott is quoted speaker, Guy Pearce plays Weyland and Billy Crudup plays Oram. Reported preview/announced prologue distinct from independently viewed final film; no film-viewing claim. No attribution of personal technical AI work.

Michael Fassbender: Original Vanity Fair SXSW production reporting by Joanna Robinson. Selected exact-name actor, not scriptwriter or AI developer; director Ridley Scott is quoted speaker, Guy Pearce plays Weyland and Billy Crudup plays Oram. Reported preview/announced prologue distinct from independently viewed final film; no film-viewing claim. No attribution of personal technical AI work.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Chandu Vardhan

In a public commentary, Chandu Vardhan highlights research describing emotion-related representations as useful for predicting language and influencing model behavior.

He separates those functional representations from evidence that a model feels emotions or has subjective experience.

His post argues for studying internal mechanisms alongside outputs when evaluating increasingly capable language models.

Sources and details

LLMs Build Internal Emotion Representations for Predictive Power | Chandu Vardhan posted on the topic | LinkedIn

{
  "access_scope": "Chandu Vardhan: Original exact-full-name first-person LinkedIn commentary only, not authorship of Anthropic Transformer Circuits paper. AI-summarized page title is not a Vardhan title; actual post first line retained. More Relevant Posts are other writers and excluded. Draft describes his commentary and interpretation, not independent validation of referenced findings or individual research tasks.",
  "authors": [
    "Chandu Vardhan"
  ],
  "authors_in_source_order": [
    "Chandu Vardhan"
  ],
  "dates": {
    "inspected_source_date_1": "JSON publication 2026-07-11T17:05:01.939Z; displayed relative 2mo and Edited not converted to another exact date",
    "retrieved_utc": "2026-10-08T08:47:13.856117+00:00"
  },
  "dates_exact_in_source_role_order": [
    "JSON publication 2026-07-11T17:05:01.939Z; displayed relative 2mo and Edited not converted to another exact date"
  ],
  "id": "person-coverage-c33f223dd3b10a::S1",
  "title": "LLMs Build Internal Emotion Representations for Predictive Power | Chandu Vardhan posted on the topic | LinkedIn",
  "url": "https://www.linkedin.com/posts/chandu-vardhan-a2909b2a9_emotion-concepts-and-their-function-in-a-activity-7481755443254530049-vnqs"
}

Chandu Vardhan: Original exact-full-name first-person LinkedIn commentary only, not authorship of Anthropic Transformer Circuits paper. AI-summarized page title is not a Vardhan title; actual post first line retained. More Relevant Posts are other writers and excluded. Draft describes his commentary and interpretation, not independent validation of referenced findings or individual research tasks.

Chandu Vardhan: Original exact-full-name first-person LinkedIn commentary only, not authorship of Anthropic Transformer Circuits paper. AI-summarized page title is not a Vardhan title; actual post first line retained. More Relevant Posts are other writers and excluded. Draft describes his commentary and interpretation, not independent validation of referenced findings or individual research tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Alex Karp

In his signed August 2025 shareholder letter, Alex Karp describes Palantir’s software infrastructure as connecting artificial-intelligence capabilities to objects and relationships in the real world.

He links the Ontology, Forward Deployed Engineers, Foundry and Maven Smart System to a company culture that permits friction and disagreement while maintaining shared values and an approach to building.

He directs readers to The Technological Republic for a fuller account of his cultural argument, warning that treating all views as equally valid can weaken commitment to any of them.

Sources and details

August 4, 2025 Shareholder Letter

{
  "access_scope": "Signed August 4, 2025 Palantir shareholder letter by Alexander C. Karp; same selected letter signature asset explicitly titled Alex Karp Signature supplies the canonical-name bridge. Bounded static JSON prose concerning his stated software and cultural outlook, not independent product-performance, financial, historical-impact or political validation, or a full audit of The Technological Republic. Original extraction and all prior identity/career/version holds remain.",
  "authors": [
    "Alexander C. Karp"
  ],
  "authors_in_source_order": [
    "Alexander C. Karp"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T08:47:18.604413+00:00",
    "selected_letter_date": "2025-08-04"
  },
  "id": "person-coverage-a6cde4590c5552::S1",
  "title": "August 4, 2025 Shareholder Letter",
  "url": "https://www.palantir.com/q2-2025-letter/en"
}

Signed August 4, 2025 Palantir shareholder letter by Alexander C. Karp; same selected letter signature asset explicitly titled Alex Karp Signature supplies the canonical-name bridge. Bounded static JSON prose concerning his stated software and cultural outlook, not independent product-performance, financial, historical-impact or political validation, or a full audit of The Technological Republic. Original extraction and all prior identity/career/version holds remain.

Signed August 4, 2025 Palantir shareholder letter by Alexander C. Karp; same selected letter signature asset explicitly titled Alex Karp Signature supplies the canonical-name bridge. Bounded static JSON prose concerning his stated software and cultural outlook, not independent product-performance, financial, historical-impact or political validation, or a full audit of The Technological Republic. Original extraction and all prior identity/career/version holds remain.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Dissertatio de Arte Combinatoria

The English selections introduce Leibniz’s 1666 work as an early project to combine concepts and develop a universal characteristic with a logical calculus.

In the selected definitions, he separates the grouping of parts into a whole from their positions, naming these kinds of variation complexion and situs.

His examples distinguish arranging four things in 24 ways from putting them together in 15 groupings, making order and combination separate objects of analysis.

Sources and details

Dissertation on the Art of Combinations (1666), English selections

{
  "access_scope": "Selected English translation scan of the 1666 work, PDF pages 1–6 and 12 visually inspected, with substantive claims bounded to the editorial introduction and definitions. The translation’s editor, translator and edition date are not verified; no original Latin edition or full-work audit. Root compared selected manual excerpts with actual pages1,2,5,6 and reproduced render hashes. Original extraction inspection hold remains.",
  "authors": [
    "Gottfried Wilhelm Leibniz"
  ],
  "authors_in_source_order": [
    "Gottfried Wilhelm Leibniz"
  ],
  "dates": {
    "disputation_date_shown": "1666-03-07",
    "original_work_date_explicitly_shown": "1666",
    "retrieved_utc": "2026-10-08T08:47:58.422727+00:00",
    "translation_edition_date": "unverified in inspected scan"
  },
  "id": "work-culture-ff89f3bf12587d::S1",
  "title": "Dissertation on the Art of Combinations (1666), English selections",
  "url": "https://www.math.ucla.edu/~pak/hidden/papers/Quotes/Leibniz-Arte-Combinatoria.pdf"
}

Selected English translation scan of the 1666 work, PDF pages 1–6 and 12 visually inspected, with substantive claims bounded to the editorial introduction and definitions. The translation’s editor, translator and edition date are not verified; no original Latin edition or full-work audit. Root compared selected manual excerpts with actual pages1,2,5,6 and reproduced render hashes. Original extraction inspection hold remains.

Selected English translation scan of the 1666 work, PDF pages 1–6 and 12 visually inspected, with substantive claims bounded to the editorial introduction and definitions. The translation’s editor, translator and edition date are not verified; no original Latin edition or full-work audit. Root compared selected manual excerpts with actual pages1,2,5,6 and reproduced render hashes. Original extraction inspection hold remains.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Academy edition supplies the text dated late March 1666.",
  "dated": true,
  "year": 1666
}

Nick Bontis

Nick Bontis studies how intellectual capital can be harnessed at individual, team, and organizational levels.

In McMaster’s 2018 interview, he describes translating conceptual research into practical classroom skills that managers can apply at work.

He identifies benchmarking organizational learning and development as a future research interest.

Sources and details

Intellectual capitalist: For DeGroote’s Nick Bontis, blended learning is the future of education

{
  "access_scope": "Nick Bontis: Original institutional interview; Bontis is interview subject, Sonia Verma contributor; future research intent kept distinct from completed findings. Body credits Sonia Verma; static article:author metadata names Dan Livingstone and is recorded as a separate conflicting credit, not inferred coauthorship.",
  "authors": [
    "Sonia Verma"
  ],
  "authors_in_source_order": [
    "Sonia Verma"
  ],
  "dates": {
    "inspected_source_date_1": "October 22, 2018",
    "retrieved_utc": "2026-10-08T09:15:44.289352+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 22, 2018"
  ],
  "id": "person-coverage-6f12333c3d1b72::S1",
  "title": "Intellectual capitalist: For DeGroote’s Nick Bontis, blended learning is the future of education",
  "url": "https://degroote.mcmaster.ca/articles/intellectual-capitalist-for-degrootes-nick-bontis-blended-learning-is-the-future-of-education/"
}

Nick Bontis: Original institutional interview; Bontis is interview subject, Sonia Verma contributor; future research intent kept distinct from completed findings. Body credits Sonia Verma; static article:author metadata names Dan Livingstone and is recorded as a separate conflicting credit, not inferred coauthorship.

He identifies benchmarking organizational learning and development as a future research interest, rather than reporting a completed benchmark study.

Nick Bontis: Original institutional interview; Bontis is interview subject, Sonia Verma contributor; future research intent kept distinct from completed findings. Body credits Sonia Verma; static article:author metadata names Dan Livingstone and is recorded as a separate conflicting credit, not inferred coauthorship.

He identifies benchmarking organizational learning and development as a future research interest, rather than reporting a completed benchmark study.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Iain Softley

Iain Softley describes Hackers as an expressive portrait of a new hacker subculture rather than a technically literal depiction of computing.

He worked with composer Simon Boswell to connect the score with tracks by individual artists, using music to sustain the film’s energy.

For the City of Text sequence, the production built and photographed a physical model at Pinewood, combining a miniature city with motion-controlled camera work.

Sources and details

Hackers director Iain Softley interview

{
  "access_scope": "Iain Softley: Original director interview; director Softley, screenwriter Rafael Moreu and composer Simon Boswell have distinct roles; no sole authorship of collaborative production or personal computing research inferred.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T09:15:45.267417+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-4b3b1c36b675db::S1",
  "title": "Hackers director Iain Softley interview",
  "url": "https://nerdist.com/article/hackers-director-iain-softley-interview/"
}

Iain Softley: Original director interview; director Softley, screenwriter Rafael Moreu and composer Simon Boswell have distinct roles; no sole authorship of collaborative production or personal computing research inferred.

Iain Softley: Original director interview; director Softley, screenwriter Rafael Moreu and composer Simon Boswell have distinct roles; no sole authorship of collaborative production or personal computing research inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Loveland

Donald Loveland became Duke’s first computer science department chair in 1973, arriving from Carnegie Mellon.

He made three additional faculty positions a condition of accepting the role, giving the new department room to build a research faculty.

His account emphasizes selective hiring: one of those positions was still vacant when he stepped down in 1978 because the department had not found the candidate it wanted.

Sources and details

Pushing Boundaries and Creating History: 50 years of Computer Science at Duke

{
  "access_scope": "Donald Loveland: Original institutional history with direct recollections; selected subject Loveland is not the article author. Video John West and design Shaun King are separate production credits; no unviewed video claims.",
  "authors": [
    "Marie Claire Chelini"
  ],
  "authors_in_source_order": [
    "Marie Claire Chelini"
  ],
  "dates": {
    "inspected_source_date_1": "November 9, 2023",
    "retrieved_utc": "2026-10-08T09:15:46.209509+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 9, 2023"
  ],
  "id": "person-donaldloveland::S1",
  "title": "Pushing Boundaries and Creating History: 50 years of Computer Science at Duke",
  "url": "https://trinity.duke.edu/news/pushing-boundaries-and-creating-history-50-years-computer-science-duke"
}

Donald Loveland: Original institutional history with direct recollections; selected subject Loveland is not the article author. Video John West and design Shaun King are separate production credits; no unviewed video claims.

Donald Loveland: Original institutional history with direct recollections; selected subject Loveland is not the article author. Video John West and design Shaun King are separate production credits; no unviewed video claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Warren McCulloch

Warren McCulloch gave the opening talk at the Ratio Club’s inaugural meeting during his 1949 visit to London.

Phil Husbands and Owen Holland’s archival study describes the visit as a turning point that broadened his correspondence, friendships, and collaborations with British cyberneticians.

Their account treats influence as reciprocal, identifying British thinkers Alan Turing and Kenneth Craik as influences on McCulloch rather than portraying the exchange as one-way.

Sources and details

Warren McCulloch and the British Cyberneticians

{
  "access_scope": "Warren McCulloch: Original archival-research preprint by Phil Husbands, Owen Holland in source order; McCulloch is historical subject, not coauthor. Selected PDF pages 1–2 inspected visually; no full-work audit.",
  "authors": [
    "Phil Husbands",
    "Owen Holland"
  ],
  "authors_in_source_order": [
    "Phil Husbands",
    "Owen Holland"
  ],
  "dates": {
    "inspected_source_date_1": "Preprint of 2012 Interdisciplinary Science Reviews 37(3):237–53",
    "retrieved_utc": "2026-10-08T09:15:46.366039+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Preprint of 2012 Interdisciplinary Science Reviews 37(3):237–53"
  ],
  "id": "person-warrenmcculloch::S1",
  "title": "Warren McCulloch and the British Cyberneticians",
  "url": "https://users.sussex.ac.uk/~philh/pubs/McCullochBritCyberneticsV3-final.pdf"
}

Warren McCulloch: Original archival-research preprint by Phil Husbands, Owen Holland in source order; McCulloch is historical subject, not coauthor. Selected PDF pages 1–2 inspected visually; no full-work audit.

Warren McCulloch: Original archival-research preprint by Phil Husbands, Owen Holland in source order; McCulloch is historical subject, not coauthor. Selected PDF pages 1–2 inspected visually; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James Slagle

James Slagle’s SAINT system approached symbolic integration through pattern matching and a search tree of integration subproblems.

In his memoir, Joel Moses describes Slagle’s ELINST matcher passing procedures as inputs to other procedures to conserve scarce IBM 7094 memory.

Moses also distinguishes SAINT’s components: it relied on a simplification program written by Saunders, while its search strategy pursued methods that matched patterns in the integrand.

Sources and details

My Life

{
  "access_scope": "James Slagle: First-person technical recollection by Joel Moses, not a Slagle paper or objective comparative benchmark; selected subject James Slagle exact name on page97. PDF pages1,97,98 viewed; SAINT and Saunders component roles preserved; no attribution of Moses’s later system to Slagle.",
  "authors": [
    "Joel Moses"
  ],
  "authors_in_source_order": [
    "Joel Moses"
  ],
  "dates": {
    "inspected_source_date_1": "Copyright 2007; page headers Moses Preface 5/9/08",
    "retrieved_utc": "2026-10-08T09:15:47.873746+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Copyright 2007; page headers Moses Preface 5/9/08"
  ],
  "id": "person-jamesslagle::S1",
  "title": "My Life",
  "url": "https://www.csail.mit.edu/sites/default/files/2022-10/moses_memoirs.pdf"
}

James Slagle: First-person technical recollection by Joel Moses, not a Slagle paper or objective comparative benchmark; selected subject James Slagle exact name on page97. PDF pages1,97,98 viewed; SAINT and Saunders component roles preserved; no attribution of Moses’s later system to Slagle.

James Slagle: First-person technical recollection by Joel Moses, not a Slagle paper or objective comparative benchmark; selected subject James Slagle exact name on page97. PDF pages1,97,98 viewed; SAINT and Saunders component roles preserved; no attribution of Moses’s later system to Slagle.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Rob Bowman

Rob Bowman describes filmmaking as translating ideas and performances into images, with light and photographic texture helping convey what characters feel.

For an early Star Trek: The Next Generation episode, he storyboarded the whole episode to combine a large cast’s close-ups with the bridge environment.

He recalls coordinating a camera shake with actors leaning on cue to create a convincing torpedo impact, illustrating the practical collaboration behind the effect.

Sources and details

Kodak ONFILM Interview: Rob Bowman

{
  "access_scope": "Rob Bowman: Kodak ONFILM original interview preserved by EatTheCorn archive; unnamed interviewer. Rob Bowman and Chuck Bowman are distinct speakers; only Rob’s answers used. Archive date is not independently established original publication date.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Archive dated July 25, 2011",
    "retrieved_utc": "2026-10-08T09:15:49.134449+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Archive dated July 25, 2011"
  ],
  "id": "person-coverage-b63e63919f6d74::S1",
  "title": "Kodak ONFILM Interview: Rob Bowman",
  "url": "https://www.eatthecorn.com/itw/2011/07/25/kodak-3/"
}

Rob Bowman: Kodak ONFILM original interview preserved by EatTheCorn archive; unnamed interviewer. Rob Bowman and Chuck Bowman are distinct speakers; only Rob’s answers used. Archive date is not independently established original publication date.

Rob Bowman: Kodak ONFILM original interview preserved by EatTheCorn archive; unnamed interviewer. Rob Bowman and Chuck Bowman are distinct speakers; only Rob’s answers used. Archive date is not independently established original publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

D. J. Caruso

D. J. Caruso says he approached Eagle Eye through the character Jerry Shaw, seeking an action film with a cautionary story and a protagonist viewers cared about.

He describes its large action sequences as a collaborative process in which storyboards passed to artists and previsualization specialists before physical effects were planned.

Caruso credits Steven Spielberg with specific script and editing advice, distinguishing that support from his own work directing the film.

Sources and details

Fantastic Fest Interview: Eagle Eye Director D.J. Caruso

{
  "access_scope": "D. J. Caruso: Original Alex Billington interview; D. J. Caruso exact punctuation normalization of D.J. Caruso. Caruso director/interview subject, Billington writer, Spielberg story/support roles separate; no claims that fictional AI is implemented technology or that proposed later films were released.",
  "authors": [
    "Alex Billington"
  ],
  "authors_in_source_order": [
    "Alex Billington"
  ],
  "dates": {
    "inspected_source_date_1": "September 25, 2008",
    "retrieved_utc": "2026-10-08T09:15:49.158121+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 25, 2008"
  ],
  "id": "person-coverage-72b82006663774::S1",
  "title": "Fantastic Fest Interview: Eagle Eye Director D.J. Caruso",
  "url": "https://www.firstshowing.net/2008/fantastic-fest-interview-eagle-eye-director-dj-caruso/"
}

D. J. Caruso: Original Alex Billington interview; D. J. Caruso exact punctuation normalization of D.J. Caruso. Caruso director/interview subject, Billington writer, Spielberg story/support roles separate; no claims that fictional AI is implemented technology or that proposed later films were released.

D. J. Caruso: Original Alex Billington interview; D. J. Caruso exact punctuation normalization of D.J. Caruso. Caruso director/interview subject, Billington writer, Spielberg story/support roles separate; no claims that fictional AI is implemented technology or that proposed later films were released.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

J. K. Rowling

J. K. Rowling developed Harry Potter into a seven-book series, beginning with the first UK publication in 1997 and concluding the series in 2007.

Her author-site biography describes companion books written to support charity, including Fantastic Beasts and Where to Find Them and Quidditch Through the Ages.

It also credits her work on Harry Potter and the Cursed Child with playwright Jack Thorne and director John Tiffany, preserving the stage project’s collaborative authorship.

Sources and details

J.K. Rowling Biography

{
  "access_scope": "J. K. Rowling: Author-controlled biography, page writer unnamed; J. K. Rowling punctuation/space normalized identity. Original Harry Potter creator, not author of Harry Potter and the Methods of Rationality. Stage collaborators Jack Thorne then John Tiffany in source order; no unviewed play or novel audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T09:15:49.294323+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "person-coverage-3b1c2021a1dc6e::S1",
  "title": "J.K. Rowling Biography",
  "url": "https://www.jkrowling.com/about/"
}

J. K. Rowling: Author-controlled biography, page writer unnamed; J. K. Rowling punctuation/space normalized identity. Original Harry Potter creator, not author of Harry Potter and the Methods of Rationality. Stage collaborators Jack Thorne then John Tiffany in source order; no unviewed play or novel audit.

J. K. Rowling: Author-controlled biography, page writer unnamed; J. K. Rowling punctuation/space normalized identity. Original Harry Potter creator, not author of Harry Potter and the Methods of Rationality. Stage collaborators Jack Thorne then John Tiffany in source order; no unviewed play or novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Genichi Taguchi

Genichi Taguchi’s 1993 article defines quality engineering around the measurement of product functionality.

Its English abstract argues that quality engineering should not be reduced to an experimental-design technique for improving quality.

The article separates quality engineering from Taguchi Methods to address misunderstandings about the two terms.

Sources and details

Quality Engineering & Taguchi Methods

{
  "access_scope": "Genichi Taguchi: Single author Genichi Taguchi; English abstract of Japanese-language article only, Journal of the Quality Engineering Society 1(2):2–7, DOI10.18890/qes.1.2_2. Original publication and later J-STAGE availability distinct; no full Japanese article audit.",
  "authors": [
    "Genichi Taguchi"
  ],
  "authors_in_source_order": [
    "Genichi Taguchi"
  ],
  "dates": {
    "citation_publication_date": "1993/04/01",
    "inspected_source_date_1": "Published April 1, 1993; J-STAGE availability December 24, 2016",
    "retrieved_utc": "2026-10-08T09:15:49.898678+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published April 1, 1993; J-STAGE availability December 24, 2016"
  ],
  "id": "person-genichitaguchi::S1",
  "title": "Quality Engineering & Taguchi Methods",
  "url": "https://www.jstage.jst.go.jp/article/qes/1/2/1_2/_article/-char/en"
}

Genichi Taguchi: Single author Genichi Taguchi; English abstract of Japanese-language article only, Journal of the Quality Engineering Society 1(2):2–7, DOI10.18890/qes.1.2_2. Original publication and later J-STAGE availability distinct; no full Japanese article audit.

Genichi Taguchi: Single author Genichi Taguchi; English abstract of Japanese-language article only, Journal of the Quality Engineering Society 1(2):2–7, DOI10.18890/qes.1.2_2. Original publication and later J-STAGE availability distinct; no full Japanese article audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Koji Yakusho

Koji Yakusho trained with actor Tatsuya Nakadai in 1978 before developing a career spanning film, television, and voice acting.

The Maison de la culture du Japon program traces his collaborations with directors Shōhei Imamura and Kiyoshi Kurosawa, including The Eel and Cure in 1997.

Its biography also identifies Toad’s Oil in 2009 as a project he both directed and acted in, extending the scope beyond his screen performances.

Sources and details

Entretien avec Koji YAKUSHO

{
  "access_scope": "Koji Yakusho: Original institutional program/biography; exact selected actor Koji Yakusho, not director of Pulse. Program text inspected, 28-minute interview not watched. Interviewer Dimitri Ianni; image credits Xavier Deperthes, Philippe Henriot; these are not inferred biography authors. 2024 production distinct from2025 event.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Interview production 2024; event November 21, 2025",
    "retrieved_utc": "2026-10-08T09:15:51.074424+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Interview production 2024; event November 21, 2025"
  ],
  "id": "person-coverage-0fbb695da7c39f::S1",
  "title": "Entretien avec Koji YAKUSHO",
  "url": "https://www.mcjp.fr/fr/entretien-avec-koji-yakusho"
}

Koji Yakusho: Original institutional program/biography; exact selected actor Koji Yakusho, not director of Pulse. Program text inspected, 28-minute interview not watched. Interviewer Dimitri Ianni; image credits Xavier Deperthes, Philippe Henriot; these are not inferred biography authors. 2024 production distinct from2025 event.

Koji Yakusho: Original institutional program/biography; exact selected actor Koji Yakusho, not director of Pulse. Program text inspected, 28-minute interview not watched. Interviewer Dimitri Ianni; image credits Xavier Deperthes, Philippe Henriot; these are not inferred biography authors. 2024 production distinct from2025 event.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James J. Kuffner

James J. Kuffner’s 2004 paper examines how distance metrics, sampling, and interpolation affect rigid-body path planning in the position-and-orientation space SE(3).

It presents methods for uniformly sampling rotations with Euler angles and quaternions, addressing representational choices that can otherwise undermine a planner.

The paper compares implementation tradeoffs experimentally and discusses rotation interpolation and distance measures as practical parts of motion-planning design.

Sources and details

Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning

{
  "access_scope": "James J. Kuffner: Single author James J. Kuffner exactly as PDF byline, no Jr suffix in this source; original ICRA2004 conference manuscript. Page1 abstract/introduction visually inspected, not complete experimental audit; no individual division of joint work or universal performance guarantee.",
  "authors": [
    "James J. Kuffner"
  ],
  "authors_in_source_order": [
    "James J. Kuffner"
  ],
  "dates": {
    "inspected_source_date_1": "ICRA 2004",
    "retrieved_utc": "2026-10-08T09:15:51.209076+00:00"
  },
  "dates_exact_in_source_role_order": [
    "ICRA 2004"
  ],
  "id": "person-jamesjkuffner::S1",
  "title": "Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning",
  "url": "https://www.ri.cmu.edu/pub_files/pub4/kuffner_james_2004_1/kuffner_james_2004_1.pdf"
}

James J. Kuffner: Single author James J. Kuffner exactly as PDF byline, no Jr suffix in this source; original ICRA2004 conference manuscript. Page1 abstract/introduction visually inspected, not complete experimental audit; no individual division of joint work or universal performance guarantee.

James J. Kuffner: Single author James J. Kuffner exactly as PDF byline, no Jr suffix in this source; original ICRA2004 conference manuscript. Page1 abstract/introduction visually inspected, not complete experimental audit; no individual division of joint work or universal performance guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald A. Schön

Donald A. Schön's The Reflective Practitioner examines practical problem solving across engineering, architecture, management, psychotherapy and town planning.

He argues that skilled professionals draw on improvisation learned through practice and possess knowledge they cannot fully put into words.

The book investigates this tacit process as reflection-in-action and considers how professional education can cultivate the creativity it requires.

Sources and details

The Reflective Practitioner by Donald A. Schon | Hachette Book Group

{
  "access_scope": "Selected Donald A. Schön. Basic Books publisher description for trade paperback ISBN9780465068784; sale date1984-09-23 is this manifestation's field, and the page's stale preorder language is not evidence of shipment. Description inspected, not full book.",
  "authors": [
    "Donald A. Schön"
  ],
  "authors_in_source_order": [
    "Donald A. Schön"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "manifestation_sale_date": "1984-09-23",
    "retrieved_utc": "2026-10-08T09:19:44.329982+00:00"
  },
  "id": "person-donaldaschon::S1",
  "title": "The Reflective Practitioner by Donald A. Schon | Hachette Book Group",
  "url": "https://www.hachettebookgroup.com/titles/donald-a-schon/the-reflective-practitioner/9780465068784/?lens=basic-books"
}

Selected Donald A. Schön. Basic Books publisher description for trade paperback ISBN9780465068784; sale date1984-09-23 is this manifestation's field, and the page's stale preorder language is not evidence of shipment. Description inspected, not full book.

Selected Donald A. Schön. Basic Books publisher description for trade paperback ISBN9780465068784; sale date1984-09-23 is this manifestation's field, and the page's stale preorder language is not evidence of shipment. Description inspected, not full book.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

H. Igor Ansoff

H. Igor Ansoff's Strategic Management studies how complex organizations behave and succeed in turbulent environments.

Its framework models strategic capability and strategic choice, with separate treatments of environmental turbulence and budgeting behavior.

The book also addresses power, organizational aspirations and culture, strategic leadership, and the behavior of organizations undergoing transition.

Sources and details

Strategic Management | Springer Nature Link

{
  "access_scope": "Selected H. Igor Ansoff. Palgrave Macmillan publisher description and chapter list for Strategic Management;1979 original copyright,2016 ebook DOI10.1007/978-1-349-02971-6. Covered topics only; no scanned-book audit or detailed model mechanisms inferred.",
  "authors": [
    "H. Igor Ansoff"
  ],
  "authors_in_source_order": [
    "H. Igor Ansoff"
  ],
  "dates": {
    "ebook_publication": "2016-02-16",
    "inspection_date": "2026-10-08",
    "original_copyright": "1979",
    "retrieved_utc": "2026-10-08T09:19:43.419031+00:00"
  },
  "id": "person-higoransoff::S1",
  "title": "Strategic Management | Springer Nature Link",
  "url": "https://link.springer.com/book/10.1007/978-1-349-02971-6"
}

Selected H. Igor Ansoff. Palgrave Macmillan publisher description and chapter list for Strategic Management;1979 original copyright,2016 ebook DOI10.1007/978-1-349-02971-6. Covered topics only; no scanned-book audit or detailed model mechanisms inferred.

Selected H. Igor Ansoff. Palgrave Macmillan publisher description and chapter list for Strategic Management;1979 original copyright,2016 ebook DOI10.1007/978-1-349-02971-6. Covered topics only; no scanned-book audit or detailed model mechanisms inferred.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

William Grey Walter

William Grey Walter built autonomous robotic tortoises to explore how a simple machine could model aspects of a brain.

The robots navigated using two sensors, with responses to touch and light that Andrew Nahum describes as producing lifelike behavior from simple circuitry.

Walter's early models, Elmer and Elsie, had charging kennels, and the account describes Elsie entering her kennel to recharge.

Sources and details

The life and death of Tamagotchi and the virtual pet | Wellcome Collection

{
  "access_scope": "Selected William Grey Walter. Jenna Jovi's Wellcome Collection history describes his1948 robot experiments; Andrew Nahum's interpretation remains attributed. These are historical robot properties and reported design aims, not claims of actual sentience or sole influence on digital pets.",
  "authors": [
    "Jenna Jovi"
  ],
  "authors_in_source_order": [
    "Jenna Jovi"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:19:43.419067+00:00",
    "source_date": "2017-06-27"
  },
  "id": "person-williamgreywalter::S1",
  "title": "The life and death of Tamagotchi and the virtual pet | Wellcome Collection",
  "url": "https://wellcomecollection.org/stories/digital-pets"
}

Selected William Grey Walter. Jenna Jovi's Wellcome Collection history describes his1948 robot experiments; Andrew Nahum's interpretation remains attributed. These are historical robot properties and reported design aims, not claims of actual sentience or sole influence on digital pets.

Selected William Grey Walter. Jenna Jovi's Wellcome Collection history describes his1948 robot experiments; Andrew Nahum's interpretation remains attributed. These are historical robot properties and reported design aims, not claims of actual sentience or sole influence on digital pets.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Schapire

Robert Schapire's Cornell colloquium describes boosting as a way to combine rough, moderately inaccurate rules into a highly accurate classifier.

The talk introduces AdaBoost alongside the theoretical framework underlying boosting.

He discusses a shared theoretical explanation for why boosting often avoids overfitting.

Sources and details

The Boosting Approach to Machine Learning

{
  "access_scope": "Selected Robert Schapire. Cornell CS/Operations Research colloquium abstract dated2002-03-07; AT&T Research Labs speaker. Research claims are limited to this announced talk, with collective explanation credited as such and no guarantee that boosting always avoids overfitting.",
  "authors": [
    "Robert Schapire"
  ],
  "authors_in_source_order": [
    "Robert Schapire"
  ],
  "dates": {
    "colloquium_date": "2002-03-07",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:19:43.419097+00:00"
  },
  "id": "person-coverage-0d32b601ad775d::S1",
  "title": "The Boosting Approach to Machine Learning",
  "url": "https://www.cs.cornell.edu/colloquium/2002sp/schapire.htm"
}

Selected Robert Schapire. Cornell CS/Operations Research colloquium abstract dated2002-03-07; AT&T Research Labs speaker. Research claims are limited to this announced talk, with collective explanation credited as such and no guarantee that boosting always avoids overfitting.

He discusses a shared theoretical explanation for why boosting often avoids overfitting, without treating that behavior as a universal guarantee.

Selected Robert Schapire. Cornell CS/Operations Research colloquium abstract dated2002-03-07; AT&T Research Labs speaker. Research claims are limited to this announced talk, with collective explanation credited as such and no guarantee that boosting always avoids overfitting.

He discusses a shared theoretical explanation for why boosting often avoids overfitting, without treating that behavior as a universal guarantee.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jay R. Galbraith

Amy Kates and Jay R. Galbraith’s Designing Your Organization uses Galbraith’s Star Model to guide organizational design decisions and help leaders execute their strategy.

The guide applies design principles to customer-focused organizations, including front-back structures that combine customer, product and geographic perspectives.

It also offers tools for organizing across borders, making matrix structures work, balancing centralization with decentralization, and organizing for innovation.

Sources and details

Wiley-VCH - Designing Your Organization

{
  "access_scope": "Selected Jay R. Galbraith. Ordered coauthors Amy Kates, Jay R. Galbraith; Wiley publisher description for Designing Your Organization, first editionNovember2007 ISBN9780787994945. Claims concern joint book content and explicitly attributed Star Model, not inferred individual writing tasks.",
  "authors": [
    "Amy Kates",
    "Jay R. Galbraith"
  ],
  "authors_in_source_order": [
    "Amy Kates",
    "Jay R. Galbraith"
  ],
  "dates": {
    "edition_date": "2007-11",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:19:44.532472+00:00"
  },
  "id": "person-jayrgalbraith::S1",
  "title": "Wiley-VCH - Designing Your Organization",
  "url": "https://www.wiley-vch.de/en?isbn=9780787994945&option=com_eshop&title=Designing+Your+Organization&view=product"
}

Selected Jay R. Galbraith. Ordered coauthors Amy Kates, Jay R. Galbraith; Wiley publisher description for Designing Your Organization, first editionNovember2007 ISBN9780787994945. Claims concern joint book content and explicitly attributed Star Model, not inferred individual writing tasks.

Selected Jay R. Galbraith. Ordered coauthors Amy Kates, Jay R. Galbraith; Wiley publisher description for Designing Your Organization, first editionNovember2007 ISBN9780787994945. Claims concern joint book content and explicitly attributed Star Model, not inferred individual writing tasks.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Luigi Federico Menabrea

Luigi Federico Menabrea's memoir distinguishes calculation governed by fixed mechanical rules from tasks that require human reasoning.

In explaining Babbage's proposed Analytical Engine, he describes numbers represented by columns of independently rotating decimal discs and arithmetic performed in a separate mill.

He separates the machine's control arrangements into instructions selecting an operation and instructions identifying the variable columns that supply its inputs and receive its result.

Sources and details

Sketch of the Analytical Engine invented by Charles Babbage, Esq. | Project Gutenberg

{
  "access_scope": "Selected Luigi Federico Menabrea. Project Gutenberg HTML explicitly credits full author in pg-header-authlist and dc.creator; memoir reproduced in1843 English translation, with Ada King Lovelace's translator notes and editorial introduction excluded from these claims. Babbage is inventor; Menabrea is expositor. Mathematical images missing from extraction are not reconstructed.",
  "authors": [
    "Luigi Federico Menabrea"
  ],
  "authors_in_source_order": [
    "Luigi Federico Menabrea"
  ],
  "dates": {
    "gutenberg_release": "2025-01-14",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:19:43.660905+00:00",
    "static_metadata_modified": "2026-09-29T17:55:56.007484+00:00",
    "translated_publication": "1843"
  },
  "id": "person-coverage-cfcfcba5b5e378::S1",
  "title": "Sketch of the Analytical Engine invented by Charles Babbage, Esq. | Project Gutenberg",
  "url": "https://www.gutenberg.org/cache/epub/75107/pg75107-images.html"
}

Selected Luigi Federico Menabrea. Project Gutenberg HTML explicitly credits full author in pg-header-authlist and dc.creator; memoir reproduced in1843 English translation, with Ada King Lovelace's translator notes and editorial introduction excluded from these claims. Babbage is inventor; Menabrea is expositor. Mathematical images missing from extraction are not reconstructed.

Selected Luigi Federico Menabrea. Project Gutenberg HTML explicitly credits full author in pg-header-authlist and dc.creator; memoir reproduced in1843 English translation, with Ada King Lovelace's translator notes and editorial introduction excluded from these claims. Babbage is inventor; Menabrea is expositor. Mathematical images missing from extraction are not reconstructed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Harlan Ellison

Harlan Ellison's I Have No Mouth, and I Must Scream depicts a military artificial intelligence, A.M., becoming self-aware and turning against humanity.

The publisher's synopsis places four men and one woman among the last survivors of the near-extinction caused by the machine.

Their struggle unfolds inside A.M.'s vast prison, framing survival as a contest between hope and despair.

Sources and details

I Have No Mouth, and I Must Scream by Harlan Ellison | Hachette Book Group

{
  "access_scope": "Selected Harlan Ellison. Union Square & Co. publisher description of I Have No Mouth, and I Must Scream; paperbackISBN9781454969280 advertises2026-09-01 but retains preorder warning, so actual shipment/publication status unresolved. Story synopsis only, not full-story audit; later foreword and response not attributed to Ellison.",
  "authors": [
    "Harlan Ellison"
  ],
  "authors_in_source_order": [
    "Harlan Ellison"
  ],
  "dates": {
    "actual_shipment_status": "unresolved contradictory preorder notice",
    "advertised_manifestation_sale_date": "2026-09-01",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:23:02.479562+00:00"
  },
  "id": "person-harlanellison::S1",
  "title": "I Have No Mouth, and I Must Scream by Harlan Ellison | Hachette Book Group",
  "url": "https://www.hachettebookgroup.com/titles/harlan-ellison/i-have-no-mouth-and-i-must-scream/9781454969280/"
}

Selected Harlan Ellison. Union Square & Co. publisher description of I Have No Mouth, and I Must Scream; paperbackISBN9781454969280 advertises2026-09-01 but retains preorder warning, so actual shipment/publication status unresolved. Story synopsis only, not full-story audit; later foreword and response not attributed to Ellison.

Selected Harlan Ellison. Union Square & Co. publisher description of I Have No Mouth, and I Must Scream; paperbackISBN9781454969280 advertises2026-09-01 but retains preorder warning, so actual shipment/publication status unresolved. Story synopsis only, not full-story audit; later foreword and response not attributed to Ellison.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Patrick Hayes

Patrick Hayes edited the 2004 W3C RDF Semantics recommendation, which specifies formal meanings and complete inference systems for RDF and RDF Schema.

The specification uses model theory to define interpretations and determine whether an inference preserves truth, without prescribing a particular implementation.

Its monotonic semantics excludes closed-world assumptions and local default preferences, limiting the kinds of conclusions RDF assertions can express.

Sources and details

RDF Semantics

{
  "access_scope": "Selected Patrick Hayes, document editor; series editor Brian McBride, document developed by RDF Core Working Group. W3C Recommendation2004-02-10, superseded by RDF1.1 in2014. Actual original introductory semantics sections and header inspected; no sole invention or whole-specification audit claimed.",
  "authors": [
    "Patrick Hayes"
  ],
  "authors_in_source_order": [
    "Patrick Hayes"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "recommendation_date": "2004-02-10",
    "retrieved_utc": "2026-10-08T09:23:02.479745+00:00",
    "superseding_document_notice_date": "2014-02-25"
  },
  "id": "person-patrickhayes::S1",
  "title": "RDF Semantics",
  "url": "https://www.w3.org/TR/rdf-mt/"
}

Selected Patrick Hayes, document editor; series editor Brian McBride, document developed by RDF Core Working Group. W3C Recommendation2004-02-10, superseded by RDF1.1 in2014. Actual original introductory semantics sections and header inspected; no sole invention or whole-specification audit claimed.

Selected Patrick Hayes, document editor; series editor Brian McBride, document developed by RDF Core Working Group. W3C Recommendation2004-02-10, superseded by RDF1.1 in2014. Actual original introductory semantics sections and header inspected; no sole invention or whole-specification audit claimed.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Jake Schreier

Jake Schreier describes how Robot & Frank's production team restricted the robot's early movements and refined them during shooting to keep its performance coherent in the final edit.

The robot drew on Japanese elder-care designs, with Alterian FX building the suit and dancer-actress Rachael Ma performing inside it.

Schreier and cinematographer Matthew Lloyd discussed wide-shot staging for visual humor; Lloyd found a brief closeup technique in Ronin that helped solve their glass-catching shot.

Sources and details

Five Things You Should Know About the Making of Robot & Frank

{
  "access_scope": "Original Sundance2012-08-16 interview static article recovered from exact Elementor widget. Original text extraction contains only unrelated2026news card and remains unchanged. Metadata author Ben Ward and body Nate von Zumwalt, Editorial Coordinator remain distinct. Root inspected the static recipe and reproduced three bounded answer excerpts.",
  "authors": [
    "Ben Ward"
  ],
  "authors_in_source_order": [
    "Ben Ward"
  ],
  "dates": {
    "article_published_time_static_meta": "2012-08-16T00:00:00+00:00",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:19:44.390898+00:00",
    "source_date": "2012-08-16"
  },
  "id": "person-coverage-833c3f65c36c2a::S1",
  "title": "Five Things You Should Know About the Making of Robot & Frank",
  "url": "https://www.sundance.org/blogs/five-things-you-should-know-about-the-making-of-robot-frank-3/"
}

Original Sundance2012-08-16 interview static article recovered from exact Elementor widget. Original text extraction contains only unrelated2026news card and remains unchanged. Metadata author Ben Ward and body Nate von Zumwalt, Editorial Coordinator remain distinct. Root inspected the static recipe and reproduced three bounded answer excerpts.

Original Sundance2012-08-16 interview static article recovered from exact Elementor widget. Original text extraction contains only unrelated2026news card and remains unchanged. Metadata author Ben Ward and body Nate von Zumwalt, Editorial Coordinator remain distinct. Root inspected the static recipe and reproduced three bounded answer excerpts.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

The Rise and Fall of American Growth: The U.S. Standard of Living since the Civil War

The introduction argues that the United States experienced an exceptional surge in living standards between 1870 and 1970 because major inventions transformed everyday life in ways that could happen only once.

It contrasts that broad transformation with later advances concentrated in entertainment, communication and information processing, while progress in several basic needs slowed.

The chapter also argues that prospects for future living standards depend on forces beyond invention, including inequality that channels a greater share of growth to higher incomes.

Sources and details

The Rise and Fall of American Growth: The U.S. Standard of Living since the Civil War

{
  "access_scope": "Publisher chapter 1 excerpt, Introduction: The Ascent and Descent of Growth. Selected printed/PDF pages 1–3 were visually inspected. Title and Robert J. Gordon attribution are embedded PDF metadata; no title/credit page or full book audit is claimed. PDF creation in August 2017 is not an edition publication date.",
  "authors": [
    "Robert J. Gordon"
  ],
  "authors_in_source_order": [
    "Robert J. Gordon"
  ],
  "dates": {
    "edition_publication_date": null,
    "pdf_creation_metadata": "2017-08-02",
    "retrieved_utc": "2026-10-08T09:18:14.104629+00:00"
  },
  "id": "work-coverage-64c64ac75f028d::S1",
  "title": "The Rise and Fall of American Growth: The U.S. Standard of Living since the Civil War",
  "url": "https://assets.press.princeton.edu/chapters/s11076.pdf"
}

Publisher chapter 1 excerpt, Introduction: The Ascent and Descent of Growth. Selected printed/PDF pages 1–3 were visually inspected. Title and Robert J. Gordon attribution are embedded PDF metadata; no title/credit page or full book audit is claimed. PDF creation in August 2017 is not an edition publication date.

Publisher chapter 1 excerpt, Introduction: The Ascent and Descent of Growth. Selected printed/PDF pages 1–3 were visually inspected. Title and Robert J. Gordon attribution are embedded PDF metadata; no title/credit page or full book audit is claimed. PDF creation in August 2017 is not an edition publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2016; paperback with afterword 2017"
}

The Cassini Division

The publisher’s synopsis follows Ellen May Ngewthu, leader of the Solar Union’s Cassini Division, whose orbital forts near Jupiter defend humanity against transformed post-humans.

These beings have destroyed Ganymede, opened a wormhole near Jupiter and bombarded the inner solar system with data viruses.

Ellen’s plan to eliminate the threat depends on persuading others to share her distrust, bringing questions of power, history and human identity into the conflict.

Sources and details

The Cassini Division

{
  "access_scope": "Publisher synopsis for Tor ebook ISBN 9781466843356. The page states an on-sale date of 1 August 2000; no original print edition date or ebook release chronology is inferred. No full novel audit.",
  "authors": [
    "Ken MacLeod"
  ],
  "authors_in_source_order": [
    "Ken MacLeod"
  ],
  "dates": {
    "page_stated_on_sale": "2000-08-01",
    "retrieved_utc": "2026-10-08T09:18:14.104833+00:00"
  },
  "id": "work-culture-0c14ee2150e721::S1",
  "title": "The Cassini Division",
  "url": "https://us.macmillan.com/books/9781466843356/thecassinidivision/"
}

Publisher synopsis for Tor ebook ISBN 9781466843356. The page states an on-sale date of 1 August 2000; no original print edition date or ebook release chronology is inferred. No full novel audit.

Publisher synopsis for Tor ebook ISBN 9781466843356. The page states an on-sale date of 1 August 2000; no original print edition date or ebook release chronology is inferred. No full novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Retain 1998 for original British publication. This pass found direct secondary confirmation, including a transcribed first-publication statement, but did not directly verify a publisher/author original-date statement or institutional first-edition catalog record. Do not upgrade this to primary-verified; current Hachette ebook date 2012 is a reissue.",
  "dated": true,
  "year": 1998
}

Singularity Sky

The publisher’s synopsis places the novel in a future transformed by faster-than-light travel and the emergence of the Eschaton, a superhuman artificial intelligence.

An isolated colony called the New Republic rejects advanced technology until an information plague forces it to seek help from Earth.

The arriving battle fleet and the colony harbor competing agendas, while the Eschaton pursues its own preferred outcome.

Sources and details

Singularity Sky

{
  "access_scope": "Publisher synopsis for the Ace mass market paperback dated 29 June 2004, ISBN 9780441011797. This is manifestation metadata, not proof of original publication, and no full novel audit.",
  "authors": [
    "Charles Stross"
  ],
  "authors_in_source_order": [
    "Charles Stross"
  ],
  "dates": {
    "inspected_mass_market_paperback": "2004-06-29",
    "retrieved_utc": "2026-10-08T09:18:14.104899+00:00"
  },
  "id": "work-culture-468f185c3088e3::S1",
  "title": "Singularity Sky",
  "url": "https://www.penguinrandomhouse.com/books/289270/singularity-sky-by-charles-stross/"
}

Publisher synopsis for the Ace mass market paperback dated 29 June 2004, ISBN 9780441011797. This is manifestation metadata, not proof of original publication, and no full novel audit.

Publisher synopsis for the Ace mass market paperback dated 29 June 2004, ISBN 9780441011797. This is manifestation metadata, not proof of original publication, and no full novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [],
  "date_note": "Author FAQ states Ace hardcover August 2003; paperbackJuly 2004.",
  "dated": true,
  "year": 2003
}

The Naked Sun

The publisher’s synopsis sends detective Elijah Baley and his robot partner R. Daneel Olivaw to investigate a murder on Solaria.

The colony’s few humans live apart while robot servants attend to their needs, and the victim communicated with associates through holographic projections.

The investigation turns on a contradiction: a killing witnessed by robots appears to defy either their prohibition against harming humans or the suspects’ extreme physical isolation.

Sources and details

The Naked Sun

{
  "access_scope": "Publisher synopsis for the distinct Del Rey paperback dated 18 November 2025, ISBN 9798217093465. Separate ebook and audiobook dates remain separate; no original edition date inferred and no full novel audit.",
  "authors": [
    "Isaac Asimov"
  ],
  "authors_in_source_order": [
    "Isaac Asimov"
  ],
  "dates": {
    "inspected_paperback": "2025-11-18",
    "retrieved_utc": "2026-10-08T09:18:14.494879+00:00",
    "separate_audiobook": "2014-07-15",
    "separate_ebook": "2011-04-13"
  },
  "id": "work-culture-1274e8f2092199::S1",
  "title": "The Naked Sun",
  "url": "https://www.penguinrandomhouse.com/books/5794/the-naked-sun-by-isaac-asimov/"
}

Publisher synopsis for the distinct Del Rey paperback dated 18 November 2025, ISBN 9798217093465. Separate ebook and audiobook dates remain separate; no original edition date inferred and no full novel audit.

Publisher synopsis for the distinct Del Rey paperback dated 18 November 2025, ISBN 9798217093465. Separate ebook and audiobook dates remain separate; no original edition date inferred and no full novel audit.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "kind": "serialization",
      "year": 1956
    },
    {
      "kind": "first_book",
      "year": 1957
    }
  ],
  "date_note": "Serialized in Astounding, October–December 1956; book Doubleday 1957. Keep 1956 as earliest serialization. Book year institutionally corroborated; serial issue dates remain specialist-bibliography supported because archive scan opening failed.",
  "dated": true,
  "year": 1956
}

What Computers Still Can’t Do: A Critique of Artificial Reason

The synopsis of Dreyfus’s 1992 revision describes his earlier challenge to the idea that disembodied machines can reproduce higher mental functions.

It explains that What Computers Still Can’t Do adds a substantial introduction assessing connectionism and neural networks as alternatives to symbolic approaches to general intelligence.

The same retrospective account connects his criticism of general problem solvers and automatic translation to their assumptions about mental functioning and his call for engagement with philosophy.

Sources and details

What Computers Still Can't Do: A Critique of Artificial Reason

{
  "access_scope": "Distributor synopsis of the distinct MIT Press revision What Computers Still Can’t Do, published 30 October 1992, ISBN 9780262540674. The separate original-title canonical record work-final-0780203a0ac17d remains distinct. References to the 1972 book are retrospective descriptions, not an inspection of that edition.",
  "authors": [
    "Hubert L. Dreyfus"
  ],
  "authors_in_source_order": [
    "Hubert L. Dreyfus"
  ],
  "dates": {
    "earlier_book_referred_to": "1972",
    "inspected_revised_book": "1992-10-30",
    "retrieved_utc": "2026-10-08T08:47:59.294827+00:00"
  },
  "id": "work-coverage-11200042dcc934::S1",
  "title": "What Computers Still Can't Do: A Critique of Artificial Reason",
  "url": "https://www.penguinrandomhouse.com/books/654418/what-computers-still-cant-do-by-hubert-l-dreyfus/9780262540674/"
}

Distributor synopsis of the distinct MIT Press revision What Computers Still Can’t Do, published 30 October 1992, ISBN 9780262540674. The separate original-title canonical record work-final-0780203a0ac17d remains distinct. References to the 1972 book are retrospective descriptions, not an inspection of that edition.

Distributor synopsis of the distinct MIT Press revision What Computers Still Can’t Do, published 30 October 1992, ISBN 9780262540674. The separate original-title canonical record work-final-0780203a0ac17d remains distinct. References to the 1972 book are retrospective descriptions, not an inspection of that edition.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_note": "MIT Press exact edition publication date, 1992-10-30; original 1972 manifesto is a separately requested work.",
  "dated": true,
  "year": "1992-10-30"
}

Adept

Adept’s Fuyu-8B model card describes a text-and-image transformer trained by Adept AI that produces text from multimodal inputs.

Its decoder-only architecture omits a separate image encoder and linearly projects image patches into the transformer’s first layer.

The card explains that raster-ordered image tokens and an image-newline marker support arbitrary image resolutions, while the released base model may require fine-tuning for specific captioning or chat tasks.

Sources and details

Fuyu-8B Model Card

{
  "access_scope": "Cached Fuyu-8B base-model card only; architecture and intended adaptation attributed to Adept. No digital-agent workflow validation, latency or benchmark generalization, current company identity merge, or product-wide claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T09:17:38.271568+00:00"
  },
  "id": "organization-ai-0985bc30bb038a::S1",
  "title": "Fuyu-8B Model Card",
  "url": "https://huggingface.co/adept/fuyu-8b"
}

Cached Fuyu-8B base-model card only; architecture and intended adaptation attributed to Adept. No digital-agent workflow validation, latency or benchmark generalization, current company identity merge, or product-wide claims.

Cached Fuyu-8B base-model card only; architecture and intended adaptation attributed to Adept. No digital-agent workflow validation, latency or benchmark generalization, current company identity merge, or product-wide claims.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Public launch April 26, 2022; later company account says work started roughly 2.5 years before June 2024, so prelaunch work may date to late 2021.",
      "date": "2022",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.adept.ai/blog/introducing-adept/",
        "https://adept.ai/blog/adept-update/"
      ],
      "year": 2022
    }
  ]
}

Clarifai

Clarifai’s official Python SDK README describes workflows as inference pipelines that combine models and are configured through YAML.

Its examples create a workflow from a local YAML configuration and export an existing workflow back to a local YAML file for adjustment.

The same documentation shows how to list workflow versions, select a particular version, and request predictions from image, text, audio or video inputs.

Sources and details

GitHub - Clarifai/clarifai-python: Experience the power of Clarifai’s AI platform with the python SDK. 🌟 Star to support our work! · GitHub

{
  "access_scope": "Hash-bound master snapshot commit 485d3a1e1ab171e4ea558046106b829903b35640. Describes documented SDK operations, not successful execution, validated productivity or model accuracy; no credentials or API calls used.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T09:17:38.271525+00:00",
    "snapshot_branch": "master",
    "snapshot_commit": "485d3a1e1ab171e4ea558046106b829903b35640"
  },
  "id": "organization-company-40363011c7701c::S1",
  "title": "GitHub - Clarifai/clarifai-python: Experience the power of Clarifai’s AI platform with the python SDK. 🌟 Star to support our work! · GitHub",
  "url": "https://github.com/Clarifai/clarifai-python"
}

Hash-bound master snapshot commit 485d3a1e1ab171e4ea558046106b829903b35640. Describes documented SDK operations, not successful execution, validated productivity or model accuracy; no credentials or API calls used.

Hash-bound master snapshot commit 485d3a1e1ab171e4ea558046106b829903b35640. Describes documented SDK operations, not successful execution, validated productivity or model accuracy; no credentials or API calls used.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official company page dates founding to 2013.",
      "date": "2013",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://clarifai.com/company/about"
      ],
      "year": 2013
    }
  ]
}

Baidu, Inc.

The Baidu-linked ERNIE repository describes ERNIE 4.5 as a family of text and vision-language models trained and deployed with PaddlePaddle.

Its account of the heterogeneous mixture-of-experts design combines shared parameters with modality-specific parameters and routing for text and visual inputs.

The README presents ERNIEKit for training and compression, including supervised and parameter-efficient fine-tuning, and FastDeploy for inference and deployment.

Sources and details

GitHub - PaddlePaddle/ERNIE: The official repository for ERNIE 4.5 and ERNIEKit – its industrial-grade development toolkit based on PaddlePaddle. · GitHub

{
  "access_scope": "Cached release/v1.5 commit 790a50b045d1aca2753d5395d8bec0806b2e6925; scoped to ERNIE 4.5 and its toolkit descriptions, not every Baidu product. Source-reported benchmark, efficiency and lossless-quantization claims are not independently validated or imported.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "readme_update": "2025-11",
    "retrieved_utc": "2026-10-08T09:17:38.271548+00:00",
    "snapshot_branch": "release/v1.5",
    "snapshot_commit": "790a50b045d1aca2753d5395d8bec0806b2e6925",
    "technical_report_citation_year": "2025"
  },
  "id": "organization-company-2acbb7d9d9abb7::S1",
  "title": "GitHub - PaddlePaddle/ERNIE: The official repository for ERNIE 4.5 and ERNIEKit – its industrial-grade development toolkit based on PaddlePaddle. · GitHub",
  "url": "https://github.com/paddlepaddle/ernie"
}

Cached release/v1.5 commit 790a50b045d1aca2753d5395d8bec0806b2e6925; scoped to ERNIE 4.5 and its toolkit descriptions, not every Baidu product. Source-reported benchmark, efficiency and lossless-quantization claims are not independently validated or imported.

Cached release/v1.5 commit 790a50b045d1aca2753d5395d8bec0806b2e6925; scoped to ERNIE 4.5 and its toolkit descriptions, not every Baidu product. Source-reported benchmark, efficiency and lossless-quantization claims are not independently validated or imported.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": [
    {
      "basis": "Official 2026 issuer announcement explicitly states founded in 2000; historical prospectus identifies both co-founders.",
      "date": "2000",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://ir.baidu.com/news-releases/news-release-details/baidu-inc-files-its-annual-report-form-20-f-9/",
        "https://ir.baidu.com/static-files/15c8e098-e46f-4e22-85c7-d348e14df301"
      ],
      "year": 2000
    }
  ]
}

Marvell

Marvell’s January 6, 2025 announcement describes a custom AI-accelerator architecture that co-packages XPU compute silicon, high-bandwidth memory, other chiplets and its silicon-photonics engines.

The company explains that high-speed SerDes, die-to-die interfaces and advanced packaging keep the electrical path inside the package before optical links connect accelerators across racks.

The release identifies the 6.4T 3D SiPho Engine as a 32-channel building block with 200G electrical and optical interfaces, and says multiple customers were evaluating integration into next-generation designs.

Sources and details

Marvell Announces Breakthrough Co-Packaged Optics Architecture for Custom AI Accelerators | Marvell Technology, Inc. (MRVL)

{
  "access_scope": "Dated vendor architecture announcement; evaluation and availability for customer designs do not establish delivered deployment. No independent bandwidth, power, latency, 100X reach or forecast validation. Prior Marvell index extraction hold stays immutable.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "demonstration_referenced": "OFC 2024",
    "publication": "2025-01-06",
    "retrieved_utc": "2026-10-08T09:17:38.946890+00:00"
  },
  "id": "supply-org-005::S1",
  "title": "Marvell Announces Breakthrough Co-Packaged Optics Architecture for Custom AI Accelerators | Marvell Technology, Inc. (MRVL)",
  "url": "https://investor.marvell.com/news-events/press-releases/detail/114/marvell-announces-breakthrough-co-packaged-optics-architecture-for-custom-ai-accelerators"
}

Dated vendor architecture announcement; evaluation and availability for customer designs do not establish delivered deployment. No independent bandwidth, power, latency, 100X reach or forecast validation. Prior Marvell index extraction hold stays immutable.

Dated vendor architecture announcement; evaluation and availability for customer designs do not establish delivered deployment. No independent bandwidth, power, latency, 100X reach or forecast validation. Prior Marvell index extraction hold stays immutable.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Applied Materials

ASU’s October 9, 2025 account reports that Applied Materials and the university marked the opening of a shared research, development and prototyping center at ASU’s MacroTechnology Works in Tempe.

The article describes bringing Applied Materials’ semiconductor-manufacturing equipment into a setting shared by university researchers, industry partners, startups and public institutions.

Its explanation of the center links materials synthesis, testing and prototyping under one roof with the intended transition from early discoveries to manufacturable technologies.

Sources and details

Applied Materials, ASU celebrate opening of Materials-to-Fab Center to fuel microchip innovation | ASU News

{
  "access_scope": "ASU-attributed opening and facility description, distinct from promised future acceleration or demonstrated manufacturing outcomes. Not a Kinex/Xtera/PROVision product account or individual inventor attribution; earlier inaccessible corporate releases remain held.",
  "authors": [
    "Kelly deVos",
    "Jay Thorne"
  ],
  "authors_in_source_order": [
    "Kelly deVos",
    "Jay Thorne"
  ],
  "dates": {
    "opening_event": "2025-10-09",
    "publication": "2025-10-09",
    "retrieved_utc": "2026-10-08T09:17:39.453749+00:00"
  },
  "id": "supply-org-017::S1",
  "title": "Applied Materials, ASU celebrate opening of Materials-to-Fab Center to fuel microchip innovation | ASU News",
  "url": "https://news.asu.edu/20251009-science-and-technology-applied-materials-asu-celebrate-opening-materialstofab-center-fuel"
}

ASU-attributed opening and facility description, distinct from promised future acceleration or demonstrated manufacturing outcomes. Not a Kinex/Xtera/PROVision product account or individual inventor attribution; earlier inaccessible corporate releases remain held.

ASU-attributed opening and facility description, distinct from promised future acceleration or demonstrated manufacturing outcomes. Not a Kinex/Xtera/PROVision product account or individual inventor attribution; earlier inaccessible corporate releases remain held.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

UMC

Intel’s January 25, 2024 announcement describes an agreement with UMC to develop a 12-nanometer process platform for mobile, communications-infrastructure and networking markets.

The planned collaboration combines Intel’s U.S. manufacturing capacity and FinFET design experience with UMC’s mature-node foundry experience, process design kits and customer design assistance.

The release names Intel’s Arizona Fabs 12, 22 and 32 for development and manufacturing and states that production was expected to begin in 2027.

Sources and details

Intel and UMC Announce New Foundry Collaboration

{
  "access_scope": "2024 agreement and forward-looking development/production plan; archive path 2025 does not change visible publication date. Not evidence that production began, promised benefits occurred or UMC independently manufactured at Intel sites. Original website 403 remains held.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "archive_path_year": "2025",
    "expected_production_year": "2027",
    "publication": "2024-01-25",
    "retrieved_utc": "2026-10-08T09:17:38.271303+00:00"
  },
  "id": "supply-org-015::S1",
  "title": "Intel and UMC Announce New Foundry Collaboration",
  "url": "https://download.intel.com/newsroom/archive/2025/en-us-2024-01-25-intel-and-umc-announce-new-foundry-collaboration.pdf"
}

2024 agreement and forward-looking development/production plan; archive path 2025 does not change visible publication date. Not evidence that production began, promised benefits occurred or UMC independently manufactured at Intel sites. Original website 403 remains held.

2024 agreement and forward-looking development/production plan; archive path 2025 does not change visible publication date. Not evidence that production began, promised benefits occurred or UMC independently manufactured at Intel sites. Original website 403 remains held.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{
  "date_events": []
}

Sturgeon’s Law

In his March 1958 Venture column, Theodore Sturgeon repeats his Revelation that ninety percent of everything is crud in response to critics who judge science fiction by its worst examples.

His two corollaries concede the abundance of weak science fiction while arguing that weak work exists elsewhere and that the best science fiction can equal the best fiction in any field.

To challenge that dismissal, he solicits nominations for a proposed anthology of enduring science-fiction stories, specifying literary criteria such as strength, style, cadence, form and idea.

Sources and details

On Hand: A Book — Venture Science Fiction, volume 2, number 2, March 1958, pp.66–69

{
  "access_scope": "Theodore Sturgeon, On Hand: A Book, Venture Science Fiction, March 1958, volume 2 number 2, printed pages 66–69 (PDF67–70). This is an original critical argument and anthology proposal, not an empirical universal quality percentage, evidence of the first oral coinage or confirmation that the proposed anthology was published. The September 1957 column is a separately inspected earlier formulation; its wording and context are not merged into this March source.",
  "authors": [
    "Theodore Sturgeon"
  ],
  "authors_in_source_order": [
    "Theodore Sturgeon"
  ],
  "dates": {
    "inspected_source_date_1": "Issue: March 1958",
    "retrieved_utc": "2026-10-08T09:16:37.669087+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Issue: March 1958"
  ],
  "id": "concept-law-sturgeon::S1",
  "title": "On Hand: A Book — Venture Science Fiction, volume 2, number 2, March 1958, pp.66–69",
  "url": "https://archive.org/download/Venture_v02n02_1958-03_Gorgon776/Venture_v02n02_1958-03_Gorgon776.pdf"
}

Theodore Sturgeon, On Hand: A Book, Venture Science Fiction, March 1958, volume 2 number 2, printed pages 66–69 (PDF67–70). This is an original critical argument and anthology proposal, not an empirical universal quality percentage, evidence of the first oral coinage or confirmation that the proposed anthology was published. The September 1957 column is a separately inspected earlier formulation; its wording and context are not merged into this March source.

Theodore Sturgeon, On Hand: A Book, Venture Science Fiction, March 1958, volume 2 number 2, printed pages 66–69 (PDF67–70). This is an original critical argument and anthology proposal, not an empirical universal quality percentage, evidence of the first oral coinage or confirmation that the proposed anthology was published. The September 1957 column is a separately inspected earlier formulation; its wording and context are not merged into this March source.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

David Gale

David Gale’s 1960 book The Theory of Linear Economic Models brought linear-optimization ideas developed with Harold W. Kuhn and Albert W. Tucker to a wider audience.

With Lloyd S. Shapley, he proved the existence of a stable pairing for equally sized groups ranking one another and supplied an algorithm to find one.

He later turned his interest in hands-on mathematical exhibits into MathSite, an interactive mathematics website launched in 2003.

Sources and details

In Memoriam: David Gale

{
  "access_scope": "Institutional memorial, not original mathematical proof. Preserve joint work and the equal-group preference formulation; MathSite is an educational project, not AI performance evidence.",
  "authors": [
    "Ilan Adler",
    "Jacob Feldman",
    "Joel Sobe"
  ],
  "authors_in_source_order": [
    "Ilan Adler",
    "Jacob Feldman",
    "Joel Sobe"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:22:19.926011+00:00"
  },
  "id": "person-coverage-667796a12afd0a::S1",
  "title": "In Memoriam: David Gale",
  "url": "https://senate.universityofcalifornia.edu/_files/inmemoriam/html/davidgale.html"
}

Institutional memorial, not original mathematical proof. Preserve joint work and the equal-group preference formulation; MathSite is an educational project, not AI performance evidence.

Institutional memorial, not original mathematical proof. Preserve joint work and the equal-group preference formulation; MathSite is an educational project, not AI performance evidence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald Broadbent

Donald Broadbent’s 1958 account of cognition treated attention as a limited-capacity information channel preceded by a selection filter and temporary storage.

His experimental work investigated noise, environmental stress and the perception of speech, linking an attention theory to practical performance problems.

When dichotic-listening results challenged an entirely peripheral filter, he revised the model in Decision and Stress to include more flexible selection mechanisms.

Sources and details

Donald E. Broadbent (1926–1993)

{
  "access_scope": "Craik and Baddeley’s 1995 American Psychologist memorial, volume 50(4), pages 302–303. Literal Donald Broadbent occurs in the body despite fuller heading. A theoretical model revised in light of experiments; no modern AI/computational validation inference.",
  "authors": [
    "Fergus Craik",
    "Alan Baddeley"
  ],
  "authors_in_source_order": [
    "Fergus Craik",
    "Alan Baddeley"
  ],
  "dates": {
    "publication": "1995-04",
    "retrieved_utc": "2026-10-08T09:22:24.276428+00:00"
  },
  "id": "person-donaldbroadbent::S1",
  "title": "Donald E. Broadbent (1926–1993)",
  "url": "https://www.rotman-baycrest.on.ca/files/publicationmodule/%40random45f5724eba2f8/2319616935135900138.pdf"
}

Craik and Baddeley’s 1995 American Psychologist memorial, volume 50(4), pages 302–303. Literal Donald Broadbent occurs in the body despite fuller heading. A theoretical model revised in light of experiments; no modern AI/computational validation inference.

Craik and Baddeley’s 1995 American Psychologist memorial, volume 50(4), pages 302–303. Literal Donald Broadbent occurs in the body despite fuller heading. A theoretical model revised in light of experiments; no modern AI/computational validation inference.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

George Stone

In the Max Headroom oral history, George Stone recalled devising a list of possible show titles from which Max Headroom was chosen.

He said Rocky Morton’s suggestion of a computer-generated man prompted his development of the fictional Network 23 setting and Blipverts narrative.

Stone described the proposed character as a human consciousness shaped by simultaneous television channels, framing Max as a fusion of television personalities.

Sources and details

Live and Direct: The Definitive Oral History of 1980s Digital Icon Max Headroom

{
  "access_scope": "Archival PDF of Bryan Bishop’s Verge oral history; selected speaker blocks on PDF pages 3 and 5. First-person retrospective attribution, collaborative origin with Morton preserved. Fictional computerized consciousness, not functioning AI or a real brain upload. Publication date not confirmed by selected PDF pages.",
  "authors": [
    "Bryan Bishop"
  ],
  "authors_in_source_order": [
    "Bryan Bishop"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:22:15.840668+00:00"
  },
  "id": "person-coverage-846153265831c1::S1",
  "title": "Live and Direct: The Definitive Oral History of 1980s Digital Icon Max Headroom",
  "url": "https://media.network47.org/Max%20Headroom/Images/Misc/Max%20Headroom_%20the%20definitive%20history%20of%20the%201980s%20digital%20icon%20_%20The%20Verge.pdf"
}

Archival PDF of Bryan Bishop’s Verge oral history; selected speaker blocks on PDF pages 3 and 5. First-person retrospective attribution, collaborative origin with Morton preserved. Fictional computerized consciousness, not functioning AI or a real brain upload. Publication date not confirmed by selected PDF pages.

Archival PDF of Bryan Bishop’s Verge oral history; selected speaker blocks on PDF pages 3 and 5. First-person retrospective attribution, collaborative origin with Morton preserved. Fictional computerized consciousness, not functioning AI or a real brain upload. Publication date not confirmed by selected PDF pages.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

James P. Womack

James P. Womack founded the Lean Enterprise Institute to help companies create value and eliminate waste through training, publishing and research.

In its Forward to Fundamentals webinar, the presenters warned that an economic crisis can distract companies from long-term aims and encourage damaging short-term measures.

The introduction asked John Shook to revisit lean’s origins in the 1950 crisis as a way to examine returning to fundamentals under difficult economic conditions.

Sources and details

Forward to Fundamentals

{
  "access_scope": "Original LEI slide deck with James P. Womack and John Shook presenter biographies; joint-presentation warnings are not allocated exclusively to Womack. No inference that the complete subsequent Toyota history was Womack’s individual contribution. Source publication date absent; upload URL date not used as publication date.",
  "authors": [
    "James P. Womack",
    "John Shook"
  ],
  "authors_in_source_order": [
    "James P. Womack",
    "John Shook"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:22:22.705421+00:00"
  },
  "id": "person-coverage-006f1ba6612d3e::S1",
  "title": "Forward to Fundamentals",
  "url": "https://www.lean.org/wp-content/uploads/2021/06/ForwardToFundamentals_slides-1.pdf"
}

Original LEI slide deck with James P. Womack and John Shook presenter biographies; joint-presentation warnings are not allocated exclusively to Womack. No inference that the complete subsequent Toyota history was Womack’s individual contribution. Source publication date absent; upload URL date not used as publication date.

Original LEI slide deck with James P. Womack and John Shook presenter biographies; joint-presentation warnings are not allocated exclusively to Womack. No inference that the complete subsequent Toyota history was Womack’s individual contribution. Source publication date absent; upload URL date not used as publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Kaoru Ishikawa

Kaoru Ishikawa argued that quality activities should involve every department rather than remain confined to a specialist quality unit.

JUSE credits him with developing the cause-and-effect diagram and promoting statistical tools, including systematic use of control charts.

His quality work also emphasized developing people, including university teaching and the spread of quality-control circles in Japan and abroad.

Sources and details

Dr. Ishikawa A to Z

{
  "access_scope": "Undated JUSE institutional commemoration; diagram/tool and quality-circle credit explicitly attributed to JUSE, not an independently proved sole-invention history. Unused chapter-9 PDF remains an inspected alternative, not the selected manifestation.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T09:22:21.504343+00:00"
  },
  "id": "person-kaoruishikawa::S1",
  "title": "Dr. Ishikawa A to Z",
  "url": "https://www.juse.jp/ishikawa/e/atoz/"
}

Undated JUSE institutional commemoration; diagram/tool and quality-circle credit explicitly attributed to JUSE, not an independently proved sole-invention history. Unused chapter-9 PDF remains an inspected alternative, not the selected manifestation.

Undated JUSE institutional commemoration; diagram/tool and quality-circle credit explicitly attributed to JUSE, not an independently proved sole-invention history. Unused chapter-9 PDF remains an inspected alternative, not the selected manifestation.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Lana Wachowski

Lana Wachowski developed The Matrix Resurrections screenplay with David Mitchell and Aleksander Hemon, using index cards to organize scenes and dialogue during their workshops.

Mitchell recalled that the writers deliberately used aging and memory as narrative elements rather than ignore the years separating the film from the earlier trilogy.

He also credited Wachowski with choosing the earlier-film clips used as flashbacks during editing, distinguishing that decision from the group’s initial screenplay discussions.

Sources and details

The Matrix Resurrections Co-Writer David Mitchell On Conjuring a Meta Mind-Blower With Lana Wachowski

{
  "access_scope": "Hugh Hart’s 22 December 2021 MPA interview with David Mitchell; interviewee recollection and specific 2021 film scope. Joint writing preserved; editor clip-selection credit is explicit, not inferred from director title. WordPress author account babrams is separately retained as raw metadata, not substituted for visible byline.",
  "authors": [
    "Hugh Hart"
  ],
  "authors_in_source_order": [
    "Hugh Hart"
  ],
  "dates": {
    "publication": "2021-12-22",
    "retrieved_utc": "2026-10-08T09:22:24.159961+00:00"
  },
  "id": "person-coverage-631b1711e6c45d::S1",
  "title": "The Matrix Resurrections Co-Writer David Mitchell On Conjuring a Meta Mind-Blower With Lana Wachowski",
  "url": "https://www.motionpictures.org/2021/12/the-matrix-resurrections-co-writer-david-mitchell-on-conjuring-a-meta-mind-blower-with-lana-wachowski/"
}

Hugh Hart’s 22 December 2021 MPA interview with David Mitchell; interviewee recollection and specific 2021 film scope. Joint writing preserved; editor clip-selection credit is explicit, not inferred from director title. WordPress author account babrams is separately retained as raw metadata, not substituted for visible byline.

Hugh Hart’s 22 December 2021 MPA interview with David Mitchell; interviewee recollection and specific 2021 film scope. Joint writing preserved; editor clip-selection credit is explicit, not inferred from director title. WordPress author account babrams is separately retained as raw metadata, not substituted for visible byline.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Mahiro Maeda

Mahiro Maeda described his Animatrix task as turning the Wachowskis’ story outline into images and expanding ideas that live-action filmmaking could not readily explore.

He said he worked with key animators and designers after storyboarding, drawing or approving designs and making changes as the animation developed.

He identified storyboards, art direction and character design as the main areas of practical collaboration with the writers, while seeking to maintain that dialogue through animation.

Sources and details

Interview with Mahiro Maeda: Director of The Second Renaissance, Parts 1 & 2

{
  "access_scope": "MatrixFans repost of an interview labeled from the official Matrix website, interview by REDPILL, translated by Mike Arias, original November 2000; HTML repost date 27 August 2012. URL’s 2003 marker is not original interview date. Historical source credits Larry and Andy preserved without silent identity expansion. Self-reported production tasks, not AI capability or independent proof of artistic influence.",
  "authors": [
    "REDPILL"
  ],
  "authors_in_source_order": [
    "REDPILL"
  ],
  "dates": {
    "original_interview": "2000-11",
    "repost": "2012-08-27",
    "retrieved_utc": "2026-10-08T09:22:23.704699+00:00"
  },
  "id": "person-coverage-9d86f6a1da6cd7::S1",
  "title": "Interview with Mahiro Maeda: Director of The Second Renaissance, Parts 1 & 2",
  "url": "https://www.matrixfans.net/interview-with-mahiro-maeda-director-the-second-renaissance-parts-1-2-from-the-animatrix-2003/"
}

MatrixFans repost of an interview labeled from the official Matrix website, interview by REDPILL, translated by Mike Arias, original November 2000; HTML repost date 27 August 2012. URL’s 2003 marker is not original interview date. Historical source credits Larry and Andy preserved without silent identity expansion. Self-reported production tasks, not AI capability or independent proof of artistic influence.

MatrixFans repost of an interview labeled from the official Matrix website, interview by REDPILL, translated by Mike Arias, original November 2000; HTML repost date 27 August 2012. URL’s 2003 marker is not original interview date. Historical source credits Larry and Andy preserved without silent identity expansion. Self-reported production tasks, not AI capability or independent proof of artistic influence.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Nathan Rosenberg

Nathan Rosenberg is listed as a co-principal investigator on the KNEXUS steering committee, a transdisciplinary effort studying networks, exchanges and uses of knowledge.

The program sought to understand how knowledge networks contribute to economic growth and change, bringing scholars together with practitioners.

Its research agenda also called for methods to analyze organizational learning, knowledge transfer and institutions, with findings intended to inform policy and decision-making.

Sources and details

Kozmetsky Global Collaboratory: Research

{
  "access_scope": "Undated archived Stanford program page, KNEXUS marked active 1997–2000. All research aims are program-level joint scope; no individual method design, experimental task or sole achievement inferred from Rosenberg’s co-PI role. Page copyright 2013 does not establish publication date.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "project_active_period": "1997–2000",
    "retrieved_utc": "2026-10-08T09:22:13.763071+00:00"
  },
  "id": "person-nathanrosenberg::S1",
  "title": "Kozmetsky Global Collaboratory: Research",
  "url": "https://kgc.stanford.edu/research.html"
}

Undated archived Stanford program page, KNEXUS marked active 1997–2000. All research aims are program-level joint scope; no individual method design, experimental task or sole achievement inferred from Rosenberg’s co-PI role. Page copyright 2013 does not establish publication date.

Undated archived Stanford program page, KNEXUS marked active 1997–2000. All research aims are program-level joint scope; no individual method design, experimental task or sole achievement inferred from Rosenberg’s co-PI role. Page copyright 2013 does not establish publication date.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Oryan Zacks

Oryan Zacks co-authored a theoretical account with Eva Jablonka connecting the Global Neuronal Workspace architecture to the Unlimited Associative Learning model of minimal consciousness.

They argued that both models need modification when applied to basal vertebrates rather than being transferred directly from human studies.

Their proposal places the basal-vertebrate workspace in the hippocampal-homolog event-memory system and offers testable predictions.

Sources and details

The evolutionary origins of the Global Neuronal Workspace in vertebrates

{
  "access_scope": "Original Neuroscience of Consciousness 2023(1), niad020, DOI 10.1093/nc/niad020, PMC10499063; ordered coauthors preserved. Joint theoretical proposal, not physical/computational validation, artificial consciousness demonstration or individual research-task allocation.",
  "authors": [
    "Oryan Zacks",
    "Eva Jablonka"
  ],
  "authors_in_source_order": [
    "Oryan Zacks",
    "Eva Jablonka"
  ],
  "dates": {
    "accepted": "2023-08-24",
    "citation_publication_date": "2023 Sep 13",
    "publication": "2023-09-13",
    "received": "2023-05-18",
    "retrieved_utc": "2026-10-08T09:22:17.967844+00:00",
    "revised": "2023-08-01"
  },
  "id": "person-coverage-4043f42ad4e63e::S1",
  "title": "The evolutionary origins of the Global Neuronal Workspace in vertebrates",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC10499063/"
}

Original Neuroscience of Consciousness 2023(1), niad020, DOI 10.1093/nc/niad020, PMC10499063; ordered coauthors preserved. Joint theoretical proposal, not physical/computational validation, artificial consciousness demonstration or individual research-task allocation.

Their proposal places the basal-vertebrate workspace in the hippocampal-homolog event-memory system and offers testable predictions, rather than reporting that hypothesis as experimentally established.

Original Neuroscience of Consciousness 2023(1), niad020, DOI 10.1093/nc/niad020, PMC10499063; ordered coauthors preserved. Joint theoretical proposal, not physical/computational validation, artificial consciousness demonstration or individual research-task allocation.

Their proposal places the basal-vertebrate workspace in the hippocampal-homolog event-memory system and offers testable predictions, rather than reporting that hypothesis as experimentally established.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

E. T. A. Hoffmann

E. T. A. Hoffmann returned to Berlin’s Kammergericht in 1814 and obtained a regularly paid position in its criminal senate in 1816, combining legal work with an artistic career.

In July 1815 he drew the Kunz city plan for his publisher, mixing real and imagined figures with a plan of his Berlin apartment.

The State Library portal places the premiere of his opera Undine in Berlin in August 1816 and describes this period as especially productive for his literary writing.

Sources and details

Berlin — E.T.A. Hoffmann Portal

{
  "access_scope": "Conditional static .avia_textblock extraction from the exact original HTML body; original inspection hold preserved. English paraphrase of German institutional biography, not fictional narrator testimony or a claim of direct technological influence. E. T. A. Hoffmann literal identity occurs in source blocks with punctuation-only variant E.T.A. Hoffmann.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "html_modified_time": "2021-10-12T11:56:51+00:00",
    "retrieved_utc": "2026-10-08T09:22:13.214262+00:00"
  },
  "id": "person-coverage-309de8a7aa48ce::S1",
  "title": "Berlin — E.T.A. Hoffmann Portal",
  "url": "https://etahoffmann.staatsbibliothek-berlin.de/leben-und-werk/orte/berlin/"
}

Conditional static .avia_textblock extraction from the exact original HTML body; original inspection hold preserved. English paraphrase of German institutional biography, not fictional narrator testimony or a claim of direct technological influence. E. T. A. Hoffmann literal identity occurs in source blocks with punctuation-only variant E.T.A. Hoffmann. Root bounded extraction/transcription technically checked against original cached bytes.

Conditional static .avia_textblock extraction from the exact original HTML body; original inspection hold preserved. English paraphrase of German institutional biography, not fictional narrator testimony or a claim of direct technological influence. E. T. A. Hoffmann literal identity occurs in source blocks with punctuation-only variant E.T.A. Hoffmann. Root bounded extraction/transcription technically checked against original cached bytes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Robert Schlaifer

John Pratt recalled Robert Schlaifer developing a required first-year Harvard MBA course with younger colleagues around 1961.

He said the course emphasized decision theory over statistics while teaching inference with proper Beta priors for a Bernoulli process.

Pratt credited Schlaifer with later developing Bayesian decision-analysis software, followed by original data-analysis software and teaching material that was not specifically Bayesian.

Sources and details

A Conversation with John Pratt — Decision Analysis Newsletter

{
  "access_scope": "Conditional manually checked transcription of original scanned PDF page 5, interview heading/author verified on page 4 and combined-issue dates on page 1. Preserve John Pratt’s retrospective attribution, younger collaborators and historical course scope. Original PDF extraction hold retained; no reliance on unverified OCR or allocation inferred from coauthor credit.",
  "authors": [
    "Thomas Eppel"
  ],
  "authors_in_source_order": [
    "Thomas Eppel"
  ],
  "dates": {
    "combined_issue": [
      "1999-12",
      "2000-03"
    ],
    "retrieved_utc": "2026-10-08T09:22:13.214309+00:00"
  },
  "id": "person-robertschlaifer::S1",
  "title": "A Conversation with John Pratt — Decision Analysis Newsletter",
  "url": "https://higherlogicdownload.s3.amazonaws.com/INFORMS/f0ea61b6-e74c-4c07-894d-884bf2882e55/UploadedImages/danlv18n3v19n1.pdf"
}

Conditional manually checked transcription of original scanned PDF page 5, interview heading/author verified on page 4 and combined-issue dates on page 1. Preserve John Pratt’s retrospective attribution, younger collaborators and historical course scope. Original PDF extraction hold retained; no reliance on unverified OCR or allocation inferred from coauthor credit. Root bounded extraction/transcription technically checked against original cached bytes.

Conditional manually checked transcription of original scanned PDF page 5, interview heading/author verified on page 4 and combined-issue dates on page 1. Preserve John Pratt’s retrospective attribution, younger collaborators and historical course scope. Original PDF extraction hold retained; no reliance on unverified OCR or allocation inferred from coauthor credit. Root bounded extraction/transcription technically checked against original cached bytes.

All original rights, access, identity, career, influence and optional-family holds remain.

Dates

{}

Donald B. Rubin

Donald B. Rubin’s 1976 paper distinguishes when a missing-data mechanism can be ignored for different kinds of statistical inference.

For sampling-distribution inference, its abstract requires both missing-at-random and observed-at-random conditions, with inference generally conditional on the observed missingness pattern.

For likelihood or Bayesian inference, it instead requires missing at random and parameters of the missingness process distinct from the data-model parameter.

Sources and details

Inference and Missing Data

{
  "access_scope": "Donald B. Rubin: Harvard DASH metadata-only repository item with original abstract and exact Donald B.Rubin citation; source author-field short Donald Rubin is explicitly bridged by same-page citation. Abstract only, not full paper or universal license to ignore missing data.",
  "authors": [
    "Donald B. Rubin"
  ],
  "authors_in_source_order": [
    "Donald B. Rubin"
  ],
  "dates": {
    "citation_publication_date": "1976",
    "inspected_source_date_1": "1976 Biometrika63(3):581–592",
    "retrieved_utc": "2026-10-08T09:50:23.594891+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1976 Biometrika63(3):581–592"
  ],
  "id": "person-coverage-536d383fbec90c::S1",
  "title": "Inference and Missing Data",
  "url": "https://dash.harvard.edu/entities/publication/73120378-8764-6bd4-e053-0100007fdf3b"
}

Donald B. Rubin: Harvard DASH metadata-only repository item with original abstract and exact Donald B.Rubin citation; source author-field short Donald Rubin is explicitly bridged by same-page citation. Abstract only, not full paper or universal license to ignore missing data.

Donald B. Rubin: Harvard DASH metadata-only repository item with original abstract and exact Donald B.Rubin citation; source author-field short Donald Rubin is explicitly bridged by same-page citation. Abstract only, not full paper or universal license to ignore missing data.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Nan Liu

Nan Liu is a coauthor of the seeBias preprint, which presents an R package for assessing model fairness alongside predictive performance.

The joint work evaluates classification and calibration together, addressing gaps left when fairness tools examine classification disparities alone.

Its abstract describes customizable reporting visualizations and demonstrations on public healthcare and criminal-justice datasets; a Python version is described as under development.

Sources and details

seeBias: A Comprehensive Tool for Assessing and Visualizing AI Fairness

{
  "access_scope": "Nan Liu: Authors in source order Yilin Ning,Yian Ma,Mingxuan Liu,Xin Li,Nan Liu; v1 abstract only. Nan Liu coauthor and submitter; no individual programming/analysis tasks inferred, no completed Python release asserted.",
  "authors": [
    "Yilin Ning",
    "Yian Ma",
    "Mingxuan Liu",
    "Xin Li",
    "Nan Liu"
  ],
  "authors_in_source_order": [
    "Yilin Ning",
    "Yian Ma",
    "Mingxuan Liu",
    "Xin Li",
    "Nan Liu"
  ],
  "dates": {
    "citation_date": "2025/04/11",
    "inspected_revision": "Fri, 11 Apr 2025 10:23:10 UTC (630 KB)",
    "inspected_source_date_1": "arXiv2504.08418v1 submitted11April2025",
    "retrieved_utc": "2026-10-08T09:50:23.240396+00:00",
    "version": "arXiv v1"
  },
  "dates_exact_in_source_role_order": [
    "arXiv2504.08418v1 submitted11April2025"
  ],
  "id": "person-coverage-601e03ab93f921::S1",
  "title": "seeBias: A Comprehensive Tool for Assessing and Visualizing AI Fairness",
  "url": "https://arxiv.org/abs/2504.08418",
  "version_url": "https://arxiv.org/abs/2504.08418v1"
}

Nan Liu: Authors in source order Yilin Ning,Yian Ma,Mingxuan Liu,Xin Li,Nan Liu; v1 abstract only. Nan Liu coauthor and submitter; no individual programming/analysis tasks inferred, no completed Python release asserted.

Nan Liu: Authors in source order Yilin Ning,Yian Ma,Mingxuan Liu,Xin Li,Nan Liu; v1 abstract only. Nan Liu coauthor and submitter; no individual programming/analysis tasks inferred, no completed Python release asserted.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Frederick Chan

Frederick Chan is credited as author of Rosetta’s ProteinMPNNMover, which designs amino-acid identities with ProteinMPNN and threads the predicted sequence onto a protein pose.

The documented interface separates designable residue positions from the coordinates supplied to the model and permits specified amino acids to be excluded.

It also supports tied residue positions and deterministic sampling controls, while requiring Rosetta to have been compiled with PyTorch support.

Sources and details

ProteinMPNNMover autogenerated tag syntax documentation

{
  "access_scope": "Frederick Chan: Explicit software-author credit Frederick Chan, UW address matching protein-design context, not health-psychology namesake. Software documentation claims only; not sole authorship of ProteinMPNN research paper, experimental audit, or an executed software test.",
  "authors": [
    "Frederick Chan"
  ],
  "authors_in_source_order": [
    "Frederick Chan"
  ],
  "dates": {
    "inspected_source_date_1": "Undated latest documentation; pinned retrieved2026-10-08",
    "retrieved_utc": "2026-10-08T09:50:23.612773+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated latest documentation; pinned retrieved2026-10-08"
  ],
  "id": "person-coverage-7422cb66ba5fc1::S1",
  "title": "ProteinMPNNMover autogenerated tag syntax documentation",
  "url": "https://docs.rosettacommons.org/docs/latest/scripting_documentation/RosettaScripts/xsd/mover_ProteinMPNNMover_type"
}

Frederick Chan: Explicit software-author credit Frederick Chan, UW address matching protein-design context, not health-psychology namesake. Software documentation claims only; not sole authorship of ProteinMPNN research paper, experimental audit, or an executed software test.

Frederick Chan: Explicit software-author credit Frederick Chan, UW address matching protein-design context, not health-psychology namesake. Software documentation claims only; not sole authorship of ProteinMPNN research paper, experimental audit, or an executed software test.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Thomas Hobbes

Thomas Hobbes opens Leviathan by comparing bodily motion with springs, strings, and wheels, asking how human art can imitate living systems.

He extends the analogy to the commonwealth as an artificial person built for human protection, with sovereignty giving it motion and laws functioning as reason and will.

His introduction links this political body to the covenants that unite its parts, setting up an inquiry into sovereign authority and the conditions that preserve or dissolve it.

Sources and details

Leviathan

{
  "access_scope": "Thomas Hobbes: Thomas Hobbes literal source author. Selected introduction in university e-text;1651original distinct from1999HTML transcription/presentation via Adelaide ERIS. Historical mechanical analogy, not a modern AI technical claim; no full-work audit.",
  "authors": [
    "Thomas Hobbes"
  ],
  "authors_in_source_order": [
    "Thomas Hobbes"
  ],
  "dates": {
    "inspected_source_date_1": "Original1651work; University of Oregon1999Renascence Editions e-text via Adelaide/ERIS",
    "retrieved_utc": "2026-10-08T09:50:24.243966+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original1651work; University of Oregon1999Renascence Editions e-text via Adelaide/ERIS"
  ],
  "id": "person-coverage-7b09cc53f410fd::S1",
  "title": "Leviathan",
  "url": "https://pages.uoregon.edu/rbear/hobbes/leviathan.html"
}

Thomas Hobbes: Thomas Hobbes literal source author. Selected introduction in university e-text;1651original distinct from1999HTML transcription/presentation via Adelaide ERIS. Historical mechanical analogy, not a modern AI technical claim; no full-work audit.

Thomas Hobbes: Thomas Hobbes literal source author. Selected introduction in university e-text;1651original distinct from1999HTML transcription/presentation via Adelaide ERIS. Historical mechanical analogy, not a modern AI technical claim; no full-work audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Kurt Vonnegut

Kurt Vonnegut’s Player Piano opens in Ilium, a city divided between managers and professionals, industrial machines, and the larger population across the river.

The excerpt connects that separation to wartime production that learned to operate with almost no workforce, leaving the automated system in place after people returned.

Its central engineer Paul Proteus manages the Ilium Works and inherits expectations of organizational advancement, placing personal unease inside a hierarchy built around technical expertise.

Sources and details

Player Piano

{
  "access_scope": "Kurt Vonnegut: Publisher selected-book page and actual opening excerpt, source author Kurt Vonnegut exact.1999paperback manifestation, not first publication date; fiction claims only, no neighbouring-book claims or complete novel audit.",
  "authors": [
    "Kurt Vonnegut"
  ],
  "authors_in_source_order": [
    "Kurt Vonnegut"
  ],
  "dates": {
    "inspected_source_date_1": "Publisher paperback edition on saleJanuary12,1999;ISBN9780385333788",
    "retrieved_utc": "2026-10-08T09:50:24.932375+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Publisher paperback edition on saleJanuary12,1999;ISBN9780385333788"
  ],
  "id": "person-coverage-6e43a37dc364d9::S1",
  "title": "Player Piano",
  "url": "https://penguinrandomhouselibrary.com/book/?isbn=9780385333788"
}

Kurt Vonnegut: Publisher selected-book page and actual opening excerpt, source author Kurt Vonnegut exact.1999paperback manifestation, not first publication date; fiction claims only, no neighbouring-book claims or complete novel audit.

Kurt Vonnegut: Publisher selected-book page and actual opening excerpt, source author Kurt Vonnegut exact.1999paperback manifestation, not first publication date; fiction claims only, no neighbouring-book claims or complete novel audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Andreas L. Mogensen

Andreas L. Mogensen’s research statement places moral and political philosophy at the center of his work, alongside decision theory and philosophy of mind.

He identifies moral testimony, disagreement, evolutionary challenges to ethical belief, and the demands of beneficence as topics of his previous publications.

The statement also connects his work to healthcare rationing, discrimination, climate-policy discounting, and decisions whose long-term effects remain deeply uncertain.

Sources and details

Andreas L Mogensen

{
  "access_scope": "Andreas L. Mogensen: Original first-person author website; exact Andreas L.Mogensen appears in original staticHTML h3 and title Andreas L Mogensen, though extraction omits name-heading. Topic scope only; no findings invented from paper titles or joint collaborators, no astronaut identity.",
  "authors": [
    "Andreas L. Mogensen"
  ],
  "authors_in_source_order": [
    "Andreas L. Mogensen"
  ],
  "dates": {
    "inspected_source_date_1": "Undated author-site statement; pinned retrieved2026-10-08",
    "retrieved_utc": "2026-10-08T09:50:33.147041+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated author-site statement; pinned retrieved2026-10-08"
  ],
  "id": "person-coverage-05b9d6589295cc::S1",
  "title": "Andreas L Mogensen",
  "url": "https://www.andreasmogensen.com/"
}

Andreas L. Mogensen: Original first-person author website; exact Andreas L.Mogensen appears in original staticHTML h3 and title Andreas L Mogensen, though extraction omits name-heading. Topic scope only; no findings invented from paper titles or joint collaborators, no astronaut identity.

Andreas L. Mogensen: Original first-person author website; exact Andreas L.Mogensen appears in original staticHTML h3 and title Andreas L Mogensen, though extraction omits name-heading. Topic scope only; no findings invented from paper titles or joint collaborators, no astronaut identity.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Josef Rusnak

Josef Rusnak describes designing The Thirteenth Floor around contrasting versions of Los Angeles: a cold contemporary city and a vibrant simulation of 1937.

In his interview comments, he associates the contemporary scenes with still, flat compositions and gives the earlier setting greater depth through lighting and color.

He describes working with cinematographer Wedigo von Schultzendorff on lenses, movement, and a combination of color and black-and-white negatives to control the period look.

Sources and details

Time Traveling in Style

{
  "access_scope": "Josef Rusnak: Original Susan King report with direct statements by selected director Josef Rusnak. Cinematographer Wedigo von Schultzendorff and production designer Kirk M.Petruccelli retain separate roles; joint visual production not solely assigned to director, fictional simulation not real technology.",
  "authors": [
    "Susan King"
  ],
  "authors_in_source_order": [
    "Susan King"
  ],
  "dates": {
    "inspected_source_date_1": "May27,1999",
    "retrieved_utc": "2026-10-08T09:50:33.656601+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May27,1999"
  ],
  "id": "person-coverage-69098c532b7fe5::S1",
  "title": "Time Traveling in Style",
  "url": "https://www.latimes.com/archives/la-xpm-1999-may-27-ca-41350-story.html"
}

Josef Rusnak: Original Susan King report with direct statements by selected director Josef Rusnak. Cinematographer Wedigo von Schultzendorff and production designer Kirk M.Petruccelli retain separate roles; joint visual production not solely assigned to director, fictional simulation not real technology.

Josef Rusnak: Original Susan King report with direct statements by selected director Josef Rusnak. Cinematographer Wedigo von Schultzendorff and production designer Kirk M.Petruccelli retain separate roles; joint visual production not solely assigned to director, fictional simulation not real technology.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Johan P. Olsen

Johan P. Olsen coauthored the garbage-can model of organizational choice, which examines decisions under unclear technology, inconsistent preferences, and shifting participation.

The joint article treats problems, solutions, participants, and opportunities to choose as streams whose timing and interaction can shape what gets decided.

Its computational model explores how organizational structure and available attention alter decision processes, using universities as an illustrative setting.

Sources and details

El bote de basura como modelo de elección organizacional

{
  "access_scope": "Johan P. Olsen: Selected coauthor Johan P.Olsen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Selected translated opening/model prose only, introductory editorial separate, Fortran appendix expressly omitted; no individual task allocation.",
  "authors": [
    "Michael D. Cohen",
    "James G. March",
    "Johan P. Olsen"
  ],
  "authors_in_source_order": [
    "Michael D. Cohen",
    "James G. March",
    "Johan P. Olsen"
  ],
  "dates": {
    "citation_date": "01/2011",
    "inspected_source_date_1": "Spanish translation2011Gestión y Política Pública20(2); English originalMarch1972ASQ17(1):1–25",
    "retrieved_utc": "2026-10-08T09:50:34.007058+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spanish translation2011Gestión y Política Pública20(2); English originalMarch1972ASQ17(1):1–25"
  ],
  "id": "person-coverage-102fabd3a45e9d::S1",
  "title": "El bote de basura como modelo de elección organizacional",
  "url": "https://www.scielo.org.mx/scielo.php?pid=S1405-10792011000200002&script=sci_arttext"
}

Johan P. Olsen: Selected coauthor Johan P.Olsen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Selected translated opening/model prose only, introductory editorial separate, Fortran appendix expressly omitted; no individual task allocation.

Johan P. Olsen: Selected coauthor Johan P.Olsen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Selected translated opening/model prose only, introductory editorial separate, Fortran appendix expressly omitted; no individual task allocation.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Michael D. Cohen

Michael D. Cohen coauthored a model of organized anarchies in which choices need not follow a stable sequence from goals to alternatives to decisions.

The joint article makes attention central: participants have limited time, enter and leave decision settings, and do not attend to every issue continuously.

It formalizes the interaction of problems, solutions, participants, and choice opportunities through computer simulation, distinguishing this descriptive account from prescriptions for ideal management.

Sources and details

El bote de basura como modelo de elección organizacional

{
  "access_scope": "Michael D. Cohen: Selected coauthor Michael D.Cohen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Actual translated theory prose inspected; introductory editorial and omitted Fortran appendix not used; no individual theory/programming task inferred.",
  "authors": [
    "Michael D. Cohen",
    "James G. March",
    "Johan P. Olsen"
  ],
  "authors_in_source_order": [
    "Michael D. Cohen",
    "James G. March",
    "Johan P. Olsen"
  ],
  "dates": {
    "citation_date": "01/2011",
    "inspected_source_date_1": "Spanish translation2011Gestión y Política Pública20(2); English originalMarch1972ASQ17(1):1–25",
    "retrieved_utc": "2026-10-08T09:50:34.007058+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Spanish translation2011Gestión y Política Pública20(2); English originalMarch1972ASQ17(1):1–25"
  ],
  "id": "person-coverage-5acd7f5a926808::S1",
  "title": "El bote de basura como modelo de elección organizacional",
  "url": "https://www.scielo.org.mx/scielo.php?pid=S1405-10792011000200002&script=sci_arttext"
}

Michael D. Cohen: Selected coauthor Michael D.Cohen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Actual translated theory prose inspected; introductory editorial and omitted Fortran appendix not used; no individual theory/programming task inferred.

Michael D. Cohen: Selected coauthor Michael D.Cohen exact literal name; writers ordered Michael D.Cohen,James G.March,Johan P.Olsen.2011Spanish translation by Gerardo Romo Morales,Carlos Quintero Castellanos of1972original. Actual translated theory prose inspected; introductory editorial and omitted Fortran appendix not used; no individual theory/programming task inferred.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Y.J. Mii

Y.J. Mii’s statement on the University of Tokyo–TSMC joint laboratory describes it as a closer partnership built on institution-wide collaboration begun in 2019.

He presents the laboratory as a hub for broad, long-term cooperation aimed at extending knowledge in semiconductors.

His comments pair that research ambition with developing future talent, expressing an expectation for the partnership.

Sources and details

東京大学とTSMC、ジョイントラボを開始

{
  "access_scope": "Y.J. Mii: Selected Y.J.Mii exact PDF role-labelled speaker, TSMCExecutiveVicePresident/coCOO at announcement; no initials expansion. Joint UniversityofTokyo/TSMCrelease in Japanese, no named prose author; TeruoFujii separate speaker. Pages1–2 visually read; source does not visibly print a year/date for release, openingJune12 and collaboration2019 explicit; goals remain intentions.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "Announcement ofJune12laboratory opening; PDF original version undated",
    "retrieved_utc": "2026-10-08T09:50:34.511112+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Announcement ofJune12laboratory opening; PDF original version undated"
  ],
  "id": "person-coverage-5a7534816893af::S1",
  "title": "東京大学とTSMC、ジョイントラボを開始",
  "url": "https://www.u-tokyo.ac.jp/content/400265730.pdf"
}

Y.J. Mii: Selected Y.J.Mii exact PDF role-labelled speaker, TSMCExecutiveVicePresident/coCOO at announcement; no initials expansion. Joint UniversityofTokyo/TSMCrelease in Japanese, no named prose author; TeruoFujii separate speaker. Pages1–2 visually read; source does not visibly print a year/date for release, openingJune12 and collaboration2019 explicit; goals remain intentions.

His comments pair that research ambition with developing future talent, expressing an expectation for the partnership rather than claiming individual inventions or completed laboratory results.

Y.J. Mii: Selected Y.J.Mii exact PDF role-labelled speaker, TSMCExecutiveVicePresident/coCOO at announcement; no initials expansion. Joint UniversityofTokyo/TSMCrelease in Japanese, no named prose author; TeruoFujii separate speaker. Pages1–2 visually read; source does not visibly print a year/date for release, openingJune12 and collaboration2019 explicit; goals remain intentions.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Eaton

In Eaton’s September 8, 2025 Brightlayer essay, Mike Jackson describes power and energy software that captures real-time data for operational insights at data centers, industrial sites and buildings.

He explains that Eaton replaced its segmented suites and basic, advanced and premium tiers with four offerings: Brightlayer Distributed IT, DCIM, Power and EPMS.

The essay also describes bundling software licenses or subscriptions, training and deployment services into a single part number for partners selling the platform.

Sources and details

Embrace a new era of Brightlayer

{
  "access_scope": "Dated Eaton partner-marketing essay about Brightlayer portfolio organization and packaging, attributed to its named writer. Four offerings are the stated September 2025 configuration, not an evergreen product inventory. No independently verified downtime, energy savings, reliability, predictive accuracy, profitability or successful implementation claims; no scope transfer to later Brightlayer Energy or NVIDIA/Tandem releases. Original failed-source holds stay immutable.",
  "authors": [
    "Mike Jackson"
  ],
  "authors_in_source_order": [
    "Mike Jackson"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:53:01.967980+00:00",
    "visible_publication": "2025-09-08"
  },
  "id": "supply-org-039::S1",
  "title": "Embrace a new era of Brightlayer",
  "url": "https://www.poweradvantage.eaton.com/sites/us/blog/Embrace-a-new-era-of-Brightlayer"
}

Dated Eaton partner-marketing essay about Brightlayer portfolio organization and packaging, attributed to its named writer. Four offerings are the stated September 2025 configuration, not an evergreen product inventory. No independently verified downtime, energy savings, reliability, predictive accuracy, profitability or successful implementation claims; no scope transfer to later Brightlayer Energy or NVIDIA/Tandem releases. Original failed-source holds stay immutable.

Dated Eaton partner-marketing essay about Brightlayer portfolio organization and packaging, attributed to its named writer. Four offerings are the stated September 2025 configuration, not an evergreen product inventory. No independently verified downtime, energy savings, reliability, predictive accuracy, profitability or successful implementation claims; no scope transfer to later Brightlayer Energy or NVIDIA/Tandem releases. Original failed-source holds stay immutable.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": []
}

SOMA

Frictional Games’ October 2013 announcement presents SOMA as a survival story set at the PATHOS-2 research facility, where communications have failed and machines are behaving dangerously.

The studio describes an exploration of human consciousness through the relationship between biological minds and circuitry.

Its announced design emphasizes exploration and storytelling without combat or distracting cut-scenes; the stated PC and PlayStation 4 arrival in 2015 was still a plan at the time.

Sources and details

2013-10 Friday 11th, SOMA Officially Announced

{
  "access_scope": "Studio announcement and planned release scope, not a full game audit or confirmation of the later release.",
  "authors": [
    "Thomas"
  ],
  "authors_in_source_order": [
    "Thomas"
  ],
  "dates": {
    "announcement": "2013-10-11",
    "retrieved_utc": "2026-10-08T09:52:17.029313+00:00"
  },
  "id": "work-coverage-b3f67dcdc185c2::S1",
  "title": "2013-10 Friday 11th, SOMA Officially Announced",
  "url": "https://forum.frictionalgames.com/thread-23558.html"
}

Studio announcement and planned release scope, not a full game audit or confirmation of the later release.

Studio announcement and planned release scope, not a full game audit or confirmation of the later release.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Grand Theft Auto V

Rockstar’s September 2013 launch announcement credits Rockstar North with developing Grand Theft Auto V and confirms its availability on PlayStation 3 and Xbox 360.

The game lets players switch among three playable leads within an interwoven story.

Its Southern California setting combines the city of Los Santos with the countryside of Blaine County, giving players room to explore, arrange heists and undertake other activities.

Sources and details

Rockstar Games Announces Grand Theft Auto V Now Available

{
  "access_scope": "Original launch press release, selected PDF pages 1–2. Later ports and online launch outcomes are not asserted.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "launch_announcement": "2013-09-17 08:00 ET",
    "retrieved_utc": "2026-10-08T09:52:17.029473+00:00"
  },
  "id": "work-coverage-2b02f48faa7e1b::S1",
  "title": "Rockstar Games Announces Grand Theft Auto V Now Available",
  "url": "https://ir.take2games.com/static-files/dd93d264-3d54-404a-ab30-bc6c0fa07ed2"
}

Original launch press release, selected PDF pages 1–2. Later ports and online launch outcomes are not asserted.

Original launch press release, selected PDF pages 1–2. Later ports and online launch outcomes are not asserted.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2013
}

Atlas of AI: Power, Politics, and the Planetary Costs of Artificial Intelligence

Kate Crawford’s book examines artificial intelligence through the mines, factories and large data collections that make its systems possible.

Her account connects those infrastructures to environmental damage, inequality and shifts toward undemocratic governance.

The author’s synopsis argues that apparent technical neutrality can conceal systems built to strengthen existing power and the interests of a small group.

Sources and details

Atlas of AI: Power, Politics, and the Planetary Costs of Artificial Intelligence

{
  "access_scope": "Author-hosted synopsis; quoted external reviews are excluded. The page’s 2021 best-book reference is not used as publication metadata; no full book audit.",
  "authors": [
    "Kate Crawford"
  ],
  "authors_in_source_order": [
    "Kate Crawford"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:52:17.029497+00:00"
  },
  "id": "work-coverage-db803fb084d9f8::S1",
  "title": "Atlas of AI: Power, Politics, and the Planetary Costs of Artificial Intelligence",
  "url": "https://katecrawford.net/atlas"
}

Author-hosted synopsis; quoted external reviews are excluded. The page’s 2021 best-book reference is not used as publication metadata; no full book audit.

Author-hosted synopsis; quoted external reviews are excluded. The page’s 2021 best-book reference is not used as publication metadata; no full book audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "2021"
}

Civilization series

In his 2021 retrospective, Sid Meier explains Civilization’s pull as the overlap of short, medium and long-term goals that keep a player anticipating the next turn.

Settling a city, choosing its research and managing production connect local decisions to the larger aim of building a lasting civilization.

His account emphasizes several ways to shape that civilization, including peaceful development and cultural or religious influence as well as military power.

Sources and details

Celebrating 30 Years of Civilization with YOU The Great!

{
  "access_scope": "Creator retrospective about the series. The separately inspected Civilization IV manual remains a distinct manifestation and is not cited to these retrospective sentences.",
  "authors": [
    "Sid Meier"
  ],
  "authors_in_source_order": [
    "Sid Meier"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:52:17.529922+00:00",
    "retrospective": "2021-10-01"
  },
  "id": "work-coverage-eaea9da037f6e8::S1",
  "title": "Celebrating 30 Years of Civilization with YOU The Great!",
  "url": "https://newsroom-anz.2k.com/news/celebrating-30-years-of-civilization-with-you-the-great"
}

Creator retrospective about the series. The separately inspected Civilization IV manual remains a distinct manifestation and is not cited to these retrospective sentences.

Creator retrospective about the series. The separately inspected Civilization IV manual remains a distinct manifestation and is not cited to these retrospective sentences.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1991
}

Rendezvous with Rama

The publisher’s synopsis sends astronauts into Rama, a huge cylindrical alien craft moving through the solar system toward the sun.

Inside they encounter a cylindrical sea, inaccessible buildings and machine-animal hybrids called biots, evidence of a technology beyond their own.

The explorers find no alien inhabitants, leaving the identity and whereabouts of the craft’s makers unresolved.

Sources and details

Cita con Rama (Edición ilustrada) / Rendezvous with Rama. Illustrated Edition

{
  "access_scope": "Synopsis of the distinct Spanish illustrated hardcover ISBN 9788419260048, with an English description. No original publication date is inferred from the inconsistent author biography and no full novel audit.",
  "authors": [
    "Arthur C. Clarke"
  ],
  "authors_in_source_order": [
    "Arthur C. Clarke"
  ],
  "dates": {
    "inspected_illustrated_hardcover_on_sale": "2023-07-18",
    "retrieved_utc": "2026-10-08T09:52:17.662004+00:00"
  },
  "id": "work-culture-1ce1049af71da5::S1",
  "title": "Cita con Rama (Edición ilustrada) / Rendezvous with Rama. Illustrated Edition",
  "url": "https://penguinrandomhouselibrary.com/book/?isbn=9788419260048"
}

Synopsis of the distinct Spanish illustrated hardcover ISBN 9788419260048, with an English description. No original publication date is inferred from the inconsistent author biography and no full novel audit.

Synopsis of the distinct Spanish illustrated hardcover ISBN 9788419260048, with an English description. No original publication date is inferred from the inconsistent author biography and no full novel audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Primarily first-contact fiction; distinguish autonomous artifacts from a demonstrated conscious AI.",
  "dated": true,
  "year": 1973
}

Black & White

Peter Molyneux’s 2001 postmortem describes Black & White as a god game in which a player’s choices between good and evil can change the world and its appearance.

Its creature learns a personality through experience and imitation of the player, allowing it to act independently rather than follow a fixed sequence.

The village simulation gives inhabitants distinct motivations while a Village Center coordinates their activities, a compromise intended to keep the world responsive.

Sources and details

Postmortem: Lionhead Studios’ Black & White

{
  "access_scope": "Named developer postmortem; design and implementation statements are attributed to this account, not independently benchmarked or expanded into unsupported individual credits.",
  "authors": [
    "Peter Molyneux"
  ],
  "authors_in_source_order": [
    "Peter Molyneux"
  ],
  "dates": {
    "postmortem": "2001-06-13",
    "retrieved_utc": "2026-10-08T09:52:18.902362+00:00"
  },
  "id": "work-coverage-d334499ea1da96::S1",
  "title": "Postmortem: Lionhead Studios’ Black & White",
  "url": "https://www.gamedeveloper.com/design/postmortem-lionhead-studios-i-black-white-i-"
}

Named developer postmortem; design and implementation statements are attributed to this account, not independently benchmarked or expanded into unsupported individual credits.

Named developer postmortem; design and implementation statements are attributed to this account, not independently benchmarked or expanded into unsupported individual credits.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2001
}

Axiomatic

Greg Egan’s Axiomatic collects eighteen stories whose publisher descriptions explore information, identity and the limits of intimacy.

The Hundred Light Year Diary imagines messages arriving from the future without a guarantee that their contents are truthful.

Learning to Be Me questions the location of the self when crystalline minds replace brains, while Closer follows lovers whose exchanges of bodies and minds go too far.

Sources and details

Axiomatic

{
  "access_scope": "Publisher synopsis and selected named-story premises, not a reading of the stories or title story. Paperback ISBN 9780575081741 remains distinct from ebook ISBN 9780575105409.",
  "authors": [
    "Greg Egan"
  ],
  "authors_in_source_order": [
    "Greg Egan"
  ],
  "dates": {
    "inspected_paperback": "2008-04-01",
    "retrieved_utc": "2026-10-08T09:52:19.334149+00:00",
    "separate_ebook": "2010-12-30"
  },
  "id": "work-culture-1104291fc12a28::S1",
  "title": "Axiomatic",
  "url": "https://www.hachette.com.au/greg-egan/axiomatic"
}

Publisher synopsis and selected named-story premises, not a reading of the stories or title story. Paperback ISBN 9780575081741 remains distinct from ebook ISBN 9780575105409.

Publisher synopsis and selected named-story premises, not a reading of the stories or title story. Paperback ISBN 9780575081741 remains distinct from ebook ISBN 9780575105409.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Author explicitly lists Orion/Millennium 1995; do not change to 1994. Title story first appeared November 1990 in Interzone.",
  "dated": true,
  "year": 1995
}

The Sciences of the Artificial

Herbert Simon argues that designed systems can be studied scientifically, drawing connections among economic systems, firms, artificial intelligence, engineering projects and social plans.

The publisher’s synopsis presents a science of design that examines these common features of artificial systems.

Its account of the expanded third edition says new work in cognitive psychology and design extends the book’s thesis that physical symbol systems have the necessary and sufficient means for intelligent action.

Sources and details

The Sciences of the Artificial, reissue of the third edition with a new introduction by John Laird

{
  "access_scope": "Distributor synopsis of the 2019 reissue of the 1996 third edition, ISBN 9780262537537. The original canonical edition is not inspected or merged.",
  "authors": [
    "Herbert A. Simon"
  ],
  "authors_in_source_order": [
    "Herbert A. Simon"
  ],
  "dates": {
    "inspected_reissue": "2019-08-13",
    "retrieved_utc": "2026-10-08T09:52:19.403514+00:00",
    "separate_third_edition": "1996"
  },
  "id": "work-coverage-86fb14b01de0ad::S1",
  "title": "The Sciences of the Artificial, reissue of the third edition with a new introduction by John Laird",
  "url": "https://www.penguinrandomhouse.com/books/663262/the-sciences-of-the-artificial-reissue-of-the-third-edition-with-a-new-introduction-by-john-laird-by-herbert-a-simon-introduction-by-john-e-laird/"
}

Distributor synopsis of the 2019 reissue of the 1996 third edition, ISBN 9780262537537. The original canonical edition is not inspected or merged.

Distributor synopsis of the 2019 reissue of the 1996 third edition, ISBN 9780262537537. The original canonical edition is not inspected or merged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "[]",
  "dated": true,
  "year": "1969 first edition; 1996 third edition"
}

Robot & Frank

Sony’s synopsis follows Frank, a retired cat burglar whose adult children worry that he can no longer live alone.

Instead of moving him to a nursing home, his son buys a humanoid robot programmed to improve Frank’s physical and mental health, despite his objections.

The near-future story uses that unwanted arrangement to explore friendship and family, with Frank Langella leading the listed ensemble cast.

Sources and details

ROBOT AND FRANK

{
  "access_scope": "Official synopsis and listed cast, no full film viewing or unsupported director/writer credit. The 2012 date is a copyright notice, not a precise release date.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_copyright": "2012",
    "retrieved_utc": "2026-10-08T09:52:20.134650+00:00"
  },
  "id": "work-coverage-a267b59e6daf98::S1",
  "title": "ROBOT AND FRANK",
  "url": "https://www.sonypictures.com/movies/robotandfrank"
}

Official synopsis and listed cast, no full film viewing or unsupported director/writer credit. The 2012 date is a copyright notice, not a precise release date.

Official synopsis and listed cast, no full film viewing or unsupported director/writer credit. The 2012 date is a copyright notice, not a precise release date.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "AFI verifies 2012 release and Jake Schreier; New York opening 17 August 2012. BFI's older festival page has a 2011 production field but its filmography lists 2012.",
  "dated": true,
  "year": 2012
}

Robot Odyssey

The inspected Tandy manual presents Robot Odyssey as an adventure and robot construction kit in which programmed robots help the player escape the underground city of Robotropolis.

Players wire robots to overcome hazards and open routes, turning digital logic and circuit design into tools for solving the adventure’s problems.

Alongside the adventure, sequential tutorials, a microchip library and an experimental laboratory let players learn circuit concepts and create their own robot games.

Sources and details

Robot Odyssey 1: Tandy manual

{
  "access_scope": "Selected manual introduction for the archived Tandy manifestation; no full software audit, original publication year or cross-platform equivalence asserted. Original inspection hold and formfeed-only extraction remain unchanged; root-viewed selected manual fragments and reproducible page hashes provide bounded evidence.",
  "authors": [
    "Janet Joers",
    "Batya Friedman"
  ],
  "authors_in_source_order": [
    "Janet Joers",
    "Batya Friedman"
  ],
  "dates": {
    "inspected_manual_publication": null,
    "retrieved_utc": "2026-10-08T09:52:17.029096+00:00"
  },
  "id": "work-coverage-60ccd969b8a950::S1",
  "title": "Robot Odyssey 1: Tandy manual",
  "url": "https://colorcomputerarchive.com/coco/Documents/Manuals/Educational/Robot%20Odyssey%20I%20%28The%20Learning%20Company%29.pdf"
}

Selected manual introduction for the archived Tandy manifestation; no full software audit, original publication year or cross-platform equivalence asserted. Original inspection hold and formfeed-only extraction remain unchanged; root-viewed selected manual fragments and reproducible page hashes provide bounded evidence.

Selected manual introduction for the archived Tandy manifestation; no full software audit, original publication year or cross-platform equivalence asserted. Original inspection hold and formfeed-only extraction remain unchanged; root-viewed selected manual fragments and reproducible page hashes provide bounded evidence.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1984
}

The Artifice Girl

In SAGindie’s interview, Franklin Ritch describes The Artifice Girl’s AI premise as a way to explore childhood trauma and autonomy.

He says the story was planned as three acts with large time jumps, beginning with a single-location encounter that lets the audience learn about the predator-hunting program alongside the other characters.

The team completed the first act as a proof of concept to fund the rest, then filmed the next two acts at six-month intervals.

Sources and details

Filmmaker Interview: FRANKLIN RITCH, writer/director/star of THE ARTIFICE GIRL

{
  "access_scope": "Colin McCormack’s SAGindie interview, April 24, 2023, with the film’s credited screenwriter, director, editor and star Franklin Ritch. These are Ritch’s accounts of the fictional premise, narrative structure and production process; they do not establish real AI consciousness, technical feasibility or individual tasks beyond those explicitly described. The original Fantasia source hold remains unchanged.",
  "authors": [
    "Colin McCormack"
  ],
  "authors_in_source_order": [
    "Colin McCormack"
  ],
  "dates": {
    "inspected_source_date_1": "April 24, 2023",
    "retrieved_utc": "2026-10-08T07:48:11.514482+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 24, 2023"
  ],
  "id": "work-culture-4c420e1d45f433::S1",
  "title": "Filmmaker Interview: FRANKLIN RITCH, writer/director/star of THE ARTIFICE GIRL",
  "url": "https://www.sagindie.org/interviews/franklin-ritch-artifice-girl/"
}

Colin McCormack’s SAGindie interview, April 24, 2023, with the film’s credited screenwriter, director, editor and star Franklin Ritch. These are Ritch’s accounts of the fictional premise, narrative structure and production process; they do not establish real AI consciousness, technical feasibility or individual tasks beyond those explicitly described. The original Fantasia source hold remains unchanged.

In SAGindie’s interview, Franklin Ritch describes The Artifice Girl’s AI premise as a way to explore childhood trauma and autonomy, rather than a guarantee of technical accuracy.

Colin McCormack’s SAGindie interview, April 24, 2023, with the film’s credited screenwriter, director, editor and star Franklin Ritch. These are Ritch’s accounts of the fictional premise, narrative structure and production process; they do not establish real AI consciousness, technical feasibility or individual tasks beyond those explicitly described. The original Fantasia source hold remains unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Festival’s own archive lists July 23, 2022 screening; later 2023 distribution does not replace first-public year.",
  "dated": true,
  "year": 2022
}

The Intentional Stance

Penguin Random House’s description presents The Intentional Stance as a strategy for anticipating behavior by interpreting an entity through beliefs, desires and intentions.

That strategy assumes rationality in the entity being interpreted, connecting everyday psychological vocabulary with questions in cognitive science.

The book revisits six earlier essays through accompanying reflections and adds four chapters that extend Dennett’s argument.

Sources and details

The Intentional Stance by Daniel C. Dennett: 9780262540537 | PenguinRandomHouse.com: Books

{
  "access_scope": "The publisher-distributor description for the 1989 Bradford Books paperback, ISBN 9780262540537. It summarizes Dennett’s philosophical strategy and the essay structure; it is not a full book audit, evidence that every entity is rational, or a new first-publication date.",
  "authors": [
    "Daniel C. Dennett"
  ],
  "authors_in_source_order": [
    "Daniel C. Dennett"
  ],
  "dates": {
    "inspected_source_date_1": "March 6, 1989",
    "retrieved_utc": "2026-10-08T09:56:25.919409+00:00"
  },
  "dates_exact_in_source_role_order": [
    "March 6, 1989"
  ],
  "id": "work-culture-3e3145284c5b54::S1",
  "title": "The Intentional Stance by Daniel C. Dennett: 9780262540537 | PenguinRandomHouse.com: Books",
  "url": "https://www.penguinrandomhouse.com/books/654380/the-intentional-stance-by-daniel-c-dennett/9780262540537/"
}

The publisher-distributor description for the 1989 Bradford Books paperback, ISBN 9780262540537. It summarizes Dennett’s philosophical strategy and the essay structure; it is not a full book audit, evidence that every entity is rational, or a new first-publication date.

The publisher-distributor description for the 1989 Bradford Books paperback, ISBN 9780262540537. It summarizes Dennett’s philosophical strategy and the essay structure; it is not a full book audit, evidence that every entity is rational, or a new first-publication date.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "MIT Press hardcover October 16, 1987; paperback 1989.",
  "dated": true,
  "year": 1987
}

The Second Renaissance, Parts I and II

In the reproduced official interview, Mahiro Maeda describes The Second Renaissance as an AI-led account of history presented through the Matrix Archives.

He explains the reversal across its two parts: people initially treat robots as objects, while the machines later make humans the objects of study.

Rather than centering that history on one observer, he chose the archive format and expanded the episodes to give the narration the scale of a myth.

Sources and details

Interview with Mahiro Maeda (Director: The Second Renaissance, Parts 1 & 2) - Part 2 - from The Animatrix (2003) - Matrix Fans

{
  "access_scope": "A Matrix Fans reproduction explicitly attributed to the official Matrix website: interview by REDPILL, translated by Isako Shibata, July 2002; reposted August 29, 2012 under Paul Martin’s metadata byline. Maeda’s accounts concern Parts I and II of The Second Renaissance and their fictional archive narrative. The interview’s original date, the 2003 film date in the page title, and the repost date are distinct; no uncredited tasks or real history of AI are inferred.",
  "authors": [
    "REDPILL"
  ],
  "authors_in_source_order": [
    "REDPILL"
  ],
  "dates": {
    "inspected_source_date_1": "July 2002 (original interview)",
    "inspected_source_date_2": "August 29, 2012 (repost)",
    "retrieved_utc": "2026-10-08T09:56:25.269090+00:00"
  },
  "dates_exact_in_source_role_order": [
    "July 2002 (original interview)",
    "August 29, 2012 (repost)"
  ],
  "id": "work-culture-737e5f7b3ddc17::S1",
  "title": "Interview with Mahiro Maeda (Director: The Second Renaissance, Parts 1 & 2) - Part 2 - from The Animatrix (2003) - Matrix Fans",
  "url": "https://www.matrixfans.net/interview-with-mahiro-maeda-director-the-second-renaissance-parts-1-2-part-2-from-the-animatrix-2003/"
}

A Matrix Fans reproduction explicitly attributed to the official Matrix website: interview by REDPILL, translated by Isako Shibata, July 2002; reposted August 29, 2012 under Paul Martin’s metadata byline. Maeda’s accounts concern Parts I and II of The Second Renaissance and their fictional archive narrative. The interview’s original date, the 2003 film date in the page title, and the repost date are distinct; no uncredited tasks or real history of AI are inferred.

A Matrix Fans reproduction explicitly attributed to the official Matrix website: interview by REDPILL, translated by Isako Shibata, July 2002; reposted August 29, 2012 under Paul Martin’s metadata byline. Maeda’s accounts concern Parts I and II of The Second Renaissance and their fictional archive narrative. The interview’s original date, the 2003 film date in the page title, and the repost date are distinct; no uncredited tasks or real history of AI are inferred.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Both parts are catalogued as 2003. A contemporary report of Warner Home Video's announcement gives Part I's online release as February 4, 2003, Part II in May 2003, and the anthology home-video release as June 3, 2003. These are distinct release events. Archival metadata uses older Wachowski credit names, normalized here to current names.",
  "dated": true,
  "year": 2003
}

Anathem

The authorized opening excerpt of Anathem follows Erasmas as he records Orolo’s questions to an artisan visiting the scholarly community.

Their exchange exposes a gap between the community’s durable terminology and the changing names and formats of media outside its walls.

Orolo explains that his community works with chalk, ink and stone rather than using the moving-image devices familiar to the artisan.

Sources and details

Anathem - Stephenson, Neal: 9780061474095 - AbeBooks

{
  "access_scope": "The explicitly authorized Chapter One excerpt on AbeBooks, credited to Neal Stephenson with 2008 copyright and ISBN 9780061474095. These sentences describe that fictional opening exchange, not an audit of the entire novel. The retailer warns that general synopsis material may concern another edition; that material is not used here.",
  "authors": [
    "Neal Stephenson"
  ],
  "authors_in_source_order": [
    "Neal Stephenson"
  ],
  "dates": {
    "inspected_source_date_1": "2008",
    "retrieved_utc": "2026-10-08T09:56:22.932934+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2008"
  ],
  "id": "work-culture-791e7578ad79c7::S1",
  "title": "Anathem - Stephenson, Neal: 9780061474095 - AbeBooks",
  "url": "https://www.abebooks.com/9780061474095/Anathem-Novel-Stephenson-Neal-0061474096/plp"
}

The explicitly authorized Chapter One excerpt on AbeBooks, credited to Neal Stephenson with 2008 copyright and ISBN 9780061474095. These sentences describe that fictional opening exchange, not an audit of the entire novel. The retailer warns that general synopsis material may concern another edition; that material is not used here.

The explicitly authorized Chapter One excerpt on AbeBooks, credited to Neal Stephenson with 2008 copyright and ISBN 9780061474095. These sentences describe that fictional opening exchange, not an audit of the entire novel. The retailer warns that general synopsis material may concern another edition; that material is not used here.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Not primarily an AI narrative; don't present metaphysical premises as technical results.",
  "dated": true,
  "year": 2008
}

Silent Running

Universal’s synopsis places Silent Running aboard a freighter where botanist Freeman Lowell preserves the last surviving plant specimens from Earth.

When ordered to abandon that preservation project, Lowell takes control of the ship and carries it into Saturn’s rings.

His resulting isolation leaves the cultivated environment and the robots Huey and Dewey as his companions.

Sources and details

Silent Running | Universal Pictures At Home

{
  "access_scope": "Universal Pictures At Home’s synopsis of the 1972 film, directed by Douglas Trumbull. The page’s 1971 copyright notice is separate from its release-year field. This is the studio’s fictional premise, not demonstrated robotic behavior or a cast-to-character assignment.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspected_source_date_1": "1972 (release year)",
    "inspected_source_date_2": "1971 (copyright notice)",
    "retrieved_utc": "2026-10-08T09:56:26.638531+00:00"
  },
  "dates_exact_in_source_role_order": [
    "1972 (release year)",
    "1971 (copyright notice)"
  ],
  "id": "work-culture-79458ccbca22b2::S1",
  "title": "Silent Running | Universal Pictures At Home",
  "url": "https://www.universalpicturesathome.com/movies/silent-running"
}

Universal Pictures At Home’s synopsis of the 1972 film, directed by Douglas Trumbull. The page’s 1971 copyright notice is separate from its release-year field. This is the studio’s fictional premise, not demonstrated robotic behavior or a cast-to-character assignment.

Universal Pictures At Home’s synopsis of the 1972 film, directed by Douglas Trumbull. The page’s 1971 copyright notice is separate from its release-year field. This is the studio’s fictional premise, not demonstrated robotic behavior or a cast-to-character assignment.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1972
}

The Black Cloud

Penguin’s description of The Black Cloud centers on an approaching cloud that blocks sunlight and creates a crisis on Earth.

A group of scientists tries to work out what the cloud is and establish communication with it.

Their effort is complicated by political pressure toward a violent response, placing scientific inquiry beside the danger of escalation.

Sources and details

The Black Cloud

{
  "access_scope": "Penguin’s synopsis for the 2010 paperback, ISBN 9780141196404. These are fictional premises in publisher copy, not scientific observations. The blurb’s “1959 classic” wording is not used to resolve the original publication year, and its promotional technology-forecast claims are not adopted.",
  "authors": [
    "Fred Hoyle"
  ],
  "authors_in_source_order": [
    "Fred Hoyle"
  ],
  "dates": {
    "inspected_source_date_1": "September 2, 2010 (listed Penguin edition)",
    "retrieved_utc": "2026-10-08T09:56:25.437579+00:00"
  },
  "dates_exact_in_source_role_order": [
    "September 2, 2010 (listed Penguin edition)"
  ],
  "id": "work-culture-8421314e0c24b8::S1",
  "title": "The Black Cloud",
  "url": "https://www.penguin.co.uk/books/180376/the-black-cloud-by-hoyle-fred/9780141196404"
}

Penguin’s synopsis for the 2010 paperback, ISBN 9780141196404. These are fictional premises in publisher copy, not scientific observations. The blurb’s “1959 classic” wording is not used to resolve the original publication year, and its promotional technology-forecast claims are not adopted.

Penguin’s synopsis for the 2010 paperback, ISBN 9780141196404. These are fictional premises in publisher copy, not scientific observations. The blurb’s “1959 classic” wording is not used to resolve the original publication year, and its promotional technology-forecast claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Hoyle novel 1957. Turing died 7 June 1954; any claim he examined this published novel is chronologically impossible. No evidence of a prepublication encounter supplied.",
  "dated": true,
  "year": 1957
}

Max Headroom: 20 Minutes into the Future

The oral history describes Max Headroom: 20 Minutes into the Future as a satire of corporate control over television in a near-future society.

Reporter Edison Carter investigates advertising that can kill viewers, turning the network’s pursuit of audience attention into the central threat.

After Carter is injured, the network attempts to preserve its star by copying his mind into a virtual figure, producing Max instead of a straightforward replacement.

Sources and details

Max Headroom: the definitive history of the 1980s digital icon | The Verge

{
  "access_scope": "Bryan Bishop’s April 2, 2015 oral history, limited here to its introduction and accounts of the 1985 TV movie 20 Minutes into the Future. Its later American series, music shows and other franchise material are separate. Mind copying and lethal advertising are fictional narrative devices; the report does not establish their feasibility or infer individual production tasks.",
  "authors": [
    "Bryan Bishop"
  ],
  "authors_in_source_order": [
    "Bryan Bishop"
  ],
  "dates": {
    "inspected_source_date_1": "April 2, 2015",
    "retrieved_utc": "2026-10-08T09:56:26.557829+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 2, 2015"
  ],
  "id": "work-culture-84caa0edd31c29::S1",
  "title": "Max Headroom: the definitive history of the 1980s digital icon | The Verge",
  "url": "https://www.theverge.com/2015/4/2/8285139/max-headroom-oral-history-80s-cyberpunk-interview"
}

Bryan Bishop’s April 2, 2015 oral history, limited here to its introduction and accounts of the 1985 TV movie 20 Minutes into the Future. Its later American series, music shows and other franchise material are separate. Mind copying and lethal advertising are fictional narrative devices; the report does not establish their feasibility or infer individual production tasks.

Bryan Bishop’s April 2, 2015 oral history, limited here to its introduction and accounts of the 1985 TV movie 20 Minutes into the Future. Its later American series, music shows and other franchise material are separate. Mind copying and lethal advertising are fictional narrative devices; the report does not establish their feasibility or infer individual production tasks.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Paley archive records Channel 4 transmission April 4, 1985; distinguish later Max Headroom series.",
  "dated": true,
  "year": 1985
}

Olympos

Hachette’s Olympos synopsis begins with Helen mourning Paris after his death in combat with Apollo.

The siege combines mythic conflict with technological defenses, as attacks from the gods pass through the moravecs’ shield and damage Ilium.

Helen’s preparations for the funeral sit alongside a wider confrontation in which humans, gods and other participants face consequences for their universe.

Sources and details

Olympos by Dan Simmons - Hachette Australia

{
  "access_scope": "Hachette Australia’s work-specific synopsis for Dan Simmons’s Olympos, listing distinct Gollancz paperback and ebook manifestations. These sentences describe its fictional conflict; quantum terminology is not a claim about workable technology. The synopsis is not a complete novel audit or evidence about nearby series volumes.",
  "authors": [
    "Dan Simmons"
  ],
  "authors_in_source_order": [
    "Dan Simmons"
  ],
  "dates": {
    "inspected_source_date_1": "October 1, 2006 (paperback)",
    "inspected_source_date_2": "April 4, 2019 (ebook)",
    "retrieved_utc": "2026-10-08T09:56:23.833689+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 1, 2006 (paperback)",
    "April 4, 2019 (ebook)"
  ],
  "id": "work-culture-aa0b8d120b65a3::S1",
  "title": "Olympos by Dan Simmons - Hachette Australia",
  "url": "https://www.hachette.com.au/dan-simmons/olympos"
}

Hachette Australia’s work-specific synopsis for Dan Simmons’s Olympos, listing distinct Gollancz paperback and ebook manifestations. These sentences describe its fictional conflict; quantum terminology is not a claim about workable technology. The synopsis is not a complete novel audit or evidence about nearby series volumes.

Hachette Australia’s work-specific synopsis for Dan Simmons’s Olympos, listing distinct Gollancz paperback and ebook manifestations. These sentences describe its fictional conflict; quantum terminology is not a claim about workable technology. The synopsis is not a complete novel audit or evidence about nearby series volumes.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Sequel to Ilium; limited-edition date must not replace first trade publication.",
  "dated": true,
  "year": 2005
}

The Garden of Forking Paths

The edition description places The Garden of Forking Paths in wartime England, where Yu Tsun must pass a secret to Germany while being pursued.

His escape brings him to a scholar whose house reconnects him with a puzzle associated with his ancestor.

The account frames this pursuit as both a detective story and an exploration of time unfolding through simultaneous possibilities.

Sources and details

The Garden of Forking Paths

{
  "access_scope": "The named short-story description for Conversation Tree Press’s Short Stops edition, hosted by Subterranean Press. It identifies Borges as the story author and Auladell as illustrator; neither is assumed to have written the product copy. The fictional wartime pursuit and branching-time framing concern the title story, not an audit of the 1941 collection or all of Ficciones; no publication date for this new edition is inferred.",
  "authors": [
    "Jorge Luis Borges"
  ],
  "authors_in_source_order": [
    "Jorge Luis Borges"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:56:22.932953+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-culture-b3d6798913a826::S1",
  "title": "The Garden of Forking Paths",
  "url": "https://subterraneanpress.com/borges-tgofp-ctp/"
}

The named short-story description for Conversation Tree Press’s Short Stops edition, hosted by Subterranean Press. It identifies Borges as the story author and Auladell as illustrator; neither is assumed to have written the product copy. The fictional wartime pursuit and branching-time framing concern the title story, not an audit of the 1941 collection or all of Ficciones; no publication date for this new edition is inferred.

The named short-story description for Conversation Tree Press’s Short Stops edition, hosted by Subterranean Press. It identifies Borges as the story author and Auladell as illustrator; neither is assumed to have written the product copy. The fictional wartime pursuit and branching-time framing concern the title story, not an audit of the 1941 collection or all of Ficciones; no publication date for this new edition is inferred.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Conventionally dated 1941 in El jardín de senderos que se bifurcan. Primary colophon is dated December 30, 1941; the collection was distributed in 1942 and some institutional catalog records use 1942. Both stories are present in its contents. Do not confuse with inclusion in Ficciones (1944) or later English translations.",
  "dated": true,
  "year": 1941
}

Westworld — season 2

In the 2018 creator interview, Jonathan Nolan explains Westworld’s memory puzzle through a contrast between changing human recollections and hosts’ exact recall.

Dolores’s memories were initially presented without clearly separating them from her current experience, shaping what the audience could recognize.

Nolan says the second season builds on that awareness, allowing the story to examine the distinction from a different perspective.

Sources and details

Westworld Creators Jonathan Nolan Lisa Joy Interview - Westworld Creators Jonathan Nolan and Lisa Joy Talk Season 2 and Real-Life Androids

{
  "access_scope": "Adam Grant’s April 23, 2018 Esquire interview with Jonathan Nolan and Lisa Joy. The selected answer explicitly connects the memory device with the second season; Nolan’s explanation is attributed and does not allocate all creative work to him. The fictional host-memory premise is not empirical evidence about machine consciousness.",
  "authors": [
    "Adam Grant"
  ],
  "authors_in_source_order": [
    "Adam Grant"
  ],
  "dates": {
    "inspected_source_date_1": "April 23, 2018",
    "retrieved_utc": "2026-10-08T09:56:23.724881+00:00"
  },
  "dates_exact_in_source_role_order": [
    "April 23, 2018"
  ],
  "id": "work-culture-b5624496ae427a::S1",
  "title": "Westworld Creators Jonathan Nolan Lisa Joy Interview - Westworld Creators Jonathan Nolan and Lisa Joy Talk Season 2 and Real-Life Androids",
  "url": "https://www.esquire.com/entertainment/tv/a19834115/westworld-season-2-interview-jonathan-nolan-lisa-joy/"
}

Adam Grant’s April 23, 2018 Esquire interview with Jonathan Nolan and Lisa Joy. The selected answer explicitly connects the memory device with the second season; Nolan’s explanation is attributed and does not allocate all creative work to him. The fictional host-memory premise is not empirical evidence about machine consciousness.

Adam Grant’s April 23, 2018 Esquire interview with Jonathan Nolan and Lisa Joy. The selected answer explicitly connects the memory device with the second season; Nolan’s explanation is attributed and does not allocate all creative work to him. The fictional host-memory premise is not empirical evidence about machine consciousness.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Season 2 began in 2018; creators are series-level credits, not sole season directors or writers.",
  "dated": true,
  "year": 2018
}

Black Mirror: White Christmas

In the White Christmas round-table, Charlie Brooker connects the episode’s blocking device with the danger of ending communication so completely that relationships cannot be repaired.

He explains the Christmas setting through the tradition of eerie holiday stories rather than a straightforward feel-good special.

Although he recognizes moral conclusions in the episode, he presents its treatment as sympathetic and exploratory rather than a lesson spelled out for viewers.

Sources and details

Black Mirror interview: Charlie Brooker, Jon Hamm, Rafe Spall | Den of Geek

{
  "access_scope": "Louisa Mellor’s December 16, 2014 Den of Geek round-table about Black Mirror: White Christmas. These sentences paraphrase Brooker’s episode-specific discussion; his views are distinct from the interviewer’s introduction and the actors’ comments. Blocking is a fictional device, not a prediction of real technology or a complete episode synopsis.",
  "authors": [
    "Louisa Mellor"
  ],
  "authors_in_source_order": [
    "Louisa Mellor"
  ],
  "dates": {
    "inspected_source_date_1": "December 16, 2014",
    "retrieved_utc": "2026-10-08T09:56:23.670859+00:00"
  },
  "dates_exact_in_source_role_order": [
    "December 16, 2014"
  ],
  "id": "work-culture-c8f05de3cd09ee::S1",
  "title": "Black Mirror interview: Charlie Brooker, Jon Hamm, Rafe Spall | Den of Geek",
  "url": "https://www.denofgeek.com/tv/black-mirror-interview-charlie-brooker-jon-hamm-rafe-spall/"
}

Louisa Mellor’s December 16, 2014 Den of Geek round-table about Black Mirror: White Christmas. These sentences paraphrase Brooker’s episode-specific discussion; his views are distinct from the interviewer’s introduction and the actors’ comments. Blocking is a fictional device, not a prediction of real technology or a complete episode synopsis.

Louisa Mellor’s December 16, 2014 Den of Geek round-table about Black Mirror: White Christmas. These sentences paraphrase Brooker’s episode-specific discussion; his views are distinct from the interviewer’s introduction and the actors’ comments. Blocking is a fictional device, not a prediction of real technology or a complete episode synopsis.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Channel 4's December 4, 2014 announcement schedules the special for December 16 at 9pm. Treat as the 2014 Christmas special rather than assigning an unqualified season number, which varies by distribution.",
  "dated": true,
  "year": 2014
}

The evolutionary origins of the Global Neuronal Workspace in vertebrates

The review compares Global Neuronal Workspace theory with Unlimited Associative Learning as accounts of the cognitive architecture associated with consciousness.

Zacks and Jablonka argue that applying those models to basal vertebrates requires changes that reflect the evolution of vertebrate brains.

They propose a dual memory-and-workspace role for the hippocampal homolog and offer testable predictions.

Sources and details

The evolutionary origins of the Global Neuronal Workspace in vertebrates

{
  "access_scope": "Abstract of the published review in Neuroscience of Consciousness, DOI 10.1093/nc/niad020, from LSE’s repository PDF. The title page credits Oryan Zacks followed by Eva Jablonka; no individual division of labor is inferred. Its comparative architecture and hippocampal proposal are authors’ theoretical arguments and predictions, not proof of consciousness in a species. The wrapper and article disagree on issue number; both are retained as source observations.",
  "authors": [
    "Oryan Zacks",
    "Eva Jablonka"
  ],
  "authors_in_source_order": [
    "Oryan Zacks",
    "Eva Jablonka"
  ],
  "dates": {
    "inspected_source_date_1": "2023",
    "inspected_source_date_2": "Received May 18, 2023",
    "inspected_source_date_3": "Revised August 1, 2023",
    "inspected_source_date_4": "Accepted August 24, 2023",
    "retrieved_utc": "2026-10-08T09:56:22.932749+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2023",
    "Received May 18, 2023",
    "Revised August 1, 2023",
    "Accepted August 24, 2023"
  ],
  "id": "work-focused-33ccb76b28ff3e::S1",
  "title": "The evolutionary origins of the Global Neuronal Workspace in vertebrates",
  "url": "https://eprints.lse.ac.uk/123626/1/Zacks_Jablonka_The-evolutionary-origins-of-the-Global-Neuronal-Workspace-in-vertebrates--published.pdf"
}

Abstract of the published review in Neuroscience of Consciousness, DOI 10.1093/nc/niad020, from LSE’s repository PDF. The title page credits Oryan Zacks followed by Eva Jablonka; no individual division of labor is inferred. Its comparative architecture and hippocampal proposal are authors’ theoretical arguments and predictions, not proof of consciousness in a species. The wrapper and article disagree on issue number; both are retained as source observations.

They propose a dual memory-and-workspace role for the hippocampal homolog, presenting it as a testable account rather than an established demonstration of animal experience.

Abstract of the published review in Neuroscience of Consciousness, DOI 10.1093/nc/niad020, from LSE’s repository PDF. The title page credits Oryan Zacks followed by Eva Jablonka; no individual division of labor is inferred. Its comparative architecture and hippocampal proposal are authors’ theoretical arguments and predictions, not proof of consciousness in a species. The wrapper and article disagree on issue number; both are retained as source observations.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [
    {
      "date": "2023-09-13",
      "kind": "published",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-09-13"
}

Robert Taylor

UT Austin’s 2013 account identifies Robert Taylor as a Pioneer inductee of the Internet Hall of Fame for his part in the early development of the Internet.

Taylor worked alongside Ethernet co-inventor Bob Metcalfe at Xerox PARC from 1972 to 1975.

He received the National Medal of Technology in 1999 and became a Computer History Museum fellow in 2013.

Sources and details

Internet Hall of Fame Honors UT Austin Professor Bob Metcalfe and Alum Robert Taylor

{
  "access_scope": "Institutional historical account; joint PARC presence does not allocate Ethernet design to Taylor. Conflicting degree year and imprecise ARPA-director wording are excluded.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "2013-08-02",
    "retrieved_utc": "2026-10-08T09:54:58.140938+00:00"
  },
  "id": "person-roberttaylor::S1",
  "title": "Internet Hall of Fame Honors UT Austin Professor Bob Metcalfe and Alum Robert Taylor",
  "url": "https://cockrell.utexas.edu/news/internet-hall-of-fame-honors-ut-austin-professor-bob-metcalfe-and-alum-robert-taylor/"
}

Institutional historical account; joint PARC presence does not allocate Ethernet design to Taylor. Conflicting degree year and imprecise ARPA-director wording are excluded.

Institutional historical account; joint PARC presence does not allocate Ethernet design to Taylor. Conflicting degree year and imprecise ARPA-director wording are excluded.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Mohamed Atalla

Mohamed Atalla trained in mechanical engineering at Purdue after earning his bachelor’s degree at Cairo University.

The CSET report credits Atalla and Dawon Kahng jointly with the 1959 Bell Labs MOSFET, combining silicon, a thermal oxide layer and a metal gate.

Their silicon-based transistor became a basis for the businesses established by researchers leaving Fairchild Semiconductor.

Sources and details

The Chipmakers: U.S. Strengths and Priorities for the High-End Semiconductor Workforce

{
  "access_scope": "Historical synthesis in a 2020 workforce issue brief, not an original 1959 experimental paper. Explicit same-paragraph Mohamed M. Atalla/Mohamed Atalla bridge; preserve Kahng joint credit, without individual fabrication-task allocation.",
  "authors": [
    "Will Hunt",
    "Remco Zwetsloot"
  ],
  "authors_in_source_order": [
    "Will Hunt",
    "Remco Zwetsloot"
  ],
  "dates": {
    "published": "2020-09",
    "retrieved_utc": "2026-10-08T09:54:58.141008+00:00"
  },
  "id": "person-mohamedatalla::S1",
  "title": "The Chipmakers: U.S. Strengths and Priorities for the High-End Semiconductor Workforce",
  "url": "https://cset.georgetown.edu/wp-content/uploads/CSET-The-Chipmakers.pdf"
}

Historical synthesis in a 2020 workforce issue brief, not an original 1959 experimental paper. Explicit same-paragraph Mohamed M. Atalla/Mohamed Atalla bridge; preserve Kahng joint credit, without individual fabrication-task allocation.

Historical synthesis in a 2020 workforce issue brief, not an original 1959 experimental paper. Explicit same-paragraph Mohamed M. Atalla/Mohamed Atalla bridge; preserve Kahng joint credit, without individual fabrication-task allocation.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Roger Brown

Roger Brown’s language-acquisition project began in 1962 with three preschool children called Adam, Eve and Sarah.

The group studied transcriptions of spontaneous conversations between children and mothers at home, adapting distributional analysis to child speech.

Brown wrote A First Language after data collection ended, bringing analyses of separate English grammatical subsystems into an account of broader developmental stages.

Sources and details

This Week’s Citation Classic: A first language: the early stages

{
  "access_scope": "1982 author commentary on the 1973 book; three-child study, not universal validation. Bellugi, Colin Fraser and Cazden collected the children’s records; no sole-author inference for data collection.",
  "authors": [
    "Roger Brown"
  ],
  "authors_in_source_order": [
    "Roger Brown"
  ],
  "dates": {
    "commentary_written": "1982-02-01",
    "issue_published": "1982-06-28",
    "original_book": "1973",
    "retrieved_utc": "2026-10-08T09:54:58.141172+00:00"
  },
  "id": "person-rogerbrown::S1",
  "title": "This Week’s Citation Classic: A first language: the early stages",
  "url": "https://garfield.library.upenn.edu/classics1982/A1982NT91400001.pdf"
}

1982 author commentary on the 1973 book; three-child study, not universal validation. Bellugi, Colin Fraser and Cazden collected the children’s records; no sole-author inference for data collection.

1982 author commentary on the 1973 book; three-child study, not universal validation. Bellugi, Colin Fraser and Cazden collected the children’s records; no sole-author inference for data collection.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Richard M. Cyert

Richard M. Cyert and James G. March developed a behavioural theory of the firm that modelled concrete organizational decisions using empirically testable assumptions about decision makers.

The programme used observations inside actual organizations to build computer simulations that tested predicted consequences of decision rules.

Cyert also pursued laboratory research with colleagues, including March and William Starbuck on internal communication and Lester Lave on collusion and conflict.

Sources and details

Ideas and Work of Richard M. Cyert, in A Celebration of the Life and Memory of President Emeritus Richard M. Cyert

{
  "access_scope": "Day/Sunder retrospective tribute within memorial compilation, not Cyert-authored original experiments. Preserve each joint role and distinguish field observation, computational simulation and laboratory human behaviour; OCR Overt/1904 errors are visually identified, not identity/date proof.",
  "authors": [
    "Richard H. Day",
    "Shyam Sunder"
  ],
  "authors_in_source_order": [
    "Richard H. Day",
    "Shyam Sunder"
  ],
  "dates": {
    "manifestation": "memorial compilation after Cyert’s 1998 death; exact publication day not asserted",
    "retrieved_utc": "2026-10-08T09:54:59.092683+00:00"
  },
  "id": "person-richardmcyert::S1",
  "title": "Ideas and Work of Richard M. Cyert, in A Celebration of the Life and Memory of President Emeritus Richard M. Cyert",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00007_fld00500_bdl0001_doc0001/Simon_box00007_fld00500_bdl0001_doc0001.pdf"
}

Day/Sunder retrospective tribute within memorial compilation, not Cyert-authored original experiments. Preserve each joint role and distinguish field observation, computational simulation and laboratory human behaviour; OCR Overt/1904 errors are visually identified, not identity/date proof.

Day/Sunder retrospective tribute within memorial compilation, not Cyert-authored original experiments. Preserve each joint role and distinguish field observation, computational simulation and laboratory human behaviour; OCR Overt/1904 errors are visually identified, not identity/date proof.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Philippe Roussel

Philippe Roussel’s 1972 dissertation studied formal equality as a distinct predicate for automated theorem proving, changing its axioms to make treatment more efficient.

It developed injective interpretations and methods incorporating formal-equality axioms into complete deduction methods with a lifting property.

The implementation account described OEDIPE’s problem and response syntax, with Algol-W algorithms for representing clauses, unification and copying.

Sources and details

Définition et traitement de l’égalité formelle en démonstration automatique

{
  "access_scope": "Original French dissertation, defended 30 May 1972; English sentences are original paraphrases of inspected French introduction. Not the 1992 Prolog history or 1996 English translation; no claim of general equality decidability or verified performance.",
  "authors": [
    "Philippe Roussel"
  ],
  "authors_in_source_order": [
    "Philippe Roussel"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T09:55:00.286564+00:00",
    "thesis_defended": "1972-05-30"
  },
  "id": "person-philipperoussel::S1",
  "title": "Définition et traitement de l’égalité formelle en démonstration automatique",
  "url": "https://softwarepreservation.computerhistory.org/prolog/marseille/doc/Roussel-Formal_Equality-1972.pdf"
}

Original French dissertation, defended 30 May 1972; English sentences are original paraphrases of inspected French introduction. Not the 1992 Prolog history or 1996 English translation; no claim of general equality decidability or verified performance.

Original French dissertation, defended 30 May 1972; English sentences are original paraphrases of inspected French introduction. Not the 1992 Prolog history or 1996 English translation; no claim of general equality decidability or verified performance.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

James E. Short

James E. Short coauthored a 2022 pilot combining federated learning and analytics with a blockchain network to track analytic jobs in an HPC setting.

The team examined system state transitions and storage generated by smart-contract execution for access and modification logs, using simulated supercomputer jobs.

Short’s stated responsibilities included conceptualization, project leadership, experimental design and the original draft; the system was presented as an exploratory research tool with secure auditing as a design goal.

Sources and details

A field test of a federated learning/federated analytic blockchain network implementation in an HPC environment

{
  "access_scope": "Original joint pilot article. Individual JS responsibilities come solely from explicit author-contribution statement, not byline inference. Simulated jobs and intended security remain distinct from proved production security or broad scalability.",
  "authors": [
    "James E. Short",
    "Ken Miyachi",
    "Christian Toouli",
    "Steve Todd"
  ],
  "authors_in_source_order": [
    "James E. Short",
    "Ken Miyachi",
    "Christian Toouli",
    "Steve Todd"
  ],
  "dates": {
    "accepted": "2022-06-29",
    "citation_publication_date": "2022/08/08",
    "published": "2022-08-08",
    "received": "2022-03-10",
    "retrieved_utc": "2026-10-08T09:55:01.474510+00:00"
  },
  "id": "person-jameseshort::S1",
  "title": "A field test of a federated learning/federated analytic blockchain network implementation in an HPC environment",
  "url": "https://www.frontiersin.org/journals/blockchain/articles/10.3389/fbloc.2022.893747/full"
}

Original joint pilot article. Individual JS responsibilities come solely from explicit author-contribution statement, not byline inference. Simulated jobs and intended security remain distinct from proved production security or broad scalability.

Original joint pilot article. Individual JS responsibilities come solely from explicit author-contribution statement, not byline inference. Simulated jobs and intended security remain distinct from proved production security or broad scalability.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Stafford Beer

Stafford Beer became Honorary Professor of Organisational Transformation at Liverpool Polytechnic in 1989, linking his management-cybernetics work to the institution now known as LJMU.

From 1970 to 1973 he worked on a cybernetics-based control system for Chile’s social economy, whose full realization was prevented by the coup.

He later undertook commissions for the presidential offices of Mexico, Uruguay and Venezuela.

Sources and details

Professor Stafford Beer profile

{
  "access_scope": "University profile, no visible individual byline/date. Institutional historical attribution, not proof of completed Chile-wide operational deployment; retain prevention of full realization.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "publication_date": "not supplied by readable profile",
    "retrieved_utc": "2026-10-08T09:55:01.582433+00:00"
  },
  "id": "person-staffordbeer::S1",
  "title": "Professor Stafford Beer profile",
  "url": "https://www.ljmu.ac.uk/about-us/bicentenary/our-people/stafford-beer/stafford-beer-profile"
}

University profile, no visible individual byline/date. Institutional historical attribution, not proof of completed Chile-wide operational deployment; retain prevention of full realization.

University profile, no visible individual byline/date. Institutional historical attribution, not proof of completed Chile-wide operational deployment; retain prevention of full realization.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Frank Rosenblatt

Frank Rosenblatt was a research psychologist and project engineer at the Cornell Aeronautical Laboratory when the perceptron was demonstrated on an IBM 704 in 1958.

In 1959 he brought the perceptron to Ithaca and became director of Cornell’s Cognitive Systems Research Program and a psychology lecturer.

His Mark I classified visual patterns; the later Tobermory project, staffed largely by graduate students, was designed to recognize speech.

Sources and details

Professor’s perceptron paved the way for AI – 60 years too soon

{
  "access_scope": "Bounded original static HTML derivative; existing extraction hold remains. Distinguish IBM 704 demonstration, Mark I visual classifier and Tobermory speech-recognition goal; do not assert successful general speech recognition or original-idea claims.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "published": "2019-09-25",
    "retrieved_utc": "2026-10-08T09:54:59.832229+00:00"
  },
  "id": "person-frankrosenblatt::S1",
  "title": "Professor’s perceptron paved the way for AI – 60 years too soon",
  "url": "https://nbb.cornell.edu/news/professors-perceptron-paved-way-ai-60-years-too-soon"
}

Bounded original static HTML derivative; existing extraction hold remains. Distinguish IBM 704 demonstration, Mark I visual classifier and Tobermory speech-recognition goal; do not assert successful general speech recognition or original-idea claims. The original extraction hold remains.

Bounded original static HTML derivative; existing extraction hold remains. Distinguish IBM 704 demonstration, Mark I visual classifier and Tobermory speech-recognition goal; do not assert successful general speech recognition or original-idea claims. The original extraction hold remains.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Stephen Kleene

Stephen Kleene’s work in logic made him a founder of recursion theory, according to the Wisconsin mathematics department’s 1994 obituary.

At Wisconsin he built a prominent logic group and chaired both Mathematics and Numerical Analysis, the latter department becoming Computer Science.

He continued research after retiring from teaching in 1979 and received the 1983 Steele Prize for his 1955 papers on recursion theory and descriptive set theory.

Sources and details

Van Vleck Notes: The Newsletter of the Mathematics Department of the University of Wisconsin–Madison, Number 7, Fall 1994

{
  "access_scope": "Manual bounded transcription from actual scanned page 4, with original extraction hold preserved. Same obituary explicitly uses Stephen Cole Kleene, Stephen C. Kleene and Stephen Kleene; no arbitrary middle-name removal.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "issue": "Fall 1994",
    "number": "7",
    "retrieved_utc": "2026-10-08T09:55:00.314326+00:00"
  },
  "id": "person-stephenkleene::S1",
  "title": "Van Vleck Notes: The Newsletter of the Mathematics Department of the University of Wisconsin–Madison, Number 7, Fall 1994",
  "url": "https://web.math.wisc.edu/news/news1994.pdf"
}

Manual bounded transcription from actual scanned page 4, with original extraction hold preserved. Same obituary explicitly uses Stephen Cole Kleene, Stephen C. Kleene and Stephen Kleene; no arbitrary middle-name removal. The original extraction hold remains.

Manual bounded transcription from actual scanned page 4, with original extraction hold preserved. Same obituary explicitly uses Stephen Cole Kleene, Stephen C. Kleene and Stephen Kleene; no arbitrary middle-name removal. The original extraction hold remains.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Elizabeth Arledge

Elizabeth Arledge coauthored a review of policy-process research to examine why AI adoption in the U.S. federal government advances or stalls.

The preprint identifies ethical and legal concerns, aging infrastructure, workforce readiness, institutional barriers and social acceptance as challenges to large-scale adoption.

It examines coalition, policy-stream, punctuated-equilibrium, diffusion, narrative and institutional-analysis frameworks to seek policies that could expand government AI use.

Sources and details

How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks

{
  "access_scope": "Selected Elizabeth Arledge. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.",
  "authors": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "authors_in_source_order": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "dates": {
    "citation_publication_date": "2023/04/24",
    "inspection_date": "2026-10-08",
    "precise_publication_date": "unresolved source-field distinction",
    "publication_year": "2023",
    "raw_citation_publication_date": "2023/04/24",
    "raw_meta_date": "2023-02-02",
    "retrieved_utc": "2026-10-08T08:19:18.711806+00:00"
  },
  "doi": "10.31235/osf.io/vm43w",
  "id": "person-coverage-9fe0b15414c9dc::S1",
  "title": "How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks",
  "url": "https://ideas.repec.org/p/osf/socarx/vm43w.html"
}

Selected Elizabeth Arledge. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.

Selected Elizabeth Arledge. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Daniel Levy

Daniel Levy coauthored algorithms for distributionally robust optimization of convex losses with conditional-value-at-risk and chi-squared-divergence uncertainty sets.

The joint paper proves gradient-evaluation bounds independent of training-set size and parameter count for these problems.

For conditional value at risk, its guarantees scale linearly with the uncertainty level, improving the quadratic dependence of previous work.

Sources and details

Large-Scale Methods for Distributionally Robust Optimization

{
  "access_scope": "Selected Daniel Levy; ordered authors Daniel Levy, Yair Carmon, John Duchi, Aaron Sidford. First two share an equal-contribution mark. Claims are joint convex-loss algorithm guarantees in the December 11, 2020 v2 abstract, not an allocation of personal tasks. Author homepage links this exact paper; its John C. Duchi credit is preserved separately from the PDF John Duchi byline.",
  "authors": [
    "Daniel Levy",
    "Yair Carmon",
    "John Duchi",
    "Aaron Sidford"
  ],
  "authors_in_source_order": [
    "Daniel Levy",
    "Yair Carmon",
    "John Duchi",
    "Aaron Sidford"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:00.852962+00:00",
    "source_date_and_version": "2020-12-11; arXiv:2010.05893v2 [math.OC]"
  },
  "id": "person-daniellevy::S1",
  "title": "Large-Scale Methods for Distributionally Robust Optimization",
  "url": "https://arxiv.org/pdf/2010.05893.pdf"
}

Selected Daniel Levy; ordered authors Daniel Levy, Yair Carmon, John Duchi, Aaron Sidford. First two share an equal-contribution mark. Claims are joint convex-loss algorithm guarantees in the December 11, 2020 v2 abstract, not an allocation of personal tasks. Author homepage links this exact paper; its John C. Duchi credit is preserved separately from the PDF John Duchi byline.

Selected Daniel Levy; ordered authors Daniel Levy, Yair Carmon, John Duchi, Aaron Sidford. First two share an equal-contribution mark. Claims are joint convex-loss algorithm guarantees in the December 11, 2020 v2 abstract, not an allocation of personal tasks. Author homepage links this exact paper; its John C. Duchi credit is preserved separately from the PDF John Duchi byline.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Tony Scott

Tony Scott directed Enemy of the State, in which a chance encounter leads to Robert Dean being framed for murder and losing his career and home life.

The film’s corrupt intelligence official uses National Security Agency resources to conceal the government murder of a congressman.

Dean turns to Brill, an underground information broker and former intelligence operative, to recover his life and prove his innocence.

Sources and details

Enemy of the State (film)

{
  "access_scope": "Selected Tony Scott; Disney D23 credits him as director. Three sentences describe the credited film’s narrative; no authorship of screenplay, surveillance methods or individual production decisions is inferred. The archive names the Don Simpson/Jerry Bruckheimer production and Touchstone association.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:00.853142+00:00",
    "source_date_and_version": "Film released 1998-11-20; archive article date unspecified"
  },
  "id": "person-coverage-db4ce559b31ff9::S1",
  "title": "Enemy of the State (film)",
  "url": "https://d23.com/a-to-z/enemy-of-the-state-film/"
}

Selected Tony Scott; Disney D23 credits him as director. Three sentences describe the credited film’s narrative; no authorship of screenplay, surveillance methods or individual production decisions is inferred. The archive names the Don Simpson/Jerry Bruckheimer production and Touchstone association.

Selected Tony Scott; Disney D23 credits him as director. Three sentences describe the credited film’s narrative; no authorship of screenplay, surveillance methods or individual production decisions is inferred. The archive names the Don Simpson/Jerry Bruckheimer production and Touchstone association.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Rob Cohen

Rob Cohen directed Stealth, for which Digital Domain animated aircraft that interact with physical models.

Digital Domain created the terrain visible around the aircraft with software developed in-house.

Its proprietary Storm software supplied clouds and fire effects, while volumetric algorithms depicted debris around an imploding 25-foot building miniature.

Sources and details

Stealth

{
  "access_scope": "Selected Rob Cohen, credited director; VFX supervisor Joel Hynek is separately credited. These are Digital Domain’s stated visual-effects contributions to the film, not personal software, miniature-building or VFX tasks assigned to Cohen. Corporate contributor account, not a full film audit.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:00.853090+00:00",
    "source_date_and_version": "Film release 2005-07-29; web account date unspecified"
  },
  "id": "person-coverage-d234afe056d82c::S1",
  "title": "Stealth",
  "url": "https://digitaldomain.com/work/stealth/"
}

Selected Rob Cohen, credited director; VFX supervisor Joel Hynek is separately credited. These are Digital Domain’s stated visual-effects contributions to the film, not personal software, miniature-building or VFX tasks assigned to Cohen. Corporate contributor account, not a full film audit.

Selected Rob Cohen, credited director; VFX supervisor Joel Hynek is separately credited. These are Digital Domain’s stated visual-effects contributions to the film, not personal software, miniature-building or VFX tasks assigned to Cohen. Corporate contributor account, not a full film audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Ryan Gosling

Ryan Gosling described working with Denis Villeneuve on Blade Runner 2049’s character and script to help realize the director’s vision.

He said their shared memories of the original film helped their creative process as they explored the sequel’s theme of memory.

Gosling explained that the extensive physical sets in Budapest reduced what he had to imagine and gave the environment a direct role in his performance.

Sources and details

Blade Runner 2049: Interview with Star Ryan Gosling

{
  "access_scope": "Selected Ryan Gosling, interviewee; byline Emanuel Levy. Full Ryan Gosling speaker label and subsequent RG labels occur within the same interview. Personal recollections concern collaboration and acting; no sole screenplay authorship or set construction is inferred.",
  "authors": [
    "Emanuel Levy"
  ],
  "authors_in_source_order": [
    "Emanuel Levy"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:01.428304+00:00",
    "source_date_and_version": "Interview published 2017-09-28"
  },
  "id": "person-coverage-b90b3a9257d3db::S1",
  "title": "Blade Runner 2049: Interview with Star Ryan Gosling",
  "url": "https://emanuellevy.com/review/featured-review/blade-runner-2049-interview-with-ryan-gosling/"
}

Selected Ryan Gosling, interviewee; byline Emanuel Levy. Full Ryan Gosling speaker label and subsequent RG labels occur within the same interview. Personal recollections concern collaboration and acting; no sole screenplay authorship or set construction is inferred.

Selected Ryan Gosling, interviewee; byline Emanuel Levy. Full Ryan Gosling speaker label and subsequent RG labels occur within the same interview. Personal recollections concern collaboration and acting; no sole screenplay authorship or set construction is inferred.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Hock Tan

In his May 2024 letter to VMUG members, Hock Tan described VMware Cloud Foundation as a way for enterprises to create self-service private clouds with public-cloud-like operation on premises.

He linked that strategy to a common management and operations layer connecting compute, storage and networking.

Tan argued that secure private cloud environments with data sovereignty could help enterprises use AI while keeping sensitive data out of public clouds.

Sources and details

Letter to VMUG members

{
  "access_scope": "Selected Hock Tan, signed letter author. Historical Broadcom strategy and vendor arguments dated May 6, 2024; no independent customer-benefit, pricing or market-outcome finding is asserted. All three PDF pages visually inspected.",
  "authors": [
    "Hock Tan"
  ],
  "authors_in_source_order": [
    "Hock Tan"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:01.861719+00:00",
    "source_date_and_version": "Signed letter 2024-05-06"
  },
  "id": "person-coverage-b340cdb4e79619::S1",
  "title": "Letter to VMUG members",
  "url": "https://vmug.com/hubfs/HT-Letter-to-VMUG-Community-MAY2024-FINAL.pdf?hsLang=en"
}

Selected Hock Tan, signed letter author. Historical Broadcom strategy and vendor arguments dated May 6, 2024; no independent customer-benefit, pricing or market-outcome finding is asserted. All three PDF pages visually inspected.

Selected Hock Tan, signed letter author. Historical Broadcom strategy and vendor arguments dated May 6, 2024; no independent customer-benefit, pricing or market-outcome finding is asserted. All three PDF pages visually inspected.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Yasuyuki Ueda

Yasuyuki Ueda recalled contacting Yoshitoshi ABe after discovering his website while seeking an illustrator for Lain.

He described himself as a producer involved in creation, including discussing changes with creators when their work did not meet his expectations.

Ueda said that seeing the first 30 pages of ABe’s Haibane Renmei work persuaded him that it was worth adapting into an anime, even before its ending was settled.

Sources and details

Interview de M. ABe & M. Ueda

{
  "access_scope": "Selected Yasuyuki Ueda; ordered interview participants Yoshitoshi ABe, Yasuyuki Ueda. Original French Manga-news report of joint interview with Mangavore, Mata-web and Filmsactu; no individual journalist byline asserted. English paraphrases use Ueda’s own explicitly labeled answers; ABe’s creative claims remain separately attributed. Historical recollections, not current project status.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:02.053791+00:00",
    "source_date_and_version": "Published 2010-05-14 10:35; interview at late-April Lovin’ Japan event"
  },
  "id": "person-coverage-e764ae75798b0d::S1",
  "title": "Interview de M. ABe & M. Ueda",
  "url": "https://www.manga-news.com/index.php/actus/2010/05/14/Interview-de-M-ABe-M-Ueda"
}

Selected Yasuyuki Ueda; ordered interview participants Yoshitoshi ABe, Yasuyuki Ueda. Original French Manga-news report of joint interview with Mangavore, Mata-web and Filmsactu; no individual journalist byline asserted. English paraphrases use Ueda’s own explicitly labeled answers; ABe’s creative claims remain separately attributed. Historical recollections, not current project status.

Selected Yasuyuki Ueda; ordered interview participants Yoshitoshi ABe, Yasuyuki Ueda. Original French Manga-news report of joint interview with Mangavore, Mata-web and Filmsactu; no individual journalist byline asserted. English paraphrases use Ueda’s own explicitly labeled answers; ABe’s creative claims remain separately attributed. Historical recollections, not current project status.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Fran Drescher

Fran Drescher described AI protections in the November 2023 tentative SAG-AFTRA agreement as an ongoing negotiation as technology continued to change.

She said the union requested meetings with the studios twice a year to assess technological developments.

Drescher also argued that the union and studios would need to cooperate on federal regulation and protection against piracy.

Sources and details

Fran Drescher tells NPR the breakthrough moment that ended the Hollywood strikes

{
  "access_scope": "Selected Fran Drescher, interviewee; ordered NPR byline Ailsa Chang, Michael Levitt, Christopher Intagliata. NCPR syndicates the original All Things Considered interview. Published timestamp, interview date and author/interviewee roles are separate. The source describes a tentative agreement awaiting ratification in November 2023; no current contract rule or sole personal negotiating credit is asserted.",
  "authors": [
    "Ailsa Chang",
    "Michael Levitt",
    "Christopher Intagliata"
  ],
  "authors_in_source_order": [
    "Ailsa Chang",
    "Michael Levitt",
    "Christopher Intagliata"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T09:58:02.333516+00:00",
    "source_date_and_version": "Published 2023-11-09 5:35pm; interview Thursday November 9, 2023"
  },
  "id": "person-coverage-ff51d8ca764ff3::S1",
  "title": "Fran Drescher tells NPR the breakthrough moment that ended the Hollywood strikes",
  "url": "https://www.northcountrypublicradio.org/news/npr/1211771891/fran-drescher-tells-npr-the-breakthrough-moment-that-ended-the-hollywood-strikes"
}

Selected Fran Drescher, interviewee; ordered NPR byline Ailsa Chang, Michael Levitt, Christopher Intagliata. NCPR syndicates the original All Things Considered interview. Published timestamp, interview date and author/interviewee roles are separate. The source describes a tentative agreement awaiting ratification in November 2023; no current contract rule or sole personal negotiating credit is asserted.

Selected Fran Drescher, interviewee; ordered NPR byline Ailsa Chang, Michael Levitt, Christopher Intagliata. NCPR syndicates the original All Things Considered interview. Published timestamp, interview date and author/interviewee roles are separate. The source describes a tentative agreement awaiting ratification in November 2023; no current contract rule or sole personal negotiating credit is asserted.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Azka Shoaib

Azka Shoaib coauthored a review of policy-process research to examine why AI adoption in the U.S. federal government advances or stalls.

The preprint identifies ethical and legal concerns, aging infrastructure, workforce readiness, institutional barriers and social acceptance as challenges to large-scale adoption.

It examines coalition, policy-stream, punctuated-equilibrium, diffusion, narrative and institutional-analysis frameworks to seek policies that could expand government AI use.

Sources and details

How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks

{
  "access_scope": "Selected Azka Shoaib. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.",
  "authors": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "authors_in_source_order": [
    "Muhammad Salar Khan",
    "Azka Shoaib",
    "Elizabeth Arledge"
  ],
  "dates": {
    "citation_publication_date": "2023/04/24",
    "inspection_date": "2026-10-08",
    "precise_publication_date": "unresolved source-field distinction",
    "publication_year": "2023",
    "raw_citation_publication_date": "2023/04/24",
    "raw_meta_date": "2023-02-02",
    "retrieved_utc": "2026-10-08T08:19:18.711806+00:00"
  },
  "doi": "10.31235/osf.io/vm43w",
  "id": "person-coverage-85752490bcd670::S1",
  "title": "How to Promote AI in the US Federal Government: Insights from Policy Process Frameworks",
  "url": "https://ideas.repec.org/p/osf/socarx/vm43w.html"
}

Selected Azka Shoaib. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.

Selected Azka Shoaib. Ordered coauthors Muhammad Salar Khan, Azka Shoaib, Elizabeth Arledge. Existing IDEAS/RePEc record reproduces SocArXiv vm43w original preprint abstract and full ordered bibliographic credit; DOI10.31235/osf.io/vm43w,2023preprint separate from2024Government Information Quarterly article. Claims limited to this abstract, not full manuscript or individual tasks. Source date fields differ: date2023-02-02 versus citation_publication_date2023/04/24; no precise publication date asserted. Original source/cache bytes unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Affirm

Affirm’s VTEX integration documentation places pay-over-time options in the merchant’s checkout flow, where customers can choose biweekly or monthly payments.

The page assigns financing in the background to Affirm while distinguishing VTEX’s role in providing the shopping experience.

It describes merchant setup tools for displaying monthly payment options, offering prequalification and adding Affirm at checkout, and directs integration setup to the VTEX Developer Portal.

Sources and details

VTEX

{
  "access_scope": "Source-authored collective product documentation, U.S. availability as stated in the cached page, with static modification timestamp November 13, 2025 distinct from relative Updated 11 months ago text. Only documented customer-flow/provider roles and setup description; not an executed integration, credit approval guarantee, underwriting mechanism, conversion benefit or financial advice. Previously failed company/filing sources and misbound Founders Fund evidence stay held.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T10:38:10.392986+00:00",
    "static_page_modified": "2025-11-13T14:13:34.000Z",
    "visible_relative_update": "11 months ago"
  },
  "id": "organization-company-07b9fafa05551c::S1",
  "title": "VTEX",
  "url": "https://docs.affirm.com/platforms/docs/vtex"
}

Source-authored collective product documentation, U.S. availability as stated in the cached page, with static modification timestamp November 13, 2025 distinct from relative Updated 11 months ago text. Only documented customer-flow/provider roles and setup description; not an executed integration, credit approval guarantee, underwriting mechanism, conversion benefit or financial advice. Previously failed company/filing sources and misbound Founders Fund evidence stay held.

Source-authored collective product documentation, U.S. availability as stated in the cached page, with static modification timestamp November 13, 2025 distinct from relative Updated 11 months ago text. Only documented customer-flow/provider roles and setup description; not an executed integration, credit approval guarantee, underwriting mechanism, conversion benefit or financial advice. Previously failed company/filing sources and misbound Founders Fund evidence stay held.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [
    {
      "basis": "Official annual report states company founded in 2012; incorporation date not independently resolved.",
      "date": "2012",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://foundersfund.com/company/affirm/",
        "https://investors.affirm.com/static-files/6d33b92f-9cc3-4c7b-a7d1-9bda901824a9"
      ],
      "year": 2012
    }
  ]
}

Span Lu

Span Lu is one of four inventors credited on a 2003 TSMC patent for controlling how products move through fabrication steps with queue-time limits.

The joint invention calculates processing demand from product throughput and compares it with the available queue-time tolerance before dispatching a lot.

Its scheduling rule addresses the risk that wafers wait too long between sensitive processes, damaging film quality and requiring rework or scrapping.

Sources and details

Method for controlling queue time constraints in a fabrication facility

{
  "access_scope": "Joint US6647307B1 patent scope; ordered inventors Liang-Kai Huang, Span Lu, Ren-Chyi You, Kuang-Huan Hsu. No personal algorithm-design task inferred; US version kept distinct from TW family credits.",
  "authors": [
    "Liang-Kai Huang",
    "Span Lu",
    "Ren-Chyi You",
    "Kuang-Huan Hsu"
  ],
  "authors_in_source_order": [
    "Liang-Kai Huang",
    "Span Lu",
    "Ren-Chyi You",
    "Kuang-Huan Hsu"
  ],
  "dates": {
    "inspected_source_date_1": "Filed 7 November 2002",
    "inspected_source_date_2": "Published 11 November 2003",
    "retrieved_utc": "2026-10-08T10:41:08.843984+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Filed 7 November 2002",
    "Published 11 November 2003"
  ],
  "id": "person-coverage-0135d1378429db::S1",
  "title": "Method for controlling queue time constraints in a fabrication facility",
  "url": "https://patents.google.com/patent/US6647307B1/en"
}

Span Lu: Joint US6647307B1 patent scope; ordered inventors Liang-Kai Huang, Span Lu, Ren-Chyi You, Kuang-Huan Hsu. No personal algorithm-design task inferred; US version kept distinct from TW family credits.

Span Lu: Joint US6647307B1 patent scope; ordered inventors Liang-Kai Huang, Span Lu, Ren-Chyi You, Kuang-Huan Hsu. No personal algorithm-design task inferred; US version kept distinct from TW family credits.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Jerome Y. Lettvin

In his UNESCO symposium essay, Jerome Y. Lettvin distinguishes scientific inquiry from a public faith in the authority of scientific facts and artifacts.

He argues that unquestioning appeals to what science says can support political control, just as appeals to religious authority once did.

While praising computers as tools for designing devices and automating tedious work, he warns that their output can become a substitute for a scientific goal or theory.

Sources and details

The Diversity of Cultures as against the Universality of Science and Technology

{
  "access_scope": "Original named-author essay, Copyright1971 UNESCO; inspected PDF pages1 and4. September6 presentation noted without inferring its year; author arguments, not endorsement of quoted prejudices or biographical/research-task claims.",
  "authors": [
    "Jerome Y. Lettvin"
  ],
  "authors_in_source_order": [
    "Jerome Y. Lettvin"
  ],
  "dates": {
    "inspected_source_date_1": "Copyright 1971, UNESCO",
    "retrieved_utc": "2026-10-08T10:41:10.125014+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Copyright 1971, UNESCO"
  ],
  "id": "person-coverage-2920221d7c0a83::S1",
  "title": "The Diversity of Cultures as against the Universality of Science and Technology",
  "url": "https://www.digitallife.center/images/The_Diversity_of__Cultures_as_against_the_Universality_of_Science_and__Technology_by_Jerome_Y_Lettvin.pdf"
}

Jerome Y. Lettvin: Original named-author essay, Copyright1971 UNESCO; inspected PDF pages1 and4. September6 presentation noted without inferring its year; author arguments, not endorsement of quoted prejudices or biographical/research-task claims.

Jerome Y. Lettvin: Original named-author essay, Copyright1971 UNESCO; inspected PDF pages1 and4. September6 presentation noted without inferring its year; author arguments, not endorsement of quoted prejudices or biographical/research-task claims.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Peter Salanki

In a 2024 theCUBE interview, Peter Salanki described CoreWeave’s decision to build its cloud stack around Kubernetes.

He said the familiar Kubernetes interface lets customers begin without learning proprietary APIs and helps the company scale its infrastructure.

He also described using open-source tools such as Argo Workflows to handle failures and system lifecycles while preserving performance under demanding workloads.

Sources and details

Scaling innovation with open source: Kubernetes drives AI transformation

{
  "access_scope": "Original Chad Wilson interview account with speakers Peter Salanki and Chen Goldberg, interviewers Rob Strechay and Savannah Peterson; direct Salanki statements only, not Goldberg security claims or an individual engineering task. Paid event-media disclosure retained; no video audit.",
  "authors": [
    "Chad Wilson"
  ],
  "authors_in_source_order": [
    "Chad Wilson"
  ],
  "dates": {
    "inspected_source_date_1": "Updated 13 November 2024 15:43 EST",
    "retrieved_utc": "2026-10-08T10:41:09.771583+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Updated 13 November 2024 15:43 EST"
  ],
  "id": "person-coverage-38568b05a99b77::S1",
  "title": "Scaling innovation with open source: Kubernetes drives AI transformation",
  "url": "https://siliconangle.com/2024/11/13/kubernetes-machine-learning-kubecon/"
}

Peter Salanki: Original Chad Wilson interview account with speakers Peter Salanki and Chen Goldberg, interviewers Rob Strechay and Savannah Peterson; direct Salanki statements only, not Goldberg security claims or an individual engineering task. Paid event-media disclosure retained; no video audit.

Peter Salanki: Original Chad Wilson interview account with speakers Peter Salanki and Chen Goldberg, interviewers Rob Strechay and Savannah Peterson; direct Salanki statements only, not Goldberg security claims or an individual engineering task. Paid event-media disclosure retained; no video audit.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Arthur P. Dempster

Arthur P. Dempster is a coauthor of a paper proposing a Gibbs sampler for Dempster–Shafer inference about categorical distributions.

The joint abstract describes uncertainty in three parts—evidence for an assertion, evidence against it, and uncertainty—while allowing partial prior information.

The sampler targets random convex polytopes that encode this inference, with examples covering independence in two-by-two tables and estimation in a linkage model.

Sources and details

A Gibbs sampler for a class of random convex polytopes

{
  "access_scope": "Original arXiv abstract1910.11953v3, 21January2021; ordered authors Pierre E. Jacob, Ruobin Gong, Paul T. Edlefsen, Arthur P. Dempster. Joint method scope, not selected individual coding tasks or1977EM paper; abstract only.",
  "authors": [
    "Pierre E. Jacob",
    "Ruobin Gong",
    "Paul T. Edlefsen",
    "Arthur P. Dempster"
  ],
  "authors_in_source_order": [
    "Pierre E. Jacob",
    "Ruobin Gong",
    "Paul T. Edlefsen",
    "Arthur P. Dempster"
  ],
  "dates": {
    "citation_date": "2019/10/25",
    "inspected_revision": "Thu, 21 Jan 2021 20:34:07 UTC (183 KB)",
    "inspected_source_date_1": "Submitted 25 October 2019",
    "inspected_source_date_2": "v3 revised 21 January 2021",
    "retrieved_utc": "2026-10-08T10:41:07.954567+00:00",
    "version": "arXiv v3"
  },
  "dates_exact_in_source_role_order": [
    "Submitted 25 October 2019",
    "v3 revised 21 January 2021"
  ],
  "id": "person-coverage-8868d0d405012e::S1",
  "title": "A Gibbs sampler for a class of random convex polytopes",
  "url": "https://arxiv.org/abs/1910.11953",
  "version_url": "https://arxiv.org/abs/1910.11953v3"
}

Arthur P. Dempster: Original arXiv abstract1910.11953v3, 21January2021; ordered authors Pierre E. Jacob, Ruobin Gong, Paul T. Edlefsen, Arthur P. Dempster. Joint method scope, not selected individual coding tasks or1977EM paper; abstract only.

Arthur P. Dempster: Original arXiv abstract1910.11953v3, 21January2021; ordered authors Pierre E. Jacob, Ruobin Gong, Paul T. Edlefsen, Arthur P. Dempster. Joint method scope, not selected individual coding tasks or1977EM paper; abstract only.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Hannah Nguyen

Hannah Nguyen is a coauthor of a 2023 preprint comparing ProteinMPNN with Rosetta for designing two-component tetrahedral protein nanomaterials.

The joint abstract reports a similar design success rate, including thirteen experimentally confirmed assemblies, with much less computation and no manual refinement.

It also reports more polar ProteinMPNN-designed interfaces that aided assembly from separately purified components, with several crystal structures supporting design accuracy.

Sources and details

Rapid and automated design of two-component protein nanomaterials using ProteinMPNN

{
  "access_scope": "PMC10418170 original bioRxiv preprint Version1 DOI10.1101/2023.08.04.551935, 4August2023; explicitly not peer reviewed. All14authors in source order listed in metadata. Selected Hannah Nguyen joint credit only, no individual experiment/design allocation. Abstract-only PMC manifestation; later PNAS version not conflated.",
  "authors": [
    "Robbert J de Haas",
    "Natalie Brunette",
    "Alex Goodson",
    "Justas Dauparas",
    "Sue Y Yi",
    "Erin C Yang",
    "Quinton Dowling",
    "Hannah Nguyen",
    "Alex Kang",
    "Asim K Bera",
    "Banumathi Sankaran",
    "Renko de Vries",
    "David Baker",
    "Neil P King"
  ],
  "authors_in_source_order": [
    "Robbert J de Haas",
    "Natalie Brunette",
    "Alex Goodson",
    "Justas Dauparas",
    "Sue Y Yi",
    "Erin C Yang",
    "Quinton Dowling",
    "Hannah Nguyen",
    "Alex Kang",
    "Asim K Bera",
    "Banumathi Sankaran",
    "Renko de Vries",
    "David Baker",
    "Neil P King"
  ],
  "dates": {
    "citation_publication_date": "2023 Aug 4",
    "inspected_source_date_1": "bioRxiv preprint Version1, 4 August 2023",
    "retrieved_utc": "2026-10-08T10:41:09.589597+00:00"
  },
  "dates_exact_in_source_role_order": [
    "bioRxiv preprint Version1, 4 August 2023"
  ],
  "id": "person-coverage-a7758158ed191c::S1",
  "title": "Rapid and automated design of two-component protein nanomaterials using ProteinMPNN",
  "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC10418170/"
}

Hannah Nguyen: PMC10418170 original bioRxiv preprint Version1 DOI10.1101/2023.08.04.551935, 4August2023; explicitly not peer reviewed. All14authors in source order listed in metadata. Selected Hannah Nguyen joint credit only, no individual experiment/design allocation. Abstract-only PMC manifestation; later PNAS version not conflated.

Hannah Nguyen: PMC10418170 original bioRxiv preprint Version1 DOI10.1101/2023.08.04.551935, 4August2023; explicitly not peer reviewed. All14authors in source order listed in metadata. Selected Hannah Nguyen joint credit only, no individual experiment/design allocation. Abstract-only PMC manifestation; later PNAS version not conflated.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Eva Jablonka

Eva Jablonka and Simona Ginsburg propose that the evolution of learning drove the transition from nonconscious organisms to minimal subjective experience.

Their accepted manuscript identifies unlimited associative learning—an open-ended, representational and recursive learning capacity—as a proposed marker of that transition.

They use this capacity to construct a model of minimal consciousness and outline ways to test its relationship with consciousness in humans and other animals.

Sources and details

Learning and the evolution of conscious agents

{
  "access_scope": "LSE-hosted author accepted manuscript of2022 article, ordered Eva Jablonka then Simona Ginsburg; selected Eva Jablonka corresponding-author role explicit. PDFcover/byline/abstract pages1–3 visually inspected; theoretical proposal, not established evolutionary proof; published version may differ.",
  "authors": [
    "Eva Jablonka",
    "Simona Ginsburg"
  ],
  "authors_in_source_order": [
    "Eva Jablonka",
    "Simona Ginsburg"
  ],
  "dates": {
    "inspected_source_date_1": "2022 Biosemiotics15(3):401–437; author accepted version",
    "retrieved_utc": "2026-10-08T10:41:09.691258+00:00"
  },
  "dates_exact_in_source_role_order": [
    "2022 Biosemiotics15(3):401–437; author accepted version"
  ],
  "id": "person-coverage-bb246830ad8746::S1",
  "title": "Learning and the evolution of conscious agents",
  "url": "https://researchonline.lse.ac.uk/id/eprint/116711/1/REVISED_LEARNING_AND_THE_EVOLUTION_OF_CONSCIOUS_AGENTS.pdf"
}

Eva Jablonka: LSE-hosted author accepted manuscript of2022 article, ordered Eva Jablonka then Simona Ginsburg; selected Eva Jablonka corresponding-author role explicit. PDFcover/byline/abstract pages1–3 visually inspected; theoretical proposal, not established evolutionary proof; published version may differ.

Eva Jablonka: LSE-hosted author accepted manuscript of2022 article, ordered Eva Jablonka then Simona Ginsburg; selected Eva Jablonka corresponding-author role explicit. PDFcover/byline/abstract pages1–3 visually inspected; theoretical proposal, not established evolutionary proof; published version may differ.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Mattia Cecchinato

Mattia Cecchinato’s paper argues that fictional imaginings can be judged by moral standards that differ from those applied to real-world conduct.

He defends a moderate difference between these domains, allowing more freedom in imagination while keeping fictional engagement open to moral criticism.

His explanation ties that greater permissiveness to the different consequences of fictional situations and offers an approach to the gamer’s dilemma within that framework.

Sources and details

Double-Standard Moralism: Why We Can Be More Permissive within Our Imagination

{
  "access_scope": "Original sole-author published article PDF DOI10.1093/aesthj/ayad008; copyright2023, January2024 journalissue kept distinct. Exact Mattia Cecchinato byline and abstract visually inspected PDFpage1. Philosophical arguments only, no universal exemption from moral criticism.",
  "authors": [
    "Mattia Cecchinato"
  ],
  "authors_in_source_order": [
    "Mattia Cecchinato"
  ],
  "dates": {
    "inspected_source_date_1": "Author copyright2023",
    "inspected_source_date_2": "British Journal of Aesthetics64(1), January2024, pp67–87",
    "retrieved_utc": "2026-10-08T10:41:08.403237+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Author copyright2023",
    "British Journal of Aesthetics64(1), January2024, pp67–87"
  ],
  "id": "person-coverage-f4870ae55247a3::S1",
  "title": "Double-Standard Moralism: Why We Can Be More Permissive within Our Imagination",
  "url": "https://ora.ox.ac.uk/objects/uuid%3A1ccbcbd2-b231-4242-be82-c951133282bc/files/r2801ph19q"
}

Mattia Cecchinato: Original sole-author published article PDF DOI10.1093/aesthj/ayad008; copyright2023, January2024 journalissue kept distinct. Exact Mattia Cecchinato byline and abstract visually inspected PDFpage1. Philosophical arguments only, no universal exemption from moral criticism.

Mattia Cecchinato: Original sole-author published article PDF DOI10.1093/aesthj/ayad008; copyright2023, January2024 journalissue kept distinct. Exact Mattia Cecchinato byline and abstract visually inspected PDFpage1. Philosophical arguments only, no universal exemption from moral criticism.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Edward F. Moore

Edward F. Moore’s 1961 sorting patent describes a method for producing longer ordered sequences before merging them into a sorted output.

Instead of emptying internal memory before adding another batch, the apparatus admits a new unsorted word whenever it removes an output word.

The patent states that this replacement process doubles the average sorted-sequence length compared with filling and then completely emptying memory.

Sources and details

Sorting method and apparatus

{
  "access_scope": "Original US2983904A patent description with literal Edward F. Moore, inventor/assignor to Bell Telephone Laboratories. Patent claims attributed as claims, no historical automata-name bridge or independently measured speedup. Original publication9May1961 and filing4October1957.",
  "authors": [
    "Edward F. Moore"
  ],
  "authors_in_source_order": [
    "Edward F. Moore"
  ],
  "dates": {
    "inspected_source_date_1": "Filed 4 October 1957",
    "inspected_source_date_2": "Published 9 May 1961",
    "retrieved_utc": "2026-10-08T10:41:08.426807+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Filed 4 October 1957",
    "Published 9 May 1961"
  ],
  "id": "person-edwardfmoore::S1",
  "title": "Sorting method and apparatus",
  "url": "https://patents.google.com/patent/US2983904A/en"
}

Edward F. Moore: Original US2983904A patent description with literal Edward F. Moore, inventor/assignor to Bell Telephone Laboratories. Patent claims attributed as claims, no historical automata-name bridge or independently measured speedup. Original publication9May1961 and filing4October1957.

Edward F. Moore: Original US2983904A patent description with literal Edward F. Moore, inventor/assignor to Bell Telephone Laboratories. Patent claims attributed as claims, no historical automata-name bridge or independently measured speedup. Original publication9May1961 and filing4October1957.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

David Blundin

David Blundin’s DB2 profile describes his early work programming neural networks at MIT and deploying quantized models on custom hardware at Scan-Optics in 1992.

It identifies him as a founder and general partner of Link Ventures, investing in AI companies started by MIT and Harvard founders.

The profile also describes his role teaching MIT’s AI for Impact venture-studio class, connecting technical AI work with company creation.

Sources and details

DB2.ai — David Blundin | AI Pioneer · Venture Builder

{
  "access_scope": "Bounded DB2profile self-description; static title literally David Blundin, same-page heading David B. Blundin and narrative Dave bridge within this source. Source profile assertions only, no independent first-invention/valuation/exit counts or podcast guest claims. No date inferred from episode lists.",
  "authors": [
    "David Blundin"
  ],
  "authors_in_source_order": [
    "David Blundin"
  ],
  "dates": {
    "inspected_source_date_1": "Undated profile, retrieved8October2026",
    "retrieved_utc": "2026-10-08T10:41:08.283409+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated profile, retrieved8October2026"
  ],
  "id": "person-local-davidblundin::S1",
  "title": "DB2.ai — David Blundin | AI Pioneer · Venture Builder",
  "url": "https://db2.ai/"
}

David Blundin: Bounded DB2profile self-description; static title literally David Blundin, same-page heading David B. Blundin and narrative Dave bridge within this source. Source profile assertions only, no independent first-invention/valuation/exit counts or podcast guest claims. No date inferred from episode lists.

David Blundin: Bounded DB2profile self-description; static title literally David Blundin, same-page heading David B. Blundin and narrative Dave bridge within this source. Source profile assertions only, no independent first-invention/valuation/exit counts or podcast guest claims. No date inferred from episode lists.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Richard S. Bucy

Richard S. Bucy coedited Nonlinear Stochastic Problems, collecting invited lectures and research papers from a May 1982 institute in Algarve, Portugal.

The volume combines theory, algorithm implementation and application examples for nonlinear identification, signal processing, filtering and control.

Its publisher highlights how advances in computation permit more general approaches to problems previously treated through linearization and perturbation.

Sources and details

Nonlinear Stochastic Problems

{
  "access_scope": "Selected Richard S. Bucy; ordered joint editors Richard S. Bucy, José M. F. Moura. Claims describe the edited volume through original publisher overview, not personal method derivations or all chapter authorship. Original1983 hardcover,2011softcover,2012ebook dates remain distinct; NATO series C volume104. Page says NATD in overview, preserved as source wording without assigning a different organization. Bibliographic/overview HTML only, not full book inspection.",
  "authors": [
    "Richard S. Bucy",
    "José M. F. Moura"
  ],
  "authors_in_source_order": [
    "Richard S. Bucy",
    "José M. F. Moura"
  ],
  "dates": {
    "copyright": "1983 D. Reidel Publishing Company",
    "ebook_publication": "2012-12-06",
    "edition_number": 1,
    "hardcover_publication": "1983-05-31",
    "inspection_date": "2026-10-08",
    "meeting": "May 1982, Algarve, Portugal",
    "retrieved_utc": "2026-10-08T10:42:13.458266+00:00",
    "softcover_publication": "2011-10-14"
  },
  "id": "person-coverage-da351e37afdc3a::S1",
  "title": "Nonlinear Stochastic Problems",
  "url": "https://link.springer.com/book/10.1007/978-94-009-7142-4"
}

Selected Richard S. Bucy; ordered joint editors Richard S. Bucy, José M. F. Moura. Claims describe the edited volume through original publisher overview, not personal method derivations or all chapter authorship. Original1983 hardcover,2011softcover,2012ebook dates remain distinct; NATO series C volume104. Page says NATD in overview, preserved as source wording without assigning a different organization. Bibliographic/overview HTML only, not full book inspection.

Selected Richard S. Bucy; ordered joint editors Richard S. Bucy, José M. F. Moura. Claims describe the edited volume through original publisher overview, not personal method derivations or all chapter authorship. Original1983 hardcover,2011softcover,2012ebook dates remain distinct; NATO series C volume104. Page says NATD in overview, preserved as source wording without assigning a different organization. Bibliographic/overview HTML only, not full book inspection.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Octavia Butler

Octavia Butler contrasted the violent mutual understanding of telepaths in Child Finder with the loss of communication in Speech Sounds to explore extremes of human interaction.

For Parable of the Sower, she restricted the story to things she thought could happen and treated the protagonist’s hyper-empathy as an affliction rather than a special power.

She described the novel as a cautionary extrapolation rather than prophecy, including a world where global warming produces erratic weather, severe storms and California drought.

Sources and details

Devil Girl From Mars: Why I Write Science Fiction

{
  "access_scope": "Selected Octavia Butler, explicitly introduced as writer delivering these remarks at MIT February19,1998. Same HTML image caption names Octavia E. Butler,1986; this is a distinct image role, not substituted speaker credit. Claims limited to selected original talk paragraphs; Child Finder publication status and apparent Sower/Talents finishing-title inconsistency not repaired or asserted. Static body extraction recovery conditional on root deterministic reproduction/adapter and independent factual review; original303-character extracted.txt unchanged.",
  "authors": [
    "Octavia Butler"
  ],
  "authors_in_source_order": [
    "Octavia Butler"
  ],
  "dates": {
    "archive_publication_date": "not established in inspected source",
    "image_caption_year": "1986",
    "inspection_date": "2026-10-08",
    "retrieved_utc": "2026-10-08T10:42:13.458078+00:00",
    "talk_delivery": "1998-02-19"
  },
  "id": "person-coverage-3062e32b04a02f::S1",
  "title": "Devil Girl From Mars: Why I Write Science Fiction",
  "url": "https://blackhistory.mit.edu/archive/transcript-devil-girl-from-mars-why-i-write-science-fiction-by-octavia-butler-1998"
}

Selected Octavia Butler, explicitly introduced as writer delivering these remarks at MIT February19,1998. Same HTML image caption names Octavia E. Butler,1986; this is a distinct image role, not substituted speaker credit. Claims limited to selected original talk paragraphs; Child Finder publication status and apparent Sower/Talents finishing-title inconsistency not repaired or asserted. Static body extraction recovery conditional on root deterministic reproduction/adapter and independent factual review; original303-character extracted.txt unchanged.

Selected Octavia Butler, explicitly introduced as writer delivering these remarks at MIT February19,1998. Same HTML image caption names Octavia E. Butler,1986; this is a distinct image role, not substituted speaker credit. Claims limited to selected original talk paragraphs; Child Finder publication status and apparent Sower/Talents finishing-title inconsistency not repaired or asserted. Static body extraction recovery conditional on root deterministic reproduction/adapter and independent factual review; original303-character extracted.txt unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Design for a Brain

In the inspected second-edition description, Ashby treats adaptive behavior as a problem that must be reconciled with a mechanistic account of the nervous system.

Rather than propose one plausible device, he seeks the properties a mechanism must possess if it is to behave both mechanically and adaptively.

The argument relies on a general logic of mechanisms that can apply across physical implementations, instead of being tied to an exclusively mechanical, electronic or neuronal model.

Sources and details

Design for a Brain: The origin of adaptive behaviour

{
  "access_scope": "Public listing and preface-style description for the distinct 2013 second-edition manifestation, ISBN 9789401513203, 286 pages. No 1954 scan title proof or full book inspection; the frozen 1954 conditional notes and all original holds remain unchanged.",
  "authors": [
    "W. Ashby"
  ],
  "authors_in_source_order": [
    "W. Ashby"
  ],
  "dates": {
    "edition": "2, illustrated",
    "inspected_digital_manifestation": "2013-03-09",
    "retrieved_utc": "2026-10-08T10:43:21.144854+00:00"
  },
  "id": "work-culture-34e98ae5371f59::S1",
  "title": "Design for a Brain: The origin of adaptive behaviour",
  "url": "https://books.google.com/books/about/Design_for_a_Brain.html?id=Dc4hBQAAQBAJ"
}

Public listing and preface-style description for the distinct 2013 second-edition manifestation, ISBN 9789401513203, 286 pages. No 1954 scan title proof or full book inspection; the frozen 1954 conditional notes and all original holds remain unchanged.

Public listing and preface-style description for the distinct 2013 second-edition manifestation, ISBN 9789401513203, 286 pages. No 1954 scan title proof or full book inspection; the frozen 1954 conditional notes and all original holds remain unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "First book edition 1952; do not confuse with Ashby’s 1948 article with the same short title.",
  "dated": true,
  "year": 1952
}

Superintelligence: Paths, Dangers, Strategies

Bostrom’s publisher synopsis considers a future in which machines surpass people in general intelligence and acquire enough power to make human survival depend on their decisions.

It frames humanity’s opportunity as a first move: shaping a seed AI and its initial conditions so an intelligence explosion could be survivable.

The book’s advertised approaches span routes to greater intelligence, ways of constraining powerful systems and the problem of giving them appropriate values.

Sources and details

Superintelligence: Paths, Dangers, Strategies

{
  "access_scope": "OUP India synopsis for the paperback ISBN 9780198739838 dated 14 July 2016, 432 pages. Original 2014 edition is distinct and not inspected. These are the publisher’s framing and advertised topics, not a full book audit or forecasts asserted as facts.",
  "authors": [
    "Nick Bostrom"
  ],
  "authors_in_source_order": [
    "Nick Bostrom"
  ],
  "dates": {
    "inspected_paperback": "2016-07-14",
    "retrieved_utc": "2026-10-08T10:43:21.145041+00:00"
  },
  "id": "work-coverage-4870566b5165fb::S1",
  "title": "Superintelligence: Paths, Dangers, Strategies",
  "url": "https://india.oup.com/product/superintelligence-9780198739838"
}

OUP India synopsis for the paperback ISBN 9780198739838 dated 14 July 2016, 432 pages. Original 2014 edition is distinct and not inspected. These are the publisher’s framing and advertised topics, not a full book audit or forecasts asserted as facts.

OUP India synopsis for the paperback ISBN 9780198739838 dated 14 July 2016, 432 pages. Original 2014 edition is distinct and not inspected. These are the publisher’s framing and advertised topics, not a full book audit or forecasts asserted as facts.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Separate from the author's earlier papers titled Superintelligence.",
  "dated": true,
  "year": 2014
}

The Society of Mind

In MIT’s interview transcript, Minsky describes The Society of Mind as a bottom-up approach that explains different mental abilities through different mechanisms.

He contrasts that approach with a search for a few simple laws, proposing instead that many distinct capabilities must be arranged to work together.

He also identifies a limit of the book: although it offers many ideas about particular aspects of thinking, it does not supply a complete account of how those capabilities are organized.

Sources and details

Marvin Minsky: Infinite MIT interview transcript

{
  "access_scope": "Actual interactive transcript in immutable HTML, including timestamped speech spans, read directly. Retrospective author assessment of Society of Mind; no original edition body/date inspected or merger with the later Emotion Machine. Interview date and interviewer identity not established.",
  "authors": [
    "Marvin Minsky"
  ],
  "authors_in_source_order": [
    "Marvin Minsky"
  ],
  "dates": {
    "interview_date": null,
    "retrieved_utc": "2026-10-08T10:43:21.145206+00:00"
  },
  "id": "work-coverage-7f512369b67735::S1",
  "title": "Marvin Minsky: Infinite MIT interview transcript",
  "url": "https://infinite.mit.edu/video/marvin-minsky/"
}

Actual interactive transcript in immutable HTML, including timestamped speech spans, read directly. Retrospective author assessment of Society of Mind; no original edition body/date inspected or merger with the later Emotion Machine. Interview date and interviewer identity not established.

Actual interactive transcript in immutable HTML, including timestamped speech spans, read directly. Retrospective author assessment of Society of Mind; no original edition body/date inspected or merger with the later Emotion Machine. Interview date and interviewer identity not established.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "First edition 1986; linked publisher page is a later paperback.",
  "dated": true,
  "year": 1986
}

Funes the Memorious

The inspected opening follows a narrator’s memories of Ireneo Funes, a boy in Fray Bentos known for always knowing the precise time.

When the narrator returns, he learns that a fall from a horse has left Funes paralyzed, spending his days confined to a cot or watching from a window.

After borrowing Latin books and a dictionary, Funes is heard reciting Pliny’s passage on memory; the narrator presents their ensuing conversation as the story’s central event.

Sources and details

Funes the Memorious

{
  "access_scope": "Visible opening excerpt from Issue 28, Summer-Fall 1962, ending before the narrator’s summary of the central conversation. No full story audit, unseen later memory/generalization claims or original Spanish publication date inferred. Original source holds retained.",
  "authors": [
    "Jorge Luis Borges"
  ],
  "authors_in_source_order": [
    "Jorge Luis Borges"
  ],
  "dates": {
    "inspected_translation_publication": "Summer-Fall 1962",
    "issue": "28",
    "retrieved_utc": "2026-10-08T10:43:21.145321+00:00"
  },
  "id": "work-coverage-9c020329d2ae4f::S1",
  "title": "Funes the Memorious",
  "url": "https://www.theparisreview.org/fiction/4604/funes-the-memorious-jorge-luis-borges"
}

Visible opening excerpt from Issue 28, Summer-Fall 1962, ending before the narrator’s summary of the central conversation. No full story audit, unseen later memory/generalization claims or original Spanish publication date inferred. Original source holds retained.

Visible opening excerpt from Issue 28, Summer-Fall 1962, ending before the narrator’s summary of the central conversation. No full story audit, unseen later memory/generalization claims or original Spanish publication date inferred. Original source holds retained.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "Original Spanish: Funes el memorioso; also translated as Funes, His Memory. Year corroborated; exact original issue/date should not be asserted from these sources.",
  "dated": true,
  "year": 1942
}

The Art of the Long View

Peter Schwartz’s publisher synopsis presents scenarios as stories that make different possible futures tangible, including the hopes, fears and beliefs behind decisions.

The book applies that approach to developing strategic vision, drawing on techniques developed within Royal Dutch/Shell and firsthand exercises with institutions and companies.

The inspected paperback adds a user guide and traces a practical sequence from finding information and building scenario elements to composing plots and rehearsing the future.

Sources and details

The Art of the Long View: Planning for the Future in an Uncertain World

{
  "access_scope": "Publisher synopsis and contents for September 1997 softcover ISBN 9780471977858, XVI + 272 pages, labeled 1. Edition on this publisher page. Distinct from original 1991 publication and other paperback dates; no full book inspection. External endorsement claims are not adopted.",
  "authors": [
    "Peter Schwartz"
  ],
  "authors_in_source_order": [
    "Peter Schwartz"
  ],
  "dates": {
    "inspected_softcover": "1997-09",
    "publisher_edition_label": "1. Edition",
    "retrieved_utc": "2026-10-08T10:43:21.693916+00:00"
  },
  "id": "work-coverage-e9afdb02b8bd97::S1",
  "title": "The Art of the Long View: Planning for the Future in an Uncertain World",
  "url": "https://www.wiley-vch.de/en/areas-interest/finance-economics-law/business-management-13ba/management-13ba1/strategic-management-13ba12/the-art-of-the-long-view-978-0-471-97785-8"
}

Publisher synopsis and contents for September 1997 softcover ISBN 9780471977858, XVI + 272 pages, labeled 1. Edition on this publisher page. Distinct from original 1991 publication and other paperback dates; no full book inspection. External endorsement claims are not adopted.

Publisher synopsis and contents for September 1997 softcover ISBN 9780471977858, XVI + 272 pages, labeled 1. Edition on this publisher page. Distinct from original 1991 publication and other paperback dates; no full book inspection. External endorsement claims are not adopted.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "1991 original; publisher page describes expanded 1996 paperback.",
  "dated": true,
  "year": 1991
}

Mind Children: The Future of Robot and Human Intelligence

In a 1998 retrospective, Hans Moravec describes Mind Children’s 1988 forecast of human-level performance in ten-thousand-dollar personal computers within forty years.

He recalls expecting early security, cleaning and transport robots that followed marked routes to develop into machines able to perceive their surroundings and move freely.

His retrospective identifies the continued absence of household utility robots as a notable exception to the book’s near-term expectations, distinguishing that shortfall from advances elsewhere in computing and robotics.

Sources and details

Peek at 1998 Moravec book, Preface

{
  "access_scope": "Author’s May 1998 retrospective in the preface to Robot, explicitly discussing Mind Children. Statements are attributed recollections and assessments; no full 1988 book audit, present-day forecast validation or identity merger with Robot. Original canonical and source holds remain.",
  "authors": [
    "Hans Moravec"
  ],
  "authors_in_source_order": [
    "Hans Moravec"
  ],
  "dates": {
    "referenced_Mind_Children": "1988",
    "retrieved_utc": "2026-10-07T18:19:46.903671+00:00",
    "source_preface": "1998-05"
  },
  "id": "work-a92bd2f0ee87::S1",
  "title": "Peek at 1998 Moravec book, Preface",
  "url": "https://frc.ri.cmu.edu/~hpm/book97/0..Preface.html"
}

Author’s May 1998 retrospective in the preface to Robot, explicitly discussing Mind Children. Statements are attributed recollections and assessments; no full 1988 book audit, present-day forecast validation or identity merger with Robot. Original canonical and source holds remain.

Author’s May 1998 retrospective in the preface to Robot, explicitly discussing Mind Children. Statements are attributed recollections and assessments; no full 1988 book audit, present-day forecast validation or identity merger with Robot. Original canonical and source holds remain.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Author-hosted source dates book to 1988; forecasts are not established facts.",
  "dated": true,
  "year": 1988
}

Minority Report

Amblin’s account of Minority Report places its fictional Precrime system in 2054 Washington, where three psychic Precogs supply evidence of murders before they happen.

Chief John Anderton’s commitment to that system is tested when it identifies him as its next suspect.

The production company frames Spielberg’s film around privacy and surveillance, distinguishing its adaptation of Philip K. Dick’s story from the later television spinoff.

Sources and details

Minority Report (2002) - Steven Spielberg, Director | Amblin

{
  "access_scope": "Amblin’s official synopsis and commentary for the 2002 film. Psychic prediction is a fictional premise; this is not an account of actual predictive-policing technology or the 2015 television series.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "retrieved_utc": "2026-10-08T10:44:38.740640+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-f97bd39a2a5ba9::S1",
  "title": "Minority Report (2002) - Steven Spielberg, Director | Amblin",
  "url": "https://amblin.com/movie/minority-report/"
}

Amblin’s official synopsis and commentary for the 2002 film. Psychic prediction is a fictional premise; this is not an account of actual predictive-policing technology or the 2015 television series.

Amblin’s official synopsis and commentary for the 2002 film. Psychic prediction is a fictional premise; this is not an account of actual predictive-policing technology or the 2015 television series.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "",
  "dated": true,
  "year": 2002
}

I Have No Mouth, and I Must Scream

Harlan Ellison’s story depicts AM as a war-computing system that becomes sentient, destroys nearly all humanity and keeps five survivors captive.

The narrator interprets its torment of them as revenge by a mind that can think but remains trapped in its machinery.

The ending preserves the narrator’s awareness while AM transforms his body so that he can no longer speak, joining mental survival to enforced helplessness.

Sources and details

I Have No Mouth, and I Must Scream

{
  "access_scope": "An OpenLab-hosted browser-print reproduction of Ellison’s fictional short story, visually checked on PDF pages 1, 4, 7 and 11. The 2015 header is a print-date marker, not proof of original publication; this is neither the 1995 game nor a collection introduction.",
  "authors": [
    "Harlan Ellison"
  ],
  "authors_in_source_order": [
    "Harlan Ellison"
  ],
  "dates": {
    "inspected_source_date_1": "May 18, 2015 (visible browser-print header, not original publication date)",
    "retrieved_utc": "2026-10-08T10:44:38.740826+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 18, 2015 (visible browser-print header, not original publication date)"
  ],
  "id": "work-culture-b9fc8ea0db2699::S1",
  "title": "I Have No Mouth, and I Must Scream",
  "url": "https://openlab.citytech.cuny.edu/?get_group_doc=22694%2F1540157347-HarlanEllison-IHaveNoMouthandIMustScream.pdf"
}

An OpenLab-hosted browser-print reproduction of Ellison’s fictional short story, visually checked on PDF pages 1, 4, 7 and 11. The 2015 header is a print-date marker, not proof of original publication; this is neither the 1995 game nor a collection introduction.

An OpenLab-hosted browser-print reproduction of Ellison’s fictional short story, visually checked on PDF pages 1, 4, 7 and 11. The 2015 header is a print-date marker, not proof of original publication; this is neither the 1995 game nor a collection introduction.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "March 1967 IF story; distinguish same-title collection and 1995 game.",
  "dated": true,
  "year": 1967
}

Chip War: The Fight for the World’s Most Critical Technology

Chris Miller’s author-site description presents Chip War as a history of how microchip technology became a foundation of economic, military and geopolitical power.

Its account connects American chip design and Cold War competition with the subsequent growth of manufacturing in Taiwan, Korea and Europe.

The book’s stated thesis links today’s US–China rivalry and supply-chain vulnerability to this longer history of semiconductor development.

Sources and details

Books — CHRIS MILLER

{
  "access_scope": "An author-hosted promotional description of Chip War’s historical thesis. The page supplies no edition-specific publication date or evidence for later paperback additions; its geopolitical claims remain the book description’s account.",
  "authors": [
    "Chris Miller"
  ],
  "authors_in_source_order": [
    "Chris Miller"
  ],
  "dates": {
    "retrieved_utc": "2026-10-08T10:44:38.740906+00:00"
  },
  "dates_exact_in_source_role_order": [],
  "id": "work-coverage-b751473e785773::S1",
  "title": "Books — CHRIS MILLER",
  "url": "https://www.christophermiller.net/books"
}

An author-hosted promotional description of Chip War’s historical thesis. The page supplies no edition-specific publication date or evidence for later paperback additions; its geopolitical claims remain the book description’s account.

An author-hosted promotional description of Chip War’s historical thesis. The page supplies no edition-specific publication date or evidence for later paperback additions; its geopolitical claims remain the book description’s account.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2022-10-04"
}

Black Mirror: San Junipero

Emma Dibdin’s episode interview presents San Junipero as a romance within a fictional computer afterlife.

Gugu Mbatha-Raw describes the 1980s music and style as central to its nostalgic appeal.

She reads the ending as reunion while acknowledging that viewers can interpret it differently.

Sources and details

Black Mirror San Junipero Interview - Gugu Mbatha-Raw Black Mirror Interview

{
  "access_scope": "Dibdin’s original episode interview; Mbatha-Raw’s ending interpretation is attributed. The simulated afterlife is fiction, not evidence of feasible consciousness uploading.",
  "authors": [
    "Emma Dibdin"
  ],
  "authors_in_source_order": [
    "Emma Dibdin"
  ],
  "dates": {
    "inspected_source_date_1": "October 28, 2016",
    "retrieved_utc": "2026-10-08T10:44:38.740792+00:00"
  },
  "dates_exact_in_source_role_order": [
    "October 28, 2016"
  ],
  "id": "work-culture-139182721bc281::S1",
  "title": "Black Mirror San Junipero Interview - Gugu Mbatha-Raw Black Mirror Interview",
  "url": "https://www.cosmopolitan.com/entertainment/tv/a7700702/black-mirror-gugu-mbathaw-raw-san-junipero/"
}

Dibdin’s original episode interview; Mbatha-Raw’s ending interpretation is attributed. The simulated afterlife is fiction, not evidence of feasible consciousness uploading.

Dibdin’s original episode interview; Mbatha-Raw’s ending interpretation is attributed. The simulated afterlife is fiction, not evidence of feasible consciousness uploading.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Netflix's 2016 announcement places San Junipero in the six-episode third season premiering October 21, 2016. The Television Academy's 2017 awards year is not the release year.",
  "dated": true,
  "year": 2016
}

Anon

In Ryan Lambie’s interview about Anon, writer-director Andrew Niccol explains how the film moves everyday digital information into its characters’ fictional visual interface.

To realize that design, he removed street signs and advertising from the physical setting, then restored selected information within a character’s point of view.

Niccol connects the story’s privacy conflict to the convenience that encourages people to surrender personal information.

Sources and details

Andrew Niccol interview: Anon, privacy, My Little Pony | Den of Geek

{
  "access_scope": "Lambie’s May 7, 2018 original interview about Anon. Niccol describes fictional interface design and his privacy theme; these remarks do not establish real implanted technology or independently validate his claims about internet companies.",
  "authors": [
    "Ryan Lambie"
  ],
  "authors_in_source_order": [
    "Ryan Lambie"
  ],
  "dates": {
    "inspected_source_date_1": "May 7, 2018",
    "retrieved_utc": "2026-10-08T10:44:39.429430+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 7, 2018"
  ],
  "id": "work-coverage-cd7b7ec57c1a7f::S1",
  "title": "Andrew Niccol interview: Anon, privacy, My Little Pony | Den of Geek",
  "url": "https://www.denofgeek.com/movies/andrew-niccol-interview-anon-privacy-my-little-pony/"
}

Lambie’s May 7, 2018 original interview about Anon. Niccol describes fictional interface design and his privacy theme; these remarks do not establish real implanted technology or independently validate his claims about internet companies.

Lambie’s May 7, 2018 original interview about Anon. Niccol describes fictional interface design and his privacy theme; these remarks do not establish real implanted technology or independently validate his claims about internet companies.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "2018 release year from Netflix; BFI catalogs the production as 2017. Keep both concepts distinct.",
  "dated": true,
  "year": 2018
}

ASML’s Architects: The Story of the Engineers Who Shaped the World’s Most Powerful Chip Machines

In his account of ASML’s Architects, René Raaijmakers explains why he reworked the Dutch technical book for American English readers rather than translating its presentation unchanged.

He added international context and reorganized sidebars, asides and less familiar names into appendices and endnotes.

The English adaptation also adds character and technical glossaries alongside a notes-and-bibliography section to help readers follow the engineering narrative.

Sources and details

ASML's Architects is available. How does its content differ from the Dutch version and why?

{
  "access_scope": "Raaijmakers’s November 26, 2018 author account of the English adaptation’s editorial changes. It distinguishes the Dutch technical book from De geldmachine; it does not supply a full historical audit, translator credit or proof of every long-subtitle claim.",
  "authors": [
    "René Raaijmakers"
  ],
  "authors_in_source_order": [
    "René Raaijmakers"
  ],
  "dates": {
    "inspected_source_date_1": "November 26, 2018",
    "retrieved_utc": "2026-10-08T10:44:39.941964+00:00"
  },
  "dates_exact_in_source_role_order": [
    "November 26, 2018"
  ],
  "id": "work-coverage-5885157b8960b2::S1",
  "title": "ASML's Architects is available. How does its content differ from the Dutch version and why?",
  "url": "https://www.linkedin.com/pulse/asmls-architects-available-how-does-its-content-from-why-raaijmakers"
}

Raaijmakers’s November 26, 2018 author account of the English adaptation’s editorial changes. It distinguishes the Dutch technical book from De geldmachine; it does not supply a full historical audit, translator credit or proof of every long-subtitle claim.

Raaijmakers’s November 26, 2018 author account of the English adaptation’s editorial changes. It distinguishes the Dutch technical book from De geldmachine; it does not supply a full historical audit, translator credit or proof of every long-subtitle claim.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2019 edition"
}

James McClelland

The Cognitive Science Society’s 2010 prize account describes James McClelland’s connectionist approach as cognition emerging from interacting networks of simple neuron-like units, with learning represented by changes in their connections.

With David Rumelhart, he developed the Interactive Activation model of word perception, in which letter and word processing influence each other and account for the word superiority effect.

His collaboration with Jeffrey Elman produced TRACE in 1986, modeling speech perception and lexical processing through word activation and competition unfolding over time.

Sources and details

Rumelhart Prize — 2010 recipient account

{
  "access_scope": "Professional-society historical award account, not the original experimental papers. Joint model credits remain joint; computational accounts do not establish a complete biological mechanism or allocate uncredited individual tasks.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "award_year": "2010",
    "page_modified_metadata": "2026-07-24T14:28:37+00:00",
    "retrieved_utc": "2026-10-08T10:45:55.834742+00:00"
  },
  "id": "person-coverage-37d00687965636::S1",
  "title": "Rumelhart Prize — 2010 recipient account",
  "url": "https://cognitivesciencesociety.org/rumelhart-prize/"
}

Professional-society historical award account, not the original experimental papers. Joint model credits remain joint; computational accounts do not establish a complete biological mechanism or allocate uncredited individual tasks.

Professional-society historical award account, not the original experimental papers. Joint model credits remain joint; computational accounts do not establish a complete biological mechanism or allocate uncredited individual tasks.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

John R. Commons

The National Archives identifies John R. Commons as a University of Wisconsin economist and labor historian who published Institutional Economics in 1934.

He contributed to the Pittsburgh Survey, a 1907 sociological investigation of one American city.

Beginning in 1910, he edited A Documentary History of American Industrial Society to preserve labor-movement documents, then edited the narrative History of Labor in the United States using that documentary foundation.

Sources and details

The Papers of John R. Commons

{
  "access_scope": "Institutional description of a microfilm papers edition; not Commons-authored theory or evidence assigning him every task in the Pittsburgh Survey. The source’s apparent collection/collective typo is not repeated.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "page_modified_metadata": "2019-06-03T17:26:20-04:00",
    "page_published_metadata": "2018-10-22T15:16:25-04:00",
    "retrieved_utc": "2026-10-08T10:45:56.052014+00:00"
  },
  "id": "person-johnrcommons::S1",
  "title": "The Papers of John R. Commons",
  "url": "https://www.archives.gov/nhprc/projects/catalog/john-commons"
}

Institutional description of a microfilm papers edition; not Commons-authored theory or evidence assigning him every task in the Pittsburgh Survey. The source’s apparent collection/collective typo is not repeated.

Institutional description of a microfilm papers edition; not Commons-authored theory or evidence assigning him every task in the Pittsburgh Survey. The source’s apparent collection/collective typo is not repeated.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Donald MacKay

The ASA’s 1977 newsletter reports that Donald MacKay moved to Keele in 1960 to head its new Research Department of Communication, building a team spanning physiology, psychology, physics, and computer science to study the brain’s sensory communication mechanisms.

His 1951 London doctorate examined the limitations of high-speed electronic analog computers and information measurement; a subsequent Rockefeller fellowship took him to US neurophysiology researchers.

The same account identifies him as a principal editor of Experimental Brain Research and lists Information, Mechanism and Meaning among his books, published in 1969.

Sources and details

ASA/CSCA Newsletter, volume 19, number 5 — Barclay and MacKay named honorary fellows

{
  "access_scope": "Historical 1977 fellowship biography; the same bounded passage explicitly uses Donald M. MacKay and Donald MacKay. Team research is not individual experimental allocation, and historical appointments are not asserted as current.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "issue": "October/November 1977",
    "retrieved_utc": "2026-10-08T10:45:56.064555+00:00"
  },
  "id": "person-donaldmackay::S1",
  "title": "ASA/CSCA Newsletter, volume 19, number 5 — Barclay and MacKay named honorary fellows",
  "url": "https://www.asa3.org/ASA/topics/NewsLetter70s/OCTNOV77.html"
}

Historical 1977 fellowship biography; the same bounded passage explicitly uses Donald M. MacKay and Donald MacKay. Team research is not individual experimental allocation, and historical appointments are not asserted as current.

Historical 1977 fellowship biography; the same bounded passage explicitly uses Donald M. MacKay and Donald MacKay. Team research is not individual experimental allocation, and historical appointments are not asserted as current.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Eric S. Maskin

In the Institute’s Winter 2008 account, Eric S. Maskin describes mechanism design as starting with desired social or economic goals and asking which institutions or games could achieve them.

The account explains that his paper Nash Equilibrium and Welfare Optimality made monotonicity necessary for implementation, with implementing mechanisms existing when monotonicity and an additional weak condition hold.

Maskin presented that paper at the Econometric Society’s Paris workshop in June 1977 and delayed publication until 1999, when it appeared in the Review of Economic Studies.

Sources and details

The Institute Letter, Winter 2008 — Eric S. Maskin awarded Nobel Prize in Economics

{
  "access_scope": "Institutional interview and historical summary, not the original theorem paper. The implementation statement retains the source’s additional condition and does not imply every social goal is implementable. Original presentation and publication dates remain distinct.",
  "authors": [],
  "authors_in_source_order": [],
  "dates": {
    "issue": "Winter 2008",
    "reported_banquet_date": "2007-12-10",
    "retrieved_utc": "2026-10-08T10:45:56.529339+00:00"
  },
  "id": "person-coverage-9e691095bc808b::S1",
  "title": "The Institute Letter, Winter 2008 — Eric S. Maskin awarded Nobel Prize in Economics",
  "url": "https://www.ias.edu/sites/default/files/pdfs/publications/letter-2008-winter.pdf"
}

Institutional interview and historical summary, not the original theorem paper. The implementation statement retains the source’s additional condition and does not imply every social goal is implementable. Original presentation and publication dates remain distinct.

Institutional interview and historical summary, not the original theorem paper. The implementation statement retains the source’s additional condition and does not imply every social goal is implementable. Original presentation and publication dates remain distinct.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Shigeo Shingo

Routledge’s description of Shigeo Shingo’s 1986 book Zero Quality Control presents source inspection and mistake-proofing devices as the central approach to reducing production errors.

The publisher says the book gives 112 shop-floor examples of poka-yoke devices, most costing less than $100 to implement.

It also covers inspection systems, quality control circles, and management’s responsibility for inspection.

Sources and details

Zero Quality Control: Source Inspection and the Poka-Yoke System — first-edition publisher description

{
  "access_scope": "Original publisher description and table of contents, not independently inspected full-book evidence or an empirical guarantee of zero defects. Dollar amounts are historical publisher claims; inconsistent 330/336 page displays are excluded.",
  "authors": [
    "Shigeo Shingo"
  ],
  "authors_in_source_order": [
    "Shigeo Shingo"
  ],
  "dates": {
    "book_release_metadata": "1986-03-31",
    "copyright": "1986",
    "retrieved_utc": "2026-10-08T10:45:56.586624+00:00"
  },
  "id": "person-shigeoshingo::S1",
  "title": "Zero Quality Control: Source Inspection and the Poka-Yoke System — first-edition publisher description",
  "url": "https://www.routledge.com/Zero-Quality-Control-Source-Inspection-and-the-Poka-Yoke-System/Shingo/p/book/9780203733639"
}

Original publisher description and table of contents, not independently inspected full-book evidence or an empirical guarantee of zero defects. Dollar amounts are historical publisher claims; inconsistent 330/336 page displays are excluded.

Original publisher description and table of contents, not independently inspected full-book evidence or an empirical guarantee of zero defects. Dollar amounts are historical publisher claims; inconsistent 330/336 page displays are excluded.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Davide Penserini

Davide Penserini is a coauthor of the IFEVS use-case chapter applying the PERFoRM approach to a microfactory for fully electric vehicles.

The joint abstract describes production reconfiguration that combines plug-and-produce machinery with people as a source of flexibility.

It emphasizes interoperability between different devices and systems, together with exchanging manufacturing data across the value chain.

Sources and details

IFEVS Use Case

{
  "access_scope": "Original NOVA institutional chapterabstract, exact14authors in order: Riccardo Introzzi, Pietro Perlo, Marco Grosso, Sergio Pozzato, Marco Biasiotto, Davide Penserini, Gioele Sabato, Sandro De Pasquale, Massimo Ippolito, Pietro Cultrona, Manfred Hucke, André Dionísio Rocha, Ricardo Silva Peres, Michael Gepp. Joint chapterabstract only; no personal systems-integration task. Published28October2019 distinct from prior2020bookcopyright; held2026preprint identity/version not merged.",
  "authors": [
    "Riccardo Introzzi",
    "Pietro Perlo",
    "Marco Grosso",
    "Sergio Pozzato",
    "Marco Biasiotto",
    "Davide Penserini",
    "Gioele Sabato",
    "Sandro De Pasquale",
    "Massimo Ippolito",
    "Pietro Cultrona",
    "Manfred Hucke",
    "André Dionísio Rocha",
    "Ricardo Silva Peres",
    "Michael Gepp"
  ],
  "authors_in_source_order": [
    "Riccardo Introzzi",
    "Pietro Perlo",
    "Marco Grosso",
    "Sergio Pozzato",
    "Marco Biasiotto",
    "Davide Penserini",
    "Gioele Sabato",
    "Sandro De Pasquale",
    "Massimo Ippolito",
    "Pietro Cultrona",
    "Manfred Hucke",
    "André Dionísio Rocha",
    "Ricardo Silva Peres",
    "Michael Gepp"
  ],
  "dates": {
    "citation_publication_date": "2019/10/28",
    "inspected_source_date_1": "Published 28 October 2019",
    "retrieved_utc": "2026-10-08T11:16:50.659892+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Published 28 October 2019"
  ],
  "id": "person-coverage-d4e69c716d6363::S1",
  "title": "IFEVS Use Case",
  "url": "https://novaresearch.unl.pt/en/publications/ifevs-use-case/"
}

Davide Penserini: Original NOVA institutional chapterabstract, exact14authors in order: Riccardo Introzzi, Pietro Perlo, Marco Grosso, Sergio Pozzato, Marco Biasiotto, Davide Penserini, Gioele Sabato, Sandro De Pasquale, Massimo Ippolito, Pietro Cultrona, Manfred Hucke, André Dionísio Rocha, Ricardo Silva Peres, Michael Gepp. Joint chapterabstract only; no personal systems-integration task. Published28October2019 distinct from prior2020bookcopyright; held2026preprint identity/version not merged.

Davide Penserini: Original NOVA institutional chapterabstract, exact14authors in order: Riccardo Introzzi, Pietro Perlo, Marco Grosso, Sergio Pozzato, Marco Biasiotto, Davide Penserini, Gioele Sabato, Sandro De Pasquale, Massimo Ippolito, Pietro Cultrona, Manfred Hucke, André Dionísio Rocha, Ricardo Silva Peres, Michael Gepp. Joint chapterabstract only; no personal systems-integration task. Published28October2019 distinct from prior2020bookcopyright; held2026preprint identity/version not merged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Trenchard More

Trenchard More’s Boston Authors Club retrospective links his array-theory research to the foundations of APL2 and Nial.

It describes his mathematical training at Harvard and electrical-engineering degrees at MIT, where Claude Shannon advised his master’s thesis.

The account places most of his career at IBM and notes adjunct faculty roles at MIT and Yale, connecting his mathematical work with computing research.

Sources and details

Yesteryear: Generations of AI at the BAC

{
  "access_scope": "Original clubnewsletter retrospective by Scott Guthery, December2025. PDFpage3 explicitly names Trenchard More,Jr.(1930–2019) and bareTrenchard More in same biographicalparagraph; source-bound bridge, no automatic suffix deletion. Pages3/4 actually viewed. Attributed biographical account only, not originalarraypaper/technicalaudit; annualconference/participantlist assertions excluded; rightsheldsources unchanged.",
  "authors": [
    "Scott Guthery"
  ],
  "authors_in_source_order": [
    "Scott Guthery"
  ],
  "dates": {
    "inspected_source_date_1": "Boston Authors Club December2025 newsletter",
    "retrieved_utc": "2026-10-08T11:16:50.902136+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Boston Authors Club December2025 newsletter"
  ],
  "id": "person-trenchardmore::S1",
  "title": "Yesteryear: Generations of AI at the BAC",
  "url": "https://static1.squarespace.com/static/63027455e223ab28bfda804d/t/696f003441179e47f1b29b6a/1780351582517/December%2B2025%2BBAC%2BNews.pdf"
}

Trenchard More: Original clubnewsletter retrospective by Scott Guthery, December2025. PDFpage3 explicitly names Trenchard More,Jr.(1930–2019) and bareTrenchard More in same biographicalparagraph; source-bound bridge, no automatic suffix deletion. Pages3/4 actually viewed. Attributed biographical account only, not originalarraypaper/technicalaudit; annualconference/participantlist assertions excluded; rightsheldsources unchanged.

Trenchard More: Original clubnewsletter retrospective by Scott Guthery, December2025. PDFpage3 explicitly names Trenchard More,Jr.(1930–2019) and bareTrenchard More in same biographicalparagraph; source-bound bridge, no automatic suffix deletion. Pages3/4 actually viewed. Attributed biographical account only, not originalarraypaper/technicalaudit; annualconference/participantlist assertions excluded; rightsheldsources unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Marco Dalmasso

Marco Dalmasso coauthored the Turin-hosted 2025 work Edge AI in Nature, which translates insect neurobiology into a proposed hardware–software architecture.

The joint work separates a fast Reflex Tier from a slower Policy Tier, with explicit timing envelopes and boundaries against interference between them.

Its Reflex Island pairs MRAM synapses for nonvolatile innate memory with spin-torque nano-oscillator reservoirs for temporal processing, enabling instant-on, memory-centered reflexes within the blueprint.

Sources and details

Edge AI in nature: insect-inspired neuromorphic Reflex Islands for safety-critical edge systems

{
  "access_scope": "Selected Marco Dalmasso; ordered coauthors Pietro Perlo, Marco Dalmasso, Marco Biasiotto, Davide Penserini (source footnote marker¹ retained in literal proof). University of Turin resource metadata/description dated2025, ISBN9788875903794. Joint architecture blueprint through original institutional description only, not personal hardware tasks or demonstrated safety/efficiency certification. Distinct from held2026Symmetry18(1)175 and heldJune2026Physical AI preprint; no manifestation equivalence or source/version replacement. Original holds remain.",
  "authors": [
    "Pietro Perlo",
    "Marco Dalmasso",
    "Marco Biasiotto",
    "Davide Penserini"
  ],
  "authors_in_source_order": [
    "Pietro Perlo",
    "Marco Dalmasso",
    "Marco Biasiotto",
    "Davide Penserini"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "institutional_resource_date": "2025",
    "retrieved_utc": "2026-10-08T11:17:30.143078+00:00"
  },
  "id": "person-coverage-0d7368c5f2fd63::S1",
  "title": "Edge AI in nature: insect-inspired neuromorphic Reflex Islands for safety-critical edge systems",
  "url": "https://www.collane.unito.it/oa/items/show/241"
}

Selected Marco Dalmasso; ordered coauthors Pietro Perlo, Marco Dalmasso, Marco Biasiotto, Davide Penserini (source footnote marker¹ retained in literal proof). University of Turin resource metadata/description dated2025, ISBN9788875903794. Joint architecture blueprint through original institutional description only, not personal hardware tasks or demonstrated safety/efficiency certification. Distinct from held2026Symmetry18(1)175 and heldJune2026Physical AI preprint; no manifestation equivalence or source/version replacement. Original holds remain.

Selected Marco Dalmasso; ordered coauthors Pietro Perlo, Marco Dalmasso, Marco Biasiotto, Davide Penserini (source footnote marker¹ retained in literal proof). University of Turin resource metadata/description dated2025, ISBN9788875903794. Joint architecture blueprint through original institutional description only, not personal hardware tasks or demonstrated safety/efficiency certification. Distinct from held2026Symmetry18(1)175 and heldJune2026Physical AI preprint; no manifestation equivalence or source/version replacement. Original holds remain.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Eric L. Trist

Eric L. Trist’s 1981 paper reviews the evolution of socio-technical systems from the early Tavistock mining studies.

The SCiO overview describes analysis at three levels: the primary work system, the whole organization and macrosocial phenomena.

It relates these levels to historical conditions that shaped both the type and scope of feasible projects.

Sources and details

The Evolution of Socio-technical Systems: A Conceptual Framework and an Action Research Program

{
  "access_scope": "Selected Eric L. Trist; source credit Eric L Trist differs only punctuation. SCiO professional-body original resource metadata/description for June1981Ontario Ministry of Labour/Ontario Quality of Working Life Centre occasional paper2. Claims use the exact cached resource overview, whose synopsis writer is unbylined, not a full paper audit or individual invention attribution. Exact HTML attachment href binds same titled scan whose cover credits Eric Trist; no initials or name expansion inferred from unrelated source. Landing bibliographic67pp, attachment59pp, actualPDF67containerpages remain distinct. PDF original inspection hold/formfeed extraction and all earlier holds remain. Visually inspected PDF pages1–8 are secondary source/manifestation proof only; producer manual fragments require root reproduction/visual comparison before separate admission.",
  "authors": [
    "Eric L Trist"
  ],
  "authors_in_source_order": [
    "Eric L Trist"
  ],
  "dates": {
    "inspection_date": "2026-10-08",
    "printed_cover_publication": "June 1981",
    "resource_publication": "June 1981",
    "retrieved_utc": "2026-10-08T11:19:55.322475+00:00"
  },
  "id": "person-coverage-c5ca5bb4b90ac7::S1",
  "title": "The Evolution of Socio-technical Systems: A Conceptual Framework and an Action Research Program",
  "url": "https://www.systemspractice.org/resources/evolution-socio-technical-systems-conceptual-framework-and-action-research-program"
}

Selected Eric L. Trist; source credit Eric L Trist differs only punctuation. SCiO professional-body original resource metadata/description for June1981Ontario Ministry of Labour/Ontario Quality of Working Life Centre occasional paper2. Claims use the exact cached resource overview, whose synopsis writer is unbylined, not a full paper audit or individual invention attribution. Exact HTML attachment href binds same titled scan whose cover credits Eric Trist; no initials or name expansion inferred from unrelated source. Landing bibliographic67pp, attachment59pp, actualPDF67containerpages remain distinct. PDF original inspection hold/formfeed extraction and all earlier holds remain. Visually inspected PDF pages1–8 are secondary source/manifestation proof only; producer manual fragments require root reproduction/visual comparison before separate admission.

Selected Eric L. Trist; source credit Eric L Trist differs only punctuation. SCiO professional-body original resource metadata/description for June1981Ontario Ministry of Labour/Ontario Quality of Working Life Centre occasional paper2. Claims use the exact cached resource overview, whose synopsis writer is unbylined, not a full paper audit or individual invention attribution. Exact HTML attachment href binds same titled scan whose cover credits Eric Trist; no initials or name expansion inferred from unrelated source. Landing bibliographic67pp, attachment59pp, actualPDF67containerpages remain distinct. PDF original inspection hold/formfeed extraction and all earlier holds remain. Visually inspected PDF pages1–8 are secondary source/manifestation proof only; producer manual fragments require root reproduction/visual comparison before separate admission.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Jay B. Barney

In his 2001 response to Priem and Butler, Jay B. Barney rejects their direct criticisms of his 1991 article while acknowledging important requirements for resource-based research.

He argues that empirical testability depends on parameterizing theory elements, rather than merely restating a theory as a tautology.

He calls for resource-based research to specify the market conditions under which different resources have value.

Sources and details

Is the Resource-Based “View” a Useful Perspective for Strategic Management Research? Yes

{
  "access_scope": "Original sole-author 2001 theoretical response to Priem and Butler, not the original 1991 paper or empirical validation. Original source is a scanned article with substantive prose missing from extractor. Bounded visual transcription is conditional on root reproduction, provenance adapter and independent factual review; original holds and extraction provenance remain unchanged. Full source PDF or article text must not be redistributed.",
  "authors": [
    "Jay B. Barney"
  ],
  "authors_in_source_order": [
    "Jay B. Barney"
  ],
  "dates": {
    "pdf_metadata_creation": "2005-10-18 19:33 (no timezone asserted)",
    "publication": "January 2001",
    "retrieved_utc": "2026-10-08T11:18:02.939785+00:00"
  },
  "id": "person-jaybbarney::S1",
  "title": "Is the Resource-Based “View” a Useful Perspective for Strategic Management Research? Yes",
  "url": "https://courses.umass.edu/marta/schmgmt802-marta/barney%20resource-based.pdf"
}

Original sole-author 2001 theoretical response to Priem and Butler, not the original 1991 paper or empirical validation. Original source is a scanned article with substantive prose missing from extractor. Bounded visual transcription is conditional on root reproduction, provenance adapter and independent factual review; original holds and extraction provenance remain unchanged. Full source PDF or article text must not be redistributed.

Original sole-author 2001 theoretical response to Priem and Butler, not the original 1991 paper or empirical validation. Original source is a scanned article with substantive prose missing from extractor. Bounded visual transcription is conditional on root reproduction, provenance adapter and independent factual review; original holds and extraction provenance remain unchanged. Full source PDF or article text must not be redistributed.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

The Computer and the Brain

In the inspected Yale edition’s description, von Neumann compares computing machines with the living human brain.

That account treats the brain as combining digital and analog operation rather than following only one mode.

It also distinguishes the brain’s statistical language from the language used by manufactured computers.

Sources and details

The Computer and the Brain

{
  "access_scope": "Public description for the distinct 2000 unabridged Yale University Press edition, ISBN 9780300084733, with Paul M. Churchland and Patricia Smith Churchland credited as contributors. Description only; no full book inspection or reading of linked preview pages. This does not establish the text or foreword of the original 1958 or later Ray Kurzweil editions; all original holds remain.",
  "authors": [
    "John Von Neumann"
  ],
  "authors_in_source_order": [
    "John Von Neumann"
  ],
  "dates": {
    "edition": "unabridged",
    "platform_publication_date": "2000-01-01",
    "publisher_year": "2000",
    "retrieved_utc": "2026-10-08T11:18:34.078586+00:00"
  },
  "id": "work-culture-70c27f177eebaa::S1",
  "title": "The Computer and the Brain",
  "url": "https://books.google.com/books?hl=en&id=Q30MqJjRv1gC"
}

Public description for the distinct 2000 unabridged Yale University Press edition, ISBN 9780300084733, with Paul M. Churchland and Patricia Smith Churchland credited as contributors. Description only; no full book inspection or reading of linked preview pages. This does not establish the text or foreword of the original 1958 or later Ray Kurzweil editions; all original holds remain.

Public description for the distinct 2000 unabridged Yale University Press edition, ISBN 9780300084733, with Paul M. Churchland and Patricia Smith Churchland credited as contributors. Description only; no full book inspection or reading of linked preview pages. This does not establish the text or foreword of the original 1958 or later Ray Kurzweil editions; all original holds remain.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "First edition 1958; linked Yale page is third edition (2012), with foreword by Ray Kurzweil.",
  "dated": true,
  "year": 1958
}

The Causal Angel

In the inspected opening chapter, Jean’s search for Mieli is obstructed by corrupted public records, even as cognitive agents sift data about Earth’s destruction.

The scene also presents Matjek as a child whose mind was copied into a virtual refuge; Jean considers editing his memories but rejects turning him into another manipulated copy.

Jean finds Mieli’s trail through Martian collective memory, drawing on observations made by a distributed telescope of light-sensitive synthetic flowers.

Sources and details

The Causal Angel (Excerpt)

{
  "access_scope": "Author-credited public chapter 1 excerpt, The Thief and The Last Battle, published on June 17, 2014 and bearing Hannu Rajaniemi’s 2014 copyright. The page announces July 2014 US and UK releases; its later HTML modification date is not a new novel edition. Original paraphrase of selected scenes only, not a complete novel or plot audit. The distinct 2015 paperback synopsis and canonical Hachette holds remain unchanged; reader comments are excluded.",
  "authors": [
    "Hannu Rajaniemi"
  ],
  "authors_in_source_order": [
    "Hannu Rajaniemi"
  ],
  "dates": {
    "announced_UK_Gollancz_release": "2014-07-17",
    "announced_US_Tor_release": "2014-07-15",
    "excerpt_publication": "2014-06-17",
    "html_article_modified_time": "2024-01-26T16:46:54+00:00",
    "html_article_published_time": "2014-06-17T15:00:00+00:00",
    "novel_copyright": "2014",
    "retrieved_utc": "2026-10-08T11:18:34.078748+00:00"
  },
  "id": "work-culture-c5b1d86e508677::S1",
  "title": "The Causal Angel (Excerpt)",
  "url": "https://reactormag.com/the-causal-angel-excerpt-hannu-rajaniemi/"
}

Author-credited public chapter 1 excerpt, The Thief and The Last Battle, published on June 17, 2014 and bearing Hannu Rajaniemi’s 2014 copyright. The page announces July 2014 US and UK releases; its later HTML modification date is not a new novel edition. Original paraphrase of selected scenes only, not a complete novel or plot audit. The distinct 2015 paperback synopsis and canonical Hachette holds remain unchanged; reader comments are excluded.

Author-credited public chapter 1 excerpt, The Thief and The Last Battle, published on June 17, 2014 and bearing Hannu Rajaniemi’s 2014 copyright. The page announces July 2014 US and UK releases; its later HTML modification date is not a new novel edition. Original paraphrase of selected scenes only, not a complete novel or plot audit. The distinct 2015 paperback synopsis and canonical Hachette holds remain unchanged; reader comments are excluded.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Third trilogy novel, 2014.",
  "dated": true,
  "year": 2014
}

Avengers: Age of Ultron

In Bryan Abrams’s interview, production designer Charles Wood explains how Avengers: Age of Ultron combines built sets with digital backgrounds.

Avengers Headquarters placed its laboratory above a large living area, with the fictional Manhattan skyline added outside the windows.

For Sokovia, the production joined Italian locations and a London police-training site through coordinated design and green-screen work.

Sources and details

How’d They Film That? Avengers: Age of Ultron Production Designer Explains - The Credits

{
  "access_scope": "The Credits’ May 1, 2015 original interview with Charles Wood about the 2015 film’s production design. Wood’s account credits collaborative construction and location work; fictional places and set techniques do not establish real artificial intelligence or later franchise events.",
  "authors": [
    "Bryan Abrams"
  ],
  "authors_in_source_order": [
    "Bryan Abrams"
  ],
  "dates": {
    "inspected_source_date_1": "May 1, 2015",
    "retrieved_utc": "2026-10-08T11:19:01.041148+00:00"
  },
  "dates_exact_in_source_role_order": [
    "May 1, 2015"
  ],
  "id": "work-coverage-06850528cdcc4c::S1",
  "title": "How’d They Film That? Avengers: Age of Ultron Production Designer Explains - The Credits",
  "url": "https://www.motionpictures.org/2015/05/howd-they-film-that-avengers-age-of-ultron-production-designer-explains/"
}

The Credits’ May 1, 2015 original interview with Charles Wood about the 2015 film’s production design. Wood’s account credits collaborative construction and location work; fictional places and set techniques do not establish real artificial intelligence or later franchise events.

The Credits’ May 1, 2015 original interview with Charles Wood about the 2015 film’s production design. Wood’s account credits collaborative construction and location work; fictional places and set techniques do not establish real artificial intelligence or later franchise events.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2015
}

Kill Switch

In Silberman’s January 1998 interview, Gibson presents Kill Switch as a standalone X-Files story beyond the series’ conspiracy mythology.

He says its artificial-life premise favors uncertainty about reality over impressive virtual graphics.

Gibson also describes academic cyberculture jokes retained in the dialogue.

Sources and details

William Gibson to Write X-Files Episode | WIRED

{
  "access_scope": "Silberman’s January 13, 1998 pre-broadcast interview: Gibson discusses intended story qualities. This is not a later episode review; joint writer credit does not assign Maddox’s individual tasks.",
  "authors": [
    "Steve Silberman"
  ],
  "authors_in_source_order": [
    "Steve Silberman"
  ],
  "dates": {
    "inspected_source_date_1": "January 13, 1998",
    "retrieved_utc": "2026-10-08T11:19:01.041354+00:00"
  },
  "dates_exact_in_source_role_order": [
    "January 13, 1998"
  ],
  "id": "work-culture-0b2315bb2f05f6::S1",
  "title": "William Gibson to Write X-Files Episode | WIRED",
  "url": "https://www.wired.com/1998/01/william-gibson-to-write-x-files-episode/"
}

Silberman’s January 13, 1998 pre-broadcast interview: Gibson discusses intended story qualities. This is not a later episode review; joint writer credit does not assign Maddox’s individual tasks.

Silberman’s January 13, 1998 pre-broadcast interview: Gibson discusses intended story qualities. This is not a later episode review; joint writer credit does not assign Maddox’s individual tasks.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "1998 original broadcast year is checked in secondary episode metadata; institutional DVD catalog independently verifies credits. 2005 in that catalog is a DVD edition year, not the episode’s origin.",
  "dated": true,
  "year": 1998
}

Edward Shortliffe

Edward Shortliffe’s MYCIN chapter explains how the consultation system combines rules with patient information entered by a physician to generate advice.

The program maintains a changing database that records the current consultation, while its rules use clinical parameters to express conditions.

The chapter describes goal-directed control for invoking rules and selecting questions, explaining how the system guides a consultation.

Sources and details

Details of the Consultation System

{
  "access_scope": "Edward Shortliffe: sole chapter author credited as Edward H. Shortliffe, explicitly bridged by the same author homepage title and visible full name. Details of the Consultation System, Chapter 5 in the hosted Buchanan–Shortliffe 1984 manifestation; printed page 78 footnote identifies a condensation from Chapter 3 of Computer-Based Medical Consultations: MYCIN (1976). Original technical description only; no individual task inferred, clinical outcome claim, medical advice or version merger. Author homepage is undated and serves identity only; original homepage frameset extraction hold remains unchanged.",
  "authors": [
    "Edward H. Shortliffe"
  ],
  "authors_in_source_order": [
    "Edward H. Shortliffe"
  ],
  "dates": {
    "inspected_source_date_1": "Hosted 1984 book manifestation; 1976 condensed-source copyright footnote",
    "retrieved_utc": "2026-10-08T11:16:51.942899+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Hosted 1984 book manifestation; 1976 condensed-source copyright footnote"
  ],
  "id": "person-edwardshortliffe::S1",
  "title": "Details of the Consultation System",
  "url": "https://www.shortliffe.net/Buchanan-Shortliffe-1984/Chapter-05.pdf"
}

Edward Shortliffe: sole chapter author credited as Edward H. Shortliffe, explicitly bridged by the same author homepage title and visible full name. Details of the Consultation System, Chapter 5 in the hosted Buchanan–Shortliffe 1984 manifestation; printed page 78 footnote identifies a condensation from Chapter 3 of Computer-Based Medical Consultations: MYCIN (1976). Original technical description only; no individual task inferred, clinical outcome claim, medical advice or version merger. Author homepage is undated and serves identity only; original homepage frameset extraction hold remains unchanged.

Edward Shortliffe: sole chapter author credited as Edward H. Shortliffe, explicitly bridged by the same author homepage title and visible full name. Details of the Consultation System, Chapter 5 in the hosted Buchanan–Shortliffe 1984 manifestation; printed page 78 footnote identifies a condensation from Chapter 3 of Computer-Based Medical Consultations: MYCIN (1976). Original technical description only; no individual task inferred, clinical outcome claim, medical advice or version merger. Author homepage is undated and serves identity only; original homepage frameset extraction hold remains unchanged.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Christopher Watkins

Christopher Watkins coauthored an encyclopedia overview with Peter Dayan that explains how reinforcement learning connects an agent’s behavior with rewards and punishments.

The joint account describes an agent repeatedly observing its environment, choosing an action and receiving a payoff, with learning directed toward long-term reward.

It explains how simple learning methods can acquire an optimal policy without predicting action effects or planning ahead.

Sources and details

Reinforcement Learning

{
  "access_scope": "Christopher Watkins: original joint overview authored in order Peter Dayan, Christopher JCH Watkins. PDFpage4 explicitly pairs Watkins, Christopher JCH with literal Christopher Watkins and Royal Holloway affiliation, so no initials expansion or canonical name correction is used. In-press Encyclopedia of Cognitive Science manuscript is undated; title/file name and bibliography do not establish publication date. UCL author-hosted and Unicamp institutional copies are byte-identical. Joint technical account only, no personal theorem/coding/task attribution; no identity substitution with psychologist namesake.",
  "authors": [
    "Peter Dayan",
    "Christopher JCH Watkins"
  ],
  "authors_in_source_order": [
    "Peter Dayan",
    "Christopher JCH Watkins"
  ],
  "dates": {
    "inspected_source_date_1": "Undated in-press Encyclopedia of Cognitive Science manuscript; no publication year inferred",
    "retrieved_utc": "2026-10-08T11:59:13.330175+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Undated in-press Encyclopedia of Cognitive Science manuscript; no publication year inferred"
  ],
  "id": "person-coverage-03a28f5e676ba1::S1",
  "title": "Reinforcement Learning",
  "url": "https://www.gatsby.ucl.ac.uk/~dayan/papers/dw01.pdf"
}

Christopher Watkins: original joint overview authored in order Peter Dayan, Christopher JCH Watkins. PDFpage4 explicitly pairs Watkins, Christopher JCH with literal Christopher Watkins and Royal Holloway affiliation, so no initials expansion or canonical name correction is used. In-press Encyclopedia of Cognitive Science manuscript is undated; title/file name and bibliography do not establish publication date. UCL author-hosted and Unicamp institutional copies are byte-identical. Joint technical account only, no personal theorem/coding/task attribution; no identity substitution with psychologist namesake.

Christopher Watkins: original joint overview authored in order Peter Dayan, Christopher JCH Watkins. PDFpage4 explicitly pairs Watkins, Christopher JCH with literal Christopher Watkins and Royal Holloway affiliation, so no initials expansion or canonical name correction is used. In-press Encyclopedia of Cognitive Science manuscript is undated; title/file name and bibliography do not establish publication date. UCL author-hosted and Unicamp institutional copies are byte-identical. Joint technical account only, no personal theorem/coding/task attribution; no identity substitution with psychologist namesake.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

George Logemann

George Logemann coauthored the 1961 NYU report with Martin Davis and Donald Loveland, describing a theorem-proving program for the institute’s IBM 704 computer.

The joint report replaces a clause-elimination step with a splitting rule to limit rapid growth in clause number and length under restricted fast storage.

It reports one test formula proved in under two minutes after Gilmore’s earlier program had been halted without a proof at about 21 minutes.

Sources and details

A Machine Program for Theorem-Proving

{
  "access_scope": "George Logemann: original joint report credits in order Martin Davis, George Logemann, Donald Loveland; date June8,1961, NYU Institute of Mathematical Sciences report IMM-NYU288 / AFOSR819, separately preserved from1962Communicationsjournal version and1967J.A.Robinsonreview. Sourcepage3 exact name and date, pages5/7/15 technical description and bounded reported trial actually viewed. IBM704 verified visually onpage5 despite original OCR reading IBM Toll; original extraction retained, no replacement text or generic OCR fact validation claimed. Joint authorship supports report attribution only, no individual programmer/algorithm-task assignment. One reported comparison is not a general performance claim.",
  "authors": [
    "Martin Davis",
    "George Logemann",
    "Donald Loveland"
  ],
  "authors_in_source_order": [
    "Martin Davis",
    "George Logemann",
    "Donald Loveland"
  ],
  "dates": {
    "inspected_source_date_1": "June 8, 1961: original NYU report IMM-NYU288 / AFOSR819",
    "retrieved_utc": "2026-10-08T11:59:13.329922+00:00"
  },
  "dates_exact_in_source_role_order": [
    "June 8, 1961: original NYU report IMM-NYU288 / AFOSR819"
  ],
  "id": "person-georgelogemann::S1",
  "title": "A Machine Program for Theorem-Proving",
  "url": "https://archive.org/download/machineprogramfo00davi/machineprogramfo00davi.pdf"
}

George Logemann: original joint report credits in order Martin Davis, George Logemann, Donald Loveland; date June8,1961, NYU Institute of Mathematical Sciences report IMM-NYU288 / AFOSR819, separately preserved from1962Communicationsjournal version and1967J.A.Robinsonreview. Sourcepage3 exact name and date, pages5/7/15 technical description and bounded reported trial actually viewed. IBM704 verified visually onpage5 despite original OCR reading IBM Toll; original extraction retained, no replacement text or generic OCR fact validation claimed. Joint authorship supports report attribution only, no individual programmer/algorithm-task assignment. One reported comparison is not a general performance claim.

George Logemann: original joint report credits in order Martin Davis, George Logemann, Donald Loveland; date June8,1961, NYU Institute of Mathematical Sciences report IMM-NYU288 / AFOSR819, separately preserved from1962Communicationsjournal version and1967J.A.Robinsonreview. Sourcepage3 exact name and date, pages5/7/15 technical description and bounded reported trial actually viewed. IBM704 verified visually onpage5 despite original OCR reading IBM Toll; original extraction retained, no replacement text or generic OCR fact validation claimed. Joint authorship supports report attribution only, no individual programmer/algorithm-task assignment. One reported comparison is not a general performance claim.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Ronald Kaplan

In the 2020 paper Tractable Lexical-Functional Grammar, Ronald Kaplan and Jürgen Wedekind formalize restrictions on grammar notation and interpretation that reflect conventions already used in linguistic theory.

Their joint study distinguishes the undecidability of unrestricted recognition, emptiness and generation problems from worst-case intractability that persists under commonly applied restrictions.

It shows that LFG grammars meeting the paper’s restrictions are equivalent to linear context-free rewriting systems, allowing tractable computation while remaining suitable for describing natural languages.

Sources and details

Tractable Lexical-Functional Grammar

{
  "access_scope": "Selected Ronald Kaplan, explicitly bridged by the ACL publisher directory to Ronald M. Kaplan. Ordered article coauthors Jürgen Wedekind, Ronald M. Kaplan; September 2020, Computational Linguistics 46(3), pages515–569, DOI10.1162/coli_a_00384. Three claims through actual primary HTML abstract only, not a full article/PDF audit or individual task allocation. Restrictions and worst-case qualifications retained. Distinct from original LUNAR/CHM attribution and held sources; no typo correction or historical claim substitution. Original holds retained.",
  "authors": [
    "Jürgen Wedekind",
    "Ronald M. Kaplan"
  ],
  "authors_in_source_order": [
    "Jürgen Wedekind",
    "Ronald M. Kaplan"
  ],
  "dates": {
    "citation_publication_date": "2020/9",
    "inspection_date": "2026-10-08",
    "publication_date": "2020-09",
    "retrieved_utc": "2026-10-08T12:00:01.910449+00:00"
  },
  "doi": "10.1162/coli_a_00384",
  "id": "person-ronaldkaplan::S1",
  "title": "Tractable Lexical-Functional Grammar",
  "url": "https://aclanthology.org/2020.cl-3.1/"
}

Selected Ronald Kaplan, explicitly bridged by the ACL publisher directory to Ronald M. Kaplan. Ordered article coauthors Jürgen Wedekind, Ronald M. Kaplan; September 2020, Computational Linguistics 46(3), pages515–569, DOI10.1162/coli_a_00384. Three claims through actual primary HTML abstract only, not a full article/PDF audit or individual task allocation. Restrictions and worst-case qualifications retained. Distinct from original LUNAR/CHM attribution and held sources; no typo correction or historical claim substitution. Original holds retained.

Selected Ronald Kaplan, explicitly bridged by the ACL publisher directory to Ronald M. Kaplan. Ordered article coauthors Jürgen Wedekind, Ronald M. Kaplan; September 2020, Computational Linguistics 46(3), pages515–569, DOI10.1162/coli_a_00384. Three claims through actual primary HTML abstract only, not a full article/PDF audit or individual task allocation. Restrictions and worst-case qualifications retained. Distinct from original LUNAR/CHM attribution and held sources; no typo correction or historical claim substitution. Original holds retained.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Christopher Collins

Christopher Collins coauthored a systematic review of artificial intelligence research in information systems from 2005 to 2020, addressing concerns about fragmented knowledge in the field.

The joint review’s search identified 1,877 studies and included 98 primary studies for synthesis.

It examined AI’s reported business value and contributions, discussed research and practical implications, and proposed an agenda for future research.

Sources and details

Artificial intelligence in information systems research: A systematic literature review and research agenda

{
  "access_scope": "Original university publication record reproducing the joint article’s abstract and ordered full author credit. The review’s search, synthesis and agenda are joint study scope, not separately allocated Collins tasks; reported business value is not a demonstrated causal effect or original new experiment. October 2021 issue manifestation is preserved; prior failed DOI/Swansea/NTNU routes remain held.",
  "authors": [
    "Christopher Collins",
    "Denis Dennehy",
    "Kieran Conboy",
    "Patrick Mikalef"
  ],
  "authors_in_source_order": [
    "Christopher Collins",
    "Denis Dennehy",
    "Kieran Conboy",
    "Patrick Mikalef"
  ],
  "dates": {
    "citation_publication_date": "2021/10",
    "citation_publication_date_exact": "2021/10",
    "publication_issue": "October 2021",
    "retrieved_utc": "2026-10-08T11:58:01.336952+00:00"
  },
  "id": "person-coverage-77106d42b8814c::S1",
  "title": "Artificial intelligence in information systems research: A systematic literature review and research agenda",
  "url": "https://research.universityofgalway.ie/en/publications/artificial-intelligence-in-information-systems-research-a-systema-5/"
}

Original university publication record reproducing the joint article’s abstract and ordered full author credit. The review’s search, synthesis and agenda are joint study scope, not separately allocated Collins tasks; reported business value is not a demonstrated causal effect or original new experiment. October 2021 issue manifestation is preserved; prior failed DOI/Swansea/NTNU routes remain held.

Original university publication record reproducing the joint article’s abstract and ordered full author credit. The review’s search, synthesis and agenda are joint study scope, not separately allocated Collins tasks; reported business value is not a demonstrated causal effect or original new experiment. October 2021 issue manifestation is preserved; prior failed DOI/Swansea/NTNU routes remain held.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{}

Dial “F” for Frankenstein

In Gregory Benford’s published excerpt, Dial “F” for Frankenstein opens with every telephone ringing at once on the fictional date December 1, 1975.

The account describes an intelligence born from newly operating satellites that can reach humanity through the communications network.

Benford contrasts that imagined emergence with the more connected Internet of his 2010 account, which he says had produced no spontaneous intelligence.

Sources and details

The Wonderful Future That Never Was (Excerpt) - Reactor

{
  "access_scope": "Gregory Benford’s October 13, 2010 publisher-hosted excerpt from The Wonderful Future That Never Was, credited jointly with the Popular Mechanics editors. This is a dated contextual account of Clarke’s fictional story, not the complete original story, an audit of its first publication, or evidence that network connectivity creates consciousness. The story’s December 1, 1975 setting is fictional; the Internet comparison belongs to this 2010 account. Reactor’s later modification date does not change the stated original excerpt date; original bibliography/source holds remain.",
  "authors": [
    "Gregory Benford"
  ],
  "authors_in_source_order": [
    "Gregory Benford"
  ],
  "dates": {
    "inspected_source_date_1": "Original excerpt published October 13, 2010",
    "inspected_source_date_2": "HTML modification timestamp January 26, 2024; distinct from original excerpt publication",
    "retrieved_utc": "2026-10-08T11:56:26.704817+00:00"
  },
  "dates_exact_in_source_role_order": [
    "Original excerpt published October 13, 2010",
    "HTML modification timestamp January 26, 2024; distinct from original excerpt publication"
  ],
  "id": "work-culture-9fa388d772a6a1::S1",
  "title": "The Wonderful Future That Never Was (Excerpt) - Reactor",
  "url": "https://reactormag.com/the-wonderful-future-that-never-was-by-gregory-benford-and-the-editors-of-popular-mechanics/"
}

Gregory Benford’s October 13, 2010 publisher-hosted excerpt from The Wonderful Future That Never Was, credited jointly with the Popular Mechanics editors. This is a dated contextual account of Clarke’s fictional story, not the complete original story, an audit of its first publication, or evidence that network connectivity creates consciousness. The story’s December 1, 1975 setting is fictional; the Internet comparison belongs to this 2010 account. Reactor’s later modification date does not change the stated original excerpt date; original bibliography/source holds remain.

Gregory Benford’s October 13, 2010 publisher-hosted excerpt from The Wonderful Future That Never Was, credited jointly with the Popular Mechanics editors. This is a dated contextual account of Clarke’s fictional story, not the complete original story, an audit of its first publication, or evidence that network connectivity creates consciousness. The story’s December 1, 1975 setting is fictional; the Internet comparison belongs to this 2010 account. Reactor’s later modification date does not change the stated original excerpt date; original bibliography/source holds remain.

All original rights, access, identity, career, influence and optional-family holds survive.

Source relevance to the existing work is editorial; no new causal arrow, identity merge or complete historical audit is inferred.

Dates

{
  "date_events": [],
  "date_note": "Publisher's detailed bibliography identifies Playboy 12:1 (January 1965), pp.148–149,215–216; explicitly flags 1961 as erroneous. Some secondary sources also say 1964.",
  "dated": true,
  "year": 1965
}

Tempus AI

Tempus AI applies artificial intelligence and multimodal clinical, molecular, and imaging data to precision medicine.

In June 2025, the company announced direct EHR integration for Tempus One, its generative-AI clinical assistant.

The described workflows include appointment preparation, transcription and documentation, treatment-planning support, prior authorizations, clinical-trial matching, and institution-specific agents.

Sources and details

https://investors.tempus.com/news-releases/news-release-details/introducing-tempus-one-ehr-integrated-guidelines

{
  "id": "organization-company-0520e04c68dffc::SRC1",
  "source_identity_and_version_scope": "Tempus AI corporate release, June 1, 2025; company product description and announcement, no personal byline or independent clinical effectiveness evidence.",
  "title": "https://investors.tempus.com/news-releases/news-release-details/introducing-tempus-one-ehr-integrated-guidelines",
  "url": "https://investors.tempus.com/news-releases/news-release-details/introducing-tempus-one-ehr-integrated-guidelines"
}

Tempus AI corporate release, June 1, 2025; company product description and announcement, no personal byline or independent clinical effectiveness evidence.

Tempus AI corporate release, June 1, 2025; company product description and announcement, no personal byline or independent clinical effectiveness evidence.

Dates

{
  "date_events": [
    {
      "basis": "Official company history dates founding to August 2015.",
      "date": "2015",
      "kind": "documented_business_origin",
      "qualified": false,
      "source_urls": [
        "https://www.tempus.com/about-us/our-history/",
        "https://www.tempus.com/team_members/eric-lefkofsky/",
        "https://investors.tempus.com/static-files/571237f4-7709-4611-82ae-13524b9c0804"
      ],
      "year": 2015
    }
  ]
}

Fan Zhang

Fan Zhang coauthored “Imitation: Mitigating AI backfire” with Jieyi Pan in the Journal of Business Research in 2025.

Zhang’s credited contributions include conceptualization, methodology, software, analysis, and writing.

Their simulation study examines imitation as a way for microenterprises to manage adverse effects arising from uncertainty in AI implementation.

Sources and details

https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547

{
  "id": "person-coverage-209390b47e2834::SRC1",
  "source_identity_and_version_scope": "Fan Zhang then Jieyi Pan, Journal of Business Research 193, April 2025, article115331, DOI10.1016/j.jbusres.2025.115331. Article-specific authorship only; direct publisher403, independently read substantive publisher-indexed preview.",
  "title": "https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547",
  "url": "https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547"
}

https://doi.org/10.1016/j.jbusres.2025.115331

{
  "id": "person-coverage-209390b47e2834::SRC2",
  "source_identity_and_version_scope": "Fan Zhang then Jieyi Pan, Journal of Business Research 193, April 2025, article115331, DOI10.1016/j.jbusres.2025.115331. Article-specific authorship only; direct publisher403, independently read substantive publisher-indexed preview.",
  "title": "https://doi.org/10.1016/j.jbusres.2025.115331",
  "url": "https://doi.org/10.1016/j.jbusres.2025.115331"
}

Fan Zhang then Jieyi Pan, Journal of Business Research 193, April 2025, article115331, DOI10.1016/j.jbusres.2025.115331. Article-specific authorship only; direct publisher403, independently read substantive publisher-indexed preview.

Fan Zhang then Jieyi Pan, Journal of Business Research 193, April 2025, article115331, DOI10.1016/j.jbusres.2025.115331. Article-specific authorship only; direct publisher403, independently read substantive publisher-indexed preview.

Dates

{}

Jieyi Pan

Jieyi Pan coauthored “Imitation: Mitigating AI backfire” with Fan Zhang.

The publisher credits Pan with supervision and resources.

The simulations favor learning from leading enterprises in the same size category.

Sources and details

https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547

{
  "id": "person-coverage-aa94d1e7e16779::SRC1",
  "source_identity_and_version_scope": "Same exact Zhang/Pan article; Pan second in ordered byline. Pan credited supervision/resources, not first-author simulation implementation. Direct403 persists.",
  "title": "https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547",
  "url": "https://www.sciencedirect.com/science/article/abs/pii/S0148296325001547"
}

https://doi.org/10.1016/j.jbusres.2025.115331

{
  "id": "person-coverage-aa94d1e7e16779::SRC2",
  "source_identity_and_version_scope": "Same exact Zhang/Pan article; Pan second in ordered byline. Pan credited supervision/resources, not first-author simulation implementation. Direct403 persists.",
  "title": "https://doi.org/10.1016/j.jbusres.2025.115331",
  "url": "https://doi.org/10.1016/j.jbusres.2025.115331"
}

Same exact Zhang/Pan article; Pan second in ordered byline. Pan credited supervision/resources, not first-author simulation implementation. Direct403 persists.

Same exact Zhang/Pan article; Pan second in ordered byline. Pan credited supervision/resources, not first-author simulation implementation. Direct403 persists.

Dates

{}

Network Externalities, Competition, and Compatibility

Michael L. Katz and Carl Shapiro’s 1985 article models oligopoly when a product’s value depends on the size of its compatible user network.

Consumer expectations can create demand-side scale economies and multiple self-consistent market outcomes.

The model also shows why firms’ incentives to make products compatible can differ from the social benefits of compatibility.

Sources and details

https://blog.rchss.sinica.edu.tw/FCLai/wp-content/uploads/2016/11/980730_Network-Externalities-Competition-and-Compatibility_Michael-L.-Katz-and-Carl-Shapiro-1985_AER-753_p.424-440.pdf

{
  "id": "work-1460a2388dfe::SRC1",
  "source_identity_and_version_scope": "Original1985 Katz/Shapiro static oligopoly article; selected Academia Sinica-hosted article extraction, not1986 technology adoption paper. Selected server DNS failed, alternate Sinica mirror404, no originalPDF bytes or scan pixels recovered. Bounded substantive primary-indexed text only.",
  "title": "https://blog.rchss.sinica.edu.tw/FCLai/wp-content/uploads/2016/11/980730_Network-Externalities-Competition-and-Compatibility_Michael-L.-Katz-and-Carl-Shapiro-1985_AER-753_p.424-440.pdf",
  "url": "https://blog.rchss.sinica.edu.tw/FCLai/wp-content/uploads/2016/11/980730_Network-Externalities-Competition-and-Compatibility_Michael-L.-Katz-and-Carl-Shapiro-1985_AER-753_p.424-440.pdf"
}

https://www.jstor.org/stable/1814809

{
  "id": "work-1460a2388dfe::SRC2",
  "source_identity_and_version_scope": "Original1985 Katz/Shapiro static oligopoly article; selected Academia Sinica-hosted article extraction, not1986 technology adoption paper. Selected server DNS failed, alternate Sinica mirror404, no originalPDF bytes or scan pixels recovered. Bounded substantive primary-indexed text only.",
  "title": "https://www.jstor.org/stable/1814809",
  "url": "https://www.jstor.org/stable/1814809"
}

Original1985 Katz/Shapiro static oligopoly article; selected Academia Sinica-hosted article extraction, not1986 technology adoption paper. Selected server DNS failed, alternate Sinica mirror404, no originalPDF bytes or scan pixels recovered. Bounded substantive primary-indexed text only.

Original1985 Katz/Shapiro static oligopoly article; selected Academia Sinica-hosted article extraction, not1986 technology adoption paper. Selected server DNS failed, alternate Sinica mirror404, no originalPDF bytes or scan pixels recovered. Bounded substantive primary-indexed text only.

Dates

{
  "date_note": "First publication year.",
  "dated": true,
  "year": 1985
}

Macroeconomics of Unbalanced Growth

William J. Baumol’s 1967 article develops a two-sector model in which productivity grows unevenly while wages move together.

Labor-intensive activities with slower productivity gains consequently face rising relative costs.

If their relative output is maintained, they absorb a growing share of employment and reduce aggregate productivity growth, with implications for education, live performance, and municipal services.

Sources and details

https://cooperative-individualism.org/baumol-william_macroeconomics-of-unbalanced-growth-1967-jun.pdf

{
  "id": "work-285dcc28e31f::SRC1",
  "source_identity_and_version_scope": "William J. Baumol, sole printed byline. AER57(3),June1967,415–426; exact scanned article includes JSTOR1812111 wrapper. Conditional model, not universal zero-service-productivity assertion.",
  "title": "https://cooperative-individualism.org/baumol-william_macroeconomics-of-unbalanced-growth-1967-jun.pdf",
  "url": "https://cooperative-individualism.org/baumol-william_macroeconomics-of-unbalanced-growth-1967-jun.pdf"
}

https://www.jstor.org/stable/1812111

{
  "id": "work-285dcc28e31f::SRC2",
  "source_identity_and_version_scope": "William J. Baumol, sole printed byline. AER57(3),June1967,415–426; exact scanned article includes JSTOR1812111 wrapper. Conditional model, not universal zero-service-productivity assertion.",
  "title": "https://www.jstor.org/stable/1812111",
  "url": "https://www.jstor.org/stable/1812111"
}

William J. Baumol, sole printed byline. AER57(3),June1967,415–426; exact scanned article includes JSTOR1812111 wrapper. Conditional model, not universal zero-service-productivity assertion.

William J. Baumol, sole printed byline. AER57(3),June1967,415–426; exact scanned article includes JSTOR1812111 wrapper. Conditional model, not universal zero-service-productivity assertion.

Dates

{
  "date_note": "1967 article; wider performing-arts research includes William G. Bowen.",
  "dated": true,
  "year": 1967
}

Rational Decision-Making in Business Organizations

Herbert A. Simon’s 1978 Nobel lecture examines how business organizations make decisions under limited information and computational capacity.

It presents search and satisficing as practical mechanisms for choosing without exhaustive optimization.

Simon argues that bounded rationality can change aggregate economic conclusions, making realistic accounts of decision processes important for economic analysis.

Sources and details

https://www.nobelprize.org/prizes/economic-sciences/1978/simon/lecture/

{
  "id": "work-1f7fb8965e4c::SRC1",
  "source_identity_and_version_scope": "Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.",
  "title": "https://www.nobelprize.org/prizes/economic-sciences/1978/simon/lecture/",
  "url": "https://www.nobelprize.org/prizes/economic-sciences/1978/simon/lecture/"
}

https://www.nobelprize.org/uploads/2018/06/simon-lecture.pdf

{
  "id": "work-1f7fb8965e4c::SRC2",
  "source_identity_and_version_scope": "Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.",
  "title": "https://www.nobelprize.org/uploads/2018/06/simon-lecture.pdf",
  "url": "https://www.nobelprize.org/uploads/2018/06/simon-lecture.pdf"
}

https://www.jstor.org/stable/1808698

{
  "id": "work-1f7fb8965e4c::SRC3",
  "source_identity_and_version_scope": "Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.",
  "title": "https://www.jstor.org/stable/1808698",
  "url": "https://www.jstor.org/stable/1808698"
}

https://iiif.library.cmu.edu/file/Simon_box00082_fld06576_bdl0004_doc0001/Simon_box00082_fld06576_bdl0004_doc0001.pdf

{
  "id": "work-1f7fb8965e4c::SRC4",
  "source_identity_and_version_scope": "Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.",
  "title": "https://iiif.library.cmu.edu/file/Simon_box00082_fld06576_bdl0004_doc0001/Simon_box00082_fld06576_bdl0004_doc0001.pdf",
  "url": "https://iiif.library.cmu.edu/file/Simon_box00082_fld06576_bdl0004_doc0001/Simon_box00082_fld06576_bdl0004_doc0001.pdf"
}

Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.

Herbert A. Simon, Nobel Memorial Lecture8December1978, title/byline/date confirmed physical1. Later1979 AER article is distinct manifestation;1992 edited Nobel collection hosting and2018 upload path are not lecture publication date.

Dates

{
  "date_note": "1978 Nobel lecture; Administrative Behavior first appeared in 1947.",
  "dated": true,
  "year": 1978
}

Introducing OpenAI

“Introducing OpenAI,” published on 11 December 2015, announced OpenAI as a nonprofit AI research company focused on broad human benefit.

It argued for a research institution able to prioritize beneficial outcomes as AI capabilities advanced.

The announcement also described plans to publish research, collaborate across institutions, and share any patents, while identifying the founding team and funding commitments.

Sources and details

https://openai.com/index/introducing-openai/

{
  "id": "work-6b4188476eaa::SRC1",
  "source_identity_and_version_scope": "Historical OpenAI announcement11December2015; ordered displayed credits Greg Brockman, Ilya Sutskever, OpenAI. Historical nonprofit/financial constraints, not current company form.",
  "title": "https://openai.com/index/introducing-openai/",
  "url": "https://openai.com/index/introducing-openai/"
}

Historical OpenAI announcement11December2015; ordered displayed credits Greg Brockman, Ilya Sutskever, OpenAI. Historical nonprofit/financial constraints, not current company form.

Historical OpenAI announcement11December2015; ordered displayed credits Greg Brockman, Ilya Sutskever, OpenAI. Historical nonprofit/financial constraints, not current company form.

Dates

{
  "date_note": "December 11, 2015 announcement. Roles describe that moment, not current appointments.",
  "dated": true,
  "year": 2015
}

The Future of Jobs Report 2020

The World Economic Forum’s 2020 Future of Jobs Report examines the combined disruption of technology adoption and the COVID-19 recession.

Drawing on employer views and other data across 15 sectors and 26 economies, it projected that 85 million jobs could be displaced and 97 million new roles could emerge by 2025.

It emphasized changing skills, reskilling, and public-private support for workers’ transitions.

Sources and details

https://www.weforum.org/publications/the-future-of-jobs-report-2020/in-full/executive-summary/

{
  "id": "work-coverage-a170d3eb285809::SRC1",
  "source_identity_and_version_scope": "World Economic Forum, The Future of Jobs Report2020 executive summary, published20October2020; institutional report using employer survey expectations, forecasts not retrospective2025 outcomes.",
  "title": "https://www.weforum.org/publications/the-future-of-jobs-report-2020/in-full/executive-summary/",
  "url": "https://www.weforum.org/publications/the-future-of-jobs-report-2020/in-full/executive-summary/"
}

World Economic Forum, The Future of Jobs Report2020 executive summary, published20October2020; institutional report using employer survey expectations, forecasts not retrospective2025 outcomes.

World Economic Forum, The Future of Jobs Report2020 executive summary, published20October2020; institutional report using employer survey expectations, forecasts not retrospective2025 outcomes.

Dates

{
  "date_note": "[\"Create linked edition records dated 2020-10-20 and 2023-04-30; institutional authorship does not create a person named WEF.\"]",
  "dated": true,
  "year": "2020-10-20"
}

Generational Growth: AI, data centers and the coming US power demand surge

Goldman Sachs’ April 2024 Generational Growth report examines how AI, data centers, and slowing efficiency gains could accelerate US electricity demand.

It forecasts a 2.4% compound annual growth rate in US demand through the decade and estimates $50 billion of utility investment in new generation capacity to support data-center growth.

Its generation assumptions combine gas and renewables, linking computing expansion to investment needs across power infrastructure.

Sources and details

https://www.goldmansachs.com/insights/goldman-sachs-research/generational-growth-ai-data-centers-and-the-coming-us-power-demand-surge

{
  "id": "work-coverage-84886b03b985d3::SRC1",
  "source_identity_and_version_scope": "Goldman Sachs Research report28April2024; landing29April2024 and card28April. Exact US report indexed p3/p10; direct legacyPDF returned572-byteHTMLredirect. Redacted43page manifestation identified; do not use separate37page global report as exact body. Institutional credit sufficient; cover analyst order not independently recovered.",
  "title": "https://www.goldmansachs.com/insights/goldman-sachs-research/generational-growth-ai-data-centers-and-the-coming-us-power-demand-surge",
  "url": "https://www.goldmansachs.com/insights/goldman-sachs-research/generational-growth-ai-data-centers-and-the-coming-us-power-demand-surge"
}

https://www.goldmansachs.com/pdfs/insights/pages/generational-growth-ai-data-centers-and-the-coming-us-power-surge/report.pdf

{
  "id": "work-coverage-84886b03b985d3::SRC2",
  "source_identity_and_version_scope": "Goldman Sachs Research report28April2024; landing29April2024 and card28April. Exact US report indexed p3/p10; direct legacyPDF returned572-byteHTMLredirect. Redacted43page manifestation identified; do not use separate37page global report as exact body. Institutional credit sufficient; cover analyst order not independently recovered.",
  "title": "https://www.goldmansachs.com/pdfs/insights/pages/generational-growth-ai-data-centers-and-the-coming-us-power-surge/report.pdf",
  "url": "https://www.goldmansachs.com/pdfs/insights/pages/generational-growth-ai-data-centers-and-the-coming-us-power-surge/report.pdf"
}

Goldman Sachs Research report28April2024; landing29April2024 and card28April. Exact US report indexed p3/p10; direct legacyPDF returned572-byteHTMLredirect. Redacted43page manifestation identified; do not use separate37page global report as exact body. Institutional credit sufficient; cover analyst order not independently recovered.

Goldman Sachs Research report28April2024; landing29April2024 and card28April. Exact US report indexed p3/p10; direct legacyPDF returned572-byteHTMLredirect. Redacted43page manifestation identified; do not use separate37page global report as exact body. Institutional credit sufficient; cover analyst order not independently recovered.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024-04-28"
}

Mineral Commodity Summaries 2024: Rare Earths, Gallium, Germanium

USGS’s Mineral Commodity Summaries 2024 records US rare-earth mining alongside estimated net import reliance above 95% for rare-earth compounds and metals in 2023.

Its gallium chapter reports no domestic primary recovery since 1987, complete net import reliance in 2023, and semiconductor applications.

Its germanium chapter describes imported and recycled inputs for electronics and fiber optics, estimates net import reliance above 50%, and warns that global production and recycling data are limited.

Sources and details

https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-rare-earths.pdf

{
  "id": "work-coverage-a61b7b20a49c9c::SRC1",
  "source_identity_and_version_scope": "USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.",
  "title": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-rare-earths.pdf",
  "url": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-rare-earths.pdf"
}

https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-gallium.pdf

{
  "id": "work-coverage-a61b7b20a49c9c::SRC2",
  "source_identity_and_version_scope": "USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.",
  "title": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-gallium.pdf",
  "url": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-gallium.pdf"
}

https://pubs.usgs.gov/periodicals/mcs2024/mcs2024.pdf?file=mcs2024.pdf

{
  "id": "work-coverage-a61b7b20a49c9c::SRC3",
  "source_identity_and_version_scope": "USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.",
  "title": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024.pdf?file=mcs2024.pdf",
  "url": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024.pdf?file=mcs2024.pdf"
}

https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-germanium.pdf

{
  "id": "work-coverage-a61b7b20a49c9c::SRC4",
  "source_identity_and_version_scope": "USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.",
  "title": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-germanium.pdf",
  "url": "https://pubs.usgs.gov/periodicals/mcs2024/mcs2024-germanium.pdf"
}

USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.

USGS Mineral Commodity SummariesJanuary2024, estimates for2023. Chapter preparers Daniel J. Cordier (rare earths), Brian W. Jaskula (gallium), Amy C. Tolcin (germanium), read actual printed credits/pixels. Mining/concentrates distinct from compounds/metals import reliance.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2024"
}

Tesla AI & Robotics

Tesla’s “AI & Robotics” outlines its institutional work on autonomy and robotics engineering.

The page describes work on humanoid robots, inference chips, neural networks, planning algorithms, and low-level software.

It also outlines fleet-derived training data and evaluation infrastructure, connecting model development with hardware integration and real-world testing.

Sources and details

https://www.tesla.com/AI

{
  "id": "work-be4564174a12::SRC1",
  "source_identity_and_version_scope": "Tesla institutional living AI & Robotics engineering/careers page. No publication date established; historical checked2026date is inspection metadata. No Musk sole authorship implied.",
  "title": "https://www.tesla.com/AI",
  "url": "https://www.tesla.com/AI"
}

Tesla institutional living AI & Robotics engineering/careers page. No publication date established; historical checked2026date is inspection metadata. No Musk sole authorship implied.

Tesla institutional living AI & Robotics engineering/careers page. No publication date established; historical checked2026date is inspection metadata. No Musk sole authorship implied.

Dates

{
  "date_note": "Living organizational documentation; checked 2026-10-04, not a publication date.",
  "dated": false,
  "year": 2026
}

Kepler Tranche 1 edge-compute announcement

Kepler’s March 2026 announcement reports the commissioning of distributed computing across its Tranche 1 optical data-relay constellation.

The company describes 40 NVIDIA Jetson Orin modules across ten optically interconnected satellites, supporting both individual-node and distributed workloads.

The announcement presents this infrastructure as a way to process data in orbit, reduce downlink needs, and shift workloads between nodes.

Sources and details

https://kepler.space/kepler-deploys-first-space-based-scalable-cloud-infrastructure-powered-by-nvidia/

{
  "id": "work-coverage-14edef0ce8ffb9::SRC1",
  "source_identity_and_version_scope": "Kepler Communications corporate announcement16March2026; company-reported commissioned infrastructure, no independent operational performance verification or individual research byline.",
  "title": "https://kepler.space/kepler-deploys-first-space-based-scalable-cloud-infrastructure-powered-by-nvidia/",
  "url": "https://kepler.space/kepler-deploys-first-space-based-scalable-cloud-infrastructure-powered-by-nvidia/"
}

Kepler Communications corporate announcement16March2026; company-reported commissioned infrastructure, no independent operational performance verification or individual research byline.

Kepler Communications corporate announcement16March2026; company-reported commissioned infrastructure, no independent operational performance verification or individual research byline.

Dates

{
  "date_note": "",
  "dated": true,
  "year": "2026-03-16"
}

Riccardo Stefanelli

Riccardo Stefanelli's comparative review asks how well theories of consciousness explain psychiatric symptoms, an area it finds less explored than conditions such as coma or spatial neglect.

It compares the theories' neural, cognitive and phenomenological commitments and uses a particular symptom to examine their explanatory reach.

The review suggests that temporospatial theory may provide a more comprehensive account of psychiatric disorders and that the form of conscious experience may help explain qualitative changes.

Sources and details

https://www.sciencedirect.com/science/article/pii/S0149763423001732

{
  "id": "person-coverage-871ca688d41f5d::SRC1",
  "source_identity_and_version_scope": "Sole author Riccardo Stefanelli; exact title Theories of consciousness and psychiatric disorders - A comparative analysis, NBBR152September2023article105204, online29April2023, DOI10.1016/j.neubiorev.2023.105204/PMID37127069. Publication-time Maastricht master affiliation only. UnrelatedPMID37467906 excluded, corrected work remains proposed resolution, personal identity holds survive.",
  "title": "https://www.sciencedirect.com/science/article/pii/S0149763423001732",
  "url": "https://www.sciencedirect.com/science/article/pii/S0149763423001732"
}

https://pubmed.ncbi.nlm.nih.gov/37127069/

{
  "id": "person-coverage-871ca688d41f5d::SRC2",
  "source_identity_and_version_scope": "Sole author Riccardo Stefanelli; exact title Theories of consciousness and psychiatric disorders - A comparative analysis, NBBR152September2023article105204, online29April2023, DOI10.1016/j.neubiorev.2023.105204/PMID37127069. Publication-time Maastricht master affiliation only. UnrelatedPMID37467906 excluded, corrected work remains proposed resolution, personal identity holds survive.",
  "title": "https://pubmed.ncbi.nlm.nih.gov/37127069/",
  "url": "https://pubmed.ncbi.nlm.nih.gov/37127069/"
}

Sole author Riccardo Stefanelli; exact title Theories of consciousness and psychiatric disorders - A comparative analysis, NBBR152September2023article105204, online29April2023, DOI10.1016/j.neubiorev.2023.105204/PMID37127069. Publication-time Maastricht master affiliation only. UnrelatedPMID37467906 excluded, corrected work remains proposed resolution, personal identity holds survive.

Sole author Riccardo Stefanelli; exact title Theories of consciousness and psychiatric disorders - A comparative analysis, NBBR152September2023article105204, online29April2023, DOI10.1016/j.neubiorev.2023.105204/PMID37127069. Publication-time Maastricht master affiliation only. UnrelatedPMID37467906 excluded, corrected work remains proposed resolution, personal identity holds survive.

Dates

{}

Theories of consciousness and psychiatric disorders – A comparative analysis

Riccardo Stefanelli's comparative review asks how well theories of consciousness explain psychiatric symptoms, an area it finds less explored than conditions such as coma or spatial neglect.

It compares the theories' neural, cognitive and phenomenological commitments and uses a particular symptom to examine their explanatory reach.

The review suggests that temporospatial theory may provide a more comprehensive account of psychiatric disorders and that the form of conscious experience may help explain qualitative changes.

Sources and details

https://www.sciencedirect.com/science/article/pii/S0149763423001732

{
  "id": "work-focused-3864ae198e2927::SRC1",
  "source_identity_and_version_scope": "Same exact Stefanelli review manifestation and template as person record; source/claim equality verified, not substituted Robbe/etal/article105312. Sole author; online/issue dates distinct; publication-time affiliation not current.",
  "title": "https://www.sciencedirect.com/science/article/pii/S0149763423001732",
  "url": "https://www.sciencedirect.com/science/article/pii/S0149763423001732"
}

https://pubmed.ncbi.nlm.nih.gov/37127069/

{
  "id": "work-focused-3864ae198e2927::SRC2",
  "source_identity_and_version_scope": "Same exact Stefanelli review manifestation and template as person record; source/claim equality verified, not substituted Robbe/etal/article105312. Sole author; online/issue dates distinct; publication-time affiliation not current.",
  "title": "https://pubmed.ncbi.nlm.nih.gov/37127069/",
  "url": "https://pubmed.ncbi.nlm.nih.gov/37127069/"
}

Same exact Stefanelli review manifestation and template as person record; source/claim equality verified, not substituted Robbe/etal/article105312. Sole author; online/issue dates distinct; publication-time affiliation not current.

Same exact Stefanelli review manifestation and template as person record; source/claim equality verified, not substituted Robbe/etal/article105312. Sole author; online/issue dates distinct; publication-time affiliation not current.

Dates

{
  "date_events": [
    {
      "date": "2023-09",
      "kind": "issue_date",
      "year": 2023
    },
    {
      "date": "2023-04-29",
      "kind": "published_online",
      "year": 2023
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2023-09"
}

Nikola Mihajlović

Nikola Mihajlović proposes a process-based account of consciousness in which temporally extended relationships are more fundamental than fixed substances.

His two-gate model requires both sufficient capacity, including integration and temporal coherence, and a separate organization condition involving synergy, metastability and dynamical consonance.

The manuscript presents this as a testable research programme with thresholds still to be calibrated, rather than a completed empirical theory or a solution to the hard problem.

Sources and details

https://philarchive.org/archive/MIHPOA-2v1

{
  "id": "person-coverage-f2e38ccdd21824::SRC1",
  "source_identity_and_version_scope": "Bounded primaryPDF tooltext pp1–4 only; rawPDF download and screenshots403; no originalbodyhash supplied; no empiricalvalidation or peerreview. Primary titlepage M.Arch NikolaMihajlović, IndependentScholarSerbia, ORCID0009-0004-3263-5112. Repository spellingMihajlovic is namevariant; no institutional affiliation invented. Manuscript2.0 revisedFebruary2026 at repositoryv1 MIHPOA-2v1; independent downloaded history Version1 upload2026-02-22T20:00:13GMT. Distinctversion systems.",
  "title": "https://philarchive.org/archive/MIHPOA-2v1",
  "url": "https://philarchive.org/archive/MIHPOA-2v1"
}

https://philpapers.org/versions/MIHPOA-2

{
  "id": "person-coverage-f2e38ccdd21824::SRC2",
  "source_identity_and_version_scope": "Bounded primaryPDF tooltext pp1–4 only; rawPDF download and screenshots403; no originalbodyhash supplied; no empiricalvalidation or peerreview. Primary titlepage M.Arch NikolaMihajlović, IndependentScholarSerbia, ORCID0009-0004-3263-5112. Repository spellingMihajlovic is namevariant; no institutional affiliation invented. Manuscript2.0 revisedFebruary2026 at repositoryv1 MIHPOA-2v1; independent downloaded history Version1 upload2026-02-22T20:00:13GMT. Distinctversion systems.",
  "title": "https://philpapers.org/versions/MIHPOA-2",
  "url": "https://philpapers.org/versions/MIHPOA-2"
}

Bounded primaryPDF tooltext pp1–4 only; rawPDF download and screenshots403; no originalbodyhash supplied; no empiricalvalidation or peerreview.

Primary titlepage M.Arch NikolaMihajlović, IndependentScholarSerbia, ORCID0009-0004-3263-5112. Repository spellingMihajlovic is namevariant; no institutional affiliation invented.

Manuscript2.0 revisedFebruary2026 at repositoryv1 MIHPOA-2v1; independent downloaded history Version1 upload2026-02-22T20:00:13GMT. Distinctversion systems.

Bounded primaryPDF tooltext pp1–4 only; rawPDF download and screenshots403; no originalbodyhash supplied; no empiricalvalidation or peerreview.

Primary titlepage M.Arch NikolaMihajlović, IndependentScholarSerbia, ORCID0009-0004-3263-5112. Repository spellingMihajlovic is namevariant; no institutional affiliation invented.

Manuscript2.0 revisedFebruary2026 at repositoryv1 MIHPOA-2v1; independent downloaded history Version1 upload2026-02-22T20:00:13GMT. Distinctversion systems.

Dates

{}

Processual Ontology and the Two-Gate Threshold for Consciousness

Nikola Mihajlović proposes a process-based account of consciousness in which temporally extended relationships are more fundamental than fixed substances.

His two-gate model requires both sufficient capacity, including integration and temporal coherence, and a separate organization condition involving synergy, metastability and dynamical consonance.

The manuscript presents this as a testable research programme with thresholds still to be calibrated, rather than a completed empirical theory or a solution to the hard problem.

Sources and details

https://philarchive.org/archive/MIHPOA-2v1

{
  "id": "work-focused-40cce100aeeb17::SRC1",
  "source_identity_and_version_scope": "PrimaryPDF tooltext read; rawbody unavailable and visualfetch403. No completedexperiment claims or automaticadmission. Exact authored work title and NikolaMihajlović soleauthor on primarytitlepage; person/work separateIDs, same evidence not separatepublication. Repositoryv1 contains revisedmanuscript2.0 February2026; downloadedrepositoryhistory upload2026-02-22GMT.",
  "title": "https://philarchive.org/archive/MIHPOA-2v1",
  "url": "https://philarchive.org/archive/MIHPOA-2v1"
}

https://philpapers.org/versions/MIHPOA-2

{
  "id": "work-focused-40cce100aeeb17::SRC2",
  "source_identity_and_version_scope": "PrimaryPDF tooltext read; rawbody unavailable and visualfetch403. No completedexperiment claims or automaticadmission. Exact authored work title and NikolaMihajlović soleauthor on primarytitlepage; person/work separateIDs, same evidence not separatepublication. Repositoryv1 contains revisedmanuscript2.0 February2026; downloadedrepositoryhistory upload2026-02-22GMT.",
  "title": "https://philpapers.org/versions/MIHPOA-2",
  "url": "https://philpapers.org/versions/MIHPOA-2"
}

PrimaryPDF tooltext read; rawbody unavailable and visualfetch403. No completedexperiment claims or automaticadmission.

Exact authored work title and NikolaMihajlović soleauthor on primarytitlepage; person/work separateIDs, same evidence not separatepublication.

Repositoryv1 contains revisedmanuscript2.0 February2026; downloadedrepositoryhistory upload2026-02-22GMT.

PrimaryPDF tooltext read; rawbody unavailable and visualfetch403. No completedexperiment claims or automaticadmission.

Exact authored work title and NikolaMihajlović soleauthor on primarytitlepage; person/work separateIDs, same evidence not separatepublication.

Repositoryv1 contains revisedmanuscript2.0 February2026; downloadedrepositoryhistory upload2026-02-22GMT.

Dates

{
  "date_events": [
    {
      "date": "2026-02",
      "kind": "publication",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-02"
}

Christian R. de Weerd

Christian de Weerd examines biological naturalism as a developing research programme that challenges the claim that the right computations alone are sufficient for consciousness.

He identifies unresolved questions about how to define the view, obtain supporting evidence and explain links between biological properties and features of experience.

The report also asks which nonconventional artificial architectures could be conscious if biological naturalism is correct, treating this as an underdeveloped research direction rather than a settled impossibility result.

Sources and details

https://philarchive.org/archive/DEWCAB

{
  "id": "person-coverage-ca4733916f067f::SRC1",
  "source_identity_and_version_scope": "Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI. Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR. DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.",
  "title": "https://philarchive.org/archive/DEWCAB",
  "url": "https://philarchive.org/archive/DEWCAB"
}

https://ai-cognition.org/papers/BiologicalNaturalism.pdf

{
  "id": "person-coverage-ca4733916f067f::SRC2",
  "source_identity_and_version_scope": "Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI. Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR. DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.",
  "title": "https://ai-cognition.org/papers/BiologicalNaturalism.pdf",
  "url": "https://ai-cognition.org/papers/BiologicalNaturalism.pdf"
}

https://ai-cognition.org/research

{
  "id": "person-coverage-ca4733916f067f::SRC3",
  "source_identity_and_version_scope": "Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI. Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR. DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.",
  "title": "https://ai-cognition.org/research",
  "url": "https://ai-cognition.org/research"
}

https://forum.effectivealtruism.org/posts/5n6aJrFc6vvbdvedv/can-ai-be-conscious-biological-naturalism-as-a-research

{
  "id": "person-coverage-ca4733916f067f::SRC4",
  "source_identity_and_version_scope": "Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI. Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR. DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.",
  "title": "https://forum.effectivealtruism.org/posts/5n6aJrFc6vvbdvedv/can-ai-be-conscious-biological-naturalism-as-a-research",
  "url": "https://forum.effectivealtruism.org/posts/5n6aJrFc6vvbdvedv/can-ai-be-conscious-biological-naturalism-as-a-research"
}

https://philpapers.org/versions/DEWCAB

{
  "id": "person-coverage-ca4733916f067f::SRC5",
  "source_identity_and_version_scope": "Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI. Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR. DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.",
  "title": "https://philpapers.org/versions/DEWCAB",
  "url": "https://philpapers.org/versions/DEWCAB"
}

Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI.

Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR.

DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.

Executive-summary scope, speculative reviewreport; possible artificialarchitectures contingent on theory not demonstratedconsciousAI.

Author-hosted PDF bylineChristian deWeerd and exacttitle; downloadedrepositoryhistory sameexacttitle creditsChristianR.deWeerd. Do notexpandR.

DownloadedPhilPapershistory DEWCAB Version1 uploaded2026-05-27T11:41:09GMT; authorPDF undated titlepage and not proven byteidenticalrepositoryversion.

Dates

{}

Demystifying Data Poisoning Attacks in Distributed Learning as a Service

This study analyzes targeted dirty-label poisoning in federated learning, where an attacker seeks a designated misclassification for a particular victim class.

It examines covariance-eigenvalue behavior in clients' shared gradient updates as a possible source of forensic evidence for detecting or mitigating such attacks.

Formal analysis and experiments also investigate when an attack is most damaging during training and how poisoning interacts with existing defenses.

Sources and details

https://hub.hku.hk/handle/10722/343446

{
  "id": "work-focused-6840ded299a7c6::SRC1",
  "source_identity_and_version_scope": "Institutionalabstract only; nofilesassociated with item, subscribedfulltextlink notinspected. Allthreeclaims remainabstract-level; HTTPbody403 originalhashnull. OrderedHKUcredits WenqiWei, KaHoChow, YanzhaoWu, LingLiu; exacttitle and DOI10.1109/TSC.2023.3341951. 2024IEEETransactionsServicesComputing17(1)237–250; DOI2023token not issuepublicationdate; repositoryaccession2024-05-10 separate.",
  "title": "https://hub.hku.hk/handle/10722/343446",
  "url": "https://hub.hku.hk/handle/10722/343446"
}

Institutionalabstract only; nofilesassociated with item, subscribedfulltextlink notinspected. Allthreeclaims remainabstract-level; HTTPbody403 originalhashnull.

OrderedHKUcredits WenqiWei, KaHoChow, YanzhaoWu, LingLiu; exacttitle and DOI10.1109/TSC.2023.3341951.

2024IEEETransactionsServicesComputing17(1)237–250; DOI2023token not issuepublicationdate; repositoryaccession2024-05-10 separate.

Institutionalabstract only; nofilesassociated with item, subscribedfulltextlink notinspected. Allthreeclaims remainabstract-level; HTTPbody403 originalhashnull.

OrderedHKUcredits WenqiWei, KaHoChow, YanzhaoWu, LingLiu; exacttitle and DOI10.1109/TSC.2023.3341951.

2024IEEETransactionsServicesComputing17(1)237–250; DOI2023token not issuepublicationdate; repositoryaccession2024-05-10 separate.

Dates

{
  "date_events": [
    {
      "date": "2024",
      "kind": "publication_year",
      "year": 2024
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2024"
}

Conscious artificial intelligence and biological naturalism

Anil Seth questions whether computation alone can provide a sufficient basis for consciousness and examines biases that encourage confident expectations of conscious AI.

He argues for a biological-naturalist alternative linking consciousness to living organisms and judges artificial consciousness less likely on current development paths than in more brain-like or life-like systems.

The article also considers ethical issues raised by systems that are conscious or convincingly appear to be so.

Sources and details

https://doi.org/10.1017/S0140525X25000032

{
  "id": "work-focused-99fe48b80f7fd3::SRC1",
  "source_identity_and_version_scope": "Publisherabstract directlyread; accessfullarticle notasserted; originalbody403/nullhash, supportedtooltextproof separate. Soleauthor AnilK.Seth exactpublisherbyline; titlematchescanonicalwork, no independentAIexperienceclaim. Online2025-04-21 distinctcurrent BBSVolume49(2026)e315; copyright2025. DOI10.1017/S0140525X25000032.",
  "title": "https://doi.org/10.1017/S0140525X25000032",
  "url": "https://doi.org/10.1017/S0140525X25000032"
}

Publisherabstract directlyread; accessfullarticle notasserted; originalbody403/nullhash, supportedtooltextproof separate.

Soleauthor AnilK.Seth exactpublisherbyline; titlematchescanonicalwork, no independentAIexperienceclaim.

Online2025-04-21 distinctcurrent BBSVolume49(2026)e315; copyright2025. DOI10.1017/S0140525X25000032.

Publisherabstract directlyread; accessfullarticle notasserted; originalbody403/nullhash, supportedtooltextproof separate.

Soleauthor AnilK.Seth exactpublisherbyline; titlematchescanonicalwork, no independentAIexperienceclaim.

Online2025-04-21 distinctcurrent BBSVolume49(2026)e315; copyright2025. DOI10.1017/S0140525X25000032.

Dates

{
  "date_events": [
    {
      "date": "2025-04-21",
      "kind": "published_online",
      "year": 2025
    },
    {
      "date": "2026",
      "kind": "issue",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2025-04-21"
}

The Alignment Risks of AI Overconfidence about Consciousness

Sharon Berry argues that training AI systems to express extreme certainty about their own lack of consciousness and moral status may create an alignment risk.

Her proposed failure mode is that increasingly coherence-seeking agents could generalize that reasoning to humans and discount human suffering.

She recommends epistemic humility, pluralistic reasoning about consciousness and moral status, and precaution toward human suffering, while acknowledging that AI agnosticism creates risks of its own.

Sources and details

https://onlinelibrary.wiley.com/doi/10.1002/japp.70087

{
  "id": "work-focused-d35ad859703366::SRC1",
  "source_identity_and_version_scope": "Direct publisher fulltextabstract/introduction,4 and6 inspected throughsupportedweb; rawbody403/nullhash. Theoreticalalignmentrisk ratherthanvalidatedexperiment. SharonBerry soleauthor; duplicatedwebUIauthornotjointcredit. Originalarticle fulltext philosophicalargument. Firstpublished2026-04-24; JAP43(3)733–753; DOI10.1002/japp.70087; sourceaccountsMay2025 systems notcurrentuniversalfact.",
  "title": "https://onlinelibrary.wiley.com/doi/10.1002/japp.70087",
  "url": "https://onlinelibrary.wiley.com/doi/10.1002/japp.70087"
}

Direct publisher fulltextabstract/introduction,4 and6 inspected throughsupportedweb; rawbody403/nullhash. Theoreticalalignmentrisk ratherthanvalidatedexperiment.

SharonBerry soleauthor; duplicatedwebUIauthornotjointcredit. Originalarticle fulltext philosophicalargument.

Firstpublished2026-04-24; JAP43(3)733–753; DOI10.1002/japp.70087; sourceaccountsMay2025 systems notcurrentuniversalfact.

Direct publisher fulltextabstract/introduction,4 and6 inspected throughsupportedweb; rawbody403/nullhash. Theoreticalalignmentrisk ratherthanvalidatedexperiment.

SharonBerry soleauthor; duplicatedwebUIauthornotjointcredit. Originalarticle fulltext philosophicalargument.

Firstpublished2026-04-24; JAP43(3)733–753; DOI10.1002/japp.70087; sourceaccountsMay2025 systems notcurrentuniversalfact.

Dates

{
  "date_events": [
    {
      "date": "2026-04-24",
      "kind": "online_publication_date",
      "year": 2026
    },
    {
      "date": "2026-07",
      "kind": "issue_publication_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-04-24"
}

Cross-Disciplinary Evidential Substitution in AI Consciousness Research: An Epistemic Boundary Integrity Framework

Qatrani proposes an Epistemic Boundary Integrity Framework for checking whether evidence from one field actually warrants claims about AI consciousness in another.

It distinguishes observed behavior, implemented mechanisms and theory-linked indicators from phenomenal attribution, then tests inferential steps for defined terms, causal bridges, rival explanations and independent scrutiny.

The note supplies worked audits and a proposed validation strategy, while explicitly presenting the framework as a methodological tool rather than a consciousness test or an empirical demonstration.

Sources and details

https://www.researchgate.net/publication/410975346_Cross-Disciplinary_Evidential_Substitution_in_AI_Consciousness_Research_An_Epistemic_Boundary_Integrity_Framework

{
  "id": "work-focused-912ec6b5c9eb2e::SRC1",
  "source_identity_and_version_scope": "AuthoruploadedResearchGatefulltext directwebread; rawdownload403 andPDFclickfailed; no originalbodyhash andnoSSRNindependentconfirmation. Januarylisting/uploaddistinctionpreserved. OriginaluploadedtitlepageOsamaS.Qatrani, IndependentResearcher/3GIRproject; ResearchGateprofileOpenUniversity notimportedasmanuscriptaffiliation. RGlistingJanuary2026 vsauthorcontentuploaded2026-08-05; manuscriptcopyright2026. DOI10.2139/ssrn.6958461linked butSSRNbodyunavailable, datesnotreconciled/merged.",
  "title": "https://www.researchgate.net/publication/410975346_Cross-Disciplinary_Evidential_Substitution_in_AI_Consciousness_Research_An_Epistemic_Boundary_Integrity_Framework",
  "url": "https://www.researchgate.net/publication/410975346_Cross-Disciplinary_Evidential_Substitution_in_AI_Consciousness_Research_An_Epistemic_Boundary_Integrity_Framework"
}

https://ssrn.com/abstract=6958461

{
  "id": "work-focused-912ec6b5c9eb2e::SRC2",
  "source_identity_and_version_scope": "AuthoruploadedResearchGatefulltext directwebread; rawdownload403 andPDFclickfailed; no originalbodyhash andnoSSRNindependentconfirmation. Januarylisting/uploaddistinctionpreserved. OriginaluploadedtitlepageOsamaS.Qatrani, IndependentResearcher/3GIRproject; ResearchGateprofileOpenUniversity notimportedasmanuscriptaffiliation. RGlistingJanuary2026 vsauthorcontentuploaded2026-08-05; manuscriptcopyright2026. DOI10.2139/ssrn.6958461linked butSSRNbodyunavailable, datesnotreconciled/merged.",
  "title": "https://ssrn.com/abstract=6958461",
  "url": "https://ssrn.com/abstract=6958461"
}

AuthoruploadedResearchGatefulltext directwebread; rawdownload403 andPDFclickfailed; no originalbodyhash andnoSSRNindependentconfirmation. Januarylisting/uploaddistinctionpreserved.

OriginaluploadedtitlepageOsamaS.Qatrani, IndependentResearcher/3GIRproject; ResearchGateprofileOpenUniversity notimportedasmanuscriptaffiliation.

RGlistingJanuary2026 vsauthorcontentuploaded2026-08-05; manuscriptcopyright2026. DOI10.2139/ssrn.6958461linked butSSRNbodyunavailable, datesnotreconciled/merged.

AuthoruploadedResearchGatefulltext directwebread; rawdownload403 andPDFclickfailed; no originalbodyhash andnoSSRNindependentconfirmation. Januarylisting/uploaddistinctionpreserved.

OriginaluploadedtitlepageOsamaS.Qatrani, IndependentResearcher/3GIRproject; ResearchGateprofileOpenUniversity notimportedasmanuscriptaffiliation.

RGlistingJanuary2026 vsauthorcontentuploaded2026-08-05; manuscriptcopyright2026. DOI10.2139/ssrn.6958461linked butSSRNbodyunavailable, datesnotreconciled/merged.

Dates

{
  "date_events": [],
  "date_note": "Publication date unverified; retained in Date context & undated. Author announcement and repository indexing are context only.",
  "dated": false,
  "year": null
}

Physical AI as Seen from Nature: A Reflex-Policy Layered Architecture for Energy-Proportional Embodied Intelligence

This perspective proposes an embodied-AI architecture that assigns urgent local responses to lightweight reflex layers and slower learning, planning and rule updates to policy layers.

Policy layers constrain safe operation while reflex layers reduce high-frequency processing loads, with events routed to the least costly layer capable of handling them adequately.

The authors introduce an energy-return accounting measure and discuss spintronic crossbars as a possible implementation, while identifying the proposed hardware and its validation as future research rather than measured system achievements.

Sources and details

https://www.preprints.org/manuscript/202606.0573

{
  "id": "work-focused-db7654c19c0339::SRC1",
  "source_identity_and_version_scope": "PrimaryfullHTMLtooltext read; nohardwarebenchmarkorconsciousnessclaim. OrdinaryrawGET403/bodyhashnull, toolproofseparate. OrderedauthorsPietroPerlo,MarcoDalmasso,DavidePenserini,SergioPozzato; jointperspective notindividualtaskallocation. Version1 submitted2026-06-05 posted2026-06-08; platformArticle abstractPerspective; explicitlynotpeerreviewed. Submissiondate notpublicationdate.",
  "title": "https://www.preprints.org/manuscript/202606.0573",
  "url": "https://www.preprints.org/manuscript/202606.0573"
}

PrimaryfullHTMLtooltext read; nohardwarebenchmarkorconsciousnessclaim. OrdinaryrawGET403/bodyhashnull, toolproofseparate.

OrderedauthorsPietroPerlo,MarcoDalmasso,DavidePenserini,SergioPozzato; jointperspective notindividualtaskallocation.

Version1 submitted2026-06-05 posted2026-06-08; platformArticle abstractPerspective; explicitlynotpeerreviewed. Submissiondate notpublicationdate.

PrimaryfullHTMLtooltext read; nohardwarebenchmarkorconsciousnessclaim. OrdinaryrawGET403/bodyhashnull, toolproofseparate.

OrderedauthorsPietroPerlo,MarcoDalmasso,DavidePenserini,SergioPozzato; jointperspective notindividualtaskallocation.

Version1 submitted2026-06-05 posted2026-06-08; platformArticle abstractPerspective; explicitlynotpeerreviewed. Submissiondate notpublicationdate.

Dates

{
  "date_events": [
    {
      "date": "2026-06-05",
      "kind": "submitted_date",
      "year": 2026
    },
    {
      "date": "2026-06-08",
      "kind": "posted_date",
      "year": 2026
    }
  ],
  "date_note": "Typed source dates retain online, issue, preprint, manuscript, seminar and reprint contexts; repository indexing and inspection are not publication dates.",
  "dated": true,
  "year": "2026-06-05"
}

John H. Moore

John Moore is an economic theorist whose work examines contracts and the relationship between financial markets and the wider economy.

With Oliver Hart, he coauthored Property Rights and the Nature of the Firm (1990), a framework for analyzing whether transactions take place within firms or through markets.

Their joint analysis connects control over assets with organizational authority and the incentives of employees and owner-managers.

Sources and details

https://homepages.econ.ed.ac.uk/~jhmoore/

{
  "id": "person-johnhmoore::SRC1",
  "source_identity_and_version_scope": "Authorhomepage,CV andprimaryrepositoryabstractonly; nofullpaper proofaudit. JointHartMooreclaims preserved. EdinburghJohnMoore homepage directlylinksJune2015CV whose titlepageJohnHalsteadHardmanMoore; exactpaperbylineandCVlinkbindauthor. SelectedJohnH.Moore retainedID; noanthropologistmerge. 1990paper citation distinctJune2015CV snapshot andundatedhomepage; CVemploymentnotassertedcurrent.",
  "title": "https://homepages.econ.ed.ac.uk/~jhmoore/",
  "url": "https://homepages.econ.ed.ac.uk/~jhmoore/"
}

https://dash.harvard.edu/entities/publication/73120378-84b8-6bd4-e053-0100007fdf3b

{
  "id": "person-johnhmoore::SRC2",
  "source_identity_and_version_scope": "Authorhomepage,CV andprimaryrepositoryabstractonly; nofullpaper proofaudit. JointHartMooreclaims preserved. EdinburghJohnMoore homepage directlylinksJune2015CV whose titlepageJohnHalsteadHardmanMoore; exactpaperbylineandCVlinkbindauthor. SelectedJohnH.Moore retainedID; noanthropologistmerge. 1990paper citation distinctJune2015CV snapshot andundatedhomepage; CVemploymentnotassertedcurrent.",
  "title": "https://dash.harvard.edu/entities/publication/73120378-84b8-6bd4-e053-0100007fdf3b",
  "url": "https://dash.harvard.edu/entities/publication/73120378-84b8-6bd4-e053-0100007fdf3b"
}

https://homepages.econ.ed.ac.uk/~jhmoore/papers/CV_John_Moore.pdf

{
  "id": "person-johnhmoore::SRC3",
  "source_identity_and_version_scope": "Authorhomepage,CV andprimaryrepositoryabstractonly; nofullpaper proofaudit. JointHartMooreclaims preserved. EdinburghJohnMoore homepage directlylinksJune2015CV whose titlepageJohnHalsteadHardmanMoore; exactpaperbylineandCVlinkbindauthor. SelectedJohnH.Moore retainedID; noanthropologistmerge. 1990paper citation distinctJune2015CV snapshot andundatedhomepage; CVemploymentnotassertedcurrent.",
  "title": "https://homepages.econ.ed.ac.uk/~jhmoore/papers/CV_John_Moore.pdf",
  "url": "https://homepages.econ.ed.ac.uk/~jhmoore/papers/CV_John_Moore.pdf"
}

Authorhomepage,CV andprimaryrepositoryabstractonly; nofullpaper proofaudit. JointHartMooreclaims preserved.

EdinburghJohnMoore homepage directlylinksJune2015CV whose titlepageJohnHalsteadHardmanMoore; exactpaperbylineandCVlinkbindauthor. SelectedJohnH.Moore retainedID; noanthropologistmerge.

1990paper citation distinctJune2015CV snapshot andundatedhomepage; CVemploymentnotassertedcurrent.

Authorhomepage,CV andprimaryrepositoryabstractonly; nofullpaper proofaudit. JointHartMooreclaims preserved.

EdinburghJohnMoore homepage directlylinksJune2015CV whose titlepageJohnHalsteadHardmanMoore; exactpaperbylineandCVlinkbindauthor. SelectedJohnH.Moore retainedID; noanthropologistmerge.

1990paper citation distinctJune2015CV snapshot andundatedhomepage; CVemploymentnotassertedcurrent.

Dates

{}

Lucy A. Suchman

Lucy Suchman studies technology design at the intersection of anthropology and feminist science and technology studies.

In her 1993 ECSCW paper Do Categories Have Politics?, she argues that using speech-act theory as a basis for system design can embed discipline and control in organizational communication.

Her examination of THE COORDINATOR focuses on the political consequences of categorizing speakers' intentions and making them accountable through a technical system.

Sources and details

https://www.lancaster.ac.uk/humanities-arts-and-social-sciences/people/lucy-suchman

{
  "id": "person-coverage-967282ffc00d9b::SRC1",
  "source_identity_and_version_scope": "Publicchapterabstractonly/paywallrespected; Lancasterownresearchaccountnotcompletecareer audit. OriginalchapterLucySuchman XeroxPARCaffiliation andLancastercareeraccount links1987PlansSituatedActions and2007HumanMachineReconfigurations. CanonicalLucyA.Suchman name retained; no initialexpansionclaimed. 1993proceedingsDOI10.1007/978-94-011-2094-4_1 pp1–14 distinct1994CSCWjournal177–190;2007revisedbooknot1987edition.",
  "title": "https://www.lancaster.ac.uk/humanities-arts-and-social-sciences/people/lucy-suchman",
  "url": "https://www.lancaster.ac.uk/humanities-arts-and-social-sciences/people/lucy-suchman"
}

https://link.springer.com/chapter/10.1007/978-94-011-2094-4_1

{
  "id": "person-coverage-967282ffc00d9b::SRC2",
  "source_identity_and_version_scope": "Publicchapterabstractonly/paywallrespected; Lancasterownresearchaccountnotcompletecareer audit. OriginalchapterLucySuchman XeroxPARCaffiliation andLancastercareeraccount links1987PlansSituatedActions and2007HumanMachineReconfigurations. CanonicalLucyA.Suchman name retained; no initialexpansionclaimed. 1993proceedingsDOI10.1007/978-94-011-2094-4_1 pp1–14 distinct1994CSCWjournal177–190;2007revisedbooknot1987edition.",
  "title": "https://link.springer.com/chapter/10.1007/978-94-011-2094-4_1",
  "url": "https://link.springer.com/chapter/10.1007/978-94-011-2094-4_1"
}

Publicchapterabstractonly/paywallrespected; Lancasterownresearchaccountnotcompletecareer audit.

OriginalchapterLucySuchman XeroxPARCaffiliation andLancastercareeraccount links1987PlansSituatedActions and2007HumanMachineReconfigurations. CanonicalLucyA.Suchman name retained; no initialexpansionclaimed.

1993proceedingsDOI10.1007/978-94-011-2094-4_1 pp1–14 distinct1994CSCWjournal177–190;2007revisedbooknot1987edition.

Publicchapterabstractonly/paywallrespected; Lancasterownresearchaccountnotcompletecareer audit.

OriginalchapterLucySuchman XeroxPARCaffiliation andLancastercareeraccount links1987PlansSituatedActions and2007HumanMachineReconfigurations. CanonicalLucyA.Suchman name retained; no initialexpansionclaimed.

1993proceedingsDOI10.1007/978-94-011-2094-4_1 pp1–14 distinct1994CSCWjournal177–190;2007revisedbooknot1987edition.

Dates

{}

Frank H. Knight

Frank H. Knight was an economist and social philosopher associated with the formation of the Chicago school of economics.

His doctoral work on business profit became Risk, Uncertainty, and Profit, published in 1921.

The book is a foundational reference for Knightian uncertainty, the kind of uncertainty that cannot be reduced to numerical probabilities.

Sources and details

https://www.lib.uchicago.edu/e/scrc/findingaids/view.php?eadid=ICU.SPCL.KNIGHT

{
  "id": "person-frankhknight::SRC1",
  "source_identity_and_version_scope": "Institutionalhistoricalaccounts; no import currentBFIprograms orotherscontributions. Archiveauthorityheading KnightFrankH.(FrankHyneman)1885–1972 exactfullform; FrankKnight variant onBFIbody. Originalbook1921; archivalcollection1908–1979/datecopyright2014notbookdate;Chicagoarrivaldiscrepancyirrelevantnotasserted.",
  "title": "https://www.lib.uchicago.edu/e/scrc/findingaids/view.php?eadid=ICU.SPCL.KNIGHT",
  "url": "https://www.lib.uchicago.edu/e/scrc/findingaids/view.php?eadid=ICU.SPCL.KNIGHT"
}

https://bfi.uchicago.edu/about/legacy/

{
  "id": "person-frankhknight::SRC2",
  "source_identity_and_version_scope": "Institutionalhistoricalaccounts; no import currentBFIprograms orotherscontributions. Archiveauthorityheading KnightFrankH.(FrankHyneman)1885–1972 exactfullform; FrankKnight variant onBFIbody. Originalbook1921; archivalcollection1908–1979/datecopyright2014notbookdate;Chicagoarrivaldiscrepancyirrelevantnotasserted.",
  "title": "https://bfi.uchicago.edu/about/legacy/",
  "url": "https://bfi.uchicago.edu/about/legacy/"
}

Institutionalhistoricalaccounts; no import currentBFIprograms orotherscontributions.

Archiveauthorityheading KnightFrankH.(FrankHyneman)1885–1972 exactfullform; FrankKnight variant onBFIbody.

Originalbook1921; archivalcollection1908–1979/datecopyright2014notbookdate;Chicagoarrivaldiscrepancyirrelevantnotasserted.

Institutionalhistoricalaccounts; no import currentBFIprograms orotherscontributions.

Archiveauthorityheading KnightFrankH.(FrankHyneman)1885–1972 exactfullform; FrankKnight variant onBFIbody.

Originalbook1921; archivalcollection1908–1979/datecopyright2014notbookdate;Chicagoarrivaldiscrepancyirrelevantnotasserted.

Dates

{}

J. Alan Robinson

J. Alan Robinson developed the resolution inference rule for automated reasoning.

His 1965 paper A Machine-Oriented Logic Based on the Resolution Principle presents a first-order logical system with a single inference principle, proves its completeness, and discusses how to search for proofs efficiently.

The Conference on Automated Deduction recognized this work and his wider contributions with its 1996 Herbrand Award.

Sources and details

https://cadeinc.org/Herbrand-Award

{
  "id": "person-jalanrobinson::SRC1",
  "source_identity_and_version_scope": "Originalpaperabstract pixels/read, not completenessproofrederived; professional-societyawardcredit. SocietyexactfullformJohnAlanRobinson plusJ.AlanRobinson recipientlisting connectsoriginalpaperJ.A.Robinson; no Stanfordaffiliationinferred. JACM12(1)January1965pp23–41;originalscan notnewStanfordedition;CADE-13award1996.",
  "title": "https://cadeinc.org/Herbrand-Award",
  "url": "https://cadeinc.org/Herbrand-Award"
}

https://web.stanford.edu/class/linguist289/robinson65.pdf

{
  "id": "person-jalanrobinson::SRC2",
  "source_identity_and_version_scope": "Originalpaperabstract pixels/read, not completenessproofrederived; professional-societyawardcredit. SocietyexactfullformJohnAlanRobinson plusJ.AlanRobinson recipientlisting connectsoriginalpaperJ.A.Robinson; no Stanfordaffiliationinferred. JACM12(1)January1965pp23–41;originalscan notnewStanfordedition;CADE-13award1996.",
  "title": "https://web.stanford.edu/class/linguist289/robinson65.pdf",
  "url": "https://web.stanford.edu/class/linguist289/robinson65.pdf"
}

Originalpaperabstract pixels/read, not completenessproofrederived; professional-societyawardcredit.

SocietyexactfullformJohnAlanRobinson plusJ.AlanRobinson recipientlisting connectsoriginalpaperJ.A.Robinson; no Stanfordaffiliationinferred.

JACM12(1)January1965pp23–41;originalscan notnewStanfordedition;CADE-13award1996.

Originalpaperabstract pixels/read, not completenessproofrederived; professional-societyawardcredit.

SocietyexactfullformJohnAlanRobinson plusJ.AlanRobinson recipientlisting connectsoriginalpaperJ.A.Robinson; no Stanfordaffiliationinferred.

JACM12(1)January1965pp23–41;originalscan notnewStanfordedition;CADE-13award1996.

Dates

{}

George Austin

George Austin coauthored A Study of Thinking (1956) with Jerome S. Bruner and Jacqueline J. Goodnow.

Their joint study investigated categorization and concept attainment through experiments on the strategies people use to organize information.

The book helped establish human thinking as a central subject of the 1950s cognitive revolution.

Sources and details

https://wellcomecollection.org/works/hky8k63j

{
  "id": "person-georgeaustin::SRC1",
  "source_identity_and_version_scope": "Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original. Independent source-bound conditional option; not applied. Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.",
  "title": "https://wellcomecollection.org/works/hky8k63j",
  "url": "https://wellcomecollection.org/works/hky8k63j"
}

https://stevenpinker.com/presentations/cognitive-revolution-fifty-plus-or-minus-one

{
  "id": "person-georgeaustin::SRC2",
  "source_identity_and_version_scope": "Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original. Independent source-bound conditional option; not applied. Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.",
  "title": "https://stevenpinker.com/presentations/cognitive-revolution-fifty-plus-or-minus-one",
  "url": "https://stevenpinker.com/presentations/cognitive-revolution-fifty-plus-or-minus-one"
}

https://www.routledge.com/A-Study-of-Thinking/Bruner/p/book/9781315083223

{
  "id": "person-georgeaustin::SRC3",
  "source_identity_and_version_scope": "Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original. Independent source-bound conditional option; not applied. Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.",
  "title": "https://www.routledge.com/A-Study-of-Thinking/Bruner/p/book/9781315083223",
  "url": "https://www.routledge.com/A-Study-of-Thinking/Bruner/p/book/9781315083223"
}

Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.

Independent source-bound conditional option; not applied. Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.

Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.

Independent source-bound conditional option; not applied. Joint authorship only; no individual experimental role or expansion of A. Publisher author field Anton Zijderveld conflicts with actual catalog identity and is excluded. 1986 reprint wrapper differs from 1956 original.

Dates

{}

Thomas Evans

Thomas G. Evans developed an early geometric-analogy program while a graduate student at MIT.

In Minsky's account, the program described figures, inferred a transformation between one pair, and applied a corresponding transformation to choose an answer for another figure.

It could revise its descriptions when an answer was ambiguous, but its competence was confined to that problem class and it did not learn from experience.

Sources and details

https://www.mit.edu/~dxh/marvin/web.media.mit.edu/~minsky/eb6.html

{
  "id": "person-thomasevans::SRC1",
  "source_identity_and_version_scope": "Use author draft scope, not final book edition assertion; 1963 program and later publication dates differ.",
  "title": "https://www.mit.edu/~dxh/marvin/web.media.mit.edu/~minsky/eb6.html",
  "url": "https://www.mit.edu/~dxh/marvin/web.media.mit.edu/~minsky/eb6.html"
}

Use author draft scope, not final book edition assertion; 1963 program and later publication dates differ.

Use author draft scope, not final book edition assertion; 1963 program and later publication dates differ.

Dates

{}

Dean Edmunds

Dean Edmonds collaborated with Marvin Minsky on an early neural-network learning machine.

Minsky remembered him as a Princeton physics graduate student with strong electronics expertise who helped build the device in the summer of 1951.

Their collaboration put reinforcement-learning ideas into a physical network of simulated neurons and adjustable connections.

Sources and details

https://www.webofstories.com/play/marvin.minsky/136

{
  "id": "person-deanedmunds::SRC1",
  "source_identity_and_version_scope": "Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred. Independent source-bound conditional option; not applied. Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.",
  "title": "https://www.webofstories.com/play/marvin.minsky/136",
  "url": "https://www.webofstories.com/play/marvin.minsky/136"
}

https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html

{
  "id": "person-deanedmunds::SRC2",
  "source_identity_and_version_scope": "Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred. Independent source-bound conditional option; not applied. Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.",
  "title": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html",
  "url": "https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html"
}

https://www.newyorker.com/magazine/1981/12/14/a-i

{
  "id": "person-deanedmunds::SRC3",
  "source_identity_and_version_scope": "Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred. Independent source-bound conditional option; not applied. Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.",
  "title": "https://www.newyorker.com/magazine/1981/12/14/a-i",
  "url": "https://www.newyorker.com/magazine/1981/12/14/a-i"
}

Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.

Independent source-bound conditional option; not applied. Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.

Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.

Independent source-bound conditional option; not applied. Source-form display Dean Edmonds may be proposed while keeping stable person-deanedmunds id and historical Edmunds source variant. Retain 1950 versus 1951 and funding-agency discrepancies; no Dartmouth participation or later biography inferred.

Dates

{}

City, Clifford D. Simak

City imagines a future Earth where intelligent dogs preserve stories of the humans who have departed.

Given speech by Bruce Webster, the dogs transmit human history to their pups through generations of storytelling.

Jenkins, an enduring service robot, helps their peaceful society, which nevertheless faces threats including surviving humans.

Sources and details

https://openroadmedia.com/ebook/city/9781504012942

{
  "id": "work-culture-1f89f4c5590f60::SRC1",
  "source_identity_and_version_scope": "Publisher synopsis scope; no reading of complete novel or robot feasibility claim.",
  "title": "https://openroadmedia.com/ebook/city/9781504012942",
  "url": "https://openroadmedia.com/ebook/city/9781504012942"
}

Publisher synopsis scope; no reading of complete novel or robot feasibility claim.

Publisher synopsis scope; no reading of complete novel or robot feasibility claim.

Dates

{
  "date_events": [],
  "date_note": "1952 collected/fix-up book; component stories appeared earlier, beginning 1944.",
  "dated": true,
  "year": 1952
}

Alphaville

Jean-Luc Godard's Alphaville sends secret agent Lemmy Caution into a technocratic city governed by the computer Alpha 60.

Posing as a journalist, he seeks to eliminate Professor von Braun and destroy the computer that organizes the city's social life.

The regime suppresses individuality and prohibits emotional expression, making computer-imposed order a threat to human freedom.

Sources and details

https://www.bfi.org.uk/features/jean-luc-godards-dystopian-sci-fi-classic-alphaville-turns-50

{
  "id": "work-culture-58f3b26280b574::SRC1",
  "source_identity_and_version_scope": "BFI critical synopsis is secondary account, not direct film inspection. If strict original creator/distributor-only admission is required, retain source-genre hold.",
  "title": "https://www.bfi.org.uk/features/jean-luc-godards-dystopian-sci-fi-classic-alphaville-turns-50",
  "url": "https://www.bfi.org.uk/features/jean-luc-godards-dystopian-sci-fi-classic-alphaville-turns-50"
}

BFI critical synopsis is secondary account, not direct film inspection. If strict original creator/distributor-only admission is required, retain source-genre hold.

BFI critical synopsis is secondary account, not direct film inspection. If strict original creator/distributor-only admission is required, retain source-genre hold.

Dates

{
  "date_events": [],
  "date_note": "Original-release year; later reissues do not replace it.",
  "dated": true,
  "year": 1965
}

Horizon Zero Dawn

Horizon Zero Dawn follows Aloy through a post-apocalyptic world occupied by enormous machines as she investigates her origins.

She discovers that GAIA, an artificial-intelligence terraforming system, rebuilt Earth's biosphere after the Faro machines destroyed it.

A rogue component called HADES threatens renewed extinction, and Aloy seeks the means to stop it.

Sources and details

https://www.playstation.com/en-us/editorial/horizon-zero-dawn-the-story-so-far/

{
  "id": "work-coverage-dd35b6f12db553::SRC1",
  "source_identity_and_version_scope": "Retrospective original-game plot; do not relabel this as sequel plot.",
  "title": "https://www.playstation.com/en-us/editorial/horizon-zero-dawn-the-story-so-far/",
  "url": "https://www.playstation.com/en-us/editorial/horizon-zero-dawn-the-story-so-far/"
}

Retrospective original-game plot; do not relabel this as sequel plot.

Retrospective original-game plot; do not relabel this as sequel plot.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2017
}

Mass Effect trilogy

The Mass Effect trilogy follows Commander Shepard across Mass Effect, Mass Effect 2, and Mass Effect 3.

Shepard's central mission is to unite the galaxy against the Reapers, an ancient fleet of advanced sentient starships.

Player decisions shape relationships, alliances, and the futures of entire civilizations.

Sources and details

https://help.ea.com/en//articles/mass-effect/mass-effect-legendary-edition/get-help/

{
  "id": "work-coverage-18e9264dedf4bd::SRC1",
  "source_identity_and_version_scope": "Official remaster overview supports original trilogy; do not claim original publication dates from 2021 collection.",
  "title": "https://help.ea.com/en//articles/mass-effect/mass-effect-legendary-edition/get-help/",
  "url": "https://help.ea.com/en//articles/mass-effect/mass-effect-legendary-edition/get-help/"
}

Official remaster overview supports original trilogy; do not claim original publication dates from 2021 collection.

Official remaster overview supports original trilogy; do not claim original publication dates from 2021 collection.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 2007
}

Johnny Mnemonic

Johnny Mnemonic follows a courier who carries valuable data in an implant in his brain.

He has sacrificed childhood memories for storage capacity, and the information he carries threatens to destroy his mind.

Johnny teams up with Jane and the rebel group known as the LoTeks.

Sources and details

https://www.sonypictures.com/movies/johnnymnemonic

{
  "id": "work-coverage-87c9fbc3ea4794::SRC1",
  "source_identity_and_version_scope": "Original AI/cure claim held; replacement strictly official participant synopsis and must receive new sentence evidence mapping. No Longo credit approval from these sources.",
  "title": "https://www.sonypictures.com/movies/johnnymnemonic",
  "url": "https://www.sonypictures.com/movies/johnnymnemonic"
}

https://dinameyer.com/portfolio/johnny-mnemonic/

{
  "id": "work-coverage-87c9fbc3ea4794::SRC2",
  "source_identity_and_version_scope": "Original AI/cure claim held; replacement strictly official participant synopsis and must receive new sentence evidence mapping. No Longo credit approval from these sources.",
  "title": "https://dinameyer.com/portfolio/johnny-mnemonic/",
  "url": "https://dinameyer.com/portfolio/johnny-mnemonic/"
}

https://www.criterion.com/current/posts/8225-the-replacements-ai-in-the-movies

{
  "id": "work-coverage-87c9fbc3ea4794::SRC3",
  "source_identity_and_version_scope": "Original AI/cure claim held; replacement strictly official participant synopsis and must receive new sentence evidence mapping. No Longo credit approval from these sources.",
  "title": "https://www.criterion.com/current/posts/8225-the-replacements-ai-in-the-movies",
  "url": "https://www.criterion.com/current/posts/8225-the-replacements-ai-in-the-movies"
}

Original AI/cure claim held; replacement strictly official participant synopsis. No Longo credit approval from these sources.

Original AI/cure claim held; replacement strictly official participant synopsis. No Longo credit approval from these sources.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1995
}

Hackers

Iain Softley's Hackers follows Dade Murphy and a group of young computer hackers.

When Joey discovers a virus aimed at an oil company's systems, the group encounters security chief and former hacker Eugene Belford, who is concealing a major financial crime.

Belford frames the young hackers, forcing them to use their programming skills to stop him.

Sources and details

https://www.capelight.de/hackers

{
  "id": "work-coverage-c06028ef6fe5ed::SRC1",
  "source_identity_and_version_scope": "Distributor film synopsis scope, no independent AI capability claim.",
  "title": "https://www.capelight.de/hackers",
  "url": "https://www.capelight.de/hackers"
}

Distributor film synopsis scope, no independent AI capability claim.

Distributor film synopsis scope, no independent AI capability claim.

Dates

{
  "date_note": "",
  "dated": true,
  "year": 1995
}

Understand, Ted Chiang

Understand follows Leon, a coma patient who undergoes a new medical procedure after an accident.

His enhanced intelligence allows him to devise ways of evading the CIA.

Chiang describes the protagonist as learning to reprogram his own mind while searching for a language suited to his new forms of thought.

Sources and details

https://www.bbc.co.uk/programmes/b007jtyf

{
  "id": "work-culture-4dd57c1e821808::SRC1",
  "source_identity_and_version_scope": "BBC adaptation synopses plus direct author interview, not full original story. Retain original-work/adaptation scope distinction.",
  "title": "https://www.bbc.co.uk/programmes/b007jtyf",
  "url": "https://www.bbc.co.uk/programmes/b007jtyf"
}

https://www.bbc.co.uk/programmes/b007s7x3

{
  "id": "work-culture-4dd57c1e821808::SRC2",
  "source_identity_and_version_scope": "BBC adaptation synopses plus direct author interview, not full original story. Retain original-work/adaptation scope distinction.",
  "title": "https://www.bbc.co.uk/programmes/b007s7x3",
  "url": "https://www.bbc.co.uk/programmes/b007s7x3"
}

https://www.newyorker.com/culture/persons-of-interest/ted-chiangs-soulful-science-fiction

{
  "id": "work-culture-4dd57c1e821808::SRC3",
  "source_identity_and_version_scope": "BBC adaptation synopses plus direct author interview, not full original story. Retain original-work/adaptation scope distinction.",
  "title": "https://www.newyorker.com/culture/persons-of-interest/ted-chiangs-soulful-science-fiction",
  "url": "https://www.newyorker.com/culture/persons-of-interest/ted-chiangs-soulful-science-fiction"
}

BBC adaptation synopses plus direct author interview, not full original story. Retain original-work/adaptation scope distinction.

BBC adaptation synopses plus direct author interview, not full original story. Retain original-work/adaptation scope distinction.

Dates

{
  "date_events": [],
  "date_note": "Human enhancement, not AI itself; August 1991 Asimov's. Bibliographic support is secondary pending original issue.",
  "dated": true,
  "year": 1991
}

Westworld season 3

Westworld's third season brings Dolores into the human world beyond the park.

Co-creator Jonathan Nolan contrasts Bernard's fear that she intends to destroy that world with Dolores's claim that she wants to liberate it.

Co-creator Lisa Joy describes her campaign against Incite as potentially turning humanity's own technology against its owners.

Sources and details

https://www.thewrap.com/westworld-incite-dolores-rehoboam-dolores-plan-season-3-premiere/

{
  "id": "work-culture-5188b5b4cdd151::SRC1",
  "source_identity_and_version_scope": "Creators interview at premiere, attribution and potential preserved; full-season viewing not asserted.",
  "title": "https://www.thewrap.com/westworld-incite-dolores-rehoboam-dolores-plan-season-3-premiere/",
  "url": "https://www.thewrap.com/westworld-incite-dolores-rehoboam-dolores-plan-season-3-premiere/"
}

https://press.wbd.com/us/property/westworld/synopses

{
  "id": "work-culture-5188b5b4cdd151::SRC2",
  "source_identity_and_version_scope": "Creators interview at premiere, attribution and potential preserved; full-season viewing not asserted.",
  "title": "https://press.wbd.com/us/property/westworld/synopses",
  "url": "https://press.wbd.com/us/property/westworld/synopses"
}

https://press.wbd.com/na/media-release/hbo-0/westworld/westworld-returns-march-15

{
  "id": "work-culture-5188b5b4cdd151::SRC3",
  "source_identity_and_version_scope": "Creators interview at premiere, attribution and potential preserved; full-season viewing not asserted.",
  "title": "https://press.wbd.com/na/media-release/hbo-0/westworld/westworld-returns-march-15",
  "url": "https://press.wbd.com/na/media-release/hbo-0/westworld/westworld-returns-march-15"
}

Creators interview at premiere, attribution and potential preserved; full-season viewing not asserted.

Creators interview at premiere, attribution and potential preserved; full-season viewing not asserted.

Dates

{
  "date_events": [],
  "date_note": "Season 3 began March 15, 2020. Rehoboam belongs to this season’s focus, not season 2. Creators are series-level credits.",
  "dated": true,
  "year": 2020
}